{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:23:18Z","timestamp":1725517398940},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540684046"},{"type":"electronic","value":"9783540684053"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-68405-3_12","type":"book-chapter","created":{"date-parts":[[2008,8,26]],"date-time":"2008-08-26T08:22:42Z","timestamp":1219738962000},"page":"187-202","source":"Crossref","is-referenced-by-count":2,"title":["An Experimental Study of Weighted k-Link Shortest Path Algorithms"],"prefix":"10.1007","author":[{"given":"Ovidiu","family":"Daescu","sequence":"first","affiliation":[]},{"given":"Joseph S. B.","family":"Mitchell","sequence":"additional","affiliation":[]},{"given":"Simeon","family":"Ntafos","sequence":"additional","affiliation":[]},{"given":"James D.","family":"Palmer","sequence":"additional","affiliation":[]},{"given":"Chee K.","family":"Yap","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/BFb0054351","volume-title":"Algorithm Theory - SWAT\u201998","author":"L. Aleksandrov","year":"1998","unstructured":"Aleksandrov, L., Lanthier, M., Maheshwari, A., Sack, J.-R.: An \u03b5-approximation algorithm for weighted shortest paths on polyhedral surfaces. In: Arnborg, S. (ed.) SWAT 1998. LNCS, vol.\u00a01432, pp. 11\u201322. Springer, Heidelberg (1998)"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Aleksandrov, L., Maheshwari, A., Sack, J.-R.: Approximation algorithms for geometric shortest path problems. In: Proc. 32nd ACM Sympos. Theory Computing, pp. 286\u2013295 (2000)","DOI":"10.1145\/335305.335339"},{"issue":"1","key":"12_CR3","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1145\/1044731.1044733","volume":"52","author":"L. Aleksandrov","year":"2005","unstructured":"Aleksandrov, L., Maheshwari, A., Sack, J.-R.: Determining approximate shortest paths on weighted polyhedral surfaces. Journal of the ACM\u00a052(1), 25\u201353 (2005)","journal-title":"Journal of the ACM"},{"key":"12_CR4","unstructured":"Arkin, E.M., Mitchell, J.S.B., Piatko, C.D.: Bicriteria shortest path problems in the plane. In: Proc. 3rd Canadian Conf. Computational Geometry, pp. 153\u2013156 (1991)"},{"issue":"1","key":"12_CR5","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1023\/A:1009885517653","volume":"5","author":"D.Z. Chen","year":"2001","unstructured":"Chen, D.Z., Daescu, O., Hu, X., Wu, X., Xu, J.: Determining an optimal penetration among weighted regions in two and three dimensions. Journal of Combinatorial Optimization\u00a05(1), 59\u201379 (2001)","journal-title":"Journal of Combinatorial Optimization"},{"issue":"2","key":"12_CR6","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1023\/A:1024484412699","volume":"7","author":"D.Z. Chen","year":"2003","unstructured":"Chen, D.Z., Hu, X., Xu, J.: Optimal beam penetration in two and three dimensions. Journal of Combinatorial Optimization\u00a07(2), 111\u2013136 (2003)","journal-title":"Journal of Combinatorial Optimization"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Daescu, O.: Improved optimal weighted links algorithms. In: Proc. ICCS 2nd International Workshop on Computational Geometry and Applications, pp. 65\u201374 (2002)","DOI":"10.1007\/3-540-47789-6_7"},{"key":"12_CR8","unstructured":"Daescu, O., Luo, J.: Proximity problems on line segments spanned by points. In: Proc. 17th Canadian Conf. Computational Geometry, pp. 224\u2013228 (2005)"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Daescu, O., Mitchell, J.S.B., Ntafos, S., Palmer, J.D., Yap, C.K.: k-link shortest paths in weighted subdivisions. In: Proc. 9th Workshop on Algorithms and Data Structures, pp. 325\u2013337 (2005)","DOI":"10.1007\/11534273_29"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Krozel, J., Lee, C., Mitchell, J.S.B.: Estimating time of arrival in heavy weather conditions. In: Proc. AIAA Guidance, Navigation, and Control, pp. 1481\u20131495 (1999)","DOI":"10.2514\/6.1999-4232"},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Lanthier, M., Maheshwari, A., Sack, J.-R.: Approximating weighted shortest paths on polyhedral surfaces. In: Proc. 13th ACM Sympos. Computational Geometry, pp. 274\u2013283 (1997)","DOI":"10.1145\/262839.263101"},{"issue":"4","key":"12_CR12","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/s00453-001-0027-5","volume":"30","author":"M. Lanthier","year":"2001","unstructured":"Lanthier, M., Maheshwari, A., Sack, J.-R.: Approximating shortest paths on weighted polyhedral surfaces. Algorithmica\u00a030(4), 527\u2013562 (2001)","journal-title":"Algorithmica"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Mata, C., Mitchell, J.S.B.: A new algorithm for computing shortest paths in weighted planar subdivisions. In: Proc. 13th ACM Sympos. Computational Geometry, pp. 264\u2013273 (1997)","DOI":"10.1145\/262839.262983"},{"key":"12_CR14","volume-title":"Handbook of Computational Geometry","author":"J.S.B. 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, Elsevier Science, Amsterdam (2000)"},{"key":"12_CR15","first-page":"607","volume-title":"Handbook of Discrete and Computational Geometry, ch. 27","author":"J.S.B. Mitchell","year":"2004","unstructured":"Mitchell, J.S.B.: Shortest paths and networks. In: Goodman, J.E., O\u2019Rourke, J. (eds.) Handbook of Discrete and Computational Geometry, ch. 27, 2nd edn., pp. 607\u2013641. Chapman & Hall\/CRC, Boca Raton (2004)","edition":"2"},{"issue":"1","key":"12_CR16","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1145\/102782.102784","volume":"38","author":"J.S.B. Mitchell","year":"1991","unstructured":"Mitchell, J.S.B., Papadimitriou, C.H.: The weighted region problem: Finding shortest paths through a weighted planar subdivision. Journal of the ACM\u00a038(1), 18\u201373 (1991)","journal-title":"Journal of the ACM"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Mitchell, J.S.B., Piatko, C.D., Arkin, E.M.: Computing a shortest k-link path in a polygon. In: Proc. 33rd IEEE Sympos. Foundations Computer Science, pp. 573\u2013582 (1992)","DOI":"10.1109\/SFCS.1992.267794"},{"key":"12_CR18","unstructured":"National Library of Medicine. The visible human project, http:\/\/www.nlm.nih.gov\/research\/visible"},{"key":"12_CR19","unstructured":"Piatko, C.D.: Geometric Bicriteria Optimal Path Problems. Ph.D. thesis, Computer Science, Cornell University (1993)"},{"key":"12_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/BFb0014497","volume-title":"Applied Computational Geometry. Towards Geometric Engineering","author":"J.R. Shewchuk","year":"1996","unstructured":"Shewchuk, J.R.: Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator. In: Lin, M.C., Manocha, D. (eds.) FCRC-WS 1996 and WACG 1996. LNCS, vol.\u00a01148, pp. 203\u2013222. Springer, Heidelberg (1996)"},{"key":"12_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1007\/978-3-540-45077-1_24","volume-title":"Fundamentals of Computation Theory","author":"Z. Sun","year":"2003","unstructured":"Sun, Z., Reif, J.H.: Adaptive and compact discretization for weighted region optimal path finding. In: Lingas, A., Nilsson, B.J. (eds.) FCT 2003. LNCS, vol.\u00a02751, pp. 258\u2013270. Springer, Heidelberg (2003)"}],"container-title":["Springer Tracts in Advanced Robotics","Algorithmic Foundation of Robotics VII"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68405-3_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:09:54Z","timestamp":1605744594000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68405-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540684046","9783540684053"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68405-3_12","relation":{},"ISSN":["1610-7438","1610-742X"],"issn-type":[{"type":"print","value":"1610-7438"},{"type":"electronic","value":"1610-742X"}],"subject":[]}}