JPH04305782A - Character/graphic generator - Google Patents

Character/graphic generator

Info

Publication number
JPH04305782A
JPH04305782A JP3069975A JP6997591A JPH04305782A JP H04305782 A JPH04305782 A JP H04305782A JP 3069975 A JP3069975 A JP 3069975A JP 6997591 A JP6997591 A JP 6997591A JP H04305782 A JPH04305782 A JP H04305782A
Authority
JP
Japan
Prior art keywords
data
storage means
outline
singular point
character
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
JP3069975A
Other languages
Japanese (ja)
Inventor
Kiyoaki Murai
清昭 村井
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Seiko Epson Corp
Original Assignee
Seiko Epson Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Seiko Epson Corp filed Critical Seiko Epson Corp
Priority to JP3069975A priority Critical patent/JPH04305782A/en
Publication of JPH04305782A publication Critical patent/JPH04305782A/en
Pending legal-status Critical Current

Links

Landscapes

  • Controls And Circuits For Display Device (AREA)
  • Image Generation (AREA)

Abstract

PURPOSE:To rapidly execute area filling processing by adding face number information to outline data, simultaneously reading out feature point data from plural feature point storing means corresponding to respective face numbers and executing the area filling processing of the data in parallel. CONSTITUTION:A character/graphic outline is expressed by respective parts, the same face number is allocated to the parts to be simultaneously filled and the face number information is stored in an outline storing means 101 together with the part data of the outline. An outline is calculated from the data stored in the means 101, the feature points of the outline are determined, and in the case of storing the feature points in respective feature point storing means 103 to 106, the feature points of the parts having the same face number are stored in the same feature point storing means correspondingly to the feature point. Reading operation from plural area filling processing means 107 to 110 is simultaneously executed from plural means 103 to 106 and the area filling results from respective means 103 to 106 are added to generate a final character/ graphic.

Description

【発明の詳細な説明】[Detailed description of the invention]

【0001】0001

【産業上の利用分野】本発明は、CRTやプリンタ等の
出力装置に文字・図形等を出力するための文字・図形発
生装置に関する。
BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a character/figure generator for outputting characters, figures, etc. to an output device such as a CRT or printer.

【0002】0002

【従来の技術】従来の文字・図形発生方法は、文字・図
形の輪郭線を離散的データとして記憶し、この離散的デ
ータから文字・図形の輪郭線を直線、2次曲線、3次曲
線、円弧等の補間により算出し、この輪郭線で囲まれた
閉領域を塗りつぶす塗りつぶし処理を行うことによって
文字・図形を発生させており、文字・図形の輪郭線を記
憶するのには輪郭を一筆書きのように表現して記憶する
方法と、輪郭を部品で表現して記憶する方法の2つの方
法があった。本発明は、このうちの輪郭を部品で表現し
て記憶する方法によるものであるが、従来の輪郭を部品
で記憶する方法は、部品毎に塗りつぶし処理を行い、そ
の結果を加算演算することにより最終的な文字・図形を
発生させていた。
2. Description of the Related Art Conventional methods for generating characters and figures store the outlines of characters and figures as discrete data, and from this discrete data the outlines of the characters and figures are generated by straight lines, quadratic curves, cubic curves, etc. Characters and figures are generated by calculating by interpolation of circular arcs, etc., and performing a filling process to fill in the closed area surrounded by this outline.The outline of a character or figure can be memorized by drawing the outline with a single stroke. There were two methods: one method represented and memorized the contour as a part, and the other method represented and memorized the outline as a part. The present invention is based on a method of expressing and storing contours as parts, but the conventional method of storing contours as parts is to fill in each part and perform addition operations on the results. The final characters and figures were generated.

【0003】0003

