Stephenson, Peter, and Litow, Bruce (2001) Making the DDA run: two-dimensional ray traversal using runs and runs of runs. In: Proceedings of the 24th Australian Computer Science Conference. pp. 177-183. From: ACSC 2001: 24th Australasian Computer Science Conference, 29 January - 2 February 2001, Gold Coast, QLD, Australia.

PDF (Published Version) - Published Version Restricted to Repository staff only

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.

Item ID:	14594
Item Type:	Conference Item (Research - E1)
ISBN:	978-0-7695-0963-1
Keywords:	digital geometry; line digitisation; ray tracing; ray traversal; volume visualisation
Date Deposited:	21 Dec 2017 02:08
FoR Codes:	08 INFORMATION AND COMPUTING SCIENCES > 0802 Computation Theory and Mathematics > 080201 Analysis of Algorithms and Complexity @ 100%
SEO Codes:	89 INFORMATION AND COMMUNICATION SERVICES > 8999 Other Information and Communication Services > 899999 Information and Communication Services not elsewhere classified @ 100%
Downloads:	Total: 1
	More Statistics