A method and system for generating a BIM model of a building

Abstract

The present invention relates to a method and system for generating a BIM model of a building. The method of the present invention first performs path reconstruction and data patching on two-dimensional graphics to enhance the readability of the two-dimensional graphics during the BIM model construction process while avoiding the original errors existing in the two-dimensional graphics. For other data parameters that cannot be displayed in the two-dimensional graphics, they are directly added by means of input, and the formatted data is used as an intermediate file to realize the automatic generation of the BIM model. The present invention provides a method for generating a BIM model based on two-dimensional graphics, saving costs.

Description

Technical Field

[0001] The present invention relates to the technical field of architectural design, and particularly to a method and system for generating a BIM model of a building. Background Art

[0002] At present, the construction industry has a large scale and rapid construction progress. However, with the sustainable development of the construction industry's demands, construction enterprises, design institutes, and component factories all need to face more severe competition.

[0003] Firstly, at the current stage, the large scale of the construction industry also brings economic losses caused by information loss in communication and various implementation links. The informatization process of BIM (Building Information Modeling) can largely improve this situation. Secondly, through the sustainable development of BIM informatization in construction operations, it has great practical value for the whole-process information management and progress control of buildings.

[0004] However, the construction of existing BIM models is all based on three-dimensional models. The price of three-dimensional model application software is often hundreds of thousands of yuan. Coupled with training costs and time costs, the cost is huge. Summary of the Invention

[0005] In view of this, the present invention provides a method and system for generating a BIM model of a building to realize the generation of a BIM model of a building based on a two-dimensional graph and reduce costs.

[0006] To achieve the above object, the present invention provides the following solutions:

[0007] A method for generating a BIM model of a building, the method comprising the following steps:

[0008] Obtain the coordinates of each vertex in the two-dimensional graph of the building;

[0009] Perform path reconstruction and data patching on the two-dimensional graph based on the coordinates of each vertex to obtain a reconstructed planning path after patching;

[0010] Input the data parameters required for building the BIM model;

[0011] Convert the reconstructed planning path after patching and the data parameters into format data that can be called when generating the BIM model;

[0012] Call the format data to generate a BIM model of the building.

[0013] Optionally, the performing path reconstruction and data patching on the two-dimensional graph based on the coordinates of each vertex to obtain a reconstructed planning path after patching specifically includes:

[0014] Judge whether the two-dimensional graph is closed based on the coordinates of each vertex, and obtain a judgment result;

[0015] If the judgment result is no, convert the two-dimensional graph into a closed two-dimensional graph;

[0016] Perform path reconstruction on the target two-dimensional graph based on the coordinates of each vertex to obtain a reconstructed planned path; the target two-dimensional graph is a two-dimensional graph whose judgment result indicates closure, or a closed two-dimensional graph obtained after conversion;

[0017] Perform data patching on the reconstructed planned path to obtain a patched reconstructed planned path.

[0018] Optionally, the judging whether the two-dimensional graph is closed based on the coordinates of each vertex and obtaining a judgment result specifically includes:

[0019] Respectively use each vertex as the center of a circle and half of the tolerance as the radius to draw a circle, and obtain a set of circles corresponding to each vertex. The set of circles contains all vertices within the circle;

[0020] If the intersection of any two sets of circles is empty, the judgment result is yes, otherwise, the judgment result is no.

[0021] Optionally, the converting the two-dimensional graph into a closed two-dimensional graph specifically includes:

[0022] Obtain the coordinates of the vertices corresponding to the two sets of circles with a non-empty intersection, and use them as the first coordinate and the second coordinate respectively;

[0023] Obtain the coordinates of the vertex with the smallest distance from the first coordinate as the third coordinate, and the coordinates of the vertex with the smallest distance from the second coordinate as the fourth coordinate;

[0024] Obtain the intersection point of the line where the first coordinate and the third coordinate are located and the line where the second coordinate and the fourth coordinate are located;

