{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T17:03:13Z","timestamp":1726074193145},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030432287"},{"type":"electronic","value":"9783030432294"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-43229-4_30","type":"book-chapter","created":{"date-parts":[[2020,3,19]],"date-time":"2020-03-19T00:03:53Z","timestamp":1584576233000},"page":"348-358","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Parallelized Construction of Extension Velocities for the Level-Set Method"],"prefix":"10.1007","author":[{"given":"Michael","family":"Quell","sequence":"first","affiliation":[]},{"given":"Paul","family":"Manstetten","sequence":"additional","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":[[2020,3,19]]},"reference":[{"issue":"1","key":"30_CR1","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1006\/jcph.1998.6090","volume":"148","author":"D Adalsteinsson","year":"1999","unstructured":"Adalsteinsson, D., Sethian, J.A.: The fast construction of extension velocities in level set methods. J. Comput. Phys. 148(1), 2\u201322 (1999). \nhttps:\/\/doi.org\/10.1006\/jcph.1998.6090","journal-title":"J. Comput. Phys."},{"issue":"8","key":"30_CR2","doi-asserted-by":"publisher","first-page":"4002","DOI":"10.1016\/j.jcp.2007.12.018","volume":"227","author":"LT Cheng","year":"2008","unstructured":"Cheng, L.T., Tsai, Y.H.: Redistancing by flow of time dependent eikonal equation. J. Comput. Phys. 227(8), 4002\u20134017 (2008). \nhttps:\/\/doi.org\/10.1016\/j.jcp.2007.12.018","journal-title":"J. Comput. Phys."},{"key":"30_CR3","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. MIT Press, Cambridge (2009). ISBN: 9780262033848"},{"key":"30_CR4","doi-asserted-by":"publisher","unstructured":"Diamantopoulos, G., Weinbub, J., Selberherr, S., H\u00f6ssinger, A.: 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, pp. 1\u20138 (2017). \nhttps:\/\/doi.org\/10.1109\/ICCSA.2017.7999648","DOI":"10.1109\/ICCSA.2017.7999648"},{"key":"30_CR5","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/3-540-57163-9_23","volume":"710","author":"T Hagerup","year":"1993","unstructured":"Hagerup, T., Maas, M.: Generalized topological sorting in linear time. Fundam. Comput. Theory 710, 279\u2013288 (1993). \nhttps:\/\/doi.org\/10.1007\/3-540-57163-9_23","journal-title":"Fundam. Comput. Theory"},{"issue":"5","key":"30_CR6","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). \nhttps:\/\/doi.org\/10.1137\/060670298","journal-title":"SIAM J. Sci. Comput."},{"issue":"3","key":"30_CR7","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1145\/1015706.1015745","volume":"23","author":"F Losasso","year":"2004","unstructured":"Losasso, F., Gibou, F., Fedkiw, R.: Simulating water and smoke with an octree data structure. ACM Trans. Graph. 23(3), 457\u2013462 (2004). \nhttps:\/\/doi.org\/10.1145\/1015706.1015745","journal-title":"ACM Trans. Graph."},{"issue":"3","key":"30_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2487228.2487235","volume":"32","author":"K Museth","year":"2013","unstructured":"Museth, K.: VDB: high-resolution sparse volumes with dynamic topology. ACM Trans. Graph. 32(3), 1\u201322 (2013). \nhttps:\/\/doi.org\/10.1145\/2487228.2487235","journal-title":"ACM Trans. Graph."},{"issue":"1","key":"30_CR9","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/0021-9991(88)90002-2","volume":"79","author":"S Osher","year":"1988","unstructured":"Osher, S., Sethian, J.A.: Fronts propagating with curvature-dependent speed: algorithms based on Hamilton-Jacobi formulations. J. Comput. Phys. 79(1), 12\u201349 (1988). \nhttps:\/\/doi.org\/10.1016\/0021-9991(88)90002-2","journal-title":"J. Comput. Phys."},{"issue":"1","key":"30_CR10","doi-asserted-by":"publisher","first-page":"677","DOI":"10.4028\/www.scientific.net\/AMR.328-330.677","volume":"328","author":"GF Ouyang","year":"2011","unstructured":"Ouyang, G.F., Kuang, Y.C., Zhang, X.M.: A fast scanning algorithm for extension velocities in level set methods. Adv. Mater. Res. 328(1), 677\u2013680 (2011). \nhttps:\/\/doi.org\/10.4028\/www.scientific.net\/AMR.328-330.677","journal-title":"Adv. Mater. Res."},{"issue":"1","key":"30_CR11","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1137\/050627083","volume":"45","author":"J Qian","year":"2007","unstructured":"Qian, J., Zhang, Y., Zhao, H.: Fast sweeping methods for Eikonal equations on triangular meshes. SIAM J. Numer. Anal. 45(1), 83\u2013107 (2007). \nhttps:\/\/doi.org\/10.1137\/050627083","journal-title":"SIAM J. Numer. Anal."},{"key":"30_CR12","doi-asserted-by":"publisher","first-page":"1591","DOI":"10.1073\/pnas.93.4.1591","volume":"93","author":"JA Sethian","year":"1996","unstructured":"Sethian, J.A.: A fast marching level set method for monotonically advancing fronts. Proc. Natl. Acad. Sci. 93, 1591\u20131595 (1996). \nhttps:\/\/doi.org\/10.1073\/pnas.93.4.1591","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"11","key":"30_CR13","doi-asserted-by":"publisher","first-page":"5699","DOI":"10.1073\/pnas.090060097","volume":"97","author":"JA Sethian","year":"2000","unstructured":"Sethian, J.A., Vladimirsky, A.: Fast methods for the Eikonal and related Hamilton-Jacobi equations on unstructured meshes. Proc. Natl. Acad. Sci. 97(11), 5699\u20135703 (2000). \nhttps:\/\/doi.org\/10.1073\/pnas.090060097","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"4","key":"30_CR14","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/s10825-006-0003-z","volume":"5","author":"V Suvorov","year":"2006","unstructured":"Suvorov, V., H\u00f6ssinger, A., Djuri\u0107, Z., Ljepojevic, N.: A novel approach to three-dimensional semiconductor process simulation: application to thermal oxidation. J. Comput. Electron. 5(4), 291\u2013295 (2006). \nhttps:\/\/doi.org\/10.1007\/s10825-006-0003-z","journal-title":"J. Comput. Electron."},{"key":"30_CR15","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. 1\u20138. Society for Modeling and Simulation International (2016). \nhttps:\/\/doi.org\/10.22360\/SpringSim.2016.HPC.052","DOI":"10.22360\/SpringSim.2016.HPC.052"},{"key":"30_CR16","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). \nhttps:\/\/doi.org\/10.1016\/j.jcp.2016.12.012","journal-title":"J. Comput. Phys."},{"issue":"2","key":"30_CR17","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/j.jcp.2005.08.005","volume":"212","author":"L Yatziv","year":"2006","unstructured":"Yatziv, L., Bartesaghi, A., Sapiro, G.: O(N) implementation of the fast marching algorithm. J. Comput. Phys. 212(2), 393\u2013399 (2006). \nhttps:\/\/doi.org\/10.1016\/j.jcp.2005.08.005","journal-title":"J. Comput. Phys."}],"container-title":["Lecture Notes in Computer Science","Parallel Processing and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-43229-4_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,19]],"date-time":"2020-03-19T00:09:34Z","timestamp":1584576574000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-43229-4_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030432287","9783030432294"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-43229-4_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"19 March 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PPAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Parallel Processing and Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bialystok","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ppam2019a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.ppam.pl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"161","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"91","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"57% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2,5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}