A compact circle-packing $P$ of the Euclidean plane is a set of circles which bound mutually disjoint open discs with the property that, for every circle $S\in P$, there exists a maximal indexed set $\{A_{0},\ldots,A_{n-1}\}\subseteq P$ so that, for every $i\in\{0,\ldots,n-1\}$, the circle $A_{i}$ is tangent to both circles $S$ and $A_{i+1\mod n}.$
We show that there exist at most $13617$ pairs $(r,s)$ with $0<s<r<1$ for which there exist a compact circle-packing of the plane consisting of circles with radii $s$, $r$ and $1$.
We discuss computing the exact values of such $0<s<r<1$ as roots of polynomials and exhibit a selection of compact circle-packings consisting of circles of three radii. We also discuss the apparent infeasibility of computing \emph{all} these values on contemporary consumer hardware with the methods employed in this paper.
We consider packings of congruent circles on a square flat torus, i.e., periodic (w.r.t. a square lattice) planar circle packings, with the maximal circle radius. This problem is interesting due to a practical reason - the problem of "super resolution of images." We have found optimal arrangements for N=6, 7 and 8 circles. Surprisingly, for the case N=7 there are three different optimal arrangements. Our proof is based on a computer enumeration of toroidal irreducible contact graphs.
Recently, we enumerate up to isometry, all locally rigid circle packings on the unit sphere with number of circles N<12. This problem is equivalent to the enumeration of irreducible contact graphs. In this paper we show that by using the list of irreducible graphs can solve various problems of extreme packings such as the Tammes problem for the sphere and the projective plane, the maximal contacts problem, Danzer's and other problems on irreducible contact graphs.
A simple proof of Thue theorem on Circle Packing is given. The proof is only based on density analysis of Delaunay triangulation for the set of points that are centers of circles in a saturated circle configuration.
A notion of random walks for circle packings is introduced. The geometry behind this notion is discussed, together with some applications. In particular, we obtain a short proof of a result regarding the type problem for circle packings, which shows that the type of a circle packing is closely related to the type of its tangency graph.
It has been shown that univalent circle packings filling in the complex plane $\bold C$ are unique up to similarities of $\bold C$. Here we prove that bounded degree branched circle packings properly covering $\bold C$ are uniquely determined, up to similarities of $\bold C$, by their branch sets. In particular, when branch sets of the packings considered are empty we obtain the earlier result. We also establish a circle packing analogue of Liouville's theorem: if $f$ is a circle packing map whose domain packing is infinite, univalent, and has recurrent tangency graph, then the ratio map assoc…
We present a new self-contained proof of the well-known fact that the minimal area of a Voronoi cell in a unit circle packing is equal to $2\sqrt{3}$, and the minimum is achieved only on a perfect hexagon. The proof is short and, in our opinion, instructive.
We consider circle packings in the plane with circles of sizes $1$, $r\simeq 0.834$ and $s\simeq 0.651$. These sizes are algebraic numbers which allow a compact packing, that is, a packing in which each hole is formed by three mutually tangent circles. Compact packings are believed to maximize the density when there are possible. We prove that it is indeed the case for these sizes. The proof should be generalizable to other sizes which allow compact packings and is a first step towards a general result.
In this note we give a simple proof of the classical fact that the hexagonal lattice gives the highest density circle packing among all lattices in $R^2$. With the benefit of hindsight, we show that the problem can be restricted to the important class of well-rounded lattices, on which the density function takes a particularly simple form. Our proof emphasizes the role of well-rounded lattices for discrete optimization problems.
We investigate criteria for circle packing(CP) types of disk triangulation graphs embedded into simply connected domains in $ \mathbb{C}$. In particular, by studying combinatorial curvature and the combinatorial Gauss-Bonnet theorem involving boundary turns, we show that a disk triangulation graph is CP parabolic if \[ \sum_{n=1}^\infty \frac{1}{\sum_{j=0}^{n-1} (k_j +6)} = \infty, \] where $k_n$ is the degree excess sequence defined by \[ k_n = \sum_{v \in B_n} (\mbox{deg}\, v - 6) \] for combinatorial balls $B_n$ of radius $n$ and centered at a fixed vertex. It is also shown that the simple …
In this note, we investigate an infinite one parameter family of circle packings, each with a set of three mutually tangent circles. We use these to generate an infinite set of circle packings with the Apollonian property. That is, every circle in the packing is a member of a cluster of four mutually tangent circles.
We find explicit formulas for the radii and locations of the circles in all the optimally dense packings of two, three or four equal circles on any flat torus, defined to be the quotient of the Euclidean plane by the lattice generated by two independent vectors. We prove the optimality of the arrangements using techniques from rigidity theory and topological graph theory.
The famous Kepler conjecture has a less spectacular, two-dimensional equivalent: The theorem of Thue states that the densest circle packing in the Euclidean plane has a hexagonal structure. A common proof uses Voronoi cells and analyzes their area applying Jensen's inequality on convex functions to receive a local estimate which is globally valid. Based on the concept of Voronoi cells, we will introduce a new tessellation into so-called L-triangles which can be related to fundamental parallelograms of lattice circle packings. Therefore a globally disordered circle packing can be reduced to loc…
Recently, Connelly and Gortler gave a novel proof of the circle packing theorem for tangency packings by introducing a hybrid combinatorial-geometric operation, flip-and-flow, that allows two tangency packings whose contact graphs differ by a combinatorial edge flip to be continuously deformed from one to the other while maintaining tangencies across all of their common edges. Starting from a canonical tangency circle packing with the desired number of circles a finite sequence of flip-and-flow operations may be applied to obtain a circle packing for any desired (proper) contact graph with the…
We use recent advances in circle packing theory to develop a constructive method for the approximation of an analytic function $F:Ω\to \bold C$ by circle packing maps providing we have only been given $Ω$, $|F'|\big|_Ω$, and the set of critical points of $F$. This extends the earlier result of Ithiel Carter and Burt Rodin [CR] for $F$ with no critical points.
We prove that given a fixed radius $r$, the set of isometry-invariant probability measures supported on ``periodic'' radius $r$-circle packings of the hyperbolic plane is dense in the space of all isometry-invariant probability measures on the space of radius $r$-circle packings. By a periodic packing, we mean one with cofinite symmetry group. As a corollary, we prove the maximum density achieved by isometry-invariant probability measures on a space of radius $r$-packings of the hyperbolic plane is the supremum of densities of periodic packings. We also show that the maximum density function v…
This paper encompasses the mathematical derivations of the analytic and generalized formula and recurrence relations to find out the radii of n umber of circles inscribed or packed in the plane region bounded by circular arcs (including sectors, semi and quarter circles) & the straight lines. The values of radii obtained using analytic formula and recurrence relations have been verified by comparing with those obtained using MATLAB codes. The methods used in this paper for packing circles are deterministic unlike heuristic strategies and optimization techniques. The analytic formulae derived f…
We consider Apollonian circle packings of a half Euclidean plane. We give necessary and sufficient conditions for two such packings to be related by a Euclidean similarity (that is, by translations, reflections, rotations and dilations) and describe explicitly the group of self-similarities of a given packing. We observe that packings with a non-trivial self-similarity correspond to positive real numbers that are the roots of quadratic polynomials with rational coefficients. This is reflected in a close connection between Apollonian circle packings and continued fractions which allows us to co…
We study circle packings with the combinatorics of a triangulated disk in the plane and parametrize deformations of circle packings in terms of vertex rotation and cross ratios. We show that there is a Weierstrass representation formula relating infinitesimal deformations of circle packings to discrete minimal surfaces of Koebe type. Furthermore, every minimal surface of Koebe type can be extended naturally to a discrete minimal surface of general type. In this way, discrete minimal surfaces via Steiner's formula are unified.
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 bounded, simply connected domain. We introduce the concept of crosscuts and investigate the rigidity of circle packings with respect to maximal crosscuts. The main result is a discrete version of an indentity theorem for analytic functions (in the spirit of Schwarz' Lemma), which has implications to uniqueness statements for discrete conformal mappings.
The curvatures of the circles in integral Apollonian circle packings, named for Apollonius of Perga (262-190 BC), form an infinite collection of integers whose Diophantine properties have recently seen a surge in interest. Here, we give a new description of Apollonian circle packings built upon the study of the collection of bases of Z[i]^2, inspired by, and intimately related to, the `sensual quadratic form' of Conway.
We say that a tiling separates discs of a packing in the Euclidean plane, if each tile contains exactly one member of the packing. It is a known elementary geometric problem to show that for each locally finite packing of circular discs, there exists a separating tiling with convex polygons. In this paper we show that this separating property remains true for circle packings on the sphere and in the hyperbolic plane. Moreover, we show that in the Euclidean plane circles are the only convex discs, whose packings with similar copies can be always separated by polygonal tilings. The analogous sta…
Apollonian circle packings arise by repeatedly filling the interstices between four mutually tangent circles with further tangent circles. Such packings can be described in terms of the Descartes configurations they contain. It observed there exist infinitely many types of integral Apollonian packings in which all circles had integer curvatures, with the integral structure being related to the integral nature of the Apollonian group. Here we consider the action of a larger discrete group, the super-Apollonian group, also having an integral structure, whose orbits describe the Descartes quadrup…
We use computational experiments to find the rectangles of minimum area into which a given number n of non-overlapping congruent circles can be packed. No assumption is made on the shape of the rectangles. Most of the packings found have the usual regular square or hexagonal pattern. However, for 1495 values of n in the tested range n =< 5000, specifically, for n = 49, 61, 79, 97, 107,... 4999, we prove that the optimum cannot possibly be achieved by such regular arrangements. The evidence suggests that the limiting height-to-width ratio of rectangles containing an optimal hexagonal packing of…
We study the combinatorial and rigidity properties of disk packings with generic radii. We show that a packing of $n$ disks in the plane with generic radii cannot have more than $2n-3$ pairs of disks in contact. The allowed motions of a packing preserve the disjointness of the disk interiors and tangency between pairs already in contact (modeling a collection of sticky disks). We show that if a packing has generic radii, then the allowed motions are all rigid body motions if and only if the packing has exactly $2n-3$ contacts. Our approach is to study the space of packings with a fixed contact…
For each k >= 1 and corresponding hexagonal number h(k) = 3k(k+1)+1, we introduce m(k) = max[(k-1)!/ 2, 1] packings of h(k) equal disks inside a circle which we call "the curved hexagonal packings". The curved hexagonal packing of 7 disks (k = 1, m(1)=1) is well known and the one of 19 disks (k = 2, m(2)=1) has been previously conjectured to be optimal. New curved hexagonal packings of 37, 61, and 91 disks (k = 3, 4, and 5, m(3)=1, m(4)=3, and m(5)=12) were the densest we obtained on a computer using a so-called "billiards" simulation algorithm. A curved hexagonal packing pattern is invariant …
Given a finite simple triangulation, we estimate the sizes of circles in its circle packing in terms of Cannon's vertex extremal length. Our estimates provide control over the size of the largest circle in the packing. We use them, combined with results from [12], to prove that in a proper circle packing of the discrete mating-of-trees random map model of Duplantier, Gwynne, Miller and Sheffield, the size of the largest circle goes to zero with high probability.
We give theorems that can be used to upper bound the densities of packings of different spherical caps in the unit sphere and of translates of different convex bodies in Euclidean space. These theorems extend the linear programming bounds for packings of spherical caps and of convex bodies through the use of semidefinite programming. We perform explicit computations, obtaining new bounds for packings of spherical caps of two different sizes and for binary sphere packings. We also slightly improve bounds for the classical problem of packing identical spheres.
We consider the hexagonal circle packing with radius 1/2 and perturb it by letting the circles move as independent Brownian motions for time t. It is shown that, for large enough t, if Π_t is the point process given by the center of the circles at time t, then, as t\to\infty, the critical radius for circles centered at Π_t to contain an infinite component converges to that of continuum percolation (which was shown---based on a Monte Carlo estimate---by Balister, Bollobás and Walters to be strictly bigger than 1/2). On the other hand, for small enough t, we show (using a Monte Carlo estimate fo…
We show that a honeycomb circle packing in $\R^2$ with a linear gap defect cannot be completely saturated, no matter how narrow the gap is. The result is motivated by an open problem of G. Fejes Tóth, G. Kuperberg, and W. Kuperberg, which asks whether of a honeycomb circle packing with a linear shift defect is completely saturated. We also show that an fcc sphere packing in $\R^3$ with a planar gap defect is also not completely saturated.
Apollonian circle packings arise by repeatedly filling the interstices between four mutually tangent circles with further tangent circles. We observe that there exist Apollonian packings which have strong integrality properties, in which all circles in the packing have integer curvatures and rational centers such that (curvature)$\times$(center) is an integer vector. This series of papers explain such properties. A {\em Descartes configuration} is a set of four mutually tangent circles with disjoint interiors. We describe the space of all Descartes configurations using a coordinate system $\sM…
We generalize the classical notion of packing a set by balls with identical radii to the case where the radii may be different. The largest number of such balls that fit inside the set without overlapping is called its {\em non-uniform packing number}. We show that the non-uniform packing number can be upper-bounded in terms of the {\em average} radius of the balls, resulting in bounds of the familiar classical form.
The Koebe circle packing theorem states that every finite planar graph can be realized as the nerve of a packing of (non-congruent) circles in R^3. We investigate the average kissing number of finite packings of non-congruent spheres in R^3 as a first restriction on the possible nerves of such packings. We show that the supremum k of the average kissing number for all packings satisfies 12.566 ~ 666/53 <= k < 8 + 4*sqrt(3) ~ 14.928 We obtain the upper bound by a resource exhaustion argument and the upper bound by a construction involving packings of spherical caps in S^3. Our result contradict…
A disc packing in the plane is compact if its contact graph is a triangulation. There are $9$ values of $r$ such that a compact packing by discs of radii $1$ and $r$ exists. We prove, for each of these $9$ values, that the maximal density over all the packings by discs of radii $1$ and $r$ is reached for a compact packing (we give it as well as its density).
We consider ternary disc packings of the plane, i.e. the packings using discs of three different radii. Packings in which each ''hole'' is bounded by three pairwise tangent discs are called triangulated. There are 164 pairs $(r,s)$, $1{>}r{>}s$, allowing triangulated packings by discs of radii 1, $r$ and $s$. In this paper, we enhance existing methods of dealing with maximal-density packings in order to find ternary triangulated packings which maximize the density among all the packings with the same disc radii. We showed for 16 pairs that the density is maximized by a triangulated ternary pac…
Thurston's circle packing approximation of the Riemann Mapping (proven to give the Riemann Mapping in the limit by Rodin-Sullivan) is largely based on the theorem that any topological disk with a circle packing metric can be deformed into a circle packing metric in the disk with boundary circles internally tangent to the circle. The main proofs of the uniformization use hyperbolic volumes (Andreev) or hyperbolic circle packings (by Beardon and Stephenson). We reformulate these problems into a Euclidean context, which allows more general discrete conformal structures and boundary conditions. Th…
We use computational experiments to find the rectangles of minimum perimeter into which a given number n of non-overlapping congruent circles can be packed. No assumption is made on the shape of the rectangles. In many of the packings found, the circles form the usual regular square-grid or hexagonal patterns or their hybrids. However, for most values of n in the tested range n =< 5000, e.g., for n = 7, 13, 17, 21, 22, 26, 31, 37, 38, 41, 43...,4997, 4998, 4999, 5000, we prove that the optimum cannot possibly be achieved by such regular arrangements. Usually, the irregularities in the best pac…
We study the orbit of $\widehat{\mathbb{R}}$ under the Möbius action of the Bianchi group $\operatorname{PSL}_2(\mathcal{O}_K)$ on $\widehat{\mathbb{C}}$, where $\mathcal{O}_K$ is the ring of integers of an imaginary quadratic field $K$. The orbit $\mathcal{S}_K$, called a Schmidt arrangement, is a geometric realisation, as an intricate circle packing, of the arithmetic of $K$. We give a simple geometric characterisation of certain subsets of $\mathcal{S}_K$ generalizing Apollonian circle packings, and show that $\mathcal{S}_K$, considered with orientations, is a disjoint union of all primitiv…
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 with different radii and results in the theory of circle packings whose graph forms a triangulation of a given topological surface. We also point out a counterexample, due to F. Nazarov, to a previous conjecture that that triangulated packings with fixed numbers of disks with fixed numbers of disks for each radius claiming that such packings were the most dens…
The Apollonian circle packing, generated from three mutually-tangent circles in the plane, has inspired over the past half-century the study of other classes of space-filling packings, both in two and in higher dimensions. Recently, Kontorovich and Nakamura introduced the notion of crystallographic sphere packings, $n$-dimensional packings of spheres with symmetry groups that are isometries of $\mathbb{H}^{n+1}$. There exist at least three sources which give rise to crystallographic packings, namely polyhedra, reflective extended Bianchi groups, and various higher dimensional quadratic forms. …
Let a planar residual set be a set obtained by removing countably many disjoint topological disks from an open set in the plane. We prove that the residual set of a planar packing by curves that satisfy a certain lower curvature bound has Hausdorff dimension bounded away from 1, quantitatively, depending only on the curvature bound. As a corollary, the residual set of any circle packing has Hausdorff dimension uniformly bounded away from 1. This result generalizes the result of Larman, who obtained the same conclusion for circle packings inside a square. We also show that our theorem is optima…
Ricci flow deforms the Riemannian metric proportionally to the curvature, such that the curvature evolves according to a heat diffusion process and eventually becomes constant everywhere. Ricci flow has demonstrated its great potential by solving various problems in many fields, which can be hardly handled by alternative methods so far. This work introduces the unified theoretic framework for discrete Surface Ricci Flow, including all common schemes: Thurston's Circle Packing, Tangential Circle Packing, Inversive Distance Circle Packing and Discrete Yamabe. Furthermore, this work also introduc…
In his talk "Integral Apollonian disk Packings" Peter Sarnak asked if there is a "proof from the Book" of the Descartes theorem on circles. A candidate for such a proof is presented in this note
