A Finite Packing Problem

DOI10.4153/CMB-1961-018-7MaRDI QIDQ3284356zbMATH OpenFDO

Authors N. Oler

Publication date 1961

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

Full work available at URL https://doi.org/10.4153/CMB-1961-018-7

zbMATH Keywords

convex setsgeneral metric geometryintegral geometry

Cited in

(18)

• Minimum perimeter rectangles that enclose congruent non-overlapping circles
• 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
• Maximin distance designs based on densest packings
• Optimal packings of 2,3, and 4 equal balls into a cubical flat 3-torus
• Packing 13 circles in an equilateral triangle
• The smallest convex k-gon containing n congruent disks
• Packing disks into disks with optimal worst-case density
• Translative packing of unit squares into equilateral triangles
• Packing disks into disks with optimal worst-case density
• Packing Geometric Objects with Optimal Worst-Case Density (Multimedia Exposition)
• Dense packings of 3k(k+1)+1 equal disks in a circle for k = 1, 2, 3, 4, and 5
• Worst-case optimal covering of rectangles by disks
• Worst-case optimal covering of triangles by disks
• Design of computer experiments: space filling and beyond
• Uniquely optimal codes of low complexity are symmetric

This page was built for publication: A Finite Packing Problem

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