On a covering problem for equilateral triangles.
Dumitrescu, Adrian, Jiang, Minghui (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Packing and covering a unit equilateral triangle with equilateral triangles.”
On a covering problem for equilateral triangles.
Conjecturally optimal coverings of an equilateral triangle with up to 36 equal circles.
Nurmela, Kari J. (2000)
Experimental Mathematics
Similarity:
Some Basic Properties of Packing and Covering Constants.
H. Groemer (1986)
Discrete & computational geometry
Similarity:
Note to a paper of Bambah, Rogers and Zassenhaus
G. Fejes Tóth (1988)
Acta Arithmetica
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.
Primal-dual approximation algorithms for a packing-covering pair of problems
Sofia Kovaleva, Frits C.R. Spieksma (2010)
RAIRO - Operations Research
Similarity:
We consider a special packing-covering pair of problems. The packing problem is a natural generalization of finding a (weighted) maximum independent set in an interval graph, the covering problem generalizes the problem of finding a (weighted) minimum clique cover in an interval graph. The problem pair involves weights and capacities; we consider the case of unit weights and the case of unit capacities. In each case we describe a simple algorithm that outputs a solution to the packing...
On a covering problem in the plane.
Weißbach, Bernulf (2000)
Beiträge zur Algebra und Geometrie
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.
Finite Sphere Packing and Sphere Covering.
J.M. Wills, Fejes G. Tóth, P. Gritzmann (1989)
Discrete & computational geometry
Similarity:
Improved coverings of a square with six and eight equal circles.
Melissen, J.B.M., Schuur, P.C. (1996)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Packing and Covering in Combinatorics - Schrijver, A.
W. Vogel (1980)
Metrika
Similarity:
Cutting circles and the Morley theorem.
Stammler, Ludwig (1997)
Beiträge zur Algebra und Geometrie
Similarity:
Translative packing of a square with sequences of squares
Janusz Januszewski (2010)
Colloquium Mathematicae
Similarity:
Let S be a square and let S' be a square of unit area with a diagonal parallel to a side of S. Any (finite or infinite) sequence of homothetic copies of S whose total area does not exceed 4/9 can be packed translatively into S'.