3D boundary recovery by constrained Delaunay tetrahedralization

Thumbnail Image
Files
664867359.pdf(1.98 MB)
Date
2010
Authors
Volume
1530
Issue
Journal
Series Titel
Book Title
Publisher
Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik
Link to publishers version
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
URI
https://doi.org/10.34657/1776
 https://oa.tib.eu/renate/handle/123456789/2316
Citation
Si, H., & Gärtner, K. (2010). 3D boundary recovery by constrained Delaunay tetrahedralization (Vol. 1530). Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik.
Collections
Mathematik
License
This document may be downloaded, read, stored and printed for your own use within the limits of § 53 UrhG but it may not be distributed via the internet or passed on to external parties.
Dieses Dokument darf im Rahmen von § 53 UrhG zum eigenen Gebrauch kostenfrei heruntergeladen, gelesen, gespeichert und ausgedruckt, aber nicht im Internet bereitgestellt oder an Außenstehende weitergegeben werden.