{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:08:29Z","timestamp":1750306109367,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":5,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,7,30]],"date-time":"2017-07-30T00:00:00Z","timestamp":1501372800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,7,30]]},"DOI":"10.1145\/3084363.3085093","type":"proceedings-article","created":{"date-parts":[[2017,7,27]],"date-time":"2017-07-27T11:59:48Z","timestamp":1501156788000},"page":"1-2","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Novel algorithm for sparse and parallel fast sweeping"],"prefix":"10.1145","author":[{"given":"Ken","family":"Museth","sequence":"first","affiliation":[{"name":"DreamWorks Animation"}]}],"member":"320","published-online":{"date-parts":[[2017,7,30]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcp.2012.11.042"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487228.2487235"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.93.4.1591"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-04-01678-3"},{"key":"e_1_3_2_1_5_1","first-page":"421","article-title":"Parallel implementation of the fast sweeping method","volume":"25","author":"Zhao Hongkai","year":"2007","unstructured":"Hongkai Zhao . 2007 . Parallel implementation of the fast sweeping method . Journal of Computational Mathematics 25 , 4 (2007), 421 -- 429 . Hongkai Zhao. 2007. Parallel implementation of the fast sweeping method. Journal of Computational Mathematics 25, 4 (2007), 421--429.","journal-title":"Journal of Computational Mathematics"}],"event":{"name":"SIGGRAPH '17: Special Interest Group on Computer Graphics and Interactive Techniques Conference","sponsor":["SIGGRAPH ACM Special Interest Group on Computer Graphics and Interactive Techniques"],"location":"Los Angeles California","acronym":"SIGGRAPH '17"},"container-title":["ACM SIGGRAPH 2017 Talks"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3084363.3085093","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3084363.3085093","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:36:14Z","timestamp":1750217774000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3084363.3085093"}},"subtitle":["efficient computation of sparse signed distance fields"],"short-title":[],"issued":{"date-parts":[[2017,7,30]]},"references-count":5,"alternative-id":["10.1145\/3084363.3085093","10.1145\/3084363"],"URL":"https:\/\/doi.org\/10.1145\/3084363.3085093","relation":{},"subject":[],"published":{"date-parts":[[2017,7,30]]},"assertion":[{"value":"2017-07-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}