Volume 51, 2015, Pages 2613–2622ICCS 2015 International Conference On Computational Science Highly Parallel Algorithm for Large DataIn–Core and Out–Core Triangulation in E2 and E3 AbstractA triangulation of points in E2, or a tetrahedronization of points in E3, is used in many applications. It is not necessary to fulfill the Delaunay criteria in all cases. For large data (more then 5 · 107 points),parallel methods are used for the purpose of decreasingrun–time. A new approach for fast, effective and highly parallel CPU and GPU triangulation, or tetrahedronization, of large data sets in E2 or E3 suitable for in–core and out–core memory processing, is proposed. Experimental results proved that the resulting triangulation/tetrahedralization is close to the Delaunay triangulation/tetrahedralization. It also demonstrates the applicability of the methodp ...
پاورپوینت