Geometric applications of Davenport-Schinzel sequences

We present efficient algorithms for the following geometric problems: (i) Preprocessing of a 2-D polyhedral terrain so as to support fast ray shooting queries from a fixed point. (ii) Determining whether two disjoint interlocking simple polygons can be separated from one another by a sequence of translations. (iii) Determining whether a given convex polygon can be translated and rotated so as to fit into another given polygonal region. (iv) Motion planning for a convex polygon in the plane amidst polygonal barriers. All our algorithms make use of Davenport Schinzel sequences and on some generalizations of them; these sequences are a powerful combinatorial tool applicable in contexts which involve the calculation of the pointwise maximum or minimum of a collection of functions.

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

[2]  Ady Wiernik,et al.  Planar realizations of nonlinear davenport-schinzel sequences by segments , 1988, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[3]  Robert E. Tarjan,et al.  Making data structures persistent , 1986, STOC '86.

[4]  Micha Sharir,et al.  On the shortest paths between two convex polyhedra , 2018, JACM.

[5]  Richard Cole,et al.  Searching and Storing Similar Lists , 2018, J. Algorithms.

[6]  Bernard Chazelle,et al.  A theorem on polygon cutting with applications , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[7]  E. Szemerédi.  On a problem of Davenport and Schinzel , 1974 .

[8]  Leonidas J. Guibas,et al.  Fractional Cascading: A Data Structuring Technique with Geometric Applications , 1985, ICALP.

[9]  Mikhail J. Atallah,et al.  Dynamic computational geometry , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[10]  Godfried T. Toussaint,et al.  Movable Separability of Sets , 1985 .

[11]  Micha Sharir,et al.  On minima of function, intersection patterns of curves, and davenport-schinzel sequences , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[12]  Micha Sharir,et al.  An efficient and simple motion planning algorithm for a ladder moving in two-dimensional space amidst polygonal barriers (extended abstract) , 1985, SCG '85.

[13]  Micha Sharir,et al.  An efficient algorithm for planning collision-free translational motion of a convex polygonal object in 2-dimensional space amidst polygonal obstacles , 1985, SCG '85.

[14]  Michael McKenna.  Worst-case optimal hidden-surface removal , 1987, TOGS.

[15]  H. Davenport,et al.  A Combinatorial Problem Connected with Differential Equations , 1965 .

[16]  H. Davenport.  A combinatorial problem connected with differential equations II , 1971 .

[17]  Tomás Lozano-Pérez,et al.  An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.

[18]  Micha Sharir,et al.  Planning a purely translational motion for a convex object in two-dimensional space using generalized Voronoi diagrams , 2016, Discret. Comput. Geom..

[19]  Leonidas J. Guibas,et al.  Visibility and intersectin problems in plane geometry , 1985, SCG '85.

[20]  Micha Sharir,et al.  On the number of critical free contacts of a convex polygonal object moving in two-dimensional polygonal space , 1987, Discret. Comput. Geom..

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

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

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