JP3130896B2 - Translucent drawing generation method and apparatus therefor - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to an image processing for displaying an image including opaque polygons and translucent polygons represented by three-dimensional computer graphics. In order to prevent the loss of translucent polygons when the threshold value is exceeded, when it is time to switch from opaque polygon data to translucent polygon data, the translucent polygon data is drawn, and the time required for program development is greatly reduced. The present invention relates to a translucent drawing generation method and an apparatus therefor that are intended to be shortened.

[0002]

2. Description of the Related Art Images containing translucent representations are used especially in three-dimensional computer graphics. Translucent expressions generally include water and glass, but with the spread of home-use game consoles in recent years, translucent expressions have been made even with light rays, electricity, flames, fireworks, etc., so that more realistic images can be expressed. Became. FIGS. 12 and 13 show this conventional technique.
Is shown in FIG. 12 is a block diagram showing a configuration of a conventional translucent drawing generation apparatus.

In FIG. 12, polygon data is input to a polygon discriminating unit 111. The polygon data is data generated by performing an arithmetic operation such as coordinate conversion or perspective / shadow conversion in a preceding stage (not shown). . When the polygon data is input to the polygon identification unit 111, it is determined whether the data is opaque polygon data or translucent polygon data. The opaque polygon data is sent to the switch 112, and the translucent polygon data is stored in the data storage unit 115. Further, the semi-transparent polygon data is also input to the opaque drawing end determination unit 116.

When the opaque polygon data input from the polygon discriminating unit 111 is completed, the opaque drawing end determining unit 116 outputs a switching control signal to the switching unit 112 to switch the opaque polygon data to the translucent polygon data. The translucent polygon data stored in the storage unit 115 is output to the image synthesis unit 113. The image synthesizing unit 113 synthesizes the opaque polygon data and the translucent polygon data switched by the switching unit 112, draws the combined data on the frame memory, and displays it on the display unit 114.

[0005] Next, the operation of the conventional translucent drawing generating apparatus configured as described above will be described with reference to the flowchart of FIG. First, when the translucent drawing generation device starts and polygon data is input to the polygon identification unit 111, the polygon identification unit 111 identifies opaque polygon data and translucent polygon data from the polygon data (step S1). . The identified opaque polygon data is sent to the image synthesizing unit 113 through the switching unit 112, where the opaque image is drawn in the frame memory (step S2), and the above processing procedure is continued until the drawing of the opaque image ends. Is performed (step S3).

The translucent polygon data identified from the polygon data by the polygon identification unit 111 is stored in the data storage unit 115 (step S4). The opaque drawing end determining unit 116 determines that the drawing of the opaque polygon data has been completed by the image combining unit 113,
Further, when it is determined that the translucent polygon data has been stored in the data storage unit 115 (step S
5) The switching control signal is output from the opaque drawing end determination unit 116 to the switching unit 112.

As a result, the switching unit 112 outputs the translucent polygon data stored in the data storage unit 115 to the image synthesizing unit 113 through the switching unit 112 (step S6). The image synthesizing unit 113 draws the translucent image based on the translucent polygon data in the frame memory (step S7). When the translucent drawing is completed (step S8), the image is displayed on the display unit 114, and a series of processing ends.

As described above, when the conventional translucent drawing generating apparatus draws from polygon data, if the number of polygons forming an object increases, the drawing data of an image for one frame naturally increases. When the amount of drawing data for one frame is equal to or larger than a predetermined threshold, in a translucent image, a missing portion occurs in a translucent polygon having a slow drawing order.
The drawing data is transmitted from data having a higher priority. Since the drawing data transmitted late is polygon data with a low drawing priority, there is no visual problem even if drawing is lost.

[0009] However, in the case of an image including translucent, after rendering of all the opaque polygons is completed for the blending process, the translucent polygon is rendered in the order of the Z value from the back to the front. Therefore, the translucent polygons are drawn regardless of the priority order, and even a translucent polygon having a high priority may be drawn last and may be missing.
In this case, tuning is performed to adjust the amount of drawing data so as to draw a translucent polygon having a high priority by cutting off an opaque polygon having a low priority.

