Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 11 - 20
of
4,350
An algebraic approach to rectangle packing
, 2008
"... A method for converting the geometrical problem of rectangle packing to an algebraic problem of solving a system of nonlinear equations is described. There are many interesting infinite rectangle packing problems that are studied. Some of them are: Packing of rectangles with side lengths ( 1 n, 1 n+ ..."
Abstract
- Add to MetaCart
A method for converting the geometrical problem of rectangle packing to an algebraic problem of solving a system of nonlinear equations is described. There are many interesting infinite rectangle packing problems that are studied. Some of them are: Packing of rectangles with side lengths ( 1 n, 1 n
Digital Object Identifier (DOI) 10.1007/s10107-003-0427-1 Math. Program., Ser. B 97: 543–569 (2003)
"... Local search algorithms for the rectangle packing problem with general spatial costs ..."
Abstract
- Add to MetaCart
Local search algorithms for the rectangle packing problem with general spatial costs
New Improvements in Optimal Rectangle Packing
"... The rectangle packing problem consists of finding an enclosing rectangle of smallest area that can contain a given set of rectangles without overlap. Our algorithm picks the x-coordinates of all the rectangles before picking any of the y-coordinates. For the x-coordinates, we present a dynamic varia ..."
Abstract
-
Cited by 4 (2 self)
- Add to MetaCart
The rectangle packing problem consists of finding an enclosing rectangle of smallest area that can contain a given set of rectangles without overlap. Our algorithm picks the x-coordinates of all the rectangles before picking any of the y-coordinates. For the x-coordinates, we present a dynamic
Maximizing the Total Profit of Rectangles Packed into a Rectangle
, 2007
"... We consider the following rectangle packing problem. Given a set of rectangles, each of which is associated with a profit, we are requested to pack a subset of the rectangles into a bigger rectangle so that the total profit of rectangles packed is maximized. The rectangles may not overlap. This pr ..."
Abstract
-
Cited by 14 (4 self)
- Add to MetaCart
We consider the following rectangle packing problem. Given a set of rectangles, each of which is associated with a profit, we are requested to pack a subset of the rectangles into a bigger rectangle so that the total profit of rectangles packed is maximized. The rectangles may not overlap
VLSI module placement based on rectangle-packing by the sequence pair
- IEEE TRANS. ON CAD
, 1996
"... The earliest and the most critical stage in VLSI layout design is the placement. The background of which is the rectangle packing problem: Given set of rectangular modules of arbitrary sizes, place them without overlap on a plane within a rectangle of minimum area. Since the variety of the packing ..."
Abstract
-
Cited by 131 (7 self)
- Add to MetaCart
The earliest and the most critical stage in VLSI layout design is the placement. The background of which is the rectangle packing problem: Given set of rectangular modules of arbitrary sizes, place them without overlap on a plane within a rectangle of minimum area. Since the variety of the packing
Convex Position Estimation in Wireless Sensor Networks
"... A method for estimating unknown node positions in a sensor network based exclusively on connectivity-induced constraints is described. Known peer-to-peer communication in the network is modeled as a set of geometric constraints on the node positions. The global solution of a feasibility problem fo ..."
Abstract
-
Cited by 493 (0 self)
- Add to MetaCart
unknown nodes in the network is given. The area of the bounding rectangles decreases as additional or tighter constraints are included in the problem. Specific models are suggested and simulated for isotropic and directional communication, representative of broadcast-based and optical transmission
Optimal packing of high-precision rectangles
- In
, 2011
"... The rectangle-packing problem consists of finding an enclosing rectangle of smallest area that can contain a given set of rectangles without overlap. Our new benchmark includes rectangles of successively higher precision, a problem for the previous state-of-the-art, which enumerates all locations fo ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
The rectangle-packing problem consists of finding an enclosing rectangle of smallest area that can contain a given set of rectangles without overlap. Our new benchmark includes rectangles of successively higher precision, a problem for the previous state-of-the-art, which enumerates all locations
On Approximating Rectangle Tiling and Packing
- Proc Symp. on Discrete Algorithms (SODA
"... Our study of tiling and packing with rectangles in twodimensional regions is strongly motivated by applications in database mining, histogram-based estimation of query sizes, data partitioning, and motion estimation in video compression by block matching, among others. An example of the problems tha ..."
Abstract
-
Cited by 47 (6 self)
- Add to MetaCart
Our study of tiling and packing with rectangles in twodimensional regions is strongly motivated by applications in database mining, histogram-based estimation of query sizes, data partitioning, and motion estimation in video compression by block matching, among others. An example of the problems
On Packing Of Squares Into A Rectangle
, 1996
"... . It is proved in this paper that any system of squares with total area 1 may be packed into a rectangle whose area is less then 1:53: The following problem is formulated in [7]: Determine the smallest number S such that any system of squares with total area 1 may be (parallelly) packed into a rect ..."
Abstract
-
Cited by 5 (0 self)
- Add to MetaCart
. It is proved in this paper that any system of squares with total area 1 may be packed into a rectangle whose area is less then 1:53: The following problem is formulated in [7]: Determine the smallest number S such that any system of squares with total area 1 may be (parallelly) packed into a
Solving the multiple-instance problem with axis-parallel rectangles
- Artificial Intelligence
, 1997
"... ..."
Results 11 - 20
of
4,350
