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.
Similar content being viewed by others
References
Andreatta, M., Bezdek, A., Boroński, J.P., 2011. The problem of Malfatti: two centuries of debate. Math. Intell., 33(1):72–76. [doi:10.1007/s00283-010-9154-7]
Bern, M., Eppstein, D., 2000. Quadrilateral meshing by circle packing. Int. J. Comput. Geom. Appl., 10(4):347–360. [doi:10.1142/S0218195900000206]
Bottema, O., 2000. The Malfatti problem. Forum Geom., 1:43–50.
Chiang, C.S., Hoffmann, C.M., Rosen, P., 2010. Hardware assistance for constrained circle constructions I: sequential problems. Comput. Aid. Des. Appl., 7(1):17–32. [doi:10.3722/cadaps.2010.17-32]
Chiang, C.S., Hoffmann, C.M., Rosen, P., 2012. A generalized Malfatti problem. Comput. Geom., 45(8):425–435. [doi:10.1016/j.comgeo.2010.06.005]
Collins, C.R., Stephenson, K., 2003. A circle packing algorithm. Comput. Geom., 25(3):233–256. [doi:10.1016/S0925-7721(02)00099-8]
Hoffmann, C.M., Joan-Arinyo, R., 2002. Parametric Modeling. In: Farin, G., Hoschek, J., Kim, M.S. (Eds.), Handbook of Computer Aided Geometric Design. Elsevier North Holland, Amsterdam.
Kharevych, L., Springborn, B., Schröder, P., 2005. Discrete Conformal Mappings via Circle Patterns. ACM SIGGRAPH Courses, p.6. [doi:10.1145/1198555.1198665]
Lamure, H., Michelucci, D., 1995. Solving Geometric Constraints by Homotopy. Proc. Symp. on Solid Modeling and Applications, p.263–269.
Liu, J., Xue, S., Liu, Z., Xu, D., 2009. An improved energy landscape paving algorithm for the problem of packing circles into a larger containing circle. Comput. Ind. Eng., 57(3):1144–1149. [doi:10.1016/j.cie.2009.05.010]
López, C.O., Beasley, J.E., 2011. A heuristic for the circle packing problem with a variety of containers. Eur. J. Oper. Res., 214(3):512–525. [doi:10.1016/j.ejor.2011.04.024]
Rodin, B., Sullivan, D., 1987. The convergence of circle packings to the Riemann mapping. J. Differ. Geom., 26:349–360.
Stephenson, K., 2003. Circle packing: a mathematical tale. Notices Amer. Math. Soc., 50(11):1376–1388.
Stephenson, K., 2005. Introduction to Circle Packing: the Theory of Discrete Analytic Functions. Cambridge University Press, New York.
Wang, H., Huang, W., Zhang, Q., Xu, D., 2002. An improved algorithm for the packing of unequal circles within a larger containing circle. Eur. J. Oper. Res., 141(2):440–453. [doi:10.1016/S0377-2217(01)00241-7]
Willams, G.B., 2001. Approximation of quasisymmetries using circle packings. Discr. Comput. Geom., 25:103–124.
Author information
Authors and Affiliations
Corresponding author
Additional information
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), DOE award (No. DE-FG52-06NA26290), and by a gift from the Intel Corporation
Rights and permissions
About this article
Cite this article
Ahn, Y.J., Hoffmann, C.M. & Rosen, P. A note on circle packing. J. Zhejiang Univ. - Sci. C 13, 559–564 (2012). https://doi.org/10.1631/jzus.C1200010
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1631/jzus.C1200010