Abstract
Let p and q be two points in a simple polygon Π. An open problem in computational geometry asks to devise a simple linear-time algorithm for computing a shortest path between p and q, which is contained in Π, such that the algorithm does not depend on a (complicated) linear-time triangulation algorithm. This report provides a contribution to the solution of this problem by applying the rubberband algorithm. The obtained solution has \({\cal O}\) (nlogn) time complexity (where the super-linear time complexity is only due to preprocessing, i.e. for the calculation of critical edges) and is, altogether, considerably simpler than the triangulation algorithm. It has applications in 2D pattern recognition, picture analysis, robotics, and so forth.
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
Bülow, T., Klette, R.: Digital curves in 3D space and a linear-time length estimation algorithm. IEEE Trans. Pattern Analysis Machine Intelligence 24, 962–970 (2002)
Chazelle, B.: Triangulating a simple polygon in linear time. Discrete Computational Geometry 6, 485–524 (1991)
Guibas, L., 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)
Guibas, L., Hershberger, J.: Optimal shortest path queries in a simple polygon. J. Computer System Sciences 39, 126–152 (1989)
Hershberger, J.: A new data structure for shortest path queries in a simple polygon. Information Processing Letters 38, 231–235 (1991)
Klette, R., Rosenfeld, A.: Digital Geometry: Geometric Methods for Digital Picture Analysis. Morgan Kaufmann, San Francisco (2004)
Lee, D.T., Preparata, F.P.: Euclidean shortest paths in the presence of rectilinear barriers. Networks 14, 393–410 (1984)
Li, F., Klette, R.: Minimum-Length Polygons of First-Class Simple Cube-Curve. In: Gagalowicz, A., Philips, W. (eds.) CAIP 2005. LNCS, vol. 3691, pp. 321–329. Springer, Heidelberg (2005)
Li, F., Klette, R.: Analysis of the rubberband algorithm. Technical Report CITR-TR-175, Computer Science Department, The University of Auckland, Auckland, New Zealand (2006), http://www.citr.auckland.ac.nz
Li, F., Klette, R.: Shortest paths in a cuboidal world. In: Reulke, R., Eckardt, U., Flach, B., Knauer, U., Polthier, K. (eds.) IWCIA 2006. LNCS, vol. 4040, pp. 415–429. Springer, Heidelberg (2006)
Mitchell, J.S.B.: Geometric shortest paths and network optimization. In: Sack, J.-R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 633–701. Elsevier Science Publishers, Amsterdam (2000)
Thorup, M.: Undirected single-source shortest paths with positive integer weights in linear time. J. ACM 3, 362–394 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, F., Klette, R. (2006). Finding the Shortest Path Between Two Points in a Simple Polygon by Applying a Rubberband Algorithm. In: Chang, LW., Lie, WN. (eds) Advances in Image and Video Technology. PSIVT 2006. Lecture Notes in Computer Science, vol 4319. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11949534_28
Download citation
DOI: https://doi.org/10.1007/11949534_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68297-4
Online ISBN: 978-3-540-68298-1
eBook Packages: Computer ScienceComputer Science (R0)