Why step when you can run? Iterative line digitization algorithms based on hierarchies of runs

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