Shortest paths among obstacles in the plane

International Journal of Computational Geometry and Applications

Volumn 6, Issue 3, 1996, Pages 309-332

  Mitchell, Joseph S B ^a  

^a Stony Brook University   (United States)

Author keywords

Continuous dijkstra; Geodesics; Range search; Shortest paths; Voronoi diagrams

Indexed keywords

EID: 0030504179     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195996000216     Document Type: Article

References (32)

1. P. K. Agarwal, "Ray shooting and other applications of spanning trees and low stabbing number", Proc. 5th Annual ACM Symposium on Computational Geometry, Saarbrücken, Germany, 1989, pp. 315-325.
2. P. K. Agarwal, Personal communication, 1992.
3. P. K. Agarwal and J. Matoušek, "On range searching with semialgebraic sets", Proc. 17th International Symposium on Mathematical Foundations of Computer Science, Springer-Verlag Lecture Notes in Computer Science, Vol. 629 (1992), pp. 1-13.
4. T. Asano, T. Asano, L. Guibas, J. Hershberger, and H. Imai, "Viability of disjoint polygons", Algorithmica 1 (1986) 49-63.
5. AlgorithmicaB. Chazelle, "An algorithm for segment dragging and its implementation", Algorithmica 3 (1988) 205-221.
6. B. Chazelle, H. Edelsbrunner, M. Grigni, L. Guibas, J. Hershberger, M. Sharir, and J. Snoeyink, "Ray shooting in polygons using geodesic triangulations", Proc. 18th Internat. Colloq. on Automat. Lang. Program., Springer-Verlag, 1991, pp. 661-673.
7. B. Chazelle, M. Sharir, and E. Welzl. "Quasi-optimal upper bounds for simplex range searching and new zone theorems", Algorithmica 8 (1992) 407-429.
8. J. Chen and Y. Han, "Shortest paths on a polyhedron", Proc. 6th Annual ACM Symposium on Computational Geometry, Berkeley, CA, June, 1990, pp. 360-369.
9. S. W. Cheng and R. Janardan, "Space-efficient ray shooting and intersection searching: algorithms, dynamization and applications", Proc. 2nd ACM-SIAM Sympos. Discrete Algorithms, 1991, pp. 7-16.
10. L. Gewali, A. Meng, J.S.B. Mitchell, and S. Ntafos, "Path planning in 0/1/∞ weighted regions with applications", ORSA Journal on Computing 2 (1990) 253-272.
11. S.K. Ghosh and D.M. Mount, "An output-sensitive algorithm for computing visibility graphs", SIAM Journal on Computing 20 (1991) 888-910.
12. M. T. Goodrich and R, Tamassia, "Dynamic ray shooting and shortest paths via balanced geodesic triangulations", Proc. Ninth Annual ACM Symposium on Computational Geometry, San Diego, CA, May, 1993, pp. 318-327.
13. J. Hershberger and S. Suri, "A pedestrian approach to ray shooting: Shoot a ray, take a walk", Proc. 4th ACM-SIAM Sympos. Discrete Algorithms, 1993, pp. 54-63.
14. J. Hershberger and S. Suri, "On computing Euclidean shortest paths in the plane", Proc. 34th Annu. IEEE Sympos. Found. Comput. Sci., 1993, pp. 508-517.
15. J. Hershberger and S. Suri, "An optimal-time shortest paths algorithm in the plane", manuscript in preparation, 1995.
16. S. Kapoor and S.N. Maheshwari, "Efficient algorithms for Euclidean shortest path and visibility problems with polygonal obstacles", Proc. Fourth Annual ACM Symposium on Computational Geometry, Urbana-Champaign, IL, June, 1988, pp. 172-182.
17. D. G. Kirkpatrick, "Efficient computation of continuous skeletons", Proc. 20th Annu. IEEE Sympos. Found. Comput. Sci., 1979, pp. 18-27.
18. D.T. Lee, "Proximity and Reachability in the Plane", Ph.D. Thesis, Report R-831, Dept. of Electrical Engineering, University of Illinois at Urbana-Champaign, Nov. 1978.
19. D.T. Lee and P.P. Preparata, "Euclidean shortest paths in the presence of rectilinear boundaries", Networks 14 (1984) 393-410.
20. J. Matoušek, "Range searching with efficient hierarchical cuttings", Discrete Comput. Geom. 10 (1993) 157-182.
21. N. Megiddo, "Applying parallel computation algorithms in the design of sequential algorithms", Journal of the ACM 30 (1983) 852-865.
22. J.S.B. Mitchell, "An optimal algorithm for shortest rectilinear paths among obstacles", First Canadian Conference on Computational Geometry, Montreal, Canada, August, 1989.
23. J.S.B. Mitchell, "On maximum flows in polyhedral domains", Journal of Computer and System Sciences 40 (1990) 88-123.
24. J.S.B. Mitchell, "A new algorithm for shortest paths among obstacles in the plane", Annals of Mathematics and Artificial Intelligence 3 (1991) 83-106.
25. 1 shortest paths among polygonal obstacles in the plane", Algorithmica 8 (1992) 55-88.
26. J.S.B. Mitchell, "Shortest paths among obstacles in the plane", Proc. Ninth Annual ACM Symposium on Computational Geometry, San Diego, CA, May, 1993, pp. 308-317.
27. J.S.B. Mitchell, D.M. Mount, and C.H. Papadimitriou, "The discrete geodesic problem", SIAM Journal on Computing 16 (1987) 647-668.
28. J.S.B. Mitchell and C.H. Papadimitriou, "The weighted region problem: Finding shortest paths through a weighted planar subdivision", Journal of the ACM 38 (1991) 18-73.
29. M.H. Overmars and E. Welzl, "New methods for computing visibility graphs", Proc. Fourth Annual ACM Symposium on Computational Geometry, Urbana-Champaign, IL, June, 1988, pp. 164-171.
30. M. Sharir and A. Schorr, "On shortest paths in polyhedral spaces", SIAM Journal on Computing 1 (1986) 193-215.
31. J. A. Storer and J. H. Reif, "Shortest paths in the plane with polygonal obstacles", Journal of the ACM 41 (1994) 982-1012.
32. 2) time", Information Processing Letters 20 (1985) 167-171.