JPS63219087A - Surface painting out device for polygon - Google Patents

Abstract

PURPOSE:To execute the surface coating of even the internal part of any polygon of a complicated shape with a simple processing and at high speed by providing a controller to clip and form a new polygon in a polygon boundary area. CONSTITUTION:In a laser beam printing device 1, when the coordinate data of the peak point of a polygon and a boundary area are given from a computer, a controller 2 having a minimum/maximum value extracting means, etc., clips the given polygon in a boundary area and generates a new polygon. Next, the data of an image painting out the internal part of the new generated polygon are generated and this is stored into a bit map memory 3. The controller 2 reads successively the image data stored into the memory 3, outputs them to a laser diode driver 4, the driver 4 emits a laser diode 5 and prints out an image. Thus, the internal part of even any polygon of the complicated shape can be surface painted out with a simple processing and at high speed.

Description

DETAILED DESCRIPTION OF THE INVENTION Field of Industrial Application The present invention relates to a polygonal surface coating device, and more specifically,
This invention relates to a device for filling the inside of a polygon. especially,
It is useful in printer devices and VDT devices.

Prior Art As shown in FIG. 17, it is assumed that ΔABC is given and the inner surface thereof is to be painted.

In this case, first, set y=1 and paint between the two points A and B, then set y=2, and from the equation of line segment AC, point P,
, and also calculate the point P from the equation of the line segment BC, and paint between the points p and -p2, and make this L=3.4, 5.
A technique is conventionally known in which the interior of ΔABC is painted repeatedly for 6.

In this prior art, the polygon is as shown in FIG.
In the case of a complex polygon ABCDEF, as shown in FIG. 19, two relatively simple polygons A1BCD and A,
02EF and surface painting is performed separately for each polygon.

Such a conventional technique is disclosed, for example, in Japanese Unexamined Patent Publication No. 61-873.

Problems with the conventional technology In the above-mentioned conventional technology, when painting a complex polygon,
It is necessary to break it down into several simple polygons and apply surface coloring to each of them, which poses a problem that the process is complicated and takes a long time.

However, if you try to fill a complex polygon without breaking it down into simple polygons, for example, as shown in Figure 18, y
On the contrary, the process becomes complicated, such as when there is an exceptional process of painting between 3 points B-D-F when = 3, and an exceptional process of not painting between 2 points C-E when F = 5. However, there is a problem in that it takes a long time.

OBJECTS OF THE INVENTION An object of the present invention is to provide a polygon surface coating device that can coat even complex-shaped polygons with simple processing and at high speed.

Structure of the Invention The polygon surface coating device of the present invention includes a maximum/minimum value extracting means for extracting a minimum value and a maximum value T from the y-coordinate values of each vertex of a polygon; Qn, the vertices adjacent to the front are Qn+, and the vertices adjacent to the back are Qn-1.
When , the vertex Q is a polar point determining means for determining whether the vertex Qn is a maximum or minimum in comparison with the preceding and succeeding vertices;
When n is a pole, the side Qn-I Qn, and when the vertex Q is not a pole, the side Qn-+ Qn' (however, the point Qn' is 1 in the y direction from the vertex Qn, and the vertex Qn-1
), the minimum value in the y direction ys, , y
The X coordinate value "1m" of the point with the maximum value 3'm in the direction, and the minimum value ymi in the )' direction and Δx/Δy of that side are calculated, and this set of data (V w , Y l + IX +
x7 ma+ + Δx/Δy) for all vertices to create an edge table; a work table creation unit that extracts the set data of ymax=L from the edge table to create a work table; and a workpiece. The set data in the table is made into pairs of two sets in the order of Xyl, , and the y coordinate is L and the x coordinate is X7+n of each pair.2
a painting means for filling in between points, a set data erasing means for erasing the set data of y-a-=L from the work table;
For each set of data in the work table, Δx/Δ
An updating means that newly adds the sum of y to XYm, a set data adding means that increments L, extracts set data of ymax=L from the side table, and adds it to the work table, and sets data from the above-mentioned kneading means. Adding means, L
A structural feature is that it is provided with a repeating operation means for repeating the operation within the range of ≦T.

DESCRIPTION OF THE PREFERRED EMBODIMENTS The present invention will be explained in more detail below based on embodiments shown in the figures. Here, FIG. 1 is a conceptual diagram of a laser blinking device including a polygonal surface coating device according to an embodiment of the present invention, FIG. 2 is an illustrative diagram of a given polygon and a boundary area, and FIG. 3 is a diagram of a boundary area. An illustration of the new polygon clipped by the region,
FIG. 4 is an exemplary diagram showing a state in which a new polygon is filled,
FIG. 5 is a flowchart of an example of the operation of image processing in the laser printer shown in FIG. 1, FIG. 6 is a flowchart of an example of the operation of polygon clipping processing of the laser printer shown in FIG. 1, and FIG. A flowchart of an example of the operation of the process to find a new edge, FIG. 8 is an example diagram showing the relationship between line segments and boundary lines, FIG. 9 is a flowchart of an example of the operation of the edge clipping process, and FIG. 10 is the boundary point output process. Flowchart of an example of the operation of FIGS. 11 to 14
The figure shows an example of a new polygon created by clipping a polygon with a boundary line, FIG. 15 is a flowchart of an example of the operation of side table creation processing, and FIG. 16 is an example of an example of a side table. Note that the present invention is not limited to the embodiments shown in the figures.

In the laser printer device 1 shown in FIG. 1, when the coordinate data of the vertices and the boundary area of a polygon are given from the computer, the controller 2 generates a new polygon by crimping the given polygon with the boundary area. Then,
Data of an image in which the inside of the new polygon is filled is generated and stored in the focus map memory 3.

Then, the controller 2 sequentially reads out the image data stored in the bitmap memory 3 and outputs it to the laser diode driver 4.

The laser diode driver 4 causes the laser diode 5 to emit light and prints out an image.

To give a concrete example, as shown in Fig. 2, polygon A G
CD E H is given and the boundary region is x,
1. ≦X≦” laX I V III≦y≦y− is given, as shown in Fig. 3, polygon A G C
A new polygon ABCDEF is generated by clipping D E H at the boundary area, and an image with the inside of this polygon ABCDEF filled in is printed out as shown in FIG.

Hereinafter, the operation of image processing in this laser printer device 1 will be explained in detail with reference to FIGS. 5 to 16.

First, as shown in FIG. 5, the controller 2 receives the coordinates of the vertices and the boundary area of a polygon from the computer (LJI).
GCDEH and boundary region X.

≦xSx1. Assume that y, l5y5y1 are given by the computer.

Next, the controller 2 performs polygon clipping processing (tJ2).

In the polygon clipping process, as shown in FIG. 6, x"" X III is selected as the boundary line (Gl).

Next, a process is performed to find new sides of a new polygon created by clipping the given polygon using the selected boundary line x''X all (G2).

In the process of finding a new side, as shown in FIG. 7, one side is extracted from each side of the polygon and the coordinates of its both end points are obtained (Hl). For example, one side AC of polygon ACCDEH
Take out its end point A.

Coordinates of G (x++, ya,), (Xg, Vg
).

Next, an area riffing process is performed (H2).

As shown in Fig. 8, the edge talimbing process is performed by
, β is clipped at the boundary line X=X3 to obtain a new line molecule β.

As the boundary line x-x3, the boundary line
” X In is given, and the point α has the end point G
corresponds to the point β, and the end point A corresponds to the point β.

Note that point γ on side AG is named point B.

As shown in FIG. 9, the controller 2 first
, is checked (Sl).

In the case of the relationship shown in FIG. 8, since xcL<X3, the process moves to step S2.

In step S2, it is checked whether XB<X3. In the case of the conditions shown in FIG. 8, since XB<X3 is not satisfied, the process moves to step S3.

In step S3, it is checked whether it is XB-X3.

In the example shown in FIG. 8, since xB is not X, the process moves to step S4.

In step S4, the α point is set at 23 points, and the β point is set at 22 points, that is, X knee X I ry, -yI
Then, XB =X2. Place YB → V2.

Next, boundary point output processing is performed (S5). This boundary point output processing is shown in detail in FIG. are added to calculate the additional value y (R1).

Next, the added value X is shifted by 1 bit in the LSB direction to obtain a shifted value Xf (R2). This is an addition (a X ,
This corresponds to dividing by 2, but since it is a shift process, it can be performed much faster than a division process.

Next, the added value y is shifted by 1 bit in the LSB direction to obtain a shifted value y1 (R3). This also corresponds to addition (directly dividing y by 2), but it can be processed much faster.

The above steps R1 to R3 are performed at the point PH (X++ YI)
Since this is nothing but a process of calculating the dividing point of point P2 (X21 y2), the bisecting point of points α and β in FIG. 8 is obtained.

Next, it is checked whether the absolute value of the difference between the shift value X (and the X coordinate value x3 of the boundary line) is smaller than 1 (R'4).

If shift value XI is smaller than xa by 1 or more (R4, R6)
, the calculated 1-minute point is to the left of the boundary line X-X3, so
xf-X+, 3'f-3'+ (R7), and return to step R1. This corresponds to replacing the line segment connecting the two points α and β with a line segment connecting the dividing point and β.

On the other hand, if Xi is greater than xa by 1 or more, (R4°R6)%
Set Xf-+3 (2, yfmy2 (R8) and return to step R1. This means that the line segment connecting the two points α and β is
This corresponds to replacing α with a line segment connecting the segment point.

In this way, the dividing points of the line segment are found one after another, and xa
Repeat until substantially equal to .

X, substantially coincides with the shift value xI and the boundary line X
Since the absolute value of the difference between the coordinate values x3 is smaller than 1, the shift value y4 is set as the y-coordinate value y3 of the boundary point P3 (R
5).

By steps R1 to R8, the y coordinate value y of the boundary point P3 is
, but since this processing does not include multiplication or division, y3 can be obtained quickly and with high precision.

By the boundary point output process (S5), the boundary point P.

When the coordinates ON, )'3) are obtained, the boundary point P3 is set as one point (S6), and the line molecule β is set as the line segment to be printed out (S7).

Thus, as shown in Figure 8, the border! ""A line molecule β on the right side of X3 is obtained, which means that a new side AB has been obtained.

Now, in the example shown in FIG. 8, X, t<xa<XB, but new sides can be obtained in the same manner in other cases.

For example, if x, > xa > xB, then α point and β in Figure 9
A new edge can be obtained by exchanging the points (82' to 37').

Also, if )'c+j8 matches X, a new edge can be obtained without performing boundary point output processing (S8,
8').

Furthermore, if the two points α and β are both within the area, the original side αβ becomes the new side as it is. (310).

Furthermore, if neither of the two points α and β is within the area,
No new edge is generated from the original edge (311).

Now, returning to Figure 7, the riffing process (R2
), when a new edge is obtained, that edge is stored in memory (R3). For example, in the case of Figure 8, the original edge A
G is replaced with a new side AB and stored.

Next, if the edge subjected to the above processing is not the last edge (84
), take the next side and get the coordinates of its endpoints (
R5), return to the above-mentioned area riffing process H2 1 For example,
In the case of polygon AGCDEH, when side AG is finished, side clipping processing (R2) is performed again on the next side GC. Also, when that is finished, side CD, side DE
, side EH, and side HA are subjected to side clipping processing.

Therefore, as shown in FIG. 11, a new side AB is obtained from the side AG, no new side is generated from the side GC, and the side CD
, DE, EH, and HA, the original edges are obtained as new edges.

When processing is completed for all sides (H4), a vertex table of the polygon formed by the new sides is created (H
6). In the example shown in FIG. 11, the newly obtained sides are AB, CD, DE, and EH.

Since it is EA, its vertices are A, B, C, D, E,
H, indicating that it is a polygon. The new sides of that polygon are AB, BC, and CD.

It can be seen that they are DB, EH, and HA.

Returning to FIG. 6, by step G2, the boundary line x”
After finding the new side of the polygon clipped in IIm, next set the boundary line to y = y- (G3), clip the new polygon obtained earlier at that boundary line, and create a new side. Perform the required processing (G4).

Figure 12 shows the result, and the polygon ABCDEH
The original edge of becomes the new edge without any change.

Next, step G5. By G6, as shown in FIG. 13, vertices A, B, C, D, E, and F are obtained, and a new polygon is obtained.

Similarly, step G7. G8 yields the BCDEF to the new polygon as shown in Figure 14, but as will be understood with reference to Figure 3, this ultimately converts the original polygon into a bounding region. X1. .

≦X≦x, , y, 1° SV This is a new polygon clipped by SV-Lm.

Now, returning to FIG. 5, the above polygon clipping process (U
When a new polygon ABCDEF is obtained by performing 2), next, side table creation processing (U3) is performed.

In the edge table creation process, as shown in FIG.
Coordinate values of three consecutive vertices (X+,)'+),
(X2,)'2>, (X3, y3)
(Wl). For example, if you take out three points A, B, and C, their coordinate values are (3, 1), (1, 3),
(1°5).

Next, check whether 3'1=312 (W
2), if Y+ = 3'2, step Wl described later
The process moves to step W3, but if 3'l=3'2 does not hold, the process moves to the next step W3. For example, at points A and B, YI
Since =1+312-3, the process moves to step W3.

