{"id":"https://openalex.org/W2170905079","doi":"https://doi.org/10.1016/0925-7721(93)90004-p","title":"On parallel rectilinear obstacle- avoiding paths","display_name":"On parallel rectilinear obstacle- avoiding paths","publication_year":1993,"publication_date":"1993-12-01","ids":{"openalex":"https://openalex.org/W2170905079","doi":"https://doi.org/10.1016/0925-7721(93)90004-p","mag":"2170905079"},"language":"en","primary_location":{"id":"doi:10.1016/0925-7721(93)90004-p","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0925-7721(93)90004-p","pdf_url":null,"source":{"id":"https://openalex.org/S165542689","display_name":"Computational Geometry","issn_l":"0925-7721","issn":["0925-7721","1879-081X"],"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":"Computational Geometry","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/A5113562454","display_name":"Mikhail J. Atallah","orcid":null},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mikhail J. Atallah","raw_affiliation_strings":["Department of Computer Sciences, Purdue University, West Lafayette, IN 47907 USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Sciences, Purdue University, West Lafayette, IN 47907 USA","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"last","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":["[Dept. of Computer Science and Engineering, University of Notre Dame, Notre Dame, IN, 46556, USA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"[Dept. of Computer Science and 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":[],"corresponding_institution_ids":[],"apc_list":{"value":2540,"currency":"USD","value_usd":2540},"apc_paid":null,"fwci":2.8679,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.9026087,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"3","issue":"6","first_page":"307","last_page":"313"},"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.9976000189781189,"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.9976000189781189,"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/T11106","display_name":"Data Management and Algorithms","score":0.996999979019165,"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"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9961000084877014,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/binary-logarithm","display_name":"Binary logarithm","score":0.6572811007499695},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.6546782851219177},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6302769780158997},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6205365061759949},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6007180213928223},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5161398649215698},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5093063116073608},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.5005431175231934},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.48473259806632996},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.47889676690101624},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.4280402958393097},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.419377863407135},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.41167503595352173},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35925570130348206},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3493747115135193},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3247908651828766},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.311112642288208},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.15921014547348022}],"concepts":[{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6572811007499695},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.6546782851219177},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6302769780158997},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6205365061759949},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6007180213928223},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5161398649215698},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5093063116073608},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.5005431175231934},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.48473259806632996},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.47889676690101624},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.4280402958393097},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.419377863407135},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.41167503595352173},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35925570130348206},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3493747115135193},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3247908651828766},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.311112642288208},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.15921014547348022},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/0925-7721(93)90004-p","is_oa":false,"landing_page_url":"https://doi.org/10.1016/0925-7721(93)90004-p","pdf_url":null,"source":{"id":"https://openalex.org/S165542689","display_name":"Computational Geometry","issn_l":"0925-7721","issn":["0925-7721","1879-081X"],"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":"Computational Geometry","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W11969735","https://openalex.org/W1975595599","https://openalex.org/W1978583881","https://openalex.org/W1992320342","https://openalex.org/W2030999197","https://openalex.org/W2031911173","https://openalex.org/W2038796709","https://openalex.org/W2070165907","https://openalex.org/W2096827683","https://openalex.org/W2114726496","https://openalex.org/W2130566259","https://openalex.org/W2165968314","https://openalex.org/W6658415289"],"related_works":["https://openalex.org/W2055625272","https://openalex.org/W1976803949","https://openalex.org/W2036758175","https://openalex.org/W4230281099","https://openalex.org/W1838063489","https://openalex.org/W1577155814","https://openalex.org/W2099271296","https://openalex.org/W2743938404","https://openalex.org/W2038796709","https://openalex.org/W1972433940"],"abstract_inverted_index":null,"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}