{"id":"https://openalex.org/W4328099883","doi":"https://doi.org/10.1145/3580475","title":"A New Algorithm\u00a0for Euclidean Shortest Paths in the Plane","display_name":"A New Algorithm\u00a0for Euclidean Shortest Paths in the Plane","publication_year":2023,"publication_date":"2023-03-21","ids":{"openalex":"https://openalex.org/W4328099883","doi":"https://doi.org/10.1145/3580475"},"language":"en","primary_location":{"id":"doi:10.1145/3580475","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3580475","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3580475","source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3580475","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5100457220","display_name":"Haitao Wang","orcid":"https://orcid.org/0000-0001-8134-7409"},"institutions":[{"id":"https://openalex.org/I223532165","display_name":"University of Utah","ror":"https://ror.org/03r0ha626","country_code":"US","type":"education","lineage":["https://openalex.org/I223532165"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Haitao Wang","raw_affiliation_strings":["University of Utah, Salt Lake City, UT"],"affiliations":[{"raw_affiliation_string":"University of Utah, Salt Lake City, UT","institution_ids":["https://openalex.org/I223532165"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5100457220"],"corresponding_institution_ids":["https://openalex.org/I223532165"],"apc_list":null,"apc_paid":null,"fwci":4.5132,"has_fulltext":true,"cited_by_count":9,"citation_normalized_percentile":{"value":0.95620972,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":99},"biblio":{"volume":"70","issue":"2","first_page":"1","last_page":"62"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9919999837875366,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9861999750137329,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.8411836624145508},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7021995186805725},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.679836630821228},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.6223385334014893},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5735710859298706},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5369806885719299},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5369019508361816},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5268044471740723},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.4649888873100281},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46291616559028625},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.461760014295578},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41130945086479187},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3552607297897339},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2961103320121765},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.2155837118625641}],"concepts":[{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.8411836624145508},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7021995186805725},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.679836630821228},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.6223385334014893},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5735710859298706},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5369806885719299},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5369019508361816},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5268044471740723},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.4649888873100281},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46291616559028625},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.461760014295578},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41130945086479187},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3552607297897339},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2961103320121765},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.2155837118625641},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"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.1145/3580475","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3580475","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3580475","source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3580475","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3580475","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3580475","source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2091040771","display_name":null,"funder_award_id":"CCF-2300356","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2604537743","display_name":"AF: Small: Algorithms for Geometric Shortest Paths and Related Problems","funder_award_id":"2300356","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4515872379","display_name":"AF: Small: Algorithms for Geometric Shortest Paths and Related Problems","funder_award_id":"2005323","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5921281487","display_name":null,"funder_award_id":"number","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G895976110","display_name":null,"funder_award_id":"CCF-2005323","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4328099883.pdf","grobid_xml":"https://content.openalex.org/works/W4328099883.grobid-xml"},"referenced_works_count":50,"referenced_works":["https://openalex.org/W188591245","https://openalex.org/W1482503584","https://openalex.org/W1497730917","https://openalex.org/W1535869571","https://openalex.org/W1592479531","https://openalex.org/W1983422667","https://openalex.org/W1985010089","https://openalex.org/W1992176147","https://openalex.org/W1992320342","https://openalex.org/W2003273060","https://openalex.org/W2003711654","https://openalex.org/W2004884735","https://openalex.org/W2010733464","https://openalex.org/W2011297770","https://openalex.org/W2016584965","https://openalex.org/W2022670034","https://openalex.org/W2029668981","https://openalex.org/W2032159439","https://openalex.org/W2035612683","https://openalex.org/W2038699153","https://openalex.org/W2043598638","https://openalex.org/W2058510050","https://openalex.org/W2061072780","https://openalex.org/W2063372577","https://openalex.org/W2063460978","https://openalex.org/W2081751185","https://openalex.org/W2081777693","https://openalex.org/W2088397521","https://openalex.org/W2126876121","https://openalex.org/W2128830892","https://openalex.org/W2130647774","https://openalex.org/W2132026455","https://openalex.org/W2132339863","https://openalex.org/W2132445073","https://openalex.org/W2150861432","https://openalex.org/W2165366584","https://openalex.org/W2167427782","https://openalex.org/W2171580054","https://openalex.org/W2252238546","https://openalex.org/W2565603695","https://openalex.org/W2580070621","https://openalex.org/W2891382868","https://openalex.org/W2919220605","https://openalex.org/W2949403005","https://openalex.org/W2952603777","https://openalex.org/W2963551506","https://openalex.org/W4250008887","https://openalex.org/W4389615663","https://openalex.org/W4390575860","https://openalex.org/W6656984779"],"related_works":["https://openalex.org/W2360981904","https://openalex.org/W2347245430","https://openalex.org/W2562562750","https://openalex.org/W2377950158","https://openalex.org/W651485002","https://openalex.org/W4293054712","https://openalex.org/W2375775343","https://openalex.org/W4200172719","https://openalex.org/W2112429204","https://openalex.org/W1617152041"],"abstract_inverted_index":{"Given":[0],"a":[1,21,101,115,146,151,181],"set":[2],"of":[3,46,64,66,87,104,117,128,197,199],"pairwise":[4],"disjoint":[5],"polygonal":[6],"obstacles":[7],"in":[8,24,174,190,194],"the":[9,61,80,85,88,118,126,135,163,195,200],"plane,":[10],"finding":[11],"an":[12,44],"obstacle-avoiding":[13],"Euclidean":[14],"shortest":[15,147,164,182],"path":[16,148,165,186],"between":[17],"two":[18],"points":[19],"is":[20,60,90,121,125,132,140],"classical":[22],"problem":[23],"computational":[25],"geometry":[26],"and":[27,34,52,73,110,180],"has":[28],"been":[29],"studied":[30],"extensively.":[31],"Previously,":[32],"Hershberger":[33,72],"Suri":[35],"(in":[36,77],"SIAM":[37],"Journal":[38],"on":[39],"Computing":[40],",":[41,162],"1999)":[42],"gave":[43],"algorithm":[45,89,103,131,144],"O(n":[47,53,92],"log":[48,54,93,106],"n":[49,55,59,94,177],")":[50,56,108,178],"time":[51,109,179,192],"space,":[57,112],"where":[58,123],"total":[62],"number":[63,127,196],"vertices":[65],"all":[67],"obstacles.":[68,129],"Recently,":[69],"by":[70],"modifying":[71],"Suri\u2019s":[74],"algorithm,":[75],"Wang":[76],"SODA\u201921)":[78],"reduced":[79],"space":[81,120],"to":[82,169],"O(n)":[83,111],"while":[84],"runtime":[86],"still":[91],").":[95],"In":[96],"this":[97],"article,":[98],"we":[99],"present":[100],"new":[102],"O(n+h":[105],"h":[107,124,139],"provided":[113],"that":[114,156],"triangulation":[116],"free":[119],"given,":[122],"The":[130],"better":[133],"than":[134],"previous":[136],"work":[137],"when":[138],"relatively":[141],"small.":[142],"Our":[143],"builds":[145],"map":[149],"for":[150],"source":[152],"point":[153,160],"s":[154,168,183],"so":[155],"given":[157],"any":[158],"query":[159],"t":[161,170,185],"length":[166],"from":[167],"can":[171,187],"be":[172,188],"computed":[173],"O":[175],"(log":[176],"-":[184],"produced":[189],"additional":[191],"linear":[193],"edges":[198],"path.":[201]},"counts_by_year":[{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":3}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}