{"id":"https://openalex.org/W3166750876","doi":"https://doi.org/10.1145/3406325.3451037","title":"A new algorithm for Euclidean shortest paths in the plane","display_name":"A new algorithm for Euclidean shortest paths in the plane","publication_year":2021,"publication_date":"2021-06-15","ids":{"openalex":"https://openalex.org/W3166750876","doi":"https://doi.org/10.1145/3406325.3451037","mag":"3166750876"},"language":"en","primary_location":{"id":"doi:10.1145/3406325.3451037","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3406325.3451037","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3406325.3451037","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3406325.3451037","any_repository_has_fulltext":null},"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/I121980950","display_name":"Utah State University","ror":"https://ror.org/00h6set76","country_code":"US","type":"education","lineage":["https://openalex.org/I121980950"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Haitao Wang","raw_affiliation_strings":["Utah State University, USA"],"raw_orcid":"https://orcid.org/0000-0001-8134-7409","affiliations":[{"raw_affiliation_string":"Utah State University, USA","institution_ids":["https://openalex.org/I121980950"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5100457220"],"corresponding_institution_ids":["https://openalex.org/I121980950"],"apc_list":null,"apc_paid":null,"fwci":0.716,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.7394958,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"975","last_page":"988"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9922999739646912,"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"}},{"id":"https://openalex.org/T12923","display_name":"Digital Image Processing Techniques","score":0.9897000193595886,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.8931707143783569},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6882239580154419},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.605648934841156},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5980265736579895},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5339673161506653},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4953969717025757},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.49535906314849854},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.4878427982330322},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.4598989486694336},{"id":"https://openalex.org/keywords/computational-geometry","display_name":"Computational geometry","score":0.4520858824253082},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.43529239296913147},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.39944693446159363},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.2102627456188202},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.06318008899688721}],"concepts":[{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.8931707143783569},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6882239580154419},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.605648934841156},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5980265736579895},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5339673161506653},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4953969717025757},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.49535906314849854},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.4878427982330322},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.4598989486694336},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.4520858824253082},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.43529239296913147},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.39944693446159363},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.2102627456188202},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.06318008899688721},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3406325.3451037","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3406325.3451037","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3406325.3451037","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:digitalcommons.usu.edu:computer_science_facpubs-1020","is_oa":false,"landing_page_url":"https://digitalcommons.usu.edu/computer_science_facpubs/20","pdf_url":null,"source":{"id":"https://openalex.org/S4377196327","display_name":"Digital Commons - USU (Utah State University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I121980950","host_organization_name":"Utah State University","host_organization_lineage":["https://openalex.org/I121980950"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Computer Science Faculty and Staff Publications","raw_type":"text"}],"best_oa_location":{"id":"doi:10.1145/3406325.3451037","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3406325.3451037","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3406325.3451037","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"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"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3166750876.pdf","grobid_xml":"https://content.openalex.org/works/W3166750876.grobid-xml"},"referenced_works_count":41,"referenced_works":["https://openalex.org/W1482503584","https://openalex.org/W1497730917","https://openalex.org/W1583742799","https://openalex.org/W1979832172","https://openalex.org/W1983422667","https://openalex.org/W1985010089","https://openalex.org/W1992176147","https://openalex.org/W1992320342","https://openalex.org/W2003273060","https://openalex.org/W2004884735","https://openalex.org/W2011297770","https://openalex.org/W2016584965","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/W2063372577","https://openalex.org/W2063460978","https://openalex.org/W2081751185","https://openalex.org/W2081777693","https://openalex.org/W2088397521","https://openalex.org/W2126876121","https://openalex.org/W2130647774","https://openalex.org/W2132026455","https://openalex.org/W2132339863","https://openalex.org/W2132445073","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/W2963551506","https://openalex.org/W3115628694","https://openalex.org/W4246087575","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,89,100,118,123,149],"set":[2],"of":[3,43,55,57,78,92,102,113,163,165],"pairwise":[4],"disjoint":[5],"polygonal":[6],"obstacles":[7],"in":[8,24,145,156,160],"the":[9,52,71,76,79,103,111,134,161,166],"plane,":[10],"finding":[11],"an":[12,41],"obstacle-avoiding":[13],"Euclidean":[14],"shortest":[15,119,135,150],"path":[16,120,136,152],"between":[17],"two":[18],"points":[19],"is":[20,51,81,106,110],"classical":[22],"problem":[23],"computational":[25],"geometry":[26],"and":[27,34,46,64,95,148],"has":[28],"been":[29],"studied":[30],"extensively.":[31],"Previously,":[32],"Hershberger":[33,63],"Suri":[35],"[SIAM":[36],"J.":[37],"Comput.":[38],"1999]":[39],"gave":[40],"algorithm":[42,80,91,116],"O(nlogn)":[44,47],"time":[45,94,147,158],"space,":[48,97],"where":[49,108],"n":[50],"total":[53],"number":[54,112,162],"vertices":[56],"all":[58],"obstacles.":[59,114],"Recently,":[60],"by":[61],"modifying":[62],"Suri\u2019s":[65],"algorithm,":[66],"Wang":[67],"[SODA":[68],"2021]":[69],"reduced":[70],"space":[72,105],"to":[73,140],"O(n)":[74,96],"while":[75],"runtime":[77],"still":[82],"O(nlogn).":[83],"In":[84],"this":[85],"paper,":[86],"we":[87],"present":[88],"new":[90],"O(n+hlogh)":[93],"provided":[98],"that":[99,128],"triangulation":[101],"free":[104],"given,":[107],"h":[109],"Our":[115],"builds":[117],"map":[121],"for":[122],"source":[124],"point":[125,132],"s,":[126],"so":[127],"given":[129],"any":[130],"query":[131],"t,":[133],"length":[137],"from":[138],"s":[139],"t":[141],"can":[142,153],"be":[143,154],"computed":[144],"O(logn)":[146],"s-t":[151],"produced":[155],"additional":[157],"linear":[159],"edges":[164],"path.":[167]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2026-08-06T08:24:18.245995","created_date":"2025-10-10T00:00:00"}