Multiresolution tetrahedral meshes: an analysis and a comparison
Authors:
- E. DanovaroEDE. Danovaro
- M. LeeMLM. Lee
- H. SametHSH. Samet
- 25 June 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 83-273
Abstract
We deal with the problem of analyzing and visualizing large-size volume data sets. To this aim, we consider multiresolution representations based on a decomposition of the field domain into tetrahedral cells. We compare two types of multiresolution representations that differ on the rule applied to refine an initial coarse mesh: one is based on tetrahedron bisection, and one based on vertex split. The two representations can be viewed as instances of a common multiresolution model, that we call a multiresolution mesh. Encoding data structures for the two representations are briefly described. An experimental comparison on structured volume data sets is presented.Keywords
This publication has 20 references indexed in Scilit:
- An efficient wavelet-based compression method for volume rendering2003
- Octree-based decimation of marching cubes surfaces2002
- Constant-time neighbor finding in hierarchical tetrahedral meshes2002
- Time critical isosurface refinement and smoothing2000
- Wavelet‐Based 3D Compression Scheme for Interactive Visualization of Very Large Volume DataComputer Graphics Forum, 1999
- Hierarchical and adaptive visualization on nested gridsComputing, 1997
- Progressive simplicial complexes1997
- Local Bisection Refinement for N-Simplicial Grids Generated by ReflectionSIAM Journal on Scientific Computing, 1995
- Symbolic Local Refinement of Tetrahedral GridsJournal of Symbolic Computation, 1994
- A 3‐D refinement algorithm suitable for adaptive and multi‐grid techniquesCommunications in Applied Numerical Methods, 1992