|
Abstract |
The edge-flip technique can be used for transforming any existing triangular mesh into one that satisfies the Delaunay condition. Although several implementations for generating Delaunay triangulations are known, to the best of our knowledge no full parallel GPU-based implementation just dedicated to transform any existent triangulation into a Delaunay triangulation has been reported yet. In the present work, we propose a two-phase iterative GPU-based algorithm, that transforms any 2D planar triangulations and 3D triangular surface meshes into their respective Delaunay form. We tested our method with meshes of different size, and compared it with a sequential CPU-implementation. Based on these results, our algorithm strongly improves the performance with respect to a classic CPU-implementation, thus making it a good candidate for interactive/real-time applications. |
