Fjällström, P.-O. (1996). Range Searching on a Mesh-Connected Parallel Computer. Technical Report LiTH-IDA-R-96-27, Department of Computer and Information Science, Linköping University, Sweden. (bibtex),
Abstract: Given a set of n points and hyperrectangles in d-dimensional space, the range-searching problem is to determine which points each hype rectangle contains. We present two parallel algorithms for this problem on a mesh-connected parallel computer: one average case efficient algorithm based on cell division, and one worst-case efficient divide-and-conquer algorithm. In addition to the asymptotic analysis of their running times, we present an experimental evaluation of the algorithms.
CS Dept TR Overview