Octants are cover-decomposable

DOI10.1007/s00454-011-9377-1zbMath1237.52013OpenAlexW1745488587MaRDI 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

zbMATH Keywords

cover-decomposabilitygeometric hypergraph coloring

Mathematics Subject Classification ID

Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

Related Items

Unsplittable coverings in the plane, Coloring points with respect to squares, Coloring intersection hypergraphs of pseudo-disks, Octants are cover-decomposable into many coverings, Coloring Hypergraphs Defined by Stabbed Pseudo-Disks and ABAB-Free Hypergraphs, Coloring Delaunay-edges and their generalizations, Online and quasi-online colorings of wedges and intervals, Convex polygons are self-coverable, An Abstract Approach to Polychromatic Coloring: Shallow Hitting Sets in ABA-free Hypergraphs and Pseudohalfplanes, Proper coloring of geometric hypergraphs, Indecomposable coverings with homothetic polygons, Coloring intersection hypergraphs of pseudo-disks

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