Octants are cover-decomposable

DOI10.1007/S00454-011-9377-1zbMATH Open1237.52013OpenAlexW1745488587MaRDI QIDQ411409FDOQ411409

Authors: 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

Recommendations

• Octants are cover decomposable
• Octants are cover-decomposable into many coverings
• More on decomposing coverings by octants
• Multiple coverings of the plane with triangles
• Making octants colorful and related covering decomposition problems

zbMATH Keywords

cover-decomposabilitygeometric hypergraph coloring

Mathematics Subject Classification ID

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

Cites Work

• Weighted geometric set cover via quasi-uniform sampling
• Title not available (Why is that?)
• Covering the plane with convex polygons
• Convex polygons are cover-decomposable
• Multiple coverings of the plane with triangles
• Title not available (Why is that?)
• Title not available (Why is that?)
• Survey on decomposition of multiple coverings
• Indecomposable Coverings
• Indecomposable coverings with concave polygons
• Decomposing coverings and the planar sensor cover problem
• Coloring Planar Homothets and Three-Dimensional Hypergraphs
• Deciding soccer scores and partial orientations of graphs
• Decomposition of multiple coverings into more parts

Cited In (15)

• Coloring Delaunay-edges and their generalizations
• More on decomposing coverings by octants
• Proper coloring of geometric hypergraphs
• Online and quasi-online colorings of wedges and intervals
• Making octants colorful and related covering decomposition problems
• An abstract approach to polychromatic coloring: shallow hitting sets in ABA-free hypergraphs and pseudohalfplanes
• Coloring intersection hypergraphs of pseudo-disks
• Making Octants Colorful and Related Covering Decomposition Problems
• Coloring hypergraphs defined by stabbed pseudo-disks and \(ABAB\)-free hypergraphs
• Coloring points with respect to squares
• Convex polygons are self-coverable
• Coloring hypergraphs defined by stabbed pseudo-disks and ABAB-free hypergraphs
• Coloring intersection hypergraphs of pseudo-disks
• Indecomposable coverings with homothetic polygons
• Octants are cover-decomposable into many coverings

This page was built for publication: Octants are cover-decomposable

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