That is, in order to generate an image having no visual problem, the drawing data is set within a predetermined processing range by tuning. The tuning here is called "culling". The culling is to calculate and cut off data with low drawing priority (such as a distant tree) in advance to improve the drawing processing speed. Say.

FIG. 7 is a flow chart showing the procedure of a conventional tuning operation when drawing is missing. As shown in FIG. 7, the image is checked (step S9), and it is determined in step S10 whether or not the drawing is missing. If there is no drawing, the process is terminated. The parting operation (that is, culling is performed) is performed, and the process returns to step S9. In this way, the image check and the drawing-off operation of the drawing data are repeated to keep the amount of drawing data of one frame within the processable range.

[0012] However, this tuning operation requires a lot of man-hours. For example, one frame is 1/60
In the case of drawing in seconds, it is necessary to debug 3600 frames (1 second × 60 frames × 60 seconds) repeatedly when converted to 60 frames per minute and 1 minute.
FIG. 8 shows an image before tuning generated by a conventional translucent drawing generation device. In this case road 21
Shows a state in which the automobile 23 is running on a row of trees in which a large number of trees 24a to 24n and 25a to 25n are planted on both sides of the frame. One frame is processed in 1/60 second, and the drawing data amount is a predetermined amount. It is assumed that the threshold is exceeded.

Although the glass portion 23a of the automobile 23 composed of the translucent polygons has a higher drawing priority, the translucent polygons "6", "7",
An image loss occurs at the portions "8" and "9", and an unnatural image is generated. FIG. 9 is a diagram showing a drawing image of the image of FIG. FIG. 9A shows the transmission order of polygon data, and FIG. 9B shows an image image. Numerals “1” to “12” in FIG. 9 each indicate a polygon. The transmission order of the polygon data is as follows: the body 23b of the automobile 23, the glass part 23a, the road 21,
This shows a state where the data is transmitted in the order of the trees 24a to 24n and 25a to 25n.

In the drawing image of FIG. 9B, the glass portion 23 of the automobile 23 is used for blending.
The parts of the translucent polygons "6" to "9" of the translucent polygons "1" to "9" in "a" are sorted and drawn last. Therefore, the drawing data portion that could not fit within 1/60 second, that is, the glass portion 23a
With respect to the semi-transparent polygons "6", "7", "8", and "9", the image is missing. In this case, the semi-transparent polygons “6” to “9” in the glass portion 23a
Is an example in which the Z value is the same, but if one object is composed of polygons with different Z values, the missing semi-transparent polygon will cause the lack of drawing. Occurs.

When such a loss occurs, a natural image is generated by tuning. FIG. 10 shows a drawing generated and tuned by a conventional translucent drawing generating apparatus, FIG. 11 shows a drawing image of FIG. 10, FIG. 11A shows an image image, and FIG. )
Indicates the image after tuning. FIG.
Opaque polygons "9", "10", "11", "1" of trees 24a to 24n and 25a to 25n in
Numeral 2 denotes a culling portion that is not drawn. In FIG. 11A, the opaque polygons "9", "10", and "1"
"1" and "12" are shown as culling portions. In this manner, by culling the drawing data with low priority (opaque polygons “9”, “10”, “11”, “12” of trees 24a to 24n and 25a to 25n), the glass part 23a is Tuning is performed so that the translucent polygons "1" to "9" can be completely drawn. On this occasion,
The repetitive debugging work as shown in FIG. 7 is performed.

[0016]

