By rectangle packing we mean putting a set of rectangles into an enclosing rectangle, without any overlapping. We begin with perfect rectangle packing problems, then prove two continuity properties for parallel rectangle packing problems, and discuss how they might be used to obtain negative results for perfect rectangle packing problems.

Consider partitions of a rectangle into rectangles with restricted number of cross sections. The problem has an information theoretic flavor (in the spirit of [3]): richness of two dimensional pictures under 1–dimensional restrictions of from local information to global information. We present two approaches to upper bound the cardinality of such partitions: a combinatorial recursion and harmon...

In this work we present some compact layouts of interconnection networks and their components. The main parameter for optimization is a layout area. Besides, other features like the number of the wire bends and component scalability are also studied and improved, in some cases. We focus on the layouts on a rectilinear grid. More precisely, it is a square grid. We use the Thompson layout model, ...

The use of overset grids in CFD started more than two decades ago, and has achieved tremendous success in handling complex geometries. In particular, overset grids have the advantage of avoiding grid remeshing when dealing with moving boundary flow problems. Traditionally overset grids were mainly used with structured grids to simplify the grid generation process, because a complex computationa...

In this paper, we described a grid-enabled solver for numerical simulations of fluidstructure interaction problems. We use a domain decomposition method such that the whole problem is reduced to an interface equation by requiring solving the structure and the fluid sub-problems independently on each grid node. For realizing this grid-enabled algorithm, a newly designed Client/Server model under...