Unavoidable crossings in a thinnest plane covering with congruent convex disks

DOI10.1007/s00454-008-9113-7zbMath1190.52015OpenAlexW2106887502MaRDI QIDQ848662

Włodzimierz Kuperberg, Andras Bezdek

Publication date: 4 March 2010

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

Full work available at URL: https://doi.org/10.1007/s00454-008-9113-7

zbMATH Keywords

coveringdensitycrossingconvex diskregular tiling

Mathematics Subject Classification ID

Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

Cites Work

• Covering the plane with fat ellipses without non-crossing assumption
• Covering with fat convex discs
• Research Problems in Discrete Geometry
• A Covering Problem
• Covering the Plane with Convex Sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Unavoidable crossings in a thinnest plane covering with congruent convex disks