JP2007087283A - Graphic drawing device and graphic drawing program - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide a graphic drawing device capable of determining a polygonal outline (edge) from vertex information input in an arbitrary order, rapidly painting out the inside of a polygon and rapidly drawing the polygon by simple operation without needing a storage region for storing intersection coordinates of polygonal edges and a scanning line, and to provide a program for achieving the graphic drawing function in a computer. <P>SOLUTION: A vertex sorting part inputs information on the polygon including the vertex coordinates of the polygon and carries out numbering sequentially in the ascending order of Y-coordinates out of vertexes. A gradient computing part computes the gradients of the edges on the outer periphery of the polygon based on the sequence of the vertex coordinates. A polygonal shape determining part determines polygonal shape based on the size relation of the computed gradients. Based on the determined polygonal shape, an edge forming part computes the intersection coordinates with the scanning line by sequentially adding the gradients on two right and left edges from a drawing start point. A painting-out processing part performs painting-out processing between the computed intersections with the scanning line. <P>COPYRIGHT: (C)2007,JPO&INPIT

Description

  The present invention relates to a graphic drawing apparatus for drawing a polygon and a program for causing a computer to realize a graphic drawing function.

As a conventional figure drawing apparatus for drawing a polygon, for example, the one shown in Japanese Patent Laid-Open No. 5-46783 (Patent Document 1) has been proposed. This creates a contour line by connecting the vertices of the polygon in the order in which they are entered, and draws the polygon formed by the contour line, saving the coordinates of the intersection of the polygon and the scanning line, color information, etc. An image memory is provided.
Therefore, in the above method, depending on the order in which the vertex coordinates of the polygon are input, the figure may be drawn in a twisted form as shown in FIG. For example, when the vertex coordinates are always set in the order of V1⇒V2⇒V3⇒V4 as shown in (E) and the rectangular outline is generated in the set order, as shown in (F) Even if it is desired to draw a simple rectangle, if the input order of the vertex coordinates is as shown in (F), it is drawn in a twisted form as shown in (G). In order to avoid such a drawing result, it is necessary to determine a polygonal shape.

  Japanese Patent Laid-Open No. 7-105405 (Patent Document 2) discloses a method of drawing a polygon to be drawn by dividing it into a plurality of triangles. Furthermore, when the polygon is a quadrangle, a method is shown in which shape determination is used to separate processing from further polygons to improve processing performance. In Patent Document 2, outer product calculation is used for shape determination of a triangle or a quadrangle after polygon division.

JP-A-5-46783 JP-A-7-105405

The polygon drawing method disclosed in Patent Document 1 includes an image memory for storing the intersection coordinates of the polygon edge and the scanning line, and therefore requires a storage area corresponding to the vertical size of the drawing area. However, there is a problem that there is a limit in reducing the hardware scale.
Further, the technique disclosed in Patent Document 2 uses a cross product operation for determining a polygonal shape, and there is a problem that a large amount of calculation is required for each drawing process. Thus, with the conventional polygon drawing technique, it is difficult to execute high-speed drawing without requiring a large amount of calculation from vertex information input in an arbitrary order.

The present invention has been made to solve the above-described problems. A polygon outline (edge) is determined from vertex information input in an arbitrary order, and the polygon is filled at high speed. Make it possible to do.
In addition, a graphic drawing apparatus capable of drawing a polygon at high speed by a simple calculation without requiring a storage area for storing the coordinates of the intersection between the polygon edge and the scanning line, and a program for causing the computer to realize this graphic drawing function The purpose is to obtain.

  The figure drawing apparatus according to the present invention inputs polygon information including the vertex coordinates of a polygon, and the vertex sorting unit that performs numbering in order from the smallest Y coordinate among the vertices, and the vertex sorting unit determine A gradient calculating unit that calculates a gradient of an edge that is an outer periphery of the polygon based on the order of the vertex coordinates, and a polygon shape that determines a polygonal shape based on a magnitude relationship of the gradients calculated by the gradient calculating unit An edge generation unit that calculates the coordinates of the intersection with the scanning line by sequentially adding gradients for the two left and right edges from the drawing start point based on the polygon shape determined by the polygon shape determination unit; A paint processing unit that performs paint processing between intersections with the scanning line calculated by the generation unit.

  According to the graphic drawing device according to the present invention, the polygonal shape based on the vertex information input in an arbitrary order using a simple determination condition based on the magnitude relation of the gradient calculated by the gradient calculating unit A configuration in which the paint processing unit performs the paint processing between the coordinates of the intersection of the two left and right edges and the scanning line from the drawing start point determined by the shape determination unit and calculated by the edge generation unit based on the polygonal shape Therefore, there is an effect that the inside of the polygon can be filled at a high speed and the polygon can be drawn at a high speed. Further, since the processing is sequentially performed while the Y coordinate is incremented with the vertex having the minimum Y coordinate as the drawing start point, a storage area for storing the intersection coordinate between the scanning line and the edge is not required.

Embodiment 1 FIG.
FIG. 1 is a block diagram showing a configuration of a graphic drawing apparatus according to Embodiment 1 of the present invention. The graphic drawing device 7 according to the first embodiment includes a vertex sorting unit 1, a gradient calculating unit 2, a polygon shape determining unit 3, an edge generating unit 4, and a painting processing unit 5, and is generated by the graphic drawing device 7. Pixel data is held in the frame buffer 6, and the held pixel data is read and displayed as appropriate.

  The vertex sorting unit 1 numbers polygon vertex information input as electronic data in order from the smallest Y coordinate. The gradient calculation unit 2 calculates the gradient of a line segment connecting the other vertexes with the vertex having the minimum Y coordinate obtained by the vertex sorting unit 1 as a starting point. The polygon shape determination unit 3 compares the gradient magnitudes calculated by the gradient calculation unit 2 and determines the polygonal shape. The edge generation unit 4 sequentially adds the gradient calculated by the gradient calculation unit 2 while incrementing the Y coordinate with respect to the coordinates of the drawing start point based on the polygon shape determined by the polygon shape determination unit 3. The coordinates of the intersection between the edge and the scanning line are calculated. The painting processing unit 5 performs painting processing based on the coordinates of the intersection between the edge calculated by the edge generation unit 4 and the scanning line. The frame buffer 6 holds polygonal pixel data generated by the graphic drawing device 7.

  In addition, the vertex sort unit 1, the gradient calculation unit 2, the polygon shape determination unit 3, the edge generation unit 4 and the painting processing unit 5 which are constituent elements of the graphic drawing device 7 are provided with a graphic drawing program in accordance with the spirit of the present invention. It can be realized as a specific means in which software and hardware cooperate on the computer by causing the computer to read and controlling the operation of each unit. The computer includes a mobile phone and a portable information terminal that have a communication function and can execute the graphic drawing program. The configuration of the computer itself and its basic functions can be easily recognized by those skilled in the art based on the common general technical knowledge in the technical field, and are not directly related to the essence of the present invention. To do.

  FIG. 2 is a diagram for explaining a polygon drawing processing procedure according to the present invention, and shows a case of drawing a rectangle as an example. Here, it is assumed that the coordinates (x1, y1) to (x4, y4) of the vertices are set as polygon information input from the CPU of the computer on which the graphic drawing device 7 is mounted. In addition, the coordinates of the input vertices may be in any order, and the vertex sorting unit 1 renumbers them so that V1 (x1, y1) to V4 (x4, y4) are in order from the smallest Y coordinate. Do. Therefore, the notation in FIG. 2 may be considered as a state after the processing by the vertex sorting unit 1 is performed.

In the present invention, the n-order polygon is divided into (n-1) trapezoidal or triangular regions by a horizontal line passing through each vertex of the polygon, and (1), (2) in order from the region with the smallest Y coordinate. , (3) region. In the case of a quadrangle as shown in FIG. 2, the order of the vertices viewed counterclockwise from the vertex having the smallest Y coordinate is V1⇒V2⇒V3⇒V4 (A), and V1⇒V3⇒V4⇒. When it becomes V2, it can be classified into two types (B).
Further, among the line segments formed by selecting any two points from the vertexes of the polygon, those on the outline of the polygon are called edges. For example, V1V2, V1V4, V2V3, and V3V4 correspond to the edges in FIG. 2A, and V1V2, V1V3, V2V4, and V3V4 correspond to the edges in FIG. 2B.

  On the other hand, if the vertex of the quadrangle is input under the condition that the dent is formed in the quadrangle as shown in FIG. 3, it is determined which quadrangle of FIGS. 3C and 3D should be drawn. I can't. This is a problem that cannot be avoided due to the nature of the figure, and is not directly related to the essence of the present invention. Hereinafter, only convex polygons will be handled in the present invention.

