Skip to search formSkip to main contentSkip to account menu

Circle packing theorem

Known as: Koebe-Andreev-Thurston theorem, Koebe andreev thurston theorem, Coin graph 
The circle packing theorem (also known as the Koebe–Andreev–Thurston theorem) describes the possible tangency relations between circles in the plane… 
Wikipedia (opens in a new tab)

Related topics

Related topics

29 relations
Angular resolution (graph drawing)Apollonian networkConnectivity (graph theory)Contact graph

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
On hypercube packings, blocking sets and a covering problem
2011
2011
Planar hybrid superconductor-normal metal-superconductor thin film junctions based on BaFe1.8Co0.2As2
2008
2008
Fusion frames and robust dimension reduction
We consider the linear minimum mean- squared error (LMMSE) estimation of a random vector of interest from its fusion frame… 
2007
2007
The Optimal Ball and Horoball Packings to the Coxeter Honeycombs in the Hyperbolic dspace
In a former paper [18] a method is described that determines the data and the density of the optimal ball or horoball packing to… 
2005
2005
Horoball Packings for the Lambert-cube Tilings in the Hyperbolic 3-space Dedicated to Professor
– (p, q) (p > 2, q = 2). These infinite tiling series of cubes are the special cases of the classical Lambert-cube tilings. The… 
Highly Cited
2003
Highly Cited
2003
Updating the topology of the dynamic Voronoi diagram for spheres in Euclidean d-dimensional space
1995
1995
Recurrent random walks, Liouville's theorem and circle packings
  • T. Dubejko
  • Mathematical Proceedings of the Cambridge…
  • 1995
  • Corpus ID: 5631354
It has been shown that univalent circle packings filling the complex plane C are unique up to similarities of C. Here we prove… 
1994
1994
An example concerning the translative kissing number of a convex body
This article presents a class of convex bodies inEd (d≥3) where their maximum kissing numbers in translative packings are larger… 
1987
1987
Multi-symmetric close packings of equal spheres on the spherical surface
An analysis is presented for the Tammes problem: how must n points be distributed on the surface of a sphere in order that the… 
1970
1970
Lower Bounds for the Disk Packing Constant
An osculatory packing of a disk, U, is an infinite sequence of disjoint disks, f Un }, contained in U, chosen so that, for n _ 2… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)