Marching cubes: A high resolution 3D surface construction algorithm
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
The input/output complexity of sorting and related problems
Communications of the ACM
Octrees for faster isosurface generation
VVS '90 Proceedings of the 1990 workshop on Volume visualization
A Sorting Classification of Parallel Rendering
IEEE Computer Graphics and Applications
Optimal isosurface extraction from irregular volume data
Proceedings of the 1996 symposium on Volume visualization
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
Interactive ray tracing for isosurface rendering
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
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
External memory techniques for isosurface extraction in scientific visualization
External memory algorithms
Scalable isosurface visualization of massive datasets on COTS clusters
PVG '01 Proceedings of the IEEE 2001 symposium on parallel and large-data visualization and graphics
PVG '01 Proceedings of the IEEE 2001 symposium on parallel and large-data visualization and graphics
Parallel and out-of-core view-dependent isocontour visualization using random data distribution
VISSYM '02 Proceedings of the symposium on Data Visualisation 2002
Chromium: a stream-processing framework for interactive rendering on clusters
Proceedings of the 29th annual conference on Computer graphics and interactive techniques
Automatic Isosurface Propagation Using an Extrema Graph and Sorted Boundary Cell Lists
IEEE Transactions on Visualization and Computer Graphics
Optimal dynamic interval management in external memory
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Massively parallel isosurface extraction
VIS '92 Proceedings of the 3rd conference on Visualization '92
Efficient Parallel Out-of-core Isosurface Extraction
PVG '03 Proceedings of the 2003 IEEE Symposium on Parallel and Large-Data Visualization and Graphics
Cache-efficient parallel isosurface extraction for shared cache multicores
EG PGV'10 Proceedings of the 10th Eurographics conference on Parallel Graphics and Visualization
Triangulating molecular surfaces on multiple GPUs
Proceedings of the 20th European MPI Users' Group Meeting
Hi-index | 0.00 |
We consider the problem of isosurface extraction and rendering for large scale time-varying data. Such data sets have been appearing at an increasing rate especially from physics-based simulations, and can range in size from hundreds of gigabytes to tens of terabytes. Isosurface extraction and rendering is one of the most widely used visualization techniques to explore and analyze such data sets. A common strategy for isosurface extraction involves the determination of the so-called active cells followed by a triangulation of these cells based on linear interpolation, and ending with a rendering of the triangular mesh. We develop a new simple indexing scheme for out-of-core processing of large scale data sets, which enables the identification of the active cells extremely quickly, using more compact indexing structure and more effective bulk data movement than previous schemes. Moreover, our scheme leads to an efficient and scalable implementation on multiprocessor environments in which each processor has access to its own local disk. In particular, our parallel algorithm provably achieves load balancing across the processors independent of the isovalue, with almost no overhead in the total amount of work relative to the sequential algorithm. We conduct a large number of experimental tests on the University of Maryland Visualization Cluster using the Richtmyer-Meshkov instability data set, and obtain results that consistently validate the efficiency and the scalability of our algorithm.