JP3194779B2 - Filling device - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a painting apparatus for painting the inside of a contour in an image processing system for displaying characters, figures, and the like.

[0002]

2. Description of the Related Art In an image processing system for displaying characters and figures, a filling device for displaying characters and figures by filling the inside of outlines such as characters and figures is used.

As a conventional device for painting the inside of a contour line, for example, a method described in Japanese Patent Publication No. 2-201692 has been used. Hereinafter, a conventional example will be described with reference to FIG. FIG. 10 is an explanatory diagram in the case where the triangle ABC is displayed by being painted out. The painting-out device is provided with memories a and b corresponding to FIGS. 10A and 10B and records information of the outline.

That is, X-axis and Y-axis coordinate data corresponding to the contour of the triangle ABC and "1" or "0" data representing the attribute of the contour are recorded in the memories a and b. In the case of FIG.
As shown in FIG. 10A, the attributes of the sides AB and AC are “1”, the side BC is “0”, and the memory b has the attributes shown in FIG.
As shown in (b), the attribute of the side AB is “0”, and “0” is recorded in the sides AC and BC.

Therefore, the filling process is performed first in the memory a.
Is “1” and the attribute recorded in the memory b is “0”, the painting start point is set.
When the attribute of the memory a is “0” and the attribute of the memory b is “1”, the filling end point is determined, and when the attributes of the memories a and b are both “1”, the filling start and end points are determined to be the same as the X. Fill each pixel up to the end point on the axis, and fill the triangle AB with only one point for the start and end points
C had been painted.

[0006]

As described above, the conventional painting apparatus has two memories for recording outline coordinate data of a character or figure to be painted and data indicating its attributes. A paint start point, a paint end point, and a paint start and end point are determined based on a combination of the attributes of the obtained data, and the inside of the outline is painted.

For this reason, the two memories for storing the outline coordinate data of characters and figures and the data indicating the attributes required a memory having an extremely large recording capacity. SUMMARY OF THE INVENTION An object of the present invention is to provide a painting apparatus improved by directly generating painting information from contour drawing information and simplifying the apparatus configuration.

[0008]

Means adopted by the present invention to solve the above-mentioned problems will be described. A filling device for calculating a contour line based on approximate expression information connecting feature points of the contour line and filling the inside of the contour line, wherein approximate formula information connecting the feature point of the contour line and the feature point is provided. A contour point calculating unit that calculates a contour point of a contour line based on the contour point; a contour point classifying unit that classifies a starting point, an ending point, a singular point, and a blank point from three consecutive contour points calculated by the contour point calculating unit; A singularity recording memory for recording singularities classified by the contour point classifying unit, a bitmap memory for developing and recording the start and end points classified by the contour point classifying unit in correspondence with a display unit, and A paint processing unit that paints bits between the start and end points recorded in the map memory and paints bits in the bit map memory corresponding to the singular points recorded in the singular point recording memory.

[0009]

The outline point calculation unit calculates an outline forming the outline based on approximate expression information connecting the characteristic points of the outline. The contour point classifying section classifies the contour points into any of a start point, an end point, a singular point, and a blank point from the three consecutive contour points calculated by the contour point calculating section.

The start and end points classified by the contour point classifying unit are recorded on a bit map memory, and the singular points are recorded on a singular point memory. The filling processing unit fills the space between the start and end points recorded on the bitmap memory, and also fills the bitmap memory corresponding to the singular point recorded in the feature point memory.

As described above, the contour points forming the contour are calculated based on the approximate expression information connecting the singular point of the contour and the feature point, and the contour points are calculated from the three consecutive calculated contour points. Are classified into start and end points, singular points and blank points, the contour points classified as the start and end points are recorded in the corresponding bitmap memory, the singular points are recorded in the memory, and the start and end points on the bitmap memory are painted and Since the singular point is read from the memory storing the singular point and the corresponding bitmap memory is filled, the memory for recording the contour point of the contour and the filling information is unnecessary,
The device configuration can be greatly simplified.

[0012]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS A first embodiment of the present invention will be described with reference to FIGS. FIG. 1 is a configuration diagram common to other embodiments, and FIG.
FIG. 3 is an explanatory diagram of the principle of painting in the first embodiment, FIG. 3 is an explanatory diagram of a start / end point, a singular point and a blank point, FIG. 4 is an explanatory diagram of a special singular point, and FIG. 5 is an operation flowchart of the first embodiment. .

