Architectural drawing recognition and model building method for building human settlement environment simulation

Abstract

The present invention discloses a method for identifying and modeling architectural drawings suitable for simulating a building human settlement environment, including: parsing a floor drawing in dxf format, constructing a graphical model describing point and line information, and preprocessing it into a standard graphical model of a spanning tree-branch; obtaining a basic loop matrix using a basic association matrix; obtaining a number of mutually nested basic loop polygons based on the basic loop matrix, and obtaining a minimum polygon by polygon shearing, and using the minimum polygon to construct a geometric model of each room on the floor; combining the minimum polygon with architectural information, constructing a basic structure of each floor, shearing the lower floor slab of the upper floor and the upper floor slab of the lower floor along the mutual intersection and the room boundary, constructing the inter-floor slabs of two adjacent floors, and obtaining an integrated building model; parsing the geometric drawings of architectural components including doors, windows, and staircase slabs, and constructing information models of doors, windows, and other architectural components in combination with the height and method of doors and windows. The present invention can realize the rapid construction of a simulation model of a building human settlement environment.

Description

Technical Field

[0001] The present invention relates to the field of building simulation technology, and in particular to a method for identifying and modeling building drawings suitable for building human settlement environment simulation. Background Art

[0002] Automatic reading and analysis of building models is the basis for simulation analysis of building living environment. In engineering software, building models are a type of CAD entity model completed according to design. The recognition and construction of building drawings is a method of identifying or constructing rooms, floors, and the entire building based on the geometric coordinates of building walls, doors and windows in two-dimensional drawings, combined with specific maintenance structure practices, elevations and other information.

[0003] In the current field of building simulation, the entry of building models mainly relies on the drawing tools built into the software platform and manual redrawing. The drawing rules of each software are complicated, and most of them require drawing and filling in building information one by one according to a specific process, and the error tolerance rate in the drawing and setting process is low. For buildings or building complexes with a large overall volume, redrawing and filling in the geometric and physical information of each room is inefficient; and manual repeated drawing and entry will inevitably lead to errors, and simple repetitive work cannot be realized intelligently. Whether in terms of learning costs or time costs in use, it has caused a waste of human resources, which is ultimately reflected in the cost. Summary of the invention

[0004] The purpose of the present invention is to provide a method for architectural drawing recognition and model construction suitable for building human settlement environment simulation in view of the technical defects existing in the prior art. The method is a method for architectural drawing recognition and model construction based on computational geometry and graph algorithms, and is suitable for simulation calculation of building human settlement environment with thermal environment as the main body.

[0005] The technical solution adopted to achieve the purpose of the present invention is:

[0006] The method for identifying and modeling architectural drawings suitable for simulating building human settlement environments comprises the following steps:

[0007] S1. Parse the floor plan in dxf format, read the graphic element information in the floor plan, and build a graphic model describing point and line information based on the graphic element information;

[0008] S2. Preprocess the graph model and organize it into a standard graph model of spanning tree-residual branches;

[0009] S3. Use the basic incidence matrix A of the standard graph model to obtain the basic loop matrix Cf of the standard graph model; the basic incidence matrix describes the connection relationship between points and edges in the standard model, and the basic loop matrix describes the relationship between the loop and edges in the standard model;

[0010] S4. Based on the basic loop matrix Cf of the standard graph model, several mutually nested basic loop polygons are obtained, and the basic loop polygons are sheared from each other by using the intersection and union calculation of geometric figures until there is no intersection between the polygons, and the minimum polygon is obtained. The geometric model of each room in the floor is constructed according to the minimum polygon;

[0011] S5. The minimum polygon without intersection obtained by mutually cutting the basic loop polygons of each floor drawing is combined with the building information to construct all the basic structures of each floor; through the intersection and union calculation of geometric figures, the lower floor slab of the upper layer and the upper floor slab of the lower layer are cut along the intersection points and room boundaries, and the minimum polygon without intersection obtained by cutting is used to construct the inter-layer slabs of two adjacent floors to obtain an integrated building model;

[0012] S6. Analyze the geometric drawings of other building components including doors, windows, staircase floors, etc., and construct information models of doors, windows and other building components by combining their heights and construction methods.

