This is an audio version of the Wikipedia Article:
[ Ссылка ]
00:01:07 1 Uniqueness
00:04:59 2 Relations with conformal mapping theory
00:05:06 3 Proofs
00:05:18 4 Applications
00:08:32 5 Algorithmic aspects
00:09:32 6 Generalizations
00:11:42 7 History
00:14:11 8 See also
00:18:52 9 Notes
00:19:54 10 References
Listening is a more natural way of learning, when compared to reading. Written language only began at around 3200 BC, but spoken language has existed long ago.
Learning by listening is a great way to:
- increases imagination and understanding
- improves your listening skills
- improves your own spoken accent
- learn while on the move
- reduce eye strain
Now learn the vast amount of general knowledge available on Wikipedia through audio (audio article). You could even learn subconsciously by playing the audio while you are sleeping! If you are planning to listen a lot, you could try using a bone conduction headphone, or a standard speaker instead of an earphone.
Listen on Google Assistant through Extra Audio:
[ Ссылка ]
Other Wikipedia audio articles at:
[ Ссылка ]
Upload your own Wikipedia articles through:
[ Ссылка ]
Speaking Rate: 0.9132792310173251
Voice name: en-US-Wavenet-B
"I cannot teach anybody anything, I can only make them think."
- Socrates
SUMMARY
=======
The circle packing theorem (also known as the Koebe–Andreev–Thurston theorem) describes the possible tangency relations between circles in the plane whose interiors are disjoint. A circle packing is a connected collection of circles (in general, on any Riemann surface) whose interiors are disjoint. The intersection graph of a circle packing is the graph having a vertex for each circle, and an edge for every pair of circles that are tangent. If the circle packing is on the plane, or, equivalently, on the sphere, then its intersection graph is called a coin graph; more generally, intersection graphs of interior-disjoint geometric objects are called tangency graphs or contact graphs. Coin graphs are always connected, simple, and planar. The circle packing theorem states that these are the only requirements for a graph to be a coin graph:
Circle packing theorem: For every connected simple planar graph G there is a circle packing in the plane whose intersection graph is (isomorphic to) G.
