{"id":"https://openalex.org/W2022670034","doi":"https://doi.org/10.1145/2462356.2462377","title":"Computing shortest paths among curved obstacles in the plane","display_name":"Computing shortest paths among curved obstacles in the plane","publication_year":2013,"publication_date":"2013-06-17","ids":{"openalex":"https://openalex.org/W2022670034","doi":"https://doi.org/10.1145/2462356.2462377","mag":"2022670034"},"language":"en","primary_location":{"id":"doi:10.1145/2462356.2462377","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2462356.2462377","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/A5060901632","display_name":"Danny Z. Chen","orcid":"https://orcid.org/0000-0001-6565-2884"},"institutions":[{"id":"https://openalex.org/I107639228","display_name":"University of Notre Dame","ror":"https://ror.org/00mkhxb43","country_code":"US","type":"education","lineage":["https://openalex.org/I107639228"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Danny Z. Chen","raw_affiliation_strings":["University of Notre Dame, Notre Dame, IN, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Notre Dame, Notre Dame, IN, USA","institution_ids":["https://openalex.org/I107639228"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5006641842","display_name":"Haitao Wang","orcid":"https://orcid.org/0000-0003-3704-9214"},"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":false,"raw_author_name":"Haitao Wang","raw_affiliation_strings":["Utah State University, Logan, UT, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Utah State University, Logan, UT, USA","institution_ids":["https://openalex.org/I121980950"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.4933,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.95454545,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"369","last_page":"378"},"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/T12923","display_name":"Digital Image Processing Techniques","score":0.9824000000953674,"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/combinatorics","display_name":"Combinatorics","score":0.7252322435379028},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.598877489566803},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5678556561470032},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5674797296524048},{"id":"https://openalex.org/keywords/polygon","display_name":"Polygon (computer graphics)","score":0.5483430624008179},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5435892939567566},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.5089411735534668},{"id":"https://openalex.org/keywords/tangent-space","display_name":"Tangent space","score":0.49002039432525635},{"id":"https://openalex.org/keywords/tangent","display_name":"Tangent","score":0.46150022745132446},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4187321960926056},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.4115493893623352},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.30788475275039673},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1820552945137024}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7252322435379028},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.598877489566803},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5678556561470032},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5674797296524048},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.5483430624008179},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5435892939567566},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.5089411735534668},{"id":"https://openalex.org/C157157409","wikidata":"https://www.wikidata.org/wiki/Q909601","display_name":"Tangent space","level":2,"score":0.49002039432525635},{"id":"https://openalex.org/C138187205","wikidata":"https://www.wikidata.org/wiki/Q131251","display_name":"Tangent","level":2,"score":0.46150022745132446},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4187321960926056},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.4115493893623352},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.30788475275039673},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1820552945137024},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2462356.2462377","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2462356.2462377","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.769.5334","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.769.5334","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1103.3911.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.550000011920929}],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1482503584","https://openalex.org/W1583742799","https://openalex.org/W1845390921","https://openalex.org/W1980453746","https://openalex.org/W1980484820","https://openalex.org/W1985010089","https://openalex.org/W1986014106","https://openalex.org/W1994987092","https://openalex.org/W2003711654","https://openalex.org/W2006448653","https://openalex.org/W2011380591","https://openalex.org/W2014320134","https://openalex.org/W2016584965","https://openalex.org/W2022670034","https://openalex.org/W2029668981","https://openalex.org/W2039204626","https://openalex.org/W2040904149","https://openalex.org/W2051831392","https://openalex.org/W2058510050","https://openalex.org/W2063244634","https://openalex.org/W2077163943","https://openalex.org/W2130647774","https://openalex.org/W2132339863","https://openalex.org/W2147097381","https://openalex.org/W2167427782","https://openalex.org/W2171580054","https://openalex.org/W2911767655","https://openalex.org/W4213074663"],"related_works":["https://openalex.org/W2361271799","https://openalex.org/W2577818139","https://openalex.org/W47544861","https://openalex.org/W123898865","https://openalex.org/W2912635026","https://openalex.org/W4249328994","https://openalex.org/W2391887161","https://openalex.org/W2358302317","https://openalex.org/W4302552130","https://openalex.org/W2390580168"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,75],"study":[4],"the":[5,16,54,90,105,128,147,160],"problem":[6],"of":[7,33,49,64,72,118,130,146,162],"finding":[8],"Euclidean":[9],"shortest":[10,83],"paths":[11],"among":[12],"curved":[13,20,39,43],"obstacles":[14,21],"in":[15,53,92,150],"plane.":[17],"We":[18],"model":[19],"as":[22,29],"splinegons.":[23],"A":[24],"splinegon":[25],"can":[26,80],"be":[27,48],"viewed":[28],"replacing":[30],"each":[31,42],"edge":[32,44],"a":[34,37,62,70,82,101,115],"polygon":[35],"by":[36],"convex":[38],"edge,":[40],"and":[41,59,61,108,153],"is":[45,100,121,159],"assumed":[46],"to":[47,87,104],"O(1)":[50],"complexity.":[51],"Given":[52],"plane":[55],"two":[56,119],"points":[57],"s":[58,86],"t":[60,88],"set":[63],"h":[65,148],"pairwise":[66],"disjoint":[67],"splinegons":[68,91,107,112,120,149],"with":[69],"total":[71],"n":[73],"vertices,":[74],"present":[76],"an":[77,136],"algorithm":[78,139],"that":[79],"compute":[81],"path":[84],"from":[85],"avoiding":[89],"O(n+hlog\u03b5h+k)":[93],"time":[94,152],"for":[95,140],"any":[96,131],"\u03b5>0,":[97],"where":[98,157],"k":[99,158],"parameter":[102],"sensitive":[103,138],"input":[106],"k=O(h2).":[109],"If":[110],"all":[111,142,163],"are":[113],"convex,":[114],"common":[116,144,165],"tangent":[117],"\"free\"":[122],"if":[123],"it":[124],"does":[125],"not":[126],"intersect":[127],"interior":[129],"splingegon;":[132],"our":[133],"techniques":[134],"yield":[135],"output":[137],"computing":[141],"free":[143,164],"tangents":[145],"O(n+hlogh+k)":[151],"O(n)":[154],"working":[155],"space,":[156],"number":[161],"tangents.":[166]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":3}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}