On coverings with convex domains
R. Bambah, C. Rogers, H. Zassenhaus (1964)
Acta Arithmetica
Similarity:
Displaying similar documents to “Note to a paper of Bambah, Rogers and Zassenhaus”
On coverings with convex domains
Covering the plane with congruent copies of a convex disk.
Smith, Edwin (1994)
Beiträge zur Algebra und Geometrie
Similarity:
Packing and covering a unit equilateral triangle with equilateral triangles.
Zhang, Yuqin, Fan, Yonghui (2005)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On a covering problem for equilateral triangles.
Dumitrescu, Adrian, Jiang, Minghui (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
On a covering problem in the plane.
Weißbach, Bernulf (2000)
Beiträge zur Algebra und Geometrie
Similarity:
Double-Lattice Packings of Convex Bodies in the Plane.
W. Kuperberg, G. Kuperberg (1990)
Discrete & computational geometry
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:
Thinnest Covering of the Euclidean Plane with Incongruent Circles
Dietmar Dorninger (2017)
Analysis and Geometry in Metric Spaces
Similarity:
In 1958 L. Fejes Tóth and J. Molnar proposed a conjecture about a lower bound for the thinnest covering of the plane by circles with arbitrary radii from a given interval of the reals. If only two kinds of radii can occur this conjecture was in essence proven by A. Florian in 1962, leaving the general case unanswered till now. The goal of this paper is to analytically describe the general case in such a way that the conjecture can easily be numerically verified and upper and lower limits...
Tilings with the neighborhood property.
Fosnaugh, Linda S., Kramer, Earl S. (1996)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Covering the plane with sprays
James H. Schmerl (2010)
Fundamenta Mathematicae
Similarity:
For any three noncollinear points c₀,c₁,c₂ ∈ ℝ², there are sprays S₀,S₁,S₂ centered at c₀,c₁,c₂ that cover ℝ². This improves the result of de la Vega in which c₀,c₁,c₂ were required to be the vertices of an equilateral triangle.
On the thinnest 2-fold double-lattice covering with a centrally symmetric convex domain. (Über die dünnste doppelgitterförmige 2-fache Überdeckung mit einem zentralsymmetrischen konvexen Bereich.)
Temesvári, Ágota H. (1994)
Beiträge zur Algebra und Geometrie
Similarity:
Covering the Plane with Two Kinds of Circles.
Fejes G. Tóth (1995)
Discrete & computational geometry
Similarity:
The maximum piercing number for some classes of convex sets with the -property.
Kynčl, Jan, Tancer, Martin (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Covering the Plane with Convex Polygons.
J. Pach (1986)
Discrete & computational geometry
Similarity: