Octants are cover-decomposable
From MaRDI portal
Publication:411409
DOI10.1007/s00454-011-9377-1zbMath1237.52013MaRDI QIDQ411409
Balázs Keszegh, Dömötör Pálvölgyi
Publication date: 4 April 2012
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-011-9377-1
52C15: Packing and covering in (2) dimensions (aspects of discrete geometry)
Related Items
Coloring intersection hypergraphs of pseudo-disks, Coloring Hypergraphs Defined by Stabbed Pseudo-Disks and ABAB-Free Hypergraphs, Unsplittable coverings in the plane, Convex polygons are self-coverable, Coloring points with respect to squares, Coloring Delaunay-edges and their generalizations, Coloring intersection hypergraphs of pseudo-disks, Proper coloring of geometric hypergraphs, Indecomposable coverings with homothetic polygons, Octants are cover-decomposable into many coverings, Online and quasi-online colorings of wedges and intervals, An Abstract Approach to Polychromatic Coloring: Shallow Hitting Sets in ABA-free Hypergraphs and Pseudohalfplanes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Indecomposable coverings with concave polygons
- Covering the plane with convex polygons
- Convex polygons are cover-decomposable
- Multiple coverings of the plane with triangles
- Weighted geometric set cover via quasi-uniform sampling
- Coloring Planar Homothets and Three-Dimensional Hypergraphs
- Towards an implementation of the 3D visibility skeleton
- Decomposing Coverings and the Planar Sensor Cover Problem
- Survey on Decomposition of Multiple Coverings
- Indecomposable Coverings