Densest translational lattice packing of non-convex polygons

Victor Milenkovic

Research output: Contribution to journal › Article

8 Citations (Scopus)

Abstract

A translationallattice packing of £polygons P1, P2, Pk, ..., Pk is a (non-overlapping) packing of the k polygons which is replicated without overlap at each point of a lattice /oo + /1 i>i, where i>o and v\ are vectors generating the lattice and /o and i\ range over all integers. A densest translational lattice packing is one which minimizes the area |vo x vi

Original languageEnglish (US)
Pages (from-to)205-222
Number of pages18
JournalComputational Geometry: Theory and Applications
Volume22
Issue number1-3
StatePublished - 2002

Fingerprint

Polygon
Packing
Overlap
Minimise
Integer
Range of data

Keywords

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

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Discrete Mathematics and Combinatorics
  • Geometry and Topology

Cite this

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

In: Computational Geometry: Theory and Applications, Vol. 22, No. 1-3, 2002, p. 205-222.

Research output: Contribution to journal › Article

Milenkovic, V 2002, 'Densest translational lattice packing of non-convex polygons', Computational Geometry: Theory and Applications, vol. 22, no. 1-3, pp. 205-222.
Milenkovic V. Densest translational lattice packing of non-convex polygons. Computational Geometry: Theory and Applications. 2002;22(1-3):205-222.
Milenkovic, Victor. / Densest translational lattice packing of non-convex polygons. In: Computational Geometry: Theory and Applications. 2002 ; Vol. 22, No. 1-3. pp. 205-222.
@article{65782b23e6e447828d5039a8d4d2495b,
title = "Densest translational lattice packing of non-convex polygons",
abstract = "A translationallattice packing of £polygons P1, P2, Pk, ..., Pk is a (non-overlapping) packing of the k polygons which is replicated without overlap at each point of a lattice /oo + /1 i>i, where i>o and v\ are vectors generating the lattice and /o and i\ range over all integers. A densest translational lattice packing is one which minimizes the area |vo x vi",
keywords = "Lattice packing, Layout, Linear programming, Nesting, Packing, Quadratic programming",
author = "Victor Milenkovic",
year = "2002",
language = "English (US)",
volume = "22",
pages = "205--222",
journal = "Computational Geometry: Theory and Applications",
issn = "0925-7721",
publisher = "Elsevier",
number = "1-3",

}

TY - JOUR

T1 - Densest translational lattice packing of non-convex polygons

AU - Milenkovic, Victor

PY - 2002

Y1 - 2002

N2 - A translationallattice packing of £polygons P1, P2, Pk, ..., Pk is a (non-overlapping) packing of the k polygons which is replicated without overlap at each point of a lattice /oo + /1 i>i, where i>o and v\ are vectors generating the lattice and /o and i\ range over all integers. A densest translational lattice packing is one which minimizes the area |vo x vi

AB - A translationallattice packing of £polygons P1, P2, Pk, ..., Pk is a (non-overlapping) packing of the k polygons which is replicated without overlap at each point of a lattice /oo + /1 i>i, where i>o and v\ are vectors generating the lattice and /o and i\ range over all integers. A densest translational lattice packing is one which minimizes the area |vo x vi

KW - Lattice packing

KW - Layout

KW - Linear programming

KW - Nesting

KW - Packing

KW - Quadratic programming

UR - http://www.scopus.com/inward/record.url?scp=31244437676&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=31244437676&partnerID=8YFLogxK

M3 - Article

VL - 22

SP - 205

EP - 222

JO - Computational Geometry: Theory and Applications

JF - Computational Geometry: Theory and Applications

SN - 0925-7721

IS - 1-3

ER -

Access to Document