|
Circle generating Algorithm,
Bresenham Circle Algorithm,
Computer Graphics 1.INPUT RADIUS R, AND CENTRE (H,K) X=0 Y=R D=3-2*R 2. WHILE X<=Y COMPUTE LOCATION OF NEXT PIXEL 3. IF(D<0) D=D+4X+6 X++ IF D>0 THEN D=D+4(X-Y)+10 X++ Y-- 4. PLOT 8 POINT (X,Y) W.R.T CENTRE(H,K) AT CURRENT(X,.Y) COORDINATES 5. GOTO STEP 2 6. STOP |
|||