Contact graphs of unit sphere packings revisited

@article{Bezdek2012ContactGO,
  title={Contact graphs of unit sphere packings revisited},
  author={K{\'a}roly Bezdek and Samuel Reid},
  journal={Journal of Geometry},
  year={2012},
  volume={104},
  pages={57-83}
}
The contact graph of an arbitrary finite packing of 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 this paper, improving earlier estimates, we prove that the number of touching pairs… 
Contact Numbers for Sphere Packings
In discrete geometry, the contact number of a given finite number of non-overlapping spheres was introduced as a generalization of Newton’s kissing number. This notion has not only led to interesting
Contact Representations of Graphs in 3D
TLDR
It is shown that for every 3-connected planar graph, there exists a simultaneous representation of the graph and its dual with 3D boxes, and a linear-time algorithm is given for constructing such a representation.
Some Problems on Graphs and Arrangements of Convex Bodies
TLDR
The covering index of a convex body is introduced as a measure of how economically the body can be covered by a relatively few smaller positive homothetic copies and the maximum contact numbers of totally separable translative packings of a smooth strictly convex domain are considered.
Upper Bounds for Non-Congruent Sphere Packings
We prove upper bounds on the average kissing number $k(\mathcal{P})$ and contact number $C(\mathcal{P})$ of an arbitrary finite non-congruent sphere packing $\mathcal{P}$, and prove an upper bound on
Kissing number in non-Euclidean spaces of constant sectional curvature
TLDR
Upper and lower bounds on the kissing number of congruent radius $r > 0$ spheres in hyperbolic $\mathbb{H}^n$ and spherical $S}n$ spaces are provided, as well as lower bounds coming from concrete spherical codes.
Graphs and spherical two-distance sets
  • O. Musin
  • Computer Science, Mathematics
    Eur. J. Comb.
  • 2019
TLDR
One of the main results of the paper are explicit formulas for the representation numbers of the join of graphs which are obtained from W. Kuperberg’s type theorem for two-distance sets.
Combinatorial distance geometry in normed spaces
We survey problems and results from combinatorial geometry in normed spaces, concentrating on problems that involve distances. These include various properties of unit-distance graphs,
Regular Totally Separable Sphere Packings
The topic of totally separable sphere packings is surveyed with a focus on regular constructions, uniform tilings, and contact number problems. An enumeration of all regular totally separable sphere
Pixel and Voxel Representations of Graphs
TLDR
It is shown that, for k-outerplanar graphs with n vertices, pixels are always sufficient and sometimes necessary, whereas general planar graphs sometimes need a quadratic number, and representation sizes needed for certain graph classes are bound.
On contact numbers of totally separable unit sphere packings
TLDR
Estimates for the number of contacts in a totally separable packing of n unit balls in Euclidean d -space for all n 1 and d 1 are given.
...
1
2
3
...

References

SHOWING 1-10 OF 21 REFERENCES
Contact Numbers for Congruent Sphere Packings in Euclidean 3-Space
  • K. Bezdek
  • Mathematics, Computer Science
    Discret. Comput. Geom.
  • 2012
The contact graph of an arbitrary finite packing of 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
Representing graphs by disks and balls (a survey of recognition-complexity results)
TLDR
It is proved that the recognition of disk-intersection graphs (in the unbounded ratio case) is NP-hard, and some partial results concerning recognition of ball intersection and contact graphs in higher dimensions are shown.
On the Maximum Number of Touching Pairs in a Finite Packing of Translates of a Convex Body
  • K. Bezdek
  • Computer Science, Mathematics
    J. Comb. Theory, Ser. A
  • 2002
TLDR
Upper bounds for the maximum number of touching pairs in a packing of n translates of a given convex body in Ed, d?3 are given.
Dense Sphere Packings: A Blueprint for Formal Proofs
The 400-year-old Kepler conjecture asserts that no packing of congruent balls in three dimensions can have a density exceeding the familiar pyramid-shaped cannonball arrangement. In this book, a new
Lectures on discrete geometry
  • J. Matousek
  • Computer Science, Mathematics
    Graduate texts in mathematics
  • 2002
TLDR
This book is primarily a textbook introduction to various areas of discrete geometry, in which several key results and methods are explained, in an accessible and concrete manner, in each area.
The isoperimetric inequality
where A is the area enclosed by a curve C of length L, and where equality holds if and only if C is a circle. The purpose of this paper is to recount some of the most interesting of the many
A generalization of the Discrete Isoperimetric Inequality for Piecewise Smooth Curves of Constant Geodesic Curvature
TLDR
The discrete isoperimetric inequality for ``polygons'' on the three planes of constant curvature bounded by arcs of a given constant geodesic curvature is extended.
Low-dimensional lattices. VI. Voronoi reduction of three-dimensional lattices
  • J. Conway, N. Sloane
  • Mathematics
    Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences
  • 1992
The aim of this paper is to describe how the Voronoi cell of a lattice changes as that lattice is continuously varied. The usual treatment is simplified by the introduction of new parameters called
Foundations of Hyperbolic Manifolds
This book is an exposition of the theoretical foundations of hyperbolic manifolds. It is intended to be used both as a textbook and as a reference. The reader is assumed to have a basic knowledge of
Packing and Covering
  • G. Tóth
  • Mathematics, Computer Science
    Handbook of Discrete and Computational Geometry, 2nd Ed.
  • 2004
TLDR
In this age of modern era, the use of internet must be maximized to get the on-line packing and covering book, as the world window, as many people suggest.
...
1
2
3
...