In FIG. 1, reference numeral 6 denotes a contour line information memory in which characteristic points of a contour line and approximate expression information of a curve connecting the characteristic points are stored. Reference numeral 1 denotes a contour point calculation unit, which calculates contour points forming a contour line based on feature points stored in the contour information memory 6 and approximate expression information connecting the feature points.

Reference numeral 2 denotes a contour point classifying unit, which classifies contour points into start and end points, singular points, and blank points, as will be described in detail later. Reference numeral 3 denotes a singular point recording memory, which records the position data of the contour points classified as singular points by the contour point classifying unit.

Reference numeral 4 denotes a bit map memory.
It is composed of a memory having a two-dimensional address of the X axis and the Y axis corresponding to each of the above pixels. Reference numeral 5 denotes a painting processing unit, which performs processing for painting the inside of the outline.
Reference numeral 8 denotes a processor (CPU), which performs all processes.

First, the principle of the first embodiment will be described with reference to FIG. In FIG. 2, marks ●, ◎, and ○ indicate contour points constituting a contour line. Each contour point is position data corresponding to the X-axis and the Y-axis of the bitmap memory 4, and
The contour points constituting the outer contour are sequentially calculated in the clockwise direction, and the contour points constituting the inner contour are sequentially calculated in the counterclockwise direction.

In FIG. 2, the outline points indicated by ● are the start and end points,
The outline points indicated by ◎ are referred to as singular points, and the outline points indicated by ○ are referred to as blank points. The principle of filling is to first classify the calculated contour points into start and end points, singular points, and blank points. The method of classification will be described later. The corresponding point on the bitmap memory of the contour point classified as the start and end point ● is set to “1”, and the contour point classified as the singular point ◎ is recorded in the singular point recording memory.

After the classification of the contour points constituting all the contour lines is completed, a painting process is performed. That is, the bit map memory is swept from the left to the right, and all bits between the bit where "1" is recorded first and the bit where "1" is recorded next are set to "1". The sweep is further continued, and then the bit where “1” is recorded is changed to the next “1”.
Is set to "1" between bits in which is recorded. When the next lower line is sequentially processed and the sweep of one line is completed, the same process is performed for the next line.

After the processing of all the lines is completed, the data of the singular point ◎ recorded in the singular point recording memory is read out,
The corresponding bit of the bit map memory is set to "1" to perform painting. Next, referring to FIG.
A method for classifying singular points and blank points will be described.

[0020] Now, the contour points to classify P ^O, than P ^O 1
One previous contour point P ^- The contour points after one than P ^O P ⁺
Consider three continuous contour points as follows. Further, in order to facilitate the following description, the coordinates of P ^O are represented by (x ^O , y ^O ), P
^- coordinates of ^(x -, ^y -), a P ⁺ coordinates (x ^+,
y ⁺ ), and expressed as x ^O −x ⁻ = X ⁻ y ^O −y ⁻ = Y ⁻ x ⁺ −x ⁰ = X ⁺ y ⁺ −y ⁰ = Y ⁺ (1) (A1) Corresponding to FIG. 3 (A1), and P ⁻ , P
^{When O} and P ⁺ are continuous in the x-axis direction, that is, when X ⁻ = X ⁺ = 1 Y ⁻ = Y ⁺ = 0, it is classified as P ^O = ○ (blank point) (A1).

[0021] Thereafter ^{Similarly, (A2) X - = X} + = -1 Y - = For ^{Y + = 0 P O = ○} ... (A2) (B1) Y - = Y + = -1 if P ^O = ● (start and end points) ... (B1) (B2) Y - = Y + = 1 if ^{P O = ●) ... (B2} ) (C1) X + = 1 Y - = -1, if the Y ⁺ = 0 P ^O = ○ (C1) (C2) X ⁻ = −1 Y ⁻ = 0, Y ⁺ = 1 ^Po = ● (C2) (D1) X ⁺ = −1 Y ⁻ = −1, Y ^In the case of ⁺ = 0, P ^O = ● (D1) (D2) X ⁻ = 1 Y ⁻ = 0, in the case of Y ⁺ = 1 ^Po = O (D2) (E1) X ⁺ = −1 Y ⁻ = 1, Y ⁺ = 0 if ^{P O = ○ ... (E1)} (E2) X - = 1 Y - = 0, Y + = -1 if ^{P O = ● ... (E2)} (F1) X + = 1 Y ^- = 1, the case of ^{Y + = 0 P O = ●} ... (F1) (F2) X - = -1 Y - = 0, Y ⁺ = -1 if ^{P O = ○ ... (F2)} (G1) X - or X ⁺ of Izure or one of the other is 1 0 or both ^{1 Y - = 1, Y +} = -1 for In the case, P ^O = 特異 (singular point) (G1) (G2) When one of X ⁻ or X ⁺ is −1 and the other is 0 or both are −1 Y ⁻ = 1, Y ⁺ = −1, P ^O = ○ ... (G2) (H1 ) X - or X ⁺ of Izure or one is 1 and the other is 0 or both at ^{1 Y - = -1, Y +} = for ^{1 P O = ○ ... (H1} ) (H2) X ^- or X ⁺ of Izure or one of the other at -1 0 or both -1 ^Y - = -1 is determined, Y ⁺ = 1 if P ^O = ◎ ... and (H2).

