Storing shortest paths for a polyhedron

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

Volumn 497 LNCS, Issue , 1991, Pages 169-180

  Chen, Jindong ^a   Han, Yijie ^a  

^a UNIVERSITY OF KENTUCKY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GEOMETRY;

ADJUSTABLE PARAMETERS; SHORTEST PATH; SPACE COMPLEXITY; TIME COMPLEXITY;

GRAPH THEORY;

EID: 4043102962     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-54029-6_166     Document Type: Conference Paper

References (8)

1. P. Agarwal, B. Aronov, J. O’Rourke, and C. Schevon. Star unfolding of a polytope with applications. Proc. of the Scandanavian Workshop on Algorithm Theory. LNCS 447, 1990.
2. B. Aronov, J. O’Rourke. Nonoverlap of the star unfolding, manuscript.
3. J. Chen and Y. Han. Shortest paths on a polyhedron. Proc. of 1990 ACM Symposium on Computational Geometry, 360-369.
4. Lipton, R. and R. Tarjan. Applications of a planar separation theorem, SIAM J. Comput. 9(3) (1980), 478-487.
5. J. S. B. Mitchell, D. M. Mount, C. H. Papadimitriou. The discrete geodesic problem. SIAM J. Comput., Vol. 16, No. 4, 647-668(Aug. 1987).
6. D. M. Mount. On finding shortest paths on convex polyhedra. Tech. Report 1496, Dept, of Computer Sci., Univ. of Maryland, Baltimore, MD, 1985.
7. D. M. Mount. Storing the subdivision of a polyhedral surface. Proc. 2rd ACM Symposium on Computational Geometry, Yorktown Heights, NY, June 2-4, 1986.
8. M. Sharir and A. Schorr. On shortest paths in polyhedral spaces. SIAM J. Comput., 15(1986), pp. 193-215.