Marching cubes: A high resolution 3D surface construction algorithm
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
A survey of algorithms for volume visualization
ACM SIGGRAPH Computer Graphics
Scalable parallel volume raycasting for nonrectilinear computational grids
PRS '93 Proceedings of the 1993 symposium on Parallel rendering
Multiresolution modeling and visualization of volume data based on simplicial complexes
VVS '94 Proceedings of the 1994 symposium on Volume visualization
Fast rendering of irregular grids
Proceedings of the 1996 symposium on Volume visualization
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
Hardware assisted volume rendering of unstructured grids by incremental slicing
Proceedings of the 1996 symposium on Volume visualization
Proceedings of the 7th conference on Visualization '96
Volume thinning for automatic isosurface propagation
Proceedings of the 7th conference on Visualization '96
The challenges of visualizing and modeling environmental data
Proceedings of the 7th conference on Visualization '96
Tracking scalar features in unstructured datasets
Proceedings of the conference on Visualization '98
Hardware-software-balanced resampling for the interactive visualization of unstructured grids
Proceedings of the conference on Visualization '01
Automatic Isosurface Propagation Using an Extrema Graph and Sorted Boundary Cell Lists
IEEE Transactions on Visualization and Computer Graphics
The Lazy Sweep Ray Casting Algorithm for Rendering Irregular Grids
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
Fast Isosurface Generation Using the Volume Thinning Algorithm
IEEE Transactions on Visualization and Computer Graphics
Fast Isosurface Generation Using the Cell-Edge Centered Propagation Algorithm
ISHPC '00 Proceedings of the Third International Symposium on High Performance Computing
Database Support for Multisource Multiresolution Scientific Data
SOFSEM '02 Proceedings of the 29th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Simple, Fast, and Robust Ray Casting of Irregular Grids
Dagstuhl '97, Scientific Visualization
Parallel ray tracing on a chip
Practical parallel rendering
Multi-valued volumetric visualization
VIS '91 Proceedings of the 2nd conference on Visualization '91
Interactive splatting of nonrectilinear volumes
VIS '92 Proceedings of the 3rd conference on Visualization '92
Isosurface generation by using extrema graphs
VIS '94 Proceedings of the conference on Visualization '94
Interactive ray tracing for volume visualization
SIGGRAPH '05 ACM SIGGRAPH 2005 Courses
Hi-index | 0.00 |
A taxonomy of computational grids used in scientific and engineering practice is presented and a technique for cutting them by, and displaying data on, 2D surfaces is developed. When sliced by a surface, these grids give rise to a graph G(C, F) where C, the nodes, are the intersected cells and F, the arcs, are their connectivity across faces. Starting from any cell known to be intersected by the surface (a seed), G is traversed breadth-first and is constructed locally on the fly, that is, only the spreading "front" explicitly exists at any time. Only sliced cells are visited, shared computed values such as edge intersections are passed to neighbors, and most of the geometric work is done via table lookup. A seed cell is found by fence-hopping from any cell to a distinguished point on the surface.This means of slicing grids is then utilized in an effective visualization tool. Concentrating on planar surfaces, local coordinate systems are defined for constructing clipping windows and linear transformations within the planes which further reduces display time and allows effects such as zooming within the windows. Several of these planar windows are then organized into various objects, called probes, that can exploit the mind's "retinal memory" when repeatedly swept through amorphous data.