Recommendations
Cites work
- scientific article; zbMATH DE number 6381738 (Why is no real title available?)
- scientific article; zbMATH DE number 3692179 (Why is no real title available?)
- scientific article; zbMATH DE number 1749054 (Why is no real title available?)
- Almost tight bounds for -nets
- Colorful strips
- Coloring geometric range spaces
- Convex polygons are cover-decomposable
- Decomposing coverings and the planar sensor cover problem
- Decomposition of multiple coverings into many parts
- Decomposition of multiple coverings into more parts
- Indecomposable Coverings
- Indecomposable coverings with concave polygons
- Multiple coverings of the plane with triangles
- -nets and simplex range queries
Cited in
(12)- Coloring Delaunay-edges and their generalizations
- Small strong epsilon nets
- Proper coloring of geometric hypergraphs
- Polychromatic colorings of unions of geometric hypergraphs
- An abstract approach to polychromatic coloring: shallow hitting sets in ABA-free hypergraphs and pseudohalfplanes
- Coloring copoints of a planar point set
- Coloring half-planes and bottomless rectangles
- Polychromatic coloring for half-planes
- Coloring points with respect to squares
- Quasi‐random 2‐ colorings of point sets
- Discrete Helly-type theorems for pseudohalfplanes
- Epsilon-nets for halfplanes
This page was built for publication: Polychromatic coloring for half-planes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q645968)
