An optimal-time algorithm for shortest paths on realistic polyhedra

Discrete and Computational Geometry

Volumn 43, Issue 1, 2009, Pages 21-53

  Schreiber, Yevgeny ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Conforming subdivision; Continuous Dijkstra; Realistic polyhedral surface; Shortest path map; Terrain; Wavefront

Indexed keywords

EID: 72249086387     PISSN: 01795376     EISSN: 14320444     Source Type: Journal    
DOI: 10.1007/s00454-009-9136-8     Document Type: Article

References (26)

1. Agarwal, P.K., Katz, M.J., Sharir, M.: Computing depth orders for fat objects and related problems. Comput. Geom. Theory Appl. 5, 187-206 (1995).
2. Agarwal, P.K., Har-Peled, S., Sharir, M., Varadarajan, K.R.: Approximate shortest paths on a convex polytope in three dimensions. J. ACM 44, 567-584 (1997).
3. Aleksandrov, L., Maheshwari, A., Sack, J.-R.: An improved approximation algorithm for computing geometric shortest paths. In: Proc. of the 14th Internat. Sympos. Fundam. Comput. Theory (FCT'03). Lecture Notes in Computer Science, vol. 2751, pp. 246-257. Springer, Berlin (2003).
4. Alt, H., Fleischer, R., Kaufmann, M., Mehlhorn, K., Näher, S., Schirra, S., Uhrig, C.: Approximate motion planning and the complexity of the boundary of the union of simple geometric figures. Algorithmica 8, 391-406 (1992).
5. Chen, J., Han, Y.: Shortest paths on a polyhedron, Part I: Computing shortest paths. Int. J. Comput. Geom. Appl. 6, 127-144 (1996).
6. de Berg, M.: Linear size binary space partitions for uncluttered scenes. Algorithmica 28, 353-366 (2000).
7. de Berg, M., Katz, M.J., van der Stappen, A.F., Vleugels, J.: Realistic input models for geometric algorithms. Algorithmica 34, 81-97 (2002).
8. Har-Peled, S.: Constructing approximate shortest path maps in three dimensions. SIAM J. Comput. 28(4), 1182-1197 (1999).
9. Hershberger, J., Suri, S.: An optimal algorithm for Euclidean shortest paths in the plane. SIAM J. Comput. 28(6), 2215-2256 (1999).
10. Kapoor, S.: Efficient computation of geodesic shortest paths. In: Proc. of the 32nd Annual ACM Sympos. Theory Comput., pp. 770-779 (1999).
11. Lanthier, M., Maheshwari, A., Sack, J.-R.: Approximating shortest paths on weighted polyhedral surfaces. Algorithmica 30(4), 527-562 (2001).
12. Mata, C., Mitchell, J.S.B.: A new algorithm for computing shortest paths in weighted planar subdivisions. In: Proc. of the 13th Annual ACM Sympos. Comput. Geom., pp. 264-273 (1997).
13. Mitchell, J.S.B., Mount, D.M., Papadimitriou, C.H.: The discrete geodesic problem. SIAM J. Comput. 16, 647-668 (1987).
14. Moet, E., van Kreveld, M., van der Stappen, A.F.: On realistic terrains. In: Proc. of the 22nd Annual ACM Sympos. Comput. Geom., pp. 177-186 (2006).
15. Mount, D.M.: On finding shortest paths on convex polyhedra. Technical report, Computer Science Dept., Univ. Maryland, College Park (October 1984).
16. Mount, D.M.: Storing the subdivision of a polyhedral surface. Discrete Comput. Geom. 2, 153-174 (1987).
17. O'Rourke, J., Suri, S., Booth, H.: Shortest paths on polyhedral surfaces. In: Proc. of the 2nd Sympos. Theoretical Aspects of Computer Science. Lecture Notes in Computer Science, vol. 182, pp. 243-254. Springer, London (1985).
18. Schreiber, Y.: Euclidean shortest paths on polyhedra in three dimensions. Ph.D. thesis (2007). http://www.cs.tau.ac.il/research/yevgeny.schreiber/SchreiberThesis.pdf.
19. Schreiber, Y., Sharir, M.: An optimal-time algorithm for shortest paths on a convex polytope in three dimensions. Discrete Comput. Geom. (20th anniversary special issue) 39, 500-579 (2008), A full version available at http://www.math.tau.ac.il/~michas/ShortestPath.pdf. A preliminary version in Proc. of the 22nd Annual ACM Sympos. Comput. Geom., pp. 30-39 (2006).
20. Schwarzkopf, O., Vleugels, J.: Range searching in low-density environments. Inf. Process. Lett. 60, 121-127 (1996).
21. Sharir, M.: On shortest paths amidst convex polyhedra. SIAM J. Comput. 16, 561-572 (1987).
22. Sharir, M., Schorr, A.: On shortest paths in polyhedral spaces. SIAM J. Comput. 15, 193-215 (1986).
23. van der Stappen, A.F.: Motion planning amidst fat obstacles. Ph.D. thesis, Dept. Comput. Sci., Utrecht Univ., Utrecht, the Netherlands (1994).
24. van der Stappen, A.F., Overmars, M.H., de Berg, M., Vleugels, J.: Motion planning in environments with low obstacle density. Discrete Comput. Geom. 20(4), 561-587 (1998).
25. van Kreveld, M.: On fat partitioning, fat covering, and the union size of polygons. Comput. Geom. Theory Appl. 9, 197-210 (1998).
26. Varadarajan, K.R., Agarwal, P.K.: Approximating shortest paths on a nonconvex polyhedron. SIAM J. Comput. 30(4), 1321-1340 (2000).