CN112231800A

CN112231800A - BIM graph optimization method and device and computer storage medium

Info

Publication number: CN112231800A
Application number: CN202011022161.2A
Authority: CN
Inventors: 郑腾洲; 赖奋万; 艾必聪; 崔莉; 杨洪伟; 刘亚鑫; 曾伟鑫
Original assignee: Shenzhen Huayang International Engineering Design Co ltd
Current assignee: Shenzhen Huayang International Engineering Design Co ltd
Priority date: 2020-09-25
Filing date: 2020-09-25
Publication date: 2021-01-15
Anticipated expiration: 2040-09-25
Also published as: CN112231800B

Abstract

The invention discloses a BIM graph optimization method, a BIM graph optimization device and a computer storage medium, wherein the method comprises the following steps: comparing the shape information of the BIM graph; using BIM graphs with the same shape information as a graph cluster; and extracting the graph information of any BIM graph in the graph cluster, the coordinate information of the BIM graph and the coordinate information of other BIM graphs as the cluster information of the graph cluster. Through the method, the data volume of the BIM graph can be optimized.

Description

BIM graph optimization method and device and computer storage medium

Technical Field

The present invention relates to the field of BIM, and in particular, to a method and an apparatus for optimizing a BIM graph, and a computer storage medium.

Background

The BIM (Building Information Modeling) three-dimensional model has better three-dimensional expression Information, and is increasingly regarded by the field.

The BIM model generally includes a large number of BIM graphics, which are generally three-dimensional models that include a large amount of graphical information. However, a large number of the same BIM patterns may be included in one BIM model, and in the prior art, each BIM pattern is generally stored separately, so that the information amount of the whole BIM model is large.

Disclosure of Invention

The invention provides a BIM graph optimization method, a BIM graph optimization device and a computer storage medium, which are used for solving the problem that the efficiency of checking BIM files is low in the prior art.

In order to solve the technical problems, the invention adopts a technical scheme that: a BIM graph optimization method is provided, and comprises the following steps: comparing the shape information of the BIM graph; using BIM graphs with the same shape information as a graph cluster; and extracting the graph information of any BIM graph in the graph cluster, the coordinate information of the BIM graph and the coordinate information of other BIM graphs as the cluster information of the graph cluster.

In order to solve the technical problem, the invention adopts another technical scheme that: providing a BIM graph optimizing device, wherein the BIM graph optimizing device comprises a processor and a memory; the memory has stored therein a computer program for execution by the processor to implement the steps of the method as described above.

In order to solve the above technical problem, another technical solution of the present invention is to provide a computer storage medium, wherein a computer program is stored, and the processor is configured to execute the computer program to implement any one of the above methods, and when the computer program is executed, the steps of the optimization method of the BIM graph are implemented.

Different from the prior art, the invention provides a BIM graph optimization method, a BIM graph optimization device and a computer storage medium. The shape information of the BIM graphs is compared, the BIM graphs with the same shape information are used as a graph cluster, and then the graph information of any BIM graph in the graph cluster, the coordinate information of the BIM graph and the coordinate information of other BIM graphs are extracted to be used as the cluster information of the graph cluster. The data size of the entire repeated BIM graphic can be greatly reduced.

Drawings

In order to more clearly illustrate the technical solutions in the embodiments of the present invention, the drawings needed to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.

FIG. 1 is a schematic flow chart diagram illustrating a first embodiment of a BIM graph optimization method provided by the present invention;

FIG. 2 is a flow diagram illustrating the sub-steps of step S10 of FIG. 1;

FIG. 3 is a schematic flow chart diagram illustrating one embodiment of sub-step S11 of FIG. 1;

FIG. 4 is a schematic flow chart diagram of another embodiment of the substeps of step S11 of FIG. 1;

FIG. 5 is a flowchart illustrating a sub-step of step S111b in FIG. 4;

FIG. 6 is a schematic diagram of an embodiment of a BIM graph provided in the present invention;

FIG. 7 is a schematic cross-sectional view of one embodiment of a BIM pattern provided by the present invention;

FIG. 8 is a schematic cross-sectional view of another embodiment of a BIM pattern provided by the present invention;

