A Finite Packing Problem

DOI10.4153/CMB-1961-018-7zbMath0101.40301MaRDI QIDQ3284356

N. Oler

Publication date: 1961

Published in: Canadian Mathematical Bulletin (Search for Journal in Brave)

zbMATH Keywords

convex setsintegral geometrygeneral metric geometry

Related Items

Densest packings of eleven congruent circles in a circle ⋮ Optimal packings of eleven equal circles in an equilateral triangle ⋮ Packing of equal disks in an equilateral triangle: On a conjecture of Erdős-Oler ⋮ Packing 16, 17 or 18 circles in an equilateral triangle ⋮ The smallest convex \(k\)-gon containing \(n\) congruent disks ⋮ Packing disks into disks with optimal worst-case density ⋮ Dense packings of 3k(k+1)+1 equal disks in a circle for k = 1, 2, 3, 4, and 5 ⋮ Optimal packings of 2,3, and 4 equal balls into a cubical flat 3-torus ⋮ Packing 13 circles in an equilateral triangle ⋮ Translative packing of unit squares into equilateral triangles ⋮ Design of computer experiments: space filling and beyond ⋮ Unnamed Item ⋮ Maximin distance designs based on densest packings ⋮ Packing Geometric Objects with Optimal Worst-Case Density (Multimedia Exposition) ⋮ Minimum perimeter rectangles that enclose congruent non-overlapping circles

This page was built for publication: A Finite Packing Problem