Isosurface extraction using fixed-sized buckets

Authors:
Kenneth W. Waters;Christopher S. Co;Kenneth I. Joy
Affiliations:
Institute for Data Analysis and Visualization, University of California, Davis;Institute for Data Analysis and Visualization, University of California, Davis;Institute for Data Analysis and Visualization, University of California, Davis
Venue:
EUROVIS'05 Proceedings of the Seventh Joint Eurographics / IEEE VGTC conference on Visualization
Year:
2005

Citing 9
Cited 4

Marching cubes: A high resolution 3D surface construction algorithm

SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Octrees for faster isosurface generation

ACM Transactions on Graphics (TOG)
Isosurfacing in span space with utmost efficiency (ISSUE)

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
Interactive out-of-core isosurface extraction

Proceedings of the conference on Visualization '98
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
Efficient Point-Based Isosurface Exploration Using the Span-Triangle

VIS '04 Proceedings of the conference on Visualization '04
Space Efficient Fast Isosurface Extraction for Large Datasets

Proceedings of the 14th IEEE Visualization 2003 (VIS'03)

Interactive Point-based Isosurface Exploration and High-quality Rendering

IEEE Transactions on Visualization and Computer Graphics
Using Difference Intervals for Time-Varying Isosurface Visualization

IEEE Transactions on Visualization and Computer Graphics
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a simple and output optimal algorithm for accelerated isosurface extraction from volumetric data sets. Output optimal extraction algorithms perform an amount of work dominated by the size of the (output) isosurface rather than the size of the (input) data set. While several optimal methods have been proposed to accelerate isosurface extraction, these algorithms are relatively complicated to implement or require quantized values as input. Our method is based on a straightforward array data structure that only requires an auxiliary sorting routine for construction. The method works equally well for floating point data as it does for quantized data sets. We demonstrate how the data structure can exploit coherence between isosurfaces by performing searches incrementally. We show results for real application data validating the method's optimality.