Data-Parallel R-Tree Algorithms

Abstract Data-parallel algorithms for R-trees, a common spatial data structure are presented, in the domain of planar line segment data e.g., Bureau of the Census TIGER Line les. Parallel algorithms for both building the data-parallel R-tree, as well as determining the closed polygons formed by the line segments, are described and implemented using the SAM Scan-AndMonotonic-mapping model of parallel computation on the hypercube architecture of the Connection Machine.

• Type: Conference
• Year: 1993
• Where: ICPP
• Authors: Erik G. Hoel, Hanan Samet
• Keywords: Abstract Data-parallel Algorithms, Distributed And Parallel Computing, ICPP 1993, Line Segments, Planar Line Segment