|Title||Simplification of Tetrahedral Meshes
(In Proceedings) |
|in||Proceedings of IEEE Visualization '98|
Isaac J. Trotts, Bernd Hamann, Ken Joy, David F. Wiley |
|Keyword(s)||Approximation; hierarchical representation; mesh generation; multiresolution method; scattered data; spline; triangulation; visualization.|
|Location||Research Triangle Park, North Carolina|
|Date||October 18--23, 1998|
We present a method for the construction of multiple levels of tetrahedral meshes approximating a trivariate function at different levels of detail. Starting with an initial, high-resolution triangulation of a three-dimensional region, we construct coarser representation levels by collapsing tetrahedra. Each triangulation defines a linear spline function, where the function values associated with the vertices are the spline coefficients. Based on predicted errors, we collapse tetrahedron in the grid that do not cause the maximum error to exceed a use-specified threshold. Bounds are stored for individual tetrahedra and are updated as the mesh is simplified. We continue the simplification process until a certain error is reached. The result is a hierarchical data description suited for the efficient visualization of large data sets at varying levels of detail.