# Arrangements of curves in the plane — topology, combinatorics, and algorithms

## Abstract

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.

## Keywords

Line Segment Computational Geometry Jordan Curve Cell Decomposition Vertical Tangency## Preview

Unable to display preview. Download preview PDF.

## References

- [ASS]P. Agarwal, M. Sharir and P. Shor, Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences, Rep. 332, Comput. Sci. Dept., Courant Institute, New York, 1987.Google Scholar
- [AS]B. Aronov and M. Sharir, Triangles in space, or: Building and analyzing castles in the air,
*Proc. 4th ACM Symp. on Computational Geometry,*1988.Google Scholar - [At]M. Atallah, Some dynamic computational problems,
*Comp. Math. Appls.*11 (1985), pp. 1171–1181.Google Scholar - [CE]B. Chazelle and H. Edelsbrunner An optimal algorithm for intersecting line segments in the plane, Rep. UIUCDCS-R-88-1419, Dept. Comput. Sci., Univ. Illinois, Urbana, 1988.Google Scholar
- [CGL]B. Chazelle, L. Guibas and D.T. Lee, The power of geometric duality,
*BIT*25 (1985) pp. 76–90.Google Scholar - [CL]B. Chazelle and D.T. Lee, On a circle placement problem,
*Computing*36 (1986), pp. 1–16.Google Scholar - [CEGSW]K. Clarkson, H. Edelsbrunner, L. Guibas, M. Sharir and E. Welzl, Combinatorial complexity bounds for arrangements, in preparation.Google Scholar
- [Ed]H. Edelsbrunner,
*Algorithms in Combinatorial Geometry*, Springer-Verlag, Heidelberg, 1987.Google Scholar - [EGS]H. Edelsbrunner, J. L. Guibas and M. Sharir, The complexity of many faces in arrangements of lines and of segments,
*Proc. 4th ACM Symp. on Computational Geometry*, 1988.Google Scholar - [EOS]H. Edelsbrunner, J. O'Rourke and R. Seidel, Constructing arrangements of lines and hyperplanes with applications,
*SIAM J. Comput.*15 (1986), pp. 341–363. 1983, pp. 83–91.Google Scholar - [GSS]L. Guibas, M. Sharir and S. Sifrony, On the general motion planning problem with two degrees of freedom,
*Proc. 4th ACM Symp. on Computational Geometry*, 1988.Google Scholar - [GS]L. Guibas and J. Stolfi, Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams,
*ACM Trans. Graphics*4 (1985) pp. 74–123.Google Scholar - [HS]S. Hart and M. Sharir, Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes,
*Combinatorica*6 (1986), pp. 151–177.Google Scholar - [HMRT]K. Hoffman, K. Mehlhorn, P. Rosenstiehl and R.E. Tarjan, Sorting Jordan sequences in linear time, using level-linked search trees,
*Information and Control*68 (1986) pp. 170–184.Google Scholar - [KO]Y. Ke and J. O'Rourke, Moving a ladder in three dimensions: Upper and lower bounds,
*Proc. 3rd ACM Symp. on Computational Geometry,*1987, pp. 136–146.Google Scholar - [KLPS]K. Kedem, R. Livne, J. Pach and M. Sharir, On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles,
*Discrete Comput. Geom.*1 (1986), pp. 59–71.Google Scholar - [MO]M. McKenna and J. O'Rourke, Arrangements of lines in 3-space: A data structure with applications,
*Proc. 4th ACM Symp. on Computational Geometry*, 1988.Google Scholar - [PSS]R. Pollack, M. Sharir and S. Sifrony, Separating two simple polygons by a sequence of translations,
*Discrete Comput. Geom.*3 (1988), pp. 123–136.Google Scholar - [SS1]J.T. Schwartz and M. Sharir, On the piano movers' problem: I. The case of a rigid polygonal body moving amidst polygonal barriers,
*Comm. Pure Appl. Math.*36 (1983), pp. 345–398.Google Scholar - [SS]J.T. Schwartz and M. Sharir, On the two-dimensional Davenport Schinzel problem, Rep. 193 (revised), Comp. Sci. Dept., Courant Institute, New York, July 1987.Google Scholar
- [Sh1]M. Sharir, Almost linear upper bounds on the length of general Davenport-Schinzel sequences,
*Combinatorica*7 (1987) pp. 131–143.Google Scholar - [Sh2]M. Sharir, Improved lower bounds on the length of Davenport Schinzel sequences, to appear in
*Combinatorica*.Google Scholar - [Sho]P. Shor, Geometric realizations of superlinear Davenport Schinzel sequences, in preparation.Google Scholar
- [TDS]C. Thomborson, L. Deneen and G. Shute, A uniform representation for partially embedded graphs, manuscript, 1987.Google Scholar
- [WS]A. Wiernik and M. Sharir, Planar realization of nonlinear Davenport Schinzel sequences by segments,
*Discrete Comput. Geom.*3 (1988), pp. 15–47.Google Scholar