JPH0831138B2 - Polygonal fill device in scanning display device - Google Patents

Description

Description: BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a device for filling the inside of a polygon displayed in a single stroke on a scanning display device.

<Prior Art> Conventionally, a method of filling the inside of a polygon displayed in a single stroke on a scanning display has been adopted.

The shapes of the polygons are various, and roughly classified, one scanning line is divided into only one continuous portion as shown in FIG. 9 and one scanning line is divided into two as shown in FIG. It is divided into those that may be divided into the above continuous parts.

Then, in the case of the polygon shown in FIG. 9, the area between the intersections with the scanning lines can be simply filled and displayed. However, in the case of the polygon shown in FIG. 10, the intersections with the scanning lines can be obtained. There are two or more pairs, and it is necessary to determine which of the intersections should be filled and displayed.

In consideration of such a point, as the above-mentioned filling method, each vertex data of the polygon is sorted in the processing direction perpendicular to the scanning line direction, and if necessary, in the scanning line direction, and then scanned. A list of edges having intersections with lines is created and interpolation is performed between the corresponding edges as a start point-end point. Then, by creating a list of the above-mentioned ridge lines for all scanning lines and performing interpolation between the corresponding ridge lines, a method of displaying the inside of the polygon in a solid state is adopted. So that it can be filled.

Further, as a method capable of filling the inside only with respect to the polygon of the type shown in FIG.
It has a memory plane for surface generation separately from the image memory and writes closed loop data representing the closed loop of the polygon to the image memory by interpolating between adjacent vertices based on the data of each vertex of the polygon. The closed-loop data is also written in the generation memory plane, the maximum value and the minimum value of the closed-loop data are detected, and the surface generation memory plane is scanned only in the area determined by the maximum value and the minimum value to close the closed-loop data. When reading the data, the intersection of the closed loop and the scan line is obtained for each scan, and a predetermined logic signal is written in the image memory or the plane for memory generation in correspondence with a pair of intersections, There is a method of generating surface image data in which a region surrounded by the closed loop is filled with predetermined display data (Japanese Patent Laid-Open No. 55-55).
-3069, and JP-A-55-3070).

<Problems to be Solved by the Invention> In the former method, it is indispensable to sort the processing directions, and moreover, a list of ridge lines to be operated must be created and managed. In addition to the problem that memory management is required, there is more processing by the CPU such as data reading, sorting, calculation, etc., data writing, etc. There is a problem that it takes a long time to display on the scanning display.

Further, in the latter method, since there is only one linear interpolation circuit and it is not known from which vertex the interpolation of each ridgeline of the polygon starts, surface display is performed separately from the image memory. In addition to the problem that special memory is required for multiple,
It takes a long time to read the data from the memory and write the data to the memory, and it takes a long time to obtain the start point and the end point of the ridge line to be linearly interpolated, and the linear interpolation circuit waits for a considerable time. Therefore, there is a problem that it takes a long time to display the polygon whose interior is filled in on the scanning display after the data is given.

<Object of the Invention> The present invention has been made in view of the above problems, and suppresses an increase in memory required for filling,
Moreover, it is an object of the present invention to provide a polygon filling device for a scanning display device, which can shorten the time required from displaying data to displaying a polygon whose inside is filled on a scanning display.

<Means for Solving Problems> A list memory that sequentially stores polygon vertex data that divides one scanning line into only one continuous portion in the transfer order, and a vertex memory in a direction orthogonal to the scanning direction. Corresponds to the vertex detection means for detecting the vertex corresponding to the maximum value and the minimum value of the coordinate values by storing the transfer order of the vertex and the list memory, and the maximum value and the minimum value detected by the vertex detection means. The vertex detecting means detects the vertex from the vertex corresponding to the maximum value detected by the vertex detecting means for each of the partitions divided by the dividing means, based on the vertices as the reference and based on the transfer order. By interpolating the vertex data of the vertices adjacent to each other toward the vertex corresponding to the minimum value, and performing this interpolation in parallel for both sections, a pair of ridge line data is simultaneously obtained. The calculation of the start and end points is based on the ridge line data calculating means for obtaining the data and the intersection of the scanning line and the pair of ridge lines obtained by the ridge line data calculating means as the start point or the end point corresponding to the transfer order and the interpolation order of the ridge lines Means and the maximum value and the minimum value detected by the apex detection means, in order from one of the two vertices corresponding to the other toward the other, a scanning line portion corresponding to the area between the start point and the end point is displayed as a solid display. And means.

