CN114241087B

CN114241087B - Building plane layout generation method based on bubble diagrams

Info

Publication number: CN114241087B
Application number: CN202111573716.7A
Authority: CN
Inventors: 缪一新; 张云涛; 高超
Original assignee: China Digital Technology Co ltd
Current assignee: China Digital Technology Co ltd
Priority date: 2021-12-21
Filing date: 2021-12-21
Publication date: 2023-05-05
Anticipated expiration: 2041-12-21
Also published as: CN114241087A

Abstract

The invention provides a building plane layout generation method based on a bubble diagram, which is characterized in that a plane dimension-reducing diagram is obtained by the bubble diagram, an edge segmentation scheme is obtained after the plane dimension-reducing diagram is processed, then a plurality of edge segmentation schemes are derived by the scheme, a rectangular dual diagram corresponding to the edge segmentation scheme is obtained after further processing, after the rectangular dual diagram is adjusted and edited, a building plane function partition diagram can be input, and finally, all building plane layout schemes meeting set requirements are obtained, and then the optimal building plane layout is selected through comparison. The whole process is simple to operate, the system program is automatically generated, and all reasonable schemes can be obtained without inputting excessive manpower and time; and the calculation process is scientific and strict, the influence of subjective factors of designers is eliminated, and the layout of each functional partition is more scientific and reasonable. To a great extent, the design cost is reduced, the working efficiency is improved, and the design result is optimized.

Description

Building plane layout generation method based on bubble diagrams

Technical Field

The invention relates to the technical field of building design and planning, in particular to a building plane layout generation method based on a bubble diagram.

Background

In the initial stage of the design scheme, the bubble diagram is a common tool for a designer, namely, a series of conceptual diagrams for expressing design ideas and functional relations are used, so that the layout division and functional allocation of the whole building space can be considered from a macroscopic view, the thought of the building layout can be displayed simply and clearly, and the designer is helped to control the whole situation.

At present, the design process of building plane layout mainly takes own experience of a designer as a core, performs layout creation by referring to similar cases, and manually arranges functional partitions. Multiple logical design choices are typically tapped for comparison before the final design choice is determined. This has the following major problems:

1. the optimal layout is difficult to obtain, and because of the limited effort of the designer, only a plurality of relatively reasonable layout directions (the final evaluation of the layout can be judged by deepening the scheme) can be preliminarily determined, and the selection of the layout directions depends on the experience and inspiration of the designer, so that the design has contingency.

2. The time and labor costs are high, and significant labor costs are required to obtain a better quality layout, whether it be a page-through case or a manual attempt with more possibilities. In a certain layout direction, the space requirement of a specific scheme is combined, each functional room is carded, and once the irreconcilable contradiction is encountered, repeated work is required in a new direction.

Disclosure of Invention

The invention aims to provide a building plane layout generation method based on a bubble diagram, which aims to solve the problems that the building plane layout at the present stage depends on manual design of a designer, has contingency, is difficult to obtain the optimal layout, has more repeated work, has lower working efficiency and consumes excessive time and labor cost.

In order to solve the above problems, the present invention provides a building plan layout generating method based on a bubble map, comprising the steps of:

combining a bubble diagram, inputting functional partition information of a building space into the system, establishing an adjacency relation and a half-side structure between each functional partition, adding vertexes and sides corresponding to each functional partition to obtain a relation matrix A between vertexes to be solved of each functional partition, and solving a linear equation set A x=C X and B by using a first algorithm to generate a plane dimension reduction diagram of the adjacency relation, wherein X is a coordinate value matrix of the vertexes to be solved of each functional partition, C is an adjacency matrix between the vertexes to be solved and external vertexes, and B is a known external vertex coordinate matrix;

