A Fast Voxel Traversal Algorithm for Ray Tracing

  title={A Fast Voxel Traversal Algorithm for Ray Tracing},
  author={John Amanatides and Andrew Woo},
A fast and simple voxel traversal algorithm through a 3D space partition is introduced. Going from one voxel to its neighbour requires only two floating point comparisons and one floating point addition. Also, multiple ray intersections with objects that are in more than one voxel are eliminated. Introduction In recent years, ray tracing has become the algorithm of choice for generating high fidelity images. Its simplicity and elegance allows one to easily model reflection, refraction and… 

Figures from this paper

Fast Ray-Tracing of Rectilinear Volume Data Using Distance Transforms

The 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, which enables fast search of intersections between rays and the interpolated surface, further improving speed of the process.

Directed Safe Zones and the Dual Extent Algorithms for Efficient Grid Traversal during Ray Tracing

This paper presents two further improve ments to the proximity clouds method called the Directed Safe Zones DSZ and the Dual Extents DEs and shows that DSZs and DEs surpass the performance of both the proxim ity clouds and SEADS implementations.

GPU Ray Tracing using Irregular Grids

A spatial index structure to accelerate ray tracing on GPUs is presented, a flat, non‐hierarchical spatial subdivision of the scene into axis aligned cells of varying size that adapts the structure to complex primitive distributions, solving the "teapot in a stadium” problem.

Fast ray-tracing of rectilinear volume data

An algorithm for direct ray tracing of rectilinear grids is presented, which enables the implementation of surface rendering with subvoxel surface detection based on local interpolation, as well as different volume rendering techniques (color compositing, re-projection, maximum intensity projection).

Higher Performance Traversal and Construction of Tree-Based Raytracing Acceleration Structures

A fully SAM-based clustering heuristic is proposed which on average produces better performing BVHs compared to original agglomerative clustering and has subquadratic computational complexity in the number of primitives, which renders it usable in practical applications.

An Efficient Parametric Algorithm for Octree Traversal

This paper introduces a new top-down parametric method for octrees related to descent, that is, the selection of a child sub-voxel from the current one based on the parameter of the ray and comprises simple comparisons.

Ray tracing optimization utilizing projective methods

Results given for the regular grid- and quadtree-based techniques illustrate that even on single-processor machines it becomes viable to ray trace complex scenes in an affordable time, and are tested with scenes containing up to one million primitives.

A Beam Tracing with Precise Antialiasing for Polyhedral Scenes

This paper presents a high quality beam tracer that provides a robust and general antialiasing for polyhedral scenes and is entirely compatible with the usual improvements of classical ray tracing (spatial subdivisions or hierarchical bounding volumes).

Ray Tracing Optimization Utilizing Projective

New techniques for speeding up the ray tracing algorithm are presented, utilizing bounding rectangular extents around the primitives constituting the scene, which can be beneficial for many diferent types of primitives to be ray traced.

Ray Traversal for Incremental Voxel Colouring

This work has involved investigating the use of ray traversal as an efficient alternative to Generalised Voxel Colouring, and has developed two main approaches along this line, Ray Images and Ray Buckets.



Space subdivision for fast ray tracing

  • A. Glassner
  • Computer Science
    IEEE Computer Graphics and Applications
  • 1984
An algorithm is described that speeds up ray-tracing techniques by reducing the number of time-consuming object-ray intersection calculations that have to be made. The algorithm is based on

Accelerated Ray Tracing

This paper proposes algorithms for dealing with two essential problems encountered in generating continuous-tone images by the ray tracing method: speed and aliasing and proposes a scheme based on the coherency of an auxiliary data structure imposed on the original object domain.

ARTS: Accelerated Ray-Tracing System

After investigating both simple spatial enumeration and a hybrid octree approach, 3DDDA is developed, a 3D line generator for efficient traversing of both structures and provides an order of magnitude improvement in processing speed compared to other known ray-tracing methods.

A 3-dimensional representation for fast rendering of complex scenes

This paper describes a method whereby the object space is represented entirely by a hierarchical data structure consisting of bounding volumes, with no other form of representation, which allows the visible surface rendering to be performed simply and efficiently.

Improved Computational Methods for Ray Tracing

Algorithmic procedures that have been implemented to reduce the computational expense of producing ray-traced images are described and examples that indicate the efficiency of these techniques for a variety of representative environments are presented.

On ray tracing parametric surfaces

  • Dan Toth
  • Mathematics, Computer Science
    SIGGRAPH '85
  • 1985
The results are presented in terms of solving a general nonlinear system of equations f(x)= 0, and thus can be extended to a large class of problems which arise in computer graphics.

An improved illumination model for shaded display

Consideration of all of these factors allows the shader to accurately simulate true reflection, shadows, and refraction, as well as the effects simulated by conventional shaders.

An improved illumination model for shaded display

Consideration of all of these factors allows the shader to accurately simulate true reflection, shadows, and refraction as well as the effects simulated by conventional shaders.

The Light Buffer: A Shadow-Testing Accelerator

A new method to reduce shadow testing time during ray tracing is presented, which involves generating light buffers, each of which partition the environment with respect to an individual light source.

Multiprocessor Ray Tracing

A multiprocessor algorithm for ray tracing with cubic and square array of processors is described and it is found that a square network of processors generally performs better than a cubic network.