ARTSccelerated ray-tracing system
IEEE Computer Graphics and Applications
Distance transformations in digital images
Computer Vision, Graphics, and Image Processing
Marching cubes: A high resolution 3D surface construction algorithm
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
Efficient algorithms for 3D scan-conversion of parametric curves, surfaces, and volumes
SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
A Ray tracing algorithm for progressive radiosity
SIGGRAPH '89 Proceedings of the 16th annual conference on Computer graphics and interactive techniques
Efficient ray tracing of volume data
ACM Transactions on Graphics (TOG)
VVS '94 Proceedings of the 1994 symposium on Volume visualization
Proximity clouds—an acceleration technique for 3D grid traversal
The Visual Computer: International Journal of Computer Graphics
Fast ray-tracing of rectilinear volume data
Proceedings of the Eurographics workshop on Virtual environments and scientific visualization '96
High quality rendering of attributed volume data
Proceedings of the conference on Visualization '98
Nonlinear filtering of magnetic resonance tomograms by geometry-driven diffusion
Machine Vision and Applications
Frequency Analysis of Gradient Estimators in Volume Rendering
IEEE Transactions on Visualization and Computer Graphics
Evaluation and Design of Filters Using a Taylor Series Expansion
IEEE Transactions on Visualization and Computer Graphics
Alias-Free Voxelization of Geometric Objects
IEEE Transactions on Visualization and Computer Graphics
IEEE Computer Graphics and Applications
IEEE Computer Graphics and Applications
Computer
Optimal filter design for volume reconstruction and visualization
VIS '93 Proceedings of the 4th conference on Visualization '93
Accelerating volume animation by space-leaping
VIS '93 Proceedings of the 4th conference on Visualization '93
An evaluation of reconstruction filters for volume rendering
VIS '94 Proceedings of the conference on Visualization '94
Fast surface rendering from raster data by voxel traversal using chessboard distance
VIS '94 Proceedings of the conference on Visualization '94
Fast and reliable space leaping for interactive volume rendering
Proceedings of the conference on Visualization '02
Proceedings of the conference on Visualization '02
IEEE Transactions on Pattern Analysis and Machine Intelligence
Signed Distance Transform Using Graphics Hardware
Proceedings of the 14th IEEE Visualization 2003 (VIS'03)
IEEE Transactions on Visualization and Computer Graphics
Journal of Parallel and Distributed Computing
2D Euclidean distance transform algorithms: A comparative survey
ACM Computing Surveys (CSUR)
A Half-Skewed Octree for Volume Ray Casting
IEICE - Transactions on Information and Systems
Bidirectional distancemap for efficient volume ray casting
ISCIS'06 Proceedings of the 21st international conference on Computer and Information Sciences
Hierarchical σ-octree for visualization of ultrasound datasets
FSKD'06 Proceedings of the Third international conference on Fuzzy Systems and Knowledge Discovery
A noise-insensitive hierarchical min-max octree for visualization of ultrasound datasets
CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part I
Application of visualization in virtual endoscopy system
Transactions on Edutainment III
EG PGV'06 Proceedings of the 6th Eurographics conference on Parallel Graphics and Visualization
Hybrid distance field computation
VG'01 Proceedings of the 2001 Eurographics conference on Volume Graphics
EuroVis'10 Proceedings of the 12th Eurographics / IEEE - VGTC conference on Visualization
| Hi-index | 0.00 |
This paper discusses and experimentally compares distance-based acceleration algorithms for ray-tracing of volumetric data with an emphasis on the Chessboard Distance (CD) voxel traversal. The acceleration of this class of algorithms is achieved by skipping empty macro regions, which are defined for each background voxel of the volume. Background voxels are labeled in a preprocessing phase by a value, defining the macro region size, which is equal to the voxel distance to the nearest foreground voxel. The CD algorithm exploits the chessboard distance and defines the ray as a nonuniform sequence of samples positioned at voxel faces. This feature assures that no foreground voxels are missed during the scene traversal. Further, due to parallelepipedal shape of the macro region, it supports accelerated visualization of cubic, regular, and rectilinear grids. The CD algorithm is suitable for all modifications of the ray tracing/ray casting techniques being used in volume visualization and volume graphics. However, when used for rendering based on local surface interpolation, it also enables fast search of intersections between rays and the interpolated surface, further improving speed of the process.