View-dependent tetrahedral meshing and rendering

Sondershaus, Ralf; Straßer, Wolfgang

doi:10.1145/1101389.1101394

Cited by 3 publications

(4 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This approach also supports selective refinement queries. Sondershaus et al (2005) propose a segmentation-based mesh representation of volume data, which allows view-dependent refinement using a hierarchy of pre-constructed segments.…”

Section: Related Workmentioning

confidence: 99%

Dynamic view-dependent visualization of unstructured tetrahedral volumetric meshes

Okuyan

Güdükbay

İşler

2012

J Vis

View full text Add to dashboard Cite

Visualization of large volumetric datasets has always been an important problem. Due to the high computational requirements of volume-rendering techniques, achieving interactive rates is a real challenge. We present a selective refinement scheme that dynamically refines the mesh according to the camera parameters. This scheme automatically determines the impact of different parts of the mesh on the output image and refines the mesh accordingly, without needing any user input. The view-dependent refinement scheme uses a progressive mesh representation that is based on an edge collapse-based tetrahedral mesh simplification algorithm. We tested our view-dependent refinement framework on an existing state-of-theart volume renderer. Thanks to low overhead dynamic view-dependent refinement, we achieve interactive frame rates for rendering common datasets at decent image resolutions. Keywords Volume visualization Á Direct volume rendering Á View-dependent refinement Á Progressive meshes Á Unstructured tetrahedral meshes Electronic supplementary material The online version of this article (

show abstract

Section: Related Workmentioning

confidence: 99%

Dynamic view-dependent visualization of unstructured tetrahedral volumetric meshes

Okuyan

Güdükbay

İşler

2012

J Vis

View full text Add to dashboard Cite

show abstract

“…The iRun approach [VCS*07] is an out‐of‐core extension of the sample‐based LOD method [CCSS05], where no connectivity or mesh LOD is maintained. As mentioned in Section 1, [SS06b] performs out‐of‐core simplification and LOD volume rendering for tetrahedral meshes, but it uses the simple approach of not simplifying the sub‐volume boundaries at all. The only such approach that addresses the issue of crack‐free LOD is [SS06a], which is based on [CGG*05] and we discuss them together below.…”

Section: Previous Workmentioning

confidence: 99%

“…Technically, it is desirable to avoid this problem and achieve a crack‐free LOD mesh, namely, any neighboring sub‐volumes in a selected LOD have consistent boundaries , and all the cells in the LOD are fold‐over free (i.e., do not have negative volumes). A simple solution (as in [SS06b]) would be not to simplify the boundary cells until at a higher level where these cells become interior to an ancestor sub‐volume. But for those cells that are initially cut at the top level, they cannot be simplified until at the tree root (i.e., at the very end of simplification), which is undesirable.…”

Section: Introductionmentioning

confidence: 99%

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

Chiang

2010

Computer Graphics Forum

View full text Add to dashboard Cite

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.

show abstract

“…Several representation schemes were developed to support multiresolution tetrahedral meshes [64,15,14,35,19,16,18,20,59]. In more direct relevance to our work, Szymczak and Rossignac [61] propose the Grow&Fold compression algorithm for tetrahedral meshes.…”

Section: Background and Prior Artmentioning

confidence: 99%

SOT

Gurung

Rossignac

2009

2009 SIAM/ACM Joint Conference on Geometric and Physical Modeling

View full text Add to dashboard Cite

The Corner Table (CT) promoted by Rossignac et al. provides a simple and efficient representation of triangle meshes, storing 6 integer references per triangle (3 vertex references in the V table and 3 references to opposite corners in the O table that accelerate access to adjacent triangles). The Compact Half Face (CHF) proposed by Lage et al. extends CT to tetrahedral meshes, storing 8 references per tetrahedron (4 in the V table and 4 in the O table). We call it the Vertex Opposite Table (VOT) and propose a sorted variation, SVOT, which does not require any additional storage and yet provides, for each vertex, a reference to an incident corner from which an incident tetrahedron may be recovered and the star of the vertex may be traversed at a constant cost per visited element. We use a set of powerful wedge-based operators for querying and traversing the mesh. Finally, inspired by tetrahedral mesh encoding techniques used by Weiler et al. and by Szymczak and Rossignac, we propose our Sorted O Table (SOT) variation, which eliminates the V table completely and hence reduces storage requirements by 50% to only 4 references and 9 bits per tetrahedron, while preserving the vertex-to-incident-corner references and supporting our wedge operators with a linear average cost.Several tetrahedral mesh compression schemes have been proposed [31,61]. Some support progressive refinements [45] or streaming [8, 33, 66]. Unfortunately, the compressed format they offer is not suitable for traversing, simplifying [14,22,21,67], refining [41], or improving [57, 42, 58] the mesh. Thus, an effective representation scheme is needed that provides efficient support for random access operators that traverse the mesh and which may be constructed efficiently from other (possibly compressed) formats or updated to reflect mesh modifications.

show abstract

View-dependent tetrahedral meshing and rendering

Cited by 3 publications

References 28 publications

Dynamic view-dependent visualization of unstructured tetrahedral volumetric meshes

Dynamic view-dependent visualization of unstructured tetrahedral volumetric meshes

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

SOT

Contact Info

Product

Resources

About