Data-parallel primitives for spatial operations using PM quadtrees

Abstract

Data-parallel primitives for performing operations on the PM/sub 1/ 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 to be main-memory resident. They were implemented on a Thinking Machines CM-5 with 32 processors containing 1 GB of main memory.