HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Reports

Construction of d-dimensional hyperoctrees on a hypercube multiprocessor

Franke Dehne 1 Andreas Fabri 2 Mostafa Nassar 3 Andrew Rau-Chaplin 1 Rada Valiveti 1
1 SCS - School of computer science [Ottawa]
2 PRISME - Geometry, Algorithms and Robotics
CRISAM - Inria Sophia Antipolis - Méditerranée
3 Jodrey School of Computer Science
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 Connect 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

Files

Vignette du document
RR-1752.pdf

Identifiers

  • HAL Id : inria-00076992, version 1

Collections

INRIA | INRIA-RRRT | LARA | INRIA2

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⟩

Export

BibTeX TEI DC DCterms EndNote Datacite

Share

Metrics

Record views

210

Files downloads

332

 

Contact                    Legal Notice                    Personal Data