Next, the operation will be described.
The graphic drawing device 7 is set with information on coordinates of n vertices, drawing colors, etc. as information of the n-th order polygon drawn from the CPU, and starts operating upon receipt of an activation command. When the activation command is received, the vertex sorting unit 1 is activated and numbers V1 to Vn in ascending order of the Y coordinate of the vertex.

The gradient calculation unit 2 calculates the gradient of the line segment connecting the point V1 having the minimum Y coordinate of the vertex and the other vertex of the polygon, using the information of the number determined by the vertex sorting unit 1. When drawing a quadrangle as shown in FIG. 2, three gradients of edges V1V2, V1V3, and V1V4 are calculated. These gradients are calculated by calculations according to the following formulas (1) to (3).
dx12 = (x2-x1) / (y2-y1) (1)
dx13 = (x3-x1) / (y3-y1) (2)
dx14 = (x4-x1) / (y4-y1) (3)

  The polygon shape determination unit 3 determines the magnitude relationship between the three gradients obtained by the above equation, and determines two edges at which the gradient is maximum and minimum. In the case of an n-order polygon, the magnitude relation of n-1 gradients is determined.

The edge generation unit 4 uses a so-called DDA (digital differential analyzer), and sequentially adds the gradient calculated by the gradient calculation unit 2 to the X coordinate of the drawing start point as shown in FIG. And the coordinates of the intersection of the scanning line. For example, when a quadrangle as shown in FIG. 7 is drawn, the coordinates x12 (y) and x13 (y) of the intersection of the edge and the scanning line in the region (1) are sequentially calculated by the following equations (4) and (5). To do. However, the Y coordinate of the scanning line is set to y.
x12 (y) = X1 + dx12 × (y−Y1) (4)
x13 (y) = X1 + dx13 × (y−Y1) (5)

  The painting processing unit 5 sequentially generates pixels so as to connect the intersections between the two edges obtained by the edge generation unit 4 and the scanning line. Further, when the Y coordinate reaches the final value in each of the areas (1) to (3), a process of shifting the drawing area to the next area is performed.

Next, details of the polygon rendering process according to the first embodiment will be described.
FIG. 4 is a flowchart showing the flow of polygon drawing processing by the graphic drawing apparatus of the first embodiment, and will be described with reference to this figure.
First, as described above, the vertex sorting unit 1 performs numbering from V1 to Vn in ascending order of the Y coordinate of the vertex (step ST1). Next, the gradient calculation unit 2 calculates the gradient of each line segment connecting the point V1 having the smallest Y coordinate of the vertex and the (n−1) vertexes V2 to Vn. When a quadrilateral is drawn as shown in FIG. 2, the gradients of the edges V1V2, V1V3, and V1V4 are calculated. (Step ST2).
Note that the value of the gradient is not an absolute value but a value that takes into account positive and negative.

  Next, the polygon shape determination unit 3 determines the magnitude relationship of the n−1 gradients calculated by the gradient calculation unit 2. When drawing a quadrangle as shown in FIG. 2, the magnitude relationship between the three gradients obtained by the above formulas (1) to (3) is determined, the edge where the gradient is maximum and minimum is determined, and these are determined. The active edge in the region (1) is determined (step ST3). Here, an edge indicated by a thick line in FIG. 2 is an active edge in the region (1). If the active edge in the region (1) is determined, the active edges in the regions (2) and (3) are also automatically determined as shown in FIG. However, in FIG. 5, the edge on the side where V1V2 is first selected in the region (1) is represented as edge 1 and the other edge is represented as edge 2. At the same time, an update flag for determining whether or not to switch the active edge when the boundary of the region is reached is determined as shown in FIG. Note that the gradient of the edge whose gradient is not the maximum or minimum is not used in future calculations.

