Circle packing in the hyperbolic plane.
Bowen, Lewis (2000)
Mathematical Physics Electronic Journal [electronic only]
Similarity:
Displaying similar documents to “Hyperbolic and Parabolic Packings.”
Circle packing in the hyperbolic plane.
The Densest Packing of Equal Circles into a Parallel Strip.
Z. Füredi (1991)
Discrete & computational geometry
Similarity:
Disks with Special Properties of Densest Packings.
P. Schmitt (1991)
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. ...
Notions of denseness.
Kuperberg, Greg (2000)
Geometry & Topology
Similarity:
Densest Packing of Translates of the Union of Two Circles.
Fejes L. Tóth (1986)
Discrete & computational geometry
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:
Flight in a Packing of Disks.
Fejes L. Tóth (1993)
Discrete & computational geometry
Similarity:
On mixed sphere packings.
Vassallo, Salvatore, Wills, Jörg M. (1994)
Beiträge zur Algebra und Geometrie
Similarity:
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:
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.