Meshing Piecewise Linear Complexes by Constrained Delaunay Tetrahedralizations (2005)
| Venue: | In Proceedings of the 14th International Meshing Roundtable |
| Citations: | 30 - 1 self |
BibTeX
@INPROCEEDINGS{Si05meshingpiecewise,
author = {Hang Si and Klaus Gärtner},
title = {Meshing Piecewise Linear Complexes by Constrained Delaunay Tetrahedralizations},
booktitle = {In Proceedings of the 14th International Meshing Roundtable},
year = {2005},
pages = {147--163},
publisher = {Springer}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Summary. We present a method to decompose an arbitrary 3D piecewise linear complex (PLC) into a constrained Delaunay tetrahedralization (CDT). It successfully resolves the problem of non-existence of a CDT by updating the input PLC into another PLC which is topologically and geometrically equivalent to the original one and does have a CDT. Based on a strong CDT existence condition, the redefinition is done by a segment splitting and vertex perturbation. Once the CDT exists, a practically fast cavity retetrahedralization algorithm recovers the missing facets. This method has been implemented and tested through various examples. In practice, it behaves rather robust and efficient for relatively complicated 3D domains. 1
