Coloring Delaunay-edges and their generalizations
From MaRDI portal
Publication:1984605
DOI10.1016/j.comgeo.2021.101745zbMath1475.05166arXiv1806.03931OpenAlexW3120959722MaRDI QIDQ1984605
Balázs Keszegh, Eyal Ackerman, Dömötör Pálvölgyi
Publication date: 16 September 2021
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1806.03931
Related Items (2)
The \(\varepsilon\)-\(t\)-net problem ⋮ On the number of tangencies among 1-intersecting \(x\)-monotone curves
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unsplittable coverings in the plane
- Octants are cover-decomposable
- Coloring half-planes and bottomless rectangles
- \(\varepsilon\)-Mnets: Hitting geometric set systems with subsets
- Indecomposable coverings with concave polygons
- Polychromatic coloring for half-planes
- Convex polygons are self-coverable
- Chromatic number of Hasse diagrams, eyebrows and dimension
- Concrete and abstract Voronoi diagrams
- Coloring points with respect to squares
- On coloring points with respect to rectangles
- Polychromatic colorings and cover decompositions of hypergraphs
- Proper coloring of geometric hypergraphs
- Indecomposable coverings with homothetic polygons
- Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles
- Topological Hypergraphs
- Conflict-free coloring of points with respect to rectangles and approximation algorithms for discrete independent set
- Cover-Decomposition and Polychromatic Numbers
- Delaunay graphs of point sets in the plane with respect to axis‐parallel rectangles
- Aligned plane drawings of the generalized Delaunay-graphs for pseudo-disks
- A Finite Family of Pseudodiscs Must Include a “Small” Pseudodisc
- Survey on Decomposition of Multiple Coverings
- Indecomposable Coverings
This page was built for publication: Coloring Delaunay-edges and their generalizations
