Abstract
The randomized incremental insertion algorithm of Delaunay triangulation in E3 is very popular due to its simplicity and stability. This paper describes a new parallel algorithm based on this approach. The goals of the proposed parallel solution are not only to make it efficient but also to make it simple. The algorithm is intended for computer architectures with several processors and shared memory. Several versions of the proposed method were tested on workstations with up to eight processors and on datasets of up to 200000 points with favorable results.
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 callDisclaimer: 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.
