Out‐of‐Core Simplification and Crack‐Free LOD Volume Rendering for Irregular Grids

Abstract

We propose a novel out-of-core simplification and level-of-detail (LOD) volume rendering algorithm for large irregular grids represented as tetrahedral meshes. One important feature of our algorithm is that it creates a space decomposition as required by I/O-efficient simplification and volume rendering, and simplifies both the internal and boundary portions of the sub-volumes progressively by edge collapses using the (extended) quadric error metric, while ensuring any selected LOD mesh to be crack-free (i.e., any neighboring sub-volumes in the LOD have consistent boundaries, and all the cells in the LOD do not have negative volumes), with all computations performed I/O-efficiently. This has been an elusive goal for out-of-core progressive meshes and LOD visualization, and our novel solution achieves this goal with a theoretical guarantee to be crack-free for tetrahedral meshes. As for selecting a desirable LOD mesh for volume rendering, our technique supports selective refinement LODs (where different places can have different error bounds), in addition to the basic uniform LODs (where the error bound is the same in all places). The proposed scalar-value range and view-dependent selection queries for selective refinement are especially effective in producing images of the highest quality with a much faster rendering speed. The experiments demonstrate the efficacy of our new technique.

Dynamic view-dependent visualization of unstructured tetrahedral volumetric meshes

“…This approach refines the mesh based on user-specified selective refinement queries whereas our approach automatically refines the mesh based on camera parameters. Du and Chiang (2010) propose an out-of-core simplification algorithm and crack-free LOD volume rendering. This approach also supports selective refinement queries.…”