Construction of d-Dimensional Hyperoctrees on a Hypercube Multiprocessor

F. Dehne, A. Fabri, M. Nassar, A. Rauchaplin, R. Valiveti
1994 Journal of Parallel and Distributed Computing  
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 o f o u r algorithm is O( m p logp log n), where m is the maximum of input and output size.
doi:10.1006/jpdc.1994.1137 fatcat:uqgm7w2c7zbojc7siyirj5jym4