{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T14:24:24Z","timestamp":1750775064999},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540406013"},{"type":"electronic","value":"9783540451037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-45103-x_151","type":"book-chapter","created":{"date-parts":[[2007,10,25]],"date-time":"2007-10-25T06:35:23Z","timestamp":1193294123000},"page":"1154-1161","source":"Crossref","is-referenced-by-count":16,"title":["A Modified Fast Marching Method"],"prefix":"10.1007","author":[{"given":"Per-Erik","family":"Danielsson","sequence":"first","affiliation":[]},{"given":"Qingfen","family":"Lin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"key":"151_CR1","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1006\/jcph.1995.1098","volume":"118","author":"D. Adalsteinsson","year":"1995","unstructured":"D. Adalsteinsson and J. A. Sethian. A fast level set method for propagating interfaces. Journal of Computational Physics, 118:269\u2013277, 1995.","journal-title":"Journal of Computational Physics"},{"key":"151_CR2","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E. W. Dijkstra","year":"1959","unstructured":"E. W. Dijkstra. A note on two problems in connection with graphs. Numerische Mathematik, 1:269\u2013271, 1959.","journal-title":"Numerische Mathematik"},{"issue":"6","key":"151_CR3","doi-asserted-by":"publisher","first-page":"2178","DOI":"10.1137\/S1064827500367130","volume":"22","author":"S. Kim","year":"2001","unstructured":"Seongjai Kim. An O(N) level set method for eikonal equations. SIAM J. Sci. Comput., 22(6):2178\u20132193, 2001.","journal-title":"SIAM J. Sci. Comput."},{"key":"151_CR4","unstructured":"Qingfen Lin. Enhancement, extraction, and visualization of 3D volume data. PhD thesis, Link\u00f6ping University, 2003."},{"key":"151_CR5","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/1049-9660(92)90050-D","volume":"56","author":"I. Ragnemalm","year":"1992","unstructured":"Ingemar Ragnemalm. Neighborhoods for distance transformation using ordered propagation. CVGIP-Image Understanding, 56:161\u2013166, 1992.","journal-title":"CVGIP-Image Understanding"},{"key":"151_CR6","doi-asserted-by":"crossref","unstructured":"J. A. Sethian. Level Set Methods and Fast Marching Methods. Cambridge University Press, 1999.","DOI":"10.1137\/S0036144598347059"},{"issue":"9","key":"151_CR7","doi-asserted-by":"publisher","first-page":"1528","DOI":"10.1109\/9.412624","volume":"40","author":"J. N. Tsitsiklis","year":"1995","unstructured":"John N. Tsitsiklis. Efficient algorithm for globally optimal trajectories. IEEE Transactions on Automatic Control, 40(9):1528\u20131538, 1995.","journal-title":"IEEE Transactions on Automatic Control"}],"container-title":["Lecture Notes in Computer Science","Image Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45103-X_151","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,4]],"date-time":"2019-05-04T00:13:20Z","timestamp":1556928800000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45103-X_151"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540406013","9783540451037"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-45103-x_151","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}