Litow, Bruce, and Stephenson, Peter (2000) Why step when you can run? Iterative line digitization algorithms based on hierarchies of runs. IEEE Computer Graphics and Applications, 20 (6). pp. 76-84.

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

Abstract

One challenge for computer graphics and scientific visualization is to develop techniques to more effectively display and analyze the vast amounts of information we are collating, a race we are currently losing. To meet this goal, a key initiative suggests moving away from small-scale, low-resolution displays to immersive, high-fidelity systems. These environments permit higher levels of interactivity and exploration, but require more power and bandwidth than current graphics systems can deliver. The move to larger and/or higher resolution displays will place a greater emphasis on the digitization algorithms we employ for even the simplest geometrical primitives. In this tutorial, we present a technique to describe and digitize the line as a set of runs, runs of runs, runs of runs of runs, and so on, in fact, as any level of runs within the full hierarchy of runs in the digital line. The digitization algorithms we present apply to a broad range of resolutions and applications, including geometric scan conversion, ray traversal, linear mapping and interpolation.

Item ID:	12876
Item Type:	Article (Research - C1)
ISSN:	0272-1716
Date Deposited:	06 Dec 2012 04:49
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: 4
	More Statistics