Covering the plane with fat ellipses without non-crossing assumption

DOI10.1007/S00454-002-2835-ZMaRDI QIDQ1404516zbMATHOpenAlexFDO

Authors A. Heppes

Publication date 21 August 2003

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00454-002-2835-z

zbMATH Keywords

ellipsesconvex sets in two dimensionscovering in two dimensionsnoncrossing domains

Mathematics Subject Classification ID

Convex sets in (2) dimensions (including convex curves) (52A10) Combinatorial aspects of packing and covering (05B40) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

Recommendations

• Unavoidable crossings in a thinnest plane covering with congruent convex disks
• Covering with fat convex discs
• Best partial covering of a convex domain by congruent circles of a given total area
• Finite packing and covering by congruent convex domains
• Computational algorithms for the optimum covering of plane domains by a prescribed number of ellipses
• Covering the Plane with Congruent Copies of a Convex Body
• Covering the plane with two kinds of circles
• Thinnest covering of the Euclidean plane with incongruent circles
• Note to a paper of Bambah, Rogers and Zassenhaus
• On the density of dual circle coverings

Cited in

(6)

• Packing, covering and tiling in two-dimensional spaces
• Covering a plane with ellipses
• Covering the plane by a sequence of circular disks with a constraint
• Covering with fat convex discs
• Unavoidable crossings in a thinnest plane covering with congruent convex disks
• Unavoidable Crossings in Finite Coverings

This page was built for publication: Covering the plane with fat ellipses without non-crossing assumption

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1404516)