{"id":"https://openalex.org/W2739558003","doi":"https://doi.org/10.1145/3084363.3085093","title":"Novel algorithm for sparse and parallel fast sweeping","display_name":"Novel algorithm for sparse and parallel fast sweeping","publication_year":2017,"publication_date":"2017-07-27","ids":{"openalex":"https://openalex.org/W2739558003","doi":"https://doi.org/10.1145/3084363.3085093","mag":"2739558003"},"language":"en","primary_location":{"id":"doi:10.1145/3084363.3085093","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3084363.3085093","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM SIGGRAPH 2017 Talks","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5034723250","display_name":"Ken Museth","orcid":"https://orcid.org/0000-0002-9926-780X"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Ken Museth","raw_affiliation_strings":["DreamWorks Animation"],"affiliations":[{"raw_affiliation_string":"DreamWorks Animation","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5034723250"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6759,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.68543874,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"2"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7756112813949585},{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.7247559428215027},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6361794471740723},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.601215660572052},{"id":"https://openalex.org/keywords/sparse-grid","display_name":"Sparse grid","score":0.5718317627906799},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.5467293858528137},{"id":"https://openalex.org/keywords/sparse-matrix","display_name":"Sparse matrix","score":0.46028417348861694},{"id":"https://openalex.org/keywords/concurrent-computing","display_name":"Concurrent computing","score":0.44936975836753845},{"id":"https://openalex.org/keywords/sparse-approximation","display_name":"Sparse approximation","score":0.42091917991638184},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.13742896914482117}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7756112813949585},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.7247559428215027},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6361794471740723},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.601215660572052},{"id":"https://openalex.org/C156439662","wikidata":"https://www.wikidata.org/wiki/Q7573793","display_name":"Sparse grid","level":2,"score":0.5718317627906799},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.5467293858528137},{"id":"https://openalex.org/C56372850","wikidata":"https://www.wikidata.org/wiki/Q1050404","display_name":"Sparse matrix","level":3,"score":0.46028417348861694},{"id":"https://openalex.org/C150495011","wikidata":"https://www.wikidata.org/wiki/Q128392","display_name":"Concurrent computing","level":2,"score":0.44936975836753845},{"id":"https://openalex.org/C124066611","wikidata":"https://www.wikidata.org/wiki/Q28684319","display_name":"Sparse approximation","level":2,"score":0.42091917991638184},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.13742896914482117},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3084363.3085093","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3084363.3085093","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM SIGGRAPH 2017 Talks","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W58978348","https://openalex.org/W1999244633","https://openalex.org/W2029315739","https://openalex.org/W2049391017","https://openalex.org/W2165221050","https://openalex.org/W3010696258"],"related_works":["https://openalex.org/W2091883426","https://openalex.org/W2174948646","https://openalex.org/W3173235360","https://openalex.org/W2024017047","https://openalex.org/W4318256793","https://openalex.org/W2594370889","https://openalex.org/W2390720471","https://openalex.org/W2051410394","https://openalex.org/W1600789676","https://openalex.org/W2134327945"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2],"new":[3],"efficient":[4],"algorithm":[5],"for":[6],"computing":[7],"signed":[8],"distance":[9],"fields":[10],"by":[11],"means":[12],"of":[13,29],"the":[14,27],"Fast":[15],"Sweeping":[16],"Method.":[17],"Unlike":[18],"existing":[19],"algorithms":[20],"ours":[21],"is":[22],"explicitly":[23],"designed":[24],"to":[25],"explore":[26],"benefits":[28],"sparse":[30],"(vs":[31],"dense)":[32],"grids":[33],"as":[34,36],"well":[35],"concurrency,":[37],"i.e.":[38],"mutli-threading.":[39]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}