Coloring geometric range spaces
DOI10.1007/S00454-008-9116-4zbMATH Open1257.52008OpenAlexW2077689859MaRDI QIDQ1017922FDOQ1017922
Authors: Greg Aloupis, Jean Cardinal, Sébastien Collette, Stefan Langerman, Shakhar Smorodinsky 
Publication date: 13 May 2009
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-008-9116-4
Recommendations
- Coloring Geometric Range Spaces
- On conflict-free coloring of points and simple regions in the plane
- On coloring points with respect to rectangles
- Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
- Proper coloring of geometric hypergraphs
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Combinatorial aspects of packing and covering (05B40) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)
Cites Work
- Title not available (Why is that?)
- \(\epsilon\)-nets and simplex range queries
- k-Degenerate Graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Coloring a Family of Circular Arcs
- Indecomposable Coverings
- Title not available (Why is that?)
- Low-Dimensional Linear Programming with Violations
- On the chromatic number of some geometric hypergraphs
- Title not available (Why is that?)
- Chromatic number of Hasse diagrams, eyebrows and dimension
- On \(k\)-sets in arrangements of curves and surfaces
- Title not available (Why is that?)
Cited In (7)
This page was built for publication: Coloring geometric range spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1017922)
