Coloring geometric hypergraph defined by an arrangement of half-planes

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.

• Type: Conference
• Year: 2010
• Where: CCCG
• Authors: Radoslav Fulek
• Keywords: CCCG 2010, Computational Geometry, Finite Set