However, in the case of performing the above-mentioned tuning, there is a problem that a large number of man-hours are required for the tuning operation as described above, and therefore a long time is required for program development. A drawing apparatus and a drawing method (Japanese Patent Laid-Open No. 10-11610) for rapidly drawing an image including an opaque polygon and a translucent polygon using a Z buffer as an approximation technique,
An image synthesizing apparatus and an image synthesizing method (Japanese Patent Application Laid-Open No. 08-185543) for realizing translucent expression reflecting the thickness of a translucent display object using a buffer are disclosed.
None of these publications mentions any solution to the inefficiency of the tuning operation.

The present invention has been made in order to solve the above-mentioned conventional problems. By performing processing instead of tuning in real time at the time of image drawing, tuning work is abolished, and the time required for program development is greatly reduced. Thus, even when the amount of drawing data for one frame exceeds a predetermined threshold value, it is possible to secure the expected drawing time of a high-priority translucent polygon, so that translucent data to be drawn during one frame period is not lost. It is an object of the present invention to provide an efficient translucent drawing generation method and an apparatus capable of drawing.

[0018]

In order to achieve the above object, a translucent drawing generating method according to the present invention comprises a first step of discriminating opaque polygon data and translucent polygon data from polygon data; A second step of Z-sorting the transparent polygon data in the order from the back to the front and storing it in the data storage unit; a third step of drawing the opaque polygon data in the frame memory; A fourth step of calculating an estimated rendering time required to render the polygon data;
A fifth step of calculating a drawing switching time between the opaque polygon data and the translucent polygon data stored in the data storage unit from the calculated predicted drawing time; and a frame of the opaque polygon at the switching time. A sixth step of stopping drawing on the memory and switching the drawing of the translucent polygon data to the frame memory, and a step of displaying the drawing data for one frame when drawing on the frame memory for one frame is completed. 7
And a step. Therefore, the opaque polygon data and the translucent polygon data are distinguished from the polygon data, and the translucent polygon data is Z-sorted in the order from the back to the front and stored in the data storage unit, and the opaque polygon data is stored in the frame memory. And the estimated drawing time required to draw one polygon data from the translucent polygon data is calculated. Based on the calculated predicted drawing time, a drawing switching time between the opaque polygon data and the translucent polygon data stored in the data storage unit is calculated, and at this switching time, drawing of the opaque polygon to the frame memory is stopped. Switching to drawing of the transparent polygon data to the frame memory, once drawing to the frame memory for one frame is completed, the drawing data for one frame is displayed, so tuning work is abolished and the time required for program development Can be significantly shortened, and even when the amount of drawing data for one frame exceeds a predetermined threshold value, it is possible to secure an estimated drawing time of a high-priority translucent polygon, thereby improving the processing work efficiency. (1) Translucent data to be drawn in one frame period can be drawn without omission.

Further, the translucent drawing generating apparatus of the present invention comprises:
A polygon discriminator for discriminating opaque polygon data and translucent polygon data from polygon data, a data storage for storing the translucent polygon data in a Z-sorting order from the back to the front, An estimated drawing time calculation unit for calculating an estimated drawing time required to draw one polygon from the polygon data; and the opaque polygon data and the translucent from the estimated drawing time calculated by the estimated drawing time calculation unit A drawing switching time calculation unit for calculating a switching time for drawing the polygon data; and when the drawing switching time calculated by the drawing switching time calculation unit comes, the opaque polygon data is drawn from a frame memory and stored in the data. Image to switch to rendering of translucent polygon data stored in the Characterized in that it comprises a part. Therefore, the polygon identification unit identifies the opaque polygon data and the transparent polygon data from the polygon data, and stores the identified translucent polygon data in the data storage unit by Z-sorting in the order from the back to the front. Calculates the estimated drawing time required to draw one polygon from the translucent polygon data in the estimated drawing time calculation unit, and draws opaque polygon data and translucent polygon data from the estimated drawing time in the drawing switching time calculation unit. When the rendering switching time is reached, the image compositing unit switches from rendering the opaque polygon data to the frame memory to rendering the opaque polygon data stored in the data storage unit to the frame memory. Therefore, processing that replaces tuning is performed in real time when It by, to abolish the tuning work, can significantly reduce the time it takes to program development, 1
Even when the amount of drawing data for a frame exceeds a predetermined threshold value, it is possible to secure an estimated drawing time of a translucent polygon having a high priority, improve work efficiency, and perform drawing in one frame period. Powerful translucent data can be drawn without omission.