performing color calibration processing on each internal side in the plane dimension reduction diagram, obtaining an edge segmentation scheme of the plane dimension reduction diagram by using a second algorithm, establishing a binary mapping diagram of a triangle surface and a vertex of the edge segmentation scheme, and transforming elements in the binary mapping diagram to obtain various edge segmentation schemes of the plane dimension reduction diagram; the second algorithm comprises that N (0, a), S (0, -a), W (-a, 0) and E (a, 0) 4 external vertexes are arranged on the coordinate axis of the plane dimension reduction graph, a is the set distance between the external vertexes and the origin of the coordinate, and the connecting lines among the 4 external vertexes form the outer contour of the plane dimension reduction graph; the edge of the internal vertex of the plane dimension-reducing diagram connected with N, S is marked as a first color, and the edge surface connected with W, E is positioned as a second color; calibrating 4 vertexes of upper left, lower left, upper right and lower right in the vertexes in the plane dimension reduction graph, calibrating an upper boundary, a lower boundary, a left boundary and a right boundary, starting from the left boundary, calibrating the upper left vertex to be the first color, enabling the upper left vertex to move rightwards along the upper boundary and the lower left vertex to move rightwards along the lower boundary, enabling the left boundary in the current processing state to move rightwards gradually, calibrating the left boundary in the current processing state to be the first color, and calibrating edges between the left boundary in the beginning state and the left boundary in the ending state to be the second color until the upper left vertex is overlapped with the upper right vertex, and enabling the lower left vertex to be overlapped with the lower right vertex;

processing the multiple edge segmentation schemes through a third algorithm, wherein the edges marked by the first color represent that 2 connected functional partitions are adjacent up and down, the edges marked by the second color represent that 2 connected functional partitions are adjacent left and right, starting from a left boundary, identifying a path formed by the edges marked by the first color from top to bottom, sequentially processing points on the path from left to right, drawing inner walls in the left and right directions, drawing the inner walls in the up and down directions if the points are not adjacent up and down and processed, and adding a right boundary to a rectangle on the rightmost side after all the points are processed; obtaining a rectangular dual graph corresponding to the rectangular dual graph;

and adding the geometric outline of the actual building space, restraining the rectangular dual-graph, calculating the position of the inner wall to be adjusted, fine-adjusting the length and the line type of the edges in each obtained functional partition, and outputting the building plane functional partition graph after the length and the line type are adjusted to meet the set requirements.

Further, the functional partition information of the building space required for establishing the adjacency includes: the number of functional partitions, orientation preference, adjacency, target area, aspect ratio, and geometric outline.

Further, the method further comprises a step of checking the plane dimension-reduction graph, and the step of checking comprises the following steps:

checking whether the internal connection lines of the plane dimension-reducing graph are intersected, if so, modifying the connection relation or adding vertexes at the intersection points to introduce functional partitions, and changing the intersected parts into disjoint parts;

and checking the modified plane dimension reduction diagram, judging whether the internal connection lines form triangular surfaces or not, and if the non-triangular surfaces exist, adding internal diagonal lines to convert the internal diagonal lines into the triangular surfaces.

Further, performing space syntax analysis on the plane dimension reduction graph after the checking processing to obtain a plurality of space syntax indexes, wherein the space syntax indexes comprise: connectivity, tupe depth, degree of integration, degree of selectivity, entropy, degree of control, and difference factors.

Further, the element transformation step in the bipartite map includes:

identifying all changeable rings in the bipartite map, wherein the rings are clockwise rings or anticlockwise rings;

and sequentially changing each clockwise ring into a counterclockwise ring, and sequentially changing each counterclockwise ring into a clockwise ring.

Further, the position of the inner wall adjustment is calculated through a fourth algorithm, and the fourth algorithm comprises:

intersecting the inner wall line of the rectangular dual graph with the geometric outer contour calculation to obtain a specific area boundary of each functional partition, and calculating the area and the length and the width of the area in the current state;

calculating the moving position of the inner wall by taking the area as the weight, so that the area of each functional partition gradually approaches the target area, and the length and width approach the target length and width; repeating the calculation until any one of the following termination conditions is satisfied: a. the sum of errors of the areas of the functional partitions and the target areas in the current state is smaller than a set threshold value; b. the iteration times exceed the set maximum times; c. the change value between the sum of errors of the current area and the target area is smaller than the set threshold value.

Further, the method also comprises the steps of processing the building space containing the multi-level functional partitions, and the processing steps comprise:

processing the first-level functional partition of the building space to obtain a building plane functional partition map of the first-level functional partition;

the boundary of the primary functional partition is used as a geometric outline, the secondary functional partition contained in the primary functional partition is processed to obtain a building plane functional partition diagram of the secondary functional partition, and the building plane functional partition diagram is processed step by step until all the functional partitions of the primary functional partition are processed;

