Compression and Occlusion Culling for Fast Isosurface Extraction from Massive Datasets

Gregorski, Benjamin F.; Senecal, Joshua G.; Duchaineau, Mark A.; Joy, Kenneth I.

doi:10.1007/b106657_16

Cited by 4 publications

(3 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Finally, they rearrange the data hierarchically [PF01] and use the operating system’s virtual memory paging for cache‐coherent out‐of‐core memory management [LP02]. In follow‐up work, Gregorski et al [GSDJ09] further accelerate their view‐dependent isosurface extraction through the use of hardware compression and occlusion culling. They use the RSB mesh extracted during the previous frame to estimate the occluded regions of the data set.…”

Section: Applications In Three Dimensionsmentioning

confidence: 99%

Simplex and Diamond Hierarchies: Models and Applications

Weiss

Floriani

2011

Computer Graphics Forum

View full text Add to dashboard Cite

Hierarchical spatial decompositions are a basic modeling tool in a variety of application domains. Several papers on this subject deal with hierarchical simplicial decompositions generated through simplex bisection. Such decompositions, originally developed for finite elements, are extensively used as the basis for multiresolution models of scalar fields, such as terrains, and static or time-varying volume data. They have also been used as an alternative to quadtrees and octrees as spatial access structures and in other applications. In this state of the art report, we distinguish between approaches that focus on a specific dimension and those that apply to all dimensions. The primary distinction among all such approaches is whether they treat the simplex or clusters of simplexes, called diamonds, as the modeling primitive. This leads to two classes of data structures and to different query approaches. We present the hierarchical models in a dimension-independent manner, and organize the description of the various applications, primarily interactive terrain rendering and isosurface extraction, according to the dimension of the domain.

show abstract

Section: Applications In Three Dimensionsmentioning

confidence: 99%

Simplex and Diamond Hierarchies: Models and Applications

Weiss

Floriani

2011

Computer Graphics Forum

View full text Add to dashboard Cite

show abstract

“…The most common visibility culling algorithms are view frustum culling, 1-3 back face culling 4-6 and occlusion culling. [7][8][9][10] View frustum culling is based on the fact that only the objects inside the current view volume must be rendered. View volume is usually defined by six planes that form a pyramid, as described in more details in Sec.…”

Section: Introductionmentioning

confidence: 99%

An Improved View Frustum Culling Method Using Octrees for 3d Real-Time Rendering

Carvalho

Santos

Schwartz

et al. 2013

Int. J. Image Grap.

View full text Add to dashboard Cite

The generation of real-time 3D graphics scenes normally demands high computational requirements. Several applications can benefit from efficient algorithms for rendering complex virtual environments, such as computer games, terrain visualization, virtual reality and visual simulation. This paper describes an improved view frustum culling method using spatial partitioning based on octrees for 3D real-time rendering. The proposed method is compared against two other approaches. Experiments using four different scenes are conducted to evaluate the performance of each tested method. Results demonstrate that the proposed method presents superior frame rate for all scenes. Parana. His is currently an embedded software developer at Datacom, Curitiba, Brazil. His research interests include computer graphics, computational geometry, computer vision, artificial intelligence.Maikon Cismoski dos Santos received his B.

show abstract

“…Pesco et al [16] uses an implicit culling scheme based on the scalar values at the voxels instead of actual triangles on the iso-surface. Recently, Gregorski et al proposes a culling algorithm for iso-surfaces extracted from hierarchical tetrahedral meshes that exploits frame-to-frame coherence between consecutive views [7]. …”

Section: Introductionmentioning

confidence: 99%

View-independent contour culling of 3D density maps for far-field viewing of iso-surfaces

Feng

Warren

2011

Computers & Graphics

View full text Add to dashboard Cite

In many applications, iso-surface is the primary method for visualizing the structure of 3D density maps. We consider a common scenario where the user views the iso-surfaces from a distance and varies the level associated with the iso-surface as well as the view direction to gain a sense of the general 3D structure of the density map. For many types of density data, the iso-surfaces associated with a particular threshold may be nested and never visible during this type of viewing. In this paper, we discuss a simple, conservative culling method that avoids the generation of interior portions of iso-surfaces at the contouring stage. Unlike existing methods that perform culling based on the current view direction, our culling is performed once for all views and requires no additional computation as the view changes. By pre-computing a single visibility map, culling is done at any iso-value with little overhead in contouring. We demonstrate the effectiveness of the algorithm on a range of bio-medical data and discuss a practical application in online visualization.

show abstract

Compression and Occlusion Culling for Fast Isosurface Extraction from Massive Datasets

Cited by 4 publications

References 14 publications

Simplex and Diamond Hierarchies: Models and Applications

Simplex and Diamond Hierarchies: Models and Applications

An Improved View Frustum Culling Method Using Octrees for 3d Real-Time Rendering

View-independent contour culling of 3D density maps for far-field viewing of iso-surfaces

Contact Info

Product

Resources

About