The Community for Technology Leaders
Green Image
Issue No. 05 - September/October (2004 vol. 10)
ISSN: 1077-2626
pp: 587-597
We consider scientific data sets that describe density functions over three-dimensional geometric domains. Such data sets are often large and coarsened representations are needed for visualization and analysis. Assuming a tetrahedral mesh representation, we construct such representations with a simplification algorithm that combines three goals: the approximation of the function, the preservation of the mesh topology, and the improvement of the mesh quality. The third goal is achieved with a novel extension of the well-known quadric error metric. We perform a number of computational experiments to understand the effect of mesh quality improvement on the density map approximation. In addition, we study the effect of geometric simplification on the topological features of the function by monitoring its critical points.
Computational geometry, volume visualization, hierarchy, geometric transformation.

V. Natarajan and H. Edelsbrunner, "Simplification of Three-Dimensional Density Maps," in IEEE Transactions on Visualization & Computer Graphics, vol. 10, no. , pp. 587-597, 2004.
89 ms
(Ver 3.3 (11022016))