As shown in FIG. 2, for the contour points of the inner contour line, the judgment results by (A1) to (H1) and the judgment results by (A2) to (H2) in FIG. That is, the judgment results of (A1) and (A2), (B1) and (B2),..., (H1) and (H2) are exchanged.

Next, the special singularity will be described with reference to FIG. The contour points forming the contour are sequentially calculated based on an approximate expression of a curve connecting the characteristic points between the feature points. Therefore, as shown in FIG. 4 (A), the contour point approximation formula is given and the feature point of the P ₁ and P ₂ are calculated, contour points are classified by the formula (A1) ~ (H2) When, as shown in FIG. 4 (B), the classified as start and end points ● except P _2.

Next, as shown in FIG. 4 (C), P ₂
And contour point approximation formula is given and the feature points P ₃ is calculated, the contour points are classified by the formula (A1) ~ (H2), P 2 singularity ◎, start and end points except P ₂ Classified as ●. Therefore, until the P ₄ than P _2, except for P ₂ is recorded is all the time classified as a point on the bit map memory. If the start and end points are overlapped in this way, it is not possible to determine that the overlap is recorded on the bitmap memory during the filling process, and the filling process cannot be performed.

Therefore, as shown in FIG. 4 (D), when the start and end points are determined and recorded in the bit map memory, if the value stored in the bit to be recorded is "1", the stored value is set to "0". And records the corresponding contour point as a singular point in the singular point recording memory. Next, referring to FIG.
The operation of this embodiment will be described.

The outline information memory 6 previously stores approximate expression information of a characteristic point of a character or graphic outline displayed on the display unit 7 and a curve connecting the characteristic points, as described with reference to FIG. As described above, information is sequentially stored so that contour points are calculated in the clockwise direction for the outer contour line and counterclockwise for the inner contour line.

Processing S1 In processing S1, the contour point calculation unit 1 reads out the approximate expression information of the characteristic points of the outline stored in the outline information memory 6 and the curve connecting the characteristic points. Process S2 Based on the read outline information, the outline point calculation unit 1 calculates outline points constituting the outline.

Process S3 The contour point classifying unit 2 classifies the contour points calculated in the process S2 based on the conditions represented by the equations (A1) to (H2), and determines whether the contour points are the start and end points. If it is determined that the point is a singular point, the process proceeds to step S7. If it is determined that the point is a blank point, the process proceeds to step S8.

Step S4 If the start and end points are determined in step S3, it is determined whether or not the data value stored in the memory on the bitmap memory 4 corresponding to the determined contour point is "1". , YE
In the case of S, the process proceeds to step S5, and in the case of NO, the process proceeds to step S6.

Process S5 In process S5, the data value of the corresponding memory of the bit map memory 4 which has been read as "1" in process S4 is changed to "0", and the address information is changed to the singular point recording memory. Record in 3.

Step S6 If the decision result in the step S4 is NO, in the step S6, the data value of the memory of the bit map memory 4 which is read "0" in the step S4 is set to "1". That is, processing S4 to
In S5, as described with reference to FIG. 4, a process of extracting a special singular point from the start and end points and recording it as a singular point is performed.

Process S7 The contour point determined as a singular point in step S3 is recorded in the singular point recording memory 3. Process S8 In the process S8, it is determined whether or not the contour point classification process has been completed for all the contour points constituting the contour line.
In the case of, the process moves to the process S1 and the processes S1 to S8 are continued,
In the case of YES, the process moves to step S9.

