Local refinement of tetrahedral meshes for DSI: Surface reconstruction with adaptive triangle size

@inproceedings{FrankRM2006,
 abstract = { Tetrahedral meshes are getting more and more important for geo-modeling applications. Continuous changes of the input data may require the local adaption of cell size and density to reach a numerical resolution that represents physical phenomena. This article compares three tetrahedral mesh refinement methods for applications using Discrete Smooth Interpolation (DSI) on 3d-simplicial complexes. The first method relies on point insertion together with the Delaunay criterion, the second intersects an edge of a tetrahedron and herby splits this simplex into two. The third algorithm investigated in this experimental work is based on templates that define a distinct decomposition pattern. This article compares these methods by the means of a surface reconstruction method that highly depends on DSI. The three main points of investigation were convergence of the reconstruction, quality of the refined mesh and computational cost. By local refinement surfaces with adaptive, user controlled triangle size can be reconstructed. },
 author = { Frank, Tobias },
 booktitle = { 26th gOcad Meeting },
 month = { "june" },
 publisher = { ASGA },
 title = { Local refinement of tetrahedral meshes for DSI: Surface reconstruction with adaptive triangle size },
 year = { 2006 }
}