Construction of d-Dimensional Hyperoctrees on a Hypercube Multiprocessor

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 cross sections of this object. On a p-processor SIMD hypercube the time complexity of our algorithm is O((m/p) log p log n), where m is the maximum of input and output size.

[1]  Hanan Samet,et al.  The Quadtree and Related Hierarchical Data Structures , 1984, CSUR.

[2]  Azriel Rosenfeld,et al.  Parallel Processing of Linear Quadtrees on a Mesh-Connected Computer , 1989, J. Parallel Distributed Comput..

[3]  Guy E. Blelloch,et al.  A comparison of sorting algorithms for the connection machine CM-2 , 1991, SPAA '91.

[4]  Sartaj Sahni,et al.  Data broadcasting in SIMD computers , 1981, IEEE Transactions on Computers.

[5]  S. Sitharama Iyengar,et al.  Parallel Processing of Quadtrees on a Horizontally Reconfigurable Architecture Computing System , 1986, ICPP.

[6]  Sargur N. Srihari,et al.  A hierarchical data structure for multidimensional digital images , 1983, CACM.

[7]  Martti Mäntylä,et al.  Introduction to Solid Modeling , 1988 .

[8]  ARISTIDES A. G. REQUICHA,et al.  Representations for Rigid Solids: Theory, Methods, and Systems , 1980, CSUR.

[9]  Wentai Liu,et al.  Parallel Processing for Quadtree Problems , 1986, ICPP.

[10]  Kenneth E. Batcher,et al.  Sorting networks and their applications , 1968, AFIPS Spring Joint Computing Conference.

[11]  Oscar H. Ibarra,et al.  Quadtree Building Algorithms on an SIMD Hypercube , 1993, J. Parallel Distributed Comput..

[12]  Oscar H. Ibarra,et al.  Quadtree building algorithms on an SIMD hypercube , 1992, Proceedings Sixth International Parallel Processing Symposium.

[13]  Jean-Daniel Boissonnat,et al.  Shape reconstruction from planar cross sections , 1988, Comput. Vis. Graph. Image Process..

[14]  Hanan Samet,et al.  Applications of spatial data structures , 1989 .

[15]  Afonso Ferreira,et al.  Parallel Processing of Pointer Based Quadtrees on Hypercube Multiprocessors , 1991 .

[16]  Azriel Rosenfeld,et al.  Parallel processing of regions represented by linear quadtrees , 1988, Comput. Vis. Graph. Image Process..