Processing S9 In processing S9, the painting processing unit 5 reads the data value by sequentially sweeping the X-axis address of the bitmap memory 4 from left to right, and reads the data value from the memory in which the data value becomes "1" first. Next, the data value of the memory until "1" is read out is rewritten to "1", and the data value read out again becomes "1".
Further, the data value read next is rewritten to the data value "1" of the memory up to "1". The above processing is sequentially repeated in the X-axis direction.

When the processing of one line on the X axis is completed, the next Y
The X-axis is swept with respect to the axis value, and the data value of the corresponding memory is rewritten to “1” to perform the painting process. When the sweep for all the memories for the bitmap memory 4 is completed, the bit of the bitmap memory 4 corresponding to the singular point recorded in the singular point recording memory 3 is set to “1”.
And all the processing ends.

Pixels corresponding to bits recorded as "1" in the bit map memory 4 are displayed on the display unit 7 and displayed as characters or figures. Note that the processes S4 to S of the embodiment
Treatment of 5 to perform the processing of the special singularity described in FIG. 4, had so as to record all contour points of the point P ₂ to P ₄ singularity recording memory 3, thus continuously When the singular point is recorded, the points P ₂ and P ₄
Position information and by recording the contour information representing singularities between points P ₂ and P ₄ of the filling processing time in the processing S9, as filled by computing singular point by the information based on You may do it.

Next, the principle of the second embodiment will be described with reference to FIG. In the first embodiment, the filling processing unit 5
Read out all the memories of the bitmap memory 4 to determine whether or not the recording value is "1", and perform the filling process. For this reason, a long time is required for the filling processing. In the second embodiment, the time required for the painting process is reduced.

In the second embodiment, the process is performed by dividing the start and end points classified by the contour point classifying unit 2 described in the first embodiment into a start point and an end point. As is clear from FIG. 2, the end point of the fill, that is, the end point of the fill, among the start and end points recorded as “1” in the bitmap memory 4, that is,
When the bitmap memory 4 is swept with respect to the X-axis, points that become "1" at even-numbered points are the points indicated by ● in FIG. 6A.

The end points indicated by ● in FIG. 6A are (B1), (D1) and (E2) in FIG. That is, the end point is a contour point represented by equations (B1), (D1), and (E2). 6B correspond to (B2), (C2) and (F1) in FIG. 3, respectively, and correspond to equations (B2), (C2) and (F1), respectively.
Is a contour point represented by

Therefore, the classification of the contour points calculated by the contour point calculation unit 1 is changed in the first time by changing the contour points determined by the equations (B2), (C2) and (F1) into blank points. Do. When the classification of all contour points is completed, the second classification is performed. The second classification of the contour points is performed using the equation (B2),
Only the contour points represented by (C2) and (F1) are classified and output.

The bit of the bit map memory 4 corresponding to the contour point (FIG. 6B) determined as the starting point in the second classification is set to "1", and the X-axis of the bit set to "1" is swept. The bits up to the bit (FIG. 6A) in which the first classification is determined as the end point and "1" is recorded are rewritten to "1", and painting is performed.

By performing the repainting in this manner, it is not necessary to read out the data values recorded in all the bitmap memories, and the repainting processing time can be reduced. Next, the operation of the second embodiment will be described with reference to FIG.

Processes S11 and S12 In processes S11 and S12, the same processes S1 and S2 as described in the first embodiment are performed to calculate contour points. Processing S13 In processing S13, the contour point classifying unit 2 calculates the expressions (A1) to (H).
The contour points are classified based on the condition shown in 2). However, when it is classified into the equations (B2), (C2) and (F1), it is determined to be a blank point and output. If the result of the determination is the end point, the process proceeds to step S14.
The process proceeds to step S16 when it is determined to be a blank point.

Processing S14 "1" is recorded in the bit of the bit map memory 4 corresponding to the contour point determined as the end point. Process S15 The contour point determined as a singular point is recorded in the singular point memory 3.

Process S16 In process S16, it is determined whether or not the classification process for all the contour points has been completed. If NO, the process proceeds to process S11.
Processes S11 to S16 are repeated, and if YES, the process moves to process S17.

