Approximate shortest paths and geodesic diameter on a convex polytope in three dimensions

Discrete and Computational Geometry

Volumn 21, Issue 2, 1999, Pages 217-231

  Har Peled, S ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033482190     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00009417     Document Type: Article

References (18)

1. P. K. Agarwal, B. Aronov, J. O'Rourke, and C. Schevon. Star unfolding of a polytope with applications. SIAM J. Comput., 26:1679-1713, 1997
2. P. K. Agarwal, S. Har-Peled, M. Sharir, and K. R. Varadarajan. Approximate Shortest Paths on a Convex Polytope in Three Dimensions. Report CS-1996-12, Department Computer Science, Duke University, Durham, NC, 1996.
3. J. Canny and J. H. Reif. New lower bound techniques for robot motion planning problems. In Proc. 28th Ann. IEEE Symp. Found. Comput. Sci., pages 49-60, 1987.
4. J. Chen and Y. Han. Shortest paths on a polyhedron; Part I: computing shortest paths. Internat. J. Comput. Geom. Appl., 6(2): 127-144, 1996.
5. J. Choi, J. Sellen, and C. K. Yap. Approximate Euclidean shortest path in 3-space. In Proc. 10th Ann. ACM Symp. Comput. Geom., pages 41-48, 1994.
6. K. L. Clarkson. Approximation algorithms for shortest path motion planning. In Proc. 19th Ann. ACM Symp. Theory Comput., pages 56-65, 1987.
7. D.P. Dobkin and D. G. Kirkpatrick. A linear algorithm for determining the separation of convex polyhedra. J. Algorithms, 6:381-392, 1985.
8. D. P. Dobkin and D. G. Kirkpatrick. Determining the separation of preprocessed polyhedra - a unified approach. In Proc. 17th Internat. Colloq. Automata Lang. Program., pages 400-413. Lecture Notes in Computer Science, volume 443. Springer-Verlag, Berlin, 1990.
9. S. Har-Peled. Constructing approximate shortest path maps in three dimensions. In Proc. 14th Ann. ACM Symp. Comput. Geom., 1998, to appear.
10. J. Hershberger. Personal communication, 1997.
11. 3. In Proc. 6th ACM-SIAM Symp. Discrete Algorithms, pages 447-456, 1995.
12. J. S. B. Mitchell, D. M. Mount, and C. H. Papadimitriou. The discrete geodesic problem. SIAM J. Comput., 16:647-668, 1987.
13. C. H. Papadimitriou. An algorithm for shortest-path motion in three dimensions. Inform. Process. Lett., 20:259-263, 1985.
14. A. V. Pogorelov. Extrinsic Geometry of Convex Surfaces. Translations of Mathematical Monographs, volume 35. American Mathematical Society. Providence, RI, 1973.
15. J. H. Reif and J. A. Storer. A single-exponential upper bound for finding shortest paths in three dimensions. J. Assoc. Comput. Mach., 41(5):1013-1019, 1994.
16. M. Sharir. On shortest paths amidst convex polyhedra. SIAM J. Comput., 16:561-572, 1987.
17. M. Sharir and A. Schorr. On shortest paths in polyhedral spaces. Siam J. Comput., 15:193-215, 1986.
18. K. R. Varadarajan and P. K. Agarwal. Approximating shortest paths on a polyhedron. Manuscript, 1996.