Covering the plane with fat ellipses without non-crossing assumption
type: Item
instance of: scholarly article
title: Covering the plane with fat ellipses without non-crossing assumption
zbMATH Open document ID: 1039.52016
author: A. Heppes
published in: Discrete \& Computational Geometry
publication date: 2003-08-21T00:00:00Z
review text: A classical theorem of R. Kershner says that the density of a covering of the Euclidean plane with congruent circular discs cannot be smaller than \(2\pi/\sqrt{27}\). L. Féjes Tóth essentially extended this result to convex centrally symmetric domains. He had given a lower bound for non-crossing copies of a centrally symmetric convex domain covering a convex hexagon of the plane. Two domains are said to cross, if for each of them the part of the domain not belonging to the other domain is not connected. The non-crossing assumption cannot simply be dropped, in general. A suggestion of L. Féjes Tóth was, to investigate this problem with domains which are close to the shape of a circle. Therefore, the author considers fat ellipses, these are ellipses with half axes \(1\) and \(b\), \(1> b\geq b_0=0,8561\dots\), and \(b_0\) can be calculated using the areas of regular \(k\)-gones, inscribed into a unit circle, \(k= 5,6,7\). For a covering of the plane by congruent fad ellipses the author shows the following theorem: If a convex hexagon is covered by a finite number of congruent fat ellipses then the covering density is at least \(2\pi/\sqrt{27}\). For the proof the author uses results of \textit{E. Molnár}, \textit{K. Böröczky} and \textit{G. Féjes Tóth} [Acta Math. Acad. Sci. Hung. 23, 263--270 (1973; Zbl 0252.52006)].
Mathematics Subject Classification ID: 52C15
Mathematics Subject Classification ID: 05B40
Mathematics Subject Classification ID: 52A10
zbMATH DE Number: 1969098
zbMATH Keywords: covering in two dimensions
zbMATH Keywords: convex sets in two dimensions
zbMATH Keywords: ellipses
zbMATH Keywords: noncrossing domains
reviewed by: Johannes Böhm
MaRDI profile type: Publication
full work available at URL: s00454-002-2835-z
OpenAlex ID: W2008614444
DOI: 10.1007/S00454-002-2835-Z
Recommended article: Unavoidable crossings in a thinnest plane covering with congruent convex disks
Recommended article: Covering with fat convex discs
Recommended article: Best partial covering of a convex domain by congruent circles of a given total area
Recommended article: Finite packing and covering by congruent convex domains
Recommended article: Computational algorithms for the optimum covering of plane domains by a prescribed number of ellipses
Recommended article: Covering the Plane with Congruent Copies of a Convex Body
Recommended article: Covering the plane with two kinds of circles
Recommended article: Thinnest covering of the Euclidean plane with incongruent circles
Recommended article: Note to a paper of Bambah, Rogers and Zassenhaus
Recommended article: On the density of dual circle coverings
description: scientific article; zbMATH DE number 1969098