and nesting and combining all the functional partitions to obtain a building plane multi-level functional partition map of the whole building space.

According to the building plane layout generation method based on the bubble map, the system can establish the adjacent relation between all the functional partitions according to the input functional partition information, so that the corresponding plane dimension reduction map is produced, an edge segmentation scheme can be obtained quickly after the plane dimension reduction map is processed, then multiple reasonable edge segmentation schemes are derived from the scheme, all the reasonable edge segmentation schemes are listed, all the reasonable rectangular dual maps are obtained after further processing, and after the rectangular dual maps are adjusted and edited, the building plane functional partition map can be input, so that all the building plane layout schemes meeting the set requirements are obtained.

The whole process is simple to operate, the system program is automatically generated, and all reasonable schemes can be obtained without inputting excessive manpower and time, so that the schemes are compared, and the optimal building plane layout is selected. This avoids the possibility that the optimal solution cannot be obtained because the cost is too high and the selection between fewer solutions can be made in the conventional process. In addition, rational data in the design process is used as a support, and a final result can be obtained through algorithm scientific calculation, so that the method is different from the conventional design process which relies on inspiration and experience of a designer, has accidental defects, is more scientific and reasonable in layout of each functional partition in the plane dimension reduction diagram, and eliminates the influence of subjective factors of the designer. The invention reduces the design cost to a great extent, improves the working efficiency and optimizes the design result.

Drawings

In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings that are required to be used in the embodiments or the description of the prior art will be briefly described below, and it is obvious that the drawings in the following description are only embodiments of the present invention, and that other drawings can be obtained according to the provided drawings without inventive effort for a person skilled in the art.

FIG. 1 is a flow chart of a building plan layout generation method based on a bubble map provided by an embodiment of the invention;

FIG. 2 is a schematic diagram of a planar dimension reduction of a building planar layout generating method based on a bubble map according to an embodiment of the present invention;

FIG. 3 is a schematic diagram illustrating the processing of intersecting situations of a plane dimension-reduction diagram of a building plane layout generating method based on a bubble diagram according to an embodiment of the present invention;

FIG. 4 is a schematic diagram of converting a non-triangular plane of a dimension-reducing graph of a building plane layout into a triangular plane according to an embodiment of the present invention;

FIG. 5 is a schematic diagram of an edge segmentation scheme of a planar dimension-reduction diagram of a building planar layout generation method based on a bubble diagram according to an embodiment of the present invention;

FIG. 6 is a diagram illustrating a bipartite mapping scheme of an edge segmentation scheme of a building plan layout generation method based on a bubble map according to an embodiment of the present invention;

FIG. 7 is a diagram of binary map element transformation for a building plan layout generation method based on bubble diagrams according to an embodiment of the present invention;

FIG. 8 is a schematic diagram of an integer array of edges of a building plan layout generating method based on bubble diagrams according to an embodiment of the present invention;

FIG. 9 is a schematic diagram of a computation tree of a building plan layout generating method based on a bubble map according to an embodiment of the present invention;

FIG. 10 is a schematic diagram of a rectangular dual-purpose diagram of a building plan layout generation method based on a bubble map according to an embodiment of the present invention;

fig. 11 is an outline splitting schematic diagram of a building plan layout generating method based on a bubble chart according to an embodiment of the present invention;

fig. 12 is a schematic diagram of adjusting the position of an inner wall of a building plan layout generating method based on a bubble map according to an embodiment of the present invention.

Detailed Description

In order that the above objects, features and advantages of the invention will be readily understood, a more particular description of the invention will be rendered by reference to specific embodiments thereof which are illustrated in the appended drawings. It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the scope of the invention.

Examples

The design of building plane layout mainly depends on manual arrangement of designers, and the problems of high time and labor cost and difficulty in obtaining the optimal layout exist in the process.

Therefore, the present embodiment provides a building plan layout generating method based on a bubble chart, so as to solve the above problem and realize automatic generation of the building plan layout.

The method mentioned in this example includes four steps in total, as follows (as shown in fig. 1):

step one: and obtaining a corresponding plane dimension reduction diagram from the bubble diagram.

