Polychromatic coloring for half-planes
From MaRDI portal
Publication:645968
DOI10.1016/J.JCTA.2011.07.001zbMATH Open1232.05151OpenAlexW2094057361MaRDI QIDQ645968FDOQ645968
Authors: Shakhar Smorodinsky, Yelena Yuditsky 
Publication date: 11 November 2011
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcta.2011.07.001
Recommendations
Cites Work
- \(\epsilon\)-nets and simplex range queries
- Almost tight bounds for \(\epsilon\)-nets
- Title not available (Why is that?)
- Convex polygons are cover-decomposable
- Multiple coverings of the plane with triangles
- Title not available (Why is that?)
- Title not available (Why is that?)
- Indecomposable coverings with concave polygons
- Decomposition of multiple coverings into more parts
- Decomposition of multiple coverings into many parts
- Coloring geometric range spaces
- Decomposing coverings and the planar sensor cover problem
- Indecomposable Coverings
- Colorful strips
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)
