Abstract
In this paper, we consider the problem of computing a minimum bending energy path (or MinBEP) in a simple corridor. Given a simple 2D corridor C bounded by straight line segments and arcs of radius 2r, the MinBEP problem is to compute a path P inside C and crossing two pre-specified points s and t located at each end of C so that the bending energy of P is minimized. For this problem, we first show how to lower bound the bending energy of an optimal curve with bounded curvature, and then use this lower bound to design a (1 + ε)-approximation algorithm for this restricted version of the MinBEP problem. Our algorithm is based on a number of interesting geometric observations and approximation techniques on smooth curves, and can be easily implemented for practical purpose. It is the first algorithm with a guaranteed performance ratio for the MinBEP problem.
The research of this work was supported in part by National Science Foundation (NSF) through a CAREER award CCF-0546509 and a grant IIS-0713489.
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.
Similar content being viewed by others
References
Dubins, L.: On Curves of Minimal Length with a Constraint on Average Curvature, and with Prescribed Initial and Terminal Positions and Tangents. American Journal of Mathematics 79, 497–516 (1957)
Euler, L.: Methodus inveniendi lineas curvas maximi minimive propriatate gaudentes, sive solutio problematis isoperimetrici lattisimo sensu accepti. Bousquet, Lausannae et Genevae, E65A. O.O. SER. I, vol. 24 (1744)
Freedman, M., He, Z., Wang, Z.: On the Mobius Energy of Knots and Unknots. Annals of Mathematics 139(1), 1–50 (1994)
Guibas, L., Hershberger, J., Leven, D., Sharir, M., Tarjan, R.: Linear Time Algorithm for Visibility and Shortest Path Problems Inside Simple Polygons. In: Proceedings of the Second Annual ACM-SIAM Symposium on Computational Geometry (1986)
Heekeren, R., Faas, F., Vliet, L.: Finding the Minimum-Cost Path Without Cutting Corners. In: Ersbøll, B.K., Pedersen, K.S. (eds.) SCIA 2007. LNCS, vol. 4522. Springer, Heidelberg (2007)
Ivey, T., Singer, D.: Knot Types, Homotopies and Stability of Closed Elastic Rods. Proceedings of the London Mathematical Society 79, 429–450 (1999)
Langer, J., Singer, D.: Knotted Elastic Curves in R 3. Journal of London Math. Society 30(2), 512–520 (1984)
von der Mosel, H.: Minimizing the Elastic Energy of Knots. Journal of Asymptotic Analysis 18(1-2), 49–65 (1998)
O’Hara, J.: Energy of a Knot. Topology 30, 241–247 (1991)
Pressley, A.: Elementary Differential Geometry. Springer, London (2001)
Sack, J.R., Urrutia, J.: Handbook of computational geometry, pp. 854–855. North-Holland Publishing Co., Amsterdam (2000)
Schafer, S., Singh, V., Hoffmann, K., Noël, P., Xu, J.: Planning image-guided endovascular interventions: guidewire simulation using shortest path algorithms. In: Proceedings of the SPIE, vol. 6509 (2007)
Schafer, S., Singh, V., Noël, P.B., Xu, J., Walczak, A., Hoffmann, K.R.: Real Time Endovascular Guidewire Position Simulation using Shortest Path Algorithms. International Journal of Computer Aided Radiaology and Surgery (IJCARS) 4, 597–608 (2009)
Thorpe, J.: Elementary Topic in Differential Geometry. Springer, Heidelberg (1979)
Chazelle, B., Guibas, L.J.: Visibility and intersection problems in plane geometry. Discrete and Computational Geometry 4(6), 551–581 (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xu, J., Xu, L., Xie, Y. (2010). Approximating Minimum Bending Energy Path in a Simple Corridor. In: Cheong, O., Chwa, KY., Park, K. (eds) Algorithms and Computation. ISAAC 2010. Lecture Notes in Computer Science, vol 6506. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17517-6_30
Download citation
DOI: https://doi.org/10.1007/978-3-642-17517-6_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17516-9
Online ISBN: 978-3-642-17517-6
eBook Packages: Computer ScienceComputer Science (R0)