JPS6274165A - Discriminating system for kind of polygon - Google Patents

Abstract

PURPOSE:To automatically discriminate the kind of a polygon by detecting the maximum and the minimum related to a rectangular direction to a scanning line, based on each apex data of the polygon, and checking whether an apex corresponding to these maximum and minimum is one point each or not. CONSTITUTION:A graphic data to which a coordinate conversion processing, a clipping processing, etc. have been performed is inputted to an increase/ decrease detecting part A and an increase/decrease state is detected. This increase/decrease detecting signal is inputted to a maximum/minimum detecting part B and the maximum and the minimum are detected. A maximum/minimum detecting signal is inputted to a piece number discriminating part C, and whether the sum of the number of pieces is <=two pieces or not is discriminated, and by a result of this discrimination, whether a polygon is that which divides one scanning line to only a continuous part of '1' or not is discriminated.

Description

[Detailed Description of the Invention] <Industrial Application Field> The present invention is characterized in that the type of polygon displayed in a single stroke on a scanning display device divides one scanning line into only one continuous part. It relates to a method for determining whether or not they correspond.

<Prior Art> Conventionally, a method of coloring the inside of a polygon displayed in the form of a single stroke on a scanning display has been employed in graphic display devices and the like.

There are various shapes of the polygons mentioned above, and they can be roughly divided into
There are two types of methods: one in which one scanning line is divided into only one continuous part, as shown in FIG. 0, and one in which one scanning line is divided into two or more continuous parts, as shown in FIG.

In the case of the polygon shown in Figure 10, it is sufficient to simply fill in the area between the intersections with the scanning line, but in the case of the polygon shown in Figure 11, the area between the intersections with the scanning line There are parts where there are two or more pairs of intersections, and it is necessary to determine which of the intersections should be filled in and displayed.

Considering this point, for example, Water Filling Heth
As is widely known as od, each vertex data of a polygon is sorted in the processing direction perpendicular to the direction of the scan line, and if necessary, sorted in the direction of the scan line, and Create squirrels 1 to 1 of ridge lines having intersections with , and interpolate between the corresponding ridge lines from the start point to the end point. Then, by creating a list of the above-mentioned edges for all scanning lines and interpolating between the corresponding edges, a method is adopted to display the inside of the polygon by filling it in. Even in square shapes, those that allow the inside to be filled are generally used.

Furthermore, if we consider a method in which the interior of only one type of polygon can be filled in as shown in Figure 10 above, sawing is not necessary and the amount of ridge lines 1~ is reduced. The advantages of n1 are that management can be simplified because the data does not change, and that filling processing can be performed at high speed.

Therefore, if both methods are selectively adopted for -(-, depending on the type of polygon, it is possible to speed up the polygon filling process as a whole. Criteria for selectively adopting the two methods depending on the type of polygon were left to the user's discretion.

<Problems to be solved by the invention> In the conventional selection method described above, the determination of the type of polygon is left to the user's judgment. As a result, it may not be possible to speed up the filling process.
Alternatively, there is a problem that reliable filling processing cannot be performed.

<Object of the invention> This invention was made in view of the above problems,
Specify the type of polygon to be filled by setting one scanning line to one
The purpose of the present invention is to provide a polygon type discrimination method that can automatically discriminate whether a polygon is divided into continuous parts ()) or not.

<Means for Solving the Problems> In order to achieve the above object, the polygon type determination method of the present invention is based on the data of each vertex of the transferred polygon in the direction perpendicular to the scanning line. Detect the local maximum and local minimum, and determine whether the polygon divides one scanning line into only one continuous part, depending on whether there is one vertex corresponding to the maximum or minimum. It is for discrimination.

at L, 1 There is a case c' in which the vertex data of the polygon is transferred sequentially in the order along the contour line, 11? By comparing the i-point data with the previous and subsequent vertex data, the maximum and minimum are detected, and one scanning line is determined depending on whether the sum of the number of vertices corresponding to the maximum and minimum is 2 or less. It is preferable that the method determines whether there is a polygon that is partitioned into only one continuous portion.

<Operation> With the above method, by comparing each vertex γ-ta of a polygon with adjacent vertex data, the maximum and minimum coordinate values of each vertex in the direction perpendicular to the scanning direction can be determined. Detects the corresponding vertices, and divides one scanning line into only one continuous part based on whether the number of vertices corresponding to the maximum and the number of vertices corresponding to the minimum are 1 or not, respectively. It is possible to determine whether it corresponds to the type.

In addition, the vertices of the polygon are sequentially transferred in the order along the contour line, and by comparing each vertices with the previous and subsequent vertex data, the maximum and minimum can be detected. If it is determined whether the polygon divides one scanning line into only one continuous part based on whether the number of vertices corresponding to maximum and minimum is 2 or less, the vertices During the data transfer, the maximum and minimum are detected. If the transfer start vertex does not correspond to either the maximum or the minimum, the maximum or minimum is detected. The sum of the number of vertices corresponding to is 2, and if the transfer start vertex corresponds to either the maximum or minimum, the sum of the number of vertices corresponding to the maximum or minimum is 1, so the maximum, Based on whether the sum of the number of vertices corresponding to the minimum is less than or equal to 2, determine whether the type of polygon corresponds to a type in which one scanning line is divided into only one continuous part. can be determined.

<Example> Hereinafter, embodiments will be described in detail with reference to the accompanying drawings showing examples.

FIG. 1 is an electrical circuit diagram showing an embodiment for implementing the polygon type discrimination method of the present invention.

In the figure, graphic data that has been subjected to coordinate transformation processing and clipping processing (for example, data indicating the coordinate values and brightness value of each vertex of the polygon shown in Fig. 10 or 11) is
The increase/decrease detection signal is input to the increase/decrease detection section A to detect the increase/decrease state, the increase/decrease detection signal is input to the maximum and minimum detection section B to detect the maximum and minimum, and the maximum and minimum detection signals are input to the number determining section C to determine the number of pieces. It is determined whether the sum of the numbers is 2 or less.

More specifically, the increase/decrease detection section A includes a first stage latch circuit (11) and a second stage latch circuit (11).
2) and a comparator (13),
When the i-th vertex data is input to the first stage latch circuit (11), the second stage latch circuit (12)
The (+-1)th vertex data is input to the , and by comparing both vertex data with the comparator (13), it is determined whether the i-th vertex data is larger or smaller than the (i-1)th vertex data. Then, the discrimination result is detected by the maximum and minimum detection unit B.
so that you can enter it.

The maximum/minimum detection section B mentioned above is a flip/70 tube circuit (
14) and two inverters (15) and (16), and indicates that the i-th vertex data from the comparator (13) is larger than the (i-1)I-th vertex data. The output signal is input to the preset input terminal of the flip-flop circuit (14) via the inverter (15), and the i-th vertex data is (i-1).
An output signal indicating that the data is smaller than the data of the 70th vertex is sent to the flip circuit (16) via the inverter (16).
4), the i-th vertex data is smaller than the preceding (i-1)-th vertex data,
Moreover, the following j-th vertex data (however, j≧i+1
) is larger than the (j-1)th vertex data,
Outputs a Q signal indicating that it is a minimum (the rising timing of the Q signal serves as a minimum instruction signal), and the i-th vertex data is larger than the preceding (i-1)-th vertex data, and is the next one. j-th vertex data (1.j≧i
+1) is smaller than the (j-1)th vertex data, it is possible to output a Q signal indicating the maximum (the rising timing of the 0 signal becomes the maximum instruction signal). .

The number determining section C is an AND circuit in which output signals from a maximum number determining section (17), a minimum number determining section (18), and both number determining sections (17) and (18) having the same configuration are inputted.
It consists of a gate (19).

The minimum number discriminator (18) includes two 7-lip-flop circuits (, 20) to which the Q signal from the flip-flop circuit (14) is input to the clock input terminal.
) (21), and the Q signal from the flip-flop circuit (20) is transmitted to the flip-flop circuit (21).
), and the zero signal from the flip-flop circuit (21) is input to the AND gate (19). Therefore, in the state initially reset by the clear signal, the above flip/70 tube circuit (
◇ Only when the Q signal from 14) is input two or more times.
The signal becomes low level. In addition, the maximum number discriminator (
The configuration of unit 17) is the same as that of the minimum number determining unit (18), so the explanation will be omitted.

