Acadia University (15 University Avenue
Wolfville, Nova Scotia,B4P2R6 - Canada)
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 Contributor : Rapport de Recherche InriaConnect in order to contact the contributor Submitted on : Monday, May 29, 2006 - 11:47:18 AM Last modification on : Friday, February 4, 2022 - 3:19:52 AM Long-term archiving on: : Monday, April 5, 2010 - 9:29:18 PM
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⟩