In the case of the above apparatus, each vertex data of a polygon that divides one scanning line into only one continuous portion is stored in the list memory in the transfer order, that is, the one-stroke writing order, and the direction perpendicular to the scanning direction is stored. The vertices corresponding to the maximum and minimum coordinate values of each vertex are detected by storing the transfer order of the vertices, the vertices corresponding to the maximum value and the minimum value are used as a reference, and the transfer order is determined. Divide the vertices in consideration. Then, for one of the sections, the ridge line obtained by interpolating the vertex data between the vertices adjacent to each other from the vertex corresponding to the maximum value to the vertex corresponding to the minimum value according to the order stored in the list memory. The intersection of the data and the scan line,
Depending on whether the transfer order is left-handed or right-handed, the start point or the end point is set, and for the other division, from the vertex corresponding to the maximum value according to the order opposite to the order stored in the list memory. The intersection of the pair of ridge line data and the scanning line, which are obtained simultaneously by interpolating the vertex data of the vertices adjacent to each other toward the vertex corresponding to the minimum value, is transferred in the counterclockwise or clockwise direction. Depending on whether there is an end point or a start point, from the vertex corresponding to the maximum value to the vertex corresponding to the minimum value, or from the vertex corresponding to the minimum value to the vertex corresponding to the maximum value, in order, By painting the corresponding scanning line portion between the end point and the end point, a polygon whose interior is filled can be displayed on the scanning display.

Further, since the vertices corresponding to the maximum value and the minimum value of the coordinate values of each vertex in the direction perpendicular to the scanning direction are detected by storing the transfer order of the vertex, only the transfer order is stored. Based on the above, the ridgeline on the start point side and the ridgeline on the end point side can be grasped, and it becomes possible to deal with the hardware such as a counter.

<Examples> Hereinafter, detailed description will be given with reference to the accompanying drawings illustrating examples.

FIG. 1 is a block diagram showing an embodiment for carrying out the polygon filling method of the present invention.

In the figure, the figure data subjected to coordinate conversion processing, clipping processing, etc. (for example, the data indicating the coordinate value and the brightness value of each vertex of the polygon shown in FIG. 9) is the maximum and minimum value vertex detection circuit (1). , List memory (2) and list memory control circuit (3). Then, the vertex data read from the list memory (2) under the control of the list memory control circuit (3) has the left one side end detection circuit (4), the right one side end detection circuit (5), and the one polygon end detection circuit. In addition to being applied to (6), it is also applied to the left side interpolation circuit (7) and the right side interpolation circuit (8), and the interpolation data from the above left side interpolation circuit (7) and right side interpolation circuit (8) is the DDA circuit. (Linear interpolation drawing circuit) (9). Further, the end detection signals from the left one-side end detection circuit (4), the right one-side end detection circuit (5), and the one-polygon end detection circuit (6) are applied to the list memory control circuit (3). .

As shown in FIG. 2, the maximum / minimum value vertex detection circuit (1) is initially inputted with polygonal corner number data transferred through the data bus (11), and counts down every time vertex data is inputted. With the angle down counter (12),
A maximum value detection circuit (13), a minimum value detection circuit (14) for respectively detecting the maximum value and the minimum value by inputting each vertex data of the polygon, an up counter for pointer (15), and the maximum value detection circuit A maximum value pointer latch circuit (16) that latches the pointer signal from the pointer up counter (15) based on the latch signal from (13), and a pointer based on the latch signal from the minimum value detection circuit (14). And a minimum value pointer latch circuit (17) for latching the pointer signal from the up counter (15).

Then, the count zero signal from the angle down counter (12) is applied to the maximum value pointer latch circuit (16) and the minimum value pointer latch circuit (17), whereby each pointer latch circuit (16) (17) ), The pointer latched in () can be output to the data bus (11).

That is, while writing each vertex data of the polygon into the list memory (2), the pointers corresponding to the maximum value and the minimum value are obtained,
When the writing of all vertex data of the polygon is completed,
The pointer can be written to the list memory (2) and no special processing time is needed to get the pointer.

In the list memory (2), as shown in FIG. 3, the address of each data is assigned by the row address and the column address, and the row address is 0 and the column address is 0. The polygon corner number data is stored in the memory area, and each vertex data of the polygon (polygon with the number of corners n) is stored in the memory area whose row address is 1 to n.
The maximum value pointer is stored in the memory area where the row address is n + 1 and the column address is 0, 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 area having the row addresses 1 to n has the column address 0.
It is divided into memory areas from 3 to 3, and has no 2D luminance change, 2D luminance change, 3D luminance change, and 3D luminance change data (x, y), ( x, y, I), (x, y, z), (x, y, z, I) are also supported.

For the subsequent polygons, data is stored in each memory area in the same array (polygon angle data, each vertex data, maximum value pointer, and minimum value pointer array).

As shown in FIG. 4, the list memory control circuit (3) adds the first row address and the data obtained by adding 1 to the number of corners of the polygon to obtain a maximum value pointer and a minimum value pointer. To obtain the maximum value row address (n + 1 in the case of FIG. 3) and add the maximum value pointer stored in the above row address and the above-mentioned first row address to obtain the maximum value row address. You can Of course, the minimum value row address can be obtained by adding the minimum value pointer and the top row address.