Processes S17 and S18 In processes S17 and S18, the same processes as processes S11 and S12 are performed to calculate the contour points. Processing S19 In processing S19, the contour point classifying unit 2 calculates the equations (B2) and (C
The contour points classified as (2) and (F1) are determined to be the starting points, and the process proceeds to step S20; otherwise, the process proceeds to step S23.

Processing S20 In processing S20, the bit data of the bit map memory 4 corresponding to the contour point determined as the starting point in processing S19 is read, and it is determined whether or not the read data value is "1". In the case of, the process proceeds to step S22, and in the case of YES, the process proceeds to step S22.

Processing S21 In processing S21, the painting processing unit 5 sweeps in the X-axis direction from the bit of the bit map memory 4 corresponding to the contour point determined as the starting point in processing S19, and then "1" is recorded. The data value of each bit up to the bit in question is rewritten to “1” and painted.

Process S22 In process S22, the data value of the bit read from the bit map memory 4 in process S20 is rewritten to "0" and recorded in the singularity recording memory 5. Process S23 It is determined whether or not the classification of all contour points has been completed.
In the case of NO, the process shifts to step S17, and steps S17 to S23 are repeated. In the case of YES, the process moves to step S24.

Processing S24 In processing S24, the paint-out processing section 5 reads the singularity recorded in the singularity recording memory 3, rewrites the corresponding bit of the bitmap memory 4 to "1", and ends all the processing. I do.

Next, the principle of the third embodiment will be described with reference to FIG. In the second embodiment, the classification of the contour points is determined based on the position information of three consecutive contour points. In the third embodiment, a determination is made based on approximate information connecting feature points stored in the contour information memory.

FIG. 8 shows the outline of the kana character “no”. The outline information memory 6 stores
For example, as shown in FIG. 8, approximate expression information of a curve connecting between P ₀ , P ₁ ,..., P ₈ and each feature point is stored. Therefore, for example, approximate expression information connecting the feature points P _n and P _{n + 1} and P _n and P _{n + 1} is read, and a contour point calculated toward the points P _n and P _{n + 1} is obtained from the information. A determination is made as to whether the value decreases monotonically, increases monotonically, or does not decrease or increase monotonously. The end point is the contour point calculated in the section determined to be monotonically decreasing, the starting point is the contour point calculated in the section determined to be monotonically increasing, and is decreased if it is determined not to decrease or increase monotonically. The contour point calculated by dividing the section into points that are changed from “increase” or “change from increase” to “decrease” is defined as an end point or a start point.

That is, P _n (x _n , f _n ) is associated with the coordinates of the feature points P _n and P _{n + 1} on the bitmap memory.
( _Xn )) and _{Pn + 1} ( _{xn + 1} , f ( _{xn + 1} )), and the approximate expression f (x) of the curve connecting the points _Pn and _{Pn + 1} is f (x) = A′x ³ + B′x ² + C′x + D ′ (2)

[0053] the curve represented by the formula (2), the interval whether _{[x n, x n + 1} ] decreased from monotonously increased or there is a point to be changed from decrease to increase the interval [x _n, x
_{n + 1} ] can be determined based on whether or not there is a point at which the differential value of equation (2) becomes 0. Therefore, taking the derivative of equation (2), f ′
(X) is expressed by ^{f '(x) = 3A'x 2} + 2B'x + C' ≡Ax 2 + Bx + C ... (3).

Equation (3) is a quadratic equation with respect to x. If the discriminant D of the root is D = B ² -4AC ≧ 0 (4), it has a real root, and the value of equation (3) is 0. X value x _m
Is given by x _m12 = [− B ± (B ² −4AC) ^0.5 ] / 2A (5)

Therefore, if D ≧ 0 (a) If x _m12 is within the section [x _n , x _{n + 1} ], (a1) x _m1 and x _m2 are singular points ... (6) (a2) f (x _n )> f (x _m1 ), the end of the section [x _n , x _m1 -1] (7) (a3) If f (x _n ) <f (x _m1 ), the section [x _n , x _m1 -1] as a starting point (8) (a4) If f (x _m1 )> f (x _m2 ), a section ending at a section [x _m1 +1, x _m2 -1] ... (9) (A5) If f (x _m1 ) <f (x _m2 ), the section starting from the section [x _m1 +1, x _m2 −1] (10) (a6) f (x _m2 )> f (x _{n + 1} ) if section [ _xm2 + 1, _{xn + 1} ] as end point ... (11) (a7) If f ( _xm2 ) <f ( _{xn + 1} ), section [ _xm2 + 1, _xn section _+1] the starting ... (12) (b) of the x _m1 or x _{m @ 2} Families or the other (x _m) section only _{[x n, x n + 1} ] if (b1) singularity _{x m ... (13) (b2} ) f (x n)> f (x m) If the interval [ x _n, x _m -1] a section to the end point ... (14) (b3) f (x n) <f (x m) If the interval [x _n, interval starting at the x _m -1] ... ( 15) (b4) If f (x _m )> f (x _{n + 1} ), the section ending at the section [x _m +1, x _{n + 1} ]... (16) (b5) f (x _m ) <f (x _{n + 1)} if the interval _{[x m + 1, x n} + 1] interval starting at the ... (17) (c) x m12 is the interval _{[x n, x n + 1} ] if the outer (c1) If f ( _xn )> f ( _{xn + 1} ), a section ending at the section [ _xn , _{xn + 1} ] (18) (c2) f ( _xn ) <f ( _{xn + 1} ) Then, the interval [x _n , x _{n + 1} ] as the starting point is defined as (19).

