Optimally decomposing coverings with translates of a convex polygon

DOI10.1007/S00454-011-9353-9MaRDI QIDQ635757zbMATH OpenOpenAlexFDO

Authors Matt Gibson, Kasturi 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)

Recommendations

• Convex polygons are cover-decomposable
• Multiple coverings of the plane with triangles
• Multiple coverings with closed polygons
• Decomposition of multiple coverings into more parts
• Decomposing coverings and the planar sensor cover problem

Cites work

• scientific article; zbMATH DE number 6381738 (Why is no real title available?)
• Approximation Algorithms for Domatic Partitions of Unit Disk Graphs
• Convex polygons are cover-decomposable
• Covering the plane with convex polygons
• Decomposition of multiple coverings into many parts
• Decomposition of multiple coverings into more parts
• Indecomposable Coverings
• Indecomposable coverings with concave polygons
• Multiple coverings of the plane with triangles

Cited in

(12)

• Decomposing coverings and the planar sensor cover problem
• Maximum overlap of convex polytopes under translation
• Colouring bottomless rectangles and arborescences
• Convex polygons are cover-decomposable
• Decompositions, partitions, and coverings with convex polygons and pseudo-triangles
• Set it and forget it: approximating the set once strip cover problem
• Multiple coverings with closed polygons
• Average case network lifetime on an interval with adjustable sensing ranges
• Coloring points with respect to squares
• Convex polygons are self-coverable
• Octants are cover-decomposable into many coverings
• Maximum overlap and minimum convex hull of two convex polyhedra under translations

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

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