Marching cubes: A high resolution 3D surface construction algorithm
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Display of Surfaces from Volume Data
IEEE Computer Graphics and Applications
Efficient ray tracing of volume data
ACM Transactions on Graphics (TOG)
Octrees for faster isosurface generation
ACM Transactions on Graphics (TOG)
Fast isocontouring for improved interactivity
Proceedings of the 1996 symposium on Volume visualization
Isosurfacing in span space with utmost efficiency (ISSUE)
Proceedings of the 7th conference on Visualization '96
Volume thinning for automatic isosurface propagation
Proceedings of the 7th conference on Visualization '96
Contour trees and small seed sets for isosurface traversal
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
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
Speeding Up Isosurface Extraction Using Interval Trees
IEEE Transactions on Visualization and Computer Graphics
Span filtering: an optimization scheme for volume visualization of large finite element models
VIS '91 Proceedings of the 2nd conference on Visualization '91
Flexible isosurfaces: Simplifying and displaying scalar topology using the contour tree
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
Iso-surface extraction is one of the most important approaches for volume rendering, and iso-contouring is one of the most effective methods for iso-surface extraction. Unlike most other methods having their search domain to be the whole dataset, iso-contouring does its search only on a relatively small subset of the original data-set. This subset, called a seed-set, has the property that every iso-surface must intersect with it, and it could be built at the preprocessing time. When an iso-value is given at the run time, iso-contouring algorithm starts from the intersected cells in the seed-set, and gradually propagates to form the whole iso-surface. As smaller seed-sets offer less cell searching time, most existing iso-contouring algorithms concentrates on how to identify an optimal seed-set. In this paper, we propose a new and linear-time approach for seed-set construction. This presented algorithm could reduce the size of the generated seed-sets by up to one or two orders of magnitude, compared with other previously proposed fast (linear time) algorithms.