Abstract
We present a new scheme for storing shortest path information for a polyhedron. This scheme is obtained with a new observation on the properties of shortest path information of a polyhedron. Our scheme separates in a clear sense the problem of finding shortest paths and the problem of storing the shortest path information for retrieval. A tradeoff between time complexity O(d log n/log d) and space complexity O(n log n/log d) is obtained, where d is an adjustable parameter. When d tends to infinity space complexity of o(n log n) can be achieved at the expense of increased time complexity.
Preview
Unable to display preview. Download preview PDF.
References
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.
B. Aronov, J. O'Rourke. Nonoverlap of the star unfolding. manuscript.
J. Chen and Y. Han. Shortest paths on a polyhedron. Proc. of 1990 ACM Symposium on Computational Geometry, 360–369.
Lipton, R. and R. Tarjan. Applications of a planar separation theorem, SIAM J. Comput. 9(3) (1980), 478–487.
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).
D. M. Mount. On finding shortest paths on convex polyhedra. Tech. Report 1496, Dept. of Computer Sci., Univ. of Maryland, Baltimore, MD, 1985.
D. M. Mount. Storing the subdivision of a polyhedral surface. Proc. 2rd ACM Symposium on Computational Geometry, Yorktown Heights, NY, June 2–4, 1986.
M. Sharir and A. Schorr. On shortest paths in polyhedral spaces. SIAM J. Comput., 15(1986), pp. 193–215.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, J., Han, Y. (1991). Storing shortest paths for a polyhedron. In: Dehne, F., Fiala, F., Koczkodaj, W.W. (eds) Advances in Computing and Information — ICCI '91. ICCI 1991. Lecture Notes in Computer Science, vol 497. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54029-6_166
Download citation
DOI: https://doi.org/10.1007/3-540-54029-6_166
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54029-8
Online ISBN: 978-3-540-47359-6
eBook Packages: Springer Book Archive