{"id":"https://openalex.org/W2058510050","doi":"https://doi.org/10.1137/s0097539795289604","title":"An Optimal Algorithm for Euclidean Shortest Paths in the Plane","display_name":"An Optimal Algorithm for Euclidean Shortest Paths in the Plane","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W2058510050","doi":"https://doi.org/10.1137/s0097539795289604","mag":"2058510050"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539795289604","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539795289604","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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 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/A5038416046","display_name":"John Hershberger","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"John Hershberger","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5072397842","display_name":"Subhash Suri","orcid":"https://orcid.org/0000-0002-5668-7521"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Subhash Suri","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.3962,"has_fulltext":false,"cited_by_count":326,"citation_normalized_percentile":{"value":0.93959415,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":97,"max":100},"biblio":{"volume":"28","issue":"6","first_page":"2215","last_page":"2256"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9998999834060669,"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":0.9998999834060669,"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.9987999796867371,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9914000034332275,"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.8211255073547363},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7514269351959229},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.737628161907196},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.7098556160926819},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.5896824598312378},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5637103319168091},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5466587543487549},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4811786115169525},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4653502404689789},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.4344247579574585},{"id":"https://openalex.org/keywords/distance","display_name":"Distance","score":0.43142464756965637},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.42296892404556274},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.33497726917266846},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.29101234674453735},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.14940807223320007},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.08405250310897827}],"concepts":[{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.8211255073547363},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7514269351959229},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.737628161907196},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.7098556160926819},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.5896824598312378},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5637103319168091},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5466587543487549},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4811786115169525},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4653502404689789},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.4344247579574585},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.43142464756965637},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.42296892404556274},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.33497726917266846},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.29101234674453735},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.14940807223320007},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.08405250310897827},{"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.1137/s0097539795289604","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539795289604","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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 Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.47.2037","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.47.2037","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://siesta.cs.wustl.edu/~suri/psdir/2dsp.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1482503584","https://openalex.org/W1980707954","https://openalex.org/W1985010089","https://openalex.org/W1986014106","https://openalex.org/W2000744043","https://openalex.org/W2003711654","https://openalex.org/W2009530930","https://openalex.org/W2016584965","https://openalex.org/W2032159439","https://openalex.org/W2036114412","https://openalex.org/W2039204626","https://openalex.org/W2043598638","https://openalex.org/W2081751185","https://openalex.org/W2084224084","https://openalex.org/W2108567935","https://openalex.org/W2120018535","https://openalex.org/W2126876121","https://openalex.org/W2132026455","https://openalex.org/W2132339863","https://openalex.org/W2139391136","https://openalex.org/W2167427782","https://openalex.org/W2169528473","https://openalex.org/W2752885492","https://openalex.org/W2888871578"],"related_works":["https://openalex.org/W2360981904","https://openalex.org/W651485002","https://openalex.org/W2347245430","https://openalex.org/W4293054712","https://openalex.org/W2163460271","https://openalex.org/W2100214387","https://openalex.org/W2198982833","https://openalex.org/W2175109984","https://openalex.org/W2052950624","https://openalex.org/W2170980056"],"abstract_inverted_index":{"We":[0],"propose":[1],"an":[2,58],"optimal-time":[3],"algorithm":[4,27,54,109],"for":[5],"a":[6,14,71,78,111],"classical":[7],"problem":[8],"in":[9,20,29,49,100],"plane":[10],"computational":[11],"geometry:":[12],"computing":[13],"shortest":[15,75,97,121,132],"path":[16,98,122,133],"between":[17],"two":[18],"points":[19,85],"the":[21,44,50,87,89,120],"presence":[22],"of":[23,47,61,86,107],"polygonal":[24,65],"obstacles.":[25],"Our":[26],"runs":[28],"worst-case":[30],"time":[31,105],"O(n":[32,37],"log":[33,38],"n)":[34,39,102],"and":[35,67,137],"requires":[36],"space,":[40],"where":[41],"n":[42],"is":[43,55,110],"total":[45],"number":[46],"vertices":[48],"obstacle":[51],"polygons.":[52],"The":[53,104],"based":[56],"on":[57,119],"efficient":[59],"implementation":[60],"wavefront":[62],"propagation":[63],"among":[64],"obstacles,":[66],"it":[68],"actually":[69],"computes":[70],"planar":[72],"map":[73,90],"encoding":[74],"paths":[76],"from":[77],"fixed":[79],"source":[80],"point":[81],"to":[82,94,129],"all":[83,115],"other":[84],"plane;":[88],"can":[91],"be":[92],"used":[93],"answer":[95],"single-source":[96],"queries":[99],"O(log":[101],"time.":[103],"complexity":[106],"our":[108],"significant":[112],"improvement":[113],"over":[114],"previously":[116],"published":[117],"results":[118],"problem.":[123],"Finally,":[124],"we":[125],"also":[126],"discuss":[127],"extensions":[128],"more":[130],"general":[131],"problems,":[134],"involving":[135],"nonpoint":[136],"multiple":[138],"sources.":[139]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":7},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":7},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":10},{"year":2020,"cited_by_count":14},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":12},{"year":2017,"cited_by_count":17},{"year":2016,"cited_by_count":13},{"year":2015,"cited_by_count":23},{"year":2014,"cited_by_count":21},{"year":2013,"cited_by_count":19},{"year":2012,"cited_by_count":14}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}