Therefore, only when each Q signal from the number discriminator (17) and (18) is at a high level (the number of maximum and minimum detections is one or less), the AND gate (19) converts one scanning line into one. It is possible to output a high-level signal indicating that the polygon is a type of polygon that can be partitioned into only continuous parts.

In addition, the above vertex data includes no 2-dimensional brightness change, 2
Which data ('X, 1.(
X, V, I), (X, y.

= 10 - z), (x, y, z, or b).

Figure 2 shows the 10th scale discriminated by the above-mentioned scale discrimination method.
FIG. 1 is a block diagram showing an embodiment of a device for filling in the inside of a polygon of the type shown in FIG.

In the figure, coordinate transformation processing, clipping processing, etc. are 7J
l! The i-shaped graphic data (for example, -data showing the coordinate values, brightness values, etc. of each vertex of the polygon as shown in FIG. 10) is stored in the maximum and minimum value detection circuit (2), the list memory (3), and the list memory (3). 1- applied to the memory control circuit (4).

Then, the vertex f- is read out from the list memory (3) under the control of the list memory (J5) and the list memory (-) control circuit (4).
The voltage is applied to the left-side end detection circuit (5), the right-side end detection circuit (6), and the =-polygon end detection circuit (7), and the left-side interpolation circuit (8) and right-side interpolation circuit The interpolated data from the left side interpolation circuit (8) and the right side interpolation circuit (9) is applied to the ODA circuit (linear interpolation drawing circuit) 00), and further,
The end detection signal from the left side end detection circuit (5), the right side end detection circuit (6), and the polygon end detection circuit (the end detection signal from the force is applied to the ten-hand stroke control circuit (4)). ing.

= 11- As shown in Fig. 3, the maximum/minimum detection circuit (2) is configured so that the angle data of the polygon transferred through the f-tabus (22) is initially manually input, and the vertex data is manually input. An angle down counter (23) that goes down to 1 each time the
A maximum value detection circuit (24), a minimum value detection circuit (2!i) that manually detects the maximum value and minimum value of each vertex data of the polygon 1, and a pointer j' horn counter (
26) and a maximum value pointer latch circuit (2) that wraps the pointer signal from the pointer up counter (26) based on the latch signal from the maximum value detection circuit (24).
7) and a minimum value pointer latch circuit (28) that wraps the pointer signal from the pointer up counter (26) based on the latch signal from the minimum value detection circuit (25).
).

Then, the count zero signal from the square number down counter (23) is passed to the maximum value pointer latch circuit (27).
, and the voltage applied to the minimum value pointer wrap circuit (28).
By doing so, each pointer latch circuit (27) (28)
The pointer latched to the Juki arterbus (22)
J, -) that can be output to.

That is, while writing each vertex of the polygon to the list message (January 3), obtain pointers corresponding to the maximum and minimum values,
When all polygon vertex data has been written,
Since the above-mentioned pointer is not corrupted in the list (3), no special processing time is required to set the pointer to 1.

In the list memory (3), as shown in FIG. 4, each data address is assigned by a row address and a column address, and the row address is O and the column address is O. The number of angles of a polygon is stored in a memory area, each vertex f of a polygon (a polygon with n angles) is stored in a memory area whose row address is 1 to n, and the row address is n -. 1-1 and the column address is O, and the minimum value pointer is stored in the memory area where the row address is n+1 and the column address is 1. The memory areas with row addresses from 1 to n are divided into memory areas with column addresses from O to 3, which include no two-dimensional brightness change, two-dimensional brightness change, and three-dimensional brightness change. and which data (x, y) for each mode with three-dimensional power saving changes.

(x, y, I), (x, y, z), (x, y, z.

■).

For subsequent polygons, the same array (polygon angle data, each vertex data, maximum value pointer, minimum value pointer, and ink array) is used for each method. .

As shown in Figure 5, the 1st list control circuit (/I) calculates the maximum value by adding the first row address and the data obtained by adding 1 to the number of angles of the polygon. By obtaining the row address (n+1 in the case of Figure 4) where the pointer and minimum value pointer are stored, and adding the maximum value pointer stored in the -Y2 row address and the above first row address, You can get the maximum row address. The minimum value row address can be obtained by adding the minimum value pointer and the first row address.

