Approximating shortest paths on a convex polytope in three dimensions

Journal of the ACM

Volumn 44, Issue 4, 1997, Pages 567-584

  Agarwal, Pankaj K ^a,d   Har Peled, Sariel ^b   Sharir, Micha ^b,c   Varadarajan, Kasturi R ^a,d  

^a DUKE UNIVERSITY   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

^c NEW YORK UNIVERSITY   (United States)

^d Duke University   (United States)

Author keywords

Algorithms; Approximation algorithms; Convex polytopes; Euclidean shortest paths; Theory

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY;

CONVEX POLYTOPES; SHORTEST PATH DISTANCES;

COMPUTATIONAL GEOMETRY;

EID: 0031175637     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/263867.263869     Document Type: Article

References (21)

1. BALTSAN, A., AND SHARIR, M. 1988. On shortest paths between two convex polyhedra. J. ACM 35, 2(Apr.), 267-287.
2. CANNY, J., AND REIF, J. H. 1987. New lower bound techniques for robot motion planning problems In Proceedings of the 28th Annual IEEE Symposium on Foundations of Computer Science. IEEE, New York, pp. 49-60.
3. CHAZELLE, B., EDELSBRUNNER, H., GUIBAS, L., AND SHARIR, M. 1993. Diameter, width, closest line pair, and parametric searching, Disc. Comput. Geom. 10, 183-196.
4. CHEN, J., AND HAN, Y. 1990. Shortest paths on a polyhedron. In Proceedings of the 6th Annual ACM Symposium on Computational Geometry (Berkeley, Calif., June 6-8). ACM, New York, pp. 360-369.
5. CHOI, J., SELLEN, J. AND YAP, C. K. 1994. Approximate Euclidean shortest paths in 3- space. In Proceedings of the 10th Annual ACM Symposium on Computational Geometry (Stony Brook, N.Y., June 6-8). ACM, New York, pp. 41-48.
6. CLARKSON, K. 1987. Approximation algorithms for shortest path motion planning. In Proceedings of the 19th Annual ACM Symposium on the Theory of Computing (New York City, N.Y., May 25-27). ACM, New York, pp. 56-65.
7. DOBKIN, D., AND KIRKPATRICK, D. 1985. A linear algorithm for determining the separtaion of convex polyhedra, J. Algorithms 6, 381-392.
8. DOBKIN, D. AND KIRKPATRICK, D. 1990. Determining the separation of preprocessed polyhedra - A unified approach. In Proceedings of the 17th International Colloquium on Automata Language Programming, pp. 400-413.
9. DUDLEY, R. M. 1974. Metric entropy of some classes of sets with differentiable boundaries, J. Approx. Theory 10, 227-236.
10. EDELSBRUNNER, H. 1987. Algorithms in Combinatorial Geometry. Springer-Verlag, New York.
11. HAR-PELED, S. 1997. Approximate shortest paths and Geodesic diameters on convex polytopes in three dimensions, In Proceedings of the 13th Annual ACM Symposium on Computational Geometry (Nice, France, June 4-6). ACM, New York, pp. 359-365.
12. HAR-PELED, S. 1997. Constructing approximate shortest path maps in three dimensions. Manuscript.
13. 3. In Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, pp. 447-456.
14. MITCHELL, J. S. B., MOUNT, D. M., AND PAPADIMITRIOU, C. H. 1987. The discrete geodesic problem. SIAM J. Comput. 16, 647-668.
15. PAPADIMITRIOU, C. H. 1985. An algorithm for shortest-path motion in three dimensions, Inf. Process. Lett. 20 259-263.
16. POGORELOV, A. V. 1973. Extrinsic Geometry of Convex Surfaces. Volume 35 of Translations of Mathematical Monographs. American Mathematical Society, Providence, R.I.
17. PREPARATA, F. P., AND SHAMOS, M. I. 1985. Computational Geometry: An Introduction. Springer-Verlag, New York.
18. REIF, J., AND STORER, J. 1994. A single-exponential upper bound for finding shortest paths in three dimensions, J. ACM 41, 5 (Sept.), 1013-1019.
19. SHARIR, M. 1987. On shortest paths amidst convex polyhedra. SIAM J. Comput. 16, 561-572.
20. SHARIR, M., AND SCHORR, A. 1986. On shortest paths in polyhedral spaces. SIAM J. Comput. 15, 193-215.
21. VARADARAJAN, K. R. AND AGARWAL, P. K. 1997. Approximating shortest paths on a polyhedron. In Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science. IEEE, New York, to appear.