A note on circle packing
Young Joon Ahn, Christoph M. Hoffmann, Paul A. Rosen · Frontiers of Information Technology & Electronic Engineering · 2012
The problem of packing circles into a domain of prescribed topology is considered. The circles need not have equal radii. The Collins-Stephenson algorithm computes such a circle packing. This algorithm is parallelized in two different ways and its performance is reported for a triangular, planar domain test case. The implementation uses the highly parallel graphics processing unit (GPU) on commodity hardware. The speedups so achieved are discussed based on a number of experiments.