rasterization system for converting polygonal pattern data into a bit

Post on 09-Feb-2017

218 Views

Category:

Documents

0 Downloads

Preview:

Click to see full reader

TRANSCRIPT

I

Unlted States Patent [19] [11] Patent Number: 4,837,447 Pierce et al. [45] Date of Patent: Jun. 6, 1989

[54] RASTERIZATION SYSTEM FOR 4,538,232 8/1985 Koyama ....................... .. 250/492.22

CONVERTING POLYGONAL PATTERN 4,594,673 6/1986 Holly INTO A Err-MAP 1,2224‘; 122222 [75] Inventors: John L. Pierce, Hillsborough; Nick 4:635:208 1/1987 Coleby et al. . 364/491

Kanopoulos, Durham, both of NC. 4,709,231 11/1987 Sakaibara ct a1. ................. .. 340/747

[73] Assignee: Research Triangle Institute, Inc., Primary Examiner-Janice A. Howell Research Triangle Park, N_C, Assistant Examiner-7.1 Ohn A. Miller

Attorney, Agent, or Firm-Oblon, Fisher, Spivak, [211 APP1-N°-= 860,216 McClelland & Maier

[22] Filed: May 6, 1986 [57] ABSTRACT

[51] Int. Cl.4 ........... ., ................................ .. G21K 1/00 A reauime rasterization System for convert-mg plural

[52] US‘ Cl‘ _ "" " 2_50€:92'2;_250/398; polygonal pattern data into respective bits of a two-di _ 382/56’ 364/490’ 364/491’ 3256521’ mensional bit-map, wherein the respective bits of the

[58] Field of Scarf; .... 24293-38’2 bit-map and the locations thereof within the bit-map 364/ 8’ 89’ ’ 9 ’ ’ ’ 340/24,; correspond to the shapes and locations of the polygons

in a two-dimensional ?eld and wherein the bit-map is [56] References Cited divided into plural data stripes, each including plural

Us PATENT DOCUMENTS scan hnes having plural bits. The rasterization system converts the plural pattern data of a data stripe into

........................... -. plural linked data entries Such data entries ‘M43597 3/ Yas‘llda correspond to polygons intersecting the same scan line 4’14 337 4/ Bue 9w ct ' / ‘ are sequentially linked, and includes a double buffer 4,258,265 3/1981 Sun-11 ............ .. 250/4923 tt d t f t . th 1 a1 1. k d d 4,259,724 3/1981 Sugiyama . . . . . . . . . . . .. 364/491 Pa ‘Fm a a memory °‘ 5 “m5 _ e P “Y m 6 6m

4,267,456 5/1981 Hidai et aL ____ __ 250/398 entries; a processor for determining for each scan line 4,280,136 7/1931 Hidai et a1_ 250/492” the bits thereof intersected by each polygon represented 4,291,231 9/1981 Hidai et al. 250/4923 by the respective linked data entries and for producing 4,387,433 6/1983 Cardenia et al. .. 250/4922 bit-map data corresponding to the determined bits; a 4’433'334 2/1984 Berri?!" et 31' ---- -- 364/”!90 double-buffer bit-map memory coupled to the processor 49445939 4/1984 Yew ----------- " 250/4922 for storing the bit-map data for each scan line of the

52:‘: et a1‘ data stripe; and a double-buffer output register for read 4,489,241 12/1984 Matsuda 250 A921 mg out sequentlally the bit-map data stored in the bit 4,511,980 4/1985 Watanabe ....... .. 364/491 map memOrY 4,528,634 7/1985 Nakahata et al. 364/491 4,532,598 7/1985 Shibayarna et al. .............. ,. 250/398 56 Claims, 19 Drawing Sheets

SLOPES srAnr/sma smr/srw mm’. xomw mmm nav=4

| 4 PRoa/uusms: M’?

l 3 now. 0721, 1m, 0701 I2) ' 1 now. R0, (R2), 1m a) | A ACBL R3, #20, R0, 2: I4)