[0020]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS A translucent drawing generation method and apparatus according to an embodiment of the present invention will be described below with reference to the drawings. FIG. 1 is a block diagram showing a configuration of a first embodiment of a translucent drawing generation apparatus according to the present invention. In the description of the configuration in FIG. 1, the same parts as those of the conventional translucent drawing generation apparatus shown in FIG. 12 are denoted by the same reference numerals to avoid redundant description, and different parts from FIG. The features of the first embodiment will be mainly described.

As is clear from the comparison of FIG. 1 with FIG. 12, FIG. 1 shows a configuration in which a predicted drawing time calculating unit 117 and a drawing switching time calculating unit 118 are newly added to the configuration of FIG. I have. Of the polygon data identified by the polygon identification unit 111, translucent polygon data is temporarily stored in the data storage unit 115. At this time, for the blending process, the semi-transparent polygon data is Z-sorted in the order from the back to the front.

The calculation unit 117 of the estimated drawing time
The time required to draw a translucent polygon is calculated. The predicted drawing time calculated by the predicted drawing time calculation unit 117 is output to the drawing switching time calculation unit 118. Calculating unit 118 for drawing switching time
Is configured to calculate the switching time between drawing an opaque polygon and a translucent polygon by inputting the estimated drawing time, and output a switching control signal to the switching unit 112.

When the switching time between the opaque polygon data and the translucent polygon data calculated by the drawing switching time calculation unit 118 is reached, the switching unit 112 changes the translucent polygon stored in the data storage unit 115 by the switching control signal. The data is output to the image combining unit 113. The other parts are configured in the same manner as shown in FIG.

Next, the operation of the first embodiment of the translucent drawing generating apparatus according to the present invention configured as described above will be described with reference to the flowchart of FIG. By describing this operation, the first method of the translucent drawing generation method according to the present invention
The description of the embodiments is also used. Blending (color mixing) processing is one of means for realizing an image including a translucent expression. The blending process is to display the opaque polygon at the back by drawing the opaque polygon at the back of the translucent polygon at the front, so that the opaque polygon at the back can be seen through the translucent polygon.

Therefore, in the image including the translucent representation, the translucent polygon must be drawn from the back to the front after all the drawing of the opaque polygon is completed. The transmitted drawing data does not need to be drawn in the same order, but must be drawn after being sorted so that the drawing can be performed accurately. Therefore, in the first embodiment, as shown in FIG.
A variable n for counting the number of translucent polygons in the polygons forming the two-dimensional image is initialized to n = 0 (step S21). The generated polygon data is subjected to arithmetic processing such as coordinate conversion and perspective / shadow conversion in the preceding stage, and polygon data is generated.

The generated polygon data is processed in units of one polygon from the subsequent stage. Polygon identification unit 11
In step 1, it is determined whether the data is opaque polygon data or translucent polygon data based on the information of the polygon data (step S22). When the polygon identification unit 111 identifies that the polygon data is opaque polygon data, the polygon data is input to the image synthesis unit 113 through the switching unit 112. The image synthesizing unit 113 draws the opaque polygon based on the opaque polygon data using the Z buffer (step S23), and displays it on the display unit 114.

Each time one pixel is drawn by the image drawing unit 113, the drawing switching time calculation unit 118 determines whether or not it is the drawing switching time (step S24). As a result of this determination, if it is determined that it is not the drawing switching time, it is determined whether or not the drawing of all the opaque polygons based on the opaque polygon data currently being drawn has been completed (step S25). If it is determined that the rendering of the opaque polygon has not been completed, the process returns to step S23, and the rendering process of the opaque polygon is continued as before.

