A parallel algorithm for octree generation from polyhedral shape representation

Author

Kitamura, Yoshifumi ; Kishino, Fumio

Author_Institution

ATR Commun. Syst. Res. Labs., Kyoto, Japan

Volume

4

fYear

1996

fDate

25-29 Aug 1996

Firstpage

303

Abstract

We propose a parallel algorithm that efficiently generates an octree from a polyhedral shape representation. The algorithm is simple and can apply to general (non-convex) objects. The parallelized algorithm is based on two ideas for the assignment of multiple processors. The algorithm is implemented and tested on MIMD multi-processors having a shared memory. Experimental results, which demonstrate the effectiveness and efficiency of the proposed method are given (e.g. 2.5 seconds are required to generate an octree shape representation from a polyhedral object having 148 polygons). Through investigation of the performance of the proposed parallel algorithm, the features of the parallelism are discussed

Keywords

computational geometry; computer vision; image representation; octrees; parallel algorithms; shared memory systems; MIMD multi-processors; computer vision; multiple processor assignment; octree generation; parallel algorithm; polyhedral shape representation; shared memory; Application software; Computer graphics; Deformable models; Image converters; Laboratories; Multimedia systems; Parallel algorithms; Parallel processing; Shape; Testing;

fLanguage

English

Publisher

ieee

Conference_Titel

Pattern Recognition, 1996., Proceedings of the 13th International Conference on

Conference_Location

Vienna

ISSN

1051-4651

Print_ISBN

0-8186-7282-X

Type

conf

DOI

10.1109/ICPR.1996.547435

Filename

547435