Construction of d-dimensional hyperoctrees on a hypercube multiprocessor

Available at INIST (FR), Document Supply Service, under shelf-number : 14802 E, issue : a.1992 n.1752 / INIST-CNRS - Institut de l'Information Scientifique et TechniqueSIGLEFRFranc

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 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