Data-Parallel Primitives for Spatial Operations.
Erik G. Hoel, Hanan Samet · 1995
Data-parallel primitives for performing operations on the PM1 quadtree and the bucket PMR quadtree are presented using the scan model. Algorithms are described for building these two data structures that make use of these primitives. The data-parallel algorithms are assumed tobe main memory resident. They were implemented on a Thinking Machines CM-5 with 32 processors containing 1GB of main memory. 1