3D boundary recovery by constrained Delaunay tetrahedralization

Loading...
Thumbnail Image
Date
2010
Journal Title
Journal ISSN
Volume Title
Publisher
Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik
Abstract

Three-dimensional boundary recovery is a fundamental problem in mesh generation. In this paper, we propose a practical algorithm for solving this problem. Our algorithm is based on the construction of a it constrained Delaunay tetrahedralization (CDT) for a set of constraints (segments and facets). The algorithm adds additional points (so-called Steiner points) on segments only. The Steiner points are chosen in such a way that the resulting subsegments are Delaunay and their lengths are not unnecessarily short. It is theoretically guaranteed that the facets can be recovered without using Steiner points. The complexity of this algorithm is analyzed. The proposed algorithm has been implemented. Its performance is reported through various application examples

Description
Keywords
tetrahedral mesh generation, boundary recovery, constrained Delaunay tetrahedralization, Steiner points
Citation
Citation
Si, H., & Gärtner, K. (2010). 3D boundary recovery by constrained Delaunay tetrahedralization (Version publishedVersion, Vol. 1530). Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik.
Collections