Arrangements of curves in the plane — topology, combinatorics, and algorithms
- Cite this paper as:
- Edelsbrunner H., Guibas L., Pach J., Pollack R., Seidel R., Sharir M. (1988) Arrangements of curves in the plane — topology, combinatorics, and algorithms. In: Lepistö T., Salomaa A. (eds) Automata, Languages and Programming. ICALP 1988. Lecture Notes in Computer Science, vol 317. Springer, Berlin, Heidelberg
Arrangements of curves in the plane are of fundamental significance in many problems of computational and combinatorial geometry (e.g. motion planning, algebraic cell decomposition, etc.). In this paper we study various topological and combinatorial properties of such arrangements under some mild assumptions on the shape of the curves, and develop basic tools for the construction, manipulation, and analysis of these arrangements. Our main results include a generalization of the zone theorem of [EOS], [CGL] to arrangements of curves (in which we show that the combinatorial complexity of the zone of a curve is nearly linear in the number of curves), and an application of (some weaker variant of) that theorem to obtain a nearly quadratic incremental algorithm for the construction of such arrangements.
Unable to display preview. Download preview PDF.