Maximin distance for n points in a unit square or a unit circle

DOI10.1007/B11261zbMATH Open1179.68173OpenAlexW62175113MaRDI QIDQ5897084FDOQ5897084

Authors: Jin Akiyama, Rika Mochizuki, Nobuaki Mutoh, Gisaku Nakamura 

Publication date: 5 February 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b11261

Recommendations

• scientific article; zbMATH DE number 4019892
• scientific article; zbMATH DE number 4042714
• Packing up to 50 equal circles in a square
• Densest packings of equal circles in a square
• scientific article; zbMATH DE number 4126190

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Circle packings and discrete conformal geometry (52C26)

Cited In (7)

• A filtered beam search based heuristic algorithm for packing unit circles into a circular container
• Exact upper bound on the sum of squared nearest-neighbor distances between points in a rectangle
• The maximum number of unit distances in a convex \(n\)-gon
• Twenty years of progress of \(\mathrm{JCDCG}^3\)
• Global optimization method for finding dense packings of equal circles in a circle
• Iterated dynamic thresholding search for packing equal circles into a circular container
• An efficient quasi-physical quasi-human algorithm for packing equal circles in a circular container

This page was built for publication: Maximin distance for \(n\) points in a unit square or a unit circle

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897084)