{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T00:01:31Z","timestamp":1767139291652,"version":"build-2238731810"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662459461","type":"print"},{"value":"9783662459478","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-45947-8_4","type":"book-chapter","created":{"date-parts":[[2014,12,16]],"date-time":"2014-12-16T04:55:44Z","timestamp":1418705744000},"page":"45-56","source":"Crossref","is-referenced-by-count":0,"title":["On the Performance of Triangulation-Based Multiple Shooting Method for 2D Geometric Shortest Path Problems"],"prefix":"10.1007","author":[{"given":"Phan Thanh","family":"An","sequence":"first","affiliation":[]},{"given":"Nguyen Ngoc","family":"Hai","sequence":"additional","affiliation":[]},{"given":"Tran Van","family":"Hoai","sequence":"additional","affiliation":[]},{"given":"Le Hong","family":"Trang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,12,17]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"An, P.T., Hai, N.N., Hoai, T.V.: Direct multiple shooting method for solving approximate shortest path problems. Journal of Computational and Applied Mathematics 244, 67\u201376 (2103)","DOI":"10.1016\/j.cam.2012.11.001"},{"issue":"5","key":"4_CR2","first-page":"652","volume":"2","author":"PT An","year":"2012","unstructured":"An, P.T., Hoai, T.V.: Incremental convex hull as an orientation to solving the shortest path problem. International Journal of Information and Electronics Engineering 2(5), 652\u2013655 (2012)","journal-title":"International Journal of Information and Electronics Engineering"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Aleksandrov, L., Maheshwari, A., Sack, J.-R.: Approximation algorithms for geometric shortest path problems, In: Proceedings of the 32nd ACM-STOC (Symposium on Theory of Computing), pp. 286\u2013295, Portland, Oregon (2000)","DOI":"10.1145\/335305.335339"},{"key":"4_CR4","unstructured":"Book, H.G., Plitt, K.J.: A multiple shooting method for direct solution optimal control problems. In: Proceedings of the 9th IFAC World Progress, pp. 225\u2013236. Pergamon Press, Budapest (1984)"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Chazelle, B., Guibas, L.: Visibility and intersection problems in plane geometry. In: Proceedings of 1st ACM Symposium on Computational Geometry, pp. 135\u2013146 (1985)","DOI":"10.1145\/323233.323252"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Clarkson, K.: Approximation algorithms for shortest path motion planning. In: Proceedings of the 19th Annual ACM Symposium on Theory of Computing, pp. 56\u201365, New York (1987)","DOI":"10.1145\/28395.28402"},{"key":"4_CR7","unstructured":"Demyen, D., Buro, M.: Efficient triangulation-based pathfinding. In: Proceedings of the 21st National Conference on Artificial Intelligence and the Eighteenth Innovative Applications of Artificial Intelligence Conference, pp. 942\u2013947, Boston, Massachusetts, USA (2006)"},{"key":"4_CR8","unstructured":"Kallmann, M.: Path planning in triangulation. In: Proceedings of the Workshop on Reasoning. Representation, and Learning in Computer Games, International Joint Conference on Artificial Intelligence (IJCAI), pp. 49\u201354, Edinburgh, Scotland (2005)"},{"key":"4_CR9","unstructured":"O\u2019Rourke, J.: Computational Geometry in C, 2nd edn. Cambridge University Press (1998)"},{"key":"4_CR10","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1002\/net.3230140304","volume":"14","author":"T Lee","year":"1984","unstructured":"Lee, T., Preparata, F.P.: Euclidean shortest paths in the presence of rectilinear barriers. Networks 14, 393\u2013410 (1984)","journal-title":"Networks"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Mitchell, J.S.B.: Geometric shortest paths and network optimization. In: Sack, J.R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 633\u2013701. Elsevier Science B. V. (2000)","DOI":"10.1016\/B978-044482537-7\/50016-4"},{"issue":"1","key":"4_CR12","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 Journal on Computing 15(1), 193\u2013215 (1986)","journal-title":"SIAM Journal on Computing"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Stoer, J., Bulirsch, R.: Introduction to Numerical Analysis, 3rd edn. Springer, New York (2002)","DOI":"10.1007\/978-0-387-21738-3"},{"key":"4_CR14","first-page":"9","volume":"3","author":"GT Toussaint","year":"1989","unstructured":"Toussaint, G.T.: Computing geodesic properties inside a simple polygon. Revue D\u2019Intelligence Artificielle 3, 9\u201342 (1989)","journal-title":"Revue D\u2019Intelligence Artificielle"}],"updated-by":[{"DOI":"10.1007\/978-3-662-45947-8_8","type":"erratum","label":"Erratum","source":"publisher","updated":{"date-parts":[[2015,1,29]],"date-time":"2015-01-29T00:00:00Z","timestamp":1422489600000}}],"container-title":["Lecture Notes in Computer Science","Transactions on Large-Scale Data- and Knowledge-Centered Systems XVI"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-45947-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T21:44:58Z","timestamp":1559079898000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-45947-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662459461","9783662459478"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-45947-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}