1. Inputting functional partition information and establishing an adjacency relationship among the functional partitions;

1.1, inputting the number of functional partitions to obtain functional bubbles marked in sequence;

1.2 dragging the bubbles to be close to 4 directions from top to bottom, left to right, and giving the direction preference to each functional partition;

1.3 connecting lines between bubbles in connection with each other so that adjacent edges are arranged between the bubbles;

1.4 inputting the size expected value (target area, aspect ratio) of each functional partition;

1.5 inputting the geometric outline of the building space;

1.6 establishing an adjacency matrix and constraint information of each partition according to the input conditions.

2. Establishing a space configuration model in the form of a graph, and obtaining a plane dimension reduction graph (shown in figure 2) of a corresponding adjacent relation through a first algorithm;

2.1, establishing a half-edge structure in the program, arranging 4 external vertexes in the upper, lower, left and right directions, sequentially arranging N (0, 1), S (0, -1), W (-1, 0) and E (1, 0) on coordinates, forming an external contour by connecting the 4 external vertexes, and adding vertexes corresponding to each functional partition;

2.2 adding edges connected with the corresponding vertexes to each functional bubble close to the external vertexes;

2.3, if the connection relation exists among the functional partitions, adding corresponding edges;

2.4, obtaining a relation matrix a (n×n) among the vertices to be solved of each functional partition in the interior, wherein n is the number of the points to be solved in the interior, and if a connecting line exists between the ith vertex and the jth vertex, a (I, J) =a (J, I) = -1; the adjacency matrix C (n×4) between the to-be-solved vertex and the external vertices N, E, S and W, C (I, K) =1 indicates that the I-th vertex is connected to N (k=0), E (k=1), S (k=2) or W (k=3), and the known external vertex coordinates are combined into a known vertex coordinate matrix B (4*2), which is the set coordinates of the 4 azimuth vertices respectively;

2.5, solving a linear equation set A, X=C, B through a first algorithm to obtain a coordinate value matrix X (n, 2) of each internal point to be solved, wherein a first column represents an X coordinate, and a second column represents a y coordinate, so that a plane dimension-reducing graph is obtained;

3. performing inspection processing on the plane dimension reduction graph to obtain a plane dimension reduction graph with disjoint internal connecting lines and triangular surfaces between the connecting lines;

3.1 checking whether the internal connecting lines of the obtained plane dimension reduction graph are intersected, if so, modifying the connection relation by a user, or automatically adding vertexes at the intersection point by a program to introduce a functional partition, and changing the intersected part into a disjoint part (shown in figure 3);

3.2 judging whether the internal connection lines form triangle faces or not, if the triangle faces exist, adding internal diagonal lines of the triangle faces, and converting the internal diagonal lines into triangles (shown in figure 4).

4. Performing space syntax analysis on the plane dimension reduction graph after the inspection processing, and providing various space syntax indexes for users to reference;

4.1 spatial syntax indexes include: connectivity, topology depth, integration, selectivity, entropy, control and difference factors;

and 4.2, selecting reasonable space configuration according to the calculated various space syntax indexes, or modifying the partition information input in the step 1 to enable the calculated various space syntax indexes to be in accordance with the space configuration of the design requirements as much as possible, and selecting one or more of the space configuration to design preferentially.

Step two: an edge segmentation scheme of the plane dimension reduction graph is generated, and multiple reasonable edge segmentation schemes are derived from the scheme.

1. Obtaining an edge segmentation scheme (shown in figure 5) of the plane dimension reduction graph by using a second algorithm;

1.1 removing the outer contour connected between the outer vertices N, S, W, E, and performing color calibration on the rest edges, wherein the edges connected with the inner vertices N and S are calibrated to be in a first color, and the edges connected with the inner vertices W and E are calibrated to be in a second color;

1.2, calibrating 4 vertexes of upper left, lower left, upper right and lower right in the internal vertexes of the plane dimension-reducing graph, calibrating an upper boundary, a lower boundary, a left boundary and a right boundary, starting from the left boundary, calibrating the upper left vertex along the upper boundary and the lower left vertex along the lower boundary to move rightwards, so that the left boundary in the current processing state gradually moves rightwards, calibrating the left boundary in the current processing state as the first color, and calibrating the edge between the left boundary in the beginning state and the left boundary in the ending state as the second color until the upper left vertex coincides with the upper right vertex and the lower left vertex coincides with the lower right vertex.

