#DELAUNAY TRIANGULATION ADOBE PC#
The parallel zonal insertion on a PC can boost the speed of the single-processor insertion by 4.5 times for the insertion of 50 million randomly generated spatial points in 133 s. The parallel 3D Delaunay triangulation algorithm has been coded in Intel FORTRAN VS2010. Redundant tetrahedra at the boundary between zones can be easily eliminated by individual processors in a completely independent manner by means of the elegant minimum vertex allocation scheme, such that a simplex with k vertices from zones ( z 1, z 2, … , z k) is allocated to zone z = min( z 1, z 2, … , z k). Tetrahedra at the boundary between zones are created in parallel by adding layers of cells at the boundary of each zone to ensure that circumspheres of boundary tetrahedra contain no points in their interior. The cells are naturally grouped into zones, in which Delaunay triangulation is constructed by simultaneous point insertion cell by cell within each zone. For efficient Delaunay triangulation, points are first sorted into cells, each of which is allocated roughly equal number of points.
A generic parallel Delaunay triangulation scheme by means of zonal partition of points is proposed.
0 kommentar(er)