When D <0 (d1) If f (x _n )> f (x _{n + 1} ), the section ending at the section [x _n , x _{n + 1} ] (20) (d 2) f ( If (x _n ) <f (x _{n + 1} ), a section starting from the section [x _n , x _{n + 1} ] is set as (21).

As described above, if the end point section, the start point section, and the singular point are determined from the characteristic points and the approximate expression information connecting the characteristic points, as described in the second embodiment, The contour point calculated in the section to be the end point is recorded on the bitmap memory, and the bit of the bitmap memory recorded as the end point is painted out from the contour point calculated in the section to be the start point.

Next, the operation of the third embodiment will be described with reference to FIG. Process S31 In process S31, the contour point classifying unit 2 sets the contour line information memory 6
Approximate expression information connecting feature points is read.

Process S32 The contour point classifying section 2 classifies feature points into singular points, end points and start points based on the contour information read out in step S31. That is, equations (4) to (2)
Classification is performed by performing determination based on 1).

As a result of the classification, when the section is classified as the start point, the process proceeds to step S33. When the section is classified as the end point, the process proceeds to step S34. When the section is classified as a singular point, the process proceeds to step S36. Process S33 The section as the starting point and the approximate expression information are recorded in a memory (not shown).

Steps S34 and S35 The contour point calculator 1 calculates the contour point for the section to be the end point, and sets "1" to the corresponding bit of the bit-up memory 4.
Record Process S36 The singular point is recorded in the singular point recording memory 3.

Processing S37 In processing S37, it is determined whether or not the processing of the outline information recorded in all the outline information memories 6 has been completed. If NO, the process proceeds to step S31 to proceed to steps S31 to S3.
7 is repeated, and in the case of YES, the process proceeds to step S38.

Step S38 In step S38, the section classified as the start point in step S33 and the approximate expression information are read. Process S39 The contour point calculation unit 1 calculates a contour point based on the information read in the process S38.

Process S40 In process S40, it is determined whether or not the bit data of the bit map memory 4 corresponding to the contour point calculated in process S39 is "1".
On the other hand, in the case of NO, the process shifts to step S42.

Step S41: The paint-out processing unit 5 sweeps in the X-axis direction from the bit of the bit map memory 4 corresponding to the contour point calculated in step S39, and then performs each processing up to the bit where "1" is recorded. The data value of the bit is rewritten to "1" and painting is performed.

Process S42 The bit of the bit map memory 4 corresponding to the contour point calculated in the process S39 is rewritten to “0” and recorded in the singularity recording memory 5. Process S43 It is determined whether or not all the processes for the section set as the start point recorded in the process S33 have been completed. If NO, the process proceeds to the process S38 and the processes S38 to S43 are repeated, and YES
In the case of, the process proceeds to step S44.

Processing S44 In processing S44, the painting unit 5 reads the singular point recorded in the singular point recording memory 3, rewrites the corresponding bit of the bit map memory 4 to "1", and ends all the processing. .

Although the embodiment of the present invention has been described above, the present invention is not limited to this embodiment, and various modifications in accordance with the gist of the invention are possible.

[0069]

As described above, according to the present invention, the following effects can be obtained. As described above, the contour points constituting the contour are calculated based on the approximate expression information connecting the characteristic points of the contour, and the contour points are set as the start and end points from the three consecutive calculated contour points. ,
The contour points classified as singular points and blank points are recorded in the corresponding bitmap memory, the singular points are recorded in the memory, the singular points are recorded in the memory, and the singular points between the start and end points on the bitmap memory are recorded and the singular points are recorded. Since the singular point is read out from the memory and the corresponding bitmap memory is filled, a memory for recording the contour points of the contour and the painting information is not required, and the configuration of the apparatus can be greatly simplified.