[0013] The present invention will automatically regularize the two-dimensional data of floors, use computational geometry methods and graph algorithms to automatically analyze the room structure, construct the basic enclosure structure of each floor, and then merge the floors through splicing calculations of the inter-layer floor slabs to construct an integrated building model, and finally read other building components such as doors and windows; through graph data processing, room recognition, floor splicing and other means, the rapid construction of the building human living environment simulation model can be achieved, reducing the requirements for technical personnel's drawing work.

[0014] The present invention utilizes two-dimensional graphics processing algorithms and graph model algorithms to realize the construction of three-dimensional models such as graph data processing, room recognition, and enclosure structure splicing. Through effective data preprocessing, the accuracy requirements for the drawing process can be reduced to prevent the continuous transmission of drawing errors; through automated room recognition and building enclosure structure splicing, combined with enclosure structure practices, the repetitive work of technicians can be greatly reduced; thus, a simulation model of the building human settlement environment can be constructed quickly and accurately, reducing the time cost and learning cost in the model entry stage. BRIEF DESCRIPTION OF THE DRAWINGS

[0015] Figure 1 It is a UML class diagram of the building model construction program of the present invention.

[0016] Figure 2 It is a flow chart of the architectural drawing recognition and model building method of the present invention.

[0017] Figure 3 It is a flow chart of the polygon cutting program of the present invention.

[0018] Figure 4 It is a basic circuit analysis schematic diagram of the present invention.

[0019] Figure 5 It is a schematic diagram of the polygon shearing process of the present invention.

[0020] Figure 6 It is the room-edge adjacency representation of the present invention.

[0021] Figure 7 It is a schematic diagram of the shearing of the interlayer floor slab of the present invention. DETAILED DESCRIPTION

[0022] The present invention will be further described in detail below in conjunction with the accompanying drawings and specific embodiments. It should be understood that the specific embodiments described herein are only used to explain the present invention and are not used to limit the present invention.

[0023] The embodiment of the present invention first parses the two-dimensional data of the CAD drawings of each floor into a graphic model, and then parses it into a geometric model of each room through the intersection calculation of the plane area and the graphic algorithm, and then combines the enclosure structure and building elevation information to construct an integrated basic building model. After reading the building components such as building doors and windows, the analysis and construction of the complete building model is realized.

[0024] Figure 1 The class diagram for the building model construction program shows the data structure and organization of the building model recognition process. Figure 1 As shown in the figure, the building data model consists of different levels such as envelope, room, layer, and building, that is, a single building consists of several floors, a floor consists of several rooms, and a room consists of multiple envelopes; among them, the envelope derives different types such as floor, wall, door, and window; the derived envelope types have corresponding geometric structure types: the horizontal envelope types, such as the empty floor (EmptyFloor) where the floor and stairwell are located, correspond to two-dimensional plane polygons (Polygon2D); walls, doors, windows, etc. correspond to two-dimensional parallel straight lines (Line);

[0025] See also Figure 1 As shown, Figure 1 In the example, DXFReader represents a program for parsing drawings according to the DXF format drawing documents published by AutoCAD; IncidenceMatrix is ​​a basic association matrix construction program for the drawing; WallType and Material represent the method of building maintenance structure and the materials used in the method, respectively.

[0026] The method for identifying and modeling architectural drawings applicable to building human settlement environment simulation according to an embodiment of the present invention comprises the following steps:

[0027] S1. Parse the floor plan in dxf format, read the primitive information in the floor plan, and construct a graphic model describing the point and line information according to the primitive information; the primitive information includes points, lines, and polylines in the floor plan;

[0028] S2. Preprocess the graph model and organize it into a standard graph model of spanning tree-residual branches;

[0029] S3. Use the basic incidence matrix A of the standard graph model to obtain the basic loop matrix Cf of the standard graph model; the basic incidence matrix describes the connection relationship between points and edges in the standard model, and the basic loop matrix describes the relationship between the loop and edges in the standard model;

[0030] S4. Based on the basic loop matrix Cf of the standard graph model, several mutually nested basic loop polygons are obtained. The basic loop polygons are sheared from each other by using the intersection and union calculation of geometric figures until there is no overlap or intersection between the polygons. The minimum polygon, i.e., the minimum loop, is obtained. The geometric model of each room on the floor is constructed based on the minimum polygon.

[0031] S5. Combine the minimum polygons without intersection obtained by mutually cutting the basic loop polygons of each floor drawing with the building information (such as floor elevation, floor height, and enclosure structure method) to construct all the basic structures of each floor, including rooms, walls, and upper and lower floors;

