Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

106

Voted

ICPP
1993
IEEE

favoriteEmaildiscussreport

167views Distributed And Parallel Com...» more ICPP 1993»

Data-Parallel R-Tree Algorithms

15 years 3 months ago

Data-Parallel R-Tree Algorithms

Download www.cs.umd.edu

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.

Erik G. Hoel, Hanan Samet

Real-time Traffic

Abstract Data-parallel Algorithms | Distributed And Parallel Computing | ICPP 1993 | Line Segments | Planar Line Segment |

claim paper

Related Content

» Similarity and cluster analysis algorithms for Microarrays using R trees

» DataParallel Octrees for Surface Reconstruction

» High Performance Stereo Vision Designed for Massively Data Parallel Platforms

» Implementing Data Parallel Rational MultipleResidue Arithmetic in Eden

» DataParallelism and GPUs for Lattice Gas Fluid Simulations

» A Data Parallel Algorithm for XML DOM Parsing

» DataParallel Spatial Join Algorithms

» An improved data parallel algorithm for Boolean function manipulation using BDDs

» A DataParallel Algorithm to Reliably Solve Systems of Nonlinear Equations

Post Info
More Details (n/a)

Added	08 Aug 2010
Updated	08 Aug 2010
Type	Conference
Year	1993
Where	ICPP
Authors	Erik G. Hoel, Hanan Samet

Comments (0)