Guaranteed-quality Delaunay meshing in 3D

117Citations
Citations of this article
44Readers
Mendeley users who have this article in their library.

Abstract

A mesh generating technique for producing three dimensional tetrahedral meshes based on Delaunay triangulation (DT) is presented. This Delaunay-based method avoids slivers, tetrahedral mesh-elements that are almost flat, and maximizes the minimum angle between a given point set. The Empty Circle Property defines the DT of a set of point sites, the circumsphere of each triangle is empty of all other sites, and if the analogous property holds in three dimension, the circumsphere of each tetrahedron is empty of all other sites. Theorems for three dimensional meshing algorithms are presented.

Cite

CITATION STYLE

APA

Chew, L. P. (1997). Guaranteed-quality Delaunay meshing in 3D. In Proceedings of the Annual Symposium on Computational Geometry (pp. 391–393). ACM.

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