【発明が解決しようとする課題】しかし、前述の従来技
術では、部品の数の回数だけ塗りつぶし処理を行うため
、塗りつぶし処理に長い計算時間が必要になるという欠
点があった。そこで、本発明はこのような問題点を解決
するもので、その目的とするところは文字データを部品
で持つ場合にも塗りつぶし処理を高速に行う文字・図形
発生装置を提供するところにある。
However, in the above-mentioned prior art, the filling process is performed as many times as the number of parts, so the filling process requires a long calculation time, which is a drawback. SUMMARY OF THE INVENTION The present invention is intended to solve these problems, and its purpose is to provide a character/figure generator that performs filling processing at high speed even when character data is contained in parts.

【0004】0004

【課題を解決するための手段】本発明の文字・図形発生
装置は、文字・図形の輪郭線を部品で持ち、同時に塗り
つぶし処理ができる部品に同一の面番号を付けてこの面
番号情報を輪郭線の部品データと共に輪郭記憶手段に記
憶するようにし、この輪郭記憶手段のデータから輪郭を
算出し特異点を決定して特異点記憶手段に記憶させると
きに、複数個の特異点記憶手段に面番号を対応させて同
じ面番号の付いた部品の特異点は同じ特異点記憶手段に
格納し、塗りつぶし手段における読み出し操作を複数個
の特異点記憶手段から同時に行い、各特異点記憶手段か
らの塗りつぶし結果を加算演算して最終的な文字・図形
を発生することを特徴とする。
[Means for Solving the Problems] The character/figure generator of the present invention has parts that have outlines of characters/figures and can be simultaneously filled in by assigning the same surface number to the parts and converting this surface number information into the outline. The data is stored in the contour storage means along with the part data of the line, and when the contour is calculated from the data in the contour storage means and the singular point is determined and stored in the singularity storage means, a plurality of singular point storage means are stored. Singularities of parts with the same surface number are stored in the same singularity storage means, and the filling means performs a read operation from a plurality of singularity storage means at the same time, and fills from each singularity storage means. It is characterized by adding the results to generate the final characters/figures.

【0005】[0005]

【実施例】図1は本発明の文字・図形発生装置の一実施
例のブロック図である。文字の輪郭が部品別に離散的デ
ータとしてその部品の面番号情報と共に記憶されている
輪郭記憶手段101と、その輪郭記憶手段101に記憶
されている輪郭線の離散的データから輪郭線を補間算出
し塗りつぶし情報である特異点を決定する特異点決定手
段102と、特異点をビットデータとして記憶する4つ
の特異点記憶手段、特異点記憶手段A103,特異点記
憶手段B104,特異点記憶手段C105,特異点記憶
手段D106と、塗りつぶし処理を行うときに特異点記
憶手段103〜106を行ごとに走査するようなアドレ
スを発生するアドレス発生手段113と、4つの特異点
記憶手段103〜106から並列に読み出される各々の
特異点データに対応して並列に塗りつぶし処理を行う4
つの塗りつぶし処理手段、塗りつぶし処理手段A107
,塗りつぶし処理手段B108,塗りつぶし処理手段C
109,塗りつぶし処理手段D110と、4つの塗りつ
ぶし処理手段107〜110の出力の加算演算をする加
算手段111と、加算手段111の出力をラッチするラ
ッチ手段112から構成される。
DESCRIPTION OF THE PREFERRED EMBODIMENTS FIG. 1 is a block diagram of an embodiment of a character/figure generator according to the present invention. A contour storage means 101 in which the outline of a character is stored as discrete data for each part along with surface number information of the part, and a contour line is calculated by interpolation from the discrete data of the outline stored in the outline storage means 101. Singular point determining means 102 that determines the singular point that is fill-in information, four singular point storage means that stores the singular point as bit data, singular point storage means A103, singular point storage means B104, singular point storage means C105, The point storage means D106, the address generation means 113 that generates an address for scanning the singularity storage means 103 to 106 line by line when performing the filling process, and the four singularity storage means 103 to 106 are read in parallel. Filling process is performed in parallel corresponding to each singular point data.4
1 fill-in processing means, fill-in processing means A107
, filling processing means B108, filling processing means C
109, it is composed of a fill processing means D110, an addition means 111 that performs an addition operation of the outputs of the four fill processing means 107 to 110, and a latch means 112 that latches the output of the addition means 111.

