{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T20:46:47Z","timestamp":1725914807888},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319700038"},{"type":"electronic","value":"9783319700045"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-70004-5_5","type":"book-chapter","created":{"date-parts":[[2017,10,31]],"date-time":"2017-10-31T01:23:20Z","timestamp":1509413000000},"page":"73-84","source":"Crossref","is-referenced-by-count":3,"title":["An Iterative Algorithm for Computing Shortest Paths Through Line Segments in 3D"],"prefix":"10.1007","author":[{"given":"Le Hong","family":"Trang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Quynh Chi","family":"Truong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tran Khanh","family":"Dang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,11,1]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1145\/263867.263869","volume":"44","author":"PK Agarwal","year":"1997","unstructured":"Agarwal, P.K., Sharir, M., Varadarajan, K.R.: Approximating shortest paths on a convex polytope in three dimensions. J. ACM 44, 567\u2013584 (1997)","journal-title":"J. ACM"},{"issue":"2","key":"5_CR2","doi-asserted-by":"crossref","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(2), 227\u2013242 (2002)","journal-title":"Algorithmica"},{"key":"5_CR3","doi-asserted-by":"crossref","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":"5_CR4","doi-asserted-by":"crossref","unstructured":"Cheng, S.-W., Jin, J.: Shortest paths on polyhedral surfaces and terrains. In: Proceedings of STOC1 2014, pp. 373\u2013382 (2014)","DOI":"10.1145\/2591796.2591821"},{"key":"5_CR5","unstructured":"Hai, N.N., An, P.T., Huyen, P.T.T.: Shortest Paths along a sequence of line segments in Euclidean spaces, Preprint. http:\/\/math.ac.vn\/images\/Epreprint\/2016\/IMH20161101.pdf"},{"key":"5_CR6","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1137\/0221038","volume":"21","author":"EA Melissaratos","year":"1992","unstructured":"Melissaratos, E.A., Souvaine, D.L.: Shortest paths helps solve geometric optimization problems in planar regions. SIAM J. Comput. 21, 601\u2013638 (1992)","journal-title":"SIAM J. Comput."},{"key":"5_CR7","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1016\/B978-044482537-7\/50016-4","volume-title":"Handbook of Computational Geometry","author":"JSB Mitchell","year":"2000","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, Amsterdam (2000)"},{"issue":"4","key":"5_CR8","doi-asserted-by":"crossref","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(4), 647\u2013668 (1987)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"5_CR9","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0020-0190(85)90029-8","volume":"20","author":"CH Papadimitriou","year":"1985","unstructured":"Papadimitriou, C.H.: An algorithm for shortest-path motion in three dimensions. Inf. Process. Lett. 20(5), 259\u2013263 (1985)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"5_CR10","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/j.gmod.2012.04.009","volume":"74","author":"DTP Quynh","year":"2012","unstructured":"Quynh, D.T.P., He, Y., Xin, S.-Q., Chen, Z.: An intrinsic algorithm for computing geodesic distance fields on triangle meshes with holes. Graph. Models 74(4), 209\u2013220 (2012)","journal-title":"Graph. Models"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Schreiber, Y.: Euclidean shortest paths on polyhedra in three dimensions. Ph.D. thesis, Tel Aviv University (2007)","DOI":"10.1145\/1247069.1247081"},{"issue":"1","key":"5_CR12","doi-asserted-by":"crossref","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(1), 193\u2013215 (1986)","journal-title":"SIAM J. Comput."},{"key":"5_CR13","doi-asserted-by":"crossref","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, 305\u2013315 (2001)","journal-title":"Numer. Algorithms"},{"key":"5_CR14","doi-asserted-by":"crossref","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 exact shortest path on polyhedral surfaces. Comput. Aided Des. 39, 1081\u20131090 (2007)","journal-title":"Comput. Aided Des."}],"container-title":["Lecture Notes in Computer Science","Future Data and Security Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-70004-5_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,5]],"date-time":"2019-10-05T10:21:09Z","timestamp":1570270869000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-70004-5_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319700038","9783319700045"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-70004-5_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}