Skip to Main content Skip to Navigation
Reports

Construction of d-dimensional hyperoctrees on a hypercube multiprocessor

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.
Document type :
Reports
Complete list of metadata

https://hal.inria.fr/inria-00076992
Contributor : Rapport de Recherche Inria <>
Submitted on : Monday, May 29, 2006 - 11:47:18 AM
Last modification on : Tuesday, September 22, 2020 - 1:10:07 PM
Long-term archiving on: : Monday, April 5, 2010 - 9:29:18 PM

Identifiers

  • HAL Id : inria-00076992, version 1

Collections

Citation

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⟩

Share

Metrics

Record views

799

Files downloads

831