Subsequently, the edge generation unit 4 adds the product of the increase of the gradient and the y coordinate to the coordinates of the drawing start point for the two active edges determined by the polygon shape determination unit 3, respectively. The X coordinate of the intersection of the edge and the scanning line is obtained (step ST4).
Thereafter, the painting processing unit 5 sequentially creates pixels so as to connect the intersections between the two edges calculated by the edge generation unit 4 and the scanning line, and performs painting processing (step ST5). Further, it is determined whether or not the Y coordinate is the final value (step ST6). If the Y coordinate is not the final value, the Y coordinate is incremented (step ST7), and then the processes of (step ST4) to (step ST6) are repeated. If the Y coordinate is the final value, the process branches depending on which of the areas (1) to (3) in FIG. 2 is the final value.

When the Y coordinate is the final value (y2) of the area (1), the process proceeds to the drawing process of the area (2) (step ST9). Here, regarding the edge whose update flag is 1 shown in FIG. 6, since the active edge needs to be switched, the gradient is newly calculated. When drawing a rectangle, as shown in FIG. 5, the gradient of the edge V2V3 is calculated for the type of rectangle (A), and the gradient of V2V4 is calculated for the type of rectangle (B).
In addition, the gradient of the edge V3V4 used in the region (3) is calculated at the same time. This gradient is stored in place of the gradient not selected in (Step ST3). Here, by calculating the two gradients in parallel, it is possible to omit the overhead due to division when shifting to the region (3). Then, after incrementing the Y coordinate (step ST7), the processes of (step ST4) to (step ST6) are repeated.

When the Y coordinate is the final value (y3) of the area (2), the process proceeds to the drawing process of the area (3) (step ST11). Since the gradient of the active edge has already been obtained as described above, it is not necessary to newly calculate the gradient. Further, the edge with the update flag 1 shown in FIG. 6 is replaced with the gradient of the edge V3V4 calculated in the above (step ST9). Then, after incrementing the Y coordinate (step ST7), the processes of (step ST4) to (step ST6) are repeated.
If the Y coordinate is the final value (y4) of the area (3), the drawing is terminated (step ST12).

  As described above, in the first embodiment, even when vertex coordinates are randomly input when drawing a polygon, by classifying the polygon shape under a simple determination condition of gradient magnitude comparison, It becomes possible to draw a polygon without twisting as shown in FIG. Further, polygon drawing can be performed without using a storage capacity for storing the intersection coordinates of the scanning line and the edge. Therefore, the circuit scale can be kept small even when the graphic drawing device 7 according to the first embodiment is implemented as hardware. Furthermore, since the fill processing unit 5 generates pixels so that the X coordinate is continuous in the horizontal direction, for example, when using SDRAM for the frame buffer 6, the burst transfer function can be used effectively and at high speed. There is an effect that drawing can be performed.

Embodiment 2. FIG.
In the first embodiment described above, it is assumed that the polygon is filled with a single color. Next, each vertex color of the polygon (for example, each component of RGB) is input, and on the edge of the polygon and An embodiment corresponding to a case where gradation filling is performed by calculating a filling color by linear interpolation for the inner region will be described.
FIG. 8 is a block diagram showing the configuration of the graphic drawing apparatus in such a case. The graphic drawing device 14 according to the second embodiment includes a vertex sorting unit 8, a gradient calculation unit 9 including a parallel divider, a polygon shape determination unit 10, an edge generation unit 11, and a painting processing unit 12. Pixel data generated by the graphic drawing device 14 and held in the frame buffer 13 is appropriately read and displayed.

Next, the operation of the second embodiment will be described.
The graphic drawing apparatus 14 is set with information on the coordinates of n vertices and the drawing colors of each of the n vertices as information on the n-order polygon to be drawn from the CPU, and starts operation upon receiving an activation command. When the activation command is received, the vertex sorting unit 8 is activated and the vertex coordinates set by the CPU are sorted in ascending order of the Y coordinate and numbered from V1 to Vn.
The gradient calculation unit 9 calculates the gradient of the line segment connecting the point V1 having the minimum Y coordinate of the vertex and the other vertex of the polygon by using the number information determined by the vertex sorting unit 8. The polygon shape determination unit 10 determines the magnitude relationship between the gradients obtained by the gradient calculation unit 9 as in the case of the first embodiment, and determines two edges at which the gradient is maximum and minimum.

