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
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
I/O optimal isosurface extraction (extended abstract)
VIS '97 Proceedings of the 8th conference on Visualization '97
Interactive out-of-core isosurface extraction
Proceedings of the conference on Visualization '98
Introduction to data compression (2nd ed.)
Introduction to data compression (2nd ed.)
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
Sweeping Simplices: A Fast Iso-Surface Extraction Algorithm for Unstructured Grids
VIS '95 Proceedings of the 6th conference on Visualization '95
Span filtering: an optimization scheme for volume visualization of large finite element models
VIS '91 Proceedings of the 2nd conference on Visualization '91
IEEE Transactions on Information Theory
Adaptive Extraction of Time-Varying Isosurfaces
IEEE Transactions on Visualization and Computer Graphics
Fast time-dependent isosurface extraction and rendering
Proceedings of the 20th spring conference on Computer graphics
Out-of-Core Isosurface Extraction of Time-Varying Fields over Irregular Grids
Proceedings of the 14th IEEE Visualization 2003 (VIS'03)
Isosurface Extraction and Spatial Filtering using Persistent Octree (POT)
IEEE Transactions on Visualization and Computer Graphics
Technical Section: Space and time efficient isosurface extraction
Computers and Graphics
Isosurface extraction using fixed-sized buckets
EUROVIS'05 Proceedings of the Seventh Joint Eurographics / IEEE VGTC conference on Visualization
Hi-index | 0.00 |
In this paper, we present a space efficient algorithm for speeding up isosurface extraction. Even though there exist algorithms that can achieve optimal search performance to identify isosurface cells, they prove impractical for large datasets due to a high storage overhead. With the dual goals of achieving fast isosurface extraction and simultaneously reducing the space requirement, we introduce an algorithm based on transform coding to compress the interval information of the cells in a dataset. Compression is achieved by first transforming the cell intervals (minima, maxima) into a form which allows more efficient compaction. It is followed by a dataset optimized non-uniform quantization stage. The compressed data is stored in a data structure that allows fast searches in the compression domain, thus eliminating the need to retrieve the original representation of intervals at run-time. The space requirement of our search data structure is the mandatory cost of storing every cell id once, plus an overhead for quantization information. The overhead is typically in the order of a few hundredths of the dataset size.