An approximation algorithm for dissecting a rectangle into rectangles with specified areas

Discrete Applied Mathematics

Volumn 155, Issue 4, 2007, Pages 523-537

  Nagamochi, Hiroshi ^a   Abe, Yuusuke ^b  

^a KYOTO UNIVERSITY   (Japan)

^b NEC CORPORATION   (Japan)

Author keywords

Approximation algorithm; Aspect ratio; Dissection; Divide and conquer; Facility layout; Floor plan; NP hard; Rectangle

Indexed keywords

APPROXIMATION THEORY; ASPECT RATIO; COMPUTATIONAL COMPLEXITY; FUNCTIONS; OPTIMIZATION; PLANT LAYOUT;

APPROXIMATION ALGORITHM; DISSECTION; DIVIDE-AND-CONQUER; FLOOR PLAN;

ALGORITHMS;

EID: 33846019252     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2006.08.005     Document Type: Article

References (20)

1. Anjos M.F., and Vannelli A. A new mathematical-programming framework for facility-layout design. INFORMS J. Comput. 18 (2006) 111-118
2. Bär G., and Iturriaga C. Rectangle packing in polynomial time. Proceedings of the Fifth Canadian Conference on Computational Geometry. Waterloo, Ontario, Canada (1993) 455-460
3. Beaumont O., Boudet V., Rastello F., and Robert Y. Matrix multiplication on heterogeneous platforms. IEEE Trans. Parallel and Distributed Systems 12 (2001) 1033-1051
4. Beaumont O., Boudet V., Rastello F., and Robert Y. Partitioning a square into rectangles: NP-completeness and approximation algorithms. Algorithmica 34 (2002) 217-239
5. Bose P., Czyzowicz J., Kranakis E., Krizanc D., and Lessard D. Near optimal-partitioning of rectangles and prisms. Proceedings of the 11th Canadian Conference on Computational Geometry. UBC, Vancouver, British Columbia, Canada (1999)
6. Bose P., Czyzowicz J., and Lessard D. Cutting rectangles in equal area pieces. Proceedings of the 10th Canadian Conference on Computational Geometry. McGill University, Montreal, Québec, Canada (1998) 94-95
7. Frederickson G. Dissections Plane and Fancy (1997), Cambridge University Press, Cambridge, MA
8. Graham R.L. Fault-free tilings of rectangles. In: Klarmer D.A. (Ed). The Mathematical Gardner (1981), Wadsworth, Belmont, CA 120-126
9. Gonzalez T.F., Razzari M., Shing M.-T., and Zheng S.-Q. On optimal guillotine partitions approximating optimal d-box partitions. Comput. Geometry 4 (1994) 1-11
10. Gonzalez T.F., and Zheng S.-Q. Improved bounds for rectangular and guillotine partitions. J. Symbolic Comput. 70 (1989) 591-610
11. Itoh T., Yamaguchi Y., Ikehata Y., and Kajinaga Y. Hierarchical data visualization using a fast rectangle-packing algorithm. IEEE Trans. Visual. Comput. Graphics 10 (2004) 302-313
12. Khanna S., Muthukrishnan S., and Paterson M. On approximating rectangle tiling and packing. Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (1998) 384-393
13. Kenyon R. Tiling a rectangle with the fewest squares. J. Combin. Theory A-76 (1996) 272-291
14. Kenyon C., and Kenyon R. Tiling a polygon with rectangles. Proceedings of the 33rd Annual Symposium on Foundations of Computer Science. Pittsburgh, PN (October 1992) 610-619
15. Kong T.Y., Mount D.M., and Roscoe A.W. The decomposition of a rectangle into rectangles of minimal perimeter. SIAM J. Comput. 17 (1988) 1215-1231
16. Kong T.Y., Mount D.M., and Wermann M. The decomposition of a square into rectangles of minimal perimeter. Discrete Appl. Math. 16 (1987) 239-243
17. A. Lingas, R.Y. Pinter, R.L. Rivest, A. Shamir, Minimum edge length partitioning of rectilinear polygons, Proceedings of 20th Annual Allerton Conference on Communication, Control, and Computing, 1982, pp. 53-63.
18. K. Lory, K. Paluch, Rectangle tiling, in: Proceedings of the APPROX2000, Lecture Notes in Computer Science, vol. 1913, Springer, Berlin, 2000, pp. 206-213.
19. Pan P., Shi W., and Liu C.L. Area minimization for hierarchical floorplans. Algorithmica 15 (1996) 550-571
20. Stockmeyer L. Optimal orientations of cells in slicing floorplan designs. Inform. and Control 57 (1983) 91-101