2. Obtaining a plurality of edge segmentation schemes from one edge segmentation scheme by transforming elements in the bipartite mapping diagram;

2.1, establishing a binary mapping diagram of a triangle surface and a vertex of the obtained edge segmentation scheme (shown in fig. 6);

2.2 identifying all modifiable rings in the bipartite map, the rings being divided into counter-clockwise and clockwise rings in direction (as shown in FIG. 7);

2.3 aiming at clockwise rings, each ring is sequentially changed into a counterclockwise ring until no clockwise ring exists, and simultaneously, the colors of all sides in the ring are changed and calibrated into corresponding other colors;

2.4 for counter-clockwise rings, each ring is changed in turn to a clockwise ring until there is no counter-clockwise ring, and simultaneously the colors of all sides in the ring are changed and calibrated to the corresponding other color.

3. Generating repeated conditions of various edge segmentation schemes by using a calculation tree identification process;

3.1, establishing a set of changeable edges, wherein each edge can be calibrated to be a first color or a second color, establishing an unsigned 64-bit shaping array for changeable edge index numbers 0,1 and …, wherein binary bit values of each integer in the array respectively correspond to color calibration values of the changeable edges, the first color is 0, the second color is 1,0 to 63 changeable edges correspond to 64-bit binary bit values of a first shaping value of the array, 64 to 127 changeable edges correspond to 64-bit binary bit values of a 2 nd shaping value of the array, and establishing a corresponding relationship between an unsigned array and a certain color calibration state according to rules (shown in fig. 8);

3.2, establishing a balanced binary tree as a calculation tree, wherein each node corresponds to a color calibration state, the initial state of the calculation tree is empty, when a certain possibility needs to be processed, a shaping array corresponding to the calculation tree is obtained, and whether the calculation tree exists or not can be inquired; if so, not processing; if not, a new edge segmentation scheme is obtained by element transformation (as shown in FIG. 9).

Step three: obtaining a rectangular dual graph corresponding to the edge segmentation scheme by using a third algorithm;

1. according to the color calibration of the edges in the edge segmentation scheme, calibrating the edges of a first color to represent that 2 functional partitions connected with the edges are adjacent up and down, calibrating the edges of a second color to represent that 2 functional partitions connected with the edges are adjacent left and right, under the azimuth constraint, the left upper, the left lower, the right upper and the right lower vertexes are kept unchanged, the upper boundary, the lower boundary, the left boundary and the right boundary are kept unchanged, and a path formed by the edges calibrated by the first color is gradually identified from top to bottom from the left boundary to the right;

2. sequentially processing each vertex on the path from left to right, wherein the partitions corresponding to the 2 vertexes which are adjacent up and down, and drawing the inner wall in the left-right direction; and drawing the inner wall in the vertical direction if the vertices are not adjacent up and down and processed, and adding a right boundary to the rectangle of the right boundary until all vertex processing is completed.

Step four: editing and fine-tuning the rectangular dual graph, and outputting the building plane function partition graph.

1. Adding an actual geometric outline of the building space, calculating through a fourth algorithm, and adjusting the position of the inner wall;

1.1, adding an actual geometric outline of a building space, and identifying the skeleton shape of the geometric outline, wherein the skeleton shape can be divided into a rectangular single partition shape and other complex shapes;

1.2 for other complex shapes, it is transformed into several rectangular single partition shapes by splitting (as shown in fig. 11);

1.3 mapping the internal vertexes of the rectangular dual graph into the rectangular single partition, calculating and intersecting the internal wall lines of the rectangular dual graph with the geometric outer contour to obtain the specific area boundary of each partition, and calculating the area and the length and the width of the area in the current state;

1.4, calculating the moving position of the inner wall by taking the area as the weight, so that the area of each partition gradually approaches to the target area, and the length and width approach to the target length and width;

1.5 repeating the above calculation until any one of the following termination conditions is met: a. the sum of errors of the areas of the functional partitions and the target areas in the current state is smaller than a set threshold value; b. the iteration times exceed the set maximum times; c. the change value between the sum of errors of the current area and the target area of the front and the back times is smaller than a set threshold value;

