Conflict-Free Coloring of Points and Simple Regions in the Plane

Authors:
Sariel Har-Peled;Shakhar Smorodinsky
Affiliations:
Department of Computer Science, University of Illinois, 201 N. Goodwin Avenue, Urbana, IL 61801, USA;Institute for Theoretische Informatik, ETH Zurich, IFW CH-8092, Zurich, Switzerland
Venue:
Discrete & Computational Geometry
Year:
2005

Citing 0
Cited 26

On the chromatic number of some geometric hypergraphs

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Conflict-free colorings of shallow discs

Proceedings of the twenty-second annual symposium on Computational geometry
How to play a coloring game against a color-blind adversary

Proceedings of the twenty-second annual symposium on Computational geometry
Conflict-free coloring for intervals: from offline to online

Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Conflict-free coloring for rectangle ranges using O(n.382) colors

Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Deterministic conflict-free coloring for intervals: From offline to online

ACM Transactions on Algorithms (TALG)
Coloring Axis-Parallel Rectangles

Computational Geometry and Graph Theory
Online conflict-free coloring for halfplanes, congruent disks, and axis-parallel rectangles

ACM Transactions on Algorithms (TALG)
Dynamic Offline Conflict-Free Coloring for Unit Disks

Approximation and Online Algorithms
Conflict-free colourings of graphs and hypergraphs

Combinatorics, Probability and Computing
Notes: Coloring axis-parallel rectangles

Journal of Combinatorial Theory Series A
Online conflict-free colouring for hypergraphs

Combinatorics, Probability and Computing
Graph unique-maximum and conflict-free colorings

Journal of Discrete Algorithms
The potential to improve the choice: list conflict-free coloring for geometric hypergraphs

Proceedings of the twenty-seventh annual symposium on Computational geometry
Conflict-Free colorings of rectangles ranges

STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Ordered coloring grids and related graphs

SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Unique-maximum and conflict-free coloring for hypergraphs and tree graphs

SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Coloring half-planes and bottomless rectangles

Computational Geometry: Theory and Applications
Conflict-Free Coloring of points on a line with respect to a set of intervals

Computational Geometry: Theory and Applications
Coloring planar homothets and three-dimensional hypergraphs

LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
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
Online conflict-free colorings for hypergraphs

ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
On coloring points with respect to rectangles

Journal of Combinatorial Theory Series A
Coloring planar homothets and three-dimensional hypergraphs

Computational Geometry: Theory and Applications
A procedure for computing the symmetric difference of regions defined by polygonal curves

Journal of Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

A geometric permutation induced by a transversal line of a finite family ℱ of disjoint convex sets in ℝd is the order in which the transversal meets the members of the family. We prove that for each natural k, each family of ...