Densest translational lattice packing of non-convex polygons

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Abstract

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)
Title of host publicationProceedings of the Annual Symposium on Computational Geometry
PublisherACM
Pages280-289
Number of pages10
StatePublished - 2000
Event16th Annual Symposium on Computational Geometry - Hong Kong, Hong Kong
Duration: Jun 12 2000Jun 14 2000

Other

Other16th Annual Symposium on Computational Geometry
CityHong Kong, Hong Kong
Period6/12/006/14/00

Fingerprint

Polygon
Packing
Garment manufacture
Parallelogram
Overlap
Industry
Minimise
Integer
Range of data

ASJC Scopus subject areas

  • Chemical Health and Safety
  • Software
  • Safety, Risk, Reliability and Quality
  • Geometry and Topology

Cite this

Milenkovic, V. (2000). Densest translational lattice packing of non-convex polygons. In Proceedings of the Annual Symposium on Computational Geometry (pp. 280-289). ACM.

Densest translational lattice packing of non-convex polygons. / Milenkovic, Victor.

Proceedings of the Annual Symposium on Computational Geometry. ACM, 2000. p. 280-289.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Milenkovic, V 2000, Densest translational lattice packing of non-convex polygons. in Proceedings of the Annual Symposium on Computational Geometry. ACM, pp. 280-289, 16th Annual Symposium on Computational Geometry, Hong Kong, Hong Kong, 6/12/00.
Milenkovic V. Densest translational lattice packing of non-convex polygons. In Proceedings of the Annual Symposium on Computational Geometry. ACM. 2000. p. 280-289
Milenkovic, Victor. / Densest translational lattice packing of non-convex polygons. Proceedings of the Annual Symposium on Computational Geometry. ACM, 2000. pp. 280-289
@inproceedings{ff4cd5c4123048e9b5a7173a189ed313,
title = "Densest translational lattice packing of non-convex polygons",
abstract = "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.",
author = "Victor Milenkovic",
year = "2000",
language = "English (US)",
pages = "280--289",
booktitle = "Proceedings of the Annual Symposium on Computational Geometry",
publisher = "ACM",

}

TY - GEN

T1 - Densest translational lattice packing of non-convex polygons

AU - Milenkovic, Victor

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 - Conference contribution

SP - 280

EP - 289

BT - Proceedings of the Annual Symposium on Computational Geometry

PB - ACM

ER -