Abstract
We propose a parallel algorithm that efficiently generates an octree from a polyhedral shape representation. The algorithm is simple and applicable to general (non-convex) objects. The parallelized algorithm is based on two ideas for the assignment of multiple processors. The algorithm was implemented and tested on MIMD multi-processors having a shared memory. Experimental results demonstrate the effectiveness and efficiency of the proposed method : for example, only 2.5 seconds are required to generate an octree shape representation from a polyhedral object having 148 polygons. We discuss the performance of the proposed parallel algorithm and the features of the parallelism.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: The Journal of the Institute of Television Engineers of Japan
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
