Covering and Packing with Spheres by Diagonal Distortion in ℝ n

DOI10.1007/978-3-642-19391-0_2zbMath1277.52019OpenAlexW2191543001MaRDI QIDQ3003468

Michael Kerber, Herbert Edelsbrunner

Publication date: 27 May 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-19391-0_2

zbMATH Keywords

coveringspherescubespackinglatticesballs\(n\)-dimensional Euclidean space

Mathematics Subject Classification ID

Structure theory of lattices (06B05) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Related Items (2)

On the Optimality of the FCC Lattice for Soft Sphere Packing ⋮ Delaunay simplices in diagonally distorted lattices

Uses Software

• kepler98

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dual complexes of cubical subdivisions of \({\mathbb{R}}^{n}\)
• Computational approaches to lattice packing and covering problems
• The minimum values of positive quadratic forms in six, seven and eight variables
• A proof of the Kepler conjecture
• Simplizialzerlegungen von beschränkter Flachheit
• Geometry and Topology for Mesh Generation
• Some Combinatorial Lemmas in Topology
• The densest lattice in twenty-four dimensions
• Notes on Sphere Packings
• Local Covering Optimality of Lattices: Leech Lattice versus Root Lattice E8
• The Number of Circles Covering a Set

This page was built for publication: Covering and Packing with Spheres by Diagonal Distortion in ℝ n