Finding all shortest path edge sequences on a convex polyhedron

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 382 LNCS, Issue , 1989, Pages 251-266

  Hwang, Yie Huei ^a,b   Chang, Ruei Chuan ^a,b   Tu, Hung Yi ^a,b  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

^b INSTITUTE OF INFORMATION SCIENCE   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; GEOMETRY;

CONVEX POLYHEDRONS; EUCLIDEAN SHORTEST PATH; SEQUENCE TREES; SHORTEST PATH; TWO-POINT;

GRAPH THEORY;

EID: 85013506872     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-51542-9_23     Document Type: Conference Paper

References (11)

1. A. Baltson, M. Sharir, On Shortest Paths between Two Convex Polyhedra, JACM, Vol. 35, No. 2, April 1988, pp. 267–287.
2. E. W. Dijkstra, A Note on Two Problems in Connection with Graphs, Numerische Mathematik, Vol. 1, 1959, pp. 269–271.
3. L. Guibas, J. Herchberger, K. Leven, M. Sharir, R. Tarjan, Linear Time Algorithms for Visibility and Shortest Path Problems inside Simple Polygons, Algorithmica, Vol. 2, No. 2, 1987, pp. 209–233.
4. J. S. B. Mitchell, Planning Shortest Paths, Ph. D. Thesis, Department of Operations Research, Stanford University, August 1986.
5. D. M. Mount, On Finding Shortest Paths on Convex Polyhedra, Technical Report 1495, Computer Science Department, University of Maryland, College Park, 1984.
6. D. M. Mount, The Number of Shortest Paths on the Surface of a Polyhedron, Technical Report, Computer Science Department, University of Maryland, College Park, MD, 1986.
7. J. O’Rourke, S. Suri, and H. Booth, Shortest Paths on Polyhedral Surfaces, Manuscript, Johns Hopkins University, 1984.
8. C. Schevon, J. O’Rourke, The Number of Maximal Edges Sequences on a Convex Polytope, Proceedings of Allerton Conference, 1988.
9. C. H. Papadimitriou, An Algorithm for Shortest-Path Motion in Three Dimensions, Information Processing Letter, Vol. 20, No. 5, 12 June, 1985.
10. M. Sharir, On Shortest Paths Amidst Convex Polyhedra, SIAM J. Comput., Vol. 16, No. 3, June 1987, pp. 561–572.
11. M. Sharir and A. Schorr, On Shortest Paths in Polyhedral Spaces, SIAM J. Comput., Vol. 15, No. 1, Feburary 1986, pp. 193–215.