Therefore, the row address of the vertex corresponding to the maximum value and the minimum value can be easily obtained based on the maximum value pointer and the minimum value pointer. For example, the order of the vertex data of the transferred polygon is Counterclockwise,
By sequentially increasing the row address (for example, by sequentially counting the up-counter with a decimal number equal to the number n of angles of the given polygon), the vertex corresponding to the maximum value is changed to the vertex corresponding to the minimum value. The heading vertex data can be obtained sequentially, or by decreasing the row address sequentially (eg, by sequentially counting down counters with a decimal number equal to the number of corners n of a given polygon), to the minimum value. The vertex data from the corresponding vertex to the vertex corresponding to the maximum value can be sequentially obtained in the reverse order, that is, the order from the vertex corresponding to the maximum value to the vertex corresponding to the minimum value.

As shown in FIG. 5, the left one-side end detection circuit (4) uses the y-coordinate (coordinates in the direction perpendicular to the scanning line) as a reference, and performs y-interpolation at each point from the start point (y-coordinate is y0). The coordinate value is subtracted, and it is detected that the interpolation of the edge line of 1 at the time when the y-coordinate value yn of the end point of the edge line coincides is completed, and the end detection signal is applied to the list memory control circuit (3).

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

As shown in FIG. 6, the one-polygon end detection circuit (6) performs interpolation on both left and right sides from the point ymax having the maximum y coordinate value, and when the y coordinate value matches the minimum value ymin. 1
It is detected that the processing of the polygon has been completed, and an end detection signal is applied to the list memory control circuit (3).

The left side interpolation circuit (7) and the right side interpolation circuit (8)
Is, for example, when each vertex data of the polygon is transferred counterclockwise and the interpolation is performed in order from the maximum y coordinate value, the vertex address up counter corresponding to the left edge line, Has a down counter for the vertex address corresponding to the ridge line, loads the maximum value address of the y coordinate value as an initial value into both counters, and simultaneously counts up with the maximum value address as a reference, as shown in FIG. A countdown is performed, the left and right ridge lines are simultaneously interpolated, and the interpolated value of the left ridge line is applied to the DDA circuit (9) with the interpolated value of the right ridge line as the end point.

With the above configuration, the maximum / minimum value vertex detection circuit (while storing the data (polygon angle data and each vertex data) subjected to coordinate conversion, clipping, etc. in the list memory (2). According to 1), the pointer of the vertex corresponding to the maximum value and the minimum value of the scanning line and the y coordinate value (the coordinate value in the direction perpendicular to the scanning line) is detected, and the list memory (2)
It is stored after the above data of.

Then, under the control of the list memory control circuit (3), the vertex data corresponding to the maximum value is input to the left side interpolation circuit (7) and the right side interpolation circuit (8) based on the pointer, and after the vertex data, Vertex data and the previous vertex data are input to the left side interpolation circuit (7) and the right side interpolation circuit (8), respectively, and the ridge lines are interpolated using the maximum y coordinate value as a reference, and both interpolation values are set to DDA. Apply to circuit (9). In the above case, when it is determined that the interpolation of each ridge line is completed, the list memory control circuit is based on the end detection signal from the left one side end detection circuit (4) or the right one side end detection circuit (5). Under the control of (3), the next vertex data is input to the corresponding interpolation circuit.

When the interpolation of all the edges is completed as described above, the next polygon is controlled under the control of the list memory control circuit (3) based on the end detection circuit from the one polygon end detection circuit (6). By reading the data and repeating the same processing as described above, the processing for all necessary polygons can be performed.

FIG. 8 shows a more specific embodiment. Incidentally, in FIG. 8, reference numerals corresponding to the respective constituent elements of FIG. 1 and FIG. 2 are added.

In the figure, (11) is a data bus, and (18) is a mode word as the first word of data transferred through the data bus (no two-dimensional luminance change, two-dimensional luminance change, three-dimensional luminance change, and Data bus (11) is a mode word analysis unit that analyzes information indicating each mode with three-dimensional brightness change, information indicating the number of corners of a polygon, etc.
The polygonal corner number data transferred through is initially input, and it also serves as a corner number down counter (12) that counts down each time vertex data is input. (13) is a maximum value detection unit, (14) is a minimum value detection unit, (15)
Is a pointer up counter, (16) is a maximum value pointer latch unit, (17) is a minimum value pointer latch unit, and (19) shows mode information from the mode word analysis unit (18). An attribute-based control unit that outputs a control signal for each mode as an input, and (20) is an attribute-based control unit (19)
Is an up-counter which receives an address increment signal from and generates an input side address.

(21) (22) (23) (24) are for x coordinate value,
For y coordinate value, for z coordinate value, index value (luminance value etc.)
List memory for each of the two, and each is composed of two RAMs. Here, each list memory is composed of two RAMs. When the number of polygons that can be stored in one RAM is exceeded, other RAMs are used to store each vertex data of polygons. In addition to the above, the lower side of the list memory is requesting a processing request, and the upper side allows the RAM to be switched on condition that the one currently being transferred is completed.・ To absorb the speed difference between lower ranks.

(25) is a polygon number counter, (26) is a RAM switching control unit for switching each two RAMs, (2)
7), (28) and (29) are a subtraction unit, a division unit and an addition unit for interpolating the left side, and (30), (31) and (32) are subtraction units and a division unit for interpolating the right side, respectively. The addition unit (33) is an interpolation calculation synchronization unit on both sides.

