Sciweavers

106 search results - page 2 / 22
» Almost Square Packing
Sort
View
PICS
2000
14 years 3 days ago
Comparison of Hexagonal and Square Dot Centers for EP Halftones
Hexagonal dot packing seems to offer benefits for halftone printing compared to conventional square dot packing, but little practical experience has been reported. Taking advantag...
Mila Turbek, Steven F. Weed, Tomasz J. Cholewo, Br...
COMBINATORICS
2000
95views more  COMBINATORICS 2000»
13 years 10 months ago
Improving Dense Packings of Equal Disks in a Square
We describe a new numerical procedure for generating dense packings of disks and spheres inside various geometric shapes. We believe that in some of the smaller cases, these packi...
David W. Boll, Jerry Donovan, Ronald L. Graham, Bo...
SWAT
2004
Springer
117views Algorithms» more  SWAT 2004»
14 years 4 months ago
Maximizing the Number of Packed Rectangles
Given a set of rectangles we are asked to pack as many of them as possible into a bigger rectangle. The rectangles packed may not overlap and may not be rotated. This problem is NP...
Klaus Jansen, Guochuan Zhang
IPCO
2008
129views Optimization» more  IPCO 2008»
14 years 5 days ago
A Polynomial Time Approximation Scheme for the Square Packing Problem
Given a set Q of squares with positive pro ts, the square packing problem is to select and pack a subset of squares of maximum pro t into a rectangular bin R. We present a polynomi...
Klaus Jansen, Roberto Solis-Oba
COMBINATORICS
2002
109views more  COMBINATORICS 2002»
13 years 10 months ago
Efficient Packing of Unit Squares in a Square
Let s(N) denote the edge length of the smallest square in which one can pack N unit squares. A duality method is introduced to prove that s(6) = s(7) = 3. Let nr be the smallest i...
Michael J. Kearney, Peter Shiu