Delaunay graphs of point sets in the plane with respect to axis‐parallel rectangles
DOI10.1002/RSA.20246zbMATH Open1228.05226OpenAlexW2514202683MaRDI QIDQ3608310FDOQ3608310
Authors: Xiaomin Chen, János Pach, Gábor Tardos, Mario Szegedy 
Publication date: 4 March 2009
Published in: Random Structures \& Algorithms (Search for Journal in Brave)
Full work available at URL: http://infoscience.epfl.ch/record/129408
Recommendations
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Computational aspects related to convexity (52B55) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Research Problems in Discrete Geometry
- Fast algorithms for direct enclosures and direct dominances
- On the independence number of sparse graphs
- Covering the plane with convex polygons
- Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks
- Online Conflict‐Free Coloring for Intervals
- Conflict-free coloring of points and simple regions in the plane
- On The Chromatic Number of Geometric Hypergraphs
- Indecomposable Coverings
- Conflict-free coloring for rectangle ranges using \(O(n ^{.382})\) colors
- Conflict-Free Colorings of Rectangles Ranges
- CONFLICT-FREE COLORINGS OF SHALLOW DISCS
- Coloring axis-parallel rectangles
- Chromatic number of Hasse diagrams, eyebrows and dimension
- On rectangular visibility
- Computational geometry algorithms for the systolic screen
Cited In (24)
- Coloring Delaunay-edges and their generalizations
- Proper coloring of geometric hypergraphs
- Polychromatic colorings of unions of geometric hypergraphs
- Improved Ramsey-type results for comparability graphs
- Title not available (Why is that?)
- Conflict-free coloring for rectangle ranges using \(O(n ^{.382})\) colors
- Hasse diagrams with large chromatic number
- Hitting and Piercing Rectangles Induced by a Point Set
- Witness rectangle graphs
- Coloring hypergraphs defined by stabbed pseudo-disks and \(ABAB\)-free hypergraphs
- Dushnik-Miller dimension of stair contact complexes
- Colouring bottomless rectangles and arborescences
- Coloring axis-parallel rectangles
- Coloring points with respect to squares
- Coloring Axis-Parallel Rectangles
- Nice point sets can have nasty Delaunay triangulations
- Word-representable graphs: orientations, posets, and bounds
- Matching random colored points with rectangles
- Coloring lines and Delaunay graphs with respect to boxes
- Stabbing boxes with finitely many axis-parallel lines and flats
- Coloring hypergraphs defined by stabbed pseudo-disks and ABAB-free hypergraphs
- On variants of conflict-free-coloring for hypergraphs
- Tight lower bounds for the size of epsilon-nets
- Dushnik-Miller dimension of TD-Delaunay complexes
This page was built for publication: Delaunay graphs of point sets in the plane with respect to axis‐parallel rectangles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608310)