I a I 1 =10

' 2

I 71

I 113- xuv-lo ’ 32767 4

l)

WSORTE FA T THW 17A TA

4,837,447

X DIMENSION OF S TR/PE

_— STAGE MOVEMENT

M w A H m ,T T m

C ORRE SPONO/NG PART OF BIT-MAP 000000000 00000/1/0

Sheet 1 0f 19

RE TRA CE

oooollllo ooolllllo 00!’!0000

OO

O

MHHMMMMM

O

oil/00000

74%

1 4 m & 0 000 000

@00 @00 1

US. Patent Jun. 6, 1989

Y DIMENSION 0F STRIPE /

0000

FIG 1

00!’!0000 0001,1000 0000/’!00 oaooolloo 000000000

SCAN

Fl6.2

m M M

US. Patent Jun. 6, 1989 Sheet 2 of 19 4,837,447

( kw“. *' Mr- AX|__ ll RECTANGLE H‘ I P353235” : THAPEZO/D/ :IH IX," mgr/l W I (JV/F. W _

HI TRAPEZO/DZ Z H (X, Y) x

___W_H A (x, Y}|-__;y_.. “AX \ F I 6 . 3

3 d 2

HOST PATTERN _/ 4 COMPUTER MEMORY

% SPEC/AL PURPOSE N5 PROCESSOR

l

BIT MAP “,6

FIG I, MEMORY

[,7 BLANK/N6‘ TO THE REGISTER _~ BEAM

US. Patent Jun. 6, 1989 Sheet 4 0f 19 4,837,447

Q61 m2; i £222. XJ _ n u in E

_ I

x TIL. “IL “.IL _ _ _ _ “Ill! _

I _ _ _ _ $55. rIL rIL rII.

_ _ _ _ | _

58: rIIu rII“ _.II_

No Em.

2st Sit .Gtt ism .QQR ma?a macaw“. E

Tu MI: n.

.IIIIL VIII is- g.“ g %%%$ _ m _ * h

22: ..II_ _II._ VI _ _ _

2%.. _r-L_ .rL FL.

ma?a.

wwmmuumi mzgmi Rut Q3. mu E m. Tu whmmwmtm @255‘ 5 ~25,

N we?‘ i I: i

_ _

_ _ _ .lllll. __ _

u __ _

rII“ .FIL. a3 amt E §E :Et mzqumw WEEK“, REE 3 g ii. iii

I I I l____

US. Patent Jun. 6, 1989 Sheet 5 of 19 4,837,447

FIELDS (ALL 32 BIT WORDS)

3/ O

POINTER OR XM/N BOTTOM ' TOP T OR AND BOTTOM SLOPES

STOP IS TAR T CURRENT START AND STOP (BIT ADDRESSES) START ORLG/NAL START AND STOP (BIT ADDRESSES)

REPEA T AND XMAX XOR/GIN INTERVAL

EXTENDED TABLE FORMAT

Y1’ AY

\ _[_ TOP $LOPE= -W—2 A Y2 BOTTOM 5L0PE= @

_1_ w ORIG/NAL START= Y

H ORIGINAL sr0P= Y + H

xomaw = x

M XMAX = x + w

(x, Y) 1 /

FI6.9

US. Patent Jun. 6, 1989 Sheet 6 0f 19 4,837,447

5 TA TLC TABLE L/S T HEAD (STLH)

ti-'-']|||||1L?|||||] )\ 0 f A

IQL'PIIIIIIW l’vJIIIIULJLLLLU

;—"EEE|]:U:| 7x

'-—-"llllll1l_llllllll 1 4

1X

—~FPIIIIIH ‘?||||||]|."||||$ 32767 \ f if f J

STAT/C TABLE 32768 LINKED LISTS

