A parallel algorithm for octree generation from polyhedral shape representation
Yoshifumi Kitamura, F. Kishino · 1996
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.