Penny-packing and two-dimensional codes
From MaRDI portal
Publication:1262539
DOI10.1007/BF02187775zbMath0686.52010OpenAlexW2029921432MaRDI QIDQ1262539
Ronald L. Graham, N. J. A. Sloane
Publication date: 1990
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/131102
Software, source code, etc. for problems pertaining to convex and discrete geometry (52-04) Inequalities and extremum problems involving convexity in convex geometry (52A40) Other types of codes (94B60) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Combinatorial aspects of packing and covering (05B40)
Related Items
Penny-packings with minimal second moments, Minimal-energy clusters of hard spheres, On sublattices of the hexagonal lattice, Dense packings of congruent circles in a circle, Spheres and sausages, crystals and catastrophes -- and a joint packing theory, Communicability Angle and the Spatial Efficiency of Networks, Two-best solutions under distance constraints: The model and exemplary results for matroids, \(k\)-best solutions under distance constraints in valuated \(\Delta\)-matroids
Cites Work
- Unnamed Item
- Holographic algorithms: from art to science
- Über die Einlagerung von Kreisen in einen konvexen Bereich
- An inequality in the geometry of numbers
- Planning a purely translational motion of a convex object in two- dimensional space using generalized Voronoi diagrams
- Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
- Finite sphere packing and sphere covering
- A fast encoding method for lattice codes and quantizers
- Generalized voronoi diagrams for moving a ladder. I: Topological analysis
- New trellis codes based on lattices and cosets
- Crossing-Free Subgraphs
- A Packing Inequality for Compact Convex Subsets of the Plane