JPS6177984A - Paint-out system of closed polygonal picture - Google Patents

Abstract

PURPOSE:To paint-out a closed polygonal picture in a single color and with a single main scan and a single secondary scan, by referring to the contents of the start and stop point memory means as well as an output memory means and using an arithmetic means to decide the contents of the output memory means for spot groups to be painted out. CONSTITUTION:A polygonal memory means 400 stores a closed polygonal picture to be painted out. A side sorting means 410 sorts the sides of a polygonal picture shown by the contents of the means 400 into the start, stop and other sides respectively. The start and stop candidate points for paint-out are produced from the sides sorted by the means 410 by a start point generating means 420 and a stop point generating means 440 respectively. These candidate points are stored to a start point memory means 430 and a stop point memory means 450 respectively. The outputs of both means 430 and 450 are applied to the means 420, and the output of the means 420 is applied to an output memory means 470. The means 420 refers to the contents of means 430, 450 and 470 respectively to decide the contents of the means 470. Thus a closed polygonal picture is painted out with a single main scan and a single secondary scan respectively.

Description

Detailed Description of the Invention (Industrial Application Field) The present invention relates to a method for filling in closed polygonal images, and in particular, the present invention relates to a method for filling in closed polygonal images, and in particular, a method for filling in closed polygonal images expressed as digital images in which all the images surrounded by a closed polygonal image are colored with the same color. This paper relates to a filling method for closed polygonal images, which is necessary when generating images.

(Prior Art) Regarding the conventional method of generating a digital image from a given figure in which the pixels surrounded by the figure are colored with the same color, the filling method shown in FIG. The case where image 20 is obtained will be explained as an example.

Figures 1 (a) and (b) are diagrams showing an example of a figure and a filled image, respectively; Figures 2 (a) to (d) #i When obtaining the filled image shown in Figure 1 (b) using the conventional technique FIG. 3 is a diagram illustrating an example of filling processing.

As a first step, the pixel 50 which becomes the seed shown in FIG. 2(a) K
is applied to, for example, the raster line 100 of the figure 10, and as a second step, starting from the pixel 50, the raster line 10 is colored.
0 in the two-axis direction to trace the pixels, and the figure 10 is
If the pixel is not a pixel that the contour line passes through, and any of the pixels adjacent to the top, bottom, right, left, or right is colored, the pixel of interest is colored to obtain the result 101 shown in FIG. 2(b), and the third step is performed. The raster 100 is main-scanned in the negative X-axis direction starting from the pixel 50 and the above processing is performed to obtain the image shown in FIG.
Obtain the result 102 shown in c), trace the rasters by sub-scanning from the raster 100 in the X-axis direction as the fourth step, and perform the same processing as the raster 100 for each raster. The result 103 shown in FIG. 2(d) is obtained, and as a fifth step, the raster is traced by sub-scanning from the raster 100 in the negative y-axis direction, and the raster 10 is traced for each raster.
Perform the same processing as in 0 and create 5g1 diagram φ)
A filled-in image 20 shown in FIG. 1 is obtained.

However, such an image filling method often has the drawback of requiring scanning in the consecutive direction.

(Objective of the Invention) The present invention has been made in order to remove the above-mentioned points, and its purpose is to provide a filling method for closed polygonal images that completes the filling of the image by main scanning in one direction and sub-scanning in one direction. It is about providing.

(Structure of the Invention) According to the present invention, there is provided a polygon storage means for storing a closed polygon image to be filled, and a plurality of sides constituting the closed polygon image represented by the contents of the polygon storage means are set as starting sides. an edge classification means for classifying the edges into stop edges and other edges; a start point generation means for generating start point candidates for filling 1 from edges classified as start edges by the edge classification means; a starting point notation 1 means for storing starting point candidates to be filled in, a stopping point generating means for generating filling stopping point candidates from edges classified as stopping edges by the edge classifying means, and a stopping point generated by the stopping point generating means. A stopping point storage means for storing candidates, an output recording means for storing results, and a point group to be filled in by referring to the contents of the output storage means, the contents of the starting point storage means, and the contents of the stopping point storage means. A method for filling in a closed polygon image is obtained, characterized in that the method includes a calculation means that is determined as the content of the output storage means, and the filling method for a closed polygon image is provided in which the starting point storage means and the output storage means are shared. Furthermore, a filling method for closed polygonal images in which the stop point storage means and the output storage means are shared is obtained.

(Source of the Invention 4) Next, the principle of the present invention will be explained using FIGS. 3(a) and (i).

Figures 3(a) and 3(i) are diagrams for explaining the principle of the method of filling in closed polygonal moats according to the present invention.

If the figures 300 shown in FIG. 3(a) are arranged in a row, all Ii! The contents of the start point storage means and the stop point storage means are stored using the output digital *+ image whose Ii lines have been cleared and a digital image that is the same size as the output digital image and in which all pixels have been cleared in advance. In the second step, a pixel group 301 (!) through which the outline of the figure 300 passes is constructed.
A value as a starting point candidate is given to a pixel group of the digital image constituting the starting point storage means that corresponds to a pixel group shown with diagonal lines in FIG. As a third step, pixels of the moving element group 301 through which the outline of the figure 300 passes are indicated by diagonal lines in FIG. In the first case, if the target 1I
A value as a starting point candidate is imprinted on a pixel of the digital image constituting the starting point storing means corresponding to the 2j element, and the digital image constituting the stopping point storing means corresponding to the nuclear attention 1 pixel. II! If element j is not assigned a value as a stop point candidate, the pixels adjacent in the X-axis direction to the pixels constituting the output digital image corresponding to the pixel of interest are colored, and in the second case, if A pixel of the digital image constituting the starting point storage means corresponding to the pixel of interest is not given a value as a starting point candidate, and a pixel of the digital image needle constituting the stopping point storage means is not given a value as a stopping point candidate. If the pixel is given, i: The pixels adjacent in the X-axis direction to the pixels constituting the output digital image corresponding to the pixel of interest are not colored, and in the third case, and not in the first case. If the second case is not the case, then the output digital ii corresponding to the pixel of interest is a pixel adjacent in the X-axis direction to the pixel constituting the output digital image corresponding to the pixel of interest l[lii.
! By assigning one pixel of the Ii image and proceeding with scanning according to the above three cases, the closed polygon 1iIi is filled in.

In order to explain the processing according to the above principle in the raster 310 shown in FIG. 3(C)t(d), FIG.
, the raster 310 of (d) as the third prisoner (e),
(f) and the raster 31 of the output digital image.
The raster corresponding to 0 is extracted and shown in FIG. 3 (2) K. In the following description, the I! raster 310 of FIG. 3) constitutes the output digital image through which it passes. ii'4 in the main running direction pixel 360, tllIj pixel 361. ~
2 pixels 373, and constitutes the starting point storage means through which the raster 310 in FIG. i
Pixel 3201 pixel 321 .
~1 pixel 333, and pixels 3401 and 341. in the -A main scanning direction of the digital image constituting the stopping point storage means through which the raster 310 in FIG. 3(f) passes. ~, one-sided element 353.

The upper position begins by getting used to the front, fixed 1i 320 and said side fi 340. In this case, since both the i value 320 and the pixel 340 have been cleared, the value of the pixel 361 adjacent to the pixel 360 in the X @ force direction has the value of the pixel 360, but the pixel 360 Since it is the first pixel to be scanned in , it has been cleared in advance, and as a result, pixel 360 is not colored and scanning proceeds to pixels 321, 341 and 361. Said side J3
21 and said side! In 341, the pixel 321 is given a head value as a starting point candidate, and the pixel 341 is not given a value as a stopping point candidate.
Pixel 362 adjacent to pixel 61 in the X-axis direction is colored and scanning proceeds to pixels 322, 342 and 362. In the pixel 322 and the pixel 342, since both the pixel 322 and the pixel 1342 are cleared, the pixel 36
The value of the pixel 363 adjacent in the X-axis direction of 2 is the value of the pixel 36
The value becomes 2, and the pixel 363 is colored. Similar processing continues to color pixels 364 and 365, and scanning proceeds to pixels 325, 345, and 365.

In the pixel 325 and the pixel 345, the pixel 32
5 is given ++n as a starting point candidate, and the pixel 345 is given IM as a stopping point candidate, so the li! ! 11 adjacent to i-element 365 in the X-axis direction! ! The i element 366 takes a fraction of the pixel 365, and
l! The ii element 366 is colored. Below, the pixel 362
The process performed in the pixel 366 shown in FIG.
．． 367.369, 370 and 371, resulting in pixels 367.368, 370, 371 and 372
The pixel 369 is colored by performing the processing performed at the pixel 365 at the pixel 368 shown in FIG.
and proceed to 372. The pixel 332 and the pixel 352
In , since the pixel 332 is not given a value as a starting point candidate and the pixel 352 is given a value as a stopping point candidate, 1-1 element 373
X1Jl in Junki Raster 310vC! ! Wow, that's funny.
.

To perform the above processing on all rasters, the isomorphic 300 is the same as the dll! The output n digital j% j! 30 total one-way main run left and one direction secondary electron only '4 thing - - umbrella.

Here, 11 people appear digitally! [? Il'J 30 is the 1st +; II (b) K shows 140 crushed, 5. Although it includes an extra part that is shifted by one pixel from 20, the pixels in this shifted part are not actually A, and if you need a result that does not color the pixels in the shifted part, use the above method. By adding the output digital image and the output digital image, you can easily find the desired mother-in-law.

Now, in order to move M of the present invention, K is as shown in Fig. 3(e).
Shown with diagonal lines: Candidates for the starting point and the surface element group in Figure 3 (d
) Since it is necessary to find in advance the pixel value that will become the stop cursor indicated by K$1, the method for doing so will be described below.

First, the sides of the figure 300 shown in No. 31 (a) are
00 contour in a clockwise direction.
Vector group 101 shown in Figure (i). Circle, ~, 101□ ・・・・・・(1
)think of. When the vector group is introduced, Figure 3 (e
) The pixel that becomes the starting point candidate indicated by K is the pixel that becomes the vector stopping point candidate.
After examining the y-axis direction component of the vector group of the above formula (1) and classifying the edges using the above method, the identified vectors become gi elements.
A pixel serving as the starting point candidate and a pixel serving as the stopping point candidate can be obtained.

(Example) Next, the present invention will be described with reference to FIG. 4 and FIG. 7.

FIG. 4, FIG. 5, and FIG. 6 respectively show the first example of the closed polygon image confidence-busting method of the present invention. Second. A block diagram showing the third embodiment and FIG. 7 are shown in FIG. 4.

7 is a conceptual diagram expressing the contents of the polygonal shadow storage means in FIG. 6 on memory; FIG.

First, using the first embodiment shown in Figure 41, we will create Figure 3 (i).
As an example, we will perform the Chokaku Taxmei, using the example of the Nariai where the solid 300 shown by K cools and crushes the town.

The shape 300 has the apex of the Pig shape as the corner zllN! Clockwise as viewed from the direction, the position vector v1+ ■2 t~+ vIx −” is ordered by 1fi and has the meditation value as its component.
'(2) and the distance aN (=12) of the vertex in g, and is stored as the contents of the polygon storage means 400 as shown in FIG. On the other hand, the starting point Ci yo half step 430, the stopping point storage means 450, and the output point 470 lights displaying the same proboscis (memory). It's possible.

The processing is performed by the control means 490, which is constituted by a conbeater, for example, as an initialization process, by initializing all pixels of the image memory constituting the start point storage means 430, all pixels of the image memory constituting the stop point storage means 450, and the output storage means. 470
The process begins by writing the value "0" to all pixels of the image memory constituting the image memory. After the initialization process, the control means 49
0 activates the classification means 410. As a first step, the activated classification means 410 sequentially extracts two consecutive position vectors vi *v4 +t (i=1.2~,12) from among the position vectors represented by the contents of the polygon storage means 400, and In the second step, the amount of change Δ'/i defined by the following equation (3) is calculated from the device vector vi+vi+1 at the extracted position.

Δ'1i=(vi41f)'/acid component (V<)y component) -=43) Next, in the third step, if the amount of change Δ'/i is negative, it is used to calculate the amount of change Δyi. The position vector v4+”i+1 is set as the starting point generating means 420.
If the amount of change Δ'/i is positive, the first ward vector V, , V, used to calculate the amount of change Δ'/i.
, is sent to the stopping point generation means 440, and the above processing is performed until j =
1121-112. Now, the starting point generation means 420 receives the two position vectors Vi from the classification means 410.

Every time Vs41 is received, the position vectors Vs and V6+ of the two pixels forming the contents of the starting point storage means 430 are
Ii "1" is written in the pixel group through which the line segment determined by 1 passes, and the stopping point generating means 440 writes the contents of the stopping point storing means 450 every time it receives two position vectors V, , Vj+1 from the classification means 410. Pixel # through which the line segment defined by the two position vectors V, , Vj+1 passes among the pixels constituting
Write the value "1" to.

