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.
2016
2016
On the deformation of inversive distance circle packings, III
Highly Cited
2011
Highly Cited
2011
Large eddy simulation study of scalar transport in fully developed wind-turbine array boundary layers
Wind harvesting is fast becoming an important alternative source of energy. As wind farms become larger, they begin to attain… 
2011
2011
Patterns in odd Khovanov homology
We investigate properties of the odd Khovanov homology, compare and contrast them with those of the original (even) Khovanov… 
Highly Cited
2009
Highly Cited
2009
Weichselian and Holocene palaeoenvironmental history of the Bol'shoy Lyakhovsky Island, New Siberian Archipelago, Arctic Siberia
Cryolithological, ground ice and fossil bioindicator (pollen, diatoms, plant macrofossils, rhizopods, insects, mammal bones… 
Highly Cited
2006
Highly Cited
2006
Sound wave acceleration in granular materials
The goal of this study is a better understanding of the numerous sound propagation mechanisms in granular materials. In a static… 
Highly Cited
2003
Highly Cited
2003
A circle packing algorithm
Highly Cited
2001
Highly Cited
2001
Synthesis of ZSM-5 coatings on stainless steel grids and their catalytic performance for partial oxidation of benzene by N2O
Highly Cited
2000
Highly Cited
2000
The pursuit of perfect packing
Prefaces How Many Sweets in the Jar? Loose Change and Tight Packing A Teasing but Tractable Problem A Handful of Coins Order and… 
Highly Cited
1979
Highly Cited
1979
Use of Frequency Scanning Techniques for Subsynchronous Resonance Analysis
Frequency scanning employs an approximate technique which is efficient, and cost effective for the analysis of Subsynchronous… 
Highly Cited
1971
Highly Cited
1971
Sphere Packings and Error-Correcting Codes
Error-correcting codes are used in several constructions for packings of equal spheres in n-dimensional Euclidean spaces En… 
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)