2 research outputs found
Computing Three-dimensional Constrained Delaunay Refinement Using the GPU
We propose the first GPU algorithm for the 3D triangulation refinement
problem. For an input of a piecewise linear complex and a
constant , it produces, by adding Steiner points, a constrained Delaunay
triangulation conforming to and containing tetrahedra mostly of
radius-edge ratios smaller than . Our implementation of the algorithm shows
that it can be an order of magnitude faster than the best CPU algorithm while
using a similar amount of Steiner points to produce triangulations of
comparable quality
Computing three-dimensional constrained delaunay refinement using the GPU
10.1109/PACT.2019.000392019 28th International Conference on Parallel Architectures and Compilation Techniques (PACT)2019-September408-419United State