MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Construction of d-Dimensional Hyperoctrees on a Hypercube Multiprocessor

Download:
Download as a PDF
by Frank Dehne, Andreas Fabri, Mostafa Nassar, Andrew Rau-chaplin, Rada Valiveti
http://134.117.206.249:8000/www/publications/publ/2-35/paper.pdf
Add To MetaCart

Abstract:

We present a parallel algorithm for the construction of the hyperoctree representing a d-dimensional object from a set of n (d; 1)dimensional hyperoctrees, representing adjacent crossections of this object. On a p-processor SIMD hypercube the time complexity ofour algorithm is O ( m p log p log n), where m is the maximum of input and output size.

Citations

399 Sorting networks and their applications – Batcher - 1968
330 The quadtree and related hierarchical data structures – Samet - 1984
265 Applications of Spatial Data Structures – Samet - 1990
228 An Introduction to Solid Modeling – Mantyla - 1988
193 Representations for Rigid Solids: Theory, Methods, and Systems – Requicha - 1980
185 A comparison of sorting algorithms for the connection machine cm-2 – Blelloch, Leiserson, et al. - 1991
90 Shape reconstruction from planar cross sections – Boissonnat - 1988
67 Data Broadcasting in SIMD Computers – Nassimi, Sahni - 1981
14 A Hierarchical Data Structure for Multidimensional Digital Images – Yau, Srihari - 1983
7 Parallel processing of linear quadtrees on a mesh-connected computer – Hung, Rosenfeld - 1989
5 Parallel processing of regions represented by linear quadtrees – Bhaskar, Rosenfeld, et al. - 1988
4 Parallel processing of quadtrees on a horizontally reconfigurable architecture computing system – Martin, Chiarulli, et al. - 1986
4 Parallel processing for quadtree problems – Mei, Liu - 1986
3 Quadtree Building Algorithms on an SIMD Hypercube – Ibbarra, Kim - 1992
2 Parallel processing of pointer based quadtrees – Dehne, Ferreira, et al. - 1991
2 AComparison of Sorting Algorithms for the Connection – Blelloch, Leiserson, et al. - 1991
1 Parallel processing of regions represented bylinear quadtrees – Bhaskar, Rosenfeld, et al. - 1988
1 The quadtree andrelated hierarchical data structures – Samet - 1984
1 Srihari.AHierarchical Data Structure forMultidimensional Digital Images – N