Constrained Delaunay tetrahedral mesh generation and refinement
- Si, Hang
2010 Mathematics Subject Classification
- 52B55 65D18
- constrained Delaunay tetrahedralization, mesh generation, boundary recovery, mesh refinement
A it constrained Delaunay tetrahedralization of a domain in $mathbbR^3$ is a tetrahedralization such that it respects the boundaries of this domain, and it has properties similar to those of a Delaunay tetrahedralization. Such objects have various applications such as finite element analysis, computer graphics rendering, geometric modeling, and shape analysis. This article is devoted to presenting recent developments on constrained Delaunay tetrahedralizations of piecewise linear domains. The focus is for the application of numerically solving partial differential equations using finite element or finite volume methods. We survey various related results and detail two core algorithms that have provable guarantees and are amenable to practical implementation. We end this article by listing a set of open questions.
- Finite Elem. Anal. Des., 46 pp. 33--46.