Skip to Main Content
Efficient data-parallel spatial join algorithms for bucket PMR quadtrees and R-trees, common spatial data structures, are given. The domain consists of planar line segment data (i.e., Bureau of the Census TIGER/Line files). Parallel algorithms for map intersection and a spatial range query are described. The algorithms are implemented using the scan model of parallel computation on the hypercube architecture of the Connection Machine.
Parallel Processing, 1994. Vol. 1. ICPP 1994. International Conference on (Volume:3 )
Date of Conference: 15-19 Aug. 1994