An optimal algorithm for euclidean shortest paths in the plane

SIAM Journal on Computing

Volumn 28, Issue 6, 1999, Pages 2215-2256

  Hershberger, John ^a   Suri, Subhash ^b  

^a MENTOR GRAPHICS CORPORATION   (United States)

^b WASHINGTON UNIVERSITY   (United States)

Author keywords

Euclidean distance; Obstacle avoidance; Planar subdivision, weighted distance; Quadtree; Shortest path; Shortest path map

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING; TREES (MATHEMATICS);

EUCLIDEAN SHORTEST PATHS; OPTIMAL-TIME ALGORITHMS;

COMPUTATIONAL GEOMETRY;

EID: 0033330745     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539795289604     Document Type: Article

References (24)

1. T. ASANO, An efficient algorithm for finding the visibility polygons for a polygonal region with holes, Trans. IECE Japan, E-68 (1985), pp. 557-559.
2. T. ASANO, L. GUIDAS, J. HERSHBERGER, AND H. IMAI, Visibility of disjoint polygons, Algorith- mica, 1 (1986), pp. 49-63.
3. M. BERN, D. EPPSTEIN, AND J. R. GILBERT, Provably good mesh generation, in Proceedings of the 31st IEEE Symposium on Foundations of Computer Science, St. Louis, MO, 1990, pp. 231-241.
4. B. CHAZELLE, A theorem on polygon cutting with applications, in Proceedings of the 23rd IEEE Symposium on Foundations of Computer Science, Chicago, IL, 1982, pp. 339-349.
5. L. P. CHEW, There are planar graphs almost as good as the complete graph, J. Comput. System Sei., 39 (1989), pp. 205-219.
6. L. P. CHEW AND R. L. DRYSDALE, Voronoi diagrams based on convex distance functions, in Proceedings of the ACM Symposium on Computational Geometry, Baltimore, MD, 1985, pp. 235-244.
7. K. L. CLARKSON, Approximation algorithms for shortest path motion planning, in Proceedings of the 19th ACM Symposium on Theory of Computing, New York, NY, 1987, pp. 56-65.
8. T. CORMEN, C. LEISERSON, AND R. RIVEST, Introduction to Algorithms, MIT Press, Cambridge, MA, 1993.
9. E. W. DlJKSTRA, A note on two problems in connection with graphs, Numer. Math., 1 (1959), pp. 269-271.
10. H. EDELSBRUNNER, L. J. GUIBAS, AND J. STOLFI, Optimal point location in a monotone subdivision, SIAM J. Comput., 15 (1986), pp. 317-340.
11. M. FREDMAN AND R. TARJAN, Fibonacci heaps and their uses in improved network optimization algorithms, J. ACM, 34 (1987), pp. 596-615.
12. S. K. GHOSH AND D. M. MOUNT, An output-sensitive algorithm for computing visibility graphs, SIAM J. Comput., 20 (1991), pp. 888-910.
13. L. GUIDAS, J. HERSHBERGER, D. LEVEN, M. SHARIR, AND R. TARJAN, Linear time algorithms for visibility and shortest path problems inside triangulated simple polygons, Algorithmica, 2 (1987), pp. 209-233.
14. J. HERSHBERGER AND J. SNOEYINK, Computing minimum length paths of a given homotopy class, Comput. Geom., 4 (1994), pp. 63-97.
15. S. KAPOOR AND S. N. MAHESHWARI, Efficient algorithms for Euclidean shortest paths and visibility problems with polygonal obstacles, in Proceedings of the 4th ACM Symposium on omputational Geometry, Urbana-Champaign, IL, 1988, pp. 172-182.
16. D. KlRKPATRICK, Optimal search in planar subdivisions, SIAM J. Comput., 12 (1983), pp. 28- 35.
17. D. T. LEE AND F. P. PREPARATA, Euclidean shortest paths in the presence of rectilinear barriers, Networks, 14 (1984), pp. 393-410.
18. J. S. B. MlTCHELL, A new algorithm for shortest paths among obstacles in the plane, Ann. Math. Artificial Intelligence, 3 (1991), pp. 83-106.
19. J. S. B. MlTCHELL, Shortest paths among obstacles in the plane, Internat. J. Comput. Geom. Appl., 6 (1996), pp. 309-332.
20. J. S. B. MITCHELL, D. M. MOUNT, AND C. H. PAPADIMITRIOU, The discrete geodesic problem, SIAM J. Comput., 16 (1987), pp. 647-668.
21. M. H. OvERMARS AND E. WELZL, New methods for computing visibility graphs, in Proceedings of the 4th ACM Symposium on Computational Geometry, Urbana-Champaign, IL, 1988, pp. 164-171.
22. F. P. PREPARATA AND M. I. SHAMOS, Computational Geometry, Springer-Verlag, New York, 1985.
23. J. REIF AND J. STORER, Shortest paths in the plane with polygonal obstacles, J. ACM, 41 (1994), pp. 982-1012.
24. H. ROHNERT, Shortest paths in the plane with convex polygonal obstacles, Inform. Process. Lett., 23 (1986), pp. 71-76.