Making the DDA run: two-dimensional ray traversal using runs and runs of runs

Authors:
Peter Stephenson;Bruce Litow
Affiliations:
Fraunhofer Center for Research in Computer Graphics, Providence RI;James Cook University of North Queensland, Townsville Q 4811 Australia
Venue:
ACSC '01 Proceedings of the 24th Australasian conference on Computer science
Year:
2001

Citing 3
Cited 1

ARTSccelerated ray-tracing system

IEEE Computer Graphics and Applications
A survey of ray tracing acceleration techniques

An introduction to ray tracing
Why Step When You Can Run? Iterative Line Digitization Algorithms Based On Hierarchies Of Runs

IEEE Computer Graphics and Applications

Accelerating the ray tracing of height fields

Proceedings of the 2nd international conference on Computer graphics and interactive techniques in Australasia and South East Asia

Quantified Score

Hi-index	0.00

Visualization

Abstract

Iterative algorithms based on runs and runs of runs are presented to calculate the cells of the two-dimensional lattice intersected by a line of real slope and intercept. The technique is applied to the problem of traversing a ray through a two-dimensional grid. Using runs or runs of runs provides a significant improvement in the efficiency of ray traversal for all but very short path lengths when compared to the DDA algorithm implemented using floating or fixed point arithmetic.