Arrangements of curves in the plane - topology, combinatorics, and algorithms
Herbert Edelsbrunner
Guibas, Leonidas
Pach, János
Pollack, Richard
Seidel, Raimund
Sharir, Micha
Arrangements of curves in the plane are fundamental to many problems in 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 Edelsbrunner (1986) and Chazelle (1985) 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 that theorem to obtain a nearly quadratic incremental algorithm for the construction of such arrangements.
Elsevier
1992
info:eu-repo/semantics/article
doc-type:article
text
http://purl.org/coar/resource_type/c_6501
https://research-explorer.app.ist.ac.at/record/4047
Edelsbrunner H, Guibas L, Pach J, Pollack R, Seidel R, Sharir M. Arrangements of curves in the plane - topology, combinatorics, and algorithms. <i>Theoretical Computer Science</i>. 1992;92(2):319-336. doi:<a href="https://doi.org/10.1016/0304-3975(92)90319-B">10.1016/0304-3975(92)90319-B</a>
info:eu-repo/semantics/altIdentifier/doi/10.1016/0304-3975(92)90319-B
info:eu-repo/semantics/closedAccess