This paper discusses the problem of refining constrained Delaunay tetrahedralizations (CDTs) into good quality meshes suitable for adaptive numerical simulations. A practical algorithm which extends the basic Delaunay refinement scheme is proposed. It generates an isotropic mesh corresponding to a sizing function which can be either user-specified or automatically derived from the geometric data. Analysis shows that the algorithm is able to produce provable-good meshes, i.e., most output tetrahedra have their circumradius-to-shortest edge ratios bounded, except those in the neighborhood of small input angles. Good mesh conformity can be obtained for smoothly changing sizing information. The algorithm has been implemented. Various examples are provided to illustrate the theoretical aspects and practical performance of the algorithm. © 2006 Springer.
CITATION STYLE
Si, H. (2006). On refinement of constrained delaunay tetrahedralizations. In Proceedings of the 15th International Meshing Roundtable, IMR 2006 (pp. 509–528). https://doi.org/10.1007/978-3-540-34958-7_29
Mendeley helps you to discover research relevant for your work.