[0032] Through the intersection and union calculation of geometric figures, the lower floor slab of the upper layer and the upper floor slab of the lower layer are cut along their intersection points and room boundaries, and then the minimum polygon without intersection obtained by cutting is used to construct the inter-layer slabs of two adjacent floors to obtain an integrated building model;

[0033] S6. Analyze the geometric drawings of other building components including doors, windows, staircase floors, etc., and construct information models of doors, windows and other building components based on their heights and construction methods.

[0034] In an embodiment of the present invention, the standard graph model is a standard graph model of a single-story building, which refers to a graph data structure stored in a data format defined in graph theory and sorted in a spanning tree-co-branch order. There should be no intersections and geometrically identical nodes or line segments in the standard graph model.

[0035] Exemplarily, in step S2, the step of preprocessing the graph model is to interrupt and remove the intersecting and overlapping line segments in the graph model, then use the Kruskal algorithm to find the spanning tree of the graph model, use the depth-first search algorithm to traverse the nodes and edges of the spanning tree, and number the nodes and edges, so as to organize the graph model into a standard model of spanning tree-residual branches, that is, a standard graph structure Graph. Specifically, the standard graph model is established or formed through the following steps:

[0036] S21. Analysis:

[0037] Parse a single CAD drawing or the floor where the floor geometry structure is located, and obtain the plane line segment primitives and endpoint coordinate data corresponding to each wall in the floor.

[0038] S23. Arrangement:

[0039] On the premise of maintaining the original endpoint-segment connection relationship, merge the endpoints within the minimum allowable error, retain a number of valid numbers to ignore the drawing error; store it as a graph structure Graph in graph theory in the format of a list or undirected graph adjacency list; loop through the graph Graph, interrupt the intersecting segments at the intersection, interrupt the overlapping parallel segments at the endpoints, and remove completely repeated segments.

[0040] S23. Sorting:

[0041] Use Kruskal algorithm to traverse the endpoints of the graph and find the minimum spanning tree of the graph. The line segments in the spanning tree are called branches, and the line segments outside the spanning tree are called residual branches; traverse the graph again with depth-first search, number the nodes and edges along the search order, and form a standard graph model.

[0042] Exemplarily, in step S3, using the basic association matrix A of the standard graph model to obtain the basic loop matrix Cf of the standard graph model is a pre-step of parsing the single-floor room geometric model by the standard graph model, and includes the steps of:

[0043] Step S31. Construct the basic association matrix A:

[0044] The basic incidence matrix describes the connection relationship between points and edges in the standard model Graph. Starting from the node numbered 0, a basic incidence matrix A=[A1|A2] in the order of branches and co-branches can be constructed by the following formula, where A1 only contains the edges in the spanning tree obtained by the Kruskal algorithm in 1, and A2 contains other co-branch edges:

[0045]

[0046] Step S32. Calculate the basic loop matrix Cf:

[0047] The basic loop matrix describes the relationship between each ring loop and edge in the standard model Graph, where each row represents a loop and the column is the edge of the corresponding loop. Similar to the construction of the A matrix, the basic loop matrix Cf is constructed in the order of tree branches and co-branches, so that Cf = [Cf1|Cf2], and Cf1 and Cf2 can be obtained by the following formulas respectively; where I is the unit matrix, and the order is the same as the number of co-branches;

[0048]

[0049] Among them, A1, A2 are sub-matrices of the basic incidence matrix; Cf1, Cf2 are sub-matrices of the basic loop matrix; A1, Cf1 are matrices describing the relationship between line segments in the spanning tree; A2, Cf2 are matrices describing the "residual branch" line segments of the spanning tree;

[0050] Exemplarily, in step S4, based on the basic loop matrix Cf of the standard graph model, a number of mutually nested basic loop polygons are obtained, which is a step for parsing the geometric model of a single-story room. The geometric model of a single-story room refers to a series of polygonal areas that share some nodes and edges but do not have a containment / intersection relationship. Figure 4 The parsing process of a floor plan drawing is given in the figure, that is, the process of the graph model from the floor plan to the basic loop polygon (forming four polygons) and finally obtaining the minimum polygon (forming four minimum polygons). Specifically, the polygon parsing area is achieved through the following steps:

[0051] Step S41. Generate basic loop polygon:

