Abstract
Let p and q be two points on the surface of a polytope Π. This paper provides a rubberband algorithm for computing a Euclidean shortest path between p and q (a so-called surface ESP) that is contained on the surface of Π. The algorithm has \(\kappa_1(\varepsilon) \cdot \kappa_2(\varepsilon) \cdot {\cal O}(n^2)\) time complexity, where n is the number of vertices of Π, κ i (ε) = (L 0 i − L i )/ε, for the true length L i of some shortest path with initial (polygonal path) length L 0 i (used when approximating this shortest path), for i = 1, 2. Rubberband algorithms follow a straightforward design strategy, and the proposed algorithm is easy to implement and thus of importance for applications, for example, when analyzing 3D objects in 3D image analysis, such as in biomedical or industrial image analysis, using 3D image scanners.
Chapter PDF
Similar content being viewed by others
References
Sharir, M., Schorr, A.: On shortest paths in polyhedral spaces. SIAM J. Computation 15, 193–215 (1986)
Reif, J.H., Storer, J.A.: A single-exponential upper bound for shortest paths in three dimensions. J. ACM 41, 1013–1019 (1994)
Canny, J., Reif, J.H.: Some algebraic and geometric configurations in pspace, 460–467 (1988)
Canny, J., Reif, J.: New lower bound techniques for robot motion planning problems, 49–60 (1987)
Sharir, M.: On shortest paths amidst convex polyhedra. SIAM J. Computation 16, 561–572 (1987)
Gewali, L.P., Ntafos, S., Tollis, I.G.: Path planning in the presence of vertical obstacles. Technical report, Computer Science, University of Texas at Dallas (1989)
Mitchell, J.S.B., Mount, D.M., Papadimitriou, C.H.: The discrete geodesic problem. SIAM J. Computation 16, 647–668 (1987)
Chen, J., Han, Y.: Shortest paths on a polyhedron, 360–369 (1990)
Kapoor, S.: Efficient computation of geodesic shortest paths. In: Proc. ACM Symp. Theory Computation, vol. 1, pp. 770–779 (1999)
Li, F., Klette, R.: Rubberband algorithms for solving various 2d or 3d shortest path problems. In: Proc. Computing: Theory and Applications, Platinum Jubilee Conference of The Indian Statistical Institute, pp. 9–18. IEEE, Los Alamitos (2007)
Li, F., Klette, R.: Euclidean shortest paths in simple polygons. Technical report CITR-202, Computer Science Department, The University of Auckland, Auckland (2007), http://www.citr.auckland.ac.nz/techreports/2007/CITR-TR-202.pdf
Klette, R., Rosenfeld, A.: Digital Geometry. Morgan Kaufmann, San Francisco (2004)
Kiryati, N., Szekely, G.: Estimating shortest paths and minimal distances on digitized three dimensional surfaces. Pattern Recognition 26, 1623–1637 (1993)
Li, F., Klette, R.: Exact and approximate algorithms for the calculation of shortest paths. Report 2141, ima, The University of Minnesota, Minneapolis (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, F., Klette, R., Fu, X. (2007). Approximate ESPs on Surfaces of Polytopes Using a Rubberband Algorithm. In: Mery, D., Rueda, L. (eds) Advances in Image and Video Technology. PSIVT 2007. Lecture Notes in Computer Science, vol 4872. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77129-6_23
Download citation
DOI: https://doi.org/10.1007/978-3-540-77129-6_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77128-9
Online ISBN: 978-3-540-77129-6
eBook Packages: Computer ScienceComputer Science (R0)