Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles

Authors:
Xiaomin Chen;János Pach;Mario Szegedy;Gábor Tardos
Affiliations:
Google, 76 Ninth Avenue, New York, New York, 10011;EPFL, Lausanne, Switzerland and Courant Institute, NYU, New York, New York 10012;Rutgers University, Piscataway, New Jersey 08854-8019W;Simon Fraser University, Burnaby, British Columbia, Canada V5A 1S6 and Rényi Institute, H-1055 Budapest, Hungary
Venue:
Random Structures & Algorithms - Proceedings of the Thirteenth International Conference “Random Structures and Algorithms” held May 28–June 1, 2007, Tel Aviv, Israel
Year:
2009

Citing 0
Cited 7

Coloring Axis-Parallel Rectangles

Computational Geometry and Graph Theory
Notes: Coloring axis-parallel rectangles

Journal of Combinatorial Theory Series A
The potential to improve the choice: list conflict-free coloring for geometric hypergraphs

Proceedings of the twenty-seventh annual symposium on Computational geometry
Tight lower bounds for the size of epsilon-nets

Proceedings of the twenty-seventh annual symposium on Computational geometry
Conflict-free coloring of points with respect to rectangles and approximation algorithms for discrete independent set

Proceedings of the twenty-eighth annual symposium on Computational geometry
On coloring points with respect to rectangles

Journal of Combinatorial Theory Series A
Coloring hypergraphs induced by dynamic point sets and bottomless rectangles

WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the connection and analogy between certain cardinality inequalities of combinatorial number theory and some entropy inequalities. We present a class of inequalities where the two forms are equivalent, and exhibit cases when one only suggests ...