Coloring geometric range spaces

DOI10.1007/s00454-008-9116-4zbMath1257.52008OpenAlexW2077689859MaRDI QIDQ1017922

Sébastien Collette, Stefan Langerman, Greg Aloupis, Shakhar Smorodinsky, Jean Cardinal

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

zbMATH Keywords

coveringdecompositionscoloringgeometric hypergraphs

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Combinatorial aspects of packing and covering (05B40)

Related Items (6)

Coloring Axis-Parallel Rectangles ⋮ Coloring planar homothets and three-dimensional hypergraphs ⋮ Polychromatic coloring for half-planes ⋮ Colorful strips ⋮ On variants of conflict-free-coloring for hypergraphs ⋮ Proper coloring of geometric hypergraphs

Cites Work

• \(\epsilon\)-nets and simplex range queries
• On \(k\)-sets in arrangements of curves and surfaces
• Chromatic number of Hasse diagrams, eyebrows and dimension
• On the chromatic number of some geometric hypergraphs
• Towards an implementation of the 3D visibility skeleton
• Coloring a Family of Circular Arcs
• Low-Dimensional Linear Programming with Violations
• k-Degenerate Graphs
• Indecomposable Coverings
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Coloring geometric range spaces