Densest translational lattice packing of non-convex polygons

Research output: Contribution to conferencePaperpeer-review

5 Scopus citations


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.

Original languageEnglish (US)
Number of pages10
StatePublished - 2000
Event16th Annual Symposium on Computational Geometry - Hong Kong, Hong Kong
Duration: Jun 12 2000Jun 14 2000


Other16th Annual Symposium on Computational Geometry
CityHong Kong, Hong Kong

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Geometry and Topology
  • Computational Mathematics


Dive into the research topics of 'Densest translational lattice packing of non-convex polygons'. Together they form a unique fingerprint.

Cite this