As described above, the one side classification means 410 and the starting point generation means 42
0 and the stopping point generating means 440 operate in synchronization, and after the classification means 410 finishes processing, the control means 49
0 activates the calculation means 460. Activated calculation means 4
60 performs main scanning in the image % axis direction and secondary scanning in the y@force direction, focusing on one pixel on each scanning line, and in the first case, if the content of the starting point storage means 430 determined by the pixel position is If the constituent pixels are given the value "l#" and the pixels making up the contents of the stopping point storage means 450 determined by the pixel position are given "cough 90", the output storage means 470 determined by the pixel position. In the second case, if a pixel constituting the content of the starting point storage means 430 determined by the pixel position is given a value of 60''. In addition, the value "1" is assigned to the pixels constituting the contents of the stopping point storage means 450 determined by the pixel position.
If # is given, the pixels adjacent in the X-axis direction to the pixels constituting the contents of the output storage means 470 determined by the pixel position will not be colored, and in the third case, even in the first case, the pixels will not be colored. If it is not the case of 2, the value of the pixel constituting the contents of the output storage means 470 determined by the pixel position is given to the pixel constituting the contents of the output storage means 470 adjacent to the pixel in the X-axis direction, and all Similar processing is performed for the scanning line , and the processing ends.

When the calculation means 460 finishes the above processing, the JJ control means 490 starts the display means 480tl-. The activated display means 480 checks the values of pixels constituting the contents of the output storage means 470 and displays pixels having the same value in the same color,
As a result, processing is performed to display the area surrounded by the graphic 300 in the same color.

Next, in FIG. 5, the second embodiment replaces the output storage means 470 of the first embodiment (shown in FIG. 4) with the starting point storage means 4.
Since 4 is shared with 30, the same result can be obtained if the operation in the first embodiment is performed as is. According to the embodiment @2, the output storage means 470 can be omitted, so the first
The price is lower than that of the embodiment.

Next, in FIG. 6, in a third embodiment, the output storage means 470 of the first embodiment is shared with the stop point storage means 450, and the same effect as the second embodiment can be obtained. .

Note that the above 1. - In the third embodiment, the starting point generating means 4
20, a value as a starting point candidate is assigned to the pixel where the side of the vector of equation (1) described in the explanation of FIG. 3(i) curves, which is attached to the side of the figure 300 shown in FIG. The negative type starting point generating means 440 uses the vectors #El, E2 . ~.

rJ through which the side whose y-axis direction component is positive among E+2
A formal stopping point generating means is adopted which gives a hani as a stopping point candidate to the M element, and furthermore, the calculating means 460VC has a screen t-J.
: Trace pixels by main scanning in the axial direction and sub-scanning in the y-axis direction, and in the first case, if the pixel of the digital image forming the starting point storage means corresponding to the pixel of interest is assigned a value as a starting point candidate. is given, and if the 1IilI element of the digital 1Iij1 which constitutes the stopping point storage means corresponding to the pixel of interest is not given direct as a stopping point candidate, then the AIT4 pixel output digital image corresponding to the noted pixel is In the second case, a value as a starting point candidate is given to the pixel of the digital image forming the starting point storage means fI# corresponding to the pixel of interest. lI of the digital image 1 which is not stored and which constitutes the stopping point storage means! j
If 1 shift is given as a stopping point candidate, the pixels adjacent in the X-axis direction of the pixels constituting the rM recording output digital image corresponding to the noted 1I11i element are not colored,
In the third case, if it is neither the first case nor the second case, the attention 1j element is present in the neurite adjacent in the fjROX axis direction that constitutes the output digital +im image corresponding to the attention pixel. We have described a closed polygonal image filling method that employs a forward transfer means that assigns pixel values of the output digital image corresponding to the above and advances scanning according to the three cases mentioned above.The same effect as that method is as follows. It can also be obtained by the five fill-in methods shown in (1) and (V). That is, (1) the starting point generation means employs the Wl-written negative type di1 starting point generation move, the stopping point generation means employs the positive type stopping point generation means, and r) the E calculation means employs the drawing ml is main-scanned in the X-axis direction and sub-scanned in the y-axis direction to trace the pixels. !ii element is given 11σ as a starting point candidate, and 1st shift as a 1st stop point candidate is assigned to IJ A of the digital image 1-1! which constitutes the stop point storage means corresponding to the pixel of interest. If not given, the pixel adjacent in the negative X-axis direction to the pixel constituting the output digital image corresponding to the noted lff11g is colored, and in the second case, if the starting point storage means corresponds to the noted pixel If the pixel of the digital 1i1tl image constituting For example, the output digital 1iue corresponding to the pixel of interest is 1 adjacent in the negative two axis directions of the pixel forming #4.
iiiilg is not colored, and in the third case, if it is neither the first case nor the second case, in the negative X-axis direction of the pixels constituting the output digital image corresponding to the 11 m pixels of interest. The 1j element that is in momentary contact has the ui of the output digital -1 family corresponding to the 11ij element of interest.
A method that employs a backward transfer means that assigns a value of [ and proceeds with scanning according to the above three cases. (11) The starting point generating means includes the vector #E1. Ez, ~(h (y out of 2
A negative-type starting point generation means is adopted that assigns a value as a starting point candidate to a pixel that momentarily contacts in the X-axis direction of a pixel through which a side whose axial direction component is negative passes, and a stop point generation means is used. The vector group E, , E2. ~+EI2, the negative side of the pixel whose y-axis direction component is positive passes through, t7) in the x-axis direction.

A method that employs backward regular stopping point generation means that assigns values as floating point candidates to adjacent pixels, and employs the forward transfer means as the calculation means. 0il) The starting point generation means assigns a value as a starting point candidate to 1j elements adjacent in the X-axis direction of the pixel through which the side whose y-axis direction component is a tortoise passes among the vector details E1 r "2 + ~ 1E12. A picture adjacent in the X-axis direction to the pixel through which the side whose y-axis direction component is positive!!
A method in which a forward regular stopping point generating means is employed to give a value as a stopping point and a stop point to 4, and the above-mentioned rearward %5 sending means is employed as a calculation means. The q-cutting start point generation means includes the front, ! i: A method in which a negative type starting point generation means is adopted as the positive type stopping point generation means, a positive type stopping point generation means is adopted as the stopping point generation means, and the arithmetic means VcVi employs the forward transfer means. (V) The starting point generating means employs the negative type start generating means, the stopping point generating means employs the forward positive type stopping point generating means, and the 6il calculation means employs the above-mentioned Ling direction transfer means. It is a method.

(Effects of the Invention) As is clear from the above explanation, according to the method of discarding unexploded #f3 polygonal images, a closed polygonal image can be created by 12fl with only 10,000 main scans and one direction sub-scan. Since it is possible to fill the area with the same color, it is more convenient than a method that requires multiple scans. The effect is that it can be executed in 4th gear.

[Brief explanation of drawings]

Figures 81 (A) and (b) are diagrams showing an example of figure and fill 11ai* processing, respectively, and Figure 3 (&) and
) describes the principle of the filling method for closed polygonal images of the present invention as P
Figures 4, 5, and 6 are for illustrative purposes, respectively. Second,
A block diagram showing the third embodiment and FIG. 7 are shown in FIG.
6 is a conceptual diagram expressing the contents of the polygon storage means in FIG. 6 on memory. In the figure, 400...polygon storage means, 41
0... Cutting JA means, 420... Starting point generation means, 430... Opening point storage means, 44
0...stop point generation means, 450...-stop point storage means, 460...calculation means, 470.
... Output storage means, 480 ... Display plain wave, 4
90... Control means. Enjoy! I grass 2 Figure 2nd count J Figure (a) 稟 3yS Collection 3WJ Ce) Cf) V/l

Claims (3)

[Claims] (1) A polygon storage means for storing a closed polygon image to be filled, and a plurality of sides constituting the closed polygon image represented by the contents of the polygon storage means, into a start edge, a stop edge, and other edges. an edge classification means for classifying, a start point generation means for generating filling start point candidates from the edges classified as start edges by the edge classification means, and a start point memory for storing the start point candidates generated by the start point generation means. means, stopping point generating means for generating stop point candidates for filling from edges classified as stop edges by the edge classification means, stopping point storage means for storing stopping point candidates generated by the stopping point generating means, and a result. and an arithmetic means for determining a group of points to be filled in as the contents of the output storage means by referring to the contents of the output storage means, the contents of the start point storage means, and the contents of the stop point storage means. A filling method for a closed polygon image, comprising: (2) In the closed polygon image filling method described in claim (1), the output storage means and the starting point storage means are shared, and the calculation means uses the contents of the stopping point storage means and the starting point storage means. A filling method for a closed polygon image, characterized in that a group of points to be filled in is recorded in the contents of the starting point storage means with reference to the contents of the starting point storage means. (3) In the closed polygon image filling method described in claim (1), the output storage means and the stop point storage means are shared, and the calculation means uses the contents of the stop point storage means and the start point storage means. A filling method for a closed polygon image, characterized in that a group of points to be filled in the contents of the stop point storage means is recorded by referring to the contents of the image.