Three-dimensional Delaunay mesh generation

S.W. Cheng, S.H. Poon

Research output: Contribution to journalArticleAcademicpeer-review

24 Citations (Scopus)


We propose an algorithm to compute a conforming Delaunay mesh of a bounded domain in 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.
Original languageEnglish
Pages (from-to)419-456
JournalDiscrete and Computational Geometry
Issue number3
Publication statusPublished - 2006


Dive into the research topics of 'Three-dimensional Delaunay mesh generation'. Together they form a unique fingerprint.

Cite this