Related papers: A Simple Proof of Thue's Theorem on Circle Packing
This paper proves a deformation circle pattern theorem, which gives a complete description of those circle patterns with interstices in terms of the combinatorial type, the exterior intersections angles and the conformal structures of…
This paper provides the currently best known upper bound on the density of a packing in three-dimensional Euclidean space of two types of spheres whose size ratio is the largest one that allows the insertion of a small sphere in each…
Delaunay triangulations of a point set in the Euclidean plane are ubiquitous in a number of computational sciences, including computational geometry. Delaunay triangulations are not well defined as soon as 4 or more points are concyclic but…
A Bl-packing is a (branched) circle packing that ``properly covers'' the unit disc. We establish some fundamental properties of such packings. We give necessary and sufficient conditions for their existence, prove their uniqueness, and show…
We aim to give a strict proof of the existence and uniqueness of the weighted Voronoi decomposition and the dual weighted Delaunay triangulation on Euclidean and hyperbolic polyhedral surface as well as hyperbolic surface with geodesic…
In the classic circle packing problem, one asks whether a given set of circles can be packed into a given container. Packing problems like this have been shown to be $\mathsf{NP}$-hard. In this paper, we present new sufficient conditions…
The Circle Pattern Theorem characterizes the existence and rigidity of circle patterns with prescribed intersection angles on simplicial triangulations of closed surfaces. In this paper we extend the theorem to quasi-simplicial…
Circle packings are arrangement of circles satisfying specified tangency requirements. Many problems about packing of circles and spheres occur in nature particularly in material design and protein structure. Surprisingly, little is known…
This article is a gentle introduction to the mathematical area known as circle packing, the study of the kinds of patterns that can be formed by configurations of non-overlapping circles. The first half of the article is an exposition of…
In "Dense Sphere Packings: A Blueprint for Formal Proofs" Hales proves that for every packing of unit spheres, the density in a ball of radius $r$ is at most $\pi/\sqrt{18}+c/r$ for some constant $c$. When $r$ tends to infinity, this gives…
We prove results about uniform convergence of densities in the free central limit theorem without assumptions of boundedness on the support.
Consider a collection of finitely many polygons in $\mathbb C$, such that for each side of each polygon, there exists another side of some polygon in the collection (possibly the same) that is parallel and of equal length. A translation…
Circle packings with specified patterns of tangencies form a discrete counterpart of analytic functions. In this paper we study univalent packings (with a combinatorial closed disk as tangent graph) which are embedded in (or fill) a…
We show that a jammed packing of disks with generic radii, in a generic container, is such that the minimal number of contacts occurs and there is only one dimension of equilibrium stresses. We also point out some connections to packings…
The spread of a finite set of points is the ratio between the longest and shortest pairwise distances. We prove that the Delaunay triangulation of any set of n points in R^3 with spread D has complexity O(D^3). This bound is tight in the…
This article presents a whirlwind tour of some results surrounding the Koebe-Andre'ev-Thurston Theorem, Bill Thurston's seminal circle packing theorem that appears in Chapter 13 of The Geometry and Topology of Three-Manifolds. It will…
The Discrete Schwarz-Pick Lemma is a discrete analogue of the classical result from complex analysis, arising from the connection between circle packings and conformal maps established by Thurston. Previous works by Beardon-Stephanson and…
Proofs of Tychonoff's theorem often seem to require a bit of magic. Machinery such as ultrafilters, nets or maximal families with the finite intersection property are employed to give proofs that can be very neat, but not the kind of thing…
Optimal packing of spheres in $\mathbb R^d$ is studied by optimization of the energy $E$ (effective conductivity) of composites with ideally conducting spherical inclusions. It is demonstrated that the minimum of $E$ over locations of…
We give a purely combinatorial proof of the density Hales--Jewett Theorem that is modeled after Polymath's proof but is significantly simpler. In particular, we avoid the use of the equal-slices measure and work exclusively with the uniform…