Contact numbers for congruent sphere packings in Euclidean 3-space
From MaRDI portal
Publication:452008
DOI10.1007/S00454-012-9405-9zbMATH Open1259.52013arXiv1102.1198OpenAlexW2170193516MaRDI QIDQ452008FDOQ452008
Publication date: 19 September 2012
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Abstract: Continuing the investigations of Harborth (1974) and the author (2002) we study the following two rather basic problems on sphere packings. Recall that the contact graph of an arbitrary finite packing of unit balls (i.e., of an arbitrary finite family of non-overlapping unit balls) in Euclidean 3-space is the (simple) graph whose vertices correspond to the packing elements and whose two vertices are connected by an edge if the corresponding two packing elements touch each other. One of the most basic questions on contact graphs is to find the maximum number of edges that a contact graph of a packing of n unit balls can have in Euclidean 3-space. Our method for finding lower and upper estimates for the largest contact numbers is a combination of analytic and combinatorial ideas and it is also based on some recent results on sphere packings. Finally, we are interested also in the following more special version of the above problem. Namely, let us imagine that we are given a lattice unit sphere packing with the center points forming the lattice L in Euclidean 3-space (and with certain pairs of unit balls touching each other) and then let us generate packings of n unit balls such that each and every center of the n unit balls is chosen from L. Just as in the general case we are interested in finding good estimates for the largest contact number of the packings of n unit balls obtained in this way.
Full work available at URL: https://arxiv.org/abs/1102.1198
densityisoperimetric inequalitycongruent sphere packingcontact numberspherical cap packingtruncated Voronoi cellunion of balls
Cites Work
- A proof of the Kepler conjecture
- The isoperimetric inequality
- Title not available (Why is that?)
- Title not available (Why is that?)
- Average kissing numbers for non-congruent sphere packings
- Das Problem der dreizehn Kugeln
- Title not available (Why is that?)
- On the maximum number of touching pairs in a finite packing of translates of a convex body
- Kreislagerungen auf Flächen konstanter Krümmung
- On a stronger form of Roger's lemma and the minimum surface area of Voronoi cells in unit ball packings
Cited In (11)
- Towards a proof of the 24-cell conjecture
- Kissing number in non-Euclidean spaces of constant sectional curvature
- Contact graphs of ball packings
- Selected Open Problems in Discrete Geometry and Optimization
- ON CONTACT NUMBERS OF LOCALLY SEPARABLE UNIT SPHERE PACKINGS
- On contact numbers of totally separable unit sphere packings
- Average kissing numbers for non-congruent sphere packings
- Contact graphs of unit sphere packings revisited
- Density bounds for outer parallel domains of unit ball packings
- General penny graphs are at most \(\frac{43}{18}\)-dense
- An efficient solution space exploring and descent method for packing equal spheres in a sphere
Uses Software
Recommendations
- On contact numbers of totally separable unit sphere packings 👍 👎
- ON CONTACT NUMBERS OF LOCALLY SEPARABLE UNIT SPHERE PACKINGS 👍 👎
- Contact graphs of unit sphere packings revisited 👍 👎
- Sphere packing in R 3 👍 👎
- On the Density of Packings of Spheres in Spherical 3-Space* 👍 👎
- Sphere packings and space filling by congruent simple polyhedra 👍 👎
- New packings on a finite-dimensional Euclidean sphere 👍 👎
- Sphere packings. III: Extremal cases 👍 👎
- Title not available (Why is that?) 👍 👎
This page was built for publication: Contact numbers for congruent sphere packings in Euclidean 3-space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q452008)
