Sciweavers

DCG
2006

Three-Dimensional Delaunay Mesh Generation

13 years 11 months ago
Three-Dimensional Delaunay Mesh Generation
We propose an algorithm to compute a conforming Delaunay mesh of a bounded domain 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.
Siu-Wing Cheng, Sheung-Hung Poon
Added 11 Dec 2010
Updated 11 Dec 2010
Type Journal
Year 2006
Where DCG
Authors Siu-Wing Cheng, Sheung-Hung Poon
Comments (0)