If it is determined in step S25 that the rendering of the opaque polygon by the opaque polygon data has been completed, then it is determined whether all rendering of the opaque polygon has been completed with the rendering data for one frame. The determination is made by the time calculation unit 118 (step S2).
6). If it is determined that the rendering of all the opaque polygons has not been completed with the rendering data for one frame, the process returns from step S26 to step S22, and the process of identifying one new polygon data is performed. This is performed by the identification unit 111.

On the other hand, when the polygon identification unit 111 identifies the semi-transparent polygon data from the polygon data in step S22, "1" is added to a variable n for counting the number of the semi-transparent polygons. That is, “n + 1” is set (step S27). The translucent polygon data identified by the polygon identification unit 111 is temporarily stored in the data storage unit 115 (step s29), and the translucent polygon data is Z-sorted in the order from the back to the front. At the same time, the expected drawing time calculation unit 117 calculates the expected drawing time of the polygon required to draw the translucent polygon data in the frame memory as in the following [Equation 1] (step S29).

Drawing time Δt _n [S] = number of pixels (area of polygon) × time required for one pixel [Expression 1]

As is apparent from [Equation 1], in the calculation of the estimated translucent drawing time in step S19, the translucent 1
The area of the polygon is calculated and substituted into [Equation 1] to obtain the estimated drawing time.

Next, the drawing switching time calculation unit 118 performs drawing switching calculation (step S30). In this drawing switching calculation, a time for switching from opaque drawing to translucent drawing is calculated. This arithmetic expression is shown in the following [Equation 2].

Drawing switching time T _n [S] = T _n−1 −Δt _n ... [Equation 2]

In this [Equation 2], T _n is the drawing time of one frame, T ₀ (0 is zero) is one frame, and Δt _n is one translucent polygon calculated in step S29. , And n is a variable for counting the number of translucent polygons.

Further, the drawing switching time calculation section 118
Is determined whether the current time is the drawing switching time calculated in step S30 (step S31). As a result of this determination, if it is determined that it is not the drawing time, the process returns to the process of identifying opaque polygon data and translucent polygon data from the polygon data by the polygon identification unit 111 in step S22, and new one polygon data Perform processing. If it is determined in step S31 that the rendering switching time has elapsed, and if it is determined in step S26 that the opaque rendering has ended, the current process ends, and the process proceeds to step S32.

In this step S32, the translucent polygon data reading process is performed, and the drawing switching time calculated by the drawing switching time calculation unit 118 is reached, and the switching control signal is output to the switching unit 112. 112 is the data storage unit 11 in step S22.
5 is read out, and guided to the image synthesizing unit 113, whereby the image synthesizing unit 1 is read.
13 renders the translucent polygon data in the Z-sorted order (from the back to the front) (step S33), and the blending process is performed.

It is determined whether or not all the drawing of the translucent polygon in the drawing data of the translucent polygon by the image synthesizing unit 113 is completed (step S34). If the determination is made by the unit 113, the process returns from step S34 to step S33, and the drawing of the translucent polygon is continued. If it is determined that the rendering of the translucent polygon has been completed in step S34, the rendering of one frame is completed.

As described above, in the first embodiment of the translucent drawing generating apparatus of the present invention, when the translucent polygon data is identified from the polygon data by the polygon identifying unit 111, the translucent polygon data is converted into data for blending processing. It is stored in the storage unit 115, Z-sorted in the order from the back to the front, and the estimated drawing time calculation unit 117 calculates the estimated drawing time required to draw one translucent polygon. The rendering switching time calculation unit 118 calculates the rendering switching time between the opaque polygon and the translucent polygon, and when the rendering switching time comes, the switching unit 112 stores the translucent polygon data in the data storage module 11.
5 to render the translucent polygon, it is possible to secure an estimated translucent polygon rendering time and prevent the translucent polygon from being lost.

