{"id":"https://openalex.org/W3136732126","doi":"https://doi.org/10.1137/06067777x","title":"Approximate Shortest Paths in Anisotropic Regions","display_name":"Approximate Shortest Paths in Anisotropic Regions","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W3136732126","doi":"https://doi.org/10.1137/06067777x","mag":"3136732126"},"language":"en","primary_location":{"id":"doi:10.1137/06067777x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/06067777x","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/A5070497738","display_name":"Siu-Wing Cheng","orcid":"https://orcid.org/0000-0002-3557-9935"},"institutions":[{"id":"https://openalex.org/I200769079","display_name":"Hong Kong University of Science and Technology","ror":"https://ror.org/00q4vv597","country_code":"HK","type":"education","lineage":["https://openalex.org/I200769079"]}],"countries":["HK"],"is_corresponding":true,"raw_author_name":"Siu-Wing Cheng","raw_affiliation_strings":["Hong Kong University of Science and Technology"],"affiliations":[{"raw_affiliation_string":"Hong Kong University of Science and Technology","institution_ids":["https://openalex.org/I200769079"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5059099525","display_name":"Hyeon-Suk Na","orcid":null},"institutions":[{"id":"https://openalex.org/I141371507","display_name":"Soongsil University","ror":"https://ror.org/017xnm587","country_code":"KR","type":"education","lineage":["https://openalex.org/I141371507"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Hyeon-Suk Na","raw_affiliation_strings":["Soongsil University"],"affiliations":[{"raw_affiliation_string":"Soongsil University","institution_ids":["https://openalex.org/I141371507"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5019937157","display_name":"Antoine Vigneron","orcid":"https://orcid.org/0000-0003-3586-3431"},"institutions":[{"id":"https://openalex.org/I4210129272","display_name":"G\u00e9n\u00e9tique Animale et Biologie Int\u00e9grative","ror":"https://ror.org/03rkgeb39","country_code":"FR","type":"facility","lineage":["https://openalex.org/I22248866","https://openalex.org/I277688954","https://openalex.org/I277688954","https://openalex.org/I4210088668","https://openalex.org/I4210129272"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Antoine Vigneron","raw_affiliation_strings":["Unit\u00e9 de biom\u00e9trie et intelligence artificielle de Jouy"],"affiliations":[{"raw_affiliation_string":"Unit\u00e9 de biom\u00e9trie et intelligence artificielle de Jouy","institution_ids":["https://openalex.org/I4210129272"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100454881","display_name":"Yajun Wang","orcid":"https://orcid.org/0000-0002-0165-0561"},"institutions":[{"id":"https://openalex.org/I200769079","display_name":"Hong Kong University of Science and Technology","ror":"https://ror.org/00q4vv597","country_code":"HK","type":"education","lineage":["https://openalex.org/I200769079"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Yajun Wang","raw_affiliation_strings":["Hong Kong University of Science and Technology"],"affiliations":[{"raw_affiliation_string":"Hong Kong University of Science and Technology","institution_ids":["https://openalex.org/I200769079"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5070497738"],"corresponding_institution_ids":["https://openalex.org/I200769079"],"apc_list":null,"apc_paid":null,"fwci":8.9163,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.9704142,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"38","issue":"3","first_page":"802","last_page":"824"},"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.9997000098228455,"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.9997000098228455,"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.9864000082015991,"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/T11830","display_name":"Point processes and geometric inequalities","score":0.982200026512146,"subfield":{"id":"https://openalex.org/subfields/2604","display_name":"Applied Mathematics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.784643292427063},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5990511178970337},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5371898412704468},{"id":"https://openalex.org/keywords/unit-disk","display_name":"Unit disk","score":0.537116289138794},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4707271158695221},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.45321741700172424},{"id":"https://openalex.org/keywords/subdivision","display_name":"Subdivision","score":0.43831273913383484},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4348854720592499},{"id":"https://openalex.org/keywords/radius","display_name":"RADIUS","score":0.4342436194419861},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4233986735343933},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.31568077206611633},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.22995445132255554},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.086009681224823}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.784643292427063},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5990511178970337},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5371898412704468},{"id":"https://openalex.org/C47177299","wikidata":"https://www.wikidata.org/wiki/Q2390323","display_name":"Unit disk","level":2,"score":0.537116289138794},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4707271158695221},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.45321741700172424},{"id":"https://openalex.org/C143392562","wikidata":"https://www.wikidata.org/wiki/Q449111","display_name":"Subdivision","level":2,"score":0.43831273913383484},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4348854720592499},{"id":"https://openalex.org/C178635117","wikidata":"https://www.wikidata.org/wiki/Q747499","display_name":"RADIUS","level":2,"score":0.4342436194419861},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4233986735343933},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.31568077206611633},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.22995445132255554},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.086009681224823},{"id":"https://openalex.org/C95457728","wikidata":"https://www.wikidata.org/wiki/Q309","display_name":"History","level":0,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","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},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1137/06067777x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/06067777x","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:HAL:hal-02666491v1","is_oa":false,"landing_page_url":"https://hal.inrae.fr/hal-02666491","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Computing, 2008, 38 (3), pp.802-824. ⟨10.1137/06067777X⟩","raw_type":"Journal articles"},{"id":"pmh:oai:repository.hkust.edu.hk:1783.1-3273","is_oa":false,"landing_page_url":"http://repository.hkust.edu.hk/ir/Record/1783.1-3273","pdf_url":null,"source":{"id":"https://openalex.org/S4306401796","display_name":"Rare & Special e-Zone (The Hong Kong University of Science and Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I200769079","host_organization_name":"Hong Kong University of Science and Technology","host_organization_lineage":["https://openalex.org/I200769079"],"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":"Article"},{"id":"pmh:oai:repository.ust.hk:1783.1-3273","is_oa":false,"landing_page_url":"http://lbsearch.ust.hk:3210/sfx?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rfr_id=info:sid/HKUST:SPI&rft.genre=article&rft.issn=0097-5397&rft.volume=38&rft.issue=3&rft.date=2008&rft.spage=802&rft.epage=824&rft.aulast=Cheng&rft.aufirst=Siu-Wing&rft.atitle=Approximate+shortest+paths+in+anisotropic+regions","pdf_url":null,"source":{"id":"https://openalex.org/S4306401796","display_name":"Rare & Special e-Zone (The Hong Kong University of Science and Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I200769079","host_organization_name":"Hong Kong University of Science and Technology","host_organization_lineage":["https://openalex.org/I200769079"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Article"},{"id":"pmh:oai:scholarworks.unist.ac.kr:201301/19656","is_oa":false,"landing_page_url":"https://scholarworks.unist.ac.kr/handle/201301/19656","pdf_url":null,"source":{"id":"https://openalex.org/S4306401118","display_name":"Scholarworks@UNIST (Ulsan National Institute of Science and Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I48566637","host_organization_name":"Ulsan National Institute of Science and Technology","host_organization_lineage":["https://openalex.org/I48566637"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"ARTICLE"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5299999713897705,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1989723858","https://openalex.org/W2009017109","https://openalex.org/W2028769163","https://openalex.org/W2084224084","https://openalex.org/W2109032771","https://openalex.org/W2112346596","https://openalex.org/W2161253909"],"related_works":["https://openalex.org/W2384806462","https://openalex.org/W4389950792","https://openalex.org/W2375549870","https://openalex.org/W4376632515","https://openalex.org/W2140072033","https://openalex.org/W2163269603","https://openalex.org/W3090065768","https://openalex.org/W2038484028","https://openalex.org/W2017281900","https://openalex.org/W4288122849"],"abstract_inverted_index":{"Our":[0,115],"goal":[1],"is":[2,45,108],"to":[3,104,149,188],"find":[4],"an":[5,96],"approximate":[6],"shortest":[7],"path":[8,101],"for":[9,69,87],"a":[10,15,25,38,48,55,100],"point":[11],"robot":[12],"moving":[13],"in":[14,29,47,118,133,143,165,178],"planar":[16],"subdivision":[17,34],"with":[18,59,176],"n":[19],"vertices.":[20],"Let":[21],"$\\rho\\geq":[22],"1$":[23],"be":[24,67,81],"real":[26],"number.":[27],"Distances":[28],"each":[30],"face":[31],"of":[32,168,184],"this":[33],"are":[35,74],"measured":[36],"by":[37],"convex":[39,63,77],"distance":[40,64,78],"function":[41],"whose":[42,106],"unit":[43,50],"disk":[44,52,58],"contained":[46],"concentric":[49,56],"Euclidean":[51,57],"and":[53,72,86,92,162],"contains":[54],"radius":[60],"$1/\\rho$.":[61],"Different":[62],"functions":[65,79],"may":[66,80],"used":[68],"different":[70],"faces,":[71],"obstacles":[73],"allowed.":[75],"These":[76],"asymmetric.":[82],"For":[83,171],"any":[84,88,130],"$\\varepsilon\\in(0,1)$":[85],"two":[89,150],"points":[90],"$v_s$":[91,103],"$v_d$,":[93],"we":[94],"give":[95,147],"algorithm":[97,116,186],"that":[98,153],"finds":[99],"from":[102],"$v_d$":[105],"cost":[107],"at":[109],"most":[110],"$(1+\\varepsilon)$":[111],"times":[112],"the":[113,140,144,158,166,172,181],"optimal.":[114],"runs":[117],"$O(\\frac{\\rho^2\\log":[119],"\\rho}{\\varepsilon^2}n^3":[120],"\\log(\\frac{\\rho":[121,191],"n}\\varepsilon))$":[122],"time.":[123],"This":[124],"bound":[125,183],"does":[126,136],"not":[127,137],"depend":[128,138],"on":[129,139],"other":[131],"parameters;":[132],"particular":[134],"it":[135],"minimum":[141],"angle":[142],"subdivision.":[145],"We":[146],"applications":[148],"special":[151],"cases":[152],"have":[154],"been":[155],"considered":[156],"before:":[157],"weighted":[159,173],"region":[160,174],"problem":[161,175],"motion":[163],"planning":[164],"presence":[167],"uniform":[169],"flows.":[170],"weights":[177],"$[1,\\rho]\\cup":[179],"\\{\\infty\\}$,":[180],"time":[182],"our":[185],"improves":[187],"$O(\\frac{\\rho\\log":[189],"\\rho}{\\varepsilon}n^3":[190],"n}\\varepsilon))$.":[192]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":6}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}