【0006】次に各構成手段の説明を含めて詳しく説明
するが、それに先立ち、文字を部品で持つことに付いて
説明する。図2は、文字を部品データで持つことの例を
示す図である。部品の基準は必ずしも1本の線が一つの
部品になっている必要はなく、文字のデザインがしやす
いなどの理由により適当に分けられたものが一つの部品
となっている。図2の例では、一つの文字が201,2
02,203,204の4つの部品から構成され、例え
ば部品201の輪郭は4つの代表点250,251,2
52,253によって離散的に表現されている。輪郭を
離散的に表現する他の方法には、輪郭を曲線補間によっ
て表現するものや骨格とそれからの変位量で表現する方
法などもある。文字を部品で持つ方法は輪郭を一筆書き
のように表現する方法よりデータ数が少なくなることの
他に、ウエイトや線幅の異なるファミリーフォントへの
展開が容易であるといった特徴を持つが、このような部
品で持った文字の塗りつぶし処理は、一つの特異点記憶
手段だけを持って1度に塗りつぶしを行おうとすると部
品どうしが重なる場所が白く抜けてしまうため、従来は
部品ごとに塗りつぶしを行いその結果を加算演算してい
た。本発明は、特異点記憶手段を複数個持ち、塗りつぶ
し処理を並列に行うことにより塗りつぶし処理時の特異
点記憶手段の走査回数を減らすことで処理の高速化を実
現している。図3は輪郭記憶手段101の記憶方法を説
明するための図で、311には部品201の輪郭データ
である250,251,252,253の座標データが
、301には部品201の面番号”1”が、312には
部品202の輪郭データである254,255,256
,257の座標データが、302には部品202の面番
号”2”が、313には部品203の輪郭データである
258〜263の座標データが、303には部品203
の面番号”3”が、314には部品204の輪郭データ
である264,265,266,267の座標データが
、304には部品204の面番号”1”が、それぞれコ
ード化されて記憶されている。 ここで、部品201と204の面番号が同じにしてある
のはこの2つの部品の塗りつぶし処理が同時に行えるか
らである。図4は、特異点決定手段102と特異点決定
手段103〜106と塗りつぶし処理手段107〜11
0で行う処理を部品203の場合を例に説明するための
図である。特異点決定手段102では、輪郭記憶手段1
01の代表点250,251,252,253の座標か
ら図4(a)のように輪郭線401を算出し、輪郭線が
水平方向の座標線402と交わったときにその交点に一
番近い右側の格子点を特異点とするという規則により図
4(b)のように特異点403〜410を決定する。4
つの特異点記憶手段103,104,105,106は
それぞれ面番号”1”,”2”,”3”,”4”の部品
の特異点を記憶するもので、特異点決定手段102から
は特異点を出力するときにその部品の面番号もそれに同
期して出力されており、その面番号により対応する特異
点記憶手段が選択されそこに特異点が記憶される。部品
203の面番号は303に記憶されていたように”3”
であり、図4(b)の特異点403〜410は特異点記
憶手段C105に記憶される。塗りつぶし処理手段C1
09は特異点記憶手段C105に記憶されている特異点
をもとに塗りつぶし処理を行うもので、特異点記憶手段
の特異点データを行ごとに走査し特異点の奇数番目の”
1”の画素例えば403から次の”1”の画素404の
1つ前の画素412までをすべて”1”に置き換える処
理を行い図4(b)の特異点データからは図4(c)の
ような塗りつぶし結果を得る。他の3つの塗りつぶし処
理手段107,108,110はそれぞれ特異点記憶手
段103,104,106の出力に対して塗りつぶし処
理を行うもので、処理方法は同様である。塗りつぶし処
理を行うための特異点記憶手段からの読み出し操作は、
アドレス発生手段113から出力されるアドレスにした
がい4つの特異点記憶手段に対して並列に行われ、それ
に対する4つの塗りつぶし処理も並列に行われる。図5
は、塗りつぶし処理手段の一例を示す図で、特異点記憶
手段が8ビット構成のRAM(読み出し書き込みメモリ
)で構成されているときのものである。510〜517
は特異点記憶手段から読み出すデータで、行の始めの読
み出し操作では510がその行の左端の画素のデータで
511がその一つ右側の画素のデータで、以下順に51
7が8番目の画素のデータである。次の読み出し操作で
は510が9番目の画素のデータ、511が10番目の
画素のデータとなり、以下同様である。出力信号520
から527にはそれぞれ510から517に対応した画
素の塗りつぶし結果が出力される。Dフリップフロップ
501は塗りつぶしの繰上がり情報を一時記憶するため
のもので、行の操作の始まるときにクリア信号502が
、8ビット(8画素)の読み込み操作を行うごとにクロ
ック信号503がアドレス発生手段113から入力され
ている。行の操作が始まるときにはクリア信号が入力さ
れるのでDフリップフロップ501の出力信号504は
”0”になっている。次に、特異点記憶手段より行の1
画素目から8画素目までの特異点データが510から5
17に読み出される。いま、504は”0”であり51
0も”0”であるとしたら排他的論理和ゲート530の
出力も”0”になり520に”0”が出力される。2画
素目の特異点データ511も”0”ならば531の出力
も”0”になり521にも”0”が出力される。3画素
目の特異点データ512が”1”だとすると532の出
力は”1”になり532に”1”が出力される。532
の出力が1になったことは塗りつぶしの繰上がり情報が
”1”になったことを意味し、次に特異点が入るまでは
出力信号に”1”が出力される。つまり、513,51
4,515,516,517が”0”であれば533,
534,535,536,537には”1”が出力され
る。次に、クロック信号503が入力され8画素目から
9画素目への塗りつぶし繰り上げ情報であるゲート53
7の出力”1”がDフリップフロップ501に記憶され
、その後510〜517に9画素目から16画素目まで
の特異点データが読み出される。いまDフリップフロッ
プ501には”1”が記憶されており、9画素目の特異
点データ510が”1”のときには排他的論理和ゲート
530の出力は”0”となり520には9画素目のデー
タ”0”が出力される。このように、特異点が3画素目
と9画素目にあるときには3画素目から8画素目までを
”1”と出力することになる。以上のような処理が4つ
の特異点記憶手段と4つの塗りつぶし処理手段において
並列に行われている。図5は特異点記憶手段が8ビット
構成の場合に付いて示したが、他のビット構成の場合に
も同様に実現できる。加算手段111は、4つの塗りつ
ぶし処理手段107〜110の出力の加算演算を行い、
アドレス発生手段113から出力されるタイミング信号
により加算手段111の出力結果がラッチ手段112に
ラッチされ出力信号114に目的の文字データが得られ
る。以上、図2の文字例では面番号が3つであるので特
異点記憶手段D106と塗りつぶし処理手段D110は
使わなかった。面番号の数は一般的には4まであれば十
分な場合が多いが、もし面番号の数が6まであるような
文字があった場合には面番号の1から4までを最初に処
理し、次に面番号5と6を処理して結果を加算処理すれ
ばよい。また、本実施例では4つの面までを同時に処理
できる場合に付いて述べたが、同時に処理する面の数は
限定するものではない。 以上説明したように本実施例では、特異点記憶手段を複
数個持ち、輪郭線データに面番号情報を付け、面番号に
対応した複数の特異点記憶手段から特異点データを同時
に読み出すことにより、特異点記憶手段の一回の走査で
塗りつぶし処理を可能にしたことを特徴とする。もちろ
ん、面番号を持たない場合にも、複数の部品の処理を並
列に行うという意味で、特異点記憶手段を複数個持つこ
とは有効である。
[0006] Next, a detailed explanation will be given including a description of each constituent means, but prior to that, a description will be given of holding characters in parts. FIG. 2 is a diagram showing an example of having characters as part data. The standard for parts is that one line does not necessarily have to be one part, but one part can be divided appropriately for reasons such as ease of character design. In the example in Figure 2, one character is 201,2
It is composed of four parts 02, 203, and 204. For example, the contour of part 201 has four representative points 250, 251, and 2.
It is discretely expressed by 52,253. Other methods for expressing the contour discretely include methods for expressing the contour by curve interpolation, and methods for expressing the contour using a skeleton and the amount of displacement from it. The method of holding characters as parts requires less data than the method of expressing outlines in one stroke, and it also has the advantage of being easier to develop into family fonts with different weights and line widths. When filling in characters in parts like this, if you try to fill in at once with only one singular point memory, the areas where the parts overlap will come out white, so traditionally, it was done for each part separately. The results were added together. The present invention has a plurality of singularity storage means and performs filling processing in parallel, thereby reducing the number of times the singularity storage means are scanned during the filling processing, thereby realizing faster processing. FIG. 3 is a diagram for explaining the storage method of the contour storage means 101. In 311, the coordinate data of 250, 251, 252, 253, which is the contour data of the part 201, is stored, and in 301, the surface number "1" of the part 201 is stored. ”, but 312 contains contour data 254, 255, 256 of the part 202.
, 257, 302 has the surface number "2" of the part 202, 313 has the coordinate data of 258 to 263, which is the outline data of the part 203, and 303 has the coordinate data of the part 203.
The surface number "3" of the part 204 is encoded and stored in 314, the coordinate data of 264, 265, 266, 267 which is the outline data of the part 204, and the surface number "1" of the part 204 is stored in 304. ing. Here, the reason why parts 201 and 204 have the same surface number is that the filling process for these two parts can be performed at the same time. FIG. 4 shows the singular point determining means 102, the singular point determining means 103 to 106, and the filling processing means 107 to 11.
FIG. 3 is a diagram for explaining the process performed in 0 using the case of a component 203 as an example. In the singular point determining means 102, the contour storing means 1
From the coordinates of representative points 250, 251, 252, and 253 of 01, calculate the contour line 401 as shown in FIG. 4(a), and when the contour line intersects with the horizontal coordinate line 402, the right side closest to the Singular points 403 to 410 are determined as shown in FIG. 4(b) according to the rule that lattice points of are defined as singular points. 4
The singular point storage means 103, 104, 105, and 106 are for storing the singular points of the parts with surface numbers "1", "2", "3", and "4", respectively. When a point is output, the surface number of the part is also output in synchronization with it, and the corresponding singular point storage means is selected based on the surface number and the singular point is stored there. The surface number of part 203 is “3” as stored in 303.
The singular points 403 to 410 in FIG. 4(b) are stored in the singular point storage means C105. Filling processing means C1
09 performs a filling process based on the singular points stored in the singular point storage means C105, and the singular point data in the singular point storage means is scanned line by line and odd-numbered singular points are filled in.
For example, the pixel 403 that is 1" to the pixel 412 immediately before the next pixel 404 that is 1" is replaced with "1", and the singularity data of FIG. 4(b) is converted to the data of FIG. 4(c). The other three filling processing means 107, 108, and 110 perform filling processing on the outputs of the singular point storage means 103, 104, and 106, respectively, and the processing method is the same.Filling The read operation from the singularity storage means for processing is as follows:
According to the address output from the address generation means 113, the four singular point storage means are performed in parallel, and the four filling processes for the same are also performed in parallel. Figure 5
1 is a diagram illustrating an example of a filling processing means, in which the singular point storage means is constituted by an 8-bit RAM (read/write memory). 510-517
is the data to be read from the singular point storage means, and in the read operation at the beginning of a row, 510 is the data of the leftmost pixel in that row, 511 is the data of the pixel one position to the right, and 51 is the data of the pixel on the right side.
7 is the data of the 8th pixel. In the next read operation, 510 becomes data for the 9th pixel, 511 becomes data for the 10th pixel, and so on. Output signal 520
to 527, the filling results of pixels corresponding to 510 to 517 are output, respectively. A D flip-flop 501 is used to temporarily store fill information, and a clear signal 502 is generated when a row operation starts, and a clock signal 503 is generated every time an 8-bit (8 pixel) read operation is performed. It is input from means 113. When a row operation starts, a clear signal is input, so the output signal 504 of the D flip-flop 501 is "0". Next, from the singular point storage means, 1 of the row
Singularity data from pixel to 8th pixel is 510 to 5
17. Now, 504 is “0” and 51
If 0 is also "0", the output of exclusive OR gate 530 will also be "0" and "0" will be output to 520. If the singular point data 511 of the second pixel is also "0", the output of 531 is also "0" and "0" is also output to 521. If the singular point data 512 of the third pixel is "1", the output of 532 is "1" and "1" is output to 532. 532
When the output becomes 1, it means that the filling carryover information becomes "1", and "1" is output as the output signal until the next singular point occurs. That is, 513,51
If 4,515,516,517 is “0” then 533,
“1” is output to 534, 535, 536, and 537. Next, the clock signal 503 is inputted to a gate 53 which is the filling advance information from the 8th pixel to the 9th pixel.
The output "1" of 7 is stored in the D flip-flop 501, and thereafter, the singular point data from the 9th pixel to the 16th pixel is read out at 510 to 517. Currently, "1" is stored in the D flip-flop 501, and when the singularity data 510 of the 9th pixel is "1", the output of the exclusive OR gate 530 is "0", and the output of the 9th pixel is stored in the D flip-flop 501. Data "0" is output. In this way, when the singular points are at the 3rd and 9th pixels, "1" is output from the 3rd to 8th pixels. The above processing is performed in parallel in the four singular point storage means and the four fill-in processing means. Although FIG. 5 shows the case where the singular point storage means has an 8-bit configuration, it can be implemented similarly in the case of other bit configurations. The addition means 111 performs an addition operation on the outputs of the four filling processing means 107 to 110,
The output result of the adding means 111 is latched by the latch means 112 according to the timing signal outputted from the address generating means 113, and the desired character data is obtained as the output signal 114. As mentioned above, in the character example of FIG. 2, since there are three surface numbers, the singularity storage means D106 and the filling processing means D110 were not used. Generally, it is sufficient to have up to 4 surface numbers, but if there is a character with up to 6 surface numbers, process surface numbers 1 to 4 first. , then process surface numbers 5 and 6 and add the results. Further, in this embodiment, a case has been described in which up to four surfaces can be processed simultaneously, but the number of surfaces that can be processed simultaneously is not limited. As explained above, this embodiment has a plurality of singular point storage means, attaches surface number information to contour line data, and simultaneously reads out singular point data from the plurality of singular point storage means corresponding to the surface number. A feature is that the filling process can be performed by scanning the singular point storage means once. Of course, even when surface numbers are not provided, it is effective to have a plurality of singularity storage means in the sense that processing of a plurality of parts is performed in parallel.

【0007】図6は、本発明の第2の実施例における輪
郭記憶手段へのデータの記憶方法を説明するための図で
ある。図2の文字を例に挙げているが、601には部品
201の輪郭データである250,251,252,2
53の座標データが、604には部品204の輪郭デー
タである264,265,266,267の座標データ
が、610には面番号の切り替え命令が、602には部
品202の輪郭データである254,255,256,
257の座標データが、611には面番号の切替え命令
が、603には部品203の輪郭データである258〜
263の座標データがそれぞれコード化されて記憶され
ている。第2の実施例も図1のブロック図を用いて説明
するが、第2の実施例が第1の実施例と異なるのは輪郭
記憶手段101におけるデータの記憶方法と特異点決定
手段102における面番号の扱い方である。特異点決定
手段では始めは面番号を”1”として扱い、601に記
憶された部品201の特異点を決定しその結果を面番号
が”1”のときの特異点記憶手段A103に格納する。 次に、604に記憶された部品204の特異点を決定し
その結果を前と同じく特異点記憶手段A103に格納す
る。次に、面番号切り替え命令が入力されると特異点決
定手段の面番号を管理する部分は面番号を1つカウント
し面番号を”2”にセットする。次に、602に記され
た部品202の特異点を決定しその結果を面番号が”2
”のときの特異点記憶手段B104に格納する。以下同
様に、603に記された部品203の特異点を決定しそ
の結果を面番号が”3”のときの特異点記憶手段C10
5に格納し、文字データが終了した時点で特異点記憶手
段から特異点を読み出し塗りつぶし処理を開始する。塗
りつぶし処理のときに複数の特異点記憶手段から同時に
読み出し操作をすること、塗りつぶし処理手段における
塗りつぶし方法、加算手段における加算処理などについ
ては第1の実施例と同様である。
FIG. 6 is a diagram for explaining a method of storing data in the contour storage means in the second embodiment of the present invention. The characters in FIG. 2 are taken as an example.
53 coordinate data, 604 the coordinate data 264, 265, 266, 267 which is the outline data of the part 204, 610 the surface number switching command, 602 the outline data 254, 267 of the part 202, 255,256,
257 is the coordinate data, 611 is the surface number switching command, and 603 is the contour data of the part 203, 258 to 258.
Each of the 263 coordinate data is coded and stored. The second embodiment will also be explained using the block diagram in FIG. It's how the numbers are handled. The singularity determining means initially treats the surface number as "1", determines the singularity of the part 201 stored in 601, and stores the result in the singularity storage means A103 when the surface number is "1". Next, the singular point of the part 204 stored in 604 is determined and the result is stored in the singular point storage means A103 as before. Next, when a surface number switching command is input, the surface number managing section of the singularity determining means counts the surface number by one and sets the surface number to "2". Next, determine the singularity of the part 202 marked in 602, and use the result as the surface number “2”.
” is stored in the singularity storage means B104. Similarly, the singularity of the part 203 written in 603 is determined, and the result is stored in the singularity storage means C10 when the surface number is "3".
5, and when the character data ends, the singular point is read out from the singular point storage means and the filling process is started. The simultaneous reading operation from a plurality of singular point storage means during the filling process, the filling method in the filling processing means, the addition process in the adding means, etc. are the same as in the first embodiment.

