{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,15]],"date-time":"2025-11-15T04:03:47Z","timestamp":1763179427682,"version":"3.37.3"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,10,13]],"date-time":"2022-10-13T00:00:00Z","timestamp":1665619200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,10,13]],"date-time":"2022-10-13T00:00:00Z","timestamp":1665619200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100010712","name":"Viet Nam National University Ho Chi Minh City","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100010712","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007224","name":"National Foundation for Science and Technology Development","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100007224","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1007\/s10898-022-01244-x","type":"journal-article","created":{"date-parts":[[2022,10,13]],"date-time":"2022-10-13T02:02:47Z","timestamp":1665626567000},"page":"1037-1063","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Finding globally shortest paths through a sequence of adjacent triangles by the method of orienting curves"],"prefix":"10.1007","volume":"85","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1903-3510","authenticated-orcid":false,"given":"Phan Thanh","family":"An","sequence":"first","affiliation":[]},{"given":"Hoang Xuan","family":"Phu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,13]]},"reference":[{"key":"1244_CR1","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/s00453-001-0111-x","volume":"33","author":"PK Agarwal","year":"2002","unstructured":"Agarwal, P.K., Har-Peled, S., Karia, M.: Computing approximate shortest paths on convex polytopes. Algorithmica 33, 227\u2013242 (2002)","journal-title":"Algorithmica"},{"key":"1244_CR2","unstructured":"An, P. T., Le, N. T.: The method of multiple shooting for finding approximately shortest paths for autonomous robots in unknown environments in 2D (2022) (submitted). arXiv:2208.10386"},{"key":"1244_CR3","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1080\/02331934.2017.1387260","volume":"67","author":"PT An","year":"2018","unstructured":"An, P.T.: Finding shortest paths in a sequence of triangles in 3D by the method of orienting curves. Optimization 67, 159\u2013177 (2018)","journal-title":"Optimization"},{"key":"1244_CR4","first-page":"45","volume-title":"On the Performance of Triangulation-Based Multiple Shooting Method for 2D Shortest Path Problems. LNCS Transactions on Large Scale Data and Knowledge Centered Systems","author":"PT An","year":"2014","unstructured":"An, P.T., Hai, N.N., Hoai, T.V., Trang, L.H.: On the Performance of Triangulation-Based Multiple Shooting Method for 2D Shortest Path Problems. LNCS Transactions on Large Scale Data and Knowledge Centered Systems, pp. 45\u201356. Springer, Berlin (2014)"},{"key":"1244_CR5","doi-asserted-by":"publisher","first-page":"975","DOI":"10.1080\/02331934.2011.623163","volume":"62","author":"PT An","year":"2013","unstructured":"An, P.T., Trang, L.H.: An efficient convex hull algorithm for finite point sets in 3D based on the method of orienting curves. Optimization 62, 975\u2013988 (2013)","journal-title":"Optimization"},{"key":"1244_CR6","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1080\/02331930802434732","volume":"59","author":"PT An","year":"2010","unstructured":"An, P.T.: Method of orienting curves for determining the convex hull of a finite set of points in the plane. Optimization 59, 175\u2013179 (2010)","journal-title":"Optimization"},{"key":"1244_CR7","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/BF02250584","volume":"45","author":"RE Burkard","year":"1990","unstructured":"Burkard, R.E., Rote, G., Yao, E.Y., Yu, Z.L.: Shortest polygonal paths in space. Computing 45, 51\u201368 (1990)","journal-title":"Computing"},{"key":"1244_CR8","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1142\/S0218195996000095","volume":"6","author":"J Chen","year":"1996","unstructured":"Chen, J., Han, Y.: Shortest paths on a polyhedron. Int. J. Comput. Geom. Appl. 6, 127\u2013144 (1996)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"1244_CR9","doi-asserted-by":"crossref","unstructured":"Cheng, S., Jin, J.: Shortest paths on polyhedral surfaces and terrains. In: Proceedings of the 46th Annual ACM Symposium on Theory of Computing, New York, pp. 373\u2013382 (2014)","DOI":"10.1145\/2591796.2591821"},{"key":"1244_CR10","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/s00453-012-9723-6","volume":"69","author":"AF Cook IV","year":"2014","unstructured":"Cook, A.F., IV., Wenk, C.: Shortest path problems on a polyhedral surface. Algorithmica 69, 58\u201377 (2014)","journal-title":"Algorithmica"},{"key":"1244_CR11","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1080\/02331939208843821","volume":"25","author":"N Dinh","year":"1992","unstructured":"Dinh, N., Phu, H.X.: Solving a class of regular optimal control problems with state constraints by the method of orienting curves. Optimization 25, 231\u2013247 (1992)","journal-title":"Optimization"},{"key":"1244_CR12","first-page":"115","volume":"17","author":"N Dinh","year":"1992","unstructured":"Dinh, N., Phu, H.X.: Solving a class of optimal control problems which are linear in the control variable by the method of orienting curves. Acta Math. Vietnam 17, 115\u2013134 (1992)","journal-title":"Acta Math. Vietnam"},{"key":"1244_CR13","first-page":"40","volume":"20","author":"N Dinh","year":"1992","unstructured":"Dinh, N., Phu, H.X.: The method of orienting curves and its application to an optimal control problem of hydroelectric power plants. Vietnam J. Math. 20, 40\u201353 (1992)","journal-title":"Vietnam J. Math."},{"issue":"4","key":"1244_CR14","first-page":"1089","volume":"26","author":"NN Hai","year":"2019","unstructured":"Hai, N.N., An, P.T., Huyen, P.T.T.: Shortest paths along a sequence of line segments in Euclidean spaces. J. Convex Anal. 26(4), 1089\u20131112 (2019)","journal-title":"J. Convex Anal."},{"key":"1244_CR15","doi-asserted-by":"crossref","unstructured":"Hahmann, S., Belyaev, A., Bus\u00e9, L., Elber, G., Mourrain, B., Roessl, C.: Shape interrogation. In: Mathematics and Visualization, pp. 1\u201357 (2007)","DOI":"10.1007\/978-3-540-33265-7_1"},{"key":"1244_CR16","unstructured":"JavaView software (Interactive 3D Geometry and Visualization) at the link: http:\/\/www.javaview.de\/"},{"key":"1244_CR17","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1002\/net.3230140304","volume":"14","author":"DT Lee","year":"1984","unstructured":"Lee, D.T., Preparata, F.P.: Euclidean shortest paths in the presence of rectilinear battiers. Networks 14, 393\u2013410 (1984)","journal-title":"Networks"},{"key":"1244_CR18","unstructured":"Lieutier, A., Thibert, B.: Geodesic as limit of geodesics on PL-surfaces. In: Chen, F., J\u00fcttler, B. (eds.) Advances in Geometric Modeling and Processing. GMP 2008. Lecture Notes in Computer Science, vol. 4975. Springer, Berlin"},{"key":"1244_CR19","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1137\/0216045","volume":"16","author":"JSB Mitchell","year":"1987","unstructured":"Mitchell, J.S.B., Mount, D.M., Papadimitriou, C.H.: The discrete geodesic problem. SIAM J. Comput. 16, 647\u2013668 (1987)","journal-title":"SIAM J. Comput."},{"key":"1244_CR20","unstructured":"O\u2019Rourke, J.: Unfolding face-neighborhood convex patches: counterexamples and positive results. In: Proceedings of the 25th Canadian Conference on Computational Geometry, Waterloo, Ontario, August 8\u201310 (2013)"},{"key":"1244_CR21","volume-title":"Metric Spaces, Convexity and Non-positive Curvature, IRMA Lectures in Mathematics and Theoretical Physics","author":"A Papadopoulos","year":"2005","unstructured":"Papadopoulos, A.: Metric Spaces, Convexity and Non-positive Curvature, IRMA Lectures in Mathematics and Theoretical Physics, vol. 6. European Mathematical Society (EMS), Z\u00fcrich (2005)"},{"issue":"4","key":"1244_CR22","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1023\/A:1016617010088","volume":"26","author":"V Pham-Trong","year":"2001","unstructured":"Pham-Trong, V., Szafran, N., Biard, L.: Pseudo-geodesics on three-dimensional surfaces and pseudo-geodesic meshes. Numer. Algorithms 26(4), 305\u2013315 (2001)","journal-title":"Numer. Algorithms"},{"key":"1244_CR23","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1080\/02331938708843217","volume":"18","author":"HX Phu","year":"1987","unstructured":"Phu, H.X.: Zur L\u00f6sung einer regul\u00e4ren Aufgabenklasse der optimalen Steuerung im Gro\u00dfen mittels Orientierungskurven. Optimization 18, 65\u201381 (1987)","journal-title":"Optimization"},{"key":"1244_CR24","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1080\/02331938708843244","volume":"18","author":"HX Phu","year":"1987","unstructured":"Phu, H.X.: Ein konstruktives L\u00f6sungsverfahren f\u00fcr das Problem des Inpolygons kleinsten Umfangs von J. Steiner. Optimization 18, 349\u2013359 (1987)","journal-title":"Optimization"},{"key":"1244_CR25","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1080\/02331938708843234","volume":"18","author":"HX Phu","year":"1987","unstructured":"Phu, H.X.: Zur L\u00f6sung eines Zermeloschen Navigationsproblems. Optimization 18, 225\u2013236 (1987)","journal-title":"Optimization"},{"key":"1244_CR26","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1080\/01630569108816423","volume":"12","author":"HX Phu","year":"1991","unstructured":"Phu, H.X.: Method of orienting curves for solving optimal control problems with state constraints. Numer. Funct. Anal. Optim. 12, 173\u2013211 (1991)","journal-title":"Numer. Funct. Anal. Optim."},{"key":"1244_CR27","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1080\/01630569708816755","volume":"18","author":"HX Phu","year":"1997","unstructured":"Phu, H.X., Bock, H.G., Schl\u00f6der, J.: The method of orienting curves and its application for manipulator trajectory planning. Numer. Funct. Anal. Optim. 18, 213\u2013225 (1997)","journal-title":"Numer. Funct. Anal. Optim."},{"key":"1244_CR28","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1080\/01630569508816643","volume":"16","author":"HX Phu","year":"1995","unstructured":"Phu, H.X., Dinh, N.: Some remarks on the method of orienting curves. Numer. Funct. Anal. Optim. 16, 755\u2013763 (1995)","journal-title":"Numer. Funct. Anal. Optim."},{"key":"1244_CR29","doi-asserted-by":"publisher","first-page":"233","DOI":"10.4171\/ZAA\/1075","volume":"21","author":"HX Phu","year":"2002","unstructured":"Phu, H.X., Long, T.D.: Orienting method for obstacle problems. Zeitschrift f\u00fcr Analysis und ihre Anwendungen 21, 233\u2013248 (2002)","journal-title":"Zeitschrift f\u00fcr Analysis und ihre Anwendungen"},{"key":"1244_CR30","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-662-03567-2_11","volume-title":"Mathematical Visualization","author":"K Polthier","year":"1998","unstructured":"Polthier, K., Schmies, M.: Straightest geodesics on polyhedral surfaces. In: Hege, H.C., Polthier, K. (eds.) Mathematical Visualization, pp. 135\u2013150. Springer, Heidelberg (1998)"},{"key":"1244_CR31","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1137\/0215014","volume":"15","author":"M Sharir","year":"1986","unstructured":"Sharir, M., Schorr, A.: On shortest paths in polyhedral spaces. SIAM J. Comput. 15, 193\u2013215 (1986)","journal-title":"SIAM J. Comput."},{"key":"1244_CR32","unstructured":"TurtleBot3 Burger robot https:\/\/www.robotis.us\/turtlebot-3\/"},{"key":"1244_CR33","unstructured":"TurtleBot3 Burger robot, which has the exact vision range of 0.8m, finds a path avoiding obstacles to the goal that is a red wine box located in another room that is 14m far from the robot. The video https:\/\/www.youtube.com\/watch?v=HYnNVsh7fpw &feature=youtu.be that captured this event was recorded at Institute of Mathematical and Computational Sciences - IMACS, Ho Chi Minh City University of Technology, in April 2022"},{"key":"1244_CR34","doi-asserted-by":"publisher","first-page":"1081","DOI":"10.1016\/j.cad.2007.08.001","volume":"39","author":"S-Q Xin","year":"2007","unstructured":"Xin, S.-Q., Wang, G.-J.: Efficiently determining a locally shortest path on polyhedral surfaces. Comput. Aided Des. 39, 1081\u20131090 (2007)","journal-title":"Comput. Aided Des."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-022-01244-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-022-01244-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-022-01244-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,26]],"date-time":"2023-03-26T22:17:22Z","timestamp":1679869042000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-022-01244-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,13]]},"references-count":34,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["1244"],"URL":"https:\/\/doi.org\/10.1007\/s10898-022-01244-x","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2022,10,13]]},"assertion":[{"value":"25 November 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 September 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 October 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}