Therefore, the row addresses of vertices corresponding to the maximum and minimum values can be easily obtained based on the maximum value pointer and minimum value pointer. For example, the order of each vertex data of a polygon being transferred can be If it is counterclockwise, by sequentially incrementing the row address (for example, by sequentially counting up an up counter with a base number equal to the number of angles n of a given polygon), from the vertex corresponding to the maximum value to the minimum You can move forward through the vertex data toward the vertex corresponding to the value, or by sequentially decrementing the row address (for example, by sequentially counting down a down counter with a base number equal to the number of angles n of a given polygon). (particularly), the vertex data can be sequentially advanced in reverse order from the vertex corresponding to the minimum value to the vertex corresponding to the maximum value.

The left-side end detection circuit (5), as shown in FIG.
The y-coordinate value is subtracted every time one point is interpolated from the starting point (y-coordinate is yO), and when it matches the y-coordinate value yn of the end point of the edge, it is detected that the interpolation of the 1st edge has ended, and the end is detected. A signal is applied to the list memory control circuit (4).

The same applies to the right-side end detection circuit (6).

Above-polygon end detection circuit (For the force, as shown in Fig. 7, interpolation is performed on both the left and right sides from the point y max where the y coordinate value is maximum, and the y coordinate value 1?i is the minimum value y min. Detects that the processing of polygon 1 has finished when the match is made,
An end detection signal is applied to the list memory control circuit (4).

The left side interpolation circuit (8) and the right side interpolation circuit (9) are used, for example, when data on each vertex of a polygon is transferred counterclockwise and interpolation is performed in order from the maximum value of the y-coordinate value. , each has an up counter for the vertex address corresponding to the left edge and a down counter for the vertex address corresponding to the right edge, and both counters are loaded with the maximum value address of the y coordinate value as an initial value, and as shown in FIG. show-
, the maximum value address is used as a reference to simultaneously count up and count down, interpolate the left and right edges simultaneously, and apply the interpolated value to the DDA circuit (101) with the interpolated value of the left edge as the starting point and the interpolated value of the right edge as the end point. do.

With the above configuration, while data that has been subjected to coordinate transformation, clipping, etc. (polygon angle data and each vertex data) is stored in the list 1-memory (3), the maximum and minimum value vertices are stored in the memory (3). The detection circuit (2) detects the pointer of the vertex corresponding to the maximum value and minimum value of the scanning line and the y-coordinate value (coordinate value in the direction perpendicular to the scanning line), and stores it in the list memory (3).
) is stored after the above data.

Then, under the control of the list memory control circuit (4), the vertex data corresponding to the maximum value based on the pointer is input to the left side interpolation circuit (8) and the right side interpolation circuit (9). The next vertex data and the previous vertex data are input to the left side interpolation circuit (8) and the right side interpolation circuit (9), respectively, and each edge is interpolated using the maximum value of the y coordinate value as a reference, and both interpolations are performed. Apply the value to the DDA circuit 00). In the above case, if it is determined that the interpolation of each edge line has ended, the list memory is Under the control of the control circuit (4), the next vertex data is input to the corresponding interpolation circuit.

When the interpolation of all the edges is completed as described above, the data of the next polygon is stored under the control of the list memory control circuit (4) based on the polygon end detection circuit (the end detection circuit from the sword). By reading out and repeating the same process as above, all necessary polygons can be processed.

FIG. 9 shows a more specific coloring device.

In the figure, (22) is the data bus, and (29) is the mode word (2D no brightness change, 2D brightness change, 3D brightness no change, and 3D brightness change) as the first word of data transferred through the data bus. Information indicating each mode with 3D brightness change, information indicating the number of angles of a polygon, etc.)
(24) is a maximum value detection unit, (25) is a minimum value detection unit, and (2
6) is a pointer up counter, (27) is a maximum value pointer latch section, (28) is a minimum value pointer latch section, and (30) is the mode word analysis section (29). This is an attribute-specific control unit that receives information as input and outputs a mode-specific control signal, and (31) is an up counter that receives an address increment signal from the attribute-specific control unit (30) and generates an input side address.

