A Finite Packing Problem

DOI10.4153/CMB-1961-018-7zbMATH Open0101.40301MaRDI QIDQ3284356FDOQ3284356

Authors: N. Oler 

Publication date: 1961

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

zbMATH Keywords

integral geometryconvex setsgeneral metric geometry

Cited In (16)

• Design of computer experiments: space filling and beyond
• Title not available (Why is that?)
• Packing 13 circles in an equilateral triangle
• Packing 16, 17 or 18 circles in an equilateral triangle
• Optimal packings of 2,3, and 4 equal balls into a cubical flat 3-torus
• Worst-case optimal covering of rectangles by disks
• Maximin distance designs based on densest packings
• The smallest convex \(k\)-gon containing \(n\) congruent disks
• Dense packings of 3k(k+1)+1 equal disks in a circle for k = 1, 2, 3, 4, and 5
• Packing disks into disks with optimal worst-case density
• 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
• Translative packing of unit squares into equilateral triangles
• Packing of equal disks in an equilateral triangle: On a conjecture of Erdős-Oler
• Packing Geometric Objects with Optimal Worst-Case Density (Multimedia Exposition)

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)