Construction of D-Dimensional Hyperoctrees on a Hypercube Multiprocessor

摘要

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