ACTIVE TABLE L/S T HEAD (A T LH/

EF-"IIIIHI :lllll? lf'lllli ¥ ACE-(TABLE J

l LINKED LIST

FIG. 10

US. Patent Jun. 6, 1989 Sheet 7 of 19 4,837,447

T/S TOP

AL

PROGRAM STEPS: 2f‘ MOVL (R0), R/ (I) (I)

MOVL (R2), [RI], (R01 (2) MOVL R0, (R2), [RI] (3) ACBL R3, #28, R0, 2$ (4)

FI6.11 UNSOR TED PA TTERN DA TA

US. Patent Jun. 6, 1989 Sheet 8 0f 19 44,837,447

POINTER = A

80/? TED FIG. 12 5 TA 776‘ TABLE DA TA

US. Patent Jun. 6, 1989 Sheet 9 of 19 4,837,447

TAPE /0 /600 bp/', 45 lbs, 2048 Me rec0rds,250 Iealures @ 20 by/es each = 0.9.9sec/da/a stripe

20 30.) \

GENERAL CONVERT [BE-5 FOHMA 7"‘ OJ5SEC MEMORY f PURPOSE SORT’ 0.02350

COMPUTER 0J7sec/ (VAX) dala slr/pe

40 UN/BUS 3/” = IMBYTE/

$60 DISK DRIVE (IE/5) 2500 x 28 by/es = 70,000 bytes of lab/e data

8 x 70 000 by/es @ WOW/es = _______-__ __ ___ ____ /o Mbyies/sec = 0.056

I. OMbyIes/sec ‘ sec/8 data stapes

aQmc/M” 8 ------------ " / PROCESSOR

"We LOCAL MEMORIES 100v

32 24

25 /7 WHITE 8 ,6 ' DIRECT/0N

7 l5 6 l4

SEGMENT ‘ 5 l3

STRIPE 4 ,2

3 ll 2 /0

DA TA STRIPE / 9

-_... WRITE DIRECT/0N

FI6.16

US. Patent Jun. 6, 1989 Sheet 11 of 19 4,837,447

RRoM T HOST —/ COMPUTER _D—\ /00 I00 ?/ /

MEMORY MEMORY

MEMORY BANK I {"SELECTOR W200

MEMORY ___R,_ ENABLE M ‘ PROCESSOR

SCAN LINE "/300

4/0 I BIT PRODUCER

r-"— DMA-W

420 ADDRESS DISTRIBUTION

DMA~R 400

fool I f 2

3 MEMORY MEMORY

437 r‘ w __J

\ _ I 32 fREG/STER

<——- MUX @Q

_|_ I \ / I 32 REGISTER

520 FIG. 15

US. Patent Jun. 6, 1989 Sheet 14 of 19 4,837,447

/ 2 n

F ——- WRIT/N6 DIRECT/0N

R 420 ’ START /

COUNTER 0 s 0

- R \ 5 -

NUMBER 1 OF CHIPS ” 440

WHEN 0R=0 DMA cows/m?

v COUNTS UP

‘ COUNTER 0 WHEN 0W

4§0 DMA COUNTER COUNTS pow/v

SYSTEM RESET

FIG. 19

US. Patent Jun. 6, 1989 Sheet 15 of 19 4,837,447

( START ) 1 ®

2”“ 1219s R” MOVE ADDRESS OF A TLH , To R0, RI, R2 M0 VL R0, R2

110m STLH, R4 (202

lNlTlALlZE saw LINE COUNT .I/N R3) T0 ZERO CLRL R3

I 203

['9 LOOKATATLH TRANSFER A TLH CONTENTS‘ T0 RI MOVL IR”, R’

A TLH CONTAIN /\

'IENO OF LIST}? NO

.YES 295 ‘

(0)

R4 POINTS TO FIRST ENTRY OF S TLH, R3 CONTAINS CURRENT SCAN LINE NO, MOVE S TLH FOR LINE [R3] INTO A TLH IROI IMOVL (R4) [R3], (ROII

206 RO —- A?

/'.e. DOES THIS LINE HAVE NO NEW EN

TRIES? IBEOL 20$}

‘ 207

1 I POINT TO FIRST ENTRY OF S TL FOR CURRENT SCAN LINE IMOVL IROI, ROI

FI6.2OA

2087 I W; OUTPUT INITIAL START/ MOVL a

- STOP FOR THIS POL YGONT (R0), [0 T0 SLBP 300 RE6

I PowT T0 NEXT STA 770 W "L TABLE ENTRY m0" R0

YESL 209 L 1 J

2/0

WAS RO —- 21. L8. END OF STA TIC

LIST? IBNEO I/SI

US. Patent Jun. 6, 1989

21/ @

2

Sheet 16 of 19

ADD SLOPES T0 5 TART/8 TOP VALUES 0F DA TA ENTRY POINTED T0 BY RI

(ADDLZ 41R”, 80?”)

4,837,447

OUTPUT AEN START/8 TOP ' VALUES T0 SLBP 300

TEST XMAX TO SEE /F ' CURRENT SCAN LINE IS THE LAST WTERSECTE BY THE POL YGON

/ 2/3

(CMPN /8(RI), R3)

22/

F16. 2012,

> 3$" XMAX . /

,var EQUAL m YES UPDA TE BA CKWARDS CURRENT SCAN LINE? ‘ POINTER

(MOVL 2/, R0) BNEO (3&1

222 END OF ,1

ACT/V5 LIST UPDA TE FORWARD (M0 VL 1'9- R/ *1‘? POINTER (RI), R/l

US. Patent Jun. 6, 1989 Sheet 17 of 19 4,837,447

2/6 /

RESET BA CKWARDS FOINrER 20$.- (R0) WITH ADDRESS OF A 7'LH

(M0 VL R2, R0}

2/? /

RESET FORWARD POINTER (RI) WITH ADDRESS OF A TLH (M0 VL R2, ?l) -

‘ /2/a SEND OSTART/OSTOP T0 SLBP 300, END OF scA/v LINE (CLRL lO-REG)

2/9 1 /

INCREMENT scA/v LINE COUNTER (R3)

220 \ AOBLEO #32767, R3, l$

scA/v LINE YES SWITCH BIT-MAR MEMORY COUNT > 32767? BANKS, PROCESS NEXT

DA TA srR/RE /

223 \

( START )

FIG. 2052

US. Patent Jun. 6, 1989

© 224 / REMOVE DA TA ENTRY [FROM ACTIVE LIST

Sheet 18 0f 19

*IMOVL (RI), (‘R011

, 225

QEO'ZRSMENT ENTRYS REPEAT I (DE-CW ,6 (RM

226' REPEA T

COUNT = 0? lie. LAST INSTANCE OF THE

POL YGON?

227 ‘/

CALCULA TE NEW XOR/GIN XOR/6W = XOR/GIN + INTERVAL —/- “00L? 24m”, 20”?”

r 228 CALCULA TE NEW XMAX XMAX = XMAX I [NTERVAL __/'- IADDWZ 26IRI, IO?R/II

229) CE T I6 MOST SIGNIFICANT BITS OF THE NEW XOR/GIN VALUE FOR THIS POL YGON _/— IMOVZWL 22IRII, R5}

{230 R5 -- WHERE IN STA TIC LIST / (MOVL (R4 [R54 R” DA TA ENTRY SHOULD BE IN- ‘ SERTED. SA VE S T LH A T THIS X POSITION, Le. THE XOR/GIN OF THIS DA TA ENTRY

IMKOVL RI, (R4) [R511 l,23/ INSERT THIS CURRENT DA TA ENTRY IN XORIGINIII S TLH

UPDA TE FORWARD POINTER 4S’ TO NEXT DA TA ENTRY IN

ACTIVE LIST

IMOVL (R0), RIIJ

DNEO 25

4,837,447

FIG. 20C

US. Patent Jun. 6, 1989 Sheet 19 0f 19 4,837,447 -

“N 6E

B 1H5 M; KEN“ M mm

m Q

‘ll. \ Ab

top related