GEOMETRIC APPLICATIONS OF DAVENPORT-SCHINZEL SEQUENCES.

Annual Symposium on Foundations of Computer Science (Proceedings)

Volumn , Issue , 1986, Pages 77-86

  Sharir, Micha ^a   Cole, Richard ^a   Kedem, Klara ^a   Leven, Daniel ^a   Pollack, Richard ^a   Sifrony, Shmuel ^a  

^a NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION THEORY AND ANALYSIS;

DAVENPORT-SCHINZEL SEQUENCES; DISCRETE/COMPUTATIONAL GEOMETRY; GEOMETRIC APPLICATIONS; POLYGON CONTAINMENT PROBLEM; SEARCH PROCESS;

MATHEMATICAL TECHNIQUES;

EID: 0022864715     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.1986.23     Document Type: Conference Paper

References (32)

1. M. Atallah Dynamic computational geometry Proc. 24th Symp. on Foundations of Computer Science 92 99 Proc. 24th Symp. on Foundations of Computer Science 1983
2. A. Baltsan M. Sharir On shortest paths between two convex polyhedra Sept. 1985 180 Comp. Science Dept., Courant Institute
3. B. K. Bhattacharya G. T. Toussaint A linear algorithm for determining translation separability of two simple polygons 1986 SOCS-86.1 McGill University
4. B. Chazelle A theorem on polygon cutting with applications Proc. 23th IEEE Symp. on Foundations of Computer Science 339 349 Proc. 23th IEEE Symp. on Foundations of Computer Science 1982
5. B. Chazelle Advances in Computing Research, Vol. I: Computational Geometry 1 33 1983 JAI Press Connecticut, Greenwich The polygon containment problem
6. B. Chazelle L. Guibas Visibility and intersection problems in plane geometry Proc. ACM Symposium on Computational Geometry 135 146 Proc. ACM Symposium on Computational Geometry 1985
7. B. Chazelle L. Guibas Fractional cascading: A data structuring technique with geometric applications Proc. 12th Int. Colloq. on Automata, Languages and Programming 90 99 Proc. 12th Int. Colloq. on Automata, Languages and Programming 1985
8. R. Cole Searching and storing similar lists J. Algorithms
9. H. Davenport A combinatorial problem connected with differential equations, II Acta Arithmetica 17 363 372 1971
10. H. Davenport A. Schinzel A combinatorial problem connected with differential equations Amer. J. Math. 87 684 694 1965
11. L. De Floriani B Falcidieno C. Pienovi D. Allen G. Nagy A visibility-based model for terrain features Proc. Int. Symp. on Spatial Data Handling Proc. Int. Symp. on Spatial Data Handling Seattle 1986-July
12. J. Driscoll N. Sarnak D. Sleator R. E. Tarjan Making data structures persistent Proc. 18th Symp. on Theory of Computing 109 121 Proc. 18th Symp. on Theory of Computing 1986
13. S. Hart M. Sharir Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes August 1984 11/84 The Eskenasy Institute of Computer Sciences, Tel Aviv University
14. K. Kedem R. Livne J. Pach M. Sharir On the union of Jordan regions and collisionfree translational motion amidst polygonal obstacles Discrete and Computational Geometry 1 59 71 1986
15. K. Kedem M. Sharir An efficient algorithm for planning collision-free translational motion of a convex polygonal object in 2-dimensional space amidst polygonal obstacles Proc. ACM Symp. on Computational Geometry 75 80 Proc. ACM Symp. on Computational Geometry 1985
16. D. Leven M. Sharir An Efficient and Simple Motion Planning Algorithm for a Ladder Moving in Two-Dimensional Space Amidst Polygonal Barriers Proc. ACM Symp. on Computational Geometry 221 227 Proc. ACM Symp. on Computational Geometry 1985
17. D. Leven M. Sharir Planning a Purely Translational Motion for a Convex Object in Two-dimensional Space Using Generalized Voronoi Diagrams June 1985 34/85 The Eskenasy Institute of Computer Science, Tel Aviv University
18. D. Leven M. Sharir On the number of critical free contacts of a convex polygonal object moving in 2-dimensional polygonal space October 1985 187 Comp. Sci. Dept., Courant Institute
19. T. Lozano-Perez M. Wesley An algorithm for planning collision-free paths among polyhedral obstacles Comm. ACM 22 560 570 1979
20. M. McKenna Worst-case optimal hiddensurface removal 1986 JHU/EECS86/05 The Johns Hopkins University
21. C. O'Dunlaing M. Sharir C. Yap Generalized Voronoi Diagrams for a Ladder: II. Efficient Construction of the Diagram November 1984 140 Computer Science Dept., Courant Institute
22. R. Pollack M. Sharir S. Sifrony Separating two simple polygons by a sequence of translations April 1986 215 Comp. Sci. Dept., Courant Institute
23. M. Sharir Almost Linear Upper Bounds on the Length of General Davenport-Schinzel Sequences February 1985 29/85 The Eskenasy Institute of Computer Sciences, Tel Aviv University
24. M. Sharir On the two-dimensional Davenport Schinzel problem December 1985 193 Comp. Science Dept., Courant Institute
25. M. Sharir Improved lower bounds on the length of Davenport Schinzel sequences february 1986 204 Comp. Sci. Dept., Courant Institute
26. M. Sharir R. Livne On Minima of Functions, Intersection Patterns of Curves, and Davenport-Schinzel Sequences Proc. 26th FOCS Symposium 312 320 Proc. 26th FOCS Symposium 1985
27. S. Sifroni M. Sharir An Efficient Motion Planning Algorithm for a Rod Moving in Two-dimensional Polygonal Space August 1985 85-40 The Eskenasy Institute of Computer Sciences, Tel Aviv University
28. E. Szemeredi On a Problem by Davenport and Schinzel Acta Arithmetica 25 213 224 1974
29. G. T. Toussaint Computational Geometry 335 375 1985 North-Holland Movable separability of sets
30. A. Wiernik Planar realization of non-linear Davenport-Schinzel sequences by segments Proc. 27th IEEE Symp. on Foundations of Computer Science Proc. 27th IEEE Symp. on Foundations of Computer Science 1986