Construction of d-dimensional hyperoctrees on a hypercube multiprocessor - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1992

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.

Domains

Other [cs.OH]
Fichier principal
Vignette du fichier
RR-1752.pdf (162.05 Ko) Télécharger le fichier

Dates and versions

inria-00076992 , version 1 (29-05-2006)

Identifiers

  • HAL Id : inria-00076992 , version 1

Cite

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⟩
212 View
362 Download

Share

Gmail Facebook X LinkedIn More