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 is 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 jv0… (More)
DOI: 10.1016/S0925-7721(01)00051-7

Topics

9 Figures and Tables

Slides referencing similar topics