(34) is a DDA side address generation section, (35) is an execution end detection section, and (36) and (37) are mode word latch sections.

Therefore, also in the case of this embodiment, for example, when the transfer order is counterclockwise as indicated by the arrow in FIG. Ridge lines (refer to the left side in FIG. 7) obtained by interpolating the vertex data of the vertices adjacent to each other from the vertex corresponding to the maximum value to the vertex corresponding to the minimum value (when sequentially transferred). It can be grasped as an intersection with a scanning line as a starting point, and a ridge line obtained by interpolating vertex data of vertices adjacent to each other from the vertex corresponding to the minimum value to the vertex corresponding to the maximum value (7th The intersection between the scanning line (see the right side in the figure) and the scanning line can be grasped as the end point (when the transfer order is counterclockwise), and the filled display can be performed based on this grasped result. Memo to write Is not necessary, and the frequency of reading from memory and writing to memory is significantly reduced, and the time required from displaying data to displaying a polygon with a filled inside on a scanning display is reduced. It can be significantly shortened. Specifically,
According to the above-mentioned embodiment, the speed was about 40,000 polygons / sec., While the speed was about 800 polygons / sec. Here, one polygon means a square of 20 dots × 20 dots inclined in an arbitrary direction.

In the present invention, it is possible to perform the filling processing only on polygons that divide one scanning line into only one continuous portion, so that it is necessary to perform the filling processing by the conventional method on polygons other than the above. But,
In particular, most of the three-dimensional figures correspond to the above-mentioned polygons, so it can be said that they are very useful.

<Effects of the Invention> As described above, according to the present invention, it is possible to suppress an increase in the memory required for filling, and to grasp the ridgeline on the start point side and the ridgeline on the end point side only based on the transfer order. It is possible to handle with a hardware such as a counter, and the frequency of reading from the memory and writing to the memory is reduced, and the scanning type display of a polygon whose inside is filled after data is given. It has a unique effect that the time required for the display above can be shortened.

[Brief description of drawings]

FIG. 1 is a block diagram showing an embodiment for carrying out the polygon filling method of the present invention, FIG. 2 is a diagram showing a maximum / minimum value vertex detection circuit in detail, and FIG. 3 is a list memory content. 4 is a diagram for explaining the operation of the list memory control circuit, FIG. 5 is a diagram for explaining the operation of the left one-side end detection circuit, and FIG. 6 is a diagram for explaining the operation of the one polygon end detection circuit. FIG. 7 is a diagram for explaining the operation of the left side interpolation circuit and the right side interpolation circuit, FIG. 8 is a block diagram showing a more concrete embodiment, and FIGS. 9 and 10 are different types of polygons. FIG. (1) ... Maximum / minimum value vertex detection circuit, (2) ... List memory, (3) ... List memory control circuit, (7) ...
… Left side interpolation circuit, (8) …… Right side interpolation circuit, (9) ……
DDA circuit

Claims (1)

[Claims] 1. A list memory that sequentially stores polygonal vertex data that divides one scanning line into only one continuous portion in the order of transfer, and a maximum coordinate value of each vertex in a direction perpendicular to the scanning direction. , And a vertex corresponding to the minimum value by storing the transfer order of the vertex in a list memory, and a vertex corresponding to the maximum value and the minimum value detected by the vertex detection means as a reference. Corresponding to the minimum value detected by the apex detection means from the apex corresponding to the maximum value detected by the apex detection means for each of the divisions made by the aforesaid division means. Edge data for obtaining a pair of edge line data at the same time by interpolating vertex data of adjacent vertices toward each other and performing this interpolation in parallel for both sections. A calculation means; a start / end point calculation means for setting an intersection point of the scanning line and the pair of ridge lines obtained by the ridge line data calculation means as a start point or an end point in correspondence with the transfer order and the ridge line interpolation order; A maximum value and a minimum value detected from one of the two vertices corresponding to the other, in order from the other to the other, including a solid display means for solidly displaying the corresponding scanning line portion between the start point and the end point. A polygon fill device for a scanning display device.