All Questions
1 question
4
votes
1
answer
450
views
Implementation of Koebe–Andreev–Thurston circle packing?
The circle packing theorem (Koebe–Andreev–Thurston theorem) claims for a planar graph, we can pack disjoint circles, such that: the circles correspond to vertices and the disks are tangent if the ...
- 1,465