%0 Journal Article
%T Coloring geometric hyper-graph defined by an arrangement of half-planes
%A Radoslav Fulek
%J Mathematics
%D 2010
%I arXiv
%X We prove that any finite set of half-planes can be colored by two colors so that every point of the plane, which belongs to at least three half-planes in the set, is covered by half-planes of both colors. This settles a problem of Keszegh.
%U http://arxiv.org/abs/1002.4529v2