A near-quadratic algorithm for planning the motion of a polygon in a polygonal environment

Discrete and Computational Geometry

Volumn 16, Issue 2, 1996, Pages 121-134

  Halperin, D ^a,b   Sharir, M ^b,c  

^a Stanford University   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

^c NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030516633     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02716803     Document Type: Article

References (17)

1. B. Aronov and M. Sharir, Triangles in space, or building (and analyzing) castles in the air, Combinatorica 10 (1990), 137-173.
2. B. Aronov and M. Sharir, Castles in the air revisited, Discrete Comput. Geom. 12 (1994), 119-150.
3. L. P. Chew and K. Kedem, A convex polygon among polygonal obstacles: placement and high-clearance motion, Comput. Geom. Theory Appl. 3(2) (1993), 59-89.
4. M. de Berg, K. Dobrindt, and O. Schwarzkopf, On lazy randomized incremental construction, Discrete Comput. Geom. 14 (1995), 261-286.
5. L. Guibas and M. Sharir, Combinatorics and algorithms of arrangements, in New Trends in Discrete and Computational Geometry (J. Pach, ed.), Springer-Verlag, New York, 1993, pp. 9-36.
6. D. Halperin, Algorithmic Motion Planning via Arrangements of Curves and of Surfaces, Ph.D. Dissertation, Computer Science Department, Tel Aviv University, July 1992.
7. D. Halperin and M. Sharir, Arrangements and their applications in robotics: recent developments, in The Algorithmic Foundations of Robotics (K. Goldberg, D. Halperin, J.-C. Latombe, and R. Wilson, eds.), A. K. Peters, Boston, MA, 1995, pp. 495-511.
8. D. Halperin and M. Sharir, Almost tight upper bounds for the single cell and zone problems in three dimensions, Discrete Comput. Geom. 14 (1995), 385-410.
9. 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.
10. K. Kedem, M. Sharir, and S. Toledo, On critical orientations in the Kedem-Sharir motion planning algorithm for a convex polygon in the plane, Proc. 5th Canadian Conf. on Computational Geometry, 1993, pp. 204-209.
11. 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.
12. J. Matoušek, Approximations and optimal geometric divide-and-conquer, Proc. 23rd ACM Symp. on Theory of Computing, 1991, pp. 506-511.
13. J. T. Schwartz and M. Sharir, On the two-dimensional Davenport-Schinzel problem, J. Symbolic Comput. 10 (1990), 371-393.
14. M. Sharir and P. K. Agarwal, Davenport-Schinzel Sequences and Their Geometric Applications, Cambridge University Press, New York, 1995.
15. M. Sharir and S. Toledo, Extremal polygon containment problems, Comput. Geom. Theory Appl. 4 (1994), 99-118.
16. D. D. Sleator, R. E. Tarjan, and W. P. Thurston, Rotation distance, triangulations, and hyperbolic geometry, J. Amer. Math. Soc. 1 (1988), 647-681.
17. R. E. Tarjan, Data Structures and Network Algorithms, SIAM, Philadelphia, PA, 1983.