【0008】[0008]

【発明の効果】以上述べたように本発明によれば、部品
の数だけ必要だった塗りつぶし処理が、輪郭データに面
番号情報を付け、面番号に対応した複数の特異点記憶手
段から特異点データを同時に読み出して並列に塗りつぶ
し処理することにより、塗りつぶし処理を高速に行うこ
とができる。
[Effects of the Invention] As described above, according to the present invention, the filling process that was necessary for the number of parts can be replaced by adding surface number information to contour data and storing singular points from a plurality of singular point storage means corresponding to the surface numbers. By reading the data simultaneously and performing the filling process in parallel, the filling process can be performed at high speed.

【図面の簡単な説明】[Brief explanation of drawings]

【図1】本発明の文字・図形発生装置のブロック図。FIG. 1 is a block diagram of a character/figure generator of the present invention.

【図2】文字の輪郭を部品で持つ場合の例を示す図。FIG. 2 is a diagram showing an example of a case where the outline of a character is held by a part.

【図3】輪郭記憶手段の記憶方法の例を示す図。FIG. 3 is a diagram showing an example of a storage method of contour storage means.

【図4】特異点の決定方法と塗りつぶし処理の説明をす
るための図。
FIG. 4 is a diagram for explaining a singular point determination method and a filling process.

