JPH036675A - Pattern painting out device - Google Patents

Abstract

PURPOSE:To perform painting out operation even with a complicated graphic in a simple way and at a high speed by rearranging automatically and in order of a scan process the coordinate data corresponding to the painting out start or end point stored in a ridgeline data store memory based on the geometric inevitability. CONSTITUTION:The coordinates of each apex and the coordinates of the intersecting point between each ridgeline obtained from the ridgeline coordinates and scanning line are extracted and stored in a ridgeline data store memory 14. These coordinates are sorted by a sorting circuit 15 based on the priority of the secondary and main scanning directions respectively. Then the sorted coordinate data are taken out every two pieces, and the scan parts corresponding to those inter-2-point areas taken out successively are painted out by a linear interpolation drawing circuit 16 and displayed. As a result, a complicated graphic can be painted out simply and at a high speed.

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to a figure filling device for filling in the inside of a polygon displayed on a scanning display device.

[Conventional technology]

FIG. 4 is a block connection diagram showing a figure filling device in a conventional scanning display device disclosed in, for example, Japanese Unexamined Patent Publication No. 62-74164. Import the shape data, the angle data, each vertex data, and the maximum value pointer.

The list memory 4.5 stores the minimum value pointer etc. under the control of the list memory control circuit 30, and subtracts the y-coordinate value every time one point is interpolated from the starting point based on the y-coordinate.
The interpolation of one edge line is finished when the y-coordinate value of the end point of the edge line coincides with the y-coordinate value, and the left-side end detection circuit and the right-side end detection circuit 6 convey this to the list memory control circuit 3.
A polygon end detection circuit that terminates the process when the coordinate value matches the minimum value and transmits this to the list memory control circuit 3. 7 and 8 are a left side interpolation circuit and a right side interpolation circuit, which interpolate the left and right edges at the same time. The interpolated value of the left edge is the starting point, and the interpolated value of the right edge is the ending point. 9 is a linear interpolation drawing circuit (DDA) that draws between these starting points and ending points by linear interpolation.
circuit).

Next, the operation will be explained.

Each vertex data of a polygon that divides one scanning line into only one continuous part is stored in the list memory 2 in the order of transfer, and the vertices corresponding to the maximum and minimum coordinate values of each vertex in the sub-scanning direction are stored. Detected by the maximum and minimum value vertex detection circuit 1,
Edge line data obtained by interpolating vertex data of adjacent vertices from the vertex corresponding to the maximum value to the vertex corresponding to the minimum value by the list memory control circuit 3 according to the order stored in the list memory 2 The intersection point between and the scanning line is set as a starting point or an ending point as shown in FIG. 4 depending on whether the transfer order is counterclockwise or clockwise, and the left-side end detection circuit 4
, the vertex data of adjacent vertices are interpolated from the vertex corresponding to the minimum value to the vertex corresponding to the maximum value according to the reverse order of the order stored in the list memory 2 by the right-side end detection circuit 5. Obtain the edge line data, and then add the left side,
The right side interpolation circuits 7 and 8 set the intersection with the scanning line as the end point or start point depending on whether the transfer order is counterclockwise or clockwise, and move from the vertex corresponding to the maximum value to the vertex corresponding to the minimum value. The interior is filled in by coloring and displaying the scanning portion corresponding to the starting point and the ending point by the linear interpolation drawing circuit 9 sequentially from the vertex corresponding to the minimum value to the vertex corresponding to the maximum value. Polygons can be displayed on a scanning display. FIG. 5 is an explanatory diagram showing a conventional polygon filling method.

[Problem to be solved by the invention]

Since the conventional shape filling device is configured as described above, it can only be used to process simple polygons as it is; when dealing with complex shapes, it can be used to process several simple polygons. This requires pre-processing to decompose into parts, which poses problems such as the inefficiency of the overall graphic processing.

This invention was made to solve the above-mentioned problems, and the purpose is to provide a figure filling device for a scanning display, etc., which can process even complex figures at high speed using a simple algorithm. shall be.

[Means to solve the problem]

The figure filling device according to the present invention extracts the coordinates of each vertex and the coordinates of the intersection of each edge and the scanning line obtained from the coordinates, stores them in an edge data storage memory, and uses a sorting circuit to extract these coordinates in the sub-scanning direction, Sorting by priority in the main scanning direction, and 2 coordinate data after sorting.
The scanning portion corresponding to the two sequentially extracted points is then filled in and displayed using a linear interpolation drawing circuit.

[For production]

The figure filling device of the present invention automatically rearranges the coordinate data corresponding to the start point or end point of coloring stored in the edge line data storage memory in the order of scanning processing based on geometrical necessity. It functions to fill a square.

[Embodiments of the invention]

An embodiment of the present invention will be described below with reference to the drawings. 1st
In the figure, 11 is an edge line interpolation circuit that interpolates adjacent vertex data in the coordinate-converted figure data to obtain edge line data, and 12 is an edge line interpolation circuit that is connected to both ends of the edge line of the above edge line data.
When both edges are in the same direction as the sub-scanning direction or in the opposite direction,
In the main scanning direction, the higher or lower points of both ends of the ridgeline are detected redundantly, or in two ridgelines that share one point and are adjacent to each other, as few as 7 points are detected excluding the shared point. An overlapping point detection circuit 13 detects the same sub-scanning position redundantly, an edge data storage memory control circuit 13 controls the operation of the edge data storage memory, and 14 detects the edge data and scanning obtained by the edge interpolation circuit 11. An edge line data storage memory 15 stores the intersection data with the points and the duplicate data detected by the duplicate point detection circuit 12, and 15 stores the coordinate data in the edge line data storage memory 14 in priority order in the sub-scanning direction and the main scanning direction. The sorting circuit 16 for sorting is a linear interpolation drawing circuit that sequentially extracts the coordinate data sorted by the sorting circuit 15 two points at a time and sequentially fills in and displays the two extracted points.

Next, the operation will be explained.

As shown in Figure 2, when filling in a polygonal figure with scanning lines, the starting and ending points of the filling are always on the ridgeline, and 1
It corresponds to 1:1. In addition, the start point and end point share coordinates in the sub-scanning direction, and furthermore, on the same scanning line, the coordinates of the start point and end point are arranged repeatedly in the scanning direction, with the start point at the beginning and the start point and end point alternately arranged. become.

Therefore, when the coordinates of the start point and end point are known, if these are sorted by priority in the sub-scanning direction and the main scanning direction, the start and end point coordinates of filling will be automatically rearranged in the order of scanning processing. become. Here, the sub-scanning direction and main-scanning direction are the directions of scanning by scanning lines, and the priority order of the sub-scanning direction and main-scanning direction is that the sub-scanning direction is the coordinate in each scanning line, and the sub-scanning direction is The second priority is to rank the main scanning direction. That is, sorting by priority in the sub-scanning direction and the main scanning direction means rearranging the coordinates in the order in which they are scanned. To give a more specific explanation, in an x-Y coordinate system, if the X direction is the main scanning direction and the sub-scanning direction is the Y direction, each coordinate representing a figure represented on this coordinate plane is first This is the same as rearranging items in ascending order of Y-coordinate values, and then, for the same Y-coordinates, in descending order of X-coordinate values.

The coordinates of the starting point and ending point are each vertex of the polygon and the intersection of each edge and the scanning line. There are 2 things to note here:
There are points. The first is processing of the coordinates of the edge edge when the edge line coincides with the scanning line, which means that when the vertices of this figure are expanded clockwise (counterclockwise), the two If the ridgelines are both in the same (opposite) direction as the sub-scanning direction, the higher point of both ends of the ridgeline in the main scanning direction has overlapping start and end points, so these coordinates cannot be used. If double recognition is performed, and on the other hand, two ridge lines connected to both ends of the ridge line are both in the opposite (same) direction to the sub-scanning direction, the lower point of both ends of the ridge line with respect to the main scanning direction is Since the starting point and ending point are duplicated, by doubly recognizing these coordinates, processing can be performed for each.

