Simplification of three-dimensional density maps

V Natarajan, H Edelsbrunner - IEEE Transactions on …, 2004 - ieeexplore.ieee.org
IEEE Transactions on Visualization and Computer Graphics, 2004ieeexplore.ieee.org
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 …
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.
ieeexplore.ieee.org
以上显示的是最相近的搜索结果。 查看全部搜索结果