FIG. 9 is a schematic cross-sectional view of another embodiment of a BIM pattern provided by the present invention;

FIG. 10 is a schematic diagram of another embodiment of a BIM graphic provided by the present invention;

FIG. 11 is a schematic structural diagram of an embodiment of an apparatus for optimizing BIM patterns provided in the present invention;

FIG. 12 is a schematic structural diagram of an embodiment of a computer storage medium according to the present invention.

Detailed Description

The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.

Referring to fig. 1, fig. 1 is a schematic flow chart of a first embodiment of a BIM graph optimization method according to the present invention, and the BIM graph optimization method of the present embodiment includes the following steps:

and S11, comparing the shape information of the BIM graph.

And comparing the shape information of the BIM pattern, wherein the BIM pattern is selected to be a basic structure of a BIM model formed by BIM software, such as a component in revti software, an element in PDMS software and the like. If the BIM model is a building model, the BIM pattern can be a wall, a column, a beam, a plate and the like.

In an alternative embodiment, the shape information between the BIM patterns in the BIM model is compared.

In another alternative embodiment, before step S11, the method further includes:

and S10, comparing the category information of the BIM graphs in the BIM model.

I.e. comparing the category information between the various BIM graphs in the BIM model.

Referring to fig. 2, fig. 2 is a schematic view of a sub-step flow of step S10 in fig. 1, which specifically includes the following steps:

and S101, acquiring name information of the BIM graph in the BIM model.

And acquiring name information of the BIM graph in the BIM model, wherein optionally, the BIM graph comprises basic parameter information such as name information. Such as name information, may be specifically wall members, plate members, column members, and the like. And the name information of the same type of BIM graphics is the same, i.e. the name information is a wall member no matter which area or wall of any size is set. In an alternative embodiment, the name information is absolute identification information, that is, any two BIM graphs with the same name information are different only in size and other information, and if the name information further includes a rectangular column member and a circular column member, the name information is different although the rectangular column and the circular column belong to the column member.

And S102, comparing the volume information of the BIM graphs with the same name information.

The BIM graphs with the same name information are divided into a set, and the volume information among the BIM graphs in the set is compared.

And S103, taking the BIM graphs with the same volume information as the BIM graphs with the same category information.

And then using the BIM image with the same volume information as the BIM graph with the same category information. That is, if the name information and the volume information of two BIM graphs are the same, it can be considered that the two BIM graphs are the BIM graphs whose category information is the same. The BIM graphic having the same category information can be treated as one category group.

In a specific embodiment, a bounding box (bounding box) may be created on a per BIM graph basis, i.e., a bounding box that creates a minimal cuboid that may enclose the BIM graph. The bounding box volumes between the BIM graphs are then compared, and the BIM graphs with the same bounding box volume are used as the BIM graphs with the same volume information.

Optionally, since the BIM graph is a regular or irregular three-dimensional graph, the volume of the irregular three-dimensional graph is extremely large and inconvenient. By establishing the bounding box based on the BIM graph and comparing the volume information of the BIM graph by comparing the volume of the bounding box, the calculation amount can be greatly reduced, and the calculation efficiency is improved.

In an alternative embodiment, all the BIM graphs in the whole BIM model may be sorted, specifically, coordinates of a geometric center point of each BIM graph or a geometric center point of a bounding box of the BIM graph may be obtained, and sizes of the coordinates are sorted in order according to XYZ. A comparison is then made based on the category information for the ranked BIM graphs.

In an alternative embodiment, the shape information of the comparison BIM graphic may specifically be the shape information of the BIM graphic with the same comparison category information, that is, for each category group, the shape information of each BIM graphic in the category group may be compared.

Optionally, since a BIM model, especially a BIM model based on a large project, such as a business complex, includes a large number of BIM drawings, in the above embodiment, the BIM drawings of the same category information are separated by comparing the name information of the BIM drawings and further comparing the volume information of the BIM drawings of the same name information, and then comparing the shape information of the BIM drawings of the same category information. Compared with the relative shape information, the calculation amount of the category information is less, so that the number of the BIM drawings for comparing the shape information can be greatly reduced, for example, by comparing the name information of the BIM drawings, the two parts can be ensured to be at least of the same type so as to prevent comparison between a cylinder and a wall body and the like, and further by comparing the volume information of the BIM drawings, the BIM drawings with larger volume difference are prevented from being compared. Therefore, through the mode, the number of the BIM drawings which need to be compared and are compared with the shape information can be gradually reduced, so that the calculation amount is greatly reduced, and the calculation efficiency is improved.

In a specific embodiment, comparing the shape information of the BIM graphic is specifically comparing the stretched shape information of the BIM graphic and/or comparing the coordinate shape information of the BIM graphic according to the graphic type of the BIM graphic. Specifically, according to the drawing type of the BIM graph, the stretching shape information of the BIM graph with the same type information is compared and/or the coordinate shape information of the BIM graph with the same type information is compared.

In a specific scenario, the graphic type of the BIM graphic may be obtained first, and if the graphic type of the BIM graphic is a stretched graphic, the step of comparing the stretched shape information of the BIM graphic and/or comparing the coordinate shape information of the BIM graphic is performed.

That is, if the graphic is a stretched graphic, the shape information of the BIM graphic may be compared by comparing the stretched shape information of the BIM graphic, or the shape information of the BIM graphic may be compared by comparing the coordinate shape information of the BIM graphic. Are not limited herein.

Specifically, the stretching pattern refers to a BIM pattern formed by stretching a planar pattern in a direction perpendicular to the plane of the planar pattern. Such as a column, a beam, etc.

In a specific embodiment, two opposite faces of the BIM graph, specifically two faces that are parallel and arranged oppositely, may be obtained, if a projection of one of the two faces on a plane where the other face is located overlaps with the other face, a straight line perpendicular to the two faces is taken as an axis, and further, if a projection of any cross section perpendicular to the axis in the BIM graph on the plane where the other face is located overlaps with the other face, the graph type of the BIM graph is a stretched graph.

As shown in fig. 6, taking a cylinder as an example, two opposite surfaces of the cylinder are an upper surface and a lower surface, respectively, and a projection of the upper surface on a plane where the lower surface is located is completely overlapped with the lower surface, taking a straight line perpendicular to the upper surface or the lower surface as an axis, and a projection of any cross section perpendicular to the axis on a plane where the lower surface is located is completely overlapped with the lower surface. That is, the graphic type of the BIM graphic can be determined in the above-described manner.

Specifically, since the pattern types of the BIM patterns with the same name information are also the same, the pattern type of any BIM pattern in the plurality of BIM patterns with the same category information can be obtained, that is, the pattern type of any BIM pattern in the same category group is used as the pattern type of all the BIM patterns in the category group. Therefore, by comparing the category information of each BIM graph first, the amount of calculation for subsequent judgment of the graph type can be effectively reduced.

In another specific scenario, if the type of the BIM graph is not a stretch graph, optionally, if the BIM drawing is not a stretch graph, the BIM drawing is not considered to be a stretch graph, and then the step of comparing the coordinate shape information of the BIM graph is performed. The parts stretch the pattern, such as air conditioners, chairs, etc.

In a specific scene, if the shape of the BIM drawing is a sphere, the radius of the sphere can be directly calculated, and whether the radii of the BIM graphs are equal or not is judged to be used as the basis for equality of the shape information of the BIM graphs.

Referring to fig. 3, fig. 3 is a flowchart illustrating an implementation of the sub-step of comparing the stretching shape information of the BIM graph in the foregoing embodiment, and the step specifically includes:

s111a, cross-sectional information and length information of the BIM pattern are acquired.

And acquiring the section information and the length information of the BIM graph.

Optionally, cross-sectional information of a cross section perpendicular to the axis in the BIM graph is extracted, as shown in fig. 7, the cross section of the BIM drawing is a circle, and the cross-sectional information is a circle with a radius r. As shown in fig. 8, if the cross section of the BIM drawing is a rectangle, the cross section information is a rectangle having a length and a width. As shown in fig. 9, if the cross section of the BIM drawing is a regular polygon, the cross section information is a regular polygon with n sides and c sides. Similarly, the section information of other sections may be recorded accordingly, i.e., a unique section may be determined based on the section information.

