Abstract
We propose an algorithm to compute a conforming Delaunay mesh of a bounded domain in \({\Bbb R}^3\) specified by a piecewise linear complex. Arbitrarily small input angles are allowed, and the input complex is not required to be a manifold. Our algorithm encloses the input edges with a small buffer zone, a union of balls whose sizes are proportional to the local feature sizes at their centers. In the output mesh, the radius-edge ratio of the tetrahedra outside the buffer zone is bounded by a constant independent of the domain, while that of the tetrahedra inside the buffer zone is bounded by a constant depending on the smallest input angle. Furthermore, the output mesh is graded. Our work is the first that provides quality guarantees for Delaunay meshes in the presence of small input angles.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
Author information
Authors and Affiliations
Corresponding authors
Rights and permissions
About this article
Cite this article
Cheng, SW., Poon, SH. Three-Dimensional Delaunay Mesh Generation. Discrete Comput Geom 36, 419–456 (2006). https://doi.org/10.1007/s00454-006-1252-5
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00454-006-1252-5