A Packing Inequality for Compact Convex Subsets of the Plane

DOI10.4153/CMB-1969-096-7MaRDI QIDQ5583664zbMATH OpenOpenAlexFDO

Authors J. H. Folkman, Ron Graham

Publication date 1969

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

Full work available at URL https://doi.org/10.4153/cmb-1969-096-7

zbMATH Keywords

metric geometry, convex geometry, integral geometry

Cited in

(13)

• Minimum perimeter rectangles that enclose congruent non-overlapping circles
• Penny-packing and two-dimensional codes
• Maximizing the sum of radii of balls inscribed in a polyhedral set
• Linear models for the approximate solution of the problem of packing equal circles into a given domain
• Packings of equal disks in a square torus
• Competitive self-stabilizing \(k\)-clustering
• The smallest convex k-gon containing n congruent disks
• A NEW PROOF FOR ZASSENHAUS–GROEMER–OLER INEQUALITY
• A counterpart to Oler's lattice‐point theorem
• Dense packings of 3k(k+1)+1 equal disks in a circle for k = 1, 2, 3, 4, and 5
• Beurling-type density criteria for system identification
• An inequality on the edge lengths of triangular meshes
• The densest packing of equal circles into a parallel strip

This page was built for publication: A Packing Inequality for Compact Convex Subsets of the Plane

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