Efficient algorithms for the dense packing of congruent circles inside a square

DOI10.1007/s00454-022-00425-5arXiv2102.01537OpenAlexW3126202923WikidataQ114229286 ScholiaQ114229286MaRDI QIDQ6156095

Paolo Amore, Tenoch Morales

Publication date: 12 June 2023

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2102.01537

zbMATH Keywords

optimizationcircle packing

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Numerical approximation and computational geometry (primarily algorithms) (65Dxx)

Cites Work

• A literature review on circle and sphere packing problems: models and methodologies
• New approaches to circle packing in a square. With program codes.
• Packing up to 50 equal circles in a square
• Improved interval methods for solving circle packing problems in the unit square
• A proof of the Kepler conjecture
• Über die dichteste Kugellagerung
• Many-particle jumps algorithm and Thomson's problem
• On a Geometric Extremum Problem
• The Densest Packing of 9 Circles in a Square
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient algorithms for the dense packing of congruent circles inside a square