Scribd Logo
Upload

Welcome to Scribd!

  • Koopman 87 A

    Uploaded by

    Swapnil Deshmukh
    17 views5 pages
    This article will show you how to draw a straight line on almost any graphics display. This capability is not included in many Forth implementations and ROM support programs. The exact number of pixels on your computer's display screen is hardwaredependent.

    Original Description:

    Original Title

    koopman87a

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This article will show you how to draw a straight line on almost any graphics display. This capability is not included in many Forth implementations and ROM support programs. The exact number of pixels on your computer's display screen is hardwaredependent.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    17 views5 pages

    Koopman 87 A

    Uploaded by

    Swapnil Deshmukh
    This article will show you how to draw a straight line on almost any graphics display. This capability is not included in many Forth implementations and ROM support programs. The exact number of pixels on your computer's display screen is hardwaredependent.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 5
    -Bresenham Line-Drawing Algorithm Phil Koopman, Jr. North Kingstown, Rhode Island ‘The task of drawing a straight line on a graphics screen is a fundamen- tal building block for most computer graphics applications. Unfortunately, this capability is not included in many Forth implementations and, for that matter, is not included in the ROM support programs for many personal computers. This article will show you how to draw lines on almost any graphics display, and gives complete listings in MVP-FORTH. The CRT Display Layout First, let’s establish some conven- tions. I will assume that the graphics display on your computer is addressed. using (X,Y) Cartesian coordinate pairs, where X and Y are both non-negative integers (see Figure One). The point (0,0) — also called the origin — is the upper-left corner of the computer screen, Each addressable point on the screen is called a pixel (short for “‘pic- ture element”). The X coordinates represent columns of pixels (horizontal distance from the origin), and the Y coordinates represent rows of pixels (vertical distance from the origin). The exact number of pixels on your computer's display screen is hardware- dependent. However, some representa- tive values are: 320'x 200 pixels (320 horizontal and 200 vertical pixels) for a PC-style, four-color color graphics adapter (CGA) display; 640 x 200 pixels for a PC-style, two-color CGA display; and 640 x 350 pixels for a PC- style sixteen-color enhanced graphics adapter (EGA) display. The mechanics of setting the graphics display mode desired and plotting a single point on the display are hardware-dependent, and will be left to the user to determine. Screens 3 and 4 of the accompanying listing contain all the machine-specific primitives for PCs and clones with compatible BIOS ROM s. They are formatted to use the public-domain 8088 assembler cited!. These screens will obviously have to be modified for use on other machines. SCREEN 43 (O\ *PC* COMPATIBLE EGA, CGA, AND TEXT HODES 1 HEX” \ Machine specific =" change for your machine!! 2 CODE SET-CGA-MODE. (>) \ Set mode and clear screen 3 ax, #0004 MoV 10 Int \ 320'x 200 in 3 colors, 4 NEXT gMP__ END-cope 5 CODE SET-CGA-HIRES-MODE ( ->) — \ Set mode and clear screen 5 AK, #0006 MOV 10 INT \ 640 x 200 in 2 colors 7 NEXT JMP_ END-CODE 8 CODE SET-EGA-NODE (=>) \ Set mode and clear screen 9 AK, #0010 Mov 10 iNT \ 640. x 350 in 16 colors 10 NEXT JMP—-END-cope an 12 Cope SeT-TExT-MODE ( -> ) \ 80 column text 33 ax, #0003 Mov 10 INT 14 NEXT JMPEND-CODE 15 DECIMAL SCREEN 14 0 '\ "PC™ COMPATIBLE POINT PLOT FOR EGA AND CGA 1 HEX" \ Machine specific - change for machine! ! 2 \ Mote that fancier direct screen access assembly language 3.\ programming can *SIGNIFICANTLY* speed up point plotting 4\ at the cost of loss of generality. 5 § CODE PLOT-POINT ( X ¥ COLOR -> ) \ Plot a single point 7 AX POP DX POP Cx POP BX , BX KOR ( page 0 for EGA ) 8 AH, boc MOV 10 INT 9 NEXT SMP END-coDE 20 LL DECIMAL 12 \ XMAX,YWAX delimit screen boundaries 13 319 Constant ymax \Change to 639 for EGA or CGA/HIRES 414 199 CONSTANT YMAX —\ Change to 349 for EGA 15 4 CONSTANT #COLORS \ Change to 16 for EGA , 2 for CGA/HIRES SCREEN #5 0'\ VARIABLE DECLARATIONS, MOVE-CURSOR, SPECIAL BRESENHAM POINT 1 DECIMAL 2 VARIABLE XNOW \ (XNOW,YNOW) is current cursor location 3 VARIABLE YNOW \ (0,0) is top left corner of CRT 4 VARIABLE COLOR \ current Line draw color 5 "1 coLoR 6 \ Variables per Foley & Van Dam, Fund. of ICAD, Ist ed. p 435. 7 VARIABLE INCRI VARIABLE INCR2 8 VARIABLE Dx VARIABLE DY 3 10: MOVE-CURSOR (x ¥ => ) \ Move cursor location before a draw 11" Yow 1 xNOW 1 32: por (x ¥ =>) \ Point plot using COLOR variable 13 | COLOR e@ PLOT-PoINT ; 14: BePOINT (x ¥ DELTA'=> ) \ For Bresenham line drawing use 15° OR DUP POINT R> c oe} 2 Volume Vi, No.6 SCREEN 46 ‘0 \ BRESENHAM LINE DRAW PRIMITIVES +X *¥ -X -¥ 1 DECIMAL, 2 eX ( X YA DELTA -> x2 ¥2 DELTA ) 3/ "Rori+ ROT ROT 4 5S: -X (x2 Yi DELTA => x2 ¥2 DELTA) § © Ror i= Rot ror; Bs +¥ (x1 ¥1 DELTA => x2 ¥2 DELTA ) 9 | ‘SWAP 1+ SWAP > 10 11 + -¥ (x1 Yi DELTA -> x2 ¥2 DELTA ) 12° SWAP 1- SWAP; 3 14 15 SCREEN 47. (0 \ BRESENHAM LINE FOR 0 ¢ SLOPE < 1 1 DECIMAL \ Assume DX and DY are already set up 2: LINEOcMcL —( NEWX NEWY -> ) 3 ‘bye 2* rncri! py @ pxe@- 2* INcR2 1 4 (Pick min x) OVER XNOW @ > 5 Tr. ( current cursor at min x ) DDROP XNOW @ YNOW @ THEN 6 DUP POINT 7 (Compute D) INCRL @ ox @- — \ Stack: ( x ¥ DELTA 8 pre ODO puUP oc 3 we (D0) * B-POINT INCRI @ + 10 ELSE (>= 0) +X +¥ BOPOINT INCR2 @ + THEN 11 Loop. 12 DROP DROP ; 43 14 15 SCREEN 48 ‘0/\ BRESENHAM LINE FOR 1 <= SLOPE < INFINITY 1 DECIMAL —\ Assume DX and DY are already set up 2: LINEL&NCZ —( NEWX NEWY => ) Dx.@ 2* INCRI! Dx@ pby@- 2* (Pick min y ) DUP YNOW @ > IP. ( current cursor at min y ) DDROP XNOW @ YNOW @ THEN 3 IWCR2 1 4 5 § nouP rorwt 8 9 {Compute D) INcRL @ Dy @- — \ Stack: ( X ¥ DELTA -. Dye 0 D0 DUP oc (p< 0) 7 B-POINT ICRI @ + 20 ELSE (D>=0) +X +Y B-POINT INCR2 @ + THEN 11 Loop. 12 DROP DDROP + a3 14 a5 SCREEN 19 \ BRESENHAM LINE FOR -1 < SLOPE < 0 Straightforward Line-Drawing Algorithms Now that we can assume the availa- bility of a point-plotting word, how can we draw lines? Horizontal and vertical lines are relatively straightfor- ward, For example: +: HORIZONTAL-TEST 1000 Do (-) 140 POINT LOOP shows that horizontal lines are drawn by merely incrementing an X value for a constant Y value. Similarly, forty- five-degree lines may be drawn by using a word that simultaneously incre- ments both X and Y values, such as: :DIAGONALTEST (— 10000 IPONT LOOP But what about lines that are in- between? A line which spans twice as many X points as Y points would be drawn by: ay (--) © 100000 DUP 1 POINT 1+ DUP IPOINT1+ LOOP DROP; For a generalized line-drawing word with a slope between zero and one (meaning that the X distance of the line is greater than the Y distance, and that both distances are drawn from smaller to larger numbers), we would have: :GENERALLINE (XI YI X2 Y2 --) ‘SWAP 4 PICK - SWAP 1 DECIMAL" Assume Dx and DY are already set up 2: LINE-16HcOUNEWX NEWY -> 3PIK- >A >R 100° A> A> 3° “bre “25 awert 1 Dy e@ DKe@- 2% INCR2 # 4 CPick min x) OVER XNOW @ > tL AO 5 IP. (current cursor at min x ) DDROP XNOW @ YNOW @ THEN DO 3PICK 3PICK 100/ POINT 6 — pouP poINr. 7 (Compute D) INCRL @ DX @- —\ Stack: (XY DELTA ~ een 3 px eolbo up, "oc ; ROT 1+ SWAPROT LOOP wots +X BePOINT —INCRI @ + 20 ELSE (D >= 0) +X -Y BePOINT —INCR2 © + THEN coe see AC Cm 11 Lo00P. 12 DROP DoROP + The above word takes two (X,Y) co- 14 ordinate pairs as an input, and scales all 15 Y values by 100 to allow for non-integer increments of Y. While this line-drawing algorithm is conceptually straightfor- Yorune vi no8 7% ‘Sample GODSEYE output. ward, it does require a lot of arith- metic. Even if clever scaling factors were chosen to replace most multiplies and divides with shifts and byte-moves, the initial division of the difference between XI and X2 (sometimes called ‘delta X” or just plain “DX”) by the ference between Y1 and Y2 (“DY”) is unavoidable. Another problem is that sixteen-bit scaled integers are not \ig enough for use on high-resolution screens. In this example, lines that span more than 100 pixels horizontally are improperly drawn. The Bresenham Algorithm The Bresenham line-drawing algo- rithm? requires only sixteen-bit integers with addition, subtraction and multi- plication by two (shift left) to draw ines. Instead of a scaled, non-integer ¥ value, the algorithm shown on screen 7 uses the error accumulation term DELTA and integer X and Y values. For lines with a slope between zero and ‘one, the algorithm increments the X value for each point, and increments the ¥ value only if the DELTA value is, negative. If DELTA is negative, a posi- tive value of DY is added to form the new DELTA value. If DELTA is positive, a negative value based on both DX and DY is used to form a new DELTA value. Of course, slight variations of this algorithm are needed to account for lines with slopes that are not between zero and one. Screens $ through 13 contain a complete Bresenham line- drawing vocabulary for all line slopes. Horizontal and vertical lines are treat- ed as special cases for greater speed and simplicity. The vocabulary for using this draw- ing package is: SET-CoAMODE = (—-) Places the display in graphics mode. This word may be redefined or renamed as appropriate for your computer. SET-TEXT-MODE — ( --) Returns the display to an eighty-column text mode. This word may be redefined or renamed as appropriate for your computer. PLOT-POINT (X ¥ color --) Plots a single point on the graphics sereen. This word may be redefined as appropriate for your computer. 7 SCREEN 410 ‘0\ BRESENHAM LINE FOR ~INPINITY < SLOPE < ~1 1 DECIMAL |\ Assune Dx and DY are already set up 2: LINECZMC-1_( NEWX NERY > ) 3° pxe 2" Incr tT Dx @ py @- 2* INCR2 1 4 (Pick min yy} DUP Yow € > 5 IP. ( current cureor at min y ) DDROP XNOW @ YNOW @ THEN & pvp PorNT 7 (Compute D) INCRL @ DY@- | \ Stack: (x ¥ DELTA 8 pre 000 DUP ox 9 ro (p< 0) ” B-POINT INCRL @ + 10 BLSE (>= 0) "Xx B-POINT INCR2 @ + THEN 11 Loop 12 DROP DDROP ; 3 4 a5 SCREEN #11 ‘O\ LINE POR SLOPE = INFINITY ( Vertical ) 1 DECIMAL \ Assume DX and DY are already set up 2: EINEZ ( NEW NEWY => ) 3° “CPick min y ) “DUP iow @ > 4 IF. ( current cursor at min y ) DROP XNOW @ YNOW @ THEN 5 poUP PorNT 0 ( dumay DELTA value ) 6 bye 00 +y BHPOINT LOOP 7 DROP DDROP + 8 9 10 aL 2 3 14 15 ‘SCREEN #12 ‘0.\ LINE POR SLOPE = 0 ( Horizontal ) 1 DECIMAL \ Assume Dx and Dy are already set up 2: MINEO ( NEWK MEWY —> ) 3° “CPick minx) OVER XNOW @ > ‘ IP. (current cursor at sin x) DOROP XNOW @ YHOW @ THEN 5 vpuP Point 0. ( dummy DELTA value ) 6 bre obo *x | BePOINT LOOP é 7 DROP DDROP FEATURES 8 —FORTH-79 Standard Sub-Set 3 pees 0 030 fates Supports FORTH and machine 2 Code interupt handlers a —Syster timekeeping maintains iu tame and date with leap $ year correction Supports ROMbased sel SCREEN #23 Starting appiications O\ BRESENHAM PROLOGUE & CALLING ROUTINE 1 DECIMAL, 2: LINE ( xNEW YEW -> ) 3. “Dour (U-Extra copy used for final MOVE-CURSOR ) cost {OVER yvonne’ * “DEP ABS: ox 1 "Oven, "vaow €\= DUP ABS. DY 1 130 page manvsl —$ 30.00 YOR 0< ( Determine if signs are different ) PRM ett ranuai—$ 100.00 6 ove IF Dx @ IF” ( Not horizontal or vertical ) 8K EPROM wath $4 7 be { Negative slope ) , Posage pala in Noth America 8 Dx @ py €. > IP LINE-16MCO ELSE LINE-Z IP LINEOCNCL ELSE LINEL

    You might also like