Marching cubes: A high resolution 3D surface construction algorithm
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
A polygonal approximation to direct scalar volume rendering
VVS '90 Proceedings of the 1990 workshop on Volume visualization
Topological considerations in isosurface generation extended abstract
VVS '90 Proceedings of the 1990 workshop on Volume visualization
ACM Computing Surveys (CSUR)
Fast isocontouring for improved interactivity
Proceedings of the 1996 symposium on Volume visualization
Hardware assisted volume rendering of unstructured grids by incremental slicing
Proceedings of the 1996 symposium on Volume visualization
Designing a data structure for polyhedral surfaces
Proceedings of the fourteenth annual symposium on Computational geometry
An approach to the integration of spacial data and systems for a 3D geo-information system
Computers & Geosciences - Special issue on system integration within the geosciences
Circular incident edge lists: a data structure for rendering complex unstructured grids
Proceedings of the conference on Visualization '01
Optical Models for Direct Volume Rendering
IEEE Transactions on Visualization and Computer Graphics
The Lazy Sweep Ray Casting Algorithm for Rendering Irregular Grids
IEEE Transactions on Visualization and Computer Graphics
A High Accuracy Volume Renderer for Unstructured Data
IEEE Transactions on Visualization and Computer Graphics
Efficient computation of volume fractions for multi-material cell complexes in a grid by slicing
Computers & Geosciences
GPU accelerated isosurface extraction on tetrahedral grids
ISVC'06 Proceedings of the Second international conference on Advances in Visual Computing - Volume Part I
Hi-index | 0.00 |
Flexible grids are used in many Geoscience applications because they can accurately adapt to the great diversity of shapes encountered in nature. These grids raise a number difficult challenges, in particular for fast volume visualization. We propose a generic incremental slicing algorithm for versatile visualization of unstructured grids, these being constituted of arbitrary convex cells. The tradeoff between the complexity of the grid and the efficiency of the method is addressed by special-purpose data structures and customizations. A general structure based on oriented edges is defined to address the general case. When only a limited number of polyhedron types is present in the grid (zoo grids), memory usage and rendering time are reduced by using a catalog of cell types generated automatically. This data structure is further optimized to deal with stratigraphic grids made of hexahedral cells. The visualization method is applied to several gridded subsurface models conforming to geological structures.