On Convex Bodies that Permit Packings of High Density.
H. Groemer (1990)
Discrete & computational geometry
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Remarks on the closest packing of convex discs.”
On Convex Bodies that Permit Packings of High Density.
Flight in a Packing of Disks.
Fejes L. Tóth (1993)
Discrete & computational geometry
Similarity:
The densest packing of 12 congruent circles in a circle.
Fodor, Ferenc (2000)
Beiträge zur Algebra und Geometrie
Similarity:
Packing Parameters in Graphs
I. Sahul Hamid, S. Saravanakumar (2015)
Discussiones Mathematicae Graph Theory
Similarity:
In a graph G = (V,E), a non-empty set S ⊆ V is said to be an open packing set if no two vertices of S have a common neighbour in G. An open packing set which is not a proper subset of any open packing set is called a maximal open packing set. The minimum and maximum cardinalities of a maximal open packing set are respectively called the lower open packing number and the open packing number and are denoted by ρoL and ρo. In this paper, we present some bounds on these parameters. ...
On packing spheres into containers.
Schürmann, Achill (2006)
Documenta Mathematica
Similarity:
Densest Packing of Six Equal Circles in a Square.
Hans Melissen (1994)
Elemente der Mathematik
Similarity:
L. V. Kantorovich and cutting-packing problems: new approaches for solving combinatorial problems of linear cutting and rectangular packing.
Mukhacheva, È.A., Mukhacheva, A.S. (2004)
Journal of Mathematical Sciences (New York)
Similarity:
On the lower bound of packing density for convex bodies in the plane.
Doheny, Kevin R. (1995)
Beiträge zur Algebra und Geometrie
Similarity:
Notions of denseness.
Kuperberg, Greg (2000)
Geometry & Topology
Similarity:
The Densest Packing of Equal Circles into a Parallel Strip.
Z. Füredi (1991)
Discrete & computational geometry
Similarity:
An On-Line Potato-Sack Theorem.
M. Lassak, J. Zhang (1991)
Discrete & computational geometry
Similarity:
Universal container for packing rectangles
Janusz Januszewski (2002)
Colloquium Mathematicae
Similarity:
The aim of the paper is to find a rectangle with the least area into which each sequence of rectangles of sides not greater than 1 with total area 1 can be packed.