Making the DDA Run: Two-Dimensional Ray Traversal Using Runs and Runs of Runs

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Peter Stephenson Articles by Bruce Litow

Australasian Computer Science Conference (ACSC '01)

Gold Coast, Queensland, Australia

January 29-February 02

ISBN: 0-7695-0963-0

	ASCII Text	x
	Peter Stephenson, Bruce Litow, "Making the DDA Run: Two-Dimensional Ray Traversal Using Runs and Runs of Runs," Australasian Computer Science Conference, pp. 177, Australasian Computer Science Conference (ACSC '01), 2001.

	BibTex	x
	@article{ 10.1109/ACSC.2001.906640, author = {Peter Stephenson and Bruce Litow}, title = {Making the DDA Run: Two-Dimensional Ray Traversal Using Runs and Runs of Runs}, journal ={Australasian Computer Science Conference}, volume = {0}, year = {2001}, issn = {1530-0900}, pages = {177}, doi = {http://doi.ieeecomputersociety.org/10.1109/ACSC.2001.906640}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Australasian Computer Science Conference TI - Making the DDA Run: Two-Dimensional Ray Traversal Using Runs and Runs of Runs SN - 1530-0900 SP EP A1 - Peter Stephenson, A1 - Bruce Litow, PY - 2001 KW - Digital geometry KW - line digitisation KW - ray traversal KW - ray tracing KW - volume visualisation. VL - 0 JA - Australasian Computer Science Conference ER -

Peter Stephenson, Fraunhofer Center for Research in Computer Graphics

Bruce Litow, James Cook University of North Queensland

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ACSC.2001.906640

Iterative algorithm based on runs and runs of runs are presented to calculate the cell of the two-dimensional lattice intersected by a line of real lope 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.

Index Terms:

Digital geometry, line digitisation, ray traversal, ray tracing, volume visualisation.

Citation:

Peter Stephenson, Bruce Litow, "Making the DDA Run: Two-Dimensional Ray Traversal Using Runs and Runs of Runs," acsc, pp.177, Australasian Computer Science Conference (ACSC '01), 2001

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.