{"id":"https://openalex.org/W2051045196","doi":"https://doi.org/10.1137/s0097539792229672","title":"Rectilinear Path Problems among Rectilinear Obstacles Revisited","display_name":"Rectilinear Path Problems among Rectilinear Obstacles Revisited","publication_year":1995,"publication_date":"1995-06-01","ids":{"openalex":"https://openalex.org/W2051045196","doi":"https://doi.org/10.1137/s0097539792229672","mag":"2051045196"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539792229672","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539792229672","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/A5110058794","display_name":"C. D. Yang","orcid":"https://orcid.org/0000-0003-3980-7699"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Chung-Do Yang","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022457347","display_name":"D. T. Lee","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"D. T. Lee","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5101858991","display_name":"C. K. Wong","orcid":"https://orcid.org/0000-0002-8678-4664"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"C. K. Wong","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5110058794"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.2495,"has_fulltext":false,"cited_by_count":37,"citation_normalized_percentile":{"value":0.86018809,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"24","issue":"3","first_page":"457","last_page":"472"},"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.996999979019165,"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.996999979019165,"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.9969000220298767,"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9829999804496765,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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.7620732188224792},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6919300556182861},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6766090393066406},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.6184181571006775},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.598007082939148},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.554741621017456},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.553680419921875},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.5055909156799316},{"id":"https://openalex.org/keywords/path-length","display_name":"Path length","score":0.4955531358718872},{"id":"https://openalex.org/keywords/widest-path-problem","display_name":"Widest path problem","score":0.4478890001773834},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4385778307914734},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.4198363423347473},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4142366647720337},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.37450850009918213},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36630433797836304},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3636864125728607},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.24514341354370117},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.18398374319076538}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7620732188224792},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6919300556182861},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6766090393066406},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6184181571006775},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.598007082939148},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.554741621017456},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.553680419921875},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5055909156799316},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.4955531358718872},{"id":"https://openalex.org/C83677490","wikidata":"https://www.wikidata.org/wiki/Q7998708","display_name":"Widest path problem","level":5,"score":0.4478890001773834},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4385778307914734},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.4198363423347473},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4142366647720337},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.37450850009918213},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36630433797836304},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3636864125728607},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.24514341354370117},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.18398374319076538},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","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/s0097539792229672","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539792229672","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.56.4663","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.56.4663","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://web.eecs.nwu.edu/~dtlee/SIAM_rectilinear_path.ps.Z","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1655990431","https://openalex.org/W1992320342","https://openalex.org/W1993553699","https://openalex.org/W2006625555","https://openalex.org/W2032159439","https://openalex.org/W2049808842","https://openalex.org/W2062367161","https://openalex.org/W2063372577","https://openalex.org/W2084224084","https://openalex.org/W2107735380","https://openalex.org/W2147998016","https://openalex.org/W2163030926"],"related_works":["https://openalex.org/W2375775343","https://openalex.org/W2156431668","https://openalex.org/W2237480599","https://openalex.org/W2018146256","https://openalex.org/W2360981904","https://openalex.org/W4210697296","https://openalex.org/W4200172719","https://openalex.org/W2198982833","https://openalex.org/W2365712669","https://openalex.org/W2305559042"],"abstract_inverted_index":{"Efficient":[0],"algorithms":[1,156],"are":[2],"presented":[3],"for":[4,28,116],"finding":[5,29,50,133],"rectilinear":[6,17,32,37,42,47,53,128,141,146],"collision-free":[7],"paths":[8],"between":[9],"two":[10],"given":[11,83,124],"points":[12],"among":[13,127],"a":[14,55,150],"set":[15],"of":[16,25,79,82,90,123],"obstacles.":[18],"The":[19],"results":[20,27],"improve":[21],"the":[22,30,34,39,45,51,77,88,118,134,138,144],"time":[23,114,163,175],"complexity":[24],"previous":[26],"shortest":[31,36,40,52,136,139],"path":[33,43],"minimum-bend":[35,41,135,140],"path,":[38,54,137,142,147],"and":[44,60,85,143,154,176],"minimum-cost":[46,145],"path.":[48],"For":[49,132],"graph-theoretic":[56],"approach":[57,153],"is":[58,63,76,87,130],"used":[59],"an":[61,97],"algorithm":[62,115],"obtained":[64],"with":[65],"$O(m":[66,160,165,172],"\\log":[67,99,105,166],"t":[68,70,75,106],"+":[69,101,103,107,111],"\\log^{3/2}t)$":[71],"running":[72,113],"time,":[73],"where":[74],"number":[78,89],"extreme":[80],"edges":[81],"obstacles":[84,129],"m":[86],"obstacle":[91],"edges.":[92],"Based":[93],"on":[94],"this":[95],"result":[96],"$O(N":[98],"N":[100,125],"(m":[102],"N)":[104],"(t+N)":[108],"\\log^{2}":[109,161],"(t":[110],"N))$":[112],"computing":[117],"$L_{1}$":[119],"minimum":[120],"spanning":[121],"tree":[122],"terminals":[126],"obtained.":[131],"we":[148],"devise":[149],"new":[151],"dynamic-searching":[152],"derive":[155],"that":[157],"run":[158,170],"in":[159,171],"m)$":[162,167,174],"using":[164],"space":[168],"or":[169],"\\log^{3/2}":[173],"space.":[177]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}