Optimally decomposing coverings with translates of a convex polygon

DOI10.1007/s00454-011-9353-9zbMath1229.52019OpenAlexW2038503671MaRDI QIDQ635757

Matthew R. Gibson, Kasturi R. Varadarajan

Publication date: 23 August 2011

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

Full work available at URL: https://doi.org/10.1007/s00454-011-9353-9

zbMATH Keywords

set covercover decomposability

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

Related Items (7)

Unsplittable coverings in the plane ⋮ Set it and forget it: approximating the set once strip cover problem ⋮ Coloring points with respect to squares ⋮ Colouring bottomless rectangles and arborescences ⋮ Octants are cover-decomposable into many coverings ⋮ Multiple coverings with closed polygons ⋮ Average case network lifetime on an interval with adjustable sensing ranges

Cites Work

• Indecomposable coverings with concave polygons
• Decomposition of multiple coverings into many parts
• Covering the plane with convex polygons
• Convex polygons are cover-decomposable
• Multiple coverings of the plane with triangles
• Approximation Algorithms for Domatic Partitions of Unit Disk Graphs
• Indecomposable Coverings
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimally decomposing coverings with translates of a convex polygon