|
|
A note on circle packing |
Young Joon Ahn, Christoph M. Hoffmann, Paul Rosen |
Department of Mathematics Education, Chosun University, Gwangju 501-759, Korea; Department of Computer Science, Purdue University, West Lafayette, IN 47907, USA; Scientific Computing and Imaging Institute, University of Utah, Salt Lake City, UT 84112, USA |
|
|
Abstract 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.
|
Received: 13 January 2012
Published: 02 August 2012
|
|
A note on circle packing
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.
关键词:
Circle packing,
Algorithm performance,
Parallel computation,
Graphics processing unit (GPU)
|
Viewed |
|
|
|
Full text
|
|
|
|
|
Abstract
|
|
|
|
|
Cited |
|
|
|
|
|
Shared |
|
|
|
|
|
Discussed |
|
|
|
|