Marching cubes: A high resolution 3D surface construction algorithm
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Advanced interactive visualization for CFD
Computing Systems in Education
Volume probes: interactive data exploration on arbitrary grids
VVS '90 Proceedings of the 1990 workshop on Volume visualization
Span filtering: an optimization scheme for volume visualization of large finite element models
VIS '91 Proceedings of the 2nd conference on Visualization '91
Visualization of simulated airflow in a clean room
VIS '92 Proceedings of the 3rd conference on Visualization '92
Isosurfacing in span space with utmost efficiency (ISSUE)
Proceedings of the 7th conference on Visualization '96
Visualization of scalar topology for structural enhancement
Proceedings of the conference on Visualization '98
View dependent isosurface extraction
Proceedings of the conference on Visualization '98
Parallel accelerated isocontouring for out-of-core visualization
PVGS '99 Proceedings of the 1999 IEEE symposium on Parallel visualization and graphics
Topology preserving and controlled topology simplifying multiresolution isosurface extraction
Proceedings of the conference on Visualization '00
Parallel view-dependent isosurface extraction using multi-pass occlusion culling
PVG '01 Proceedings of the IEEE 2001 symposium on parallel and large-data visualization and graphics
A Near Optimal Isosurface Extraction Algorithm Using the Span Space
IEEE Transactions on Visualization and Computer Graphics
Interactive Point-Based Isosurface Extraction
VIS '04 Proceedings of the conference on Visualization '04
Describing shapes by geometrical-topological properties of real functions
ACM Computing Surveys (CSUR)
| Hi-index | 0.00 |
A high-performance algorithm for generating isosurfaces is presented. In this algorithm, extrema points in a scalar field are first extracted. A graph is then generated in which the extrema points are taken as nodes. Each arc of the graph has a list of IDs of the cells that are intersected by the arc. A boundary cell list ordered according to cells' values is also generated. The graph and the list generated in this pre-process are used as a guide in searching for seed cells. Isosurfaces are generated from seed cells that are found in arcs of the graph. In this process isosurfaces appear to propagate themselves. The algorithm visits only cells that are intersected by an isosurface and cells whose IDs are included in cell lists. It is especially efficient when many isosurfaces are interactively generated in a huge volume. Some benchmark tests described in this paper show the efficiency of the algorithm.