Optimal packings of eleven equal circles in an equilateral triangle
From MaRDI portal
(Redirected from Optimal packings of eleven equal circles in an equilateral triangle)
The densest packing of \(n\) equal circles in a regular triangle is known for \(n \leq 10\), \(n = 12\) and some other special cases. In this paper the author solves the case \(n = 11\).
Recommendations
- Densest Packings of Congruent Circles in an Equilateral Triangle
- Densest packings of eleven congruent circles in a circle
- Optimal packings of up to six equal circles on a triangular flat torus
- The densest packing of 12 congruent circles in a circle
- Packing 16, 17 or 18 circles in an equilateral triangle
Cites work
- A Finite Packing Problem
- Densest Packings of Congruent Circles in an Equilateral Triangle
- Der Mindestabstand von n in der Einheitskreisscheibe gelegenen Punkten
- scientific article; zbMATH DE number 3083197 (Why is no real title available?)
- Improved coverings of a square with six and eight equal circles
- On Partitions of an Equilateral Triangle
- On the Original Malfatti Problem
- The Converse Malfatti Problem
- Unsolved problems in geometry
Cited in
(9)- Densest packings of eleven congruent circles in a circle
- Packing of equal disks in an equilateral triangle: On a conjecture of Erdős-Oler
- The densest packing of 12 congruent circles in a circle
- Packing 16, 17 or 18 circles in an equilateral triangle
- Sparse locally-jammed disk packings
- Some numerical problems in discrete geometry
- Packing 13 circles in an equilateral triangle
- Densest Packings of Congruent Circles in an Equilateral Triangle
- Packing, covering and tiling in two-dimensional spaces
This page was built for publication: Optimal packings of eleven equal circles in an equilateral triangle
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1333045)