The second case is when two adjacent ridgelines that share one point have at least one identical sub-scanning position other than the shared point, and in this case, the shared point overlaps the starting point and ending point. Therefore, it is necessary to recognize these coordinates twice. That is, the overlap of these coordinate points is detected by the overlap point detection circuit 12. An actual example of polygon filling based on these ideas is shown in FIG. 3 as a flowchart. That is, as a first step, the vertex coordinates are stored in the edge data storage memory 14 (step 5TI). Subsequently, intersection data between the scanning line and the edge line portion other than the vertices connecting adjacent double points is obtained and stored in the edge line data storage memory 14 (step 5T2). The third process is to match the edge line with the scan line,
In addition, if the start point and end point overlap, or if two adjacent edges have the same sub-scanning position other than the shared point, each duplicate point is processed and the corresponding coordinates are stored in the edge line data storage memory 14. (Step 5T3)
.

In the fourth process, the coordinate data thus stored in the edge line data storage memory 14 is sorted by the sorting circuit 15 in priority order in the sub-scanning direction and the main scanning direction (step ST4).

Next, if the sorted coordinate data is taken out two by two, these correspond to the start point and end point coordinates in the order in which they are taken out, and if this is sequentially filled in and displayed by the linear interpolation drawing circuit 16, the process is completed (step 5T5).

In addition, in the above embodiment, in order to simplify the explanation, a case is shown in which the filling process is performed in the order shown in FIG.
Alternatively, parallel processing can improve the efficiency and speed of processing.

Furthermore, although the above embodiment shows an example of filling in a figure made up of one polygon, if the coordinate data of multiple polygons is sequentially processed and stored in the coordinate data memory, a set of these figures can be filled in. It is possible to fill in a closed area by .

〔Effect of the invention〕

As described above, according to the present invention, the coordinates of each vertex and the coordinates of the intersection of each edge and the scanning line are extracted and stored in the edge line data storage memory, and then The system is configured so that the coordinate data is sorted in priority order, the sorted coordinate data is extracted two by two, and the scanned area corresponding to the two sequentially extracted points is filled in and displayed, making it possible to easily and quickly fill in complex shapes. What you can do is what you get.

[Brief explanation of drawings]

FIG. 1 is a block connection diagram showing a figure filling device according to an embodiment of the present invention, FIG. 2 is an explanatory diagram showing a method for filling in polygonal figures according to the present invention, and FIG. 3 is a diagram showing the procedure for filling in figures according to the present invention. Flowchart diagram showing,
FIG. 4 is a block connection diagram showing a conventional figure filling device, and FIG. 5 is an explanatory diagram showing a conventional figure filling method. 11 is an edge line interpolation circuit, 12 is an overlapping point detection circuit, 14 is an edge line data storage memory, 15 is a sorting circuit, and 16 is a linear interpolation drawing circuit. In addition, in the figures, the same reference numerals indicate the same or corresponding parts.

Claims (1)

[Claims] When an edge line interpolation circuit obtains edge line data by interpolating adjacent vertex data in coordinate-converted figure data, and two edge lines connected to both ends of the edge line of the edge line data are both in the same direction or in the opposite direction to the sub-scanning direction. , detect the upper or lower points of both ends of the ridge line in the main scanning direction, or detect at least one point other than the shared point in two ridge lines that share one point and are adjacent to each other. a duplicate point detection circuit that detects the same sub-scanning position redundantly, the edge line data obtained by the edge line interpolation circuit, intersection data with the scanning point, and duplicate data detected by the duplicate point detection circuit. An edge line data storage memory, a sorting circuit that sorts the coordinate data in this edge line data storage memory in priority order in the sub-scanning direction and main scanning direction, and coordinate data sorted by this sorting circuit into two
A figure filling device comprising a linear interpolation drawing circuit that sequentially extracts points one by one and sequentially fills in between the two extracted points.