Polygonization of implicit surfaces
Computer Aided Geometric Design
Introduction to Solid Modeling
Introduction to Solid Modeling
Raytracing irregular volume data
VVS '90 Proceedings of the 1990 workshop on Volume visualization
Direct volume rendering of curvilinear volumes
VVS '90 Proceedings of the 1990 workshop on Volume visualization
A polygonal approximation to direct scalar volume rendering
VVS '90 Proceedings of the 1990 workshop on Volume visualization
Octrees for faster isosurface generation
ACM Transactions on Graphics (TOG)
Topological considerations in isosurface generation
ACM Transactions on Graphics (TOG)
Corrigendum: Topological considerations in isosurface generation
ACM Transactions on Graphics (TOG)
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
Hierarchical and parallelizable direct volume rendering for irregular and multiple grids
Proceedings of the 7th conference on Visualization '96
Designing a data structure for polyhedral surfaces
Proceedings of the fourteenth annual symposium on Computational geometry
Efficiently using graphics hardware in volume rendering applications
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
Automatic Isosurface Propagation Using an Extrema Graph and Sorted Boundary Cell Lists
IEEE Transactions on Visualization and Computer Graphics
A Near Optimal Isosurface Extraction Algorithm Using the Span Space
IEEE Transactions on Visualization and Computer Graphics
Splatting of Non Rectilinear Volumes Through Stochastic Resampling
IEEE Transactions on Visualization and Computer Graphics
The Lazy Sweep Ray Casting Algorithm for Rendering Irregular Grids
IEEE Transactions on Visualization and Computer Graphics
Speeding Up Isosurface Extraction Using Interval Trees
IEEE Transactions on Visualization and Computer Graphics
A High Accuracy Volume Renderer for Unstructured Data
IEEE Transactions on Visualization and Computer Graphics
Compressing hexahedral volume meshes
Graphical Models - Special issue on Pacific graphics 2002
Visualization of grids conforming to geological structures: a topological approach
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
A classification of scientific visualization algorithms for massive threading
UltraVis '13 Proceedings of the 8th International Workshop on Ultrascale Visualization
Hi-index | 0.00 |
We present the Circular Incident Edge Lists (CIEL), a new data structure and a high-performance algorithm for generating a series of iso-surfaces in a highly unstructured grid. Slicing-based volume rendering is also considered. The CIEL data structure represents all the combinatorial information of the grid, making it possible to optimize the classical propagation from local minima paradigm. The usual geometric structures are replaced by a more efficient combinatorial structure. An active edges list is maintained, and iteratively propagated from an iso-surface to the next one in a very efficient way. The intersected cells incident to each active edge are retrieved, and the intersection polygons are generated by circulating around their facets. This latter feature enables arbitrary irregular cells to be treated, such as those encountered in certain computational fluid dynamics (CFD) simulations. Since the CIEL data structure solely depends on the connections between the cells, it is possible to take into account dynamic changes in the geometry of the mesh and in property values, which only requires the sorted extrema list to be updated. Experiments have shown that our approach is significantly faster than classical methods. The major drawback of our method is its memory consumption, higher than most classical methods. However, experimental results show that it stays within a practical range.