【図5】塗りつぶし処理手段の例を示す図。FIG. 5 is a diagram showing an example of a fill processing means.

【図6】輪郭記憶手段の記憶方法の別の例を示す図。FIG. 6 is a diagram showing another example of the storage method of the contour storage means.

【符号の説明】[Explanation of symbols]

101  輪郭記憶手段 102  特異点決定手段 103から106  特異点記憶手段 107から117  塗りつぶし処理手段111  加
算手段 112  ラッチ手段 113  アドレス発生手段
101 Contour storage means 102 Singularity determination means 103 to 106 Singularity storage means 107 to 117 Filling processing means 111 Addition means 112 Latch means 113 Address generation means

Claims (1)

【特許請求の範囲】[Claims] 【請求項1】  文字・図形の輪郭線を離散的データと
して記憶する輪郭記憶手段と、この離散的データから文
字・図形の輪郭線を算出し塗りつぶし情報である特異点
を決定する特異点決定手段と、この特異点を記憶する特
異点記憶手段と、この特異点記憶手段に記憶された特異
点データをもとに塗りつぶし処理を行う塗りつぶし手段
とを有する文字・図形発生装置であって、前記輪郭記憶
手段を複数個備え、前記塗りつぶし手段における特異点
デーらの読み出し操作をこの複数個の特異点記憶手段か
ら同時に行うことを特徴とする文字・図形発生装置。
[Claim 1] Contour storage means for storing the contours of characters and figures as discrete data, and singular point determining means for calculating the contours of characters and figures from this discrete data and determining singular points that are fill-in information. A character/figure generating device having a singular point storage means for storing the singular point, and a filling means for performing a filling process based on the singular point data stored in the singular point storage means, the character/figure generating device comprising: 1. A character/figure generating device comprising a plurality of storage means, and reading out singularity data in the filling means from the plurality of singularity storage means at the same time.
JP3069975A 1991-04-02 1991-04-02 Character/graphic generator Pending JPH04305782A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
JP3069975A JPH04305782A (en) 1991-04-02 1991-04-02 Character/graphic generator

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
JP3069975A JPH04305782A (en) 1991-04-02 1991-04-02 Character/graphic generator

