Optimally decomposing coverings with translates of a convex polygon
From MaRDI portal
Publication:635757
DOI10.1007/S00454-011-9353-9zbMATH Open1229.52019OpenAlexW2038503671MaRDI QIDQ635757FDOQ635757
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
Recommendations
Nonnumerical algorithms (68W05) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)
Cites Work
- Covering the plane with convex polygons
- Convex polygons are cover-decomposable
- Multiple coverings of the plane with triangles
- Title not available (Why is that?)
- Indecomposable coverings with concave polygons
- Decomposition of multiple coverings into many parts
- Indecomposable Coverings
- Decomposition of multiple coverings into more parts
- Approximation Algorithms for Domatic Partitions of Unit Disk Graphs
Cited In (12)
- Decomposing coverings and the planar sensor cover problem
- Decompositions, partitions, and coverings with convex polygons and pseudo-triangles
- Maximum overlap of convex polytopes under translation
- Multiple coverings with closed polygons
- Maximum overlap and minimum convex hull of two convex polyhedra under translations
- Colouring bottomless rectangles and arborescences
- Coloring points with respect to squares
- Convex polygons are self-coverable
- Average case network lifetime on an interval with adjustable sensing ranges
- Convex polygons are cover-decomposable
- Set it and forget it: approximating the set once strip cover problem
- Octants are cover-decomposable into many coverings
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)
