The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.03 - July-September (1999 vol.5)
pp: 224-237
ABSTRACT
<p><b>Abstract</b>—We present a method for the construction of multiple levels of tetrahedral meshes approximating a trivariate scalar-valued 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 edges of the mesh. Each triangulation defines a linear spline function, where the function values associated with the vertices are the spline coefficients. Error bounds are stored for individual tetrahedra and are updated as the mesh is simplified. Two algorithms are presented that simplify the mesh within prescribed error bounds. Each algorithm treats simplification on the mesh boundary. The result is a hierarchical data description suited for efficient visualization of large data sets at varying levels of detail.</p>
INDEX TERMS
Mesh simplification, hierarchical representation, multiresolution method, scattered data, spline, tetrahedral mesh, visualization.
CITATION
Issac J. Trotts, Bernd Hamann, Kenneth I. Joy, "Simplification of Tetrahedral Meshes with Error Bounds", IEEE Transactions on Visualization & Computer Graphics, vol.5, no. 3, pp. 224-237, July-September 1999, doi:10.1109/2945.795214
16 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool