Disk Generators for a Raster Display Device

Transcription

1 University of Pennsylvania ScholarlyCommons Technical Reports (CS) Department of Computer & nformation Science Disk Generators for a Raster Display Device Norman. Badler University of Pennsylvania, badler@seas.upenn.edu Follow this and additional works at: Part of the Computer Engineering Commons, and the Computer Sciences Commons Recommed Citation Norman. Badler, "Disk Generators for a Raster Display Device", Computer Graphics and mage Processing 6(6), December University of Pennsylvania Department of Computer and nformation Science Technical Report No. MS-CS This paper is posted at ScholarlyCommons. For more information, please contact repository@pobox.upenn.edu.

2 Disk Generators for a Raster Display Device Abstract A simple modification of Horn's circle drawing procedure yields a disk generator for a class of graphic devices capable of drawing rectangular areas. Another variation produces a disk a scan-line at a time allowing it to be drawn at the refresh rate of the display. The calculations involve only additions and binary shifts. Disciplines Computer Engineering Computer Sciences Comments University of Pennsylvania Department of Computer and nformation Science Technical Report No. MS- CS This technical report is available at ScholarlyCommons:

3 Appeared in Computer Graphics and mage Processlng, 1977 UP-MS-CS DSK GENERATORS FOR A RASTER DSPLAY DEVCE Movement Project Report No. 2 Norman. Badler December 1976 vvork reported herein was supported by National Science Foundation Grants Nos. ENG and MCS l l \ i

4 ABSTRACT A simple modification of Horn's circle drawing procedure yields a disk generator for a class of graphic devices capable of drawing rectangular areas. Another variation produces a disk a scan-line at a time allowing it to be drawn at the refresh rate of the display. The calculations involve only additions and binary shifts.

5 - 2 - The problem of generating circles efficiently on a graphic display device has been discussed by Horn [1]. His circle generator can be_modified to enable a raster display to pr6duce disks, that is, "filled-in" circles. Two algorithms are presented: the first for use where the graphic commands must be transmitted over a slow communications channel and the second for generating disks a scan-line at a time at the refresh rate of the raster display. t will be shown that the first algorithm 1s optimal in the sense of requiring the fewest graphic processor commands, provided that the processor can draw rectangles as a graphic primitive. Assuming enough local intelligence in the display processor to execute programs, the second algorithm is the most efficient in time and requires a constant amount of storage indepent of the size of the disk. 1. DSK GENERATOR 1 Using Horn's notation and s = (x+~) 2 + y 2 -r 2, the following procedure generates a disk with center x 0, y 0 and radius r. diskl (x, y, r): x+r; y+o; s+-r 0 0 do until y>x s+s+2y+l if S>O then plotrects (x,y); s+s-2x+2; x+x-1 y+y+l plotrects Cx,y): y -y) 0 y 0 -x)

6 - 3 - Most of the changes are transparent. Procedure rect is the graphic command which draws a filled-in rectangle from upper left corner (first two parameters) to lower right corner (third and fourth parameters). Since each rectangle draws points in each quadrant, the outer iterations in Horn's algorithm are unnecessary. nstead of plotting each point on the circle, the loop waits until the x coordinate must be changed. change is made to x and y, the rectangle is drawn. Before the f no rectangle is to be drawn, then y is incremented and the loop continues. Stated another way, diskl plots a step function approximation to the disk boundary at each unit change in x (Figure 1). Once the pixel values on the video display are set, the "overprinting'' of the rectangles ls of no consequence. 2. DSK GENERATOR 2 By exting the step function concept 1n disk generator 1 an algorithm can be derived for producing disks one scan-line at a time so that refresh synchronization will not be lost between graphic commands. The left edge of the disk is traced from top to bottom through octants 3,4,5, and 6, each octant computation resembling the basic algorithm but having a different expression for s or a different increment for x.

7 - 4 - x+o;y+-r;s+-r+l do while y<x if s>o then do plotline (x,y) s+s+2y+2 ; y+y+l; else do x+x-1; s+s-2x+l ; do while y<o if s>o then do plotline (x,y) s+s+2y+l; y+y+l; else do x+x-1; s+s-2x; s+-r do while y<-x if s2o then do plot line (x,y) s+s+2y+l; y+y+l; else do s+s+2x+2; x+x+l; do while y"s..r i~s=x2+ (y-~) 2_r2 ~": if s$o then do plotline.<x,y) s+s+2y; y+y+l; else do s+s+2x+l; x+x+l; disk2 plotline (x,y): line (x 0 +x, y 0 +y, x 0 -x, y 0 +y) plotline

8 - 5 - For octant 3 the initialization of s is derived from s=x 2 + (y+~)2-r2= -r+\ at (x,y) = (o,-r). The fraction 1s ignored s1nce only integer values are used. The value of s is adjusted prior to decrementing x so that scan-lines will be drawn when the current x value is the last that would fall inside the disk boundary defined by s~o. Therefore an adjustment is performed initally: s=s-2x+l = -r+l at x=o. Between octants 3 and 4, the value of s 1s not changed. Since y=x, s=x2+(y+~)2-r2 = y2+(x+~) 2 -r2. Moving into octant 5, the value of s is reset because s is now adjusted after x is incremented. Scan-lines will be drawn when the current x value is the first that lies inside the disk boundary. The re-initialization is simply s=(x+~)2 +y2-r 2 = -r+\ at (x,y)=(-r,o). Again the fraction can be ignored. Between octants 5 and 6 no change in s is required. y=-x, s=(x+~)2+y2-r2 = ((-y)+~)2+(-x)2-r2 =(y-~)2+x2-r2. Since An example of the output of.disk2 appears in figure 2. f desired, clipping to the screen boundaries is easily accomplished by tests inside plotline. 3. CONCLUSONS The choice of which algorithm to use deps on the graphic configuration and the local intelligence in the display processor. f graphic commands must be sent over a slow communications channel to the raster device then diskl generates, fewer commands and would be more efficient. That is, to draw a disk of radius r requires at worst 2lr-r//2l = lr(2-/2)1 rectangles or 41r(2-l:2)l integers. (Here frl signifies the smallest integer not smaller than r). Algorithm disk2, however, must generate 2r+l lines or

9 - 0-8r+4 integers. Comparing these costs: 4 rr ( 2-/2) l <8r+4 or approximately ro.6rl< 2r+l for all positive r, a saving of more than two-thirds. Assuming that Horn's algorithm is the l:.lost efficient for generating the circle boundary points, it is easy to show that the disk can be drawn with no fewer graphic cowtand parameters than those generated by diskl, excluding the cases where the radius is only one or two. Since each rectangle accounts for "corners" 1n the edge of the disk, the use of fewer rectangles would b~ impossible. Diskl is also more efficient than a disk generator described by Fulton [2] for a plasma-panel display. nstead of drawing filled-in rectangles, Fulton draws four horizontal lines for every disk boundary point computed J.n the first octant by a method nearly identical to Horn's. n all, fr/121 values of y are calculated so that 4rr/12-1 lines are drawn. Since 2r+l<4rrlffl for r~2, extra lines are drawn near the top and bottom of the disk where several y values may be identical. This technique J.S therefore more inefficient than either diskl or disk2. Moreover, refresh synchronization cannot be maintained since the lines are not generated in the raster scan order. f the disks can be generated within the graphics processor, then disk2 is clearly superj.or. Since each scan-line 1s computed in sequence during a single refresh cycle of the raster display, the limiting factor is not the absolute number of

10 - 7 - graphic commands but the refresh rate of the display. The worst case is one disk per frame, or 60 disks per second in a video display. The only requirements of the processor are addition and multiplication (by shifting) by 2, and storage locations for x 0,y 0,r,x,y,s and the actual code. Acknowledgements. The author wishes to gratefully acknowledge the support of NSF Grants ENG75-l0535 and MCS REFERENCES l. B.K.P. Horn, Circle generators for display devices, Computer Graphics and mage Processing 5, l976, Fulton,David L., A plasma-panel interactive graphics system, Proceedings of the Society for nformation Display 15(2), 1974, pp

11 -.. X 7 y / 7 v ~7t:_ :...J---L-4- J.! L Figure 1. ~~+-~ ~--~-+~~5 ~~ ~------~--~--~4-~7 ~~+--+--~~------~--~--~~9 ~-r--+---~ r---+-~-+~, Disk generated by rectangles (in order indicated). X y ' ' i! r Figure 2. Disk generated by scan lines.