Three-dimensional delaunay mesh generation

27Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.

Abstract

We propose an algorithm to compute a conforming Delaunay mesh of a bounded domain in ℝ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. © Springer 2006.

Cite

CITATION STYLE

APA

Cheng, S. W., & Poon, S. H. (2006). Three-dimensional delaunay mesh generation. Discrete and Computational Geometry, 36(3), 419–456. https://doi.org/10.1007/s00454-006-1252-5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free