Densest translational lattice packing of non-convex polygons

Computational Geometry: Theory and Applications

Volumn 22, Issue 1-3, 2002, Pages 205-222

  Milenkovic, Victor J ^a  

^a University of Miami   (United States)

Author keywords

Lattice packing; Layout; Linear programming; Nesting; Packing; Quadratic programming

Indexed keywords

EID: 31244437676     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(01)00051-7     Document Type: Article

References (15)

1. K. Daniels, Containment algorithms for nonconvex polygons with applications to layout, Ph.D. Thesis, Harvard University, Cambridge, MA, 1995.
2. K. Daniels, V.J. Milenkovic, Multiple translational containment, Part I: An approximate algorithm, Algorithmica 19 (1997) 148-182.
3. D. Dobkin, J. Hershberger, D. Kirkpatrick, S. Suri, Computing the intersection-depth of polyhedra, Algorithmica 9 (1993) 518-533.
4. K. Dowsland, W. Dowsland, Solution approaches to irregular nesting problems, European J. Oper. Res. 84 (3) (1995)506-521.
5. K.A. Dowsland, W.B. Dowsland, Packing problems, European J. Oper. Res. 56 (1992) 2-14.
6. H. Dyckhoff, A typology of cutting and packing problems, European J. Oper. Res. 44 (1990) 145-159.
7. G. Kuperberg, W. Kuperberg, Double-lattice packings of convex bodies in the plane, Discrete Comput. Geom. 5 (1990) 389-397.
8. Z. Li, Compaction algorithms for nonconvex polygons and their applications, Ph.D. Thesis, Harvard University, Cambridge, MA, 1994.
9. Z. Li, V. Milenkovic, Compaction and separation algorithms for nonconvex polygons and their applications, European!. Oper. Res. 84 (1995) 539-561.
10. V. Milenkovic, Translational polygon containment and minimal enclosure using linear programming based restriction, in: Proc. 28th Annual ACM Symp. Theory Comput. (STOC-96), 1996, pp. 109-118.
11. V. Milenkovic, K. Daniels, Translational polygon containment and minimal enclosure using mathematical programming, Internat. Trans. Oper. Res. 6 (1999) 525-554.
12. V.J. Milenkovic, Multiple translational containment, Part II: Exact algorithms, Algorithmica 19 (1997) 183-218.
13. D.M. Mount, The densest double-lattice packing of a convex polygon, Report 2584, Dept. Comput. Sei., Univ. Maryland, College Park, MD, 1991.
14. P.E. Sweeney, E.R. Paternoster, Cutting and packing problems: A categorized, application-oriented research bibliography, J. Oper. Res. Soc. 43 (7) (1992) 691-706.
15. P. Whelan, B. Batchelor, Automated packing systems: Review of industrial implementations, in: Proceedings of the SPIE-The International Society for Optical Engineering, Vol. 2064, SPIE, 1993, pp. 358-369.