{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:31:59Z","timestamp":1725564719533},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642155666"},{"type":"electronic","value":"9783642155673"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15567-3_6","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T10:56:26Z","timestamp":1283684186000},"page":"71-83","source":"Crossref","is-referenced-by-count":1,"title":["Fully Isotropic Fast Marching Methods on Cartesian Grids"],"prefix":"10.1007","author":[{"given":"Vikram","family":"Appia","sequence":"first","affiliation":[]},{"given":"Anthony","family":"Yezzi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1006\/jcph.1995.1098","volume":"118","author":"D. Adalsteinsson","year":"1994","unstructured":"Adalsteinsson, D., Sethian, J.A.: A fast level set method for propagating interfaces. Journal of Computational Physics\u00a0118, 269\u2013277 (1994)","journal-title":"Journal of Computational Physics"},{"key":"6_CR2","unstructured":"Bronstein, A.M., Bronstein, M.M., Devir, Y.S., Kimmel, R., Weber, O.: Parallel algorithms for approximation of distance maps on parametric surfaces (2007)"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/3-540-48236-9_13","volume-title":"Scale-Space Theories in Computer Vision","author":"T. Chan","year":"1999","unstructured":"Chan, T., Vese, L.: An active contour model without edges. In: Nielsen, M., Johansen, P., Fogh Olsen, O., Weickert, J. (eds.) Scale-Space 1999. LNCS, vol.\u00a01682, pp. 141\u2013151. Springer, Heidelberg (1999)"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1023\/A:1007922224810","volume":"24","author":"L. Cohen","year":"1997","unstructured":"Cohen, L., Kimmel, R.: Global minimum for active contour models: A minimal path approach. International Journal of Computer Vision\u00a024, 57\u201378 (1997)","journal-title":"International Journal of Computer Vision"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"Cohen, L.D., Kimmel, R.: Global minimum for active contour models: A minimal path approach. In: IEEE Computer Society Conference on Computer Vision and Pattern Recognition, p. 666 (1996)","DOI":"10.1109\/CVPR.1996.517144"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Danielsson, P.E., Lin, Q.: A modified fast marching method. In: SCIA, pp. 1154\u20131161 (2003)","DOI":"10.1007\/3-540-45103-X_151"},{"issue":"9","key":"6_CR7","doi-asserted-by":"publisher","first-page":"1563","DOI":"10.1109\/TPAMI.2007.1154","volume":"29","author":"M.S. Hassouna","year":"2007","unstructured":"Hassouna, M.S., Farag, A.A.: Multistencils fast marching methods: A highly accurate solution to the eikonal equation on cartesian domains. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a029(9), 1563\u20131574 (2007)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"6_CR8","unstructured":"Kim, S., Folie, D.: The group marching method: An o(n) level set eikonal solver"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1109\/9.661081","volume":"43","author":"L.C. Polymenakos","year":"1998","unstructured":"Polymenakos, L.C., Bertsekas, D.P., Tsitsiklis, J.N.: Implementation of efficient algorithms for globally optimal trajectories. IEEE Transactions on Automatic Control\u00a043, 278\u2013283 (1998)","journal-title":"IEEE Transactions on Automatic Control"},{"key":"6_CR10","volume-title":"Level Set Methods and Fast Marching Methods","author":"J.A. Sethian","year":"1999","unstructured":"Sethian, J.A.: Level Set Methods and Fast Marching Methods. Cambridge University Press, Cambridge (1999)"},{"issue":"9","key":"6_CR11","doi-asserted-by":"publisher","first-page":"1528","DOI":"10.1109\/9.412624","volume":"40","author":"J.N. Tsitsiklis","year":"1995","unstructured":"Tsitsiklis, J.N.: Efficient algorithms for globally optimal trajectories. IEEE Transactions on Automatic Control\u00a040(9), 1528\u20131538 (1995)","journal-title":"IEEE Transactions on Automatic Control"}],"container-title":["Lecture Notes in Computer Science","Computer Vision \u2013 ECCV 2010"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15567-3_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,2]],"date-time":"2019-12-02T08:40:29Z","timestamp":1575276029000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15567-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642155666","9783642155673"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15567-3_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}