{"id":"https://openalex.org/W4293052584","doi":"https://doi.org/10.1137/21m1428248","title":"A Near-Optimal Algorithm for Shortest Paths Among Curved Obstacles in the Plane","display_name":"A Near-Optimal Algorithm for Shortest Paths Among Curved Obstacles in the Plane","publication_year":2022,"publication_date":"2022-08-01","ids":{"openalex":"https://openalex.org/W4293052584","doi":"https://doi.org/10.1137/21m1428248"},"language":"en","primary_location":{"id":"doi:10.1137/21m1428248","is_oa":false,"landing_page_url":"https://doi.org/10.1137/21m1428248","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":"middle","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":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5100764686","display_name":"Hakan Y\u0131ld\u0131z","orcid":"https://orcid.org/0000-0002-9579-4338"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hakan Yildiz","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":0.3524,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.67204503,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"51","issue":"4","first_page":"1296","last_page":"1340"},"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9961000084877014,"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.9842000007629395,"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/shortest-path-problem","display_name":"Shortest path problem","score":0.6783446073532104},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6699527502059937},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.6512591242790222},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.6450561285018921},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6231486797332764},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.551659345626831},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.4818505048751831},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46600040793418884},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.44761520624160767},{"id":"https://openalex.org/keywords/tangent","display_name":"Tangent","score":0.4469102621078491},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.43347951769828796},{"id":"https://openalex.org/keywords/boundary","display_name":"Boundary (topology)","score":0.42066630721092224},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.4125634431838989},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34141650795936584},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.2749738097190857},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.17382004857063293},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.14132851362228394},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.10652488470077515},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.08475816249847412}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6783446073532104},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6699527502059937},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6512591242790222},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.6450561285018921},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6231486797332764},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.551659345626831},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.4818505048751831},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46600040793418884},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.44761520624160767},{"id":"https://openalex.org/C138187205","wikidata":"https://www.wikidata.org/wiki/Q131251","display_name":"Tangent","level":2,"score":0.4469102621078491},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.43347951769828796},{"id":"https://openalex.org/C62354387","wikidata":"https://www.wikidata.org/wiki/Q875399","display_name":"Boundary (topology)","level":2,"score":0.42066630721092224},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.4125634431838989},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34141650795936584},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.2749738097190857},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.17382004857063293},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.14132851362228394},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.10652488470077515},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.08475816249847412},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"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":2,"locations":[{"id":"doi:10.1137/21m1428248","is_oa":false,"landing_page_url":"https://doi.org/10.1137/21m1428248","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:https://open.metu.edu.tr:11511/100846","is_oa":false,"landing_page_url":"https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85137634523&origin=inward","pdf_url":null,"source":{"id":"https://openalex.org/S4306402495","display_name":"OpenMETU (Middle East Technical University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I201799495","host_organization_name":"Middle East Technical University","host_organization_lineage":["https://openalex.org/I201799495"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Journal Article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W1482503584","https://openalex.org/W1980453746","https://openalex.org/W1985010089","https://openalex.org/W1988887029","https://openalex.org/W1993264991","https://openalex.org/W2003711654","https://openalex.org/W2011297770","https://openalex.org/W2014320134","https://openalex.org/W2015425624","https://openalex.org/W2024693023","https://openalex.org/W2028747718","https://openalex.org/W2058510050","https://openalex.org/W2077163943","https://openalex.org/W2081777693","https://openalex.org/W2092475777","https://openalex.org/W2108567935","https://openalex.org/W2123976412","https://openalex.org/W2126876121","https://openalex.org/W2132026455","https://openalex.org/W2132339863","https://openalex.org/W2147097381","https://openalex.org/W2148847526","https://openalex.org/W2159549579","https://openalex.org/W2163178194","https://openalex.org/W2167427782","https://openalex.org/W2565603695","https://openalex.org/W2609210027","https://openalex.org/W2618706772","https://openalex.org/W2913690043","https://openalex.org/W3115628694","https://openalex.org/W4233514863","https://openalex.org/W4236246360","https://openalex.org/W4252017042"],"related_works":["https://openalex.org/W2375775343","https://openalex.org/W2368964068","https://openalex.org/W2562562750","https://openalex.org/W2360981904","https://openalex.org/W2348076806","https://openalex.org/W4293054712","https://openalex.org/W2377950158","https://openalex.org/W2198982833","https://openalex.org/W2597144308","https://openalex.org/W2383519316"],"abstract_inverted_index":{"We":[0],"propose":[1],"an":[2,97,117,159],"algorithm":[3,26,73,95,115],"for":[4],"the":[5,15,18,25,37,40,45,67,71,79,94,114,134,151,166,177,182,185],"problem":[6],"of":[7,39,51,70,137,165,184],"computing":[8],"shortest":[9,99,119,139,187],"paths":[10],"among":[11],"curved":[12],"obstacles":[13,19],"in":[14,28,57,62,105,150,153],"plane.":[16],"If":[17,78],"have":[20],"$O(n)$":[21],"description":[22],"complexity,":[23],"then":[24,66,93],"runs":[27],"$O(n\\log":[29,107,126],"n)$":[30,64,127,155],"time":[31,69,106],"plus":[32],"a":[33,48,122,138,142],"term":[34],"dependent":[35],"on":[36,171],"properties":[38],"boundary":[41],"arcs.":[42],"Specifically,":[43],"if":[44],"arcs":[46,80],"allow":[47],"certain":[49],"kind":[50],"bisector":[52],"intersection":[53],"to":[54,132,146,162,193],"be":[55,191],"computed":[56],"constant":[58],"time,":[59,65],"or":[60],"even":[61],"$O(\\log":[63,154],"running":[68],"overall":[72],"is":[74,90],"$O(n":[75],"\\log":[76],"n)$.":[77],"support":[81],"only":[82],"constant-time":[83],"tangent,":[84],"intersection,":[85],"and":[86,181],"length":[87,136],"queries,":[88],"as":[89],"customarily":[91],"assumed,":[92],"computes":[96,116],"approximate":[98,118,186],"path,":[100],"with":[101,125],"relative":[102],"error":[103],"$\\varepsilon$,":[104],"n":[108],"+":[109],"n\\log":[110],"\\frac{1}{\\varepsilon})$.":[111],"In":[112],"fact,":[113],"path":[120,140,188],"map,":[121],"data":[123],"structure":[124],"size,":[128],"that":[129],"allows":[130],"it":[131],"report":[133],"(approximate)":[135],"from":[141],"fixed":[143],"source":[144],"point":[145,149],"any":[147],"query":[148],"plane":[152],"time.":[156],"By":[157],"applying":[158],"idea":[160],"due":[161],"Wang":[163],"[Proceedings":[164],"$32$nd":[167],"Annual":[168],"ACM-SIAM":[169],"Symposium":[170],"Discrete":[172],"Algorithms,":[173],"2021,":[174],"pp.":[175],"810--821],":[176],"algorithm's":[178],"working":[179],"storage":[180],"size":[183],"map":[189],"can":[190],"reduced":[192],"$O(n)$.":[194]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}