This paper introduces a technique for proving the local optimality of packing configurations. Applying this technique to a general convex polygon, we prove that the construction of the optimal double lattice packing by Kuperberg and Kuperberg is also locally optimal in the full space of packings.
|Journal||Discrete & computational geometry|
|Publication status||Published - 2016|
- 52C15 52C17 11H31 52B55 05B40
ASJC Scopus subject areas
- Geometry and Topology
Treatment code (Nähere Zuordnung)