Therefore, by performing processing in place of tuning performed conventionally in real time at the estimated drawing time, the time required for development can be greatly reduced. That is, processing equivalent to the conventional tuning work can be performed by hardware or software, and the processing in step S24 in the flowchart of FIG.
Alternatively, when the drawing switching time is reached in the processing of step S25, the process shifts from drawing an opaque polygon to drawing a transparent polygon, whereby an opaque polygon having a low processing order (low priority) is cut off, and the same processing as culling is performed. Processing is being performed.

FIG. 3 shows a display unit 1 according to the first embodiment.
14 shows a display example of the polygon image displayed, and FIG. 4 shows an example in which the image of the display example of FIG. 3 is divided into polygons and objects. FIG. 4 shows a case where a glass portion 23a (semi-transparent) of an automobile 23 running on a road 21 is composed of nine polygons of polygons "1" to "9". The trees forming the row of trees on both sides of the road 21, that is, the left trees 24 a to 24 n (opaque) and the right trees 25 a to 25 n (opaque) are composed of a total of 12 polygon “1” to “12” objects. Have been.

FIG. 5 shows an example of transmitting the drawing data of the image shown in FIG. In FIG. 5, the drawing priority is a car 23, a road 21, trees 24a to 24n, 25a to 25n.
n, the body is opaque, the glass part 23a is translucent, the glass part 23a is one object, and is composed of nine polygons from polygon "1" to polygon "9". Polygon "9" from "1"
The drawing data of the polygon is transmitted in the priority order, and the drawing is performed in that order. The priority of the road 21 is from the near side to the far side. The drawing order of the tree object is also
The tree object is composed of polygons “1” to “12”, and one polygon is composed of a plurality of polygons “1” to “n”. The polygon drawing data is transmitted in units of objects, and is drawn in that order.

FIG. 6 is a drawing image of one frame drawn by using the translucent drawing generating apparatus of the present invention. FIG.
6A shows the polygon data transmission order, and FIG. 6B shows a drawing image. As shown in FIG. 6A, the transmission order of the polygon data is as follows: the body 23b of the automobile 23, the glass part 23a, the road 21, the trees 24a to 24n, and 25a to
25n. Glass part 23a is polygon "1" ~
Polygons “9” are processed one by one, and the estimated drawing time calculation unit 117 calculates the drawing time Δt _n [s] by the drawing switching time calculation unit 118 as shown in the above [Equation 1]. By switching the drawing switching time T _n [S] = T _n-1 −Δt _n shown in [Equation 2], the drawing is switched from drawing a polygon using opaque polygon data to drawing a polygon using opaque polygon data.

That is, in the case of an image including a translucent polygon, even when the amount of drawing data for one frame exceeds a predetermined threshold, when a translucent object is transmitted,
The time required for drawing in the frame memory in units of one polygon is calculated (Δt _n ), and based on the result, the switching time between drawing of the opaque polygon and the translucent polygon (T _n [S])
= T _n-1 -Δt _n ) to secure an estimated drawing time of a translucent polygon with high priority. In this way, by switching between opaque drawing and translucent drawing by hardware and software, low priority opaque polygons are excluded from the display content, thereby providing a conventional translucent polygon. Thus, the problem of occurrence of missing can be solved, and an image equivalent to that shown in FIG. 10 can be generated without tuning.

Therefore, according to the present invention, a natural and high-quality image can be provided only by hardware and software without manual tuning work, so that the tuning work at the program development stage is eliminated, and This time can be significantly reduced.

[0045]

As described above, according to the translucent drawing generation method of the present invention, the translucent translucent polygon data identified from the polygon data is Z-sorted in the order from the back to the front to store data. And the estimated drawing time required to draw one polygon data from the semi-transparent polygon data is calculated, and the drawing of the opaque polygon data and the semi-transparent polygon data stored in the data storage unit is calculated from the estimated drawing time. Switching time is calculated to switch from opaque polygon data to translucent polygon data, so tuning work is abolished, the time required for program development can be greatly reduced, and the amount of drawing data for one frame can be reduced to a predetermined threshold. Even if the processing time exceeds the limit, it is possible to secure the expected It is possible to, can be drawn without missing translucent data to be rendered in one frame period.

