{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:21:24Z","timestamp":1725549684990},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540281016"},{"type":"electronic","value":"9783540317111"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11534273_29","type":"book-chapter","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T13:31:47Z","timestamp":1268400707000},"page":"325-337","source":"Crossref","is-referenced-by-count":8,"title":["k-Link Shortest Paths in Weighted Subdivisions"],"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":[{"issue":"1","key":"29_CR1","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"},{"issue":"1","key":"29_CR2","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":"29_CR3","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"},{"issue":"1","key":"29_CR4","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s10878-005-5485-2","volume":"9","author":"D.Z. Chen","year":"2005","unstructured":"Chen, D.Z., Xu, J., Katoh, N., Daescu, O., Wu, X., Dai, Y.: Efficient algorithms and implementations for optimizing the sum of linear fractional functions, with applications. Journal of Combinatorial Optimization\u00a09(1), 69\u201390 (2005)","journal-title":"Journal of Combinatorial Optimization"},{"unstructured":"CORE library project, http:\/\/www.cs.nyu.edu\/exact\/core","key":"29_CR5"},{"doi-asserted-by":"crossref","unstructured":"Daescu, O.: Improved optimal weighted links algorithms. In: Proc. 2nd Internat. Workshop on Computational Geometry and Applications, pp. 65\u201374 (2002)","key":"29_CR6","DOI":"10.1007\/3-540-47789-6_7"},{"unstructured":"Daescu, O., Luo, J.: Proximity problems on line segments spanned by points. In: 14th Annual Fall Workshop on Computational Geometry (November 2004)","key":"29_CR7"},{"doi-asserted-by":"crossref","unstructured":"Falk, J.E., Palocsay, S.W.: Optimizing the sum of linear fractional functions. In: Recent advances in global optimization, pp. 221\u2013258 (1992)","key":"29_CR8","DOI":"10.1515\/9781400862528.221"},{"issue":"3","key":"29_CR9","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1287\/ijoc.2.3.253","volume":"2","author":"L. Gewali","year":"1990","unstructured":"Gewali, L., Meng, A., Mitchell, J.S.B., Ntafos, S.: Path planning in 0\/1\/\u2009\u221e weighted regions with applications. ORSA J. on Computing\u00a02(3), 253\u2013272 (1990)","journal-title":"ORSA J. on Computing"},{"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, Navig., and Control, pp. 1481\u20131495 (1999)","key":"29_CR10","DOI":"10.2514\/6.1999-4232"},{"issue":"4","key":"29_CR11","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"},{"doi-asserted-by":"crossref","unstructured":"Mata, C., Mitchell, J.: A new algorithm for computing shortest paths in weighted planar subdivisions. In: Proc. 13th Ann. Symp. Comput. Geom., pp. 264\u2013273 (1997)","key":"29_CR12","DOI":"10.1145\/262839.262983"},{"doi-asserted-by":"crossref","unstructured":"McCubbin, C.B., Piatko, C.D., Peterson, A.V., Donnald, C.R.: Cooperative organic mine avoidance path planning. In: Proc. of the SPIE, vol.\u00a05794 (2005)","key":"29_CR13","DOI":"10.1117\/12.602815"},{"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. Elsevier, Amsterdam (2000)","key":"29_CR14","DOI":"10.1016\/B978-044482537-7\/50016-4"},{"issue":"1","key":"29_CR15","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"},{"doi-asserted-by":"crossref","unstructured":"Mitchell, J.S.B., Piatko, C., Arkin, E.: Computing a shortest k-link path in a polygon. In: Proc. 33rd IEEE Sympos. Found. Comput. Sci., pp. 573\u2013582 (1992)","key":"29_CR16","DOI":"10.1109\/SFCS.1992.267794"},{"unstructured":"National Library of Medicine. The visible human project, http:\/\/www.nlm.nih.gov\/research\/visible","key":"29_CR17"},{"key":"29_CR18","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":"29_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11534273_29.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:09:58Z","timestamp":1605643798000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11534273_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540281016","9783540317111"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11534273_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}