Finding shortest paths in a sequence of triangles in 3D by the method of orienting curves

References

• Agarwal PK, Har-Peled S, Karia M. Computing approximate shortest paths on convex polytopes. Algorithmica. 2002;33(2):227–242.
   Web of Science ®Google Scholar
• Sethian JA. Fast marching methods. SIAM Rev. 1999;41(2):199–235.
   Web of Science ®Google Scholar
• Pham-Trong V, Szafran N, Biard L. Pseudo-geodesics on three-dimensional surfaces and pseudo-geodesic meshes. Numer Algorithms. 2001;26(4):305–315.
   Web of Science ®Google Scholar
• Xin S-Q, Wang G-J. Efficiently determining a locally shortest path on polyhedral surfaces. Comput Aided Des. 2007;39(12):1081–1090.
   Web of Science ®Google Scholar
• Phu HX. Zur Lösung einer regulären Aufgabenklasse der optimalen Steuerung im Großen mittels Orientierungskurven. Optimization. 1987;18(1):65–81.
   Google Scholar
• Dinh N, Phu HX. Solving a class of regular optimal control problems with state constraints by the method of orienting curves. Optimization. 1992;25(2 & 3):231–247.
   Google Scholar
• Dinh N, Phu HX. Solving a class of optimal control problems which are linear in the control variable by the method of orienting curves. Acta Math Vietnam. 1992;17(2):115–134.
   Google Scholar
• Phu HX. Method of orienting curves for solving optimal control problems with state constraints. Numer Funct Anal Optim. 1991;12(1 &2):173–211.
   Web of Science ®Google Scholar
• Phu HX, Dinh N. Some remarks on the method of orienting curves. Numer Funct Anal Optim. 1995;16(5 &6):755–763.
   Web of Science ®Google Scholar
• Phu HX, Long TD. Orienting method for obstacle problems. Z Anal Anwend. 2002;21(1):233–248.
   Web of Science ®Google Scholar
• Dinh N, Phu HX. The method of orienting curves and its application to an optimal control problem of hydroelectric power plants. Vietnam J Math. 1992;20(2):40–53.
   Google Scholar
• Phu HX. Zur Lösung eines Zermeloschen Navigationsproblems. Optimization. 1987;18:225–236.
   Google Scholar
• Phu HX, Bock HG, Schlöder J. The method of orienting curves and its application for manipulator trajectory planning. Numer Funct Anal Optim. 1997;18(1 & 2):213–225.
   Web of Science ®Google Scholar
• Phu HX. Ein konstruktives Lösungsverfahren für das Problem des Inpolygons kleinsten Umfangs von J. Steiner. Optimization. 1987;18(3):349–359.
   Google Scholar
• An PT. Method of orienting curves for determining the convex hull of a finite set of points in the plane. Optimization. 2010;59(2):175–179.
   Web of Science ®Google Scholar
• An PT, Trang LH. An efficient convex hull algorithm for finite point sets in 3D based on the method of orienting curves. Optimization. 2013;62(7):975–988.
   Web of Science ®Google Scholar
• O’Rourke J. Unfolding face-neighborhood convex patches: counterexamples and positive results. In: Proceedings of the 25th Canadian Conference on Computational Geometry, Waterloo, Ontario; 2013 Aug 8--10.
   Google Scholar
• Lee DT, Preparata FP. Euclidean shortest paths in the presence of rectilinear battiers. Networks. 1984;14(3):393–410.
   Web of Science ®Google Scholar
• Polthier K, Schmies M. Straightest geodesics on polyhedral surfaces. In: Hege HC, Polthier K, editors. Mathematical visualization. Heidelberg: Springer Verlag; 1998. p. 135–150.
   Google Scholar
• Polthier K, Schmies M. Geodesic flow on polyhedral surfaces. In: Data Visualization ’99 Eurographics. Vienna; 1999. p. 179–188.
   Google Scholar
• Polthier K. Polyhedral surfaces of constant mean curvature [Habilitationsschrift thesis]. TU-Berlin; 2002. p. 1–212.
   Google Scholar
• JavaView software, 1997--2017 (Interactive 3D Geometry and Visualization). Available from: http://www.javaview.de/
   Google Scholar
• Guibas L, Hershberger J, Leven D, Sharir M, Tarjan R. Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons. Algorithmica. 1987;2(1–4):209–233.
   Web of Science ®Google Scholar
• Hai NN, An PT, Huyen PTT. Shortest paths along a sequence of line segments in Euclidean spaces. Hanoi: Institute of Mathematics; Preprint IMH20161101 2016. Available from: http://math.ac.vn/images/Epreprint/2016/IMH20161101.pdf, submitted.
   Google Scholar
• Mitchell JSB, Mount DM, Papadimitriou CH. The discrete geodesic problem. SIAM J Comput. 1987;16(4):647–668.
   Web of Science ®Google Scholar
• Papadopoulos A. Metric spaces, convexity and non-positive curvature. Vol. 6, IRMA lectures in mathematics and theoretical physics. Zürich: European Mathematical Society (EMS); 2005.
   Google Scholar
• Chen J, Han Y. Shortest paths on a polyhedron. Int J Comput Geom Appl. 1996;6(2):127–144.
   Google Scholar
• Hai NN, An PT. Blaschke-type theorem and separation of disjoint closed geodesic convex sets. J Optim Theory Appl. 2011;3:541–551.
   Web of Science ®Google Scholar
• An PT. Optimization approaches for computational geometry. VAST, Hanoi: Publishing House for Science and Technology; 2017.
   Google Scholar
• Hoai TV, An PT, Hai NN. Multiple shooting approach for computing approximately shortest paths on convex polytopes. J Comput Appl Math. 2017;317:235–246.
   Web of Science ®Google Scholar
• Li F, Klette R. Euclidean shortest paths: exact or approximate algorithms. London: Springer; 2011.
   Google Scholar
• Ahmed M, Lubiw A, Maheshwari A. Shortest gently descending paths. In: Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS); 2009. p. 63–74.
   Google Scholar
• Liu L, Wong RC-W. Finding shortest path on land surface. In: Proceedings of the 2011 ACM SIGMOD International Conference on Management of Data, Athens, Greece; 2011.
   Google Scholar
• Sautter L. Approximate shortest gentle paths on terrains [Diplom thesis]. Karlsruhle Institute of Technology; 2014.
   Google Scholar