Thereafter, the gradient calculating unit 9 performs a process of calculating the gradient of each component of the drawing color for each active edge determined by the polygon shape determining unit 10. For this purpose, the gradient calculation unit 9 includes three parallel dividers as shown in FIG. For example, for the edge V1V2, the gradients dr12, dg12, and db12 of the R, G, and B components of the drawing color are calculated using the following equations (6) to (8). However, the drawing color of the vertex V1 (x1, y1) is (r1, g1, b1), and the drawing color of the vertex V2 (x2, y2) is (r2, g2, b2).
dr12 = (r2-r1) / (x2-x1) (6)
dg12 = (g2-g1) / (x2-x1) (7)
db12 = (b2-b1) / (x2-x1) (8)

  The calculations of equations (6) to (8) may be performed only when the update flag shown in FIG. 6 is updated in the case of a square as shown in FIG. Accordingly, the calculations of the above formulas (6) to (8) need only be performed a total of four times for the entire square, and it is not necessary to repeat the same calculation every time.

  In addition to the processing of the first embodiment, the edge generation unit 11 sequentially adds the gradient of the drawing color calculated by the gradient calculation unit 9 to the drawing color at the drawing start point, so that the edge and the scanning line The drawing color of the intersection is calculated. For example, for the edge V1V2, the following equations (9) to (12) are calculated every time the Y coordinate is incremented.

r12 = r1 + dr12 × (y−y1) (9)
g12 = g1 + dg12 × (y−y1) (10)
b12 = b1 + db12 × (y−y1) (11)

  The painting processing unit 12 sequentially generates pixels so as to connect the intersections between the two edges obtained by the edge generation unit 11 and the scanning line. At that time, the gradient calculation unit 9 reuses the divider used for calculating the gradient of the edge, and draws R, G, and B for each of the drawing colors according to the following equations (12) to (14) for each scanning line. The component gradients dr, dg, and db are calculated in advance. However, the coordinates of the leftmost point of the scanning line are (xl, yl), the drawing color is (rl, gl, bl), the coordinates of the rightmost point of the scanning line is (xr, yr), and the drawing color is (rr, gr, br). ).

dr = (rr−rl) / (xr−xl) (12)
dg = (gr−gl) / (xr−xl) (13)
db = (br−bl) / (xr−xl) (14)

Thereafter, when processing for sequentially generating pixels so as to connect the intersections between the edge and the scanning line is performed, the drawing color r (x) of each pixel located on the scanning line is expressed by the following equations (15) to (17). ), G (x), and b (x) are calculated using the results of the above equations (12) to (14). However, the X coordinate of the point on the scanning line is set to px.
r (x) = rl + dr × (px−x1) (15)
g (x) = gl + dg × (px−x1) (16)
b (x) = bl + db × (px−x1) (17)

  FIG. 9 is a diagram for explaining a usage state of the dividers 1 to 3 when performing a rectangular gradation filling as shown in FIG. In the second embodiment, the gradient of the edge and the gradient of each of the R, G, and B components of the drawing color can be calculated using the divider without waste.

  As described above, according to Embodiment 2 of the present invention, it is possible to realize gradation filling by linear interpolation of each vertex color of a polygon at high speed. Further, the number of dividers that cause the circuit scale to increase when the graphic drawing device 14 is implemented in hardware can be realized by limiting the total number to only three.

Embodiment 3 FIG.
In the second embodiment described above, each vertex color of the polygon is input and gradation filling is performed. However, the texture address corresponding to each vertex of the polygon is designated, and the polygon edge is selected. In addition, it is also possible to apply a texture to an arbitrary polygon by calculating a texture address by linear interpolation for the inner area. In the third embodiment, two elements out of the three elements of RGB in the second embodiment can be shared with the texture address calculation, so that the same configuration can be realized. Also, by using both gradation processing and texture address calculation, so-called texture blending effects can be easily realized.

Embodiment 4 FIG.
In the above embodiment, the painting processing unit 5 or the painting processing unit 13 performs the painting process for each scanning line, but the painting is performed by 4 × 4, 8 × 4, or the like. You may carry out per tile (block). In this embodiment, a storage area is required for temporarily storing the coordinates of the scanning line ends, the drawing color, the gradient of the drawing color, and the like by the size of the tile in the Y-axis direction.