1.6 after the interior wall location has been updated, it is checked whether each partition meets the required adjacency definition constraints to make adjustments so that adjacency still is satisfied.

2. Further fine-tuning each functional partition until a required partitioning result is obtained;

2.1, the length of the edge of each partition can be finely adjusted;

2.2, a certain internal edge of a certain partition can be partially replaced to be in other linear shapes;

and 2.3, outputting the building plane function partition map after finishing fine adjustment.

In addition, the method mentioned in this embodiment may also process a building space including a multi-level functional partition, and the specific steps are as follows:

1. processing the first-level functional partition of the building space according to the steps one to four to obtain a building plane functional partition map of the first-level functional partition;

2. taking the boundary of the primary functional partition as a geometric outline, and processing the secondary functional partition contained in the primary functional partition according to the steps one to four to obtain a building plane functional partition diagram of the secondary functional partition;

3. step by step processing is performed until all the functional partitions of the level are processed;

4. and nesting and combining all the functional partitions to obtain a building plane multi-level functional partition map of the whole building space.

The invention has the following beneficial effects:

1. the spatial configuration model is expressed using graphics, which is easily understood by designers and computer programs. Based on the graph, various space syntax indexes are objectively calculated, so that influence of subjective factors of a designer in the design process can be eliminated.

2. Providing multiple adjacency graphs allows a designer to choose a more reasonable spatial configuration or modify an existing spatial configuration in the design when the spatial syntax indexes are contradictory.

3. Under the constraint condition of considering input constraint, the building plane layout is automatically obtained by using an algorithm, so that the working efficiency is improved.

4. Multiple building plan layout schemes are provided for selection under the same constraints.

In the description of the present embodiment, it should be noted that, it should be understood by those skilled in the art that all or part of the processes in the methods of the foregoing embodiments may be implemented by a computer program to instruct a control device, where the program may be stored in a computer readable storage medium, and the program may include the processes in the embodiments of the foregoing methods when executed, where the storage medium may be a memory, a magnetic disk, an optical disk, or the like.

Although the present invention is disclosed above, the present invention is not limited thereto. Various changes and modifications may be made by one skilled in the art without departing from the spirit and scope of the invention, and the scope of the invention should be assessed accordingly to that of the appended claims.

Finally, it is further noted that relational terms such as first and second, and the like are used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Moreover, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising one … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.

In the present specification, each embodiment is described in a progressive manner, and each embodiment is mainly described in a different point from other embodiments, and identical and similar parts between the embodiments are all enough to refer to each other.

The previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present invention. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the invention. Thus, the present invention is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.

Claims

1. The building plane layout generation method based on the bubble diagram is characterized by comprising the following steps of:

2. The bubble-map-based building plan layout generation method according to claim 1, wherein the functional partition information of the building space required to establish the adjacency relation includes: the number of functional partitions, orientation preference, adjacency, target area, aspect ratio, and geometric outline.

3. The bubble-map-based building plan layout generation method according to claim 1, further comprising an inspection processing step of the plan dimension-reduction map, the inspection processing step comprising:

4. The bubble-map-based building plan layout generation method of claim 3, wherein the performing spatial syntax analysis on the plane dimension-reduced map after the inspection processing to obtain a plurality of spatial syntax indexes, the spatial syntax indexes comprising: connectivity, tupe depth, degree of integration, degree of selectivity, entropy, degree of control, and difference factors.

5. The bubble-map-based building plan layout generation method according to claim 1, wherein the element transformation step in the bipartite map comprises:

6. The bubble-map-based building plan layout generation method according to claim 1, wherein the position of the interior wall adjustment is calculated by a fourth algorithm, the fourth algorithm comprising:

7. The bubble-map-based building plan layout generation method of claim 1, further comprising processing the building space containing the multi-level functional partitions, the processing step comprising:

processing the first-level functional partition of the building space according to the steps of claim 1 to obtain a building plane functional partition map of the first-level functional partition;

taking the boundary of the primary functional partition as a geometric outline, and processing the secondary functional partition contained in the primary functional partition according to the steps in claim 1 to obtain a building plane functional partition diagram of the secondary functional partition, and processing step by step until all the functional partitions of the level are processed;