Visual illustrations of circle packing theorem?

809 Views Asked by At

Circle packing theorem states:

For every connected simple planar graph G there is a circle packing in the plane whose intersection graph is (isomorphic to) G.

Paper Collins, Stephenson: A circle packing algorithm describes an algorithm for obtaining circle pack corresponding to a given planar graph.

However, I tried searching internet for images of resulting circle packs, and I could hardly find just a few. Those that I found had some unusual beauty in them. I suspect whole beauty of such circle packs is still not discovered.

I would like to know if somebody tried to generate circle packs corresponding to some known classes of planar graphs, like these:

enter image description here

enter image description here

enter image description here

or similar?


Some rare visual examples that I found on internet.:


enter image description here


enter image description here


enter image description here

2

There are 2 best solutions below

2
On BEST ANSWER

I have computed circle packings in various special cases taking advantage of symmetry. However, I have not implemented circle packing in full generality.

enter image description here

The US graph is featured in a review of Hyperbolic Geometry by Cannon, Floyed, Kenyon and Parry. Square tilings are another geometric object associated with planar graphs.

enter image description here


It's hard to find good implementations of circle packing. Even we had some, the software is slowly going out of date. At least, a theory is pinned down in some papers:

0
On

If you read the very last item in the paper that you linked, you will see that the authors of that paper give a link to software that computes circle packings.