{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T07:01:28Z","timestamp":1772434888273,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,4,11]],"date-time":"2019-04-11T00:00:00Z","timestamp":1554940800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100006012","name":"Christian Doppler Forschungsgesellschaft","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100006012","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Adv Comput Math"],"published-print":{"date-parts":[[2019,8]]},"DOI":"10.1007\/s10444-019-09683-z","type":"journal-article","created":{"date-parts":[[2019,4,11]],"date-time":"2019-04-11T06:02:40Z","timestamp":1554962560000},"page":"2029-2045","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A shared memory parallel multi-mesh fast marching method for re-distancing"],"prefix":"10.1007","volume":"45","author":[{"given":"Georgios","family":"Diamantopoulos","sequence":"first","affiliation":[]},{"given":"Andreas","family":"H\u00f6ssinger","sequence":"additional","affiliation":[]},{"given":"Siegfried","family":"Selberherr","sequence":"additional","affiliation":[]},{"given":"Josef","family":"Weinbub","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,11]]},"reference":[{"issue":"1","key":"9683_CR1","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.amc.2011.05.041 https:\/\/doi.org\/10.1016\/j.amc.2011.05.041","volume":"218","author":"M Breu\u00df","year":"2011","unstructured":"Breu\u00df, M., Cristiani, E., Gwosdek, P., Vogel, O.: An adaptive domain-decomposition technique for parallelization of the fast marching method. Appl. Math. Comput. 218(1), 32\u201344 (2011). \n                    https:\/\/doi.org\/10.1016\/j.amc.2011.05.041","journal-title":"Appl. Math. Comput."},{"issue":"2","key":"9683_CR2","doi-asserted-by":"publisher","first-page":"A547","DOI":"10.1137\/10080909X","volume":"34","author":"A Chacon","year":"2012","unstructured":"Chacon, A., Vladimirsky, A.: Fast two-scale methods for Eikonal equations. SIAM J. Sci. Comput. 34(2), A547\u2013A578 (2012). \n                    https:\/\/doi.org\/10.1137\/10080909X","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"9683_CR3","doi-asserted-by":"publisher","first-page":"A156","DOI":"10.1137\/12088197X","volume":"37","author":"A Chacon","year":"2015","unstructured":"Chacon, A., Vladimirsky, A.: A parallel two-scale method for Eikonal equations. SIAM J. Sci. Comput. 37(1), A156\u2013A180 (2015). \n                    https:\/\/doi.org\/10.1137\/12088197X","journal-title":"SIAM J. Sci. Comput."},{"key":"9683_CR4","doi-asserted-by":"publisher","unstructured":"Diamantopoulos, G., Weinbub, J., H\u00f6ssinger, A., Selberherr, S.: Evaluation of the shared-memory parallel fast marching method for re-distancing problems. In: Proceedings of the 17th International Conference on Computational Science and Its Applications (ICCSA), pp. 1\u20138. \n                    https:\/\/doi.org\/10.1109\/ICCSA.2017.7999648\n                    \n                   (2017)","DOI":"10.1109\/ICCSA.2017.7999648"},{"issue":"1","key":"9683_CR5","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numer. Math. 1(1), 269\u2013271 (1959). \n                    https:\/\/doi.org\/10.1007\/BF01386390","journal-title":"Numer. Math."},{"key":"9683_CR6","unstructured":"Herrmann, M.: A domain decomposition parallelization of the fast marching method. In: Anual Research Briefs, pp. 213\u2013225. Center for Turbulence Research, Stanford University (2003)"},{"issue":"5","key":"9683_CR7","doi-asserted-by":"publisher","first-page":"2512","DOI":"10.1137\/060670298","volume":"30","author":"WK Jeong","year":"2008","unstructured":"Jeong, W.K., Whitaker, R.T.: A fast iterative method for Eikonal equations. SIAM J. Sci. Comput. 30(5), 2512\u20132534 (2008). \n                    https:\/\/doi.org\/10.1137\/060670298","journal-title":"SIAM J. Sci. Comput."},{"key":"9683_CR8","unstructured":"Manstetten, P.: Efficient Flux Calculations for Topography Simulation. Ph.D. thesis, TU Wien (2018). \n                    http:\/\/www.iue.tuwien.ac.at\/phd\/manstetten\/"},{"issue":"3","key":"9683_CR9","doi-asserted-by":"publisher","first-page":"867","DOI":"10.1137\/0729053","volume":"29","author":"E Rouy","year":"1992","unstructured":"Rouy, E., Tourin, A.: A viscosity solutions approach to shape-from-shading. SIAM J. Numer. Anal. 29(3), 867\u2013884 (1992). \n                    https:\/\/doi.org\/10.1137\/0729053","journal-title":"SIAM J. Numer. Anal."},{"key":"9683_CR10","unstructured":"Sethian, J.A.: Level Set Methods and Fast Marching Methods: Evolving Interfaces in Computational Geometry, Fluid Mechanics, Computer Vision, and Materials Science, 2nd edn. Cambridge University Press (1999)"},{"key":"9683_CR11","doi-asserted-by":"publisher","first-page":"2271","DOI":"10.1016\/j.procs.2016.05.408","volume":"80","author":"J Weinbub","year":"2016","unstructured":"Weinbub, J., H\u00f6ssinger, A.: Comparison of the parallel fast marching method, the fast iterative method, and the parallel semi-ordered fast iterative method. Procedia Comput. Sci. 80, 2271\u20132275 (2016). \n                    https:\/\/doi.org\/10.1016\/j.procs.2016.05.408","journal-title":"Procedia Comput. Sci."},{"key":"9683_CR12","doi-asserted-by":"publisher","unstructured":"Weinbub, J., H\u00f6ssinger, A.: Shared-memory parallelization of the fast marching method using an overlapping domain-decomposition approach. In: Proceedings of the 24th High Performance Computing Symposium, pp. 18:1\u201318:8. \n                    https:\/\/doi.org\/10.22360\/SpringSim.2016.HPC.052\n                    \n                   (2016)","DOI":"10.22360\/SpringSim.2016.HPC.052"},{"key":"9683_CR13","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/j.jcp.2016.12.012","volume":"332","author":"J Yang","year":"2017","unstructured":"Yang, J., Stern, F.: A highly scalable massively parallel fast marching method for the Eikonal equation. J. Comput. Phys. 332, 333\u2013362 (2017). \n                    https:\/\/doi.org\/10.1016\/j.jcp.2016.12.012","journal-title":"J. Comput. Phys."},{"issue":"250","key":"9683_CR14","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1090\/S0025-5718-04-01678-3","volume":"74","author":"H Zhao","year":"2005","unstructured":"Zhao, H.: A fast sweeping method for Eikonal equations. Math. Comput. 74 (250), 603\u2013627 (2005). \n                    https:\/\/doi.org\/10.1090\/S0025-5718-04-01678-3","journal-title":"Math. Comput."},{"issue":"4","key":"9683_CR15","first-page":"421","volume":"25","author":"H Zhao","year":"2007","unstructured":"Zhao, H.: Parallel implementations of the fast sweeping method. J. Comput. Math. 25(4), 421\u2013429 (2007). \n                    https:\/\/www.jstor.org\/stable\/43693378","journal-title":"J. Comput. Math."}],"container-title":["Advances in Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10444-019-09683-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10444-019-09683-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10444-019-09683-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T23:22:31Z","timestamp":1586474551000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10444-019-09683-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4,11]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,8]]}},"alternative-id":["9683"],"URL":"https:\/\/doi.org\/10.1007\/s10444-019-09683-z","relation":{},"ISSN":["1019-7168","1572-9044"],"issn-type":[{"value":"1019-7168","type":"print"},{"value":"1572-9044","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,4,11]]},"assertion":[{"value":"29 September 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 March 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 April 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}