{"id":"https://openalex.org/W2080239516","doi":"https://doi.org/10.1016/0020-0190(96)00020-8","title":"Rectilinear short path queries among rectangular obstacles","display_name":"Rectilinear short path queries among rectangular obstacles","publication_year":1996,"publication_date":"1996-03-01","ids":{"openalex":"https://openalex.org/W2080239516","doi":"https://doi.org/10.1016/0020-0190(96)00020-8","mag":"2080239516"},"language":"en","primary_location":{"id":"doi:10.1016/0020-0190(96)00020-8","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(96)00020-8","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","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/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 A. Chen","raw_affiliation_strings":["Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, IN 46556, USA","Department of Computer Science & Engineering University of Notre Dame Notre Dame IN 46556 USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, IN 46556, USA","institution_ids":["https://openalex.org/I107639228"]},{"raw_affiliation_string":"Department of Computer Science & Engineering University of Notre Dame Notre Dame IN 46556 USA","institution_ids":["https://openalex.org/I107639228"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5069224332","display_name":"Kevin S. Klenk","orcid":null},"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":true,"raw_author_name":"Kevin S. Klenk","raw_affiliation_strings":["Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, IN 46556, USA","Department of Computer Science & Engineering University of Notre Dame Notre Dame IN 46556 USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, IN 46556, USA","institution_ids":["https://openalex.org/I107639228"]},{"raw_affiliation_string":"Department of Computer Science & Engineering University of Notre Dame Notre Dame IN 46556 USA","institution_ids":["https://openalex.org/I107639228"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5069224332"],"corresponding_institution_ids":["https://openalex.org/I107639228"],"apc_list":{"value":2200,"currency":"USD","value_usd":2200},"apc_paid":null,"fwci":1.9097,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.87469734,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"57","issue":"6","first_page":"313","last_page":"319"},"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.9940999746322632,"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.9829000234603882,"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/shortest-path-problem","display_name":"Shortest path problem","score":0.7156926393508911},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6682708263397217},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6094258427619934},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5886346697807312},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5811953544616699},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.5359625816345215},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.511655867099762},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.4934145510196686},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.4323859214782715},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.3749431371688843},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34524649381637573},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2611025273799896},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.09332206845283508},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.0747564435005188}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7156926393508911},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6682708263397217},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6094258427619934},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5886346697807312},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5811953544616699},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.5359625816345215},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.511655867099762},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.4934145510196686},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.4323859214782715},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.3749431371688843},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34524649381637573},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2611025273799896},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.09332206845283508},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0747564435005188},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0020-0190(96)00020-8","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0020-0190(96)00020-8","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W334231571","https://openalex.org/W1554513289","https://openalex.org/W1975595599","https://openalex.org/W1979832172","https://openalex.org/W1982180670","https://openalex.org/W1990647388","https://openalex.org/W1992320342","https://openalex.org/W1992815517","https://openalex.org/W2011999472","https://openalex.org/W2036114412","https://openalex.org/W2046946959","https://openalex.org/W2062367161","https://openalex.org/W2063372577","https://openalex.org/W2076009323","https://openalex.org/W2114726496","https://openalex.org/W2126876121","https://openalex.org/W2132026455","https://openalex.org/W2147998016","https://openalex.org/W2160517890","https://openalex.org/W2168583884","https://openalex.org/W2170905079","https://openalex.org/W2331180561","https://openalex.org/W2549805347","https://openalex.org/W2625805711","https://openalex.org/W6611476260","https://openalex.org/W6633196432","https://openalex.org/W6643827206","https://openalex.org/W6646009077","https://openalex.org/W6648263763","https://openalex.org/W6659703700","https://openalex.org/W6660471176","https://openalex.org/W6669707849","https://openalex.org/W6683801575","https://openalex.org/W6684678277","https://openalex.org/W6684986799","https://openalex.org/W6739267817"],"related_works":["https://openalex.org/W2330033216","https://openalex.org/W2108552407","https://openalex.org/W4317438127","https://openalex.org/W1575027696","https://openalex.org/W2403030781","https://openalex.org/W2080239516","https://openalex.org/W3083558008","https://openalex.org/W756766391","https://openalex.org/W1992096258","https://openalex.org/W2808967831"],"abstract_inverted_index":null,"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}