Publications (1)

Publication Number Publication Date
JPH04305782A true JPH04305782A (en) 1992-10-28

Family

ID=13418168

Family Applications (1)

Application Number Title Priority Date Filing Date
JP3069975A Pending JPH04305782A (en) 1991-04-02 1991-04-02 Character/graphic generator

Country Status (1)

Country Link
JP (1) JPH04305782A (en)

Similar Documents

Publication Publication Date Title
US4425559A (en) Method and apparatus for generating line segments and polygonal areas on a raster-type display
EP0030635A2 (en) Method and apparatus for generating complex characters
JPS6158083A (en) Fast memory system, data processing method and memory segment
JPS63223785A (en) Painting of internal area of closed graphics
JP3009525B2 (en) Vector image drawing equipment
US4272767A (en) Display system for displaying information in the form of a horizontally oriented curve on a raster-type CRT
US5519412A (en) Pattern processing method
JPH04305782A (en) Character/graphic generator
EP0458571A2 (en) Image processing method and apparatus
JP3807571B2 (en) Shape conversion method, recording medium on which program for executing the method is recorded, and shape conversion device
JP2610825B2 (en) Graphic processing unit
JP2776793B2 (en) Image display method and display device thereof
JP3129717B2 (en) Image processing apparatus and image processing method
JPH0573693A (en) Outline paint out system
US5305431A (en) Method and system for rendering polygons on a raster display
JPS6081683A (en) Expanding and contracting method of dot pattern
JP3089906B2 (en) Drawing equipment
JP2989642B2 (en) Video display device
JP3211591B2 (en) Image processing device
JPH04305781A (en) Character/graphic generator
JP2767810B2 (en) Editing area specification method
JPS63241673A (en) High speed painting-out circuit
JPH0266686A (en) Painting-out system for closed area and character generating device with to which such system is applied
JPS6160177A (en) Method of drawing thick segment
JPH0750512B2 (en) Image processing device