There are two different modes of circle packing in terms of how they are created. (Iteration) One starting with an existing population of circles and undergo iterations where each circle detects collision and translates. (Ref 1) The other (Search and Place), create circle at random point one by one and checks for overlaps, if it overlaps it gets deleted. (Ref 2)

Ongoing work will look at the applications of these 2 modes in diagramming and organization.

Demo shows a test of brute force iterative circle pacing without contraction pass, with 200 circles. Speed decrease dramatically when population doubles.

Reference:
0. http://mathworld.wolfram.com/CirclePacking.html
1. http://wiki.mcneel.com/developer/sdksamples/2dcirclepacking
2. Tooling (book)