The length information is a length in a direction perpendicular to a cross-section of the BIM pattern, i.e., a distance between an axis and an intersection of two opposite faces of the BIM pattern.

As shown in fig. 10, P1 is the intersection point of the axis with the upper surface or the geometric center point of the upper surface in the BIM chart, and P2 is the intersection point of the axis with the lower surface or the geometric center point of the lower surface in the BIM chart. P1P2 is calculated as the length information of the BIM pattern. Alternatively, the coordinates of P1 and the coordinates of P2 may be acquired, and then the length information may be calculated by calculating the distance between the coordinates, which is not limited herein.

S112a, the BIM graph having the same cross-sectional information and length information is set as the BIM graph having the same shape information.

Alternatively, a BIM graph with the same cross-sectional information and length information is used as a BIM graph with the same shape information, that is, if the cross-sectional information and the length information of two or more BIM graphs are the same, the two or more BIM graphs can be considered as the BIM graphs with the same shape information.

Referring to fig. 4, fig. 4 is a schematic flow chart illustrating another implementation of the sub-step of comparing the stretching shape information of the BIM graph in the foregoing embodiment, and the step specifically includes:

s111b, selecting a plurality of corresponding vertexes on the BIM graph according to a preset sequence.

Optionally, a plurality of corresponding vertices may be selected on the BIM graph according to a preset order. As a comparative example with two BIM patterns. Multiple vertices may be selected from one of the two BIM graphs in a predetermined order, and corresponding multiple vertices may be selected from the other of the two BIM graphs in the predetermined order.

In a specific scenario, the BIM drawings with the same shape information in one BIM model may be rotated, translated, flipped, and the like. Therefore, even if the BIM drawings have the same shape information, the vertices of the BIM drawings are greatly different, and therefore, the corresponding vertices need to be selected from different BIM drawings to ensure that the vertices of the two parts are corresponding to each other.

Referring to fig. 5, fig. 5 is a schematic view of a sub-step flow of step S111b in fig. 4, which specifically includes:

s21, with the geometric center of the BIM chart or the geometric center of the bounding box of the BIM chart as the origin.

Optionally, the geometric center of the BIM graph or the geometric center of the bounding box of the BIM graph is used as the origin. In an alternative embodiment, if the BIM graph is a regular graph, the geometric center of the BIM graph may be used as the origin, and if the BIM graph is an irregular graph, such as a chair, an air conditioner, or other irregular graphs, the geometric center of the bounding box of the BIM graph may be used as the origin. Are not particularly limited herein.

And S22, calculating the distance between the top point and the origin point on the BIM graph.

And then calculating the distance between the vertex and the origin on the BIM graph, namely calculating the distance between all the vertices and the origin on the BIM graph.

In a specific scenario, if the number of vertices on a BIM graph is small, such as the shape of the BIM graph is a cone (one vertex), the geometric center of each face on the BIM graph can be used as a vertex, and the distance from the origin of the vertex can be calculated.

And S23, judging whether the distance between at least two vertexes is the same as the distance between the original points.

And judging whether the distance between at least two vertexes and the distance between the origins are the same, namely judging whether the distances between two or more vertexes in all vertexes and the origins are the same.

And S24, if not, sorting all the vertexes according to the sorting of the distances to form a vertex sequence.

If not, i.e. no at least two vertices are at the same distance from the origin, i.e. each vertex is at a different distance from the origin than the other further vertices. The vertices are sorted in order of distance to form a vertex sequence. The sorting may be performed in ascending order or descending order of distance, which is not limited herein. It should be noted that the vertex ordering manner is the same for all BIM graphs in the same category group. Different category groups may differ.

And S25, selecting a plurality of vertexes from the vertex sequence according to a preset point-taking mode.

And then, selecting a plurality of vertexes from the vertex sequence according to a preset point-taking mode. That is, a preset point-taking manner may be, for example, 3 points, 4 points, or 5 points or more, which is not limited herein, where the preset point-taking manner may be, for example, the first, the second, and the last in the vertex sequence. Or the first, the middle one (the vertex number is singular), or the middle two (the vertex number is even), and the last one, etc., all of which are not limited herein.

And S26, if yes, using the vertex except at least two vertices as the origin.

If so, the distance between at least two vertexes and the distance between the origins are the same, namely, each point cannot be sorted by one sorting. It is necessary to use vertices other than at least two vertices as the origin.

Taking a specific scene as an example, if the BIM graph includes vertex a, vertex B, vertex C, vertex D, vertex E, and vertex F. After the distance is calculated, the distance between vertex B and the origin is the same as the distance between vertex C and the origin, and vertices other than the two vertices may be used as the origin, that is, vertex a or vertex D or vertex E or vertex F other than vertices B and C may be used as a new origin.

Similarly, vertex a or vertex D or vertex E, except vertex B, vertex C and vertex F, is taken as the new origin if vertex B is the same distance from the origin, vertex C is the same distance from the origin, and vertex F is the same distance from the origin.

And S27, calculating the distance between the at least two vertexes and the origin, and returning to the step of judging whether the distance between the at least two vertexes is the same as the distance between the origin.

The distances between the at least two vertices and the origin are then calculated, i.e. the distances between the at least two vertices and the new origin are calculated, as in the above scenario, with vertex a as the new origin, the distance between vertex B and vertex a is calculated, and the distances between vertex C and vertex a are calculated. And returns to step S23.

In an alternative embodiment, if at least two vertices are still equidistant from the origin, the other vertices may be newly set as new origins, such as starting vertex a as a new origin, calculating the distance between vertex B and vertex a, and calculating the distance between vertex C and vertex a as equal, and then vertex D may be subsequently set as a new origin until the distances are different.

If the distance between the point B and the vertex a is not the same after the calculation is completed, and the distance between the point C and the vertex a is calculated, the step S24 is executed. The distances between the at least two vertices and the new origin and the distances between the other vertices and the original origin may be sorted in ascending or descending order. Namely, the distance between the point B and the vertex A, the distance between the vertex C and the vertex A and the distance between the other vertexes obtained by starting calculation and the original origin are sorted in an ascending order or a descending order.