[0025] Replace the vertices corresponding to the two sets of circles with a non-empty intersection with the intersection point.

[0026] Optionally, the performing path reconstruction on the target two-dimensional graph based on the coordinates of each vertex to obtain a reconstructed planned path specifically includes:

[0027] Calculate the centroid of the target two-dimensional graph using the following formula;

[0028] Xc = ∑Xi / N, Yc = ∑Yi / N;

[0029] Among them, (Xc, Yc) are the coordinates of the centroid of the target two-dimensional graph, (Xi, Yi) are the coordinates of the i-th vertex in the target two-dimensional graph, and N represents the number of vertices in the target two-dimensional graph;

[0030] Calculate the angle between the line connecting each vertex in the target two-dimensional graph and the centroid and the positive direction of the X-axis;

[0031] Arrange each vertex in the target two-dimensional graph in ascending order of the angle to obtain the sorted vertices;

[0032] Connect each sorted vertex in sequence to obtain the reconstructed planned path.

[0033] Optionally, performing data patching on the reconstructed planned path to obtain the patched reconstructed planned path specifically includes:

[0034] When the distance between two adjacent vertices in the reconstructed planned path cannot be divisible by the modulus, then use the two vertices as two patching vertices respectively;

[0035] Patch the coordinates of at least one of the patching vertices with the minimum adjustment amount so that the distance between the two patching vertices can be divisible by the modulus.

[0036] Optionally, the data parameters include the design environment, geometric parameters missing in the two-dimensional graph, reinforcement parameters, construction period parameters, and storage parameters.

[0037] Optionally, the format data is in the ifc format.

[0038] A BIM model generation system for a building, the system includes:

[0039] A vertex coordinate acquisition module for acquiring the coordinates of each vertex in the two-dimensional graph of the building;

[0040] A path reconstruction and patching module for performing path reconstruction and data patching on the two-dimensional graph based on the coordinates of each vertex to obtain the patched reconstructed planned path;

[0041] A data parameter entry module for entering the data parameters required to build the BIM model;

[0042] A format conversion module for converting the patched reconstructed planned path and the data parameters into format data that can be called when generating the BIM model;

[0043] A BIM model generation module for calling the format data to generate the BIM model of the building.

[0044] Optionally, the path reconstruction and patching module specifically includes:

[0045] A judgment sub-module, configured to judge whether the two-dimensional graph is closed based on the coordinates of each vertex, and obtain a judgment result;

[0046] A graph conversion sub-module, configured to convert the two-dimensional graph into a closed two-dimensional graph if the judgment result is negative;

[0047] A path reconstruction sub-module, configured to perform path reconstruction on a target two-dimensional graph based on the coordinates of each vertex, and obtain a reconstructed planned path; the target two-dimensional graph is a two-dimensional graph for which the judgment result indicates closure, or a closed two-dimensional graph obtained after conversion;

[0048] A data patching sub-module, configured to perform data patching on the reconstructed planned path to obtain a patched reconstructed planned path.

[0049] According to the specific embodiments provided by the present invention, the following technical effects are disclosed by the present invention:

[0050] The present invention discloses a method and a system for generating a BIM model of a building. The method includes the following steps: obtaining the coordinates of each vertex in a two-dimensional graph of the building; performing path reconstruction and data patching on the two-dimensional graph based on the coordinates of each vertex to obtain a patched reconstructed planned path; inputting data parameters required for constructing the BIM model; converting the patched reconstructed planned path and the data parameters into format data that can be called during the generation of the BIM model; and calling the format data to generate the BIM model of the building. The present invention first performs path reconstruction and data patching on the two-dimensional graph to avoid the original errors existing in the two-dimensional graph while enhancing the readability of the two-dimensional graph during the BIM model construction process. For other data parameters that cannot be displayed in the two-dimensional graph, they are directly added by inputting, and the format data is used as an intermediate file to realize the automatic generation of the BIM model. The present invention provides a method for generating a BIM model based on a two-dimensional graph, saving costs. Description of the Drawings

[0051] In order to more clearly illustrate the technical solutions in the embodiments of the present invention or the prior art, the following will briefly introduce the drawings required in the embodiments. Obviously, the drawings in the following description are only some embodiments of the present invention. For those of ordinary skill in the art, other drawings can be obtained based on these drawings without creative efforts.

[0052] Figure 1 It is a flowchart of a method for generating a BIM model of a building provided in Embodiment 1 of the present invention;

[0053] Figure 2Schematic diagram of a method for generating a BIM model of a building provided in Embodiment 1 of the present invention;

[0054] Figure 3 Schematic diagram for judging that a two-dimensional graph is a closed graph provided in Embodiment 1 of the present invention;

[0055] Figure 4 Schematic diagram for judging that a two-dimensional graph is an open graph provided in Embodiment 1 of the present invention;

[0056] Figure 5 Schematic diagram of the vertex distribution of a two-dimensional graph provided in Embodiment 1 of the present invention;

[0057] Figure 6 Schematic diagram for converting an open graph into a closed graph provided in Embodiment 1 of the present invention;

[0058] Figure 7 Schematic diagram for path reconstruction and repair of a closed graph provided in Embodiment 1 of the present invention;

[0059] Figure 8 Schematic diagram of angle marking provided in Embodiment 1 of the present invention;

[0060] Figure 9 Schematic diagram of path reconstruction provided in Embodiment 1 of the present invention;

[0061] Figure 10 Schematic diagram for obtaining a region set provided in Embodiment 1 of the present invention;

[0062] Figure 11 Schematic diagram of repair data provided in Embodiment 1 of the present invention;

[0063] Figure 12 Schematic diagram of repair methods provided in Embodiment 1 of the present invention;

[0064] Figure 13 Schematic diagram of the WPF input method provided in Embodiment 1 of the present invention;

[0065] Figure 14 Schematic diagram of the information of a board provided in Embodiment 1 of the present invention;

[0066] Figure 15 Schematic diagram of BIM model generation provided in Embodiment 1 of the present invention. Detailed implementation manners

[0067] Next, the technical solutions in the embodiments of the present invention will be clearly and completely described in conjunction with the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are only a part of the embodiments of the present invention, rather than all the embodiments. All other embodiments obtained by those of ordinary skill in the art based on the embodiments of the present invention without creative efforts shall fall within the protection scope of the present invention.

[0068] The purpose of the present invention is to provide a method and system for generating a BIM model of a building, so as to realize the generation of the BIM model of the building based on a two-dimensional graphic and reduce costs.

[0069] To make the above objects, features, and advantages of the present invention more obvious and understandable, the present invention will be further described in detail below in conjunction with the accompanying drawings and specific embodiments.

[0070] Embodiment 1

[0071] As Figure 1 shown, Embodiment 1 of the present invention provides a method for generating a BIM model of a building, and the method includes the following steps:

[0072] Step 101, obtain the coordinates of each vertex in the two-dimensional graphic of the building.

[0073] Step 102, perform path reconstruction and data patching on the two-dimensional graphic based on the coordinates of each vertex to obtain a reconstructed planning path after patching.

[0074] According to the obtained two-dimensional graphic, calculate and identify closed graphics and open graphics; reasonably plan and redraw the paths for the vertices and boundaries of the closed graphics, and patch, merge, and adjust the open graphics.

[0075] Specifically, Step 102 includes the following steps:

[0076] Based on the coordinates of each vertex, determine whether the two-dimensional graphic is closed to obtain a judgment result. Specifically, it includes: respectively taking each vertex as the center and half of the tolerance as the radius to make a circle to obtain a set of circles corresponding to each vertex, and the set of circles includes all vertices inside the circle; if the intersection of any two sets of circles is empty, the judgment result is yes, otherwise, the judgment result is no.

[0077] The principle is: when the vertices of a polyline are respectively P = {P 1 , P 2 , …, P n}, and the polyline is composed of n - 1 line segments, then it is determined that the graphic is an unclosed graphic that needs to be adjusted. Taking the tolerance δ / 2 of the graphic interface as the radius and the vertex Pi as the center, generate the corresponding set of circles C R = {C R1 , C R2,…,C Rn}.

[0078] The set of circles C R Any two different C j , C k , if then it is determined that these two vertices do not need to be adjusted, that is Figure 3 as shown. If there exists such as Figure 4 as shown, then the two vertices make the two-dimensional figure an open figure and need to be adjusted.

[0079] If the judgment result is negative, then convert the two-dimensional figure into a closed two-dimensional figure, specifically including: obtaining the coordinates of the vertices corresponding to two sets of circles with non-empty intersections as the first coordinate and the second coordinate respectively; obtaining the coordinates of the vertex with the smallest distance from the first coordinate as the third coordinate, and the coordinates of the vertex with the smallest distance from the second coordinate as the fourth coordinate; obtaining the intersection of the line where the first coordinate and the third coordinate are located and the line where the second coordinate and the fourth coordinate are located; replacing the vertices corresponding to the two sets of circles with non-empty intersections with the intersection point.

[0080] The principle is: calculate the vertices (i.e., P2, P5 in j , C k ) with the smallest difference from the centers of the circles of C Figure 5 (i.e., P3, P4 in Figure 5 ). The line segment L1 is formed by P2(x2, y2) and P3(x3, y3), and the line segment L2 is formed by P4(x4, y4) and P5(x5, y5).

[0081] Calculate the corresponding slopes k1 and k2 of L1 and L2. If k1≠k2, then L1 and L2 are not parallel. Calculate the intersection point Jn of the corresponding lines, and at the same time replace P3 and P4 in P={P 1 , P 2 ,…, P n} with Jn.

[0082] Where:

[0083] The slope k=(Y1 - Y2) / (X1 - X2), and R(X1, Y1), T(X2, Y2) are two points on the line segment L;

[0084] Calculate y = kx + b, and calculate b with a point on the line segment;

[0085] Simultaneously Calculate the intersection point Jn of the two line segments.

[0086] Delete the vertices to be merged in the two-dimensional figure (i.e., Figure 5Among P3 and P4), and add the intersection point Jn as the merged vertex into the point set of the two-dimensional graph to generate a new point set P2 = {P 1 , P 2 , P 3 , …, J n , …, P n}, as shown in Figure 6 .

[0087] Based on the coordinates of each vertex, perform path reconstruction on the target two-dimensional graph to obtain a reconstructed planned path, specifically including:

[0088] Use the following formula to calculate the centroid of the target two-dimensional graph;

[0089] Xc = ∑Xi / N, Yc = ∑Yi / N;

[0090] where, (Xc, Yc) are the coordinates of the centroid of the target two-dimensional graph, (Xi, Yi) are the coordinates of the i-th vertex in the target two-dimensional graph, and N represents the number of vertices in the target two-dimensional graph.

[0091] Calculate the angle between the line connecting each vertex in the target two-dimensional graph and the positive X-axis where the centroid is located.

[0092] Arrange each vertex in the target two-dimensional graph in ascending order of the angle to obtain the sorted vertices.

[0093] Connect each sorted vertex in sequence to obtain the reconstructed planned path.

[0094] Perform data patching on the reconstructed planned path to obtain the patched reconstructed planned path, specifically including: when the distance between two adjacent vertices in the reconstructed planned path cannot be divisible by the modulus, then use the two vertices as two patching vertices respectively; patch the coordinates of at least one of the patching vertices with the minimum adjustment amount so that the distance between the two patching vertices can be divisible by the modulus. An exemplary way to determine the distance between adjacent vertices is: based on the corresponding point Q(Xi, Yi) of the envelope graph, according to the distance between the vertices of the reconstructed planned path and Q(Xi, Yi), place the vertices in the corresponding neighborhood of Q(Xi, Yi). Analyze the distance between adjacent vertices according to the neighborhood points and geometric features.

[0095] Among them, based on the coordinates of each vertex, perform path reconstruction on the target two-dimensional graph to obtain the reconstructed planned path and perform data patching on the reconstructed planned path to obtain the patched reconstructed planned path. The principle is as shown in Figure 7 .

[0096] The principle is:

[0097] By calculating Xc = ∑Xi / N, Yc = ∑Yi / N,

[0098] where: Xc is the X - coordinate of the centroid, Yc is the Y - coordinate of the centroid, Xi is the X - coordinate of the vertex of the two - dimensional graph, Yi is the Y - coordinate of the vertex of the two - dimensional graph, and N is the number of vertices of the two - dimensional graph.

[0099] For the centroid C=(Xc, Yc) of the corresponding two - dimensional graph (i.e., the target two - dimensional graph, including the two - dimensional graph that is already closed or the closed two - dimensional graph obtained through conversion), taking the angle formed by the line segment connecting the vertex and the centroid with the positive direction of the X - axis as θi, as Figure 8 shown, generate a new array Q1 with elements (X i , Y i , θi), and sort Q1 in ascending order according to θi to obtain the ordered array ArrayP. Connecting the elements in ArrayP in sequence is the reconstructed planning path of the graph, as Figure 9 shown;

[0100] As Figure 10 shown, discretize the closed graph for neighborhood division and data patching: split the graph into n two - dimensional points Pi(Xi, Yi), forming the corresponding point set P={P 1 , P 2 , P 3 , …, P n}, and obtain the vertex set Q={Q 1 , Q 2 , Q 3 , Q 4} of the optimal bounding rectangle of the closed graph. If Pi is within the bounding rectangle, the subsequent operations ignore the region corresponding to the Qj. Otherwise, input Pi into the region corresponding to the Qj with the closest relative position, thereby forming 4 point sets, such as Q1(P1), Q2(P2, P3, P4), Q3(P5), Q4(P6).

[0101] According to the common building modulus, usually select an integer multiple of 5 or 10, and calculate in sequence whether the distance between adjacent points can be divisible by the modulus. If not, distribute the difference from the modulus and adjust the corresponding value of Pi to Pi', replacing the corresponding data in the original point set.

[0102] The exemplary way of difference distribution is as follows Figure 11 In the figure on the far right, the right - most side length is 1600.10, which does not meet the integer multiple of the modulus (5 or 10). Therefore, adjust 1600.10 to 1600, and the difference is 0.1. That is, add 0.1 to the Y - coordinates of points P3 and P4, so that the graph meets the modulus requirements, as Figure 12 shown.

[0103] Step 103: input data parameters required for constructing the BIM model.

[0104] Different components are divided into different base categories, such as beams, slabs, columns, shear walls, sidings, etc.

[0105] Certain properties are established for each base class, taking the board as an example:

[0106] Slab{Environment (design environment), Geometry (geometric parameters), Reinforcement (reinforcement conditions), Duration (construction period), Store (storage conditions)}.

[0107] In the design phase, through WPF (Windows Presentation Foundation, user interface framework) such as Figure 13 As shown, or in the form of a database, batch parameters are entered to complete the data parameters, where the data parameters of the board are exemplified as follows Figure 14 shown.

[0108] Step 104: convert the repaired reconstructed planning path and the data parameters into format data that can be called when the BIM model is generated. The format data is ifc format data.

[0109] Taking the board as an example, the Slab class is injected into the repaired reconstruction planning path of the board. After the data is perfected, the injected graphics are output in the ifc format as the data transmission form for the graphics dimensionality upgrade.

[0110] Step 105, calling the format data to generate a BIM model of the building, such as Figure 15 shown.

[0111] In the remaining stages, parameters are entered and read according to the corresponding processes and rules of each link. Network authorization is used to ensure that each link can be operated under existing tools without affecting each other.

[0112] Example 2

[0113] Embodiment 2 of the present invention provides a BIM model generation system for a building, the system comprising:

[0114] A vertex coordinate acquisition module is used to obtain the coordinates of each vertex in the two-dimensional graph of the building;

[0115] The path reconstruction and repair module is used to perform path reconstruction and data repair on the two-dimensional graph based on the coordinates of each vertex to obtain a repaired reconstructed planning path.

[0116] The path reconstruction and patching module specifically includes: a judgment sub-module for judging whether the two-dimensional graph is closed based on the coordinates of each vertex to obtain a judgment result; a graph conversion sub-module for converting the two-dimensional graph into a closed two-dimensional graph if the judgment result is negative; a path reconstruction sub-module for reconstructing the path of the target two-dimensional graph based on the coordinates of each vertex to obtain a reconstructed planned path; the target two-dimensional graph is a two-dimensional graph represented by the judgment result as closed, or a closed two-dimensional graph obtained after conversion; a data patching sub-module for patching the data of the reconstructed planned path to obtain a patched reconstructed planned path.

[0117] A data parameter input module for inputting the data parameters required to construct a BIM model;

[0118] A format conversion module for converting the patched reconstructed planned path and the data parameters into format data that can be called when generating a BIM model;

[0119] A BIM model generation module for calling the format data to generate a BIM model of a building.

[0120] Based on the above embodiments, the advantages of the present invention are as follows:

[0121] The BIM model generation method for a building of the present invention is a BIM model design method based on a two-dimensional graph. In view of the problems of complex modification, slow development progress, and informationization differences in each industrial chain in current BIM modeling, based on traditional design software and management software, an integrated building product model that is efficient, convenient, and more in line with industrial characteristics is created.

[0122] In this specification, each embodiment is described in a progressive manner. The key point of each embodiment is to illustrate the differences from other embodiments. The same or similar parts among the embodiments can be referred to each other. For the device disclosed in the embodiment, since it corresponds to the method disclosed in the embodiment, the description is relatively simple, and the relevant parts can be referred to the description of the method part.

[0123] Specific examples are used in this article to elaborate on the principle and implementation manner of the present invention. The description of the above embodiments is only used to help understand the method and its core idea of the present invention; at the same time, for those of ordinary skill in the art, according to the idea of the present invention, there will be changes in the specific implementation manner and application scope. In summary, the content of this specification should not be construed as a limitation to the present invention.

Claims

1. A method for generating a BIM model of a building, characterized in that, the method comprises the following steps: Obtain the coordinates of each vertex in the two-dimensional graph of the building; Based on the coordinates of each vertex, perform path reconstruction and data patching on the two-dimensional graph to obtain a reconstructed planning path after patching; Enter the data parameters required for building the BIM model; Convert the reconstructed planning path after patching and the data parameters into format data that can be called during BIM model generation; Call the format data to generate the BIM model of the building; The step of performing path reconstruction and data patching on the two-dimensional graph based on the coordinates of each vertex to obtain a reconstructed planning path after patching specifically includes: Based on the coordinates of each vertex, determine whether the two-dimensional graph is closed to obtain a judgment result; If the judgment result is no, convert the two-dimensional graph into a closed two-dimensional graph; Based on the coordinates of each vertex, perform path reconstruction on the target two-dimensional graph to obtain a reconstructed planning path; the target two-dimensional graph is a two-dimensional graph for which the judgment result indicates closure, or a closed two-dimensional graph obtained after conversion; Perform data patching on the reconstructed planning path to obtain a reconstructed planning path after patching.

2. The method for generating a BIM model of a building according to claim 1, characterized in that, the step of determining whether the two-dimensional graph is closed based on the coordinates of each vertex to obtain a judgment result specifically includes: Respectively take each vertex as the center of a circle and take half of the tolerance as the radius to draw a circle to obtain a set of circles corresponding to each vertex, and the set of circles includes all vertices within the circle; If the intersection of any two sets of circles is empty, the judgment result is yes, otherwise, the judgment result is no.

3. The method for generating a BIM model of a building according to claim 2, characterized in that, the step of converting the two-dimensional graph into a closed two-dimensional graph specifically includes: Obtain the coordinates of the vertices corresponding to the two sets of circles with non-empty intersections as the first coordinate and the second coordinate respectively; Obtain the coordinates of the vertex with the smallest distance from the first coordinate as the third coordinate, and the coordinates of the vertex with the smallest distance from the second coordinate as the fourth coordinate; Obtain the intersection point of the line where the first coordinate and the third coordinate are located and the line where the second coordinate and the fourth coordinate are located; Replace the vertices corresponding to the two sets of circles with non-empty intersections with the intersection point.

4. The method for generating a BIM model of a building according to claim 1, characterized in that, the step of performing path reconstruction on the target two-dimensional graph based on the coordinates of each vertex to obtain a reconstructed planning path specifically includes: Use the following formula to calculate the centroid of the target two-dimensional graph; Xc = ∑Xi / N, Yc = ∑Yi / N; where, (Xc, Yc) are the coordinates of the centroid of the target two-dimensional graph, (Xi, Yi) are the coordinates of the i-th vertex in the target two-dimensional graph, and N represents the number of vertices in the target two-dimensional graph; Calculate the angle between the line where each vertex in the target two-dimensional graph and the centroid is located and the positive direction of the X-axis; Arrange each vertex in the target two-dimensional graph in ascending order of the included angle to obtain the sorted vertices; Connect each sorted vertex in sequence to obtain the reconstructed planned path.

5. The method for generating a BIM model of a building according to claim 1, characterized in that the data patching of the reconstructed planned path to obtain the patched reconstructed planned path specifically includes: When the distance between two adjacent vertices in the reconstructed planned path cannot be divisible by the modulus, then the two vertices are respectively used as two patching vertices; Patch the coordinates of at least one of the patching vertices with the minimum adjustment amount so that the distance between the two patching vertices can be divisible by the modulus.

6. The method for generating a BIM model of a building according to claim 1, characterized in that the data parameters include the design environment, geometric parameters missing in the two-dimensional graph, reinforcement parameters, construction period parameters, and storage parameters.

7. The method for generating a BIM model of a building according to claim 1, characterized in that the format data is data in ifc format.

8. A BIM model generation system for a building, characterized in that the system applies the method described in any one of claims 1-7, and the system includes: A vertex coordinate acquisition module for acquiring the coordinates of each vertex in the two-dimensional graph of the building; A path reconstruction and patching module for performing path reconstruction and data patching on the two-dimensional graph based on the coordinates of each vertex to obtain the patched reconstructed planned path; A data parameter entry module for entering the data parameters required for building the BIM model; A format conversion module for converting the patched reconstructed planned path and the data parameters into format data that can be called when generating the BIM model; A BIM model generation module for calling the format data to generate the BIM model of the building; The path reconstruction and patching module specifically includes: A judgment sub-module for judging whether the two-dimensional graph is closed based on the coordinates of each vertex to obtain a judgment result; A graphic conversion sub-module for converting the two-dimensional graph into a closed two-dimensional graph if the judgment result is negative; A path reconstruction sub-module for performing path reconstruction on the target two-dimensional graph based on the coordinates of each vertex to obtain the reconstructed planned path; the target two-dimensional graph is the two-dimensional graph represented by the judgment result as closed, or the closed two-dimensional graph obtained after conversion; A data patching sub-module for performing data patching on the reconstructed planned path to obtain the patched reconstructed planned path.

Images