Optimally decomposing coverings with translates of a convex polygon
From MaRDI portal
Publication:635757
DOI10.1007/s00454-011-9353-9zbMath1229.52019MaRDI 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
68W05: Nonnumerical algorithms
52C15: Packing and covering in (2) dimensions (aspects of discrete geometry)
Related Items
Colouring bottomless rectangles and arborescences, Unsplittable coverings in the plane, Coloring points with respect to squares, Multiple coverings with closed polygons, Average case network lifetime on an interval with adjustable sensing ranges, Set it and forget it: approximating the set once strip cover problem, Octants are cover-decomposable into many coverings
Cites Work
- Unnamed Item
- Unnamed Item
- 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