{"id":"https://openalex.org/W2160517890","doi":"https://doi.org/10.1109/tc.1987.1676904","title":"Rectilinear Shortest Paths and Minimum Spanning Trees in the Presence of Rectilinear Obstacles","display_name":"Rectilinear Shortest Paths and Minimum Spanning Trees in the Presence of Rectilinear Obstacles","publication_year":1987,"publication_date":"1987-03-01","ids":{"openalex":"https://openalex.org/W2160517890","doi":"https://doi.org/10.1109/tc.1987.1676904","mag":"2160517890"},"language":"en","primary_location":{"id":"doi:10.1109/tc.1987.1676904","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tc.1987.1676904","pdf_url":null,"source":{"id":"https://openalex.org/S157670870","display_name":"IEEE Transactions on Computers","issn_l":"0018-9340","issn":["0018-9340","1557-9956","2326-3814"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computers","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/A5050445967","display_name":"Y. F. Wu","orcid":null},"institutions":[{"id":"https://openalex.org/I111979921","display_name":"Northwestern University","ror":"https://ror.org/000e0be47","country_code":"US","type":"education","lineage":["https://openalex.org/I111979921"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ying-Fung Wu","raw_affiliation_strings":["Microelectronics and Computer Technology Corporation","Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA","Microelectronics and Computer Technology Corporation, Austin, TX, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microelectronics and Computer Technology Corporation","institution_ids":[]},{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA","institution_ids":["https://openalex.org/I111979921"]},{"raw_affiliation_string":"Microelectronics and Computer Technology Corporation, Austin, TX, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110265565","display_name":"Widmayer","orcid":null},"institutions":[{"id":"https://openalex.org/I4210114115","display_name":"IBM Research - Thomas J. Watson Research Center","ror":"https://ror.org/0265w5591","country_code":"US","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210114115"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Widmayer","raw_affiliation_strings":["IBM Thomas J. Watson Research Center, Yorktown Heights, NY, USA","Institut f\u00fcr Angewandte Informatik und Formale Beschreibungsverfahren, University of Karlsruhe, Karlsruhe, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBM Thomas J. Watson Research Center, Yorktown Heights, NY, USA","institution_ids":["https://openalex.org/I4210114115"]},{"raw_affiliation_string":"Institut f\u00fcr Angewandte Informatik und Formale Beschreibungsverfahren, University of Karlsruhe, Karlsruhe, Germany","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055902425","display_name":"Schlag","orcid":null},"institutions":[{"id":"https://openalex.org/I161318765","display_name":"University of California, Los Angeles","ror":"https://ror.org/046rm7j60","country_code":"US","type":"education","lineage":["https://openalex.org/I161318765"]},{"id":"https://openalex.org/I4210114115","display_name":"IBM Research - Thomas J. Watson Research Center","ror":"https://ror.org/0265w5591","country_code":"US","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210114115"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Schlag","raw_affiliation_strings":["IBM Thomas J. Watson Research Center, Yorktown Heights, NY, USA","The Department of Computer Science, University of California, Los Angeles, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBM Thomas J. Watson Research Center, Yorktown Heights, NY, USA","institution_ids":["https://openalex.org/I4210114115"]},{"raw_affiliation_string":"The Department of Computer Science, University of California, Los Angeles, CA, USA","institution_ids":["https://openalex.org/I161318765"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110755992","display_name":"E. Wong","orcid":null},"institutions":[{"id":"https://openalex.org/I4210114115","display_name":"IBM Research - Thomas J. Watson Research Center","ror":"https://ror.org/0265w5591","country_code":"US","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210114115"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Wong","raw_affiliation_strings":["IBM Thomas J. Watson Research Center, Yorktown Heights, NY, USA","Institut f\u00fcr Angewandte Informatik und Formale Beschreibungsverfahren, University of Karlsruhe, Karlsruhe, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBM Thomas J. Watson Research Center, Yorktown Heights, NY, USA","institution_ids":["https://openalex.org/I4210114115"]},{"raw_affiliation_string":"Institut f\u00fcr Angewandte Informatik und Formale Beschreibungsverfahren, University of Karlsruhe, Karlsruhe, Germany","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.9595,"has_fulltext":false,"cited_by_count":113,"citation_normalized_percentile":{"value":0.95165094,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"C-36","issue":"3","first_page":"321","last_page":"331"},"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.9993000030517578,"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.9993000030517578,"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.9872000217437744,"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.9825999736785889,"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/combinatorics","display_name":"Combinatorics","score":0.7391536831855774},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6850067377090454},{"id":"https://openalex.org/keywords/spanning-tree","display_name":"Spanning tree","score":0.6393610239028931},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.6093509793281555},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5968106985092163},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.5091812014579773},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4529487192630768},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.4273962378501892},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.39462125301361084},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3628627061843872}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7391536831855774},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6850067377090454},{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.6393610239028931},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.6093509793281555},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5968106985092163},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.5091812014579773},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4529487192630768},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.4273962378501892},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.39462125301361084},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3628627061843872}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tc.1987.1676904","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tc.1987.1676904","pdf_url":null,"source":{"id":"https://openalex.org/S157670870","display_name":"IEEE Transactions on Computers","issn_l":"0018-9340","issn":["0018-9340","1557-9956","2326-3814"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computers","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/15","score":0.5099999904632568,"display_name":"Life in Land"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W628736642","https://openalex.org/W1655990431","https://openalex.org/W1874694348","https://openalex.org/W1965680834","https://openalex.org/W1992320342","https://openalex.org/W1993553699","https://openalex.org/W2006385089","https://openalex.org/W2014320134","https://openalex.org/W2017927472","https://openalex.org/W2020112047","https://openalex.org/W2032159439","https://openalex.org/W2035622528","https://openalex.org/W2048422125","https://openalex.org/W2062367161","https://openalex.org/W2069712919","https://openalex.org/W2070165907","https://openalex.org/W2084529282","https://openalex.org/W2086709935","https://openalex.org/W2091757707","https://openalex.org/W2109868275","https://openalex.org/W2125865439","https://openalex.org/W2126876121","https://openalex.org/W2132026455","https://openalex.org/W2160517890","https://openalex.org/W2163178194","https://openalex.org/W2169528473","https://openalex.org/W4255306344"],"related_works":["https://openalex.org/W2149927264","https://openalex.org/W4308416203","https://openalex.org/W2099915933","https://openalex.org/W4224251989","https://openalex.org/W4220861011","https://openalex.org/W2071845176","https://openalex.org/W2387385213","https://openalex.org/W2418231958","https://openalex.org/W2307044859","https://openalex.org/W1991421283"],"abstract_inverted_index":{"We":[0,26,68],"study":[1],"the":[2,18,21,28,52,55,76,87,99,127,137,148,159,165,199,203],"rectilinear":[3,24,48],"shortest":[4,59,81,95,101,188],"paths":[5,60,82,96,102,189],"and":[6,54,61,145],"minimum":[7,63],"spanning":[8,64],"tree":[9,65],"(MST)":[10],"problems":[11],"for":[12,40,57,104,158,164,187],"a":[13,31,62,70,182],"set":[14,88],"of":[15,23,47,130,132,139,142,150,185,198,205],"points":[16,56,92,106,166],"in":[17,20,86,170,208],"plane":[19],"presence":[22],"obstacles.":[25],"use":[27,69],"track":[29,44,77],"graph,":[30],"suitably":[32],"defined":[33,50],"grid-like":[34],"structure,":[35],"to":[36,79,89],"obtain":[37],"efficient":[38],"solutions":[39],"both":[41],"problems.":[42],"The":[43,162],"graph":[45,78],"consists":[46],"tracks":[49,154],"by":[51,181],"obstacles":[53],"which":[58],"are":[66,157],"sought.":[67],"growth":[71],"process":[72],"like":[73],"Dijkstra's":[74],"on":[75],"find":[80],"from":[83],"any":[84],"point":[85],"all":[90,133,143],"other":[91],"(the":[93],"one-to-all":[94,100],"problem).":[97],"For":[98],"problem":[103],"n":[105,174],"we":[107],"derive":[108],"an":[109,193],"O(n":[110,172],"min":[111],"{log":[112],"n,":[113],"log":[114,120,173,179],"e}":[115],"+":[116,118,175,177],"(e":[117,176],"k)":[119,178],"t)":[121,180],"time":[122,171],"algorithm,":[123],"where":[124],"e":[125],"is":[126,136,147,167,202],"total":[128],"number":[129,138,149],"edges":[131,141],"obstacles,":[134,144],"t":[135],"extreme":[140],"k":[146],"intersections":[151],"among":[152],"obstacle":[153],"(all":[155],"bounds":[156],"worst":[160],"case).":[161],"MST":[163,200],"constructed":[168],"also":[169],"hybrid":[183],"method":[184],"searching":[186],"while":[190],"simultaneously":[191],"constructing":[192],"MST.":[194],"An":[195],"interesting":[196],"application":[197],"algorithm":[201],"approximation":[204],"Steiner":[206],"trees":[207],"graphs.":[209]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}