{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,4]],"date-time":"2025-04-04T12:28:24Z","timestamp":1743769704341,"version":"3.28.0"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1109\/iccsa.2017.7999648","type":"proceedings-article","created":{"date-parts":[[2017,8,3]],"date-time":"2017-08-03T16:24:52Z","timestamp":1501777492000},"page":"1-8","source":"Crossref","is-referenced-by-count":4,"title":["Evaluation of the shared-memory parallel Fast Marching Method for re-distancing problems"],"prefix":"10.1109","author":[{"given":"Georgios","family":"Diamantopoulos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Josef","family":"Weinbub","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Hossinger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Siegfried","family":"Selberherr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"421","article-title":"Parallel Implementations of the Fast Sweeping Method","volume":"25","year":"2007","journal-title":"Journal of Computational Mathematics"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/060670298"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/10080909X"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/12088197X"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/0729053"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2011.05.041"},{"key":"ref3","first-page":"213","article-title":"A Domain Decomposition Parallelization of the Fast Marching Method","author":"herrmann","year":"2003","journal-title":"Anual Research Briefs Center for Turbulence Research Stanford University"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcp.2016.12.012"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-18827-0_30"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.procs.2016.05.408"},{"key":"ref7","first-page":"18:1","article-title":"Shared-Memory Parallelization of the Fast Marching Method Using an Overlapping Domain-Decomposition Approach","author":"weinbub","year":"2016","journal-title":"24th High Performance Computing Symposium"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"journal-title":"Level Set Methods and Fast Marching Methods Evolving Interfaces in Computational Geometry Fluid Mechanics Computer Vision and Materials Science","year":"1999","author":"sethian","key":"ref1"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-04-01678-3"}],"event":{"name":"2017 17th International Conference on Computational Science and Its Applications (ICCSA)","start":{"date-parts":[[2017,7,3]]},"location":"Trieste, Italy","end":{"date-parts":[[2017,7,6]]}},"container-title":["2017 17th International Conference on Computational Science and Its Applications (ICCSA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7991627\/7999641\/07999648.pdf?arnumber=7999648","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,23]],"date-time":"2017-08-23T19:44:27Z","timestamp":1503517467000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7999648\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/iccsa.2017.7999648","relation":{},"subject":[],"published":{"date-parts":[[2017,7]]}}}