On critical orientations in the Kedem-Sharir motion planning algorithm

Discrete and Computational Geometry

Volumn 17, Issue 2, 1997, Pages 227-239

  Kedem, K ^a   Sharir, M ^b,c   Toledo, S ^b  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b TEL AVIV UNIVERSITY   (Israel)

^c NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031542174     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02770875     Document Type: Article

References (7)

1. P. Agarwal, M. Sharir, and P. Shor, Improved bounds for the length of general Davenport-Schinzel sequences, J. Combin. Theory Ser. A 52 (1989), 228-274.
2. S. Hart and M. Sharir, Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes, Combinatorica 6 (1986), 151-177.
3. 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), 59-71.
4. K. Kedem and M. Sharir, An efficient motion-planning algorithm for a convex polygonal object in two-dimensional polygonal space, Discrete Comput. Geom. 5 (1990), 43-75.
5. D. Leven and M. Sharir, On the number of critical free contacts of a convex polygonal object moving in 2-D polygonal space, Discrete Comput. Geom. 2 (1987), 255-270.
6. M. Sharir and S. Toledo, Extremal polygon containment problems, Comput. Geom. Theory Appl. 4 (1994), 99-118.
7. S. Toledo, Extremal polygon containment problems, Proc. 7th Ann. Symp. on Computational Geometry, 1991, pp. 176-185.