Space subdivision for fast ray tracing

  title={Space subdivision for fast ray tracing},
  author={Andrew S. Glassner},
  journal={IEEE Computer Graphics and Applications},
  • A. Glassner
  • Published 1 October 1984
  • Computer Science
  • IEEE Computer Graphics and Applications
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 subdividing space into an octree, associating a given voxel with only those objects whose surfaces pass through the volume of the voxel. It includes a technique for obtaining fast access to any node and a mechanism for finding the next node intersected by a ray when it has hit nothing in the current node… 

Ray tracing complex scenes

A new algorithm for speeding up ray-object intersection calculations is presented and a new hierarchy traversal algorithm is presented which is efficient in the sense that objects along the ray are queried in an efficient order.

Analysis of an algorithm for fast ray tracing using uniform space subdivision

A theoretical analysis of the algorithm used to speed upRay tracing by means of space subdivision, which shows how the space and time requirements vary with the number of objects in the scene.

The HERO Algorithm for Ray-Tracing Octrees

An algorithm is presented for rapid traversal of octree data structures, in order to enhance the speed of ray tracing for scenes of high complexity. At each level of the octree, the algorithm

Heuristics for ray tracing using space subdivision

Two heuristics for space subdivisions using bintrees are examined based on the intuition that surface area is a good estimate of intersection probability and the fact that the optimal splitting plane lies between the spatial median and the object median planes of a volume.

A Fast Voxel Traversal Algorithm for Ray Tracing

A fast and simple voxel traversal algorithm through a 3D space partition is introduced that is a variant of the DDA line algorithm and allows for simpler traversal at the expense of more voxels.

An Efficient Algorithm for Ray Tracing

A new algorithm that performs more efficient ray tracing compared to existing algorithms based on the “divide-and-conquer” technique well known from the area of lists sorting, and speeds up the intersections and light-visibility tests for the first hit.


This integration of regular and adaptive spatial subdivision methods allows images consisting of large regularly distributed objects and small dense objects to be ray traced efficiently.

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.

Object and ray coherence in the optimization of the ray tracing algorithm

The authors' proposal for ray tracing optimization is based on the combined use of object and ray coherence when tracing beams in scenes subdivided by octrees, facilitating the simultaneous tracing of rays integrated in a beam.

Fast Ray-Casting for Irregular Volumes

A fast cell traverse method for volume rendering of irregular volume datasets by using the exterior faces of cells rather than the ray as a basis for processing.



Ray tracing parametric patches

An algorithm that uses ray tracing techniques to display bivariate polynomial surface patches and may use complex coordinates for the (u, v)-parameters of the patches to make the computations more uniform.

New Techniques for Ray Tracing Procedurally Defined Objects

We present new algorithms for efficient ray tracing of three procedurally defined objects: fractal surfaces, prisms, and surfaces of revolution. The fractal surface algorithm performs recursive

Distributed ray tracing

Motion blur and depth of field calculations can be integrated with the visible surface calculations, avoiding the problems found in previous methods.

Ray tracing algebraic surfaces

This work presents a method based on a ray casting algorithm, extended to work in more than three dimensions, to produce pictures of many interesting surfaces, including the cusp catastrophe surface, and two unusually shaped quartic surfaces, Kummer's quadruple and Steiner's surface.

Ray casting for modeling solids

  • S. D. Roth
  • Computer Science
    Comput. Graph. Image Process.
  • 1982

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.

Parallel machines for computer graphics

The highly parallel machines described here operate largely without sorting, where they maintain information in sorted order or make use of already sorted information to limit communication requirements.

Linear octtrees for fast processing of three-dimensional objects

Some techniques for shading machine renderings of solids

If techniques for the automatic determination of chiaroscuro with good resolution should prove to be competitive with line drawings, and this is a possibility, machine generated photographs might replace line drawings as the principal mode of graphical communication in engineering and architecture.

An algorithm for producing half-tone computer graphics presentations with shadows and movable light sources

In the years since the introduction of SKETCHPAD an increasing number of graphics systems for line drawing have been developed, and automatic windowing, three-dimensional figures, depth cueing by intensity, and even stereo line drawing are now feasible and in some cases, available in hardware.