According to the translucent drawing generation apparatus of the present invention, the translucent polygon data identified by the polygon identification unit is Z-sorted in the order from the back to the front and stored in the data storage unit. The expected time calculation unit calculates the expected drawing time required to draw one polygon from the translucent polygon data, and the drawing switching time calculation unit switches the drawing of opaque polygon data and translucent polygon data from the expected drawing time. By calculating the time, when the expected drawing time is reached, the opaque polygon data is switched to the translucent polygon data stored in the data storage unit, and the image synthesizing unit draws the opaque polygon based on the opaque polygon data. By performing processing in real time when drawing images, tuning work is abolished and program The time required for system development can be greatly reduced, and even when the amount of drawing data for one frame exceeds a predetermined threshold value, it is possible to secure the expected time for drawing a high-priority translucent polygon, thereby improving work efficiency. The translucent data to be drawn in one frame period can be drawn without any loss.

[Brief description of the drawings]

FIG. 1 is a block diagram showing a configuration of a first embodiment of an opaque drawing generation device according to the present invention.

FIG. 2 is a flowchart showing an operation flow of the first embodiment of the opaque drawing generation device according to the present invention;

FIG. 3 is an explanatory diagram showing a display example of a polygon image drawn using the first embodiment of the opaque drawing generation device according to the present invention;

FIG. 4 is an explanatory diagram showing an example of dividing the image shown in FIG. 3 into polygons and objects by the first embodiment of the opaque drawing generation device according to the present invention.

FIG. 5 is an explanatory diagram showing an example of transmitting one frame of drawing data in FIG. 4;

FIG. 6 is an explanatory diagram of a drawing image when the first embodiment of the opaque drawing generation device according to the present invention is used.

FIG. 7 is a flowchart showing a processing procedure of a tuning operation at the time of drawing omission at the time of drawing by the conventional opaque drawing generating apparatus.

FIG. 8 is an explanatory diagram of a case where drawing is missing in a translucent polygon in which a processing order of an image drawn by a conventional opaque drawing generating device is late.

FIG. 9 is an explanatory diagram showing a drawing image of FIG. 8;

FIG. 10 is an explanatory diagram of an image after tuning of the image of FIG. 8 showing a state in which an opaque polygon having a low priority is not drawn.

FIG. 11 is an explanatory diagram showing an image image of FIG. 10;

FIG. 12 is a block diagram showing a configuration of a conventional opaque drawing generation device.

FIG. 13 is a flowchart showing a flow of the operation of the opaque drawing generation device of FIG. 12;

[Explanation of symbols]

21 ... road, 23 ... car, 23a ... glass part, 23b ..., 24a to 24n, 25a to 25n ...
Tree, 111: polygon identification unit, 112: switching unit, 113: image combining unit, 114: display unit, 115
…… Data storage unit, 117 …… Calculation unit for estimated drawing time,
118 ... Calculation unit for drawing switching time.

──────────────────────────────────────────────────続 き Continuation of the front page (72) Inventor Toshihiro Koi 1-403-3, Kosugi-cho, Nakahara-ku, Kawasaki-shi, Kanagawa Prefecture Within NEC Ic Microcomputer System Co., Ltd. (56) References JP-A-6-223411 (JP) , A) (58) Field surveyed (Int. Cl. ⁷ , DB name) G06T 15/00 100 G06T 17/40

Claims (14)