In step W3, Δx/Δy is calculated as 0. For example, between point A and point B, it becomes (1-3)/(3-1)-1.

Next, it is checked whether the center point (X2.72) is a maximum or minimum point when compared with the previous and subsequent points (W4).
If yl-'! z, read the point (x4174) further before the point (Xi-yz) and calculate its V+ and yl
Compare with to determine local maximum and minimum. If it is a pole, the process moves to step WtO, which will be described later, and if it is not a pole, the process moves to the next step W5. For example, since point B is neither the maximum nor the minimum when compared with points A and C, it is determined that it is not a maximum point.

When it is determined that the center point (12,312) is not a pole,
The size of yl and y3 is checked (W5), and
If yl>y3, the process moves to step W6 and 3'l
> Ft, proceed to step W6''0 For example, at points A and C, yl > y3, so step W
Move to 6.

In step W6, y is decremented.

On the other hand, in step W6', y is incremented. This means moving the center point closer to the point behind by 1 in the y direction. For example, in the case of point B, it is brought closer to point A, and y2=3-1=2.

Next, it is checked whether Y+-12 or not (Wl), and if they are equal, the process moves to step wtt, which will be described later; if they are not equal, the process moves to the next step W8.1For example, at points A and B, 'Since I=y2, the process moves to step W8.

In step W8, it is checked whether Fl > yl. In this case, since yl > yl, step W9 is skipped and the process moves to step WIO.

In step WIO, set data (3' v
s + Y 1 * X Y m , Δx/Δy).

Here, y, ..., y- means that the smaller value of yl and y2 is ymi, and the larger value is y-, and xy
mi means the above-mentioned y11. of the X plate and x2. For example, in the case of point A and point B, V m =
1.11= 2 (Suf y )W 6 te3'2 wotechrement), xY m 73+ Δ
x/Δy=-1, and these are stored as one set in the edge table.

In the above, the points (X+, )'+) and (X2', y2) are made to correspond to the points A and B, but in the following, all the vertices at both ends of each side of the polygon are made to correspond in the same way. The above steps W1 to WIO are repeated (Wll, W12), and when the processing is completed for all sides, the creation of the side table is finished.

By ending the edge table creation process (U3),
For example, in the case of polygon ABCDP:F shown in FIG. 3, a side table as shown in FIG. 16 is obtained.

Returning to FIG. 5, next, a set data string is created (U4).

This is performed as preprocessing for creating a work table for I&T.

To create a set data string, set data are extracted from the side table in order of decreasing ymi and arranged in one column. ymi is omitted, and instead, between set data of different y and 1°, ymi Insert as many delimiter codes as the difference between 0
For example, the following set data string is generated from the edge table shown in FIG.

r2,3. -1.3,3. IJJ 5,1,0°5.3
．． -1.5,3. IJ 5, 5.0'' Next, the controller 2 extracts the minimum value from the y-coordinate values of each vertex of the polygon, and sets the scanning line to the minimum value (U5).
For example, in the case of polygon ABCDEF shown in FIG.
Since L=1, the scanning line is set to 1.

Next, a work table is created by extracting the set data of )' m = L from the set data string (U6).

For example, if L=1, we will extract the set data of y, , = 1, which is [2, 3, -1, 1 and (3, 3
, 11, the work table is [2, 3, -1
, 3, 3, l).

Next, set the obtained work table set data to X7wY
Sort in descending order of @Is (U7), for example, in the case of work table (2, 3, -1, 3, 3, 1),
Since xYen are equal, the order remains the same.

Next, set data in the work table 2 in the order of “Y*+m”.
Fill in the space between the two points where the y coordinate is L and the x coordinate is "1w" of each pair (U8).For example, from the work table above, only 3 is obtained as "ym", so L
= 1, so only the point (3, 1) will be painted. That is, point A in FIG. 18 will be painted.

Next, select y from the set of data in the work table.

Those whose value matches the scanning line value, that is, L are erased (U9). For example, if the work table is [2, 3, -1,
3, 3, 1), if L=1, there is no set of data to be removed.

Next, Δx/
Add the value of Δy and set it as new xymi <(UI
O), for example, the work table [2, 3, -1, 3
, 3, 1] becomes (2, 2, -1° 3.4.1).

Next, extract the maximum value T among the y-coordinate values of each vertex of the polygon, and check whether the maximum value T matches the value of the scanning line (Ull). In the case of polygon ABCDEF shown in FIG. 3, T=5.

If T and the value of the scanning line do not match, the value of the scanning line is incremented (U12) and the process returns to step U6.

When the process is incremented and L=2 and the process returns to step U6, the set data of ymax=L is extracted from the set data string again and added to the work table 0. For example, L=
2, this is equal to y, 5. Since there is no set of data with this, no new set of data is added to the work table.

Next, steps υ7 and U8 are performed, and line painting is performed with incremented scanning lines. For example, point (2, 2
) and the point (4, 2), that is, between P and -P2 in FIG.

Next, in step U9, for example, considering L=2 on the work table (2, 2, -1, 3, 4, 1),
From this group data +2.2. -1) is deleted, so only [3°4.1] remains on the work table.

Next, in step UIO, for example, the work table (
3,4,1) becomes (3,5,1).

Next, when L=3 and the process returns to step U6, y-=L
=3 set data is added to the work table, and the work table is, for example, (3, 5, 1, 5, 1, 0, 5, 3
, -1, 5, 3, 1).

This work table is created as xyl, in step U7.

Sorted in descending order of (5, 1, 0° 5.3
．． -1.5, 3, 1.3, 5.1).

Then, in step U8, point (1, 3) and point (3
, 3) is filled in, and also between the points (3, 3) and (5, 3).
) is painted. That is, between B and D in FIG.
-F.

Next, in step U9, the set data of y-=L=3 is deleted, so the work table becomes (5,
1,0,5,3,-1,5,3,l).

Next, in step UIO, the work table is (5, 1
, 0, 5, 2, -1, 5, 4, 1).

Next, when it becomes L-4 and returns to step U6, the work table is (5, 1, 0, 5, 2, -1, 5, 4, 1,
5,5,O).

This work table is arranged in ascending order of xyw++. Therefore, the work table remains the same even after step U7.

In step U8, the area between the point (1, 4> and the point (2, 4) and between the point (4, 4) and the point (5, 4) is painted. That is, between P3 and P4 in FIG. It is between P5 and PG.

In step U9, there is no group data to be deleted, and in step U
In IO, the work table is (5,1゜0,5.1.-
1.5.5.1.5.5. O).

Next, when L=5 and the process returns to step U6, there is no change in the work table, there is no change in step U7, and in step U8, the point (1,5) is painted and the point (5,5 ) is painted. That is, points C and E in FIG. 18 are painted.

In step U9, all set data are erased.

Therefore, nothing is done in step UIO.

In step Lllll, the value of L matches the maximum value T, so all processing is terminated.

In this way, as shown in FIG. 4, the inside of polygon ABCDEF has been painted.

As can be understood from the above explanation, this laser printer device 1 generates a new polygon by clipping a given polygon in a given boundary area, and prints out an image with the inside of the polygon filled in. can do.

Effects of the Invention According to the present invention, maximum/minimum value extraction means extracts the minimum value and maximum value T from the y-coordinate values of each vertex of a polygon, Adjacent vertices are Qn
+1. When the vertex adjacent in the backward direction is Qn-1, a pole determining means determines whether the vertex Qn is the maximum or minimum in comparison with the preceding and succeeding vertices, and when the vertex Qn is a pole, the side Qn -10n, when the vertex Q is not a pole, the minimum value Y II in the y direction for the side Qn-5Qn' (where the point Qn' is closer to the vertex QTl-1 by 1 in the y direction than the vertex Qn). , maximum value y in the y direction,
X coordinate value xy@n of the point with the minimum value ymi in the y direction
and Δx/Δy of that side, and calculate this set of data (V vs + 3' sur + X Y vs
+ Δx/Δy) for all vertices to create an edge table; a work table creation unit that extracts the set data of y, 1, = L from the edge table to create a work table; A line painting means that divides the set data of the work table into two pairs in the order of XFm++ and fills in between two points whose y coordinates are xr and n of each pair, and Y, = L from the work table.
A group data erasing means for erasing the set data of , an updating means for newly setting xrun as the sum of X1m1+ and Δx/Δy for each set of data in the work table, an updating means for incrementing L and calculating 3' w = L from the side table. a set data adding means for extracting set data of and adding it to the work table, and a set data adding means from the above-mentioned kneading means;
Provided is a polygonal surface coating device characterized by comprising a repetitive operation means for repeating the operation within the range of ≦T, whereby the interior of the polygon can be surface coated with simple processing and at high speed. It becomes like this.

[Brief explanation of the drawing]

FIG. 1 is a conceptual diagram of a laser printer including a polygon surface coating device according to an embodiment of the present invention, FIG. 2 is an illustrative diagram of a given polygon and a boundary area, and FIG. 3 is an illustration of a boundary area. FIG. 4 is an example diagram showing a new polygon that has been clipped; FIG. 4 is an example diagram showing a state in which the new polygon has been painted; FIG. 5 is a flowchart of an example of the operation of image processing in the laser printer shown in FIG. 1. , Fig. 6 is a flowchart of an example of the operation of the polygon clipping process of the laser printer shown in Fig. 1, Fig. 7 is a flowchart of an example of the operation of the process of finding new sides, and Fig. 8 is a flowchart of an example of the operation of the process of calculating new sides. FIG. 9 is a flowchart of an example of the operation of edge rifting processing, FIG. 10 is a flowchart of an example of the operation of boundary point output processing, and FIGS. 11 to 14 are diagrams showing the relationship between polygons and boundaries. Figure 15 is a flowchart of an example of the operation of side table creation processing, Figure 16 is an example diagram of an example of a side table, and Figure 17 is an illustration of the basics of surface painting. FIG. 18 is an example diagram showing surface painting of a complex polygon, and FIG. 19 is an example diagram showing surface painting of a complex polygon according to a conventional example. (Explanation of symbols) 1...Laser printer device 2...Controller 3...Bitmap memory 4...Laser diode driver. 0123456X 012345X 01234':+ x Fig. 1 P C Fig. 7 Fig. 6 Fig. 13 Example 1 Fig. 14
Figure 10 Figure 18 Figure 19 Figure 19 012345 X Figure 16 Side table Figure 17 Figure 17 012345

Claims (1)

[Claims] 1. (a) maximum/minimum value extraction means for extracting the minimum value L and maximum value T from the y-coordinate values of each vertex of the polygon; (b) a means for extracting one vertex of the polygon; Q_n, adjacent vertices in the forward direction are Q_n
_+_1, when the backwardly adjacent vertices are Q_n_-_1, a pole determining means for determining whether the vertex Q_n is a maximum or minimum in comparison with the preceding and following vertices; (c) the vertex Q_n is a pole; Sometimes the side Q_n_−_1
For Q_n, when vertex Q is not a pole, edge Q_n_
−_1Q_n' (However, point Q_n' is y from vertex Q_n
(a point approaching the vertex Q_n_−_1 by 1 in the direction), the minimum value y_m_i_n in the y direction, the maximum value y in the y direction
_m_a_x, the x coordinate value xy_m_i_n of the point with the minimum value y_m_i_ in the y direction and Δx/Δy of that side are calculated, and this set of data {y_m_i_n, y_m_a
_x, xy_m_i_n, Δx/Δy} for all vertices to create an edge table; (d) a work table that extracts data set y_m_i_n=L from the edge table to create a work table; Creation means, (e) Make the set data of the work table into two pairs in the order of xy_m_i_n, and set the y coordinate to L and the x coordinate to x of each pair.
line painting means for filling in between two points y_m_i_n;
(f) set data erasing means for erasing set data of y_m_a_x=L from the work table; (g) for each set of data xy_m in the work table;
The sum of Δx/Δy added to _i_n is newly calculated as Xy_m_
Updating means to i_n, (h) increment L and y_m_ from the side table;
A set data adding means for extracting set data of i_n=L and adding it to a work table; and (i) a repeating means for repeating the above (e) to (h) within the range of L≦T. A polygonal surface coating device featuring: