Computing Three-dimensional Constrained Delaunay Refinement Using the GPU
Graphics
2019-03-11 v1
Abstract
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.
Cite
@article{arxiv.1903.03406,
title = {Computing Three-dimensional Constrained Delaunay Refinement Using the GPU},
author = {Zhenghai Chen and Tiow-Seng Tan},
journal= {arXiv preprint arXiv:1903.03406},
year = {2019}
}