[0052] According to the basic loop matrix, the edges are read loop by loop to obtain the polygons corresponding to the loops described in Cf. Figure 4 A possible method of generating basic loop polygons is described in the figure. The number of polygons is the same as the number of rings in the graph, but the generated polygon loops are still highly random, and there are intersections between different basic loop polygons.

[0053] Step S42. Cut the basic loop polygon to obtain the minimum loop (minimum polygon):

[0054] Loop through all basic loop polygons. If there are two polygons P0 and P1 that satisfy Then polygon clipping is performed, recorded as P0-P1=ΔP, ΔP is the intersection of two polygons. The clipping between polygons is performed until the intersection between each polygon is an empty set.

[0055] During the mutual shearing process of the polygons, the edge sorting process is first performed, that is, the intersecting and overlapping edges of the intersection polygons are interrupted and removed; then the shearing process is performed, that is, through shearing edge identification, three types of line sets are identified: the common edges of the two polygons form the line set L', the edges of the polygon P0 contained in the polygon P1 form the line set L0', and the edges of the polygon P1 contained in the polygon P0 form the line set L1'; then the three types of line sets are judged separately, and the edges in the line sets L', L0', and L1' are added or removed from the polygon P0 and the intersection polygon ΔP, and finally the polygon shearing operation is realized to obtain the shearing result, that is, the sheared P0 and the intersection polygon ΔP. Figure 5 This is a schematic diagram of the polygon clipping process, see Figure 5 .

[0056] The mutual shearing process of polygons is specifically described as follows: Figure 3 The resulting polygon set is called the minimum polygon set; see Figure 3 , the steps are:

[0057] First, determine the intersection relationship of the polygons to see whether the two polygons have an intersection within the extreme values ​​of the X and Y directions. If not, end and return ΔP;

[0058] If yes, clean up the edges of the two polygons, that is, break the corresponding line segments of the two polygons at the intersection. Then find the overlapping and parallel edges of the two polygons to form a collinear set L', and determine whether the two polygons have completely overlapping edges (that is, whether the collinear set L' contains all the edges of polygon P1). If yes, remove the line set L' from polygon P0, add the line set L' to the intersection polygon ΔP, and then end and return ΔP;

[0059] If it is not a completely repeated edge, then determine whether there is an "edge" that is completely contained by the other side. If there is a completely contained edge, first obtain all the edges of polygon P0 contained by polygon P1 to form line set L0', polygon P0 removes line set L0', then obtain all the edges of polygon P1 contained by polygon P0 to form line set L1', polygon P0 removes line set L1', and the intersection of the two polygons ΔP adds line set L1' and line set L0'. Then determine whether line set L0' is an empty set. If so, polygon P0 removes line set L', polygon P0 adds line set L', then ends and returns ΔP;

[0060] If not, obtain the point set N' from the collinear set L', and then determine whether there is a point of size 1 in the adjacency list of polygon P0 to point set N'. If so, remove the line segment corresponding to the adjacency list of polygon P0, and then return to the step of determining whether there is a point of size 1 in the adjacency list of polygon P0 to point set N';

[0061] Otherwise, terminate and return ΔP.

[0062] In the embodiment of the present invention, the minimum loop (minimum polygon) is the geometric data structure of the room and the horizontal enclosure structure; the line segment in the minimum loop (minimum polygon) is the geometric data structure of the wall.

[0063] In the embodiment of the present invention, after the room model is constructed by the minimum loop, the aforementioned step S5 is performed. In step S5, the adjacency list (Adj, hereinafter referred to as the adjacency list) of the room-enclosing structure is identified, the adjacency list is traversed to construct the inner and outer walls, and then the two floors are cut and merged by the adjacent floor slabs to obtain an integrated basic building model.

[0064] In the embodiment of the present invention, the integrated basic building model refers to building structures such as walls (Wall), floors (Floor), etc., which do not overlap geometrically; that is, the building envelope (Envelope) components shared by adjacent rooms (Room), and the pointers in the computer memory point to the building model of the same storage address.

[0065] Exemplarily, constructing the integrated basic building model is achieved by the following steps:

[0066] Step S51. Construct each floor and the rooms on the floor:

[0067] A single layer consists of several rooms, and a single room consists of a wall, an upper floor, and a lower floor. The outdoor environment is designated as room 0, and the directions of the outer walls, upper floor, and lower floor are uniformly from the rooms on the floor to room 0, and the inner walls are from the rooms with smaller numbers to the rooms with larger numbers.

[0068] Among them, when constructing each floor and the rooms on the floor, first, the minimum loop (minimum polygon) is used as the geometric data structure to construct the room and horizontal enclosure structure objects. Secondly, the (polygon-edge) adjacency list is used to construct classified internal and external walls, and the line segment is used as the geometric data structure to construct the wall object.

[0069] Specifically, the steps for constructing each floor and the rooms on the floor are as follows:

[0070] Construct a blank new floor; construct the initial room, the lower floor of the room, and the upper floor with the minimum polygon set as the geometric structure of the plane; construct a directed graph adjacency list with a single minimum polygon as the "node" and the line segment of the polygon as the "edge"; traverse the adjacency list, if the "edge" has two nodes pointing to it, use the line segment as the geometric structure and construct it as an inner wall; traverse the adjacency list, if the "edge" has one and only one node pointing to it, construct it as an outer wall; Figure 6 is a schematic diagram of the adjacency list data structure. Figure 4 Taking the floor plan in as an example, the adjacency list data structure includes multiple different rooms / polygons / nodes R1, R2, R3, R4, each room / polygon / node is defined by a corresponding enclosure structure / line segment / edge, and the enclosure structure / line segment / edge is represented by a digital number.

[0071] Step S52: Merge adjacent floors:

[0072] Figure 7 The merging process of the inter-floor slabs of adjacent floors is shown. This merging process also depends on Figure 3 and Figure 5 The polygon clipping procedure is as follows: Figure 3 , Figure 5 as well as Figure 7 As shown, the steps include:

[0073] The number of the lower floor is smaller, and vice versa; loop through the adjacent floors L0 and L1, if they do not belong to the same floor, the room R L0 and R L1 The geometric model P L0 and P L1 There is an intersection, denoted by P ΔL ;

[0074] Room R belongs to floor L0 L0 The upper floor geometry is changed to P L0 -P ΔL ;

[0075] Room R belongs to floor L0 L0 The geometry of the lower floor slab is changed to P L1 -P ΔL ;

[0076] P ΔL Build a new floor F for the geometry ΔL , new floor F ΔL Connecting rooms.

[0077] The traversal ends when there is no intersection between the geometric models of the upper slab and the lower slab.

[0078] In the embodiment of the present invention, in step S6, the geometric drawings of other building components including doors, windows, and staircase floors are parsed, and the door and window information model is constructed in combination with the door and window heights and construction method information. The exemplary steps are as follows:

[0079] Draw the door / window top view on a separate drawing in the form of a plane straight line, and obtain several line segments after analysis. If there is a geometric structure of the wall (Wall) that completely contains the line segment L, then use the line segment L as the geometric structure to construct the door / window information model.

[0080] Through the above steps, the architectural model has been converted from the design parameters in the drawings and tables into a data model of the software platform and programming platform. After that, it can be further combined with the simulation algorithms of various systems in the building interior to play a role.

[0081] The basic principles and main features of the present invention and the advantages of the present invention are shown and described above. It is obvious to those skilled in the art that the present invention is not limited to the details of the above exemplary embodiments, and the present invention can be implemented in other specific forms without departing from the spirit or basic features of the present invention.

[0082] Therefore, no matter from which point of view, the embodiments should be regarded as illustrative and non-restrictive, and the scope of the present invention is limited by the appended claims rather than the above description. Therefore, it is intended that all changes falling within the meaning and scope of the equivalent elements of the claims are included in the present invention, and any figure signs in the claims should not be regarded as limiting the claims involved.

[0083] In addition, it should be understood that although the present specification is described according to implementation modes, not every implementation mode contains only one independent technical solution. This description of the specification is only for the sake of clarity. Those skilled in the art should regard the specification as a whole. The technical solutions in each embodiment may also be appropriately combined to form other implementation modes that can be understood by those skilled in the art.

Claims

