Densest translational lattice packing of non-convex polygons
نویسنده
چکیده
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 v1j 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.
منابع مشابه
Institute for Mathematical Physics Densest Lattice Packings of 3{polytopes Densest Lattice Packings of 3{polytopes
Based on Minkowski's work on critical lattices of 3-dimensional convex bodies we present an eecient algorithm for computing the density of a densest lattice packing of an arbitrary 3-polytope. As an application we calculate densest lattice packings of all regular and Archimedean polytopes.
متن کاملMaximally dense packings of two-dimensional convex and concave noncircular particles.
Dense packings of hard particles have important applications in many fields, including condensed matter physics, discrete geometry, and cell biology. In this paper, we employ a stochastic search implementation of the Torquato-Jiao adaptive-shrinking-cell (ASC) optimization scheme [Nature (London) 460, 876 (2009)] to find maximally dense particle packings in d-dimensional Euclidean space R(d). W...
متن کاملDensest lattice packings of 3-polytopes
Based on Minkowski’s work on critical lattices of 3-dimensional convex bodies we present an efficient algorithm for computing the density of a densest lattice packing of an arbitrary 3-polytope. As an application we calculate densest lattice packings of all regular and Archimedean polytopes.
متن کاملDensest Packings of More than Three d -Spheres Are Nonplanar
We prove that for a densest packing of more than three d–balls, d ≥ 3, where the density is measured by parametric density, the convex hull of their centers is either linear (a sausage) or at least 3–dimensional. This is also true for restrictions to lattice packings. The proofs require a Lagrange–type theorem from number theory and Minkowski’s theory of mixed volumes.
متن کاملOptimal packings of superdisks and the role of symmetry.
Almost all studies of the densest particle packings consider convex particles. Here, we provide exact constructions for the densest known two-dimensional packings of superdisks whose shapes are defined by |x{1}|{2p}+|x{2}|{2p}or=0.5) and concave (0<p<0.5) particles. Our candidate maximal packing arrangements are achieved by certain familie...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Comput. Geom.
دوره 22 شماره
صفحات -
تاریخ انتشار 2002