Abstract
We consider geometric shortest path queries between arbitrary pairs of objects on a connected polyhedral surface P of genus g. The query objects are points, vertices, edges, segments, faces, chains, regions and sets of these. The surface P consists of n positively weighted triangular faces. The cost of a path on P is the weighted sum of Euclidean lengths of the sub-paths within each face of P. We present generic algorithms which provide approximate solutions.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Research supported by NSERC, SUN Microsystems, Stantive Computing.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bendels, G.H., Klein, R., Schilling, A.: Image and 3d object editing with precisely specified editing regions. In: Workshop on Vision, Modelling, and Visualization VMV 03, pp. 451–460 (2003)
Aleksandrov, L., Djidjev, H., Guo, H., 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)
Aleksandrov, L., Maheshwari, A., Sack, J.R.: Determining approximate shortest paths on weighted polyhedral surfaces. J. ACM 52(1), 25–53 (2005)
Agarwal, P.K., Aronov, B., O’Rourke, J., Schevon, C.A.: Star unfolding of a polytope with applications. SIAM J. Comput. 26(6), 1689–1713 (1997)
Aronov, B., O’Rourke, J.: Nonoverlap of the star unfolding. Discrete Comput. Geom. 8(3), 219–250 (1992)
Chiang, Y.J., Mitchell, J.S.B.: Two-point euclidean shortest path queries in the plane. In: Proc. 10th ACM-SODA, Philadelphia, PA, USA, pp. 215–224. ACM Press, New York (1999)
Dudley, R.M.: Metric entropy of some classes of sets with differentiable boundaries. J. Approx. Theory 10(3), 227–236 (1974)
Har-Peled, S.: Approximate shortest paths and geodesic diameters on convex polytopes in three dimensions. Discrete Comput. Geom. 21, 216–231 (1999)
Chazelle, B., Liu, D., Magen, A.: Sublinear geometric algorithms. SIAM J. Comput. 35, 627–646 (2006)
Aleksandrov, L., Lanthier, M., Maheshwari, A., Sack, J.R.: An ε-approximation algorithm for weighted shortest path queries on polyhedral surfaces. In: Proc. 14th Euro CG Barcelona, pp. 19–21 (1998)
Tan, X.H., Hirata, T., Inagaki, Y.: Spatial point location and its applications. In: Asano, T., Imai, H., Ibaraki, T., Nishizeki, T. (eds.) SIGAL 1990. LNCS, vol. 450, pp. 241–250. Springer, Heidelberg (1990)
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, pp. 251–266. Springer, Heidelberg (1989)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Guo, H., Maheshwari, A., Nussbaum, D., Sack, JR. (2007). Shortest Path Queries Between Geometric Objects on Surfaces. In: Gervasi, O., Gavrilova, M.L. (eds) Computational Science and Its Applications – ICCSA 2007. ICCSA 2007. Lecture Notes in Computer Science, vol 4705. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74472-6_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-74472-6_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74468-9
Online ISBN: 978-3-540-74472-6
eBook Packages: Computer ScienceComputer Science (R0)