Running the line: Linedrawing using runs and runs of runs
Stephenson, Peter, and Litow, Bruce (2001) Running the line: Linedrawing using runs and runs of runs. Computers and Graphics, 25 (4). pp. 681-690.
PDF (Published Version )
- Published Version
Restricted to Repository staff only
The efficiency of linedrawing algorithms underwrites the performance of many rendering and visualisation systems. Therefore to significantly improve the process of linedrawing, techniques have been developed to draw the line not pixel by pixel but by using higher order primitives such as runs and run length slices. In this paper we present a linedrawing algorithm based on runs of runs, which is the next step in this progression. We will also discuss a number of special cases in the structure of runs and runs of runs within the line that can be used to short circuit the drawing process. These special cases can be used to help counter a common criticism that run-based techniques are less applicable for very short lines. In fact we will argue that the use of higher order primitives provides additional structural information that can be used to accelerate secondary processes within the graphics system, such as within the raster memory management.
|Item Type:||Article (Refereed Research - C1)|
|Keywords:||curve; surface; solid; line and curve generation; object representations|
|Date Deposited:||14 Aug 2012 06:58|
|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 > 8902 Computer Software and Services > 890205 Information Processing Services (incl. Data Entry and Capture) @ 100%|