Further, all the end points classified by the contour point classifying unit are recorded in the bit map memory, and thereafter, the gap between the contour point classified as the start point and the bit of the bit map memory recorded as the end point is filled. As a result, the time required for the filling process can be reduced.

Further, the contour point classifying unit classifies the section in which the contour point is the start point, the section in which the contour point is the end point, and the singular point, calculates the contour point of the section in which the contour point is the first end point, records the contour point in the bitmap memory, and then records the start point. Since the contour point calculated in the section is filled up with the bit on the bit map memory recorded as the end point, the contour point classification processing time can be reduced.

[Brief description of the drawings]

FIG. 1 is a configuration diagram of an embodiment of the present invention.

FIG. 2 is an explanatory diagram of a filling principle according to the first embodiment of the present invention.

FIG. 3 is an explanatory diagram of a start / end point, a singular point, and a blank point in the embodiment.

FIG. 4 is an explanatory diagram of a special singularity of the embodiment.

FIG. 5 is an operation flowchart of the first embodiment of the present invention.

FIG. 6 is an explanatory diagram of a painting principle according to a second embodiment of the present invention.

FIG. 7 is an operation flowchart of the second embodiment of the present invention.

FIG. 8 is an explanatory diagram of a painting principle according to a third embodiment of the present invention.

FIG. 9 is an operation flowchart of the third embodiment of the present invention.

FIG. 10 is an explanatory diagram of a conventional example.

[Explanation of symbols]

 DESCRIPTION OF SYMBOLS 1 Contour point calculation part 2 Contour point classification part 3 Singular point recording memory 4 Bit map memory 5 Fill processing part 6 Contour information memory 7 Display part 8 Processor (CPU)

Continuation of the front page (56) References JP-A-3-171089 (JP, A) JP-A-3-91882 (JP, A) JP-A-2-238581 (JP, A) JP-A-3-107765 (JP) JP-A-61-77984 (JP, A) JP-A-61-241880 (JP, A) JP-A-63-101981 (JP, A) JP-A-2-90282 (JP, A) (58) Field surveyed (Int. Cl. ⁷ , DB name) G06T 11/40 200

Claims (4)

(57) [Claims] 1. A filling device for calculating a contour line based on approximation formula information connecting feature points of the contour line and filling the inside of the contour line, wherein the feature point of the contour line and the feature point A contour point calculating unit for calculating a contour point of a contour line based on approximate expression information connecting the contours, and a contour for classifying a start point, an end point, a singular point, and a blank point from three consecutive contour points calculated by the contour point calculating unit. A point classification unit, a singularity recording memory for recording the singularity classified by the contour point classification unit, and a bitmap for developing and recording the start and end points classified by the contour point classification unit in correspondence with the display unit A memory, and a fill processing unit that fills bits between a start point and an end point recorded in the bit map memory and fills bits of a bit map memory corresponding to a singular point recorded in the singular point recording memory. Filling apparatus characterized. 2. The method according to claim 2, wherein the calculation of the contour point by the contour point calculation unit is performed by two.
The contour point classifying unit classifies the start point, the end point, the singular point and the blank point from the first calculated value, records the end point in the bitmap memory, and calculates the second point based on the calculated value of the contour point. When the starting point is obtained by the classification of the above, the filling processing unit paints the starting point from the obtained starting point to the end point on the same X axis recorded in the bitmap memory at the first time. The filling device according to claim 1. 3. Instead of classifying a start point, an end point, a singular point, and a blank point from three consecutive contour points in the contour point classifying unit, the contour point classification unit uses approximate contour information to connect characteristic points of a contour line. The section serving as the start point, the section serving as the end point, and the singular point are classified, and the contour points corresponding to all the sections serving as the end points are calculated by the contour point calculation unit and recorded in the bitmap memory. 2. The filling device according to claim 1, wherein a corresponding contour point is calculated, and bits of a bitmap memory recorded as the calculated start point and the calculated end point are filled. 4. The method according to claim 1, wherein when the singular points are continuously present on the bitmap memory, position information on both ends of the continuous singular points and information on a curve connecting both ends are recorded in the singular point recording memory. The filling device according to claim 1, wherein: