CN1173300C - Method and module for removing 3D image - Google Patents
Method and module for removing 3D image Download PDFInfo
- Publication number
- CN1173300C CN1173300C CNB011099380A CN01109938A CN1173300C CN 1173300 C CN1173300 C CN 1173300C CN B011099380 A CNB011099380 A CN B011099380A CN 01109938 A CN01109938 A CN 01109938A CN 1173300 C CN1173300 C CN 1173300C
- Authority
- CN
- China
- Prior art keywords
- removal
- decision
- aforementioned
- symbolic vector
- remove
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Images
Abstract
The present invention provides a method and a module for removing 3D figures, which is used for effectively generating removal decision signals in terms of back triangles of 3D figures. The removal module comprises a comparison circuit and a removal decision circuit, wherein the comparison circuit compares the coordinates of three vertexes of each triangle and outputs a comparison result to the removal decision circuit, and the removal decision circuit then generates removal decision signals through querying a predetermined querying table on the basis of the comparison result and predetermined coordinate position signals.
Description
Technical field
The invention relates to a kind of removal method and module of the 3D of being applied to graphics system, use comparator circuit and remove removal method and the module that decision-making circuit quickens to remove the decision action about a kind of especially.
Background technology
As shown in Figure 1, have four programs at least in the general 3D graphics system.At first, conversion distributes with light and shade, and (Transform and Lighting, TnL) engine 11 receives a succession of 3D coordinate summit (Coordinate Vertex Stream), and converts a succession of 2D coordinate summit to.Then, after removing module 12 and receiving the input on a succession of 2D coordinate summit, the polygon that elimination can't be seen from a viewpoint.A succession of 2D coordinate summit after setpoint engine 13 is prepared to remove makes and describes engine 14 and be written into the 3D figure.
Eliminate at the removal or the back side is to be a kind of action, and this action is to make comparisons at the orientation of complete polygon and the center of viewpoint or projection, and removes the polygon that those can't be seen.If can't see a polygon from an observer's viewpoint, so just need not describe this polygon.Therefore, reduced being written into of graphics process in fact, got a promotion so this performance of describing engine 14 can be utilized to remove earlier or get rid of for the certain view invisible part of institute because of describing engine 14.
On average, in a polyhedron, the polygon of half back to, that is, can't see.For simplifying operational analysis, use triangle analysis usually.Visual test is directly, and it is to realize in screen area.Generally be to calculate a polygonal outer perpendicular line, and check the symbol of this kind vector in z axle component.Remove test if on a triangle, carry out, then must check leg-of-mutton determinant.Leg-of-mutton determinant is;
Wherein, N is leg-of-mutton determinant; And vertex coordinate be for (x1, y1), (x2, y2) with (x3, y3).
Under most situation, remove test and be in order to calculating leg-of-mutton outer perpendicular line, and the determinant of inspection vertex of a triangle coordinate, to distinguish observable and invisible surface from an observer's viewpoint.Therefore, when the numerical value of determinant N be on the occasion of and the coordinate orientation be for counterclockwise, or when the numerical value of determinant N be that this triangle is visible for negative value and coordinate orientation are when clockwise.Otherwise triangle can't be seen.Therefore, vertex coordinate be for (x1, y1), (x2, y2), with (x3, y3), and the determinant N after computing equals (x1-x3) (y2-y3)-(x2-x3) (y1-y3).So the calculating of this determinant N needs two multiplyings and five subtractions to finish a leg-of-mutton parsing.In order to remove the cost-effectively design of module, be that a kind of removal module that need not use multiplier can be provided ideally.
Summary of the invention
Therefore, the purpose of this invention is to provide a kind of removal method and module of 3D figure, this method and module do not need any multiplication or subtraction can find out the quick and cost-effective removal method and the module of leg-of-mutton determinant.
Purpose of the present invention can reach by following measure:
A kind of removal method of 3D figure comprises following steps:
Relatively X fiducial value and the Y fiducial value on each summit of triangle, i.e. SXij and SYij, with generation to quantity symbol;
Set up the removal decision table according to described leg-of-mutton various described symbolic vector combination;
Remove decision, inquire about aforementioned removal decision table, and produce a removal decision according to an aforementioned group of symbol vectors; And
Whether the state decision according to aforementioned removal decision removes this triangle.
A kind of removal module of 3D figure is whether to remove a triangle in order to decision, and it is characterized in that: this removal decision module comprises:
Comparison means, be respectively comparison of aforementioned leg-of-mutton each to the X value on summit and the size of Y value, and export each fiducial value as symbolic vector; And
Removing determination device, is to remove the decision signal according to aforementioned symbolic vector output one.
The present invention has following advantage compared to existing technology:
Removal method of the present invention comprises following steps.At first, the position according to leg-of-mutton first a summit V1 and the second summit V2 is divided into 9 coordinate grids with screen area.Secondly, utilize and check which coordinate grid this leg-of-mutton the 3rd summit V3 drops on, and carry out this leg-of-mutton quick removal test.Form a vector according to the relative position of the coordinate grid that V1, V2 and V3 were located in, and the removal of correspondence decision is to utilize inquiry to remove decision table and obtain.Remove decision table record symbolic vector, corresponding removal decision, with all possible combination in relevant coordinate orientation.Removing a triangle is to determine and to be determined apace according to the symbolic vector of removing decision table and corresponding removal.
Moreover advantage of the present invention is to use a simple comparator circuit and the removal decision table in order to do removal test for only needing, and this can realize very simply.Because the present invention does not use multiplier, so can further dwindle cost.In addition, because it is very little to remove decision table, so the inquiry velocity of watch is obviously come soon than the computing velocity of existing removal test.
The present invention is described in further detail below in conjunction with drawings and Examples.
Description of drawings
Fig. 1 is for showing a kind of simplification calcspar of existing 3D graphics system.
Fig. 2 is for according to preferred embodiment of the present invention, and it is presented at the synoptic diagram by 9 coordinate grids on the screen area that coordinate defined of leg-of-mutton first a summit V1 and the second summit V2.
Fig. 3 is for showing a kind of simplification calcspar of removing module according to first preferred embodiment of the present invention.
Fig. 4 is the synoptic diagram for the structure that shows comparator circuit as shown in Figure 3.
Fig. 5 is the synoptic diagram for the removal decision-making circuit that shows the use look up table technique of complying with present embodiment of the present invention.
Fig. 6 is the synoptic diagram for the removal decision-making circuit that shows the use combinational logic of complying with present embodiment of the present invention.
Fig. 7 is for according to another preferred embodiment of the present invention, and it is presented at the synoptic diagram of four coordinate grids in the positive center of screen area.
The explanation of symbol
12 ~ removal module
13 ~ setpoint engine
14 ~ describe engine
31 ~ removal module
32 ~ comparator circuit
33 ~ removal decision-making circuit
51 ~ removal decision table
61 ~ removal decision-making circuit
62 ~ decision-making circuit
Embodiment
The invention provides a kind of comparatively faster removal method and module, in order to remove an invisible polygon, triangle particularly.Below, removal method of the present invention is described with reference to the accompanying drawings.
Fig. 3 shows the simplification calcspar of the removal module 31 of preferred embodiment of the present invention.Remove module 31 and comprise a comparator circuit 32 and a removal decision-making circuit 33.Comparator circuit 32 receives the 2D coordinate of the triangular apex on a succession of 2D coordinate summit, and alternatively compares these coordinates, and comparative result is inputed to removal decision-making circuit 33.Removal decision-making circuit 33 is according to the comparative result of comparator circuit 32 and coordinate bearing signal D invisible triangle to be produced a removal decision signal.
Fig. 4 shows a kind of example of comparator circuit 32.With regard to comparator circuit 32, have six inputs and six outputs at least.Six inputs be for leg-of-mutton three summit V1 (x1, y1), V2 (x2, y2), with V3 (x3, the bit stream of y3) coordinate x1, y1, x2, y2, x3 and y3 (bit stream).Six outputs are to be SX12, SY12, SX31, SY31, SX32 and the SY32 of formation symbol (SIGN) vector, and wherein SXij represents the comparative result of xi and xj, and SYij represents the comparative result of yi and yj.If the numerical value of xi is more than or equal to xj, then SXij is configured to 0; Otherwise Sxij is configured to 1, and SYij also is like this.Six comparative results input to together removes decision-making circuit 33.Remove decision-making circuit 33 promptly according to symbolic vector bit stream, coordinate direction signal D, produce a decision signal with built-in removal decision table.Therefore, remove module 31 and can carry out the removal action fast according to the decision signal.
Built-in removal decision table is according to the construction by the coordinate grid of the screen area that the present invention shown in Figure 2 defined.(x1, y1) (x2 y2), is to form a box district on a screen area to the leg-of-mutton first summit V1 with the second summit V2.Each box district is defined as follows:
min(x1，x2) x max(x1，x2)；
min(y1，y2) y max(y1，y2)。
The coordinate grid is fixed on by the dynamic boundary of a piece of land on the screen area of coordinate of the leg-of-mutton first summit V1 shown in Figure 2 and the second summit V2.Most coordinate grids be defined as respectively have upper left district, Zhong Shang district, upper right district, Zuo Zhongqu, positive center, You Zhong district, lower-left district, middle inferior segment, and bottom right district.According to the dextrorotation direction (counterclockwise) of the relative position of V1 and V2, coordinate system or left hand direction (clockwise), with the coordinate grid that V3 is located in, leg-of-mutton removal decision can utilize inquiry in-built meter and decision apace.
Table 1
| Symbolic vector | The zone | Symbolic vector | The zone | Symbolic vector | The zone | Symbolic vector | The zone |
| 000000 | Upper right | 010000 | Upper right | 100000 | Upper right | 110000 | Upper right |
| 000001 | There is not this zone | 010001 | In the right side | 100001 | There is not this zone | 110001 | In the right side |
| 000010 | In the right side | 010010 | There is not this zone | 100010 | In the right side | 110010 | There is not this zone |
| 000011 | The bottom right | 010011 | The bottom right | 100011 | The bottom right | 110011 | The bottom right |
| 000100 | There is not this zone | 010100 | There is not this zone | 100100 | In on | 110101 | In on |
| 000101 | There is not this zone | 010101 | There is not this zone | 100101 | There is not this zone | 110101 | Central authorities |
| 000110 | There is not this zone | 010110 | There is not this zone | 100110 | Central authorities | 110110 | There is not this zone |
| 000111 | There is not this zone | 010111 | There is not this zone | 100111 | In down | 110111 | In down |
| 001000 | In on | 011000 | In on | 101000 | There is not this zone | 111000 | There is not this zone |
| 001001 | There is not this zone | 011001 | There is not this zone | 101001 | There is not this zone | 111001 | There is not this zone |
| 001010 | Central authorities | 011010 | Central authorities | 101010 | There is not this zone | 111010 | There is not this zone |
| 001011 | In down | 011011 | In down | 101011 | There is not this zone | 111011 | There is not this zone |
| 001100 | Upper left | 011100 | Upper left | 101100 | Upper left | 111100 | Upper left |
| 001101 | There is not this zone | 011101 | In the left side | 101101 | There is not this zone | 111101 | In the left side |
| 001110 | In the left side | 011110 | There is not this zone | 101110 | In the left side | 111110 | There is not this zone |
| 001111 | The lower-left | 011111 | The lower-left | 101111 | The lower-left | 111111 | The lower-left |
Table 1 shows a vertex of a triangle district table according to preferred embodiment of the present invention, and this apex region table is in order to displaying symbol vector and relevant range.According to the comparative result of comparator circuit, the position of the 3rd summit V3 can utilize question blank 1 and determine.In the apex region table, have two fields, that is symbolic vector field and regional field.By the symbolic vector field that the bit stream (SX12, SY12, SX31, SX32, SY31, SY32) and the position order of bit stream are formed, be removable.The zone field is represented the coordinate grid zone that summit V3 is located in.We should notice in regional field, have several and " forbid (forbidden) " and indicate that it means that each numerical value in the symbolic vector field is unallowed.
[embodiment 1]
Below will describe in detail according to of the present invention in order to remove first embodiment of 3D figure.Triangle have with V1 (x1, y1), V2 (x2, y2) with V3 (x3, y3) Biao Shi three summits.Six coordinate x1, y1, x2, y2, x3, be input to comparator circuit 32 (with reference to figure 3) with y3.The comparative result of SXij and Syij is to form symbolic vector, and uses and be built in the removal decision table 51 of removing decision-making circuit 33 in inquiring about as index.Removing decision-making circuit 33 also can utilize according to table 2 with table 3 and the combinational logic that forms and realizing.When the direction signal D in six comparative results and coordinate orientation is input to decision-making circuit, can determine one to remove decision fast.Table 2 shows the anticlockwise leg-of-mutton removal decision table according to preferred embodiment of the present invention, table 3 demonstration is according to a clockwise leg-of-mutton removal decision table of preferred embodiment of the present invention, and this table 2 and table 3 show the counterclockwise and clockwise removal decision table with respect to a summit of being scheduled to.Symbolic vector is represented the bit stream of (SX12, SY12, SX31, SX32, SY31 and SY32), represents corresponding removal decision and remove field.The position order of bit stream is for removable.
Table 2
| Symbolic vector | Remove | Symbolic vector | Remove | Symbolic vector | Remove | Symbolic vector | Remove |
| 000000 | 0 | 010000 | 1 | 100000 | 0 | 110000 | 0 |
| 000001 | X | 010001 | 1 | 100001 | X | 110001 | 1 |
| 000010 | 0 | 010010 | X | 100010 | 0 | 110010 | X |
| 000011 | 0 | 010011 | 0 | 100011 | 0 | 110011 | 1 |
| 000100 | X | 010100 | X | 100100 | 0 | 110100 | 0 |
| 000101 | X | 010101 | X | 100101 | X | 110101 | 0 |
| 000110 | X | 010110 | X | 100110 | 0 | 110110 | X |
| 000111 | X | 010111 | X | 100111 | 1 | 110111 | 1 |
| 001000 | 1 | 011000 | 1 | 101000 | X | 111000 | X |
| 001001 | X | 011001 | 0 | 101001 | X | 111001 | X |
| 001010 | 0 | 011010 | X | 101010 | X | 111010 | X |
| 001011 | 0 | 011011 | 0 | 101011 | X | 111011 | X |
| 001100 | 1 | 011100 | 0 | 101100 | 0 | 111100 | 0 |
| 001101 | X | 011101 | 0 | 101101 | X | 111101 | 0 |
| 001110 | 1 | 011110 | X | 101110 | 1 | 111110 | X |
| 001111 | 0 | 011111 | 0 | 101111 | 1 | 111111 | 0 |
Table 3
| Symbolic vector | Remove | Symbolic vector | Remove | Symbolic vector | Remove | Symbolic vector | Remove |
| 000000 | 0 | 010000 | 0 | 100000 | 1 | 110000 | 0 |
| 000001 | X | 010001 | 0 | 100001 | X | 110001 | 0 |
| 000010 | 1 | 010010 | X | 100010 | 1 | 110010 | X |
| 000011 | 1 | 010011 | 0 | 100011 | 0 | 110011 | 0 |
| 000100 | X | 010100 | X | 100100 | 1 | 110100 | 1 |
| 000101 | X | 010101 | X | 100101 | X | 110101 | 0 |
| 000110 | X | 010110 | X | 100110 | 0 | 110110 | X |
| 000111 | X | 010111 | X | 100111 | 0 | 110111 | 0 |
| 001000 | 0 | 011000 | 0 | 101000 | X | 111000 | X |
| 001001 | X | 011001 | 0 | 101001 | X | 111001 | X |
| 001010 | 0 | 011010 | X | 101010 | X | 111010 | X |
| 001011 | 1 | 011011 | 1 | 101011 | X | 111011 | X |
| 001100 | 0 | 011100 | 0 | 101100 | 0 | 111100 | 1 |
| 001101 | X | 011101 | 1 | 101101 | X | 111101 | 1 |
| 001110 | 0 | 011110 | X | 101110 | 0 | 111110 | X |
| 001111 | 0 | 011111 | 1 | 101111 | 0 | 111111 | 0 |
In removing decision table, represent " very " if remove field, so Xiang Guan triangle will be removed.Otherwise, represent " puppet " if remove field, so Xiang Guan triangle will be sent to setpoint engine 13 to make graphics process afterwards.We should notice in table 2 and table 3 " can ignore " information field, and comparative result of its expression symbolic vector is for impossible.
An illustrative removal decision-making circuit 61 is to be depicted among Fig. 6.Combinational logic is to derive according to table 2 and table 3.As shown in Figure 6, this removal decision-making circuit 61 only needs 4 mutual exclusions or lock (XOR gate), 2 anti-mutual exclusions or lock (XNOR gate), 2 and lock (AND gate) and 1 or lock (OR gate).Because this removal decision-making circuit 61 does not need multiplier and totalizer, can export the removal signal fast.
Remove decision-making circuit 61 and have seven inputs and an output, wherein, direction D represents that the direction of coordinate system is counterclockwise or clockwise.If direction is active (active), then coordinate system is to belong to counterclockwise or the dextrorotation direction.If direction is passive (inactive), then coordinate system is to belong to clockwise or left hand direction.
The advantage of first embodiment is for only needing a simple comparator circuit and a removal decision-making circuit to realize removing test.
[embodiment 2]
Below the second embodiment of the present invention will be described.This embodiment adopts one to remove corresponding tables.Symbolic vector is identical with first embodiment with the definition of removing field.On the other hand, utilize a read-only memory (ROM) to replace combinational logic.Triangle be respectively by three summit V1 (x1, y1), V2 (x2, y2), (x3 y3) forms with V3.Decision-making circuit comprises the data that a ROM stores table 4 and table 5, produces one for tabling look-up and removes decision.When six comparative results of comparator circuit and direction signal D sent to decision-making circuit, one removes decision can utilize to table look-up and 4 determined with the relevant removal decision table shown in the table 5.
Table 4
| Symbolic vector | Remove | Symbolic vector | Remove | Symbolic vector | Remove | Symbolic vector | Remove |
| 000000 | 0 | 010000 | 1 | 100000 | 0 | 110000 | 0 |
| 000001 | 0 | 010001 | 1 | 100001 | 0 | 110001 | 1 |
| 000010 | 0 | 010010 | 0 | 100010 | 0 | 110010 | 0 |
| 000011 | 0 | 010011 | 0 | 100011 | 0 | 110011 | 1 |
| 000100 | 0 | 010100 | 0 | 100100 | 0 | 110100 | 0 |
| 000101 | 0 | 010101 | 0 | 100101 | 0 | 110101 | 0 |
| 000110 | 0 | 010110 | 0 | 100110 | 0 | 110110 | 0 |
| 000111 | 0 | 010111 | 0 | 100111 | 1 | 110111 | 1 |
| 001000 | 1 | 011000 | 1 | 101000 | 0 | 111000 | 0 |
| 001001 | 0 | 011001 | 0 | 101001 | 0 | 111001 | 0 |
| 001010 | 0 | 011010 | 0 | 101010 | 0 | 111010 | 0 |
| 001011 | 0 | 011011 | 0 | 101011 | 0 | 111011 | 0 |
| 001100 | 1 | 011100 | 0 | 101100 | 0 | 111100 | 0 |
| 001101 | 0 | 011101 | 0 | 101101 | 0 | 111101 | 0 |
| 001110 | 1 | 011110 | 0 | 101110 | 1 | 111110 | 0 |
| 001111 | 0 | 011111 | 0 | 101111 | 1 | 111111 | 0 |
Table 5
| Symbolic vector | Remove | Symbolic vector | Remove | Symbolic vector | Remove | Symbolic vector | Remove |
| 000000 | 0 | 010000 | 0 | 100000 | 1 | 110000 | 0 |
| 000001 | 0 | 010001 | 0 | 100001 | 0 | 110001 | 0 |
| 000010 | 1 | 010010 | 0 | 100010 | 1 | 110010 | 0 |
| 000011 | 1 | 010011 | 0 | 100011 | 0 | 110011 | 0 |
| 000100 | 0 | 010100 | 0 | 100100 | 1 | 110100 | 1 |
| 000101 | 0 | 010101 | 0 | 100101 | 0 | 110101 | 0 |
| 000110 | 0 | 010110 | 0 | 100110 | 0 | 110110 | 0 |
| 000111 | 0 | 010111 | 0 | 100111 | 0 | 110111 | 0 |
| 001000 | 0 | 011000 | 0 | 101000 | 0 | 111000 | 0 |
| 001001 | 0 | 011001 | 0 | 101001 | 0 | 111001 | 0 |
| 001010 | 0 | 011010 | 0 | 101010 | 0 | 111010 | 0 |
| 001011 | 1 | 011011 | 1 | 101011 | 0 | 111011 | 0 |
| 001100 | 0 | 011100 | 0 | 101100 | 0 | 111100 | 1 |
| 001101 | 0 | 011101 | 1 | 101101 | 0 | 111101 | 1 |
| 001110 | 0 | 011110 | 0 | 101110 | 0 | 111110 | 0 |
| 001111 | 0 | 011111 | 1 | 101111 | 0 | 111111 | 0 |
Table 4 shows the removal decision table according to an anticlockwise leg-of-mutton strictness of preferred embodiment of the present invention, table 5 shows the removal decision table according to a clockwise leg-of-mutton strictness of preferred embodiment of the present invention, table 4 is to be symbolic vector with 5 input information field, wherein symbolic vector is to be a bit stream (SX12, SY12,5X31, SX32, SY31, SY32), and the order of bit stream is for removable.Table 4 is to be to remove field with 5 output information field, is whether the corresponding triangle of expression need be removed.Represent " very " if remove field, triangle should be removed so.Otherwise, represent " puppet " if remove field, triangle is to be sent to setpoint engine to make graphics process afterwards so.
Fig. 5 shows the calcspar of the removal decision-making circuit that uses look up table technique.Remove decision-making circuit 33 and comprise a read-only memory (ROM) 51 of removing decision table in order to store.Seven inputs of removing decision-making circuit 33 comprise six comparative results from comparator circuit.Another input of removing decision-making circuit 33 is for representing that coordinate system is to be counterclockwise or clockwise direction D.If direction is for active, then coordinate system is to be counterclockwise or dextrorotation direction.If direction is for passive, then coordinate system is to be clockwise or left hand direction.
The advantage of second embodiment is its needs one simple comparator circuit and removes a ROM of decision table in order to storage.
[embodiment 3]
Based on second embodiment, the positive center of screen area can further be divided into four coordinate grids as shown in Figure 7.In Fig. 7, the mid point of V1 and V2 is to be V4, and V4 is divided into four coordinate grids respectively with V1 and the formed box of V2 district, that is I, II, III and IV.When V3 fell within the positive center, a kind of accurate removal test was to utilize further relatively the position of V3 and V4 and carry out.Table 6 shows the removal decision truth table according to preferred embodiment of the present invention.
Table 6
| Symbolic vector | Remove | Symbolic vector | Remove |
| 1001000 xx | 1 | 0011101 xx | 1 |
| 1001100 xx | 1 | 0011111 xx | 1 |
| 1001110 xx | 1 | 0100000 xx | 1 |
| 1010000 xx | 1 | 0100010 xx | 1 |
| 1010001 xx | 1 | 0100100 xx | 1 |
| 1011000 xx | 1 | 0110100 xx | 1 |
| 1100111 xx | 1 | 0111100 xx | 1 |
| 1101110 xx | 1 | 0111101 xx | 1 |
| 1101111 xx | 1 | 111010101 | 1 |
| 1110001 xx | 1 | 011010110 | 1 |
| 1110011 xx | 1 | 100101010 | 1 |
| 1110111 xx | 1 | 000101001 | 1 |
| 0000010 xx | 1 | 110011000 | 1 |
| 0000011 xx | 1 | 010011011 | 1 |
| 0001011 xx | 1 | 101100111 | 1 |
| 0011011 xx | 1 | 001100100 | 1 |
Because increased by two extra comparison positions, thus the input information field of symbolic vector bit stream become (D, SX12, SY12, SX31, SX32, SY31, SY32, SY34, SY34).D represents that coordinate system is to belong to counterclockwise or clockwise direction.Other structure is identical with first and second embodiment with processing.
The specific embodiment that is proposed in the detailed description of preferred embodiment is only in order to convenient explanation technology contents of the present invention, but not with narrow sense of the present invention be limited to the foregoing description, in the situation that does not exceed spirit of the present invention and claim scope, the many variations of being done is implemented, and all belongs to scope of the present invention.
Claims (8)
1. the removal method of a 3D figure is characterized in that: comprise following steps:
Relatively X fiducial value and the Y fiducial value on each summit of triangle, i.e. SXij and SYij are with the generation symbolic vector;
Set up the removal decision table according to described leg-of-mutton various described symbolic vector combination;
Remove decision, inquire about aforementioned removal decision table, and produce a removal decision according to an aforementioned group of symbol vectors; And
Whether the state decision according to aforementioned removal decision removes this triangle.
2. the removal method of 3D figure as claimed in claim 1 is characterized in that: this step that decision table is removed in wherein aforementioned foundation comprises following steps:
Relatively this leg-of-mutton each to vertex position to obtain a symbolic vector;
Utilize visual determinant, determine the state of the removal decision of various symbolic vector combinations; And
The state that writes down various symbolic vectors and relevant removal decision is to form this removal decision table.
3. the removal method of 3D figure as claimed in claim 1 is characterized in that: wherein aforementioned symbolic vector is to be the X fiducial value on each summit of comparison of aforementioned triangle and Y fiducial value, i.e. SXij and SYij.
4. the removal method of 3D figure as claimed in claim 3 is characterized in that: wherein aforementioned leg-of-mutton positive center further is divided into four coordinate grids.
5. the removal method of 3D figure as claimed in claim 4 is characterized in that: also comprise following steps:
According to the comparative result that position and the mid point between one first summit and one second summit of one the 3rd summit V3 are made comparisons, for this symbolic vector obtains two extra positions;
Utilization is added into this symbolic vector with these two extra positions, produces a new symbolic vector; And
For producing one second, each new symbolic vector removes decision.
6. the removal module of a 3D figure is whether to remove a triangle in order to decision, and it is characterized in that: this removal decision module comprises:
Comparison means, be respectively comparison of aforementioned leg-of-mutton each to the X value on summit and the size of Y value, and export each fiducial value as symbolic vector; And
Removing determination device, is to remove the decision signal according to aforementioned symbolic vector output one.
7. the removal module of 3D figure as claimed in claim 6 is characterized in that: wherein aforementioned comparison means is to utilize most comparers to realize.
8. the removal module of 3D figure as claimed in claim 6 is characterized in that: wherein aforementioned removal determination device is to utilize aforementioned symbolic vector to remove corresponding tables for index inquiry one, and the value that output is inquired about is as aforementioned removal decision signal.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB011099380A CN1173300C (en) | 2001-03-26 | 2001-03-26 | Method and module for removing 3D image |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB011099380A CN1173300C (en) | 2001-03-26 | 2001-03-26 | Method and module for removing 3D image |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1377013A CN1377013A (en) | 2002-10-30 |
| CN1173300C true CN1173300C (en) | 2004-10-27 |
Family
ID=4658232
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB011099380A Expired - Fee Related CN1173300C (en) | 2001-03-26 | 2001-03-26 | Method and module for removing 3D image |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN1173300C (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102369557B (en) * | 2009-06-17 | 2014-05-14 | 松下电器产业株式会社 | Image generation device, image generation method, and integrated circuit |
-
2001
- 2001-03-26 CN CNB011099380A patent/CN1173300C/en not_active Expired - Fee Related
Also Published As
| Publication number | Publication date |
|---|---|
| CN1377013A (en) | 2002-10-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10970518B1 (en) | Voxel-based feature learning network | |
| CN105993034B (en) | Contour completion for enhanced surface reconstruction | |
| Pauwels et al. | A comparison of FPGA and GPU for real-time phase-based optical flow, stereo, and local image features | |
| US11430134B2 (en) | Hardware-based optical flow acceleration | |
| Liang et al. | Rangeioudet: Range image based real-time 3d object detector optimized by intersection over union | |
| CN102568009B (en) | Line segment reducing device and method for electronic map | |
| CN110570429B (en) | Lightweight real-time semantic segmentation method based on three-dimensional point cloud | |
| US11062471B1 (en) | Neural network system for stereo image matching | |
| Cambuim et al. | An FPGA-based real-time occlusion robust stereo vision system using semi-global matching | |
| CN1648935A (en) | Three dimension face identifying method based on polar spectrum image | |
| CN112949633B (en) | Improved YOLOv 3-based infrared target detection method | |
| CN102799657B (en) | System and method for realizing real-time data point mapping processing based on three-dimensional checking | |
| CN111814827A (en) | Key point target detection method based on YOLO | |
| WO2019194255A1 (en) | Arithmetic processing device, object identification system, object identification method, automobile, and vehicular lighting fixture | |
| CN115179326A (en) | Continuous collision detection method for articulated robot | |
| CN1173300C (en) | Method and module for removing 3D image | |
| Cunha et al. | Hardware-accelerated data decoding and reconstruction for automotive LiDAR sensors | |
| Ren et al. | Lightweight semantic-aided localization with spinning LiDAR sensor | |
| CN101937577A (en) | Method capable of generating shadow with boundary pixel oversampling effect | |
| US8022949B2 (en) | System and method for generating curvature adapted isosurface based on delaunay triangulation | |
| CN1949272A (en) | Method of complex situation quick drawing based on vision field rejecting and image buffer storage tech. | |
| US20230297466A1 (en) | Hardware-efficient pam-3 encoder and decoder | |
| TWI731604B (en) | Three-dimensional point cloud data processing method | |
| CN100476880C (en) | Method and system for producing volume shade | |
| Tian et al. | Jyolo: Joint point cloud for autonomous driving 3d object detection |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| C17 | Cessation of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20041027 |