Files: 
Description 
File size 
Format 
Fulltext 

PDF (requires Acrobat Reader) 
Fulltext 

PostScript (requires a PostScript Reader) 


Author: 
PerOlof Fjällström 
Article title: 
Batched Range Searching on a MeshConnected SIMD Computer 
Publ. type: 
Article 
Volume: 
2 
Article No: 
7 
Language: 
English 
Abstract [en]: 
Given a set of n points and hyperrectangles in a ddimensional space, the batched rangesearching problem is to determine which points each hyperrectangle contains. We present two parallel algorithms for this problem on a √(n) * √(n) meshconnected parallel computer: one averagecase efficient algorithm based on cell division, and one worstcase efficient divideandconquer algorithm. Besides the asymptotic analysis of their running times, we present an experimental evaluation of the algorithms. 
Keywords: 
Parallel algorithms, meshconnected parallel computers, range searching 
PDF 
Publisher: 
Linköping University Electronic Press 
Year: 
1997 
Available: 
19970707 
No. of pages: 
15 
Series: 
Linköping Electronic Articles in Computer and Information Science 
ISSN: 
14019841 
REFERENCE TO THIS PAGE:
Fjällström, PerOlof (1997). Batched Range Searching on a MeshConnected SIMD Computer in Linköping Electronic Articles in Computer and Information Science, 2(?). http://www.ep.liu.se/ea/cis/1997/007/.
() 
