The purpose of a circle packing procedure is to fill up a predefined, geometrical, closed contour with a maximum finite number of circles. The subject has received considerable attention in pure and applied sciences and has proved to be highly effective in connection with many a problem in logistics and technology. The well-known Apollonian circle packing achieves the packing of an infinite number of mutually tangent smaller circles of decreasing radii, internal or tangent to the outer boundary. Algorithms are available in the literature for the packing of equal-radius circles within an ellipse for global optimization purposes. In this paper, we propose a new algorithm for the Apollonian packing of circles within an ellipse, based on fundamental numerical methods, granting suitable speed, accuracy and stability. The novelty of the proposed approach consists in its applicability to the Apollonian packing of circles within a generic, closed, convex contour, if the parametrization of its outer boundary is given.

Apollonian packing of circles within ellipses / Santini, C.; Mangini, F.; Frezza, F.. - In: ALGORITHMS. - ISSN 1999-4893. - 16:3(2023). [10.3390/a16030129]

Apollonian packing of circles within ellipses

Santini C.
Primo
;
Mangini F.
Secondo
;
Frezza F.
Ultimo
2023

Abstract

The purpose of a circle packing procedure is to fill up a predefined, geometrical, closed contour with a maximum finite number of circles. The subject has received considerable attention in pure and applied sciences and has proved to be highly effective in connection with many a problem in logistics and technology. The well-known Apollonian circle packing achieves the packing of an infinite number of mutually tangent smaller circles of decreasing radii, internal or tangent to the outer boundary. Algorithms are available in the literature for the packing of equal-radius circles within an ellipse for global optimization purposes. In this paper, we propose a new algorithm for the Apollonian packing of circles within an ellipse, based on fundamental numerical methods, granting suitable speed, accuracy and stability. The novelty of the proposed approach consists in its applicability to the Apollonian packing of circles within a generic, closed, convex contour, if the parametrization of its outer boundary is given.
2023
circle packing; packing of ellipses; Apollonian packing
01 Pubblicazione su rivista::01a Articolo in rivista
Apollonian packing of circles within ellipses / Santini, C.; Mangini, F.; Frezza, F.. - In: ALGORITHMS. - ISSN 1999-4893. - 16:3(2023). [10.3390/a16030129]
File allegati a questo prodotto
File Dimensione Formato  
Santini_Apollonian Packing_2023.pdf

accesso aperto

Tipologia: Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza: Creative commons
Dimensione 842.72 kB
Formato Adobe PDF
842.72 kB Adobe PDF

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11573/1677790
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? 0
social impact