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 parMlelized ...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 parMlelized 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.展开更多
基金Project supported by the Basic Science Research Program through the National Research Foundation of Korea (NRF) by the Ministry of Education, Science and Technology (No. 2012-0002715)NSF Grants CPATH (Nos. CCF-0722210 and CCF-0938999)+1 种基金DOE award (No. DE-FG52-06NA26290)a gift from the Intel Corporation
文摘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 parMlelized 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.
