### Abstract

A translationallattice packing of £polygons P_{1}, P_{2}, P_{k}, ..., 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 language | English (US) |
---|---|

Pages (from-to) | 205-222 |

Number of pages | 18 |

Journal | Computational Geometry: Theory and Applications |

Volume | 22 |

Issue number | 1-3 |

State | Published - 2002 |

### Fingerprint

### 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.

Research output: Contribution to journal › Article

*Computational Geometry: Theory and Applications*, vol. 22, no. 1-3, pp. 205-222.

}

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

AN - SCOPUS:31244437676

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 -