{"id":"https://openalex.org/W2130647774","doi":"https://doi.org/10.1145/2462356.2462374","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":2013,"publication_date":"2013-06-17","ids":{"openalex":"https://openalex.org/W2130647774","doi":"https://doi.org/10.1145/2462356.2462374","mag":"2130647774"},"language":"en","primary_location":{"id":"doi:10.1145/2462356.2462374","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2462356.2462374","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-ninth annual symposium on Computational geometry","raw_type":"proceedings-article"},"type":"conference-paper","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":[{"id":"https://openalex.org/I4210156212","display_name":"Mentor Technologies","ror":"https://ror.org/05vewsj04","country_code":"US","type":"other","lineage":["https://openalex.org/I4210156212"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"John Hershberger","raw_affiliation_strings":["Mentor Graphics Corporation, Wilsonville, OR, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Mentor Graphics Corporation, Wilsonville, OR, USA","institution_ids":["https://openalex.org/I4210156212"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5072397842","display_name":"Subhash Suri","orcid":"https://orcid.org/0000-0002-5668-7521"},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Subhash Suri","raw_affiliation_strings":["University of California, Santa Barbara, Santa Barbara, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, Santa Barbara, Santa Barbara, CA, USA","institution_ids":["https://openalex.org/I154570441"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100764686","display_name":"Hakan Y\u0131ld\u0131z","orcid":"https://orcid.org/0000-0002-9579-4338"},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hakan Y\u0131ld\u0131z","raw_affiliation_strings":["University of California, Santa Barbara, Santa Barbara, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, Santa Barbara, Santa Barbara, CA, USA","institution_ids":["https://openalex.org/I154570441"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.392,"has_fulltext":false,"cited_by_count":28,"citation_normalized_percentile":{"value":0.96786834,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"359","last_page":"368"},"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.9972000122070312,"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/intersection","display_name":"Intersection (aeronautics)","score":0.7346521019935608},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6963268518447876},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.6487599611282349},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6255781650543213},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5848246812820435},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5633835792541504},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.5521067380905151},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.5258128046989441},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4761764407157898},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4761545658111572},{"id":"https://openalex.org/keywords/tangent","display_name":"Tangent","score":0.4657251536846161},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.45005157589912415},{"id":"https://openalex.org/keywords/boundary","display_name":"Boundary (topology)","score":0.4292004108428955},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.41629576683044434},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3401101231575012},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.21917149424552917},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.2124500870704651},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.14804214239120483},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.1255914270877838},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.07927882671356201}],"concepts":[{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.7346521019935608},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6963268518447876},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6487599611282349},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6255781650543213},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5848246812820435},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5633835792541504},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.5521067380905151},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.5258128046989441},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4761764407157898},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4761545658111572},{"id":"https://openalex.org/C138187205","wikidata":"https://www.wikidata.org/wiki/Q131251","display_name":"Tangent","level":2,"score":0.4657251536846161},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.45005157589912415},{"id":"https://openalex.org/C62354387","wikidata":"https://www.wikidata.org/wiki/Q875399","display_name":"Boundary (topology)","level":2,"score":0.4292004108428955},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.41629576683044434},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3401101231575012},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.21917149424552917},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.2124500870704651},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.14804214239120483},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.1255914270877838},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.07927882671356201},{"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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","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":3,"locations":[{"id":"doi:10.1145/2462356.2462374","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2462356.2462374","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-ninth annual symposium on Computational geometry","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.309.273","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.309.273","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.ucsb.edu/~suri/psdir/spaco.pdf","raw_type":"text"},{"id":"pmh:oai:https://open.metu.edu.tr:11511/94000","is_oa":false,"landing_page_url":"https://hdl.handle.net/11511/94000","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":"29th Annual Symposium on Computational Geometry, SoCG 2013","raw_type":"Conference Paper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W1482503584","https://openalex.org/W1498827059","https://openalex.org/W1557739567","https://openalex.org/W1560760891","https://openalex.org/W1980453746","https://openalex.org/W1980484820","https://openalex.org/W1985010089","https://openalex.org/W1993264991","https://openalex.org/W2003711654","https://openalex.org/W2011297770","https://openalex.org/W2014320134","https://openalex.org/W2015425624","https://openalex.org/W2022670034","https://openalex.org/W2024693023","https://openalex.org/W2049534753","https://openalex.org/W2058510050","https://openalex.org/W2063071084","https://openalex.org/W2077163943","https://openalex.org/W2081777693","https://openalex.org/W2092475777","https://openalex.org/W2108567935","https://openalex.org/W2123976412","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/W2609210027","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/W2377950158","https://openalex.org/W2198982833","https://openalex.org/W4293054712","https://openalex.org/W2597144308","https://openalex.org/W2383519316"],"abstract_inverted_index":{"We":[0],"propose":[1],"an":[2,98,120],"algorithm":[3,26,74,96,118],"for":[4],"the":[5,15,18,25,38,41,46,68,72,80,95,117,138,155],"problem":[6],"of":[7,40,52,71,141],"computing":[8],"shortest":[9,100,122,143],"paths":[10],"among":[11],"curved":[12],"obstacles":[13,19],"in":[14,28,58,63,106,154,157],"plane.":[16],"If":[17,79],"have":[20],"O(n)":[21],"description":[22],"complexity,":[23],"then":[24,67,94],"runs":[27],"O(n":[29,76,108,129],"log":[30,77,109,113,130],"n)":[31,65,131,159],"time":[32,70,107],"plus":[33],"a":[34,49,125,142,146],"term":[35],"dependent":[36],"on":[37],"properties":[39],"boundary":[42],"arcs.":[43],"Specifically,":[44],"if":[45],"arcs":[47,81],"allow":[48],"certain":[50],"kind":[51],"bisector":[53],"intersection":[54],"to":[55,136,150],"be":[56],"computed":[57],"constant":[59],"time,":[60,66],"or":[61],"even":[62],"O(log":[64,158],"running":[69],"overall":[73],"is":[75,91],"n).":[78],"support":[82],"only":[83],"constant-time":[84],"tangent,":[85],"intersection,":[86],"and":[87],"length":[88,140],"queries,":[89],"as":[90],"customarily":[92],"assumed,":[93],"computes":[97,119],"approximate":[99,121],"path,":[101],"with":[102,128],"relative":[103],"error":[104],"\u03b5,":[105],"n":[110,112],"+":[111],"1/\u03b5).":[114],"In":[115],"fact,":[116],"path":[123,144],"map,":[124],"data":[126],"structure":[127],"size,":[132],"that":[133],"allows":[134],"it":[135],"report":[137],"(approximate)":[139],"from":[145],"fixed":[147],"source":[148],"point":[149,153],"any":[151],"query":[152],"plane":[156],"time.":[160]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":4},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}