(32), (33), (34), and (35) are list memories for x coordinate values, y coordinate values, Z coordinate values, and index values (brightness values, etc.), and each has two RAMs.
It consists of

(36) is the polygon number counter, and (37) is each 2
This is a RAM switching control unit for switching RAM one by one, and (3g), (39), and (40) are interpolated J
- subtraction section, division section, and addition section for (41) (
42 and (43) are a cylinder reduction section, a division section, and an addition section for interpolating the right side, respectively, and (44) is a compensation calculation synchronization section for both sides.

(45) is a DDA side address generation section, (46) is an execution end detection section, and (ty) (48) is a mode word latch section.

Therefore, in the case of this coloring device as well, it is possible to grasp the intersection of the scanning line and the ridge line from the vertex corresponding to the maximum value to the vertex corresponding to the minimum value as the starting point, and also Corresponding to the maximum value from the corresponding vertex 16
If the intersection of the ridgeline toward the summit and the scanning line is the starting point and the transfer order is counterclockwise), you can fill in the display with - based on this grasp result. No memory is required to write surface data;
Moreover, the frequency of reading from memory and writing to the meter is significantly reduced (the time required from when the data is entered to when the filled polygon is displayed on the scanning display) is greatly reduced. The time can be significantly reduced.

Specifically, the conventional conductive C with 800 polygons/Se fertility
In comparison to this, according to the above embodiment, the speed could be increased to about 40,000 polygons/sec. Here, one polygon means a square of 20 dots x 20 dots I- that is inclined in any direction.

In addition, in any of the above-mentioned coloring devices, since it is possible to perform coloring processing only on polygons of the type that divide one scanning line into only one continuous part, polygons other than those mentioned above can be filled in using conventionally known methods. method (for example, Wat
er Filling Method, etc.), but especially in three-dimensional figures, most of them correspond to the above polygons, so the type discrimination according to the present invention is performed to reduce one scanning line to only one continuous part. It can be said that it is very useful to use the above-mentioned apparatus to fill in only the polygons of the type to be partitioned, since it speeds up the processing as a whole.

<Effects of the Invention> As described above, the present invention has the following advantages:
To determine whether the sum of the number of vertices that correspond to the minimum is 2:
This has the unique effect of being able to determine whether or not the polygon is of a type that is partitioned only into continuous parts.

[Brief explanation of drawings]

Fig. 1 is an electrical circuit diagram showing an example of a polygon type discrimination method; Fig. 2 is a block diagram showing an example of a polygon coloring device; Fig. 3 is a diagram showing maximum and minimum values. FIG. 4 is a diagram showing the contents of the list memory, FIG. 5 is a diagram explaining the operation of the list memory control circuit, and FIG. 6 is a diagram showing the operation of the left-side end detection circuit. Figure 7 is a diagram explaining the operation of the polygon end detection circuit. Figure 8 is a diagram explaining the operation of the left side interpolation circuit and the right side interpolation circuit. Figure 9 is a diagram explaining a more specific polygon. A block diagram showing a coloring device; FIGS. 10 and 11 are diagrams showing different types of polygons. A...Increase/decrease detection section, B...Maximum, minimum detection section, C.
...Number of pieces discriminating unit, (17)...Maximum number of pieces discriminating unit, (1
8) Minimum number discriminator, (19) AND gate patent applicant Daikin Industries, Ltd. Figure 2 Figure data after coordinate conversion processing and clipping Figure 3 Squirrel lid meso ZJ Figure 5 Ymin maximum value ＼ l′ ゝ

Claims (2)

[Claims] 1. Based on each vertex data of the transferred polygon, the maximum and minimum in the direction perpendicular to the scanning line are detected, and depending on whether there is one vertex corresponding to the maximum or minimum, one scanning line is divided into one point. A polygon type determination method characterized by determining whether a polygon is partitioned into only continuous parts. 2. The vertex data of a polygon is transferred sequentially in the order along the contour line, and by comparing each vertex data with the previous and subsequent vertex data, maximums and minimums are detected, and the vertex corresponding to the maximum and minimum is detected. Polygon type determination according to claim 1, which determines whether the polygon divides one scanning line into only one continuous part, based on whether the sum of the numbers is 2 or less. method.