{"id":"https://openalex.org/W2160106931","doi":"https://doi.org/10.1137/s1064827500367130","title":"An $\\cal O(N)$ Level Set Method for Eikonal Equations","display_name":"An $\\cal O(N)$ Level Set Method for Eikonal Equations","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W2160106931","doi":"https://doi.org/10.1137/s1064827500367130","mag":"2160106931"},"language":"en","primary_location":{"id":"doi:10.1137/s1064827500367130","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1064827500367130","pdf_url":null,"source":{"id":"https://openalex.org/S165512578","display_name":"SIAM Journal on Scientific Computing","issn_l":"1064-8275","issn":["1064-8275","1095-7197"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Scientific Computing","raw_type":"journal-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/A5052797183","display_name":"Seongjai Kim","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Seongjai Kim","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5052797183"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.7056,"has_fulltext":false,"cited_by_count":99,"citation_normalized_percentile":{"value":0.92658228,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"22","issue":"6","first_page":"2178","last_page":"2193"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10339","display_name":"Advanced Numerical Methods in Computational Mathematics","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10339","display_name":"Advanced Numerical Methods in Computational Mathematics","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10173","display_name":"Computational Fluid Dynamics and Aerodynamics","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10514","display_name":"Numerical methods in engineering","score":0.9940000176429749,"subfield":{"id":"https://openalex.org/subfields/2211","display_name":"Mechanics of Materials"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/fast-marching-method","display_name":"Fast marching method","score":0.9455227851867676},{"id":"https://openalex.org/keywords/eikonal-equation","display_name":"Eikonal equation","score":0.8365219235420227},{"id":"https://openalex.org/keywords/classification-of-discontinuities","display_name":"Classification of discontinuities","score":0.7380006313323975},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6977044343948364},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.6313967704772949},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4974830448627472},{"id":"https://openalex.org/keywords/regular-grid","display_name":"Regular grid","score":0.479415625333786},{"id":"https://openalex.org/keywords/level-set-method","display_name":"Level set method","score":0.4671309292316437},{"id":"https://openalex.org/keywords/group","display_name":"Group (periodic table)","score":0.4638524055480957},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.41246429085731506},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4003516137599945},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.3850921392440796},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.33004996180534363},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.3202071785926819},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.24578940868377686},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.18149101734161377}],"concepts":[{"id":"https://openalex.org/C17866373","wikidata":"https://www.wikidata.org/wiki/Q5437042","display_name":"Fast marching method","level":2,"score":0.9455227851867676},{"id":"https://openalex.org/C40375134","wikidata":"https://www.wikidata.org/wiki/Q1303846","display_name":"Eikonal equation","level":2,"score":0.8365219235420227},{"id":"https://openalex.org/C15627037","wikidata":"https://www.wikidata.org/wiki/Q541961","display_name":"Classification of discontinuities","level":2,"score":0.7380006313323975},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6977044343948364},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.6313967704772949},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4974830448627472},{"id":"https://openalex.org/C43173174","wikidata":"https://www.wikidata.org/wiki/Q2646942","display_name":"Regular grid","level":3,"score":0.479415625333786},{"id":"https://openalex.org/C125269122","wikidata":"https://www.wikidata.org/wiki/Q1751397","display_name":"Level set method","level":4,"score":0.4671309292316437},{"id":"https://openalex.org/C2781311116","wikidata":"https://www.wikidata.org/wiki/Q83306","display_name":"Group (periodic table)","level":2,"score":0.4638524055480957},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.41246429085731506},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4003516137599945},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3850921392440796},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.33004996180534363},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.3202071785926819},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.24578940868377686},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.18149101734161377},{"id":"https://openalex.org/C124504099","wikidata":"https://www.wikidata.org/wiki/Q56933","display_name":"Image segmentation","level":3,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C178790620","wikidata":"https://www.wikidata.org/wiki/Q11351","display_name":"Organic chemistry","level":1,"score":0.0},{"id":"https://openalex.org/C89600930","wikidata":"https://www.wikidata.org/wiki/Q1423946","display_name":"Segmentation","level":2,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s1064827500367130","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1064827500367130","pdf_url":null,"source":{"id":"https://openalex.org/S165512578","display_name":"SIAM Journal on Scientific Computing","issn_l":"1064-8275","issn":["1064-8275","1095-7197"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Scientific Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W153353184","https://openalex.org/W1991113069","https://openalex.org/W1999244633","https://openalex.org/W2012872284","https://openalex.org/W2024762046","https://openalex.org/W2052629386","https://openalex.org/W2054113582","https://openalex.org/W2058615912","https://openalex.org/W2065666685","https://openalex.org/W2072073142","https://openalex.org/W2085961516","https://openalex.org/W2106791960","https://openalex.org/W2118920711","https://openalex.org/W2141603699","https://openalex.org/W2561843528","https://openalex.org/W2749408143"],"related_works":["https://openalex.org/W2474675250","https://openalex.org/W2200845428","https://openalex.org/W1970732967","https://openalex.org/W2415867404","https://openalex.org/W2050394778","https://openalex.org/W2052629386","https://openalex.org/W2618429653","https://openalex.org/W176770976","https://openalex.org/W3083851338","https://openalex.org/W2129438083"],"abstract_inverted_index":{"A":[0],"propagating":[1],"interface":[2],"can":[3],"develop":[4],"corners":[5],"and":[6,167],"discontinuities":[7],"as":[8,87],"it":[9,92],"advances.":[10],"Level":[11],"set":[12,34,69],"algorithms":[13,35],"have":[14],"been":[15],"extensively":[16],"applied":[17,160],"for":[18,140],"the":[19,23,30,37,52,62,72,83,89,111,114,132,135,141,155,158,162],"problems":[20],"in":[21,88,113,137,165],"which":[22,43],"solution":[24,112],"has":[25],"advancing":[26],"fronts.":[27],"One":[28],"of":[29,54,64,102,128,143,157],"most":[31],"popular":[32],"level":[33,68],"is":[36,51,59,80,93],"so-called":[38],"{fast":[39],"marching":[40,74],"method}":[41],"(FMM),":[42],"requires":[44],"total":[45],"$\\cal":[46,66],"O(N\\log_2N)$":[47],"operations,":[48],"where":[49],"N":[50],"number":[53],"grid":[55,103,122,129],"points.":[56],"The":[57,77],"article":[58],"concerned":[60],"with":[61],"development":[63],"an":[65],"O(N)$":[67],"algorithm":[70],"called":[71],"group":[73,101,127,136],"method":[75,79],"(GMM).":[76],"new":[78],"based":[81],"on":[82],"narrow":[84,115],"band":[85,116],"approach":[86],"FMM.":[90],"However,":[91],"incorporating":[94],"a":[95,100,106,120,126],"correction-by-iteration":[96],"strategy":[97],"to":[98,117,153,161],"advance":[99],"points":[104,130],"at":[105],"time,":[107],"rather":[108],"than":[109,146],"sorting":[110],"march":[118],"forward":[119],"single":[121],"point.":[123],"After":[124],"selecting":[125],"appropriately,":[131],"GMM":[133],"advances":[134],"two":[138,166],"iterations":[139],"cost":[142],"slightly":[144],"larger":[145],"one":[147],"iteration.":[148],"Numerical":[149],"results":[150],"are":[151],"presented":[152],"show":[154],"efficiency":[156],"method,":[159],"eikonal":[163],"equation":[164],"three":[168],"dimensions.":[169]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":8}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}