(57) [Claims] 1. A first step of discriminating opaque polygon data and translucent polygon data from polygon data, and Z-sorting the translucent polygon data in order from the back to the front and storing the data in a data storage unit. a second step of a third step of drawing the non-transparent polygon data in the frame memory, a polygon data from the semi-transparent polygon data rendering
4th step for calculating the estimated drawing time required to perform
And the opaque polygon from the calculated expected drawing time
Data and the translucent point stored in the data storage unit.
Fifth process for calculating the switching time of drawing with Rigon data
And the frame of the opaque polygon at the switching time.
Stop drawing on the memory, and save the semi-transparent polygon data
The sixth step of switching to drawing in the frame memory, and when the drawing in the frame memory for one frame is completed,
Seventh step of displaying the drawing data for one frame
And a translucent drawing generation method. 2. The calculation of the predicted drawing time is performed by calculating a predicted drawing time Δt _n [S] = [number of pixels (polygon area) ×
2. The translucent drawing generation method according to claim 1, wherein the calculation is performed based on a time required for one pixel] (where n is a variable for counting the number of translucent polygons). 3. The drawing switching time is calculated by a drawing switching time T _n [S] = T _n−1 −Δt _n (where Δt _n is a drawing time of one translucent polygon, and n is a drawing time of a semi-transparent polygon. 2. The translucent drawing generation method according to claim 1, wherein the calculation is performed by using a variable for counting the number. 4. The method according to claim 1, wherein the drawing of the opaque polygon is performed using a Z buffer. 5. The method according to claim 1, wherein the drawing of the translucent polygon is performed in the Z-sorted order. 6. To the frame memory of said translucent polygon
The drawing order of the input to the polygon identification unit at the transition from the drawing of the opaque polygon to the drawing of the translucent polygon
2. A translucent drawing generation method according to claim 1, wherein the drawing processing is performed by cutting off the opaque polygons having a low speed. 7. The translucent drawing generation method according to claim 1, wherein the drawing of the translucent polygon is performed based on opaque polygon data using a Z buffer. 8. A polygon discriminator for discriminating between opaque polygon data and translucent polygon data from polygon data, and a data storage unit for storing the translucent polygon data in a Z-sorting order from the back to the front. An estimated drawing time calculator for calculating an estimated drawing time required to draw one polygon from the translucent polygon data; and an opaque polygon based on the estimated drawing time calculated by the estimated drawing time calculator. a calculation unit of the data and drawing cutting conversion example time for calculating the cut-conversion example time and drawing of the semi-transparent polygon data, the drawing cut conversion e calculated by the time calculation unit the above drawn off
And become Rikae time the opaque polygon data frame
Switch from drawing to memory to drawing of translucent polygon data stored in the data storage unit to frame memory
A translucent drawing generation device, comprising: Arithmetic unit according to claim 9 wherein said drawing expected time, drawing the expected <br/> time Δt _n [S] = [the number of pixels (the area of the polygon)
9. The translucent drawing generation apparatus according to claim 8 , wherein the calculation is performed by [× 1 time required for one pixel] (where n is a variable for counting the number of translucent polygons). 10. The drawing switching time calculation unit calculates a drawing switching time T _n [S] = T _n−1 −Δt _n (where Δ
t _n is the drawing time translucent 1 polygons, n represents translucent drawing generation apparatus according to claim 8, wherein the calculating by which) the variable for counting the number of translucent polygons. 11. The translucent drawing generation apparatus according to claim 8 , wherein the image synthesis unit draws the opaque polygon using a Z buffer. 12. The translucent drawing generation apparatus according to claim 8 , wherein the image synthesizing unit draws the drawing of the translucent polygon in the Z-sorted order. 13. The image synthesizing unit converts the rendering of the translucent polygon into the frame memory from the rendering of the opaque polygon to the rendering of the translucent polygon.
9. The translucent drawing generation apparatus according to claim 8, wherein the drawing processing is performed by cutting out opaque polygons whose input order to the identification unit is slow . 14. The translucent drawing generating apparatus according to claim 8 , wherein the image synthesizing unit draws the opaque polygon based on the opaque polygon data using a Z buffer.