Marching cubes: A high resolution 3D surface construction algorithm
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Interactive ray tracing for isosurface rendering
Proceedings of the conference on Visualization '98
A new object-order ray-casting algorithm
Proceedings of the conference on Visualization '02
Interactive Ray Tracing for Volume Visualization
IEEE Transactions on Visualization and Computer Graphics
The asymptotic decider: resolving the ambiguity in marching cubes
VIS '91 Proceedings of the 2nd conference on Visualization '91
Faster Isosurface Ray Tracing Using Implicit KD-Trees
IEEE Transactions on Visualization and Computer Graphics
Distributed Interactive Ray Tracing for Large Volume Visualization
PVG '03 Proceedings of the 2003 IEEE Symposium on Parallel and Large-Data Visualization and Graphics
Low-complexity maximum intensity projection
ACM Transactions on Graphics (TOG)
Memory-savvy distributed interactive ray tracing
EG PGV'04 Proceedings of the 5th Eurographics conference on Parallel Graphics and Visualization
Using an implicit min/max KD-tree for doing efficient terrain line of sight calculations
Proceedings of the 6th International Conference on Computer Graphics, Virtual Reality, Visualisation and Interaction in Africa
| Hi-index | 0.00 |
Many scientific data sets are 3D or 4D scalar fields, for which typically isosurface- and volume visualization methods are used to extract information. These data sets are either massively complex (e.g., seismic data sets), or steadily increasing in size due to the permanently improving resolutions of different 3D scanners (e.g., CT- and MRT-scanners) or calculation results (e.g., CFD-simulations). Only algorithms that scale well to data set complexity are suited to visualize those increasing data sets. Isosurface ray tracing and maximum intensity projection (MIP) accelerated through implicit KD-trees have a logarithmic dependency between visualization time and scene size, making them ideal algorithms for the visualization of massively complex scalar fields. Furthermore is ray tracing efficiently parallelized on the more and more commonly used shared memory machines (e.g., desktop machines with several multicore processors) and may be used to realize advanced shading effects like shadows and reflections. We introduce new optimized implicit KD-trees which allow on today's desktop computers interactive isosurfacing and MIP of data sets that are bigger than one half of the machine's main memory.