Arrangements of Curves in the Plane - Topology, Combinatorics, and Algorithms

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.

[1]  J. Schwartz,et al.  On the “piano movers'” problem I. The case of a two‐dimensional rigid polygonal body moving amidst polygonal barriers , 1983 .

[2]  M. Atallah.  Some dynamic computational geometry problems , 1985 .

[3]  L. Guibas,et al.  Primitives for the manipulation of general subdivisions and the computation of Voronoi , 1985, TOGS.

[4]  Bernard Chazelle,et al.  The power of geometric duality , 1985, BIT Comput. Sci. Sect..

[5]  Micha Sharir,et al.  On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles , 1986, Discret. Comput. Geom..

[6]  Kurt Mehlhorn,et al.  Sorting Jordan Sequences in Linear Time Using Level-Linked Search Trees , 1986, Inf. Control..

[7]  Micha Sharir,et al.  Nonlinearity of davenport—Schinzel sequences and of generalized path compression schemes , 1986, FOCS.

[8]  Raimund Seidel,et al.  Constructing Arrangements of Lines and Hyperplanes with Applications , 1986, SIAM J. Comput..

[9]  Herbert Edelsbrunner,et al.  Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.

[10]  Yan Ke,et al.  Moving a ladder in three dimensions: upper and lower bounds , 1987, SCG '87.

[11]  Micha Sharir,et al.  Almost linear upper bounds on the length of general davenport—schinzel sequences , 1987, Comb..

[12]  Micha Sharir,et al.  Separating two simple polygons by a sequence of translations , 2015, Discret. Comput. Geom..

[13]  Kenneth L. Clarkson,et al.  Combinatorial complexity bounds for arrangements of curves and surfaces , 2015, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[14]  Leonidas J. Guibas,et al.  On the general motion-planning problem with two degrees of freedom , 2015, SCG '88.

[15]  Leonidas J. Guibas,et al.  The complexity of many faces in arrangements of lines of segments , 1988, SCG '88.

[16]  Joseph O'Rourke,et al.  Arrangements of lines in 3-space: a data structure with applications , 1988, SCG '88.

[17]  Micha Sharir,et al.  Planar realizations of nonlinear davenport-schinzel sequences by segments , 1988, Discret. Comput. Geom..

[18]  Micha Sharir,et al.  Improved lower bounds on the length of Davenport-Schinzel sequences , 1988, Comb..

[19]  Micha Sharir,et al.  Sharp upper and lower bounds on the length of general Davenport-Schinzel sequences , 2015, J. Comb. Theory, Ser. A.

[20]  Micha Sharir,et al.  Triangles in space or building (and analyzing) castles in the air , 1990, Comb..