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 of our algorithm is O(F(m;p) log p log n) where m is the maximum of input size.
https://hal.inria.fr/inria-00076992
Contributeur : Rapport de Recherche Inria
<>
Soumis le : lundi 29 mai 2006 - 11:47:18
Dernière modification le : samedi 27 janvier 2018 - 01:31:01
Document(s) archivé(s) le : lundi 5 avril 2010 - 21:29:18
Franke Dehne, Andreas Fabri, Mostafa Nassar, Andrew Rau-Chaplin, Rada Valiveti. Construction of d-dimensional hyperoctrees on a hypercube multiprocessor. [Research Report] RR-1752, INRIA. 1992. 〈inria-00076992〉
