Progressive isosurface extraction from tetrahedral meshes

Labsik, Ulf; Kipfer, Peter; Meinlschmidt, Stefan; Greiner, Günther

doi:10.1109/pccga.2001.962880

Cited by 6 publications

(5 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…• accept regularly sampled scalar (e.g., from MRI and CT, level set simulation, and 3D photography sources), or Hermite volume data as it allows for the description of sharp features [Kobbelt et al 2001]. For data defined on arbitrary tetrahedral grids see for example [Labsik et al 2001]; • produce significantly better r/d performance than general purpose mesh coders; • exploit the special structure of isosurface meshes;…”

Section: Setup and Design Choicesmentioning

confidence: 99%

Progressive encoding of complex isosurfaces

LeeHaeyoung¹,

Desbrun²,

SchröderPeter

2003

ACM Trans. Graph.

View full text Add to dashboard Cite

Figure 1: Progressively decoded isosurface (Headscan model) at 257 3 grid resolution (octree depth of eight). Up to the last octree level, no explicit geometry is encoded. Explicit geometry bits are only associated with the final resolution level. Distortions are relative L 2 errors measured by Metro [Cignoni et al. 1998], normalized to the bounding box diagonal length and given in multiples of 10 −4 .

show abstract

Section: Setup and Design Choicesmentioning

confidence: 99%

Progressive encoding of complex isosurfaces

LeeHaeyoung¹,

Desbrun²,

SchröderPeter

2003

ACM Trans. Graph.

View full text Add to dashboard Cite

show abstract

“…For data defined on arbitrary tetrahedral grids see for example [Labsik et al 2001]; • produce significantly better r/d performance than general purpose mesh coders; • exploit the special structure of isosurface meshes;…”

Section: Desideratamentioning

confidence: 99%

Progressive encoding of complex isosurfaces

Lee¹,

Desbrun²,

Schröder

2003

ACM SIGGRAPH 2003 Papers

View full text Add to dashboard Cite

[Cignoni et al. 1998], normalized to the bounding box diagonal length and given in multiples of 10 −4 . AbstractSome of the largest and most intricate surfaces result from isosurface extraction of volume data produced by 3D imaging modalities and scientific simulations. Such surfaces often possess both complicated geometry and topology (i.e., many connected components and high genus). Because of their sheer size, efficient compression algorithms, in particular progressive encodings, are critical in working with these surfaces. Most standard mesh compression algorithms have been designed to deal with generally smooth surfaces of low topologic complexity. Much better results can be achieved with algorithms which are specifically designed for isosurfaces arising from volumetric datasets. We present a progressive encoding technique specifically designed for complex isosurfaces. It achieves better rate distortion performance than all standard mesh coders, and even improves on all previous single rate isosurface coders. Our novel algorithm handles isosurfaces with or without sharp features, and deals gracefully with high topologic and geometric complexity. The inside/outside function of the volume data is progressively transmitted through the use of an adaptive octree, while a local frame based encoding is used for the fine level placement of surface samples. Local patterns in topology and local smoothness in geometry are exploited by context-based arithmetic encoding, allowing us to achieve an average of 6.3 bits per vertex (b/v) at very low distortion. Of this rate only 0.69 b/v are dedicated to connectivity data: this improves by 18% over the best previous single rate isosurface encoder.

show abstract

“…A grid software that intends to be widely applicable cannot exclude any of these grid types. Thus, the gridlib supports completely unstructured grids 6 , which include all other more specialised grid types. Furthermore, the gridlib does not make any assumptions about the mesh topology nor the geometrical shape of the elements involved.…”

Section: Unstructured Gridsmentioning

confidence: 99%

“…Several components have already been implemented. Progressive mesh techniques allow to trade visualization quality for faster response time (resolution on demand), see [5]. Sliceand isosurfaces geometries can be computed and displayed via various rendering options, see [8].…”

Section: Visualization Pipelinementioning

confidence: 99%

See 1 more Smart Citation

gridlib: Flexible and Efficient Grid Management for Simulation and Visualization

Hülsemann

Kipfer

Rüde

et al. 2002

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. This paper describes the gridlib project, a unified grid management framework for simulation and visualization. Both, adaptive PDEsolvers and interactive visualization toolkits, have to manage dynamic grids. The gridlib meets the similar but not identical demands on grid management from the two sides, visualization and simulation. One immediate advantage of working on a common grid is the fact that the visualization has direct access to the simulation results, which eliminates the need for any form of data conversion. Furthermore, the gridlib provides support for unstructured grids, the re-use of existing solvers, the appropriate use of hardware in the visualization pipeline, grid adaptation and hierarchical hybrid grids. The present paper shows how these features have been included in the gridlib design to combine run-time efficiency with the flexibility necessary to ensure wide applicability. The functionality provided the gridlib helps to speed up program development for simulation and visualization alike.

show abstract

Progressive isosurface extraction from tetrahedral meshes

Abstract: Abstract

Cited by 6 publications

References 24 publications

Progressive encoding of complex isosurfaces

Progressive encoding of complex isosurfaces

Progressive encoding of complex isosurfaces

gridlib: Flexible and Efficient Grid Management for Simulation and Visualization

Contact Info

Product

Resources

About