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)
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
Three dimensional visualization of proteins in cellular interactions
Proceedings of the 7th conference on Visualization '96
Application-controlled demand paging for out-of-core visualization
VIS '97 Proceedings of the 8th conference on Visualization '97
I/O optimal isosurface extraction (extended abstract)
VIS '97 Proceedings of the 8th conference on Visualization '97
Towards efficient visualization support for single-block and multi-block datasets
VIS '97 Proceedings of the 8th conference on Visualization '97
Contour trees and small seed sets for isosurface traversal
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Extracting iso-valued features in 4-dimensional scalar fields
VVS '98 Proceedings of the 1998 IEEE symposium on Volume visualization
Isosurface extraction in time-varying fields using a temporal hierarchical index tree
Proceedings of the conference on Visualization '98
Interactive out-of-core isosurface extraction
Proceedings of the conference on Visualization '98
Interactive ray tracing for isosurface rendering
Proceedings of the conference on Visualization '98
High quality rendering of attributed volume data
Proceedings of the conference on Visualization '98
Production visualization for the ASCI one TeraFLOPS machine
Proceedings of the conference on Visualization '98
Three-dimensional visualization of microstructures
Proceedings of the conference on Visualization '98
Isosurface extraction in time-varying fields using a temporal branch-on-need tree (T-BON)
VIS '99 Proceedings of the conference on Visualization '99: celebrating ten years
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
Interactive Ray Tracing for Volume Visualization
IEEE Transactions on Visualization and Computer Graphics
Marching through the Visible Man
VIS '95 Proceedings of the 6th conference on Visualization '95
PVG '01 Proceedings of the IEEE 2001 symposium on parallel and large-data visualization and graphics
Interactive ray tracing of time varying data
EGPGV '02 Proceedings of the Fourth Eurographics Workshop on Parallel Graphics and Visualization
A memory insensitive technique for large model simplification
Proceedings of the conference on Visualization '01
Out-Of-Core Rendering of Large, Unstructured Grids
IEEE Computer Graphics and Applications
Adaptive Extraction of Time-Varying Isosurfaces
IEEE Transactions on Visualization and Computer Graphics
Big Wins with Small Application-Aware Caches
Proceedings of the 2004 ACM/IEEE conference on Supercomputing
Visibility-Based Prefetching for Interactive Out-Of-Core Rendering
PVG '03 Proceedings of the 2003 IEEE Symposium on Parallel and Large-Data Visualization and Graphics
Out-of-Core Isosurface Extraction of Time-Varying Fields over Irregular Grids
Proceedings of the 14th IEEE Visualization 2003 (VIS'03)
Scalable Data Servers for Large Multivariate Volume Visualization
IEEE Transactions on Visualization and Computer Graphics
Out-of-Core segmentation by deformable models
WILF'03 Proceedings of the 5th international conference on Fuzzy Logic and Applications
Knowledge-based out-of-core algorithms for data management in visualization
EUROVIS'06 Proceedings of the Eighth Joint Eurographics / IEEE VGTC conference on Visualization
| Hi-index | 0.00 |
For large time-varying data sets, memory and disk limitations can lower the performace of visualization applications. Algorithms and data structures must be explicitly designed to handle these data sets in order to achieve more interactive rates. The Temporal Branch-on-Need Octree (T-BON) extends the three-dimensional branch-on-need octree for time-varying isosurface extraction. This data structure minimizes the impact of the I/O bottleneck by reading from disk only those portions of the search structure and data necessary to construct the current isosurface. By performing a minimum of I/O and exploiting the hierarchical memory found in modern CPUs, the T-BON algorithm achieves high performance isosurface extraction in time-varying fields. This paper extends earlier work on the T-BON data structure by including techniques for better memory utilization, out-of-core isosurface extraction, and support for nonrectilinear grids. Results from testing the T-BON algorithm on large data sets show that its performance is similar to that of the three-dimensional branch-on-need octree for static data sets while providing substantial advantages for time-varying fields.