{"id":"https://openalex.org/W2038097058","doi":"https://doi.org/10.1080/01495730108935276","title":"EFFICIENT PARALLEL RANGE SEARCHING AND PARTITIONING ALGORITHMS*","display_name":"EFFICIENT PARALLEL RANGE SEARCHING AND PARTITIONING ALGORITHMS*","publication_year":2001,"publication_date":"2001-01-01","ids":{"openalex":"https://openalex.org/W2038097058","doi":"https://doi.org/10.1080/01495730108935276","mag":"2038097058"},"language":"en","primary_location":{"id":"doi:10.1080/01495730108935276","is_oa":false,"landing_page_url":"https://doi.org/10.1080/01495730108935276","pdf_url":null,"source":{"id":"https://openalex.org/S89732838","display_name":"Parallel algorithms and applications","issn_l":"1026-7689","issn":["1026-7689","1029-032X","1063-7192"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Algorithms and 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/A5005705210","display_name":"Amitava Datta","orcid":"https://orcid.org/0000-0001-6916-7907"},"institutions":[{"id":"https://openalex.org/I177877127","display_name":"University of Western Australia","ror":"https://ror.org/047272k79","country_code":"AU","type":"education","lineage":["https://openalex.org/I177877127"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"AMITAVA DATTA","raw_affiliation_strings":["Department of Computer Science & Software Engineering , The University of Western Australia , Perth, WA, 6907, Australia"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science & Software Engineering , The University of Western Australia , Perth, WA, 6907, Australia","institution_ids":["https://openalex.org/I177877127"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5005705210"],"corresponding_institution_ids":["https://openalex.org/I177877127"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.15862772,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"16","issue":"4","first_page":"301","last_page":"317"},"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.9998999834060669,"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.9998999834060669,"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11164","display_name":"Remote Sensing and LiDAR Applications","score":0.9951000213623047,"subfield":{"id":"https://openalex.org/subfields/2305","display_name":"Environmental Engineering"},"field":{"id":"https://openalex.org/fields/23","display_name":"Environmental Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/rectangle","display_name":"Rectangle","score":0.7561576962471008},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.6304889917373657},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.5943117141723633},{"id":"https://openalex.org/keywords/range-query","display_name":"Range query (database)","score":0.5368146896362305},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.5348803997039795},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.5257366895675659},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5098146796226501},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.48931118845939636},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4835195541381836},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.47636863589286804},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.45953086018562317},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4529031217098236},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4516758322715759},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4409330487251282},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.43294772505760193},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.1083114743232727}],"concepts":[{"id":"https://openalex.org/C2781302577","wikidata":"https://www.wikidata.org/wiki/Q209","display_name":"Rectangle","level":2,"score":0.7561576962471008},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.6304889917373657},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.5943117141723633},{"id":"https://openalex.org/C136736807","wikidata":"https://www.wikidata.org/wiki/Q818943","display_name":"Range query (database)","level":5,"score":0.5368146896362305},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.5348803997039795},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.5257366895675659},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5098146796226501},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.48931118845939636},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4835195541381836},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.47636863589286804},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.45953086018562317},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4529031217098236},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4516758322715759},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4409330487251282},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.43294772505760193},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.1083114743232727},{"id":"https://openalex.org/C97854310","wikidata":"https://www.wikidata.org/wiki/Q19541","display_name":"Search engine","level":2,"score":0.0},{"id":"https://openalex.org/C192939062","wikidata":"https://www.wikidata.org/wiki/Q104840822","display_name":"Sargable","level":4,"score":0.0},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","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/C164120249","wikidata":"https://www.wikidata.org/wiki/Q995982","display_name":"Web search query","level":3,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/01495730108935276","is_oa":false,"landing_page_url":"https://doi.org/10.1080/01495730108935276","pdf_url":null,"source":{"id":"https://openalex.org/S89732838","display_name":"Parallel algorithms and applications","issn_l":"1026-7689","issn":["1026-7689","1029-032X","1063-7192"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Algorithms and 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":13,"referenced_works":["https://openalex.org/W1969105125","https://openalex.org/W1978583881","https://openalex.org/W1989915986","https://openalex.org/W1999823999","https://openalex.org/W2005314985","https://openalex.org/W2011039300","https://openalex.org/W2043380199","https://openalex.org/W2066374992","https://openalex.org/W2120490947","https://openalex.org/W2158468450","https://openalex.org/W2911302472","https://openalex.org/W2913408406","https://openalex.org/W3199217328"],"related_works":["https://openalex.org/W105892904","https://openalex.org/W2966574946","https://openalex.org/W4288359125","https://openalex.org/W2944323243","https://openalex.org/W2010914215","https://openalex.org/W2055625272","https://openalex.org/W2036758175","https://openalex.org/W2170856128","https://openalex.org/W2189273496","https://openalex.org/W1838063489"],"abstract_inverted_index":{"We":[0,72,127],"present":[1],"an":[2],"optimal":[3],"parallel":[4,158,181],"construction":[5,15],"of":[6,66,76,97,108,140,150,180],"the":[7,23,64,69,77,141,147,151,176],"range":[8,24,34,49],"tree":[9],"data":[10],"structure":[11],"and":[12,44,94,100,114,135,146],"use":[13],"this":[14],"to":[16,29,104],"solve":[17],"several":[18,129],"geometric":[19],"partitioning":[20,74,161],"problems.":[21],"In":[22],"tree,":[25],"we":[26],"show":[27],"how":[28],"perform":[30],"a":[31,41,45,81,89,95,106],"count-mode":[32],"orthogonal":[33,48],"query":[35,50,70],"in":[36,51,164],"0(log":[37,52,165],"n)":[38,53,59,166],"time":[39,54,167],"by":[40],"single":[42],"processor":[43],"report":[46],"mode":[47],"using":[55,168],"0(1":[56],"+":[57],"log":[58],"processors,":[60],"where":[61],"k":[62],"is":[63,103],"number":[65],"points":[67],"inside":[68],"range.":[71],"consider":[73,128],"problems":[75,162],"following":[78],"nature.":[79],"Given":[80],"planar":[82],"point":[83],"set":[84],"S":[85,109],"(\u2223S\u2223":[86],"=":[87,117],"ri)":[88],"measure":[90],"\u03bcacting":[91],"on":[92],"5":[93],"pair":[96],"values":[98],"\u03bc1":[99],"\u03bc2,the":[101],"task":[102],"find":[105],"partition":[107],"into":[110],"two":[111],"components":[112],"S1":[113],"S2":[115],"(S":[116],"S1U":[118],"S2)":[119],"such":[120],"that":[121],"\u03bc(S1)":[122],"=\u03bc1":[123],"for":[124,175],"i=1,":[125],"2.":[126],"measures":[130],"like":[131],"diameter":[132],"under":[133],"L\u221e":[134],"l1":[136],"metric;":[137],"area,":[138],"perimeter":[139],"smallest":[142,152],"enclosing":[143,153],"axes-parallel":[144,154],"rectangle;":[145],"side":[148],"length":[149],"square.":[155],"All":[156],"our":[157],"algorithms":[159,172],"foi":[160],"run":[163],"0(n)":[169],"processors.":[170],"Our":[171],"are":[173],"designed":[174],"CREW":[177],"PRAM":[178],"model":[179],"computation.":[182]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}