Coloring points with respect to squares
From MaRDI portal
Publication:1688853
DOI10.1007/s00454-017-9902-yzbMath1388.52013OpenAlexW2963729706MaRDI QIDQ1688853
Eyal Ackerman, Balázs Keszegh, Máté Vizer
Publication date: 11 January 2018
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2016/5897/
Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15) Coloring of graphs and hypergraphs (05C15)
Related Items (6)
Polychromatic colorings of unions of geometric hypergraphs ⋮ Colouring bottomless rectangles and arborescences ⋮ Coloring intersection hypergraphs of pseudo-disks ⋮ Coloring Hypergraphs Defined by Stabbed Pseudo-Disks and ABAB-Free Hypergraphs ⋮ Coloring Delaunay-edges and their generalizations ⋮ Coloring intersection hypergraphs of pseudo-disks
Cites Work
- Unnamed Item
- Unnamed Item
- Unsplittable coverings in the plane
- Octants are cover-decomposable
- Conflict-free coloring for rectangle ranges using \(O(n ^{.382})\) colors
- Coloring half-planes and bottomless rectangles
- Indecomposable coverings with concave polygons
- Decomposition of multiple coverings into more parts
- Optimally decomposing coverings with translates of a convex polygon
- Polychromatic coloring for half-planes
- Convex polygons are self-coverable
- Decomposition of multiple coverings into many parts
- Coloring axis-parallel rectangles
- Covering the plane with convex polygons
- Concrete and abstract Voronoi diagrams
- On coloring points with respect to rectangles
- Indecomposable coverings with homothetic polygons
- Convex polygons are cover-decomposable
- Octants are cover-decomposable into many coverings
- Multiple coverings of the plane with triangles
- Conflict-free coloring of points and simple regions in the plane
- Topological Hypergraphs
- Conflict-free coloring of points with respect to rectangles and approximation algorithms for discrete independent set
- On the stretch factor of convex Delaunay graphs
- Making triangles colorful
- More on decomposing coverings by octants
- Delaunay graphs of point sets in the plane with respect to axis‐parallel rectangles
- Proper Coloring of Geometric Hypergraphs
- Making Octants Colorful and Related Covering Decomposition Problems
- Survey on Decomposition of Multiple Coverings
- Conflict-Free Coloring and its Applications
- Indecomposable Coverings
This page was built for publication: Coloring points with respect to squares
