Abstract
We develop algorithms to compute edge sequences, Voronoi diagrams, shortest path maps, the Fréchet distance, and the diameter of a polyhedral surface. Distances on the surface are measured by the length of a Euclidean shortest path. Our main result is a linear factor speedup for the computation of all shortest path edge sequences and the diameter of a convex polyhedral surface. This speedup is achieved with kinetic Voronoi diagrams. We also use the star unfolding to compute a shortest path map and the Fréchet distance of a non-convex polyhedral surface.
This work has been supported by the National Science Foundation grant NSF CAREER CCF-0643597. Previous versions of this work have appeared in [12,13].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Agarwal, P.K., Aronov, B., O’Rourke, J., Schevon, C.A.: Star unfolding of a polytope with applications. SIAM Journal on Computing 26(6), 1689–1713 (1997)
Agarwal, P.K., Sharir, M.: Davenport–Schinzel Sequences and Their Geometric Applications. Handbook of Computational Geometry, pp. 1–47. Elsevier, Amsterdam (2000)
Albers, G., Mitchell, J.S.B., Guibas, L.J., Roos, T.: Voronoi diagrams of moving points. Journal of Computational Geometry & Applications 8, 365–380 (1998)
Aleksandrov, L., Djidjev, H., Huo, G., Maheshwari, A., Nussbaum, D., Sack, J.-R.: Approximate shortest path queries on weighted polyhedral surfaces. In: Královič, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol. 4162, pp. 98–109. Springer, Heidelberg (2006)
Alt, H., Godau, M.: Computing the Fréchet distance between two polygonal curves. Journal of Computational Geometry & Applications 5, 75–91 (1995)
Aronov, B., O’Rourke, J.: Nonoverlap of the star unfolding. Discrete and Computational Geometry 8(1), 219–250 (1992)
Chandru, V., Hariharan, R., Krishnakumar, N.M.: Short-cuts on star, source and planar unfoldings. In: Lodaya, K., Mahajan, M. (eds.) FSTTCS 2004. LNCS, vol. 3328, pp. 174–185. Springer, Heidelberg (2004)
Chen, J., Han, Y.: Shortest paths on a polyhedron. Journal of Computational Geometry & Applications 6(2), 127–144 (1996)
Chiang, Y., Mitchell, J.S.B.: Two-point Euclidean shortest path queries in the plane. In: 10th Symposium on Discrete Algorithms (SODA), pp. 215–224 (1999)
Cook IV, A.F., Wenk, C.: Geodesic Fréchet distance inside a simple polygon. In: 25th Symposium on Theoretical Aspects of Computer Science, STACS (2008)
Cook IV, A.F., Wenk, C.: Geodesic Fréchet distance with polygonal obstacles. Technical Report CS-TR-2008-010, University of Texas at San Antonio (2008)
Cook IV, A.F., Wenk, C.: Shortest path problems on a polyhedral surface. Technical Report CS-TR-2009-001, University of Texas at San Antonio (2009)
Cook IV, A.F., Wenk, C.: Shortest path problems on a polyhedral surface. In: 25th European Workshop on Computational Geometry (EuroCG) (2009)
Demaine, E.D., O’Rourke, J.: Geometric Folding Algorithms: Linkages, Origami, Polyhedra. Cambridge University Press, New York (2007)
Devillers, O., Golin, M., Kedem, K., Schirra, S.: Queries on Voronoi diagrams of moving points. Computational Geometry: Theory & Applications 6(5), 315–327 (1996)
Guibas, L.J., Hershberger, J., Leven, D., Sharir, M., Tarjan, R.E.: Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons. Algorithmica 2, 209–233 (1987)
Hershberger, J., Suri, S.: An optimal algorithm for Euclidean shortest paths in the plane. SIAM Journal on Computing 28(6), 2215–2256 (1999)
Hwang, Y.-H., Chang, R.-C., Tu, H.-Y.: Finding all shortest path edge sequences on a convex polyhedron. In: Dehne, F., Santoro, N., Sack, J.-R. (eds.) WADS 1989. LNCS, vol. 382. Springer, Heidelberg (1989)
Maheshwari, A., Yi, J.: On computing Fréchet distance of two paths on a convex polyhedron. In: 21st European Workshop on Computational Geometry (EuroCG) (2005)
Mitchell, J.S.B., Mount, D.M., Papadimitriou, C.H.: The discrete geodesic problem. SIAM Journal on Computing 16(4), 647–668 (1987)
Mount, D.M.: The number of shortest paths on the surface of a polyhedron. SIAM Journal on Computing 19(4), 593–611 (1990)
O’Rourke, J., Schevon, C.: Computing the geodesic diameter of a 3-polytope. In: 5th Symposium on Computational Geometry (SoCG), pp. 370–379 (1989)
Schevon, C., O’Rourke, J.: The number of maximal edge sequences on a convex polytope. In: 26th Allerton Conference on Communication, Control, and Computing, pp. 49–57 (1988)
Schreiber, Y., Sharir, M.: An optimal-time algorithm for shortest paths on a convex polytope in three dimensions. Discrete & Computational Geometry 39(1-3), 500–579 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cook, A.F., Wenk, C. (2009). Shortest Path Problems on a Polyhedral Surface. In: Dehne, F., Gavrilova, M., Sack, JR., Tóth , C.D. (eds) Algorithms and Data Structures. WADS 2009. Lecture Notes in Computer Science, vol 5664. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03367-4_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-03367-4_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03366-7
Online ISBN: 978-3-642-03367-4
eBook Packages: Computer ScienceComputer Science (R0)