The graphic drawing technique according to the present invention is applied to a 2D / 3D graphic score so that polygons can be classified by simple determination conditions from vertex information input in an arbitrary order in polygon drawing. Since a storage area for storing the intersection coordinates with the scanning line is not required, the hardware scale can be reduced.
Further, it is possible to provide a 2D / 3D graphic score that can be added with various additional functions such as painting with a gradation and pasting a texture in comparison with a conventional 2D graphic score.

It is a block diagram which shows the structure of the figure drawing apparatus by Embodiment 1 of this invention. It is a figure for demonstrating a polygon (rectangle) drawing system. It is explanatory drawing of the square with a dent. 6 is a flowchart illustrating a flow of polygon (rectangular) drawing processing according to the first embodiment. It is a figure which shows the square active edge selection order of FIG. It is a figure which shows the square edge update flag of FIG. It is a figure for demonstrating the edge calculation system of the edge production | generation part 4. FIG. It is a block diagram which shows the structure of the figure drawing apparatus by Embodiment 2 of this invention. FIG. 6 is a diagram for explaining a processing status of a divider included in a gradient calculation unit 9; It is a figure for demonstrating the case where a figure will be twisted and drawn in the conventional polygon drawing apparatus.

Explanation of symbols

  1, 8; vertex sort unit, 2, 9; gradient calculation unit, 3, 10; polygon shape determination unit, 4, 11; edge generation unit, 5, 12; paint processing unit, 6, 13; 7, 14: Graphic drawing apparatus.

Claims (6)

A vertex sort unit that inputs polygon information including the vertex coordinates of a polygon and performs numbering in order from the smallest Y coordinate among the vertices;
A gradient calculating unit that calculates a gradient of an edge that is an outer periphery of the polygon based on the order of the vertex coordinates determined by the vertex sorting unit;
A polygonal shape determining unit that determines a polygonal shape based on the magnitude relationship of the gradients calculated by the gradient calculating unit;
Based on the polygon shape determined by the polygon shape determination unit, an edge generation unit that calculates the coordinates of the intersection with the scanning line by sequentially adding gradients for the two left and right edges from the drawing start point;
A graphic drawing apparatus comprising: a painting processing unit that performs painting processing between intersections with the scanning line calculated by the edge generation unit.   The gradient calculation unit calculates a gradient with respect to (number of vertices −1) line segments connecting a point having the minimum Y coordinate of the input vertex and the other vertices. Item 2. A drawing apparatus according to Item 1.   The polygon shape determination unit compares the magnitudes of the (number of vertices-1) gradients calculated by the gradient calculation unit, and determines the polygonal shape based on the information of two edges having the maximum or minimum gradient. The graphic drawing apparatus according to claim 1, wherein the graphic drawing apparatus is a graphic drawing apparatus.   The painting processing unit performs painting processing by dividing a trapezoidal or triangular area into (vertex number-1) trapezoidal or triangular areas by a horizontal line passing through each vertex of the polygon, and continuously generating pixels in the horizontal direction. The graphic drawing apparatus according to claim 1, wherein the graphic drawing apparatus is one of the first to third aspects. The polygon information input to the vertex sort section includes the vertex coordinates and the drawing color at the vertex coordinates.
The gradient calculation unit includes a divider, and the divider calculates a gradient of a polygon edge and performs gradient calculation for calculating a drawing color inside the polygon based on a drawing color of the polygon information. The graphic drawing apparatus according to claim 1, wherein the graphic drawing apparatus is characterized in that:   The polygon information including the vertex coordinates of the polygon is input, and the vertex sorting unit that performs ordering in order from the smallest Y coordinate among the vertices, the multiplicity based on the order of the vertex coordinates determined by the vertex sorting unit. A gradient calculation unit that calculates a gradient of an edge that is an outer periphery of a square, a polygon shape determination unit that determines a polygon shape based on a magnitude relationship of gradients calculated by the gradient calculation unit, and a determination by the polygon shape determination unit An edge generation unit that calculates the coordinates of the intersection with the scanning line by sequentially adding gradients for the two left and right edges from the drawing start point based on the polygonal shape, and the scanning line calculated by the edge generation unit A graphic drawing program that causes a computer to function as a paint processing unit that performs paint processing between intersections.

Images