In other embodiments, the distances between all vertices and the original origin may be sorted, where vertices with the same distance may be arranged in a non-ordered manner, such as vertices a, B, C, D, E, and F, which have distances of 1, 2.2, 3, 20, and 5 from the original origin, respectively. Then, the vertex sequences (vertex a, vertex B, vertex C, vertex D, vertex F, vertex E) may be obtained by sorting, or the vertex sequences (vertex a, vertex C, vertex B, vertex D, vertex F, vertex E) may be obtained, then, the distances between vertices with the same distance and a new origin are obtained, if the vertex a is used as a new vertex, the distance between the vertex B and the vertex a is 3, and the distance between the vertex C and the vertex a is 2, the vertex a and the vertex B are sorted to form subsequences (vertex C, vertex B, and then the subsequences are inserted into the positions of vertices with the same distance as the original vertex sequence to form new vertex sequences (vertex a, (vertex C, vertex B), vertex D, vertex F, and vertex E).

In an alternative embodiment, the above steps are performed in a loop until step S24 is satisfied.

In another alternative embodiment, if the number of times of continuously executing the step S23 for a BIM graph reaches a preset number, such as 5 times or other numbers, the step S24 may be directly executed to avoid the infinite loop phenomenon, and when the step S24 is executed, vertices with different distances need to be sorted to form a vertex sequence and selected from the vertex sequence.

And S112b, acquiring vertex information of the vertex.

Vertex information of the vertices is then acquired, and optionally, distance information between the vertices may be acquired as the vertex information, that is, the distance between the vertices may be acquired as the vertex information.

In step S113b, a BIM graph having the same vertex information is set as a BIM graph having the same shape information.

Subsequently, a BIM graph having the same vertex information is set as a BIM graph having the same shape information. Specifically, a BIM graph having the same vertex information as the corresponding vertex is set as a BIM graph having the same shape information.

In an alternative embodiment, such as BIM graphic K1 and BIM graphic K2, vertices A1, B1 and C1 are taken in the same point-taking manner from BIM graphic K1, and BIM graphic K2 is taken as vertices A2, B2 and C2. A2 corresponds to A1, B2 corresponds to B1, and C2 corresponds to C1. The distance D1 of a1 and B1, the distance D2 of a1 and C1, the distance D3 of B1 and C1, the distance D4 of a2 and B2, the distance D5 of a2 and C2, the distance D6 of B2 and C2 are then calculated. Specifically, comparing one corresponding distance or a plurality of corresponding distances is not limited, if the compared distances are all correspondingly equal. The vertex information of the two BIM graphs is considered to be the same, i.e., the shape information of the two BIM graphs is the same.

As in one embodiment, comparing the distance D1 with the distance D4, if D4D1 and D4D4 are equal, the BIM graphic K1 and the BIM graphic K2 are BIM graphics having the same shape information.

As in another embodiment, comparing distance D1 with distance D4 and comparing distance D2 with distance D5 indicates that the shape information of BIM graphic K1 and BIM graphic K2 are different if distance D1 is the same as distance D4 but distance D2 is different from distance D5. If the distance D1 is the same as the distance D4 and the distance D2 is the same as the distance D5, it indicates that the shape information of the BIM graphic K1 and the BIM graphic K2 are the same.

That is, optionally, one or more or all of the corresponding distance information may be compared, all without limitation.

S12, the BIM graphics with the same shape information are used as a graphics cluster.

After comparing the shape information between the BIM graphics, the BIM graphics with the same shape information can be used as a graphics cluster. I.e. the BIM graphics with the same shape information are considered as one graphics cluster. Optionally, the graphic cluster may be considered as a set of a plurality of BIM graphics with the same shape information, and the graphic cluster may also be considered as a plurality of BIM graphics with the same shape information.

S13, extracting the graph information of any BIM graph in the graph cluster, the coordinate information of the BIM graph and the coordinate information of other BIM graphs as the cluster information of the graph cluster.

And then, extracting the graph information of any BIM graph in the graph cluster, the coordinate information of the BIM graph and the coordinate information of other BIM graphs as the cluster information of the graph cluster. The coordinate information may be vertex coordinate information.

Optionally, the cluster information is information of a plurality of BIM graphs with the same shape information.

Optionally, the BIM graph is composed based on graph information and coordinate information, that is, a unique BIM graph can be generated through the graph information and the coordinate information.

In a specific scenario, the data size of the graphics information in the BIM graphics is much larger than the data size of the coordinate information, and since any BIM graphics in the graphics cluster are the same, that is, the graphics information of all the BIM graphics in the graphics cluster is also the same, the graphics information and all the coordinate information of any one BI graphics in the graphics cluster are extracted as the cluster information of the graphics cluster, that is, the information of all the BIM graphics in one graphics cluster can be included by the cluster information. In terms of data volume, the data volume of (the number of the BIM graphs in the graph cluster-1) graph information is reduced, namely the data volume occupied by the BIM graphs is greatly reduced.

In an optional embodiment, the extraction manner of the coordinate information of all the BIM graphs may be to extract all the vertex coordinates of each BIM graph, or may also adopt part of the vertex coordinates to extract. Or the relationship between the coordinate information may be determined and then stored by a relationship matrix.

As in the alternative embodiment, the graphic information S extracted from one BIM graphic K3 in the graphic cluster and the coordinate information M1 of the BIM graphic, wherein the graphic information S and the coordinate information M1 are associated with each other and can form a unique BIM graphic K3. If the coordinate information M2 of another BIM graphic K4 in the graphic cluster, when comparing M2 and M1, finds that M2 is formed by translation along the Z-axis with respect to M1, it can be generated by M1+ translation information when extracting M2, the translation information specifically including the translation direction and the translation distance. And the graphic information S and the coordinate information M2 can be associated and corresponding in a vertex corresponding manner, so that a unique BIM graph K4 can be formed, in other embodiments, if the coordinate information M3 of another BIM graph K5 in the graph cluster is found to be obtained based on the rotation of M1 around the Z axis when comparing M3 and M1, when extracting, the unique BIM graph K4 can be generated by M1+ rotation information, and the rotation information specifically includes a rotation axis and a rotation angle. Similarly, the graphic information S and the coordinate information M3 may be associated and corresponded in a vertex correspondence manner, so that a unique BIM graphic K5 may be formed. Therefore, the data amount of the coordinate information can also be reduced, thereby reducing the data amount of the entire BIM graphic.

That is, in the above embodiment, the shape information of the BIM graphics is compared, the BIM graphics with the same shape information are used as a graphics cluster, and then the graphics information of any BIM graphics in the graphics cluster, the coordinate information of the BIM graphics, and the coordinate information of other BIM graphics are extracted as the cluster information of the graphics cluster. The data size of the entire repeated BIM graphic can be greatly reduced.

And S14, storing and/or transmitting the cluster information as the information of all BIM graphs in the corresponding graph cluster.

In an alternative embodiment, after the cluster information is extracted, the cluster information may be stored or transmitted as information of all BIM graphs in the corresponding graph cluster.

In an optional scenario, the cluster information may be stored as storage information of all BIM graphs in the corresponding graph cluster, so as to reduce the data storage amount of the whole BIM model.

In another optional scenario, the cluster information may be transmitted as storage information of all BIM graphs in the corresponding graph cluster, that is, if information of the BIM model needs to be transmitted, the cluster information may also be used as information that needs to be transmitted, thereby reducing transmission amount of data and improving transmission efficiency.

In summary, the present application compares the name information of the BIM graphs first, and further compares the volume information of the BIM graphs with the same name information to separate out the BIM graphs with the same category information, and then compares the shape information of the BIM graphs with the same category information. Compared with the relative shape information, the calculation amount of the category information is less, so that the number of the BIM drawings for comparing the shape information can be greatly reduced, for example, by comparing the name information of the BIM drawings, the two parts can be ensured to be at least of the same type so as to prevent comparison between a cylinder and a wall body and the like, and further by comparing the volume information of the BIM drawings, the BIM drawings with larger volume difference are prevented from being compared. Therefore, through the mode, the number of the BIM drawings which need to be compared and are compared with the shape information can be gradually reduced, so that the calculation amount is greatly reduced, and the calculation efficiency is improved. And then comparing the shape information of the BIM graphs, using the BIM graphs with the same shape information as a graph cluster, and then extracting the graph information of any BIM graph in the graph cluster, the coordinate information of the BIM graph and the coordinate information of other BIM graphs as the cluster information of the graph cluster. The data size of the entire repeated BIM graphic can be greatly reduced. Furthermore, the comparison of the shape information of the BIM graphs is based on vertex coordinates rather than graph information, the comparison effect is good, the calculated amount is small, the comparison between the BIM graphs in the whole BIM model can be rapidly completed, and therefore a good data optimization effect is achieved.

As shown in fig. 11, the present application further provides a BIM graph optimizing apparatus 300, please refer to fig. 11, and fig. 11 is a schematic structural diagram of an embodiment of a BIM graph optimizing apparatus according to the present invention. The BIM optimization apparatus 300 of the present embodiment includes a processor 32 and a memory 31; the memory 31 stores a computer program, and the processor 32 is used for executing the computer program to realize the steps of the optimization method of the BIM graph as described above.

The logic process of the optimization method of the BIM graph is presented as a computer program, and on the aspect of the computer program, if it is sold or used as a stand-alone software product, it can be stored in a computer storage medium, so the present invention proposes a computer storage medium. Referring to fig. 12, fig. 12 is a schematic structural diagram of a computer storage medium 200 according to an embodiment of the present invention, in which a computer program 21 is stored, and the computer program is executed by a processor to implement the distribution network method or the control method.

The computer storage medium 200 may be a medium that can store a computer program, such as a usb disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk, or an optical disk, or may be a server that stores the computer program, and the server may send the stored computer program to another device for running or may run the stored computer program by itself. The computer storage medium 200 may be a combination of a plurality of entities from a physical point of view, for example, a plurality of servers, a server plus a memory, or a memory plus a removable hard disk.

The above description is only an embodiment of the present invention, and not intended to limit the scope of the present invention, and all modifications of equivalent structures and equivalent processes performed by the present specification and drawings, or directly or indirectly applied to other related technical fields, are included in the scope of the present invention.

Claims

1. A BIM graph optimization method is characterized by comprising the following steps:

comparing the shape information of the BIM graph;

using BIM graphs with the same shape information as a graph cluster;

and extracting the graph information of any BIM graph in the graph cluster, the coordinate information of the BIM graph and the coordinate information of other BIM graphs as the cluster information of the graph cluster.

2. The optimization method according to claim 1, wherein the comparing the shape information of the BIM graph comprises:

and comparing the category information of the BIM graphs in the BIM model.

3. The optimization method according to claim 2, wherein the comparing the shape information of the BIM graph includes:

and comparing the shape information of the BIM graphs with the same category information.

4. The optimization method according to claim 2, wherein the comparing the category information of the BIM graphs in the BIM model includes:

acquiring name information of the BIM graph in the BIM model;

comparing the volume information of the BIM graphs with the same name information;

and taking the BIM graph with the same volume information as the BIM graph with the same category information.

5. The optimization method according to claim 4, wherein the comparing the volume information of the BIM graphs with the same name information comprises:

building a bounding box based on the BIM graph;

comparing bounding box volumes of the BIM graph;

and taking the BIM graph with the same bounding box volume as the BIM graph with the same volume information.

6. The optimization method according to claim 1, wherein the comparing the shape information of the BIM graph includes:

and comparing the stretching shape information of the BIM graph and/or comparing the coordinate shape information of the BIM graph according to the graph type of the BIM graph.

7. The optimization method of claim 6, wherein the comparing the stretched shape information of the BIM graphic comprises:

acquiring cross section information and length information of the BIM graph;

the BIM pattern with the same cross section information and length information is used as the BIM pattern with the same shape information.

8. The optimization method of claim 6, wherein the comparing the coordinate shape information of the BIM graph comprises:

selecting a plurality of corresponding vertexes on the BIM graph according to a preset sequence;

acquiring vertex information of the vertex;

the BIM graph with the same vertex information is used as the BIM graph with the same shape information.

9. The optimization method of claim 8, wherein the selecting a plurality of corresponding vertices on the BIM graph according to the predetermined order comprises:

taking the geometric center of the BIM graph or the geometric center of a bounding box of the BIM graph as an origin;

calculating the distances between all vertexes on the BIM graph and the origin;

judging whether the distance between at least two vertexes is the same as the distance between the original points;

if not, sequencing all vertexes according to the distance sequence to form a vertex sequence;

selecting a plurality of vertexes from the vertex sequence according to a preset point-taking mode;

if yes, using the vertexes except the at least two vertexes as the origin;

and calculating the distance between the at least two vertexes and the origin, and returning to the step of judging whether the distance between the at least two vertexes and the origin is the same.

10. The optimization method according to claim 8, wherein the obtaining vertex information of the vertex comprises:

and acquiring distance information between the vertexes as the vertex information.

11. The optimization method according to claim 6, wherein the comparing the stretched shape information of the BIM graphic and/or the comparing the coordinate shape information of the BIM graphic according to the graphic type of the BIM graphic comprises:

acquiring the graph type of the BIM graph;

if the graph type of the BIM graph is a stretching graph, executing the step of comparing the stretching shape information of the BIM graph and/or comparing the coordinate shape information of the BIM graph;

and if the graph type of the BIM graph is not a stretching graph, executing the step of comparing the coordinate shape information of the BIM graph.

12. The optimization method of claim 11, wherein the obtaining of the graph type of the BIM graph comprises:

acquiring two opposite surfaces in the BIM graph;

if the projection of one of the two surfaces on the plane of the other surface is overlapped with the other surface, taking a straight line perpendicular to the two surfaces as an axis;

and if the projection of any cross section perpendicular to the axis in the BIM graph on the plane of the other face is overlapped with the other face, the graph type of the BIM graph is the stretching graph.

13. The optimization method according to claim 1, further comprising:

and storing and/or transmitting the cluster information as the information of all BIM graphs in the corresponding graph cluster.

14. The optimization device of the BIM is characterized by comprising a processor and a memory; the memory has stored therein a computer program for execution by the processor to perform the steps of the method according to claims 1-13.

15. A computer storage medium, characterized in that the computer storage medium stores a computer program which, when executed, implements the steps of the method according to any one of claims 1-13.