TY - CONF
T1 - Densest translational lattice packing of non-convex polygons
AU - Milenkovic, Victor J.
N1 - Funding Information:
✩Expanded version of paper presented at the 16th Annual ACM Symposium on Computational Geometry (Hong Kong, June 2000). E-mail address: vjm@cs.miami.edu (V.J. Milenkovic). URL address: http://www.cs.miami.edu/∼vjm (V.J. Milenkovic). 1This research was funded by the Alfred P. Sloan Foundation through a subcontract from the Harvard Center for Textile and Apparel Research and by NSF grant NSF-CCR-97-12401.
PY - 2000
Y1 - 2000
N2 - A translation lattice packing of k polygons P1, P2, P3, ..., Pk is a (non-overlapping) packing of the k polygons which can be replicated without overlap at each point of a lattice i0v0+i1v1, where v0 and v1 are vectors generating the lattice and i0 and i1 range over all integers. A densest translational lattice packing is one which minimizes the area |v0×v1| of the fundamental parallelogram. An algorithm and implementation is given for densest translation lattice packing. This algorithm has useful applications in industry, particularly clothing manufacture.
AB - A translation lattice packing of k polygons P1, P2, P3, ..., Pk is a (non-overlapping) packing of the k polygons which can be replicated without overlap at each point of a lattice i0v0+i1v1, where v0 and v1 are vectors generating the lattice and i0 and i1 range over all integers. A densest translational lattice packing is one which minimizes the area |v0×v1| of the fundamental parallelogram. An algorithm and implementation is given for densest translation lattice packing. This algorithm has useful applications in industry, particularly clothing manufacture.
UR - http://www.scopus.com/inward/record.url?scp=0033727296&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0033727296&partnerID=8YFLogxK
M3 - Paper
AN - SCOPUS:0033727296
SP - 280
EP - 289
T2 - 16th Annual Symposium on Computational Geometry
Y2 - 12 June 2000 through 14 June 2000
ER -