Road clearance inspection and data extraction method based on BIM software

Abstract

The application discloses a road clearance checking and data extraction method based on BIM software, and comprises the following steps: 1, a three-dimensional model capable of being processed in a BIM software environment is established; 2, a corresponding limit envelope is formed according to different road sections in the road, and a corresponding limit entity is established; 3, an intersection entity of the three-dimensional model and each limit entity is solved; when the intersection entity is empty, it is indicated that the building limit is not invaded; when the intersection entity is not an empty set, the intersection entity related data is extracted and processed to form a complete intersection entity array set; and 4, the intersection entity array set is output to an operator. The application can realize quantitative checking of road clearance in the road design process and intelligent design.

Description

Technical Field

[0001] The present invention relates to the technical field of computer-aided design, and in particular to a road clearance inspection and data extraction method based on BIM software. Background Art

[0002] In existing technology, road clearance checks are performed on two-dimensional drawings. Bridge professionals provide structural information to road professionals, who then manually verify the designed clearances by determining the most unfavorable clearance point. Because the most unfavorable point is subjectively determined by the designer, errors or omissions are inevitable, leading to design iterations between the various disciplines and reducing design efficiency.

[0003] Currently, many road engineering software are exploring BIM forward design. BIM technology provides designers with three-dimensional viewing capabilities. Especially in the design of grade-separated intersections, it provides the possibility of roaming from an intuitive vehicle perspective, which can qualitatively test whether the bridge structure meets the clear height requirements.

[0004] Although existing software can realize the automatic clearance check function, it has functional defects and can only realize qualitative error reporting function, but cannot achieve functions such as precise positioning and quantitative data extraction. In addition, qualitative judgment cannot significantly improve design efficiency and cannot provide quantitative design guidance for optimized design.

[0005] Due to the above-mentioned defects in the existing technology, when designers receive an intrusion prompt, they still need to provide structural parameters, manually calculate the intrusion amount, and readjust the road model.

[0006] Therefore, how to realize quantitative verification of road clearance inspection during road design and realize intelligent design has become a technical problem that technical personnel in this field urgently need to solve. Summary of the Invention

[0007] In view of the above-mentioned defects of the prior art, the present invention provides a road clearance inspection and data extraction method based on BIM software, the purpose of which is to realize quantitative verification of road clearance inspection during the road design process and realize intelligent design.

[0008] To achieve the above-mentioned purpose, the present invention discloses a road clearance inspection and data extraction method based on BIM software, comprising the following steps:

[0009] Step 1: Collect data on the roads that require road clearance inspection and data extraction, and create a 3D model that can be processed in a BIM software environment;

[0010] Step 2: forming corresponding limit envelopes and establishing corresponding limit entities according to different road sections;

[0011] Step 3: In a three-dimensional environment of a BIM software environment, solving the intersection entity between the three-dimensional model and each of the bounding entities;

[0012] When the intersection entity is empty, it means that the building limit is not invaded and all processes are completed directly;

[0013] When the intersection entity is not an empty set, extracting and processing data related to the intersection entity to form a complete intersection entity array set;

[0014] Step 4: Output the intersection entity array set to the operator.

[0015] Preferably, in step 2, the method for establishing the limit envelope of each road section is as follows:

[0016] According to whether each road section is a case where superelevation is not set or a case where superelevation is set, different methods are used to form the corresponding limit envelope;

[0017] If the road section does not have superelevation, the upper boundary line of the corresponding limit envelope shall be a horizontal line, and the boundary lines on both sides shall be perpendicular to the horizontal line;

[0018] If the road section is superelevated, the upper boundary line of the corresponding limit envelope shall be parallel to the superelevation transverse slope of the road surface, and the boundary lines on both sides shall be perpendicular to the superelevation transverse slope of the road surface;

[0019] Connect each calculated pile number at each vertex of the corresponding limit envelope along the mileage pile number sequence to establish a limit entity.

[0020] More preferably, each of the bounding entities is constituted as follows:

