# Space subdivision for fast ray tracing

@article{Glassner1984SpaceSF, title={Space subdivision for fast ray tracing}, author={Andrew S. Glassner}, journal={IEEE Computer Graphics and Applications}, year={1984}, volume={4}, pages={15-24} }

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…

## Figures, Tables, and Topics from this paper

## 714 Citations

Ray tracing complex scenes

- Computer ScienceSIGGRAPH
- 1986

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

- Mathematics, Computer ScienceThe Visual Computer
- 2005

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.

An efficient hierarchicaltraversal algorithm for ray tracing

- Computer ScienceThe Visual Computer
- 2005

A new hierarchy traversal scheme is described to reduce the number of raybounding volume intersection tests for secondary rays and a plane-sweep method is proposed to make fewer intersection checks for eye rays.

The HERO Algorithm for Ray-Tracing Octrees

- Computer ScienceAdvances in Computer Graphics Hardware
- 1989

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

- Mathematics, Computer ScienceThe Visual Computer
- 2005

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

- Computer ScienceEurographics
- 1987

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

- Mathematics, Computer ScienceJ. Intell. Robotic Syst.
- 2000

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.

ADAPTIVE VOXEL SUBDIVISION FOR RAY TRACING

- Computer Science
- 1988

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

- Computer Science
- 1996

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

- Computer ScienceProceedings. Computer Graphics International (Cat. No.98EX149)
- 1998

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.

## References

SHOWING 1-10 OF 19 REFERENCES

Ray tracing parametric patches

- Computer ScienceSIGGRAPH
- 1982

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

- Mathematics, Computer ScienceTOGS
- 1983

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

- Computer ScienceSIGGRAPH
- 1984

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

- Computer Science, MathematicsSIGGRAPH
- 1983

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

- Mathematics, Computer ScienceComput. Graph. Image Process.
- 1982

This paper presents ray casting as the methodological basis for a CAD/CAM solid modeling system and presents new methods, accompanied by sample pictures and CPU times, to meet the challenge.

An improved illumination model for shaded display

- Computer ScienceCACM
- 1980

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

- Computer Science
- 1983

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

- Mathematics, Computer ScienceComput. Graph. Image Process.
- 1982

The newly proposed data structure is a (dynamically built) array of sorted octal codes which reflects the successive octant subdivisions which represents a dramatic improvement with respect to octtrees when space complexity is considered.

Some techniques for shading machine renderings of solids

- Engineering, Computer ScienceAFIPS '68 (Spring)
- 1968

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

- Computer ScienceAFIPS '70 (Spring)
- 1970

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.