{"id":"https://openalex.org/W2114726496","doi":"https://doi.org/10.1142/s0218195994000021","title":"ORTHOGONAL SHORTEST ROUTE QUERIES AMONG AXES PARALLEL RECTANGULAR OBSTACLES","display_name":"ORTHOGONAL SHORTEST ROUTE QUERIES AMONG AXES PARALLEL RECTANGULAR OBSTACLES","publication_year":1994,"publication_date":"1994-03-01","ids":{"openalex":"https://openalex.org/W2114726496","doi":"https://doi.org/10.1142/s0218195994000021","mag":"2114726496"},"language":"en","primary_location":{"id":"doi:10.1142/s0218195994000021","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195994000021","pdf_url":null,"source":{"id":"https://openalex.org/S25827807","display_name":"International Journal of Computational Geometry & Applications","issn_l":"0218-1959","issn":["0218-1959","1793-6357"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Geometry & Applications","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/A5008849727","display_name":"Hossam ElGindy","orcid":null},"institutions":[{"id":"https://openalex.org/I78757542","display_name":"University of Newcastle Australia","ror":"https://ror.org/00eae9z71","country_code":"AU","type":"education","lineage":["https://openalex.org/I78757542"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"HOSSAM ELGINDY","raw_affiliation_strings":["Department of Computer Science, The University of Newcastle, University Drive, Callaghan, New South Wales 2308, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, The University of Newcastle, University Drive, Callaghan, New South Wales 2308, Australia","institution_ids":["https://openalex.org/I78757542"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045420930","display_name":"Pinaki Mitra","orcid":"https://orcid.org/0000-0002-8254-8234"},"institutions":[{"id":"https://openalex.org/I18014758","display_name":"Simon Fraser University","ror":"https://ror.org/0213rcc28","country_code":"CA","type":"education","lineage":["https://openalex.org/I18014758"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"PINAKI MITRA","raw_affiliation_strings":["School of Computing Science, Simon Fraser Univerity, Burnaby, BC V5A 1S6, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computing Science, Simon Fraser Univerity, Burnaby, BC V5A 1S6, Canada","institution_ids":["https://openalex.org/I18014758"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.364,"has_fulltext":false,"cited_by_count":28,"citation_normalized_percentile":{"value":0.96538159,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"04","issue":"01","first_page":"3","last_page":"24"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9965000152587891,"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"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9965000152587891,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9958999752998352,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9591000080108643,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.5331282615661621},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.5099722146987915},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.48074984550476074},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.44461068511009216},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.4427802562713623},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43587738275527954},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34723228216171265},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.33629149198532104},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3292348384857178}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5331282615661621},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.5099722146987915},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48074984550476074},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.44461068511009216},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.4427802562713623},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43587738275527954},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34723228216171265},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.33629149198532104},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3292348384857178}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0218195994000021","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218195994000021","pdf_url":null,"source":{"id":"https://openalex.org/S25827807","display_name":"International Journal of Computational Geometry & Applications","issn_l":"0218-1959","issn":["0218-1959","1793-6357"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computational Geometry & Applications","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":0,"referenced_works":[],"related_works":["https://openalex.org/W1971174658","https://openalex.org/W2099195351","https://openalex.org/W4256429076","https://openalex.org/W2348092930","https://openalex.org/W2171695875","https://openalex.org/W1606013690","https://openalex.org/W4293743430","https://openalex.org/W1553466895","https://openalex.org/W3006156235","https://openalex.org/W2073591271"],"abstract_inverted_index":{"Given":[0],"a":[1,15,21,132,169,189],"set":[2],"\u212c":[3,18,55],"of":[4,17,23,148,212,219],"n":[5],"barriers,":[6],"the":[7,24,48,52,65,73,84,100,118,164,183,194,215],"shortest":[8,25,74,119,165,196],"route":[9,26,77,92,136,166],"query":[10,124],"SRQ":[11,49],"problem":[12,50,105],"asks":[13],"for":[14,47,72,116,192],"preprocessing":[16,112],"such":[19,91],"that":[20,162],"description":[22],"between":[27,78,121,198],"two":[28,79,122,199],"points":[29,81,125,200],"(origin":[30],"and":[31,44,68,110],"destination)":[32],"can":[33,138,174],"be":[34,97,140,176],"reported":[35],"efficiently.":[36],"In":[37],"this":[38,104],"manuscript":[39],"we":[40,106,107,186],"present":[41,108,188],"efficient":[42],"sequential":[43,109],"parallel":[45,63,98,111,190],"algorithms":[46,113],"where":[51],"barriers":[53,85],"in":[54,86,126,142,168,206],"are":[56,62,93],"disjoint":[57],"planar":[58,157],"rectangles":[59],"whose":[60],"sides":[61],"to":[64,96,99,145],"coordinate":[66,101],"axes,":[67],"subsequent":[69],"queries":[70],"ask":[71],"L":[75],"1":[76],"arbitrary":[80,123],"which":[82,114,204],"avoids":[83],"\u212c.":[87],"The":[88,135],"segments":[89],"forming":[90],"also":[94,139,187],"restricted":[95],"axes.":[102],"For":[103],"allow":[115],"reporting":[117],"distance":[120,197],"O(":[127],"log":[128],"n)":[129],"time":[130,143,208],"with":[131],"single":[133],"processor.":[134],"itself":[137],"constructed":[141],"proportional":[144],"its":[146],"number":[147,211],"segments.":[149],"Our":[150],"method":[151],"is":[152],"based":[153],"on":[154,214],"constructing":[155],"three":[156],"graphs,":[158,161],"called":[159],"carrier":[160],"contain":[163],"information":[167],"succinct":[170],"form.":[171],"Each":[172],"graph":[173,179],"then":[175],"searched":[177],"using":[178,209],"theoretic":[180],"techniques.":[181],"Using":[182],"same":[184],"techniques":[185],"algorithm":[191],"computing":[193],"orthogonal":[195],"among":[201],"rectangular":[202],"obstacles":[203],"runs":[205],"poly-logarithmic":[207],"sub-quadratic":[210],"processors":[213],"CREW":[216],"PRAM":[217],"model":[218],"computation.":[220]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}