The following pages link to A Finite Packing Problem (Q3284356):
Displaying 16 items.
- Translative packing of unit squares into equilateral triangles (Q494022) (← links)
- Design of computer experiments: space filling and beyond (Q693293) (← links)
- Minimum perimeter rectangles that enclose congruent non-overlapping circles (Q1025447) (← links)
- Densest packings of eleven congruent circles in a circle (Q1332627) (← links)
- Optimal packings of eleven equal circles in an equilateral triangle (Q1333045) (← links)
- Packing of equal disks in an equilateral triangle: On a conjecture of Erdős-Oler (Q1356777) (← links)
- Packing 16, 17 or 18 circles in an equilateral triangle (Q1900192) (← links)
- Maximin distance designs based on densest packings (Q2044761) (← links)
- Optimal packings of 2,3, and 4 equal balls into a cubical flat 3-torus (Q2193420) (← links)
- Packing 13 circles in an equilateral triangle (Q2227519) (← links)
- The smallest convex \(k\)-gon containing \(n\) congruent disks (Q2674985) (← links)
- Packing disks into disks with optimal worst-case density (Q2679596) (← links)
- (Q5088965) (← links)
- Packing Geometric Objects with Optimal Worst-Case Density (Multimedia Exposition) (Q5088996) (← links)
- Dense packings of 3k(k+1)+1 equal disks in a circle for k = 1, 2, 3, 4, and 5 (Q6085717) (← links)
- Worst-case optimal covering of rectangles by disks (Q6624196) (← links)
