Decomposition of multiple coverings into more parts

MaRDI QIDQ4633837zbMATH OpenFDO

Authors Greg Aloupis, Jean Cardinal, Sébastien Collette, Stefan Langerman, David Orden, Pedro Ramos

Publication date 6 May 2019

Full work available at URL https://dl.acm.org/citation.cfm?id=1496804

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

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

Cited in

(9)

• Regular random sections of convex bodies and the random quotient-of-subspace theorem
• Convex polygons are cover-decomposable
• More on decomposing coverings by octants
• Octants are cover-decomposable
• Decomposing coverings and the planar sensor cover problem
• Survey on decomposition of multiple coverings
• Indecomposable coverings with concave polygons
• Decomposition of multiple coverings into more parts
• Optimally decomposing coverings with translates of a convex polygon

This page was built for publication: Decomposition of multiple coverings into more parts

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