CN115908542B - BIM-based rapid calculation method for inter-polyhedron distance - Google Patents
BIM-based rapid calculation method for inter-polyhedron distance Download PDFInfo
- Publication number
- CN115908542B CN115908542B CN202211342271.6A CN202211342271A CN115908542B CN 115908542 B CN115908542 B CN 115908542B CN 202211342271 A CN202211342271 A CN 202211342271A CN 115908542 B CN115908542 B CN 115908542B
- Authority
- CN
- China
- Prior art keywords
- model
- sub
- distance
- triangular
- bounding box
- 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.)
- Active
Links
Landscapes
- Processing Or Creating Images (AREA)
Abstract
The invention discloses a method for rapidly calculating the distance between polyhedrons based on BIM, which comprises the following steps: dividing the bounding boxes of the model A and the model B for n times respectively to obtain a plurality of sub bounding boxes A and a plurality of sub bounding boxes B; traversing triangular patches of the model A and the model B, and deleting sub bounding boxes which do not contain the triangular patches; traversing the pairing of the remaining sub bounding boxes A and the remaining sub bounding boxes B to form a plurality of sub bounding box pairs; calculating the distance from the center of the sub bounding box A to the center of the sub bounding box B in each sub bounding box; obtaining a group minimum distance; comparing the minimum distances to obtain the minimum distance of the model. The method has the beneficial effects of rapidly calculating the distance between polyhedrons based on the BIM model and being used for carrying out physical collision (hard collision) detection and regular collision (soft collision) detection.
Description
Technical Field
The present invention relates to the field of collision detection. More particularly, the invention relates to a BIM-based method for rapidly calculating the distance between polyhedrons.
Background
Building information models (also known as building information modeling, BIM for short) are building or construction information models that are composed of sufficient information to support new product development management and can be directly interpreted by computer applications. Physical collision (hard collision) detection and regular collision (soft collision) detection are needed in the virtual construction process by using the BIM model, wherein the hard collision is cross collision between entities, the soft collision is that no collision exists actually, but the distance and the space cannot meet relevant construction requirements (installation, maintenance and the like), the soft collision also comprises time-based collision requirements, and the collision possibly occurs in the dynamic construction process, such as running of vehicles in field cloth, operation of construction machinery such as tower cranes and the like.
For physical collision (hard collision) detection and regular collision (soft collision) detection, the distance between two polyhedrons needs to be calculated, and at present, the main calculation method comprises a path tracking collision detection algorithm (LC (Lin and Canny algorithm) algorithm, GJK (Gilbert, john-son and Keerthi) algorithm), chen Liang, huang Wenji, song Enmin, and summary algorithm disclosed in higher school computational math report, 4 (1994.12); because of the huge number of polygons or triangles of the BIM model monomer polyhedron, the algorithm has the following problems:
(1) The calculation time is long, for example: the path tracking correlation algorithm is used, so that a large amount of preprocessing is needed, and the calculation time of the adjacent relation between triangles, the calculation of convex hulls and the like is long;
(2) Typically, convex and non-convex are not substantially treated, whereas BIM models contain both convex and concave.
Therefore, providing a fast inter-polyhedral distance algorithm based on a BIM model for physical collision (hard collision) detection and regular collision (soft collision) detection is a problem which needs to be solved rapidly at present.
Disclosure of Invention
It is an object of the present invention to solve at least the above problems and to provide at least the advantages to be described later.
It is still another object of the present invention to provide a method for rapidly calculating a distance between polyhedrons based on a BIM model for performing physical collision (hard collision) detection and regular collision (soft collision) detection.
To achieve these objects and other advantages and in accordance with the purpose of the invention, a method for rapidly calculating distances between polyhedra based on BIM, comprising the steps of:
dividing the bounding boxes of the model A and the model B for n times respectively to obtain a plurality of sub bounding boxes A corresponding to the model A and a plurality of sub bounding boxes B corresponding to the model B, wherein n is more than or equal to 1;
traversing the triangular patch A of the model A, calculating and confirming a sub bounding box A where three vertexes of the triangular patch A are located, deleting the sub bounding box A which does not contain the triangular patch A, and remaining u sub bounding boxes A;
traversing the triangular patch B of the model B, calculating and confirming a sub bounding box B where three vertexes of the triangular patch B are located, deleting the sub bounding box B which does not contain the triangular patch B, and remaining v sub bounding boxes B;
traversing the u sub bounding boxes A and v sub bounding boxes B, and pairing any sub bounding box A and sub bounding box B to form u x v sub bounding box pairs (sub bounding box A and sub bounding box B);
calculating the distance from the center of the sub bounding box A to the center of the sub bounding box B in each sub bounding box;
if the model A and the model B are both convex polyhedrons, a group of sub bounding box pairs with the smallest distance are obtained;
if at least one of the model A and the model B is a non-convex polyhedron, taking out at least 4 sub bounding box pairs according to the distance from small to large;
traversing the triangular patches A and B contained in the sub bounding box A and the triangular patches B contained in the sub bounding box B for each group of sub bounding box pairs, and calculating the distance between the triangular patches A and the triangular patches B to obtain a group minimum distance;
when the child bounding box pair with the minimum distance is a group, the group minimum distance is the minimum distance between the model A and the model B;
when the sub bounding box pair with the minimum distance is at least 4 groups, comparing the group minimum distances to obtain a model minimum distance, wherein the model minimum distance is the minimum distance between the model A and the model B.
Preferably, the bounding boxes of model a and model B are both bounding boxes AABB along the coordinate axes.
Preferably, the value of n is determined according to the number of triangular patches contained in the model a and the model B, and specifically, when the number of triangular patches is 1-1000, n=1; when the number of triangular patches is 1000-10000, n=2; when the number of triangular patches is 10000 to 100000, n=3.
Preferably, the minimum distance calculation method between triangular patches is as follows:
and calculating the minimum distance between each side of the triangular surface patch A and each side of the triangular surface patch B, and then obtaining two sides with the minimum distance, wherein the distance between the two sides is the minimum distance between the triangular surface patches.
Preferably, the method for calculating the minimum distance between triangular patches further comprises:
for a pair of triangular patches with the minimum distance between triangular patches, projecting one triangular patch point onto the other triangular patch, and calculating the distance of the projection point in the range of the other triangular patch to obtain the minimum projection distance;
and taking the minimum value of the minimum edge distance and the minimum projection distance as the minimum distance between the model A and the model B.
Preferably, the bounding boxes of the model a and the model B are divided n times by a spatial octant method.
The invention at least comprises the following beneficial effects:
the normal calculation of the distance between triangular patches needs to traverse all triangular patches A and B between the model A and calculate the minimum distance, and when the triangular patches are tens of thousands, the calculation time of the distance is very long;
according to the method, a space octant method is used for carrying out space division on the bounding boxes, the minimum distance between the sub bounding boxes is calculated to obtain the sub bounding boxes with the minimum distance, and then the minimum distance of triangular patches corresponding to the sub bounding boxes is calculated, wherein the number of the triangular patches of the sub bounding boxes is far less than that of the triangular patches corresponding to the bounding boxes, so that the calculating speed can be greatly improved;
multiple steps in the algorithm can be performed in parallel in multiple threads, a large amount of calculation time can be compressed, and sub bounding box calculation of A and B can be completed in different threads, so that the algorithm is very suitable for a computer environment capable of being processed in parallel.
Additional advantages, objects, and features of the invention will be set forth in part in the description which follows and in part will become apparent to those having ordinary skill in the art upon examination of the following or may be learned from practice of the invention.
Drawings
Fig. 1 is a schematic diagram of a main pump house pipe a and a main pump house pipe B according to an embodiment of the present invention;
fig. 2 is a schematic view of the basic wall a and the basic wall B according to an embodiment of the present invention;
FIG. 3 is a schematic view of the base wall and the roof according to one embodiment of the present invention;
fig. 4 is a schematic view of the tank a and the tank B according to an embodiment of the present invention.
Detailed Description
The present invention is described in further detail below with reference to examples to enable those skilled in the art to practice the same by referring to the description.
Example 1 ]
Application scenario 1: as shown in fig. 1, in the BIM, the model a is a main pump room pipe a, about 360 triangular patches, the model B is a main pump room pipe B, about 360 triangular patches, and both the model a and the model B are convex polyhedrons.
The method for rapidly calculating the distance between polyhedrons based on BIM comprises the following steps:
s1, calculating a bounding box BB_A of a model A and a bounding box BB_B of a model B, wherein the bounding box BB_A and the bounding box BB_B are bounding boxes AABB along coordinate axes;
s2, dividing the bounding box BB_A for n times according to a space octant method to obtain 8 n The Sub bounding box Sub _ BB _ a, wherein,n.gtoreq.1, in particular, dynamic adjustment of 1 to n is performed according to the order of magnitude of the triangular patches included in model a, for example 1 to 1000 is 1, 1000 to 10000 is 2, 10000 to 100000 is 3, in this embodiment n=3, in this embodiment n=1;
s3, carrying out the same division operation on the bounding box BB_B according to the step S2 to form a plurality of Sub bounding boxes Sub_BB_B, specifically, dividing the bounding box BB_B for 1 time according to a space octant method to obtain 8 Sub bounding boxes Sub_BB_B;
s4, the model A comprises a plurality of triangular patches A, all the triangular patches A are traversed, sub bounding boxes Sub BB_A where three vertexes T_A_i of the triangular patches A are located are respectively calculated, and Sub bounding boxes Sub BB_A corresponding to each triangular patch A are determined;
deleting the Sub bounding boxes sub_bb_a which do not contain the triangular patch a, and the remaining u Sub bounding boxes sub_bb_a, wherein the number of the deleted Sub bounding boxes sub_bb_a is (8-u);
s5, the model B comprises a plurality of triangular patches B, and the same operation as the step (4) is carried out on the triangular patches B, specifically: traversing all triangular patches B, respectively calculating Sub bounding boxes Sub_BB_B where three vertexes T_B_i of the triangular patches B are located for each triangular patch B, and determining Sub bounding boxes Sub_BB_B corresponding to each triangular patch B;
deleting the Sub bounding boxes sub_bb_b which do not contain the triangular patches B, and the remaining v Sub bounding boxes sub_bb_b, wherein the number of deleted Sub bounding boxes sub_bb_b is (8-v);
s6, traversing u Sub bounding boxes Sub_BB_A and v Sub bounding boxes Sub_BB_B, pairing any two Sub bounding boxes Sub_BB_ A, sub _BB_B to form u x v Sub bounding box pairs (Sub_BB_ A, sub _BB_B), and calculating a distance_sub_bb from the center of the Sub bounding box Sub_BB_A to the center of the Sub bounding box Sub_BB_B in each Sub bounding box pair;
s7, obtaining a child bounding box pair with the minimum distance_sub_bb, and defining the child bounding box pair as (sub_BB_A_min, sub_BB_B_min);
s8, traversing triangular patches A and B contained in Sub-BB_A_min and triangular patches A and B contained in Sub-BB_B_min for the group of Sub-bounding box pairs, forming triangular patch pairs (A_min and B_min) by any two triangular patches A and B, and calculating the distance between any triangular patch pairs to obtain a group minimum distance, wherein the distance is the minimum distance between a model A and a model B;
the minimum distance calculation method between the triangular patches comprises the following steps: and calculating the minimum distance between each side of the triangular surface patch A and each side of the triangular surface patch B, and then obtaining two sides with the minimum distance, wherein the distance between the two sides is the minimum distance between the triangular surface patches.
The results are shown in FIG. 1: the minimum distance between model a and model B was 7.180m.
Example 2 ]
Application scenario 2: as shown in FIG. 2, model A in BIM is a basic wall A, about 120 triangular patches, model B is a basic wall B, about 90 triangular patches, and both model A and model B are convex polyhedrons.
The method for rapidly calculating the distance between polyhedrons based on BIM comprises the following steps:
S1-S7 are as in example 1;
s8 is the same as in example 1, except that the minimum distance calculation method between triangular patches is as follows:
calculating the minimum distance between each side of the triangular surface patch A and the triangular surface patch B, and then obtaining the distance between the two sides with the minimum distance, wherein the distance is defined as the minimum side distance;
projecting one triangular patch point onto another triangular patch, and calculating the distance of the projection point in the range of the other triangular patch to obtain the minimum projection distance;
and taking the minimum value of the minimum edge distance and the minimum projection distance as the minimum distance between the model A and the model B.
The results are shown in FIG. 2: the minimum distance between model a and model B was 3.068m.
Example 3 ]
Application scenario 3: BIM model A is a basic wall, about 120 triangular panels, model B is a roof, about 600 triangular panels, model A is a convex polyhedron, model B is a non-convex polyhedron.
The method for rapidly calculating the distance between polyhedrons based on BIM comprises the following steps:
S1-S6 are as in example 1;
s7, taking out at least 4 groups of Sub bounding box pairs according to the distance from small to large, wherein the Sub bounding box pairs are defined as (sub_BB_A_min and sub_BB_B_min);
s8, traversing triangular patches A contained in Sub-BB_A_min and triangular patches B contained in Sub-BB_B_min for each group of Sub-bounding box pairs, calculating the distance between the triangular patches A and the triangular patches B, and obtaining a group minimum distance;
comparing the minimum distance of the groups, taking the minimum value as the minimum distance of the models, wherein the minimum distance is the minimum distance between the model A and the model B, and the minimum distance is the minimum distance between the model A and the model B, wherein:
the minimum distance calculation method between the triangular patches comprises the following steps: and calculating the minimum distance between each side of the triangular surface patch A and each side of the triangular surface patch B, and then obtaining two sides with the minimum distance, wherein the distance between the two sides is the minimum distance between the triangular surface patches.
The results are shown in FIG. 3: the minimum distance between model a and model B was 4.981m.
Example 4 ]
Application scene: as shown in fig. 4, the model a in BIM is defined as a tank, and the model B is also defined as a tank B, and the specific situation is as shown in table 1 below:
table 1 shows characteristic data of both model A and model B of the oil tank
The method for rapidly calculating the distance between polyhedrons based on BIM comprises the following steps:
the method for rapidly calculating the distance between polyhedrons based on BIM comprises the following steps:
s1, calculating bounding box BB_A of model A and bounding box BB_B of model B, wherein bounding box BB_A and bounding box BB_B are bounding boxes AABB along coordinate axes, and specifically shown in the following table 2:
TABLE 2
S2, dividing the bounding box BB_A for 2 times according to a space octant method to obtain 8 2 Sub bounding box sub_bb_a;
s3, carrying out the same division operation on the bounding box BB_B according to the step S2 to form a plurality of Sub bounding boxes sub_BB_B, specifically, dividing the bounding box BB_B for 2 times according to a space octant method to obtain 8 2 Sub bounding box sub_bb_b; the dividing of the steps S2 and S3 specifically includes:
i, first partitioning, results are shown in Table 3 below:
TABLE 3 Table 3
Ii, second division, partial results are shown in table 4 below:
TABLE 4 Table 4
S4, the model A comprises a plurality of triangular patches A, all the triangular patches A are traversed, sub bounding boxes Sub BB_A where three vertexes T_A_i of the triangular patches A are located are respectively calculated, and Sub bounding boxes Sub BB_A corresponding to each triangular patch A are determined;
specifically, the number of triangular patches contained in the 1-64 # sub bounding box in model A is shown in Table 5 below:
TABLE 5
Deleting the Sub bounding box sub_bb_a that does not contain the triangular patch a, and remaining u=14 Sub bounding boxes sub_bb_a, the number of deleted Sub bounding boxes sub_bb_a is (8) 2 -u)；
S5, the model B comprises a plurality of triangular patches B, and the same operation as the step (4) is carried out on the triangular patches B, specifically: traversing all triangular patches B, respectively calculating Sub bounding boxes Sub_BB_B where three vertexes T_B_i of the triangular patches B are located for each triangular patch B, and determining Sub bounding boxes Sub_BB_B corresponding to each triangular patch B;
specifically, the number of triangular patches contained in the 1-64 sub bounding box in model B is shown in table 6 below:
TABLE 6
Deleting the Sub bounding box sub_bb_b not containing the triangular patch B, and the remaining v=14 Sub bounding boxes sub_bb_b, the number of deleted Sub bounding boxes sub_bb_b is (8) 2 -v)；
S6. traversing 14 Sub bounding boxes sub_bb_a and 14 Sub bounding boxes sub_bb_b, pairing any two Sub bounding boxes sub_bb_ A, sub _bb_b to form 14×14=196 Sub bounding box pairs (sub_bb_ A, sub _bb_b), and calculating a distance_sub_bb from the center of Sub bounding box sub_bb_a to the center of Sub bounding box sub_bb_b in each Sub bounding box pair;
s7, taking out 4 groups of Sub bounding box pairs according to the distance from small to large, wherein the Sub bounding box pairs are defined as (sub_BB_A_min and sub_BB_B_min), and the following table 7 is shown as follows:
TABLE 7
S8, traversing triangular patches A contained in Sub-BB_A_min and triangular patches B contained in Sub-BB_B_min for each group of Sub-bounding box pairs, calculating the distance between the triangular patches A and the triangular patches B, and obtaining a group minimum distance;
comparing the minimum distance of the group, taking the minimum value as the minimum distance of the model, wherein the minimum distance is the minimum distance between the model A and the model B, and is 0.968 m and 10s in time, and the method comprises the following steps:
the minimum distance calculation method between the triangular patches comprises the following steps: and calculating the minimum distance between each side of the triangular surface patch A and each side of the triangular surface patch B, and then obtaining two sides with the minimum distance, wherein the distance between the two sides is the minimum distance between the triangular surface patches.
Comparative example 1 ]
Application scene: oil tank a and oil tank B of example 4 were identical.
Using a conventional algorithm, the distance between tank a and tank B is calculated, comprising the steps of:
1) Traversing the triangle of the model A (oil tank A) and the triangle of the model B (oil tank B), and calculating the distance between every two triangles, wherein the number of the triangle of the model A is as follows: 39020, the number of model B triangles is: 39020, the number of triangles that need to be calculated is: 39020 × 39020 = 1522560400 times;
2) The shortest distance of the two triangles is calculated as follows: 0.968 m
The time used is: 600 seconds.
Although embodiments of the present invention have been disclosed above, it is not limited to the details and embodiments shown and described, it is well within the ability of one skilled in the art to adapt the present invention to various modifications and other changes may be readily made therein without departing from the general concept defined by the appended claims and their equivalents.
Claims (5)
1. The method for rapidly calculating the distance between polyhedrons based on BIM is characterized by comprising the following steps of:
dividing bounding boxes of a model A and a model B for n times respectively to obtain a plurality of sub bounding boxes A corresponding to the model A and a plurality of sub bounding boxes B corresponding to the model B, wherein n is more than or equal to 1, and dividing the bounding boxes of the model A and the model B for n times respectively according to a space octant method;
traversing the triangular patch A of the model A, calculating and confirming a sub bounding box A where three vertexes of the triangular patch A are located, deleting the sub bounding box A which does not contain the triangular patch A, and remaining u sub bounding boxes A;
traversing the triangular patch B of the model B, calculating and confirming a sub bounding box B where three vertexes of the triangular patch B are located, deleting the sub bounding box B which does not contain the triangular patch B, and remaining v sub bounding boxes B;
traversing the u sub bounding boxes A and the v sub bounding boxes B, and pairing any sub bounding box A and sub bounding box B to form u x v sub bounding box pairs;
calculating the distance from the center of the sub bounding box A to the center of the sub bounding box B in each sub bounding box pair, wherein if the model A and the model B are both convex polyhedrons, a group of sub bounding box pairs with the minimum distance are obtained; if at least one of the model A and the model B is a non-convex polyhedron, taking out at least 4 sub bounding box pairs according to the distance from small to large;
traversing the triangular patches A and B contained in the sub bounding box A and the triangular patches B contained in the sub bounding box B for each group of sub bounding box pairs, and calculating the distance between the triangular patches A and the triangular patches B to obtain a group minimum distance;
when the child bounding box pair with the minimum distance is a group, the group minimum distance is the minimum distance between the model A and the model B;
when the sub bounding box pair with the minimum distance is at least 4 groups, comparing the group minimum distances to obtain a model minimum distance, wherein the model minimum distance is the minimum distance between the model A and the model B.
2. The BIM-based inter-polyhedral distance fast calculating method according to claim 1, wherein the bounding boxes of model a and model B are bounding boxes AABB along the coordinate axes.
3. The method for quickly calculating the distance between polyhedrons based on BIM according to claim 1, wherein the value of n is determined according to the number of triangular patches contained in the model A and the model B respectively, and specifically, when the number of triangular patches is 1-1000, n=1; when the number of triangular patches is 1000-10000, n=2; when the number of triangular patches is 10000 to 100000, n=3.
4. The method for rapidly calculating the distance between polyhedrons based on BIM according to claim 1, wherein the minimum distance between triangular patches is calculated by:
and calculating the minimum distance between each side of the triangular surface patch A and each side of the triangular surface patch B, and then obtaining two sides with the minimum distance, wherein the distance between the two sides is the minimum distance between the triangular surface patches.
5. The BIM-based inter-polyhedron distance quick calculation method according to claim 4, wherein the minimum distance calculation method between triangular patches further includes:
for a pair of triangular patches with the minimum distance between triangular patches, projecting one triangular patch point onto the other triangular patch, and calculating the distance of the projection point in the range of the other triangular patch to obtain the minimum projection distance;
and taking the minimum value of the minimum edge distance and the minimum projection distance as the minimum distance between the model A and the model B.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211342271.6A CN115908542B (en) | 2022-10-31 | 2022-10-31 | BIM-based rapid calculation method for inter-polyhedron distance |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211342271.6A CN115908542B (en) | 2022-10-31 | 2022-10-31 | BIM-based rapid calculation method for inter-polyhedron distance |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115908542A CN115908542A (en) | 2023-04-04 |
| CN115908542B true CN115908542B (en) | 2023-09-19 |
Family
ID=86480700
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211342271.6A Active CN115908542B (en) | 2022-10-31 | 2022-10-31 | BIM-based rapid calculation method for inter-polyhedron distance |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115908542B (en) |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104462764A (en) * | 2014-11-06 | 2015-03-25 | 中国人民解放军第二炮兵工程设计研究所 | Rapid calculation method of minimum distance between object surfaces in virtual reality simulation |
| CN105469406A (en) * | 2015-11-30 | 2016-04-06 | 东北大学 | Bounding box and space partitioning-based virtual object collision detection method |
| CN105488851A (en) * | 2015-11-30 | 2016-04-13 | 腾讯科技（深圳）有限公司 | Method and device for detecting collision between colliders in real-time virtual scene |
| CN108875936A (en) * | 2018-06-11 | 2018-11-23 | 上海理工大学 | The method for solving the minimum distance in three-dimensional space between any two polyhedron |
| CN110136271A (en) * | 2018-02-08 | 2019-08-16 | 真玫智能科技（深圳）有限公司 | A kind of method and device of cloth people collision |
| CN112802201A (en) * | 2019-10-25 | 2021-05-14 | 北京博超时代软件有限公司 | Method and device for obtaining parallel closest distance between entity models |
| CN112825199A (en) * | 2019-11-20 | 2021-05-21 | 北京博超时代软件有限公司 | Collision detection method, device, equipment and storage medium |
| CN114283244A (en) * | 2021-12-31 | 2022-04-05 | 西安交通大学 | Octree Boolean operation accelerated intersection method based on GPU |
-
2022
- 2022-10-31 CN CN202211342271.6A patent/CN115908542B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104462764A (en) * | 2014-11-06 | 2015-03-25 | 中国人民解放军第二炮兵工程设计研究所 | Rapid calculation method of minimum distance between object surfaces in virtual reality simulation |
| CN105469406A (en) * | 2015-11-30 | 2016-04-06 | 东北大学 | Bounding box and space partitioning-based virtual object collision detection method |
| CN105488851A (en) * | 2015-11-30 | 2016-04-13 | 腾讯科技（深圳）有限公司 | Method and device for detecting collision between colliders in real-time virtual scene |
| CN110136271A (en) * | 2018-02-08 | 2019-08-16 | 真玫智能科技（深圳）有限公司 | A kind of method and device of cloth people collision |
| CN108875936A (en) * | 2018-06-11 | 2018-11-23 | 上海理工大学 | The method for solving the minimum distance in three-dimensional space between any two polyhedron |
| CN112802201A (en) * | 2019-10-25 | 2021-05-14 | 北京博超时代软件有限公司 | Method and device for obtaining parallel closest distance between entity models |
| CN112825199A (en) * | 2019-11-20 | 2021-05-21 | 北京博超时代软件有限公司 | Collision detection method, device, equipment and storage medium |
| CN114283244A (en) * | 2021-12-31 | 2022-04-05 | 西安交通大学 | Octree Boolean operation accelerated intersection method based on GPU |
Non-Patent Citations (2)
| Title |
|---|
| "一种快速计算三维空间中物体碰撞接触面的方法";傅由甲等;《计算机仿真》(第01期);第74-78页 * |
| "交互虚拟装配仿真过程中物体间间隙动态计算方法";甄希金等;《上海交通大学学报》(第02期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115908542A (en) | 2023-04-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111932688B (en) | Indoor plane element extraction method, system and equipment based on three-dimensional point cloud | |
| CN108305289B (en) | Three-dimensional model symmetry characteristic detection method and system based on least square method | |
| US20210183068A1 (en) | Self-Adaptive Point Cloud Stripe Division Method | |
| CN101377851A (en) | System and method for computing a minimum distance from point cloud to point cloud | |
| CN114612665B (en) | Pose estimation and dynamic vehicle detection method based on normal vector histogram features | |
| CN113920134A (en) | Slope ground point cloud segmentation method and system based on multi-line laser radar | |
| CN108564604B (en) | Binocular vision stereo matching method and device based on plane constraint and triangulation | |
| CN109636889A (en) | A kind of Large Scale Terrain model rendering method based on dynamic suture zone | |
| CN105957148A (en) | Granularity balance data organization method of complicated three-dimensional building model | |
| CN115908542B (en) | BIM-based rapid calculation method for inter-polyhedron distance | |
| CN117315192B (en) | Three-dimensional grid model simplification method for Chinese space station | |
| Zhang et al. | A geometry and texture coupled flexible generalization of urban building models | |
| CN111523576B (en) | Density peak clustering outlier detection method suitable for electron quality detection | |
| CN116246069B (en) | Method and device for self-adaptive terrain point cloud filtering, intelligent terminal and storage medium | |
| CN115544634B (en) | Oil and gas field level digital twin model space coordinate transformation method and system | |
| CN116912515A (en) | LoD-based VSLAM feature point detection method | |
| WO2022148075A1 (en) | Virtual object clustering method and apparatus, and storage medium and electronic apparatus | |
| CN114065354B (en) | Fusion system based on BIM and GIS | |
| CN110223395A (en) | Three-dimensional scene material model dynamic construction method and system | |
| CN115272379A (en) | Projection-based three-dimensional grid model outline extraction method and system | |
| CN112989470B (en) | Indoor space layout extraction method based on point cloud data | |
| CN111859612B (en) | Laser radar simulation method and device | |
| CN111524236B (en) | Self-adaptive triangle network simplification method based on plane analysis | |
| Dequidt et al. | Time‐critical animation of deformable solids | |
| CN115239873B (en) | Depth map-based fine granularity division and scene map organization method for building |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |