Generation of optimal packings from optimal packings.
Gensane, Thierry (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “Optimal packings for filled rings of circles”
Generation of optimal packings from optimal packings.
Repeated patterns of dense packings of equal disks in a square.
Graham, R.L., Lubachevski, B.D. (1996)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Optimal substructures in optimal and approximate circle packings.
Szabó, Péter Gábor (2005)
Beiträge zur Algebra und Geometrie
Similarity:
The densest packing of 12 congruent circles in a circle.
Fodor, Ferenc (2000)
Beiträge zur Algebra und Geometrie
Similarity:
Improving dense packings of equal disks in a square.
Boll, W.David, Donovan, Jerry, Graham, Ronald L., Lubachevsky, Boris D. (2000)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Dense packings of equal disks in an equilateral triangle: From 22 to 34 and beyond.
Graham, R.L., Lubachevsky, B.D. (1995)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Solving the Two-Dimensional Packing Problem With m-M Calculus
Aleksandar Savić, Tijana Šukilović, Vladimir Filipović (2011)
The Yugoslav Journal of Operations Research
Similarity:
The Densest Packing of Equal Circles into a Parallel Strip.
Z. Füredi (1991)
Discrete & computational geometry
Similarity:
What is the minimum length of a non-extendable lace?
Kemnitz, Arnfried, Soltan, Valeriu (1999)
Beiträge zur Algebra und Geometrie
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.
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:
Lattice packings with gap defects are not completely saturated.
Kuperberg, Greg, Kuperberg, Krystyna, Kuperberg, Włodzimierz (2004)
Beiträge zur Algebra und Geometrie
Similarity:
Notions of denseness.
Kuperberg, Greg (2000)
Geometry & Topology
Similarity: