Decomposition of multiple coverings into more parts

DOI10.1007/s00454-009-9238-3zbMath1206.52013OpenAlexW2143341942MaRDI QIDQ603854

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

Publication date: 8 November 2010

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

Full work available at URL: https://doi.org/10.1007/s00454-009-9238-3

zbMATH Keywords

cover decompositiongeometric hypergraphscentrally symmetric polygons

Mathematics Subject Classification ID

Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Convex sets in (2) dimensions (including convex curves) (52A10)

Related Items

A Characterization of Visibility Graphs for Pseudo-polygons, Unsplittable coverings in the plane, Set it and forget it: approximating the set once strip cover problem, Coloring points with respect to squares, Changing of the guards: strip cover with duty cycling, Polychromatic coloring for half-planes, Octants are cover-decomposable into many coverings, Colorful strips

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
• On splitting infinite-fold covers
• Research Problems in Discrete Geometry
• ON STRUCTURAL AND GRAPH THEORETIC PROPERTIES OF HIGHER ORDER DELAUNAY GRAPHS
• Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
• Decomposing Coverings and the Planar Sensor Cover Problem
• Coloring Geometric Range Spaces
• Indecomposable Coverings