A triangulation of points in , or a tetrahedronization of points in , is used in many applications. It is not necessary to fulfill the Delaunay criteria in all cases. For large data (more then 5 ∙ 10 points), parallel methods are used for the purpose of decreasing time complexity. A new approach for fast and effective parallel CPU and GPU triangulation, or tetrahedronization, of large data sets...