[0021] If the road section does not have superelevation, the bottom elevation of the lower edge is hi×max(W L ,W R ), where h is the design elevation of the road centerline, i is the road crown slope, W L is the width from the left building limit to the road centerline, W R It is the width from the right building limit to the road centerline, and the bottom surface of the lower edge is the curved surface formed by subtracting the effect of the cross slope elevation from the road surface;

[0022] If the road section in question is one in which superelevation is set, the bottom surface of the lower edge coincides with the road surface;

[0023] If the road section does not have superelevation, the top surface of the upper edge is parallel to the bottom surface of the lower edge, and the vertical distance between the top surface of the upper edge and the bottom surface of the lower edge is H+i×max(W L ,W R ), where H is the headroom, i is the road crown slope, and WL is the width from the left building limit to the road centerline, W R The width from the right building limit to the road centerline;

[0024] If the road section is set to superelevation, the vertical distance between the top surface of the upper edge and the bottom surface of the lower edge is the clearance height H, then the left and right side surfaces are perpendicular to the bottom surface of the lower edge, and two symmetrical triangular columns are cut off on the left and right sides of the top surface of the upper edge according to the vertex width value entered by the user.

[0025] More preferably, in step 3, the intersection entity array includes block sequence number, block starting pile number, block ending pile number, intrusion height information process array set, left intrusion width information process array set and right intrusion width information process array set.

[0026] More preferably, the process of extracting and processing the data related to the intersection entity to form a complete array of the intersection entity comprises the following steps:

[0027] Step 3.1, numbering and naming each block according to the size of the starting pile number in the intersection entity from small to large, wherein the name of each block includes the block sequence number, the block starting pile number and the block ending pile number in sequence;

[0028] Step 3.2: According to the calculation step length selected by the user, from the starting stake to the ending stake of each block, a cross section corresponding to the entity of the corresponding block is made at each stake, and the normal vector of each cross section is parallel to the tangent vector of the route;

[0029] Step 3.3, completing the bounding envelope of each section;

[0030] Step 3.4: Draw a perpendicular line from each endpoint of each section to the corresponding upper boundary line of the building limit. When the perpendicular line falls on the extension line of the upper boundary line, take the distance from the endpoint to the intersection of the perpendicular line and the corner cutting edge line, record the maximum vertical distance, and include it in the intrusion height information process array set;

[0031] Step 3.5: Draw auxiliary lines parallel to the lower edge boundary line from each end point of each section to the building limit boundary line on the side where the section is located, record the maximum horizontal distance, and include it in the left intrusion width information process array set or the right intrusion width information process array set;

[0032] Step 3.6: analyzing the intrusion height information process array set, the left intrusion width information process array set, and the right intrusion width information process array set;

[0033] Reading the maximum value of all the maximum vertical distances and the corresponding stake number, drawing the two-dimensional limit envelope and block solid cross section corresponding to the stake number, and counting them into the intrusion height information array;

[0034] The maximum value of all the maximum lateral distances and the corresponding stake number are read and respectively counted into the corresponding left intrusion width information array and the corresponding right intrusion width information array.

[0035] More preferably, in step 3.1, when there are two or more blocks with the same starting pile number, the blocks are numbered in sequence according to the distance from the upper edge boundary line, and in the order of left first and right later.

[0036] More preferably, in step 3.3, the boundary envelope of each of the cross sections is composed of an upper edge boundary line, a chamfered edge line, a left edge line, a right edge line and a lower edge boundary line in a two-dimensional boundary.

[0037] More preferably, in step 3.5, when the left side intrusion occurs, the maximum lateral distance is counted into the left side intrusion width information process array set;

[0038] When the right side intrusion occurs, the maximum lateral distance is counted into the right side intrusion width information process array set.

[0039] More preferably, in step 3.4, the maximum vertical distances included in the intrusion height information process array are indexed by corresponding block numbers and stake numbers;

[0040] In step 3.5, the maximum lateral distances included in the left intrusion width information process array set or the right intrusion width information process array set are indexed by the corresponding block number and stake number.

[0041] More preferably, the maximum value of all the maximum vertical distances and the corresponding pile number are counted into the intrusion height information array in the format of: pile number (H max ), H max , vertical intrusion contour line;

[0042] The maximum value of all the maximum lateral distances and the corresponding pile number are counted into the corresponding left intrusion width information array in the format of: pile number (W 左max ), W 左max , left lateral intrusion contour line;

[0043] The maximum value of all the maximum lateral distances and the corresponding pile number are counted into the corresponding right intrusion width information array in the format of: pile number (W 右max ), W 右max , the right side laterally intrudes into the contour line.

[0044] Beneficial effects of the present invention:

[0045] The application of the present invention can more strictly implement the specification requirements, and the limit control parameters can be modified according to different road grades in the specification.

[0046] The present invention can automatically traverse and check whether there are any structures invading the road construction limit, and accurately locate the position of the intruding limit.

[0047] The present invention can provide two-dimensional intrusion data with form-plus-graphic feedback information, which is convenient for designers to quickly grasp the intrusion location, the pile number range involved in the intrusion, and the size of the vertical intrusion and the horizontal intrusion.

[0048] The present invention can simultaneously provide a three-dimensional intersection entity, which helps designers to more intuitively grasp the intrusion form and optimize the design.

[0049] The concept, specific structure and technical effects of the present invention will be further described below in conjunction with the accompanying drawings to fully understand the purpose, characteristics and effects of the present invention. BRIEF DESCRIPTION OF THE DRAWINGS

[0050] Figure 1 A schematic diagram illustrating establishing bounding entities for different road sections according to an embodiment of the present invention is shown.

[0051] Figure 2 A schematic diagram of a two-dimensional bounded envelope and intersection block solid cross-section in one embodiment of the present invention is shown.

[0052] Figure 3 FIG. 1 shows an intrusion information graphic according to an embodiment of the present invention. DETAILED DESCRIPTION

[0053] Example

[0054] like Figures 1 to 3 As shown in the figure, the road clearance inspection and data extraction method based on BIM software includes the following steps:

[0055] Step 1: Collect data on the roads that require road clearance inspection and data extraction, and create a 3D model that can be processed in a BIM software environment;

[0056] Step 2: forming corresponding limit envelopes and establishing corresponding limit entities according to different road sections;

[0057] Step 3: In the 3D environment of the BIM software environment, solve the intersection entity between the 3D model and each bounding entity;

[0058] When the intersection entity is empty, it means that the building limit is not invaded and all processes are completed directly;

[0059] When the intersection entity is not an empty set, extract and process the data related to the intersection entity to form a complete intersection entity array set;

[0060] Step 4: Output the intersection entity array set to the operator.

[0061] In actual applications, the operator can quickly locate the block position that needs to be viewed in the intrusion height information process array by entering the stake number, which is more convenient for three-dimensional viewing.

[0062] In some embodiments, in step 2, the bounding envelope of each road segment is established as follows:

[0063] Different methods are used to form the corresponding limit envelope according to whether each road section is set without superelevation or with superelevation;

[0064] If the road section does not have superelevation, the upper boundary line of the corresponding limit envelope shall be a horizontal line, and the boundary lines on both sides shall be perpendicular to the horizontal line;

[0065] If the road section is set to superelevation, the upper edge boundary line of the corresponding limit envelope should be parallel to the superelevation transverse slope of the road surface, and the boundary lines on both sides should be perpendicular to the superelevation transverse slope of the road surface;

[0066] Connect each calculated pile number at each vertex of the corresponding limit envelope along the mileage pile number sequence to establish a limit entity.

[0067] In some embodiments, each bounding entity is constructed as follows:

[0068] If the road section does not have superelevation, the bottom elevation of the lower edge is hi×max(W L ,W R ), where h is the design elevation of the road centerline, i is the road crown slope, and W L is the width from the left building limit to the road centerline, W R It is the width from the right building limit to the road centerline, and the bottom surface of the lower edge is the curved surface formed by subtracting the effect of the cross slope elevation from the road surface;

[0069] If the road section is set to superelevation, the bottom surface of the lower edge coincides with the road surface;

[0070] If the road section is not set to superelevation, the top surface of the upper edge is parallel to the bottom surface of the lower edge, and the vertical distance between the top surface of the upper edge and the bottom surface of the lower edge is H+i×max(W L ,W R ), where H is the headroom, i is the road crown slope, and W L is the width from the left building limit to the road centerline, W R The width from the right building limit to the road centerline;

[0071] If the road section is set to superelevation, the vertical distance between the top surface of the upper edge and the bottom surface of the lower edge is the clearance height H, then the left and right side surfaces are perpendicular to the bottom surface of the lower edge, and two symmetrical triangular columns are cut off on the left and right sides of the top surface of the upper edge according to the vertex width value entered by the user.

[0072] In some embodiments, in step 3, the intersection entity array includes a block sequence number, a block start pile number, a block end pile number, an intrusion height information process array set, a left intrusion width information process array set, and a right intrusion width information process array set.

[0073] In some embodiments, the process of extracting and processing data related to the intersection entity to form a complete intersection entity array includes the following steps:

[0074] Step 3.1, number and name each block according to the starting pile number in the intersection entity from small to large, and the name of each block includes the block sequence number, the block starting pile number and the block ending pile number in sequence;

[0075] Step 3.2: According to the calculation step length selected by the user, from the starting stake to the ending stake of each block, a cross section corresponding to the entity of the corresponding block is made at each stake, and the normal vector of each cross section is parallel to the tangent vector of the route;

[0076] Step 3.3: Complete the bounding envelope of each section;

[0077] Step 3.4: Draw a perpendicular line from each end point of each section to the corresponding upper boundary line of the building limit. When the perpendicular line falls on the extension line of the upper boundary line, take the distance from the end point to the intersection of the perpendicular line and the corner cutting edge line, record the maximum vertical distance, and include it in the intrusion height information process array set;

[0078] Step 3.5: Draw auxiliary lines parallel to the lower edge boundary line from each end point of each section to the building limit boundary line on the side where the section is located. Record the maximum lateral distance and include it in the left intrusion width information process array set or the right intrusion width information process array set.

[0079] Step 3.6: analyzing the intrusion height information process array set, the left intrusion width information process array set, and the right intrusion width information process array set;

[0080] Read the maximum value of all maximum vertical distances and the corresponding stake number, draw the two-dimensional limit envelope and block solid section of the corresponding stake number, and include the intrusion height information array;

[0081] The maximum value of all maximum lateral distances and the corresponding stake number are read and respectively counted into the corresponding left intrusion width information array and the corresponding right intrusion width information array.

[0082] For the intersection entity array formed by the above technical means, the operator can call the intrusion height information process array set in the intersection entity array, and use the stake number as the x-axis and the intrusion height as the y-axis to draw the intrusion height information graph, and use the intrusion height information array as the block number, stake number (H max ), H max , the format of the vertical intrusion contour line and the intrusion height information graphic are fed back to the longitudinal section designer for design optimization.

[0083] The operator can also call the left intrusion width information process array set in the intersection entity database, use the pile number as the x-axis and the left intrusion width as the y-axis to draw the left intrusion information graphics, or call the right intrusion width information process array set, use the pile number as the x-axis and the right intrusion width as the y-axis to draw the right intrusion information graphics.

[0084] You can also use the left intrusion width information array as a block number, stake number (W 左max ), W 左max The format of the left side horizontal intrusion contour line and the left side intrusion information graphic and the right side intrusion width information array are divided into block numbers, pile numbers (W 右max ), W 右max The format of the right side horizontal intrusion contour line and the right side intrusion information graphics are fed back to the bridge and culvert span designers for design optimization.

[0085] In some embodiments, in step 3.1, when there are two or more blocks with the same starting pile number, the blocks are numbered in sequence according to the distance from the upper edge boundary line, and in the order of left first and right later.

[0086] In some embodiments, in step 3.3, the bounding envelope of each cross section is composed of an upper boundary line, a chamfered edge line, a left edge line, a right edge line, and a lower boundary line in two dimensions.

[0087] In some embodiments, in step 3.5, when a left-side intrusion occurs, the maximum lateral distance is counted into the left-side intrusion width information process array set;

[0088] When the right side intrusion occurs, the maximum lateral distance is counted into the right side intrusion width information process array set.

[0089] In some embodiments, in step 3.4, the maximum vertical distances of the intrusion height information process array set are indexed by the corresponding block number and stake number;

[0090] In step 3.5, the maximum lateral distances included in the left intrusion width information process array set or the right intrusion width information process array set are indexed by the corresponding block number and stake number.

[0091] In some embodiments, the maximum value of all maximum vertical distances and the corresponding stake number are counted into the height information array in the format of: Stake number (H max ), H max , vertical intrusion contour line;

[0092] The maximum value of all maximum horizontal distances and the corresponding pile number are counted into the corresponding left intrusion width information array in the format of: pile number (W 左max ), W 左max , left lateral intrusion contour line;

[0093] The maximum value of all maximum horizontal distances and the corresponding pile number are counted into the corresponding right intrusion width information array in the format of: pile number (W 右max ), W 右max , the right side laterally intrudes into the contour line.

[0094] The above describes in detail the preferred embodiments of the present invention. It should be understood that those skilled in the art can make numerous modifications and variations based on the concepts of the present invention without inventive effort. Therefore, any technical solutions that can be derived by those skilled in the art through logical analysis, reasoning, or limited experimentation based on the concepts of the present invention and the prior art should be within the scope of protection defined by the claims.

Claims

1. A road clearance inspection and data extraction method based on BIM software; characterized in that: The steps include: Step 1: Collect data on the roads that require road clearance inspection and data extraction, and create a 3D model that can be processed in a BIM software environment; Step 2: Form corresponding bounding envelopes and establish corresponding bounding entities according to different road sections; each bounding entity is constructed as follows: If the road section does not have superelevation, the bottom elevation of the lower edge is hi×max(W L , W R ), where h is the design elevation of the road centerline, i is the road crown slope, W L is the width from the left building limit to the road centerline, W R It is the width from the right building limit to the road centerline, and the bottom surface of the lower edge is the curved surface formed by subtracting the effect of the cross slope elevation from the road surface; If the road section in question is one in which superelevation is set, the bottom surface of the lower edge coincides with the road surface; If the road section does not have superelevation, the top surface of the upper edge is parallel to the bottom surface of the lower edge, and the vertical distance between the top surface of the upper edge and the bottom surface of the lower edge is H+i×max(W L , W R ), where H is the headroom, i is the road crown slope, and W L is the width from the left building limit to the road centerline, W R The width from the right building limit to the road centerline; If the road section is superelevated, the vertical distance between the top surface of the upper edge and the bottom surface of the lower edge is the clearance height H, then the left and right side surfaces are perpendicular to the bottom surface of the lower edge, and two symmetrical triangular prisms are cut off on the left and right sides of the top surface of the upper edge according to the vertex width value entered by the user; Step 3: In a three-dimensional environment of a BIM software environment, solving the intersection entity between the three-dimensional model and each of the bounding entities; When the intersection entity is empty, it means that the building limit is not invaded and all processes are completed directly; When the intersection entity is not an empty set, extracting and processing data related to the intersection entity to form a complete intersection entity array set; Step 4: Output the intersection entity array set to the operator.

2. The method for road clearance inspection and data extraction based on BIM software according to claim 1 is characterized in that: In step 2, the method for establishing the limit envelope of each road section is as follows: According to whether each road section is a case where superelevation is not set or a case where superelevation is set, different methods are used to form the corresponding limit envelope; If the road section does not have superelevation, the upper boundary line of the corresponding limit envelope shall be a horizontal line, and the boundary lines on both sides shall be perpendicular to the horizontal line; If the road section is superelevated, the upper boundary line of the corresponding limit envelope shall be parallel to the superelevation transverse slope of the road surface, and the boundary lines on both sides shall be perpendicular to the superelevation transverse slope of the road surface; Each calculated pile number is connected in sequence along the mileage pile number at each vertex of the corresponding limit envelope to establish a limit entity.

3. The method for road clearance inspection and data extraction based on BIM software according to claim 1 is characterized in that: In step 3, the intersection entity array includes the block sequence number, the block start pile number, the block end pile number, the intrusion height information process array set, the left intrusion width information process array set and the right intrusion width information process array set.

4. The method for road clearance inspection and data extraction based on BIM software according to claim 3 is characterized in that: The process of extracting and processing the data related to the intersection entity to form a complete array of the intersection entity includes the following steps: Step 3.1, numbering and naming each block according to the size of the starting pile number in the intersection entity from small to large, wherein the name of each block includes the block sequence number, the block starting pile number and the block ending pile number in sequence; Step 3.2: According to the calculation step length selected by the user, from the starting stake to the ending stake of each block, a cross section corresponding to the entity of the corresponding block is made at each stake, and the normal vector of each cross section is parallel to the tangent vector of the route; Step 3.3, completing the bounding envelope of each section; Step 3.4: Draw a perpendicular line from each endpoint of each section to the corresponding upper boundary line of the building limit. When the perpendicular line falls on the extension line of the upper boundary line, take the distance from the endpoint to the intersection of the perpendicular line and the corner cutting edge line, record the maximum vertical distance, and include it in the intrusion height information process array set; Step 3.5: Draw auxiliary lines parallel to the lower edge boundary line from each end point of each section to the building limit boundary line on the side where the section is located, record the maximum horizontal distance, and include it in the left intrusion width information process array set or the right intrusion width information process array set; Step 3.6: analyzing the intrusion height information process array set, the left intrusion width information process array set, and the right intrusion width information process array set; Reading the maximum value of all the maximum vertical distances and the corresponding stake number, drawing the two-dimensional limit envelope and block solid cross section corresponding to the stake number, and taking into account the intrusion height information array; The maximum value of all the maximum lateral distances and the corresponding stake number are read and respectively counted into the corresponding left intrusion width information array and the corresponding right intrusion width information array.

5. The method for road clearance inspection and data extraction based on BIM software according to claim 4 is characterized in that: In step 3.1, when there are two or more blocks with the same starting pile number, the blocks are numbered in sequence according to the distance from the upper edge boundary line, and in the order of left first and right later.

6. The method for road clearance inspection and data extraction based on BIM software according to claim 4 is characterized in that: In step 3.3, the boundary envelope of each of the cross sections is composed of an upper boundary line, a chamfered edge line, a left edge line, a right edge line, and a lower boundary line in a two-dimensional boundary.

7. The method for road clearance inspection and data extraction based on BIM software according to claim 4 is characterized in that: In step 3.5, when the left side intrusion occurs, the maximum lateral distance is included in the left side intrusion width information process array set; When the right side intrusion occurs, the maximum lateral distance is counted into the right side intrusion width information process array set.

8. The method for road clearance inspection and data extraction based on BIM software according to claim 4 is characterized in that: In step 3.4, the maximum vertical distances included in the intrusion height information process array are indexed by the corresponding block number and stake number; In step 3.5, the maximum lateral distances included in the left intrusion width information process array set or the right intrusion width information process array set are indexed by the corresponding block number and stake number.

9. The method for road clearance inspection and data extraction based on BIM software according to claim 4 is characterized in that: The maximum value of all the maximum vertical distances and the corresponding pile number are counted into the intrusion height information array in the format of: pile number (H max ), H max , vertical intrusion contour line; The maximum value of all the maximum lateral distances and the corresponding pile number are counted into the corresponding left intrusion width information array in the format of: pile number (W 左max ), W 左max , left lateral intrusion contour line; The maximum value of all the maximum lateral distances and the corresponding pile number are counted into the corresponding right intrusion width information array in the format of: pile number (W 右max ), W 右max , the right side laterally intrudes into the contour line.

Images