1. A method for identifying and modeling architectural drawings suitable for simulating building human settlement environments, characterized in that: Includes steps: S1. Parse the floor plan in dxf format, read the graphic element information in the floor plan, and build a graphic model describing point and line information based on the graphic element information; S2. Preprocess the graph model and organize it into a standard graph model of spanning tree-residual branches; S3. Use the basic incidence matrix A of the standard graph model to obtain the basic loop matrix Cf of the standard graph model; the basic incidence matrix describes the connection relationship between points and edges in the standard model, and the basic loop matrix describes the relationship between the loop and edges in the standard model; S4. Based on the basic loop matrix Cf of the standard graph model, several mutually nested basic loop polygons are obtained, and the basic loop polygons are sheared from each other by using the intersection and union calculation of geometric figures until there is no intersection between the basic loop polygons, and the minimum polygon is obtained. The geometric model of each room in the floor is constructed according to the minimum polygon; S5. The minimum polygon without intersection obtained by mutually cutting the basic loop polygons of each floor drawing is combined with the building information to construct all the basic structures of each floor; through the intersection and union calculation of geometric figures, the lower floor slab of the upper layer and the upper floor slab of the lower layer are cut along the intersection points and room boundaries, and the minimum polygon without intersection obtained by cutting is used to construct the inter-layer slabs of two adjacent floors to obtain an integrated building model; S6. Analyze the geometric drawings of other building components including doors, windows, staircase floors, etc., and construct information models of doors, windows and other building components based on the height and construction information of doors and windows.

2. The architectural drawing recognition and model building method suitable for building human settlement environment simulation according to claim 1, characterized in that: In step S1, the graphic element information includes points, lines, and polylines in the floor plan.

3. The architectural drawing recognition and model building method suitable for building human settlement environment simulation according to claim 1, characterized in that: In step S2, the step of preprocessing the graph model is to interrupt and remove the intersecting and overlapping line segments in the graph model, then use the Kruskal algorithm to find the spanning tree of the graph model, use the depth-first search algorithm to traverse the nodes and edges of the spanning tree, and number the nodes and edges at the same time, so as to organize the graph model into a standard graph model of spanning tree-residual branches.

4. The architectural drawing recognition and model building method for building human settlement environment simulation according to claim 1, characterized in that: In step S4, based on the basic loop matrix Cf in step S3, a graphic cutting algorithm is used to identify the minimum loop of a single floor drawing, that is, the minimum polygon; The mutual clipping process of polygons is as follows: first, the edge sorting process is performed, that is, the intersecting and overlapping edges of the intersection polygons are interrupted and removed; then the clipping process is performed, that is, three types of line sets are identified through clipping edge identification: the common edges of the two polygons form the line set L', the edges of the polygon P0 contained in the polygon P1 form the line set L0', and the edges of the polygon P1 contained in the polygon P0 form the line set L1'; then the three types of line sets are judged separately, and the edges in the line sets are added or removed from the polygon P0 and the intersection polygon ΔP, and finally the polygon clipping operation is implemented to obtain the clipping result, that is, the clipped polygon P0 and the intersection polygon ΔP.

5. The architectural drawing recognition and model building method suitable for building human settlement environment simulation according to claim 1, characterized in that: In step S5, an integrated basic building model is constructed, which specifically includes: S51. Construct each floor and the rooms on each floor: A single floor consists of several rooms, and a single room consists of walls, upper floors, and lower floors. The outdoor environment is agreed to be room 0, and the directions of the external walls, upper floors, and lower floors are uniformly from the rooms on the floor to room 0, and the internal walls are from the rooms with smaller numbers to the rooms with larger numbers. S511. Construct a blank new floor; construct the initial room, the lower floor of the room, and the upper floor with the minimum polygon set as the geometric structure of the plane; S512. Construct a directed graph adjacency list with a single minimum polygon as a node and the line segments of the polygon as edges; S513. traverse the adjacency table, if there are two nodes pointing to the edge, then use the line segment as a geometric structure and construct it as an inner wall; S514. Traverse the adjacency list, if the edge has only one node pointing to it, then it is constructed as an exterior wall; S52. Merge adjacent floors: It is agreed that adjacent floors should have lower numbers, and vice versa; S521. Loop through floors L0 and L1, if they do not belong to rooms R on the same floor L0 and R L1 The geometric model P L0 and P L1 There is an intersection, denoted by P ΔL ; S522. Room R L0 The upper floor geometry is changed to P L0 -P ΔL ; S523. Room R L0 The geometry of the lower floor slab is changed to P L1 -P ΔL ; S524.P ΔL Build a new floor F for the geometry ΔL , new floor F ΔL Connecting rooms; The traversal ends when there is no intersection between the geometric models of the upper and lower floors.

6. The architectural drawing recognition and model building method suitable for building human settlement environment simulation according to claim 1, characterized in that: In step S5, the building information includes floor elevation, storey height, and enclosure structure, and the basic structure includes rooms, walls, and upper and lower floors.

Images