The smallest convex \(k\)-gon containing \(n\) congruent disks

DOI10.4171/EM/451zbMath1505.52003arXiv2102.02568WikidataQ114021511 ScholiaQ114021511MaRDI QIDQ2674985

Orgil-Erdene Erdenebaatar, Uuganbaatar Ninjbat

Publication date: 20 September 2022

Published in: Elemente der Mathematik (Search for Journal in Brave)

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

zbMATH Keywords

packingEuclidean diskssmallest-area convex \(k\)-gon

Mathematics Subject Classification ID

Convex sets in (2) dimensions (including convex curves) (52A10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Über die Einlagerung von Kreisen in einen konvexen Bereich
• Note on an inequality of Wegner
• The densest packing of 19 congruent circles in a circle
• Densest packing of six equal circles in a square
• Finite packings of spheres
• Dense packings of congruent circles in a circle
• Morphing simple polygons
• Optimal clustering of a pair of irregular objects
• Mathematical model and efficient algorithms for object packing problem
• The sphere packing problem in dimension 8
• A Finite Packing Problem
• Densest Packings of Congruent Circles in an Equilateral Triangle
• MINIMUM AREA CONVEX PACKING OF TWO CONVEX POLYGONS
• A Packing Inequality for Compact Convex Subsets of the Plane
• Geometric Extremum Problems
• On minimum circumscribed polygons
• Minimal convex \(k\)-gons containing a given convex polygon

This page was built for publication: The smallest convex \(k\)-gon containing \(n\) congruent disks