CN105160701A - Triangle intersection detection method applied to remote-operation 3D visual simulation - Google Patents

Triangle intersection detection method applied to remote-operation 3D visual simulation Download PDF

Info

Publication number
CN105160701A
CN105160701A CN201510496876.4A CN201510496876A CN105160701A CN 105160701 A CN105160701 A CN 105160701A CN 201510496876 A CN201510496876 A CN 201510496876A CN 105160701 A CN105160701 A CN 105160701A
Authority
CN
China
Prior art keywords
intersect
triangle
greaterequal
terminate
detect
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.)
Granted
Application number
CN201510496876.4A
Other languages
Chinese (zh)
Other versions
CN105160701B (en
Inventor
黄攀峰
潘吉祥
刘正雄
孟中杰
常海涛
台健生
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Northwestern Polytechnical University
Original Assignee
Northwestern Polytechnical University
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Northwestern Polytechnical University filed Critical Northwestern Polytechnical University
Priority to CN201510496876.4A priority Critical patent/CN105160701B/en
Publication of CN105160701A publication Critical patent/CN105160701A/en
Application granted granted Critical
Publication of CN105160701B publication Critical patent/CN105160701B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Landscapes

  • Processing Or Creating Images (AREA)
  • Control Of Position, Course, Altitude, Or Attitude Of Moving Bodies (AREA)

Abstract

The invention discloses a triangle intersection detection method applied to remote-operation 3D visual simulation. A novel triangle intersection test algorithm is provided for fine bump detection of a 3D figure model. Compared with a traditional triangle intersection test algorithm, the step of exchanging two triangles for repeated calculation is replaced, the calculation result of the same triangle is used repeatedly to reduce the calculation load, and the speed of fine bump detection for the 3D figure model is improved.

Description

A kind of triangle intersect detection method being applied to remote operating three dimensional visual simulation
Technical field
The invention belongs to the three-dimensional artificial display field of virtual reality and Space teleoperation, relate to a kind of figure collision checking method, be specifically related to a kind of triangle intersect detection method being applied to remote operating three dimensional visual simulation.
Background technology
Remote operating plays an important role in Spatial powers combining field, and it is spatial developing tendency that usage space robot completes all kinds of space tasks, and the technology such as obstacle avoidance have epochmaking application prospect.But due to the existence of time delay, the feedback informations such as delayed vision, power feel cannot provide real-time telepresenc for operator, easily mislead the operation behavior of operator, and then affect the Secure execution of remote operating task.
Teleoperation sixty-four dollar question overcomes time delay, the telepresenc of lifting operation person, therefore adopts predictive simulation technology by the forecast model of operand by three dimensional graph display out, operator and forecast model mutual.Owing to not having time delay between operator and Virtual Space robot model, therefore Virtual Space robot model can make an immediate response the input of operator, compensate for the impact of time delay on operator.
But, ensure operator and the mutual real-time of forecast model, depend on the speed that model emulation calculates, and figure prediction part the most consuming time is collision detection, when model needs to carry out meticulous collision detection, collision detection is consuming time longer, and meticulous collision detection requires to carry out test for intersection to every diabolo dough sheet of model.
Summary of the invention
The object of the invention is to solve above-mentioned the problems of the prior art, a kind of triangle intersect detection method being applied to remote operating three dimensional visual simulation is provided.
To achieve these goals, the present invention is achieved by the following technical solutions:
Be applied to a triangle intersect detection method for remote operating three dimensional visual simulation, if two three-dimensional arbitrary triangle Δ P 1p 2p 3with Δ Q 1q 2q 3, its summit P 1, P 2, P 3and Q 1, Q 2, Q 3be sequence counter-clockwise, wherein, triangle Δ P 1p 2p 3the triangle surface of model is grabbed, Δ Q for surrounding hand 1q 2q 3grab the triangle surface of the forecast model of model manipulation object for surrounding hand, concrete detection method comprises the following steps:
Step one: set up coordinates computed system
With Δ P 1p 2p 3summit P 1for initial point, p 1with p 2be respectively two base vectors, set up x *y *plane, wherein p 1=P 2-P 1, p 2=P 3-P 1; p 1, p 2and normal vector p 1× p 2form coordinate system x *y *z *three base vectors, calculate [p 1p 2p 1× p 2] inverse matrix be [p 1p 2p 1× p 2] -1, the triangle surface of traversal forecast model;
Step 2: apex coordinate converts
If Δ Q 1q 2q 3summit Q iat coordinate system x *y *z *under coordinate be Q i *, then:
Q i * = Q ix * Q iy * Q iz * = p 1 p 2 p 1 × p 2 - 1 ( Q i x Q i y Q i z - P 1 )
Wherein 1≤i≤3 represent three summits, Q ix, Q iy, Q izrepresent Q ithree components, represent Q i *three components;
Step 3: judge Δ Q 1q 2q 3with Δ P 1p 2p 3the position relationship of place plane
Judge Q i *z *component , wherein 1≤i≤3:
If three values are 0, then Δ Q 1q 2q 3with Δ P 1p 2p 3coplanar, return the coplanar mark of two triangle, continue the triangle surface of traversal object module, perform step 2;
If three values equal jack per line, then Δ Q 1q 2q 3with Δ P 1p 2p 3non-intersect, return the non-intersect mark of two triangle, continue the triangle surface of traversal object module, perform step 2;
If a value is only had to be 0 and its residual value jack per line, then Δ Q 1q 2q 3with Δ P 1p 2p 3non-intersect, return the non-intersect mark of two triangle, continue the triangle surface of traversal object module, perform step 2;
If two values are had to be 0, then Δ Q 1q 2q 3with Δ P 1p 2p 3non-intersect, return the non-intersect mark of two triangle, continue the triangle surface of traversal object module, perform step 2;
If there are two values contrary sign, then Δ Q 1q 2q 3with Δ P 1p 2p 3place Plane intersects, performs step 4;
Step 4: calculate Δ Q 1q 2q 3with Δ P 1p 2p 3the intersection point of place plane
If symbol be different from with , make original Q 2 *for Q 1 *, Q 3 *for Q 2 *, Q 1 *for Q 3 *;
If symbol be different from with , make original Q 3 *for Q 1 *, Q 1 *for Q 2 *, Q 2 *for Q 3 *;
If Δ Q 1q 2q 3article two, limit and Δ P 1p 2p 3intersection point be , then
I 1 * = x 1 * y 1 * = Q 1 x * Q 1 y * + t 1 Q 2 x * - Q 1 x * Q 2 y * - Q 1 y *
I 2 * = x 2 * y 2 * = Q 1 x * Q 1 y * + t 2 Q 3 x * - Q 1 x * Q 3 y * - Q 1 y *
Wherein t 1 = Q 1 z * Q 1 z * - Q 2 z * , t 2 = Q 1 z * Q 1 z * - Q 3 z * ;
Step 5: intersection section with Δ P 1p 2p 3crossing judgement
Judge coordinate relation:
If x 1 * ≤ 0 , y 1 * ≤ 0 , x 1 * ( y 2 * - 1 ) ≥ x 2 * ( y 1 * - 1 ) , y 1 * ( x 2 * - 1 ) ≥ y 2 * ( x 1 * - 1 ) , x 2 * ≥ 0 , y 2 * ≥ 0 , Then Δ P 1p 2p 3with Δ Q 1q 2q 3intersect, terminate to intersect and detect;
If x 1 * &le; 0 , 0 < y 1 * &le; 1 - x 1 * , x 1 * ( y 2 * - 1 ) &GreaterEqual; x 2 * ( y 1 * - 1 ) , x 1 * y 2 * &le; x 2 * y 1 * , x 2 * &GreaterEqual; 0 , Then Δ P 1p 2p 3with Δ Q 1q 2q 3intersect, terminate to intersect and detect;
If x 1 * &le; 0 , y 1 * > 1 - x 1 * , x 1 * y 2 * &le; x 2 * y 1 * , y 1 * ( x 2 * - 1 ) &le; y 2 * ( x 1 * - 1 ) , x 2 * &GreaterEqual; 0 , y 2 * &le; 1 - x 2 * , Then Δ P 1p 2p 3with Δ Q 1q 2q 3intersect, terminate to intersect and detect;
If x 1 * > 0 , y 1 * &GreaterEqual; 0 , y 1 * &GreaterEqual; 1 - x 1 * , x 1 * ( y 2 * - 1 ) &le; x 2 * ( y 1 * - 1 ) , y 1 * ( x 2 * - 1 ) &le; y 2 * ( x 1 * - 1 ) , y 2 * &le; 1 - x 2 * , Then Δ P 1p 2p 3with Δ Q 1q 2q 3intersect, terminate to intersect and detect;
If x 1 * > 0 , 1 - x 1 * &le; y 1 * < 0 , x 1 * ( y 2 * - 1 ) &le; x 2 * ( y 1 * - 1 ) , x 1 * y 2 * &GreaterEqual; x 2 * y 1 * , y 2 * &le; 1 - x 2 * , Then Δ P 1p 2p 3with Δ Q 1q 2q 3intersect, terminate to intersect and detect;
If x 1 * > 0 , y 1 * < 0 , y 1 * < 1 - x 1 * , x 1 * y 2 * &GreaterEqual; x 2 * y 1 * , y 1 * ( x 2 * - 1 ) &GreaterEqual; y 2 * ( x 1 * - 1 ) , y 2 * &GreaterEqual; 0 , Then Δ P 1p 2p 3with Δ Q 1q 2q 3intersect, terminate to intersect and detect;
If then Δ P 1p 2p 3with Δ Q 1q 2q 3intersect, terminate to intersect and detect;
If all do not meet above seven conditions, then Δ P 1p 2p 3with Δ Q 1q 2q 3non-intersect, return the non-intersect mark of two triangle, continue the triangle surface of traversal object module, perform step 2.
Compared with prior art, the present invention has following beneficial effect:
The generalized case that the present invention is directed to triangle intersect collision detection judges, from calculating the principle that in three dimensions, whether any two triangles intersect, the present invention first calculates the intersection of two triangle place planes, then judges that whether intersection and one of them triangle be crossing and simplify the more complicated judgment criterion of original algorithm.Compare traditional algorithm, there is not the step exchanging two triangle and carry out recalculating in the present invention, thus can save a large amount of evaluation work by reusing same leg-of-mutton result of calculation, improves the speed of the meticulous collision detection of three-dimensional graphical model on the whole.The present invention is directed to singularity, also possessing good solution as collision to contact with triangle but the special circumstances such as not penetrate, is the algorithm of relative maturity in three-dimensional model predictive simulation.
Accompanying drawing explanation
Fig. 1 is that the present invention sets up coordinates computed system schematic diagram;
Fig. 2 is collision detection process flow diagram of the present invention.
Embodiment
Below in conjunction with accompanying drawing, the present invention will be further described in detail.
See Fig. 1 and Fig. 2, present embodiment describes and adopt triangle intersect detection algorithm of the present invention at one in mechanical arm remote operating scene, the triangle surface of traversal paw model, performs following steps.
Step 1: set up coordinates computed system
Note triangle surface is Δ P 1p 2p 3, summit P 1, P 2, P 3for sequence counter-clockwise.Make p 1=P 2-P 1, p 2=P 3-P 1, solve [p 1p 2p 1× p 2] -1.
The triangle surface of traversal object module, performs following steps.
Step 2: apex coordinate converts
Note triangle surface is Δ Q 1q 2q 3, summit Q 1, Q 2, Q 3for sequence counter-clockwise.
Calculate Q i * = Q ix * Q iy * Q iz * = p 1 p 2 p 1 &times; p 2 - 1 ( Q i x Q i y Q i z - P 1 ) , Wherein 1≤i≤3 represent three summits.
Step 3: judge Δ Q 1q 2q 3with Δ P 1p 2p 3the position relationship of place plane
Judge Q i *z *component , wherein 1≤i≤3:
(1) if three values are 0, return the coplanar mark of two triangle, continue the triangle surface of traversal object module, perform step 2;
(2) if three equal jack per lines of value, return the non-intersect mark of two triangle, continue the triangle surface of traversal object module, perform step 2;
(3) if only there is a value to be 0 and its residual value jack per line, return the non-intersect mark of two triangle, continue the triangle surface of traversal object module, perform step 2;
(4) if there are two values to be 0, return the non-intersect mark of two triangle, continue the triangle surface of traversal object module, perform step 2;
(5) if there are two value contrary signs, carry out step 4;
Step 4: calculate Δ Q 1q 2q 3with Δ P 1p 2p 3the intersection point of place plane
(1) if symbol be different from with , make original Q 2 *for Q 1 *, Q 3 *for Q 2 *, Q 1 *for Q 3 *;
(2) if symbol be different from with , make original Q 3 *for Q 1 *, Q 1 *for Q 2 *, Q 2 *for Q 3 *.
Order t 1 = Q 1 z * Q 1 z * - Q 2 z * , t 2 = Q 1 z * Q 1 z * - Q 3 z *
I 1 * = x 1 * y 1 * = Q 1 x * Q 1 y * + t 1 Q 2 x * - Q 1 x * Q 2 y * - Q 1 y *
I 2 * = x 2 * y 2 * = Q 1 x * Q 1 y * + t 2 Q 3 x * - Q 1 x * Q 3 y * - Q 1 y *
Step 5: intersection section with Δ P 1p 2p 3crossing judgement
(1) if x 1 * &le; 0 , y 1 * &le; 0 , x 1 * ( y 2 * - 1 ) &GreaterEqual; x 2 * ( y 1 * - 1 ) , y 1 * ( x 2 * - 1 ) &GreaterEqual; y 2 * ( x 1 * - 1 ) , x 2 * &GreaterEqual; 0 , y 2 * &GreaterEqual; 0 , Then Δ P 1p 2p 3with Δ Q 1q 2q 3intersect, terminate to intersect and detect;
(2) if x 1 * &le; 0 , 0 < y 1 * &le; 1 - x 1 * , x 1 * ( y 2 * - 1 ) &GreaterEqual; x 2 * ( y 1 * - 1 ) , x 1 * y 2 * &le; x 2 * y 1 * , x 2 * &GreaterEqual; 0 , Then Δ P 1p 2p 3with Δ Q 1q 2q 3intersect, terminate to intersect and detect;
(3) if x 1 * &le; 0 , y 1 * > 1 - x 1 * , x 1 * y 2 * &le; x 2 * y 1 * , y 1 * ( x 2 * - 1 ) &le; y 2 * ( x 1 * - 1 ) , x 2 * &GreaterEqual; 0 , y 2 * &le; 1 - x 2 * , Then Δ P 1p 2p 3with Δ Q 1q 2q 3intersect, terminate to intersect and detect;
(4) if x 1 * > 0 , y 1 * &GreaterEqual; 0 , y 1 * &GreaterEqual; 1 - x 1 * , x 1 * ( y 2 * - 1 ) &le; x 2 * ( y 1 * - 1 ) , y 1 * ( x 2 * - 1 ) &le; y 2 * ( x 1 * - 1 ) , y 2 * &le; 1 - x 2 * , Then Δ P 1p 2p 3with Δ Q 1q 2q 3intersect, terminate to intersect and detect;
(5) if x 1 * > 0 , 1 - x 1 * &le; y 1 * < 0 , x 1 * ( y 2 * - 1 ) &le; x 2 * ( y 1 * - 1 ) , x 1 * y 2 * &GreaterEqual; x 2 * y 1 * , y 2 * &le; 1 - x 2 * , Then Δ P 1p 2p 3with Δ Q 1q 2q 3intersect, terminate to intersect and detect;
(6) if x 1 * > 0 , y 1 * < 0 , y 1 * < 1 - x 1 * , x 1 * y 2 * &GreaterEqual; x 2 * y 1 * , y 1 * ( x 2 * - 1 ) &GreaterEqual; y 2 * ( x 1 * - 1 ) , y 2 * &GreaterEqual; 0 , Then Δ P 1p 2p 3with Δ Q 1q 2q 3intersect, terminate to intersect and detect;
(7) if then Δ P 1p 2p 3with Δ Q 1q 2q 3intersect, terminate to intersect and detect;
(8) if all do not meet above seven conditions, then Δ P 1p 2p 3with Δ Q 1q 2q 3non-intersect, return the non-intersect mark of two triangle, continue the triangle surface of traversal object module, perform step 2.
Above content is only and technological thought of the present invention is described; protection scope of the present invention can not be limited with this; every technological thought proposed according to the present invention, any change that technical scheme basis is done, within the protection domain all falling into claims of the present invention.

Claims (1)

1. be applied to a triangle intersect detection method for remote operating three dimensional visual simulation, it is characterized in that, if two three-dimensional arbitrary triangle Δ P 1p 2p 3with Δ Q 1q 2q 3, its summit P 1, P 2, P 3and Q 1, Q 2, Q 3be sequence counter-clockwise, wherein, triangle Δ P 1p 2p 3the triangle surface of model is grabbed, Δ Q for surrounding hand 1q 2q 3grab the triangle surface of the forecast model of model manipulation object for surrounding hand, concrete detection method comprises the following steps:
Step one: set up coordinates computed system
With Δ P 1p 2p 3summit P 1for initial point, p 1with p 2be respectively two base vectors, set up x *y *plane, wherein p 1=P 2-P 1, p 2=P 3-P 1; p 1, p 2and normal vector p 1× p 2form coordinate system x *y *z *three base vectors, calculate [p 1p 2p 1× p 2] inverse matrix be [p 1p 2p 1× p 2] -1, the triangle surface of traversal forecast model;
Step 2: apex coordinate converts
If Δ Q 1q 2q 3summit Q iat coordinate system x *y *z *under coordinate be Q i *, then:
Q i * = Q ix * Q iy * Q iz * = p 1 p 2 p 1 &times; p 2 - 1 ( Q i x Q i y Q i z - P 1 )
Wherein 1≤i≤3 represent three summits, Q ix, Q iy, Q izrepresent Q ithree components, represent Q i *three components;
Step 3: judge Δ Q 1q 2q 3with Δ P 1p 2p 3the position relationship of place plane
Judge Q i *z *component wherein 1≤i≤3:
If three values are 0, then Δ Q 1q 2q 3with Δ P 1p 2p 3coplanar, return the coplanar mark of two triangle, continue the triangle surface of traversal object module, perform step 2;
If three values equal jack per line, then Δ Q 1q 2q 3with Δ P 1p 2p 3non-intersect, return the non-intersect mark of two triangle, continue the triangle surface of traversal object module, perform step 2;
If a value is only had to be 0 and its residual value jack per line, then Δ Q 1q 2q 3with Δ P 1p 2p 3non-intersect, return the non-intersect mark of two triangle, continue the triangle surface of traversal object module, perform step 2;
If two values are had to be 0, then Δ Q 1q 2q 3with Δ P 1p 2p 3non-intersect, return the non-intersect mark of two triangle, continue the triangle surface of traversal object module, perform step 2;
If there are two values contrary sign, then Δ Q 1q 2q 3with Δ P 1p 2p 3place Plane intersects, performs step 4;
Step 4: calculate Δ Q 1q 2q 3with Δ P 1p 2p 3the intersection point of place plane
If symbol be different from with make original Q 2 *for Q 1 *, Q 3 *for Q 2 *, Q 1 *for Q 3 *;
If symbol be different from with make original Q 3 *for Q 1 *, Q 1 *for Q 2 *, Q 2 *for Q 3 *;
If Δ Q 1q 2q 3article two, limit and Δ P 1p 2p 3intersection point be then
I 1 * = x 1 * y 1 * = Q 1 x * Q 1 y * + t 1 Q 2 x * - Q 1 x * Q 2 y * - Q 1 y *
I 2 * = x 2 * y 2 * = Q 1 x * Q 1 y * + t 2 Q 3 x * - Q 1 x * Q 3 y * - Q 1 y *
Wherein t 1 = Q 1 z * Q 1 z * - Q 2 z * , t 2 = Q 1 z * Q 1 z * - Q 3 z * ;
Step 5: intersection section with Δ P 1p 2p 3crossing judgement
Judge coordinate relation:
If x 1 * &le; 0 , y 1 * &le; 0 , x 1 * ( y 2 * - 1 ) &GreaterEqual; x 2 * ( y 1 * - 1 ) , y 1 * ( x 2 * - 1 ) &GreaterEqual; y 2 * ( x 1 * - 1 ) , x 2 * &GreaterEqual; 0 , y 2 * &GreaterEqual; 0 , Then Δ P 1p 2p 3with Δ Q 1q 2q 3intersect, terminate to intersect and detect;
If x 1 * &le; 0 , 0 < y 1 * &le; 1 - x 1 * , x 1 * ( y 2 * - 1 ) &GreaterEqual; x 2 * ( y 1 * - 1 ) , x 1 * y 2 * &le; x 2 * y 1 * , x 2 * &GreaterEqual; 0 , Then Δ P 1p 2p 3with Δ Q 1q 2q 3intersect, terminate to intersect and detect;
If x 1 * &le; 0 , y 1 * > 1 - x 1 * , x 1 * y 2 * &le; x 2 * y 1 * , y 1 * ( x 2 * - 1 ) &le; y 2 * ( x 1 * - 1 ) , x 2 * &GreaterEqual; 0 , y 2 * &le; 1 - x 2 * , Then Δ P 1p 2p 3with Δ Q 1q 2q 3intersect, terminate to intersect and detect;
If x 1 * > 0 , y 1 * &GreaterEqual; 0 , y 1 * &GreaterEqual; 1 - x 1 * , x 1 * ( y 2 * - 1 ) &le; x 2 * ( y 1 * - 1 ) , y 1 * ( x 2 * - 1 ) &le; y 2 * ( x 1 * - 1 ) , y 2 * &le; 1 - x 2 * , Then Δ P 1p 2p 3with Δ Q 1q 2q 3intersect, terminate to intersect and detect;
If x 1 * > 0 , 1 - x 1 * &le; y 1 * < 0 , x 1 * ( y 2 * - 1 ) &le; x 2 * ( y 1 * - 1 ) , x 1 * y 2 * &GreaterEqual; x 2 * y 1 * , y 2 * &le; 1 - x 2 * , Then Δ P 1p 2p 3with Δ Q 1q 2q 3intersect, terminate to intersect and detect;
If x 1 * > 0 , y 1 * < 0 , y 1 * < 1 - x 1 * , x 1 * y 2 * &GreaterEqual; x 2 * y 1 * , y 1 * ( x 2 * - 1 ) &GreaterEqual; y 2 * ( x 1 * - 1 ) , y 2 * &GreaterEqual; 0 , Then Δ P 1p 2p 3with Δ Q 1q 2q 3intersect, terminate to intersect and detect;
If then Δ P 1p 2p 3with Δ Q 1q 2q 3intersect, terminate to intersect and detect;
If all do not meet above seven conditions, then Δ P 1p 2p 3with Δ Q 1q 2q 3non-intersect, return the non-intersect mark of two triangle, continue the triangle surface of traversal object module, perform step 2.
CN201510496876.4A 2015-05-13 2015-08-13 A kind of triangle applied to remote operating three dimensional visual simulation intersects detection method Active CN105160701B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201510496876.4A CN105160701B (en) 2015-05-13 2015-08-13 A kind of triangle applied to remote operating three dimensional visual simulation intersects detection method

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
CN201510243665X 2015-05-13
CN201510243665 2015-05-13
CN201510496876.4A CN105160701B (en) 2015-05-13 2015-08-13 A kind of triangle applied to remote operating three dimensional visual simulation intersects detection method

Publications (2)

Publication Number Publication Date
CN105160701A true CN105160701A (en) 2015-12-16
CN105160701B CN105160701B (en) 2017-12-08

Family

ID=54801543

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201510496876.4A Active CN105160701B (en) 2015-05-13 2015-08-13 A kind of triangle applied to remote operating three dimensional visual simulation intersects detection method

Country Status (1)

Country Link
CN (1) CN105160701B (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106846459A (en) * 2016-12-27 2017-06-13 合肥漫禹科技有限公司 A kind of collision checking method for VR Virtual Campus Systems
CN110955986A (en) * 2019-12-27 2020-04-03 广州机械科学研究院有限公司 Triangular object contact detection method, system, device and storage medium

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101373543A (en) * 2008-09-28 2009-02-25 武汉大学 Method for rapidly cutting three-dimensional gridding model
CN101582173A (en) * 2009-06-24 2009-11-18 中国石油集团川庆钻探工程有限公司 Block model building method for complex geological structure
US20140313194A1 (en) * 2013-04-18 2014-10-23 Carl J. Munkberg Culling for Higher-Order Motion Blur Rasterization

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101373543A (en) * 2008-09-28 2009-02-25 武汉大学 Method for rapidly cutting three-dimensional gridding model
CN101582173A (en) * 2009-06-24 2009-11-18 中国石油集团川庆钻探工程有限公司 Block model building method for complex geological structure
US20140313194A1 (en) * 2013-04-18 2014-10-23 Carl J. Munkberg Culling for Higher-Order Motion Blur Rasterization

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
OREN TROPP, ET AL.: "A fast triangle to triangle intersection test for collision detection", 《COMP. ANIM. VIRTUAL WORLDS》 *
孙殿柱 等: "三角网格曲面模型快速求交算法", 《北京工业大学学报》 *
王红娟 等: "三维复杂地质体的布尔运算算法研究与实现", 《计算机工程》 *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106846459A (en) * 2016-12-27 2017-06-13 合肥漫禹科技有限公司 A kind of collision checking method for VR Virtual Campus Systems
CN110955986A (en) * 2019-12-27 2020-04-03 广州机械科学研究院有限公司 Triangular object contact detection method, system, device and storage medium

Also Published As

Publication number Publication date
CN105160701B (en) 2017-12-08

Similar Documents

Publication Publication Date Title
CN104484522B (en) A kind of construction method of robot simulation&#39;s drilling system based on reality scene
CN109822579A (en) Cooperation robot security&#39;s control method of view-based access control model
US20150165623A1 (en) Method For Programming An Industrial Robot In A Virtual Environment
CN103900510A (en) Detection path modeling method of coordinate measuring machine
CN102663805B (en) Projection-based view frustum cutting method
CN105160701A (en) Triangle intersection detection method applied to remote-operation 3D visual simulation
CN110147649A (en) A kind of analogy method and device of plate process
Lee et al. Block turnover simulation considering the interferences between the block and wire ropes in shipbuilding
CN104143209A (en) Method for engraving three-dimensional model based on line pattern
CN104240290A (en) Three-dimensional cable intersection detecting method based on bounding sphere models
CN105608239A (en) Coordinate measuring machine programming system and method
CN103425806A (en) Three-dimensional programming product simulating system and method
CN102841951B (en) Three-dimensional safety surface sets up system and method
CN112365572B (en) Rendering method based on surface subdivision and related products thereof
CN101635063A (en) Simulation method of free torsion/deformation of elastic cylinder with ellipse section
CN103853914B (en) Method for rapidly estimating scattering sound field of underwater circular corner reflector
CN115481489A (en) System and method for verifying suitability of body-in-white and production line based on augmented reality
He et al. FabricFolding: learning efficient fabric folding without expert demonstrations
CN103761416B (en) Method for rapidly forecasting scattering sound field of underwater triangle corner reflector
Piyavichayanon et al. Collision-aware ar telemanipulation using depth mesh
Ye et al. An improved algorithm for triangle to triangle intersection test
SHARAH et al. Streamlining the Modelling to Virtual Reality Process
CN109977536A (en) Method for situation assessment of the robot in dangerous work environment
CN109829227A (en) A kind of Quick fault-tolerance software systems based on quantity survey
Su et al. Manipulation system design for industrial robot manipulators based on tablet PC

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant