A note on circle packing
Journal of Zhejiang University: Science C(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.
更多查看译文
关键词
Circle packing,Algorithm performance,Parallel computation,Graphics processing unit (GPU)
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络