A method for dividing the space of a building park into multi-level rectangular grids and encoding
By dividing the internal elevation of the building according to the floor and using multi-level nested rectangle segmentation to generate explanatory coding, the problem of not fine division of internal space in the building in the existing technology is solved, and the detailed description and accurate position analysis of the internal space of the building are realized.
Patent Information
- Application Number
- CN202411106640.0
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2024-08-13
- Publication Date
- 2025-06-20
- Estimated Expiration
- 2044-08-13
AI Technical Summary
The prior art cannot accurately fit the building when dividing the internal space of the building, resulting in insufficient description of the internal space and objects of the building.
A method of dividing the space of the building park into a multi-level rectangular grid and a coding method is proposed. By dividing the elevation according to the floor and using a multi-level nested rectangular segmentation method, an explanatory code is generated to accurately describe the internal space of the building and accurately analyze its spatial location.
It solves the difficulty of elevation segmentation, rounding and alignment caused by different building floor heights, avoids the actual operational problem of grids across floors, improves the ability to describe uneven spaces, reduces the phenomenon of spatial objects spanning or squeezing grids, and the generated encoding can directly determine the location of the spatial grid.
Smart Images

Figure CN119068139B_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the technical field of spatial data processing, and particularly relates to a method for dividing the space of a building park into multiple levels of rectangular grids and encoding. Background Art
[0002] Spatial partitioning mainly divides the spatial range into a set of slices with equal or approximately equal numbers of spatial objects, and then assigns them to different processors for local connection operations. In the case of spatial analysis applications based on topological relationships, special processing needs to be performed on the objects at the boundary during slicing, that is, the boundary object processing problem. Currently, there are four processing solutions to solve boundary objects: 1. Replica copying: This solution saves complete replicas of all slices that intersect with the spatial object. When the parallel processing is completed, the duplicate results generated during the parallel connection process are eliminated; 2. Spatial object fragment proxy: This solution assigns the spatial object that intersects multiple slices to a specific slice, and assigns the MBR of the intersecting part of the spatial object on the remaining slices and the pointer OID (object ID) of the spatial object to the remaining intersecting slices. This solution also has to perform duplicate result elimination; 3. Replica avoidance: A solution called the reference point method. For each pair of spatial objects Tr and Ts from different spatial relationships R and S, if both are copied to multiple slices, then the spatial relationship judgment between Tr and Ts is only performed in the slices where both have replicas. This method calculates a specific reference point (object intersection corner point) of the MBR of Tr and Ts, and only performs the connection calculation in the slice where the reference point is located to avoid replicas. The reference slice method is an improvement of the reference point method. This type of algorithm must copy and back up the spatial objects that intersect multiple slices; 4. Spatial object segmentation: Directly divide the spatial object that intersects multiple slices along the boundary of the spatial slice, and save the geometric object information of the obtained spatial object fragments in the index. During the connection operation, each fragment is calculated separately. In the case of a large number of slices, the growth of the index structure in this solution will result in a large amount of I / O, and the process of dividing the spatial object also requires additional geometric operations.
[0003] Under the existing technology, the method of dividing the internal space of a building into multiple levels of rectangular grids and encoding can be achieved through the following steps: 1. The transformation and extension method, which is applicable to curved surfaces. It starts from nodes and extends into line elements, then into two-dimensional plane elements, and finally into three-dimensional elements. This method can generate high-quality and high-speed grids and supports various operations; 2. The Del aunay triangulation method, which is applicable to the domain enclosed by closed curves. It is discretized by equilateral triangles, taking into account the detailed description of geometric features and the requirements of sparse element grids, and is suitable for local optimization processing; 3. The covering method: applicable to complete cut surfaces, mainly using quadrilateral elements for grid division; 4. The front method: applicable to surface division, supporting quadrilateral elements and triangular elements. It realizes the transformation by mapping the surface isoparametrically to the two-dimensional space and then to the three-dimensional space.
[0004] In the operation process of the above methods, there are generally problems that the existing space grid division cannot accurately fit the building inside the building, and the description of the internal space and objects of the building is not precise enough. Summary of the Invention
[0005] The purpose of the present invention is to solve the deficiencies in the existing technology. Therefore, a method for dividing the space of a building complex into multiple levels of rectangular grids and encoding is proposed. The original space can be divided into multiple levels of space grids of different sizes and subjected to interpretive encoding. Furthermore, the internal space of the building can be described in detail, and its location in the space can be accurately analyzed according to the encoding.
[0006] Specifically, the following technical solutions are adopted:
[0007] It includes the following steps:
[0008] S1. Divide the entire building space strictly according to the number of building floors in terms of elevation, assign an interpretive 11-bit code, and record the 11-bit code as code A;
[0009] S2. Divide the first floor sequentially from bottom to top. Each divided block has no nested relationship, and the number of divisions has no strict limit. Then assign it a 4-bit code and record the 4-bit code as code B;
[0010] S3. Project the building onto the two-dimensional plane composed of the XY axes, and divide it with different non-overlapping rectangles closely connected, and regard it as the projection of different space blocks on the two-dimensional plane;
[0011] Among them, the space projection plane is divided in a multi-level nested manner, with a maximum of 3 levels of nesting. Then, it is encoded with 13 digits and English letters and recorded as code C;
[0012] S4. The space block code inside the building = code A + code B + code C.
[0013] Preferably, in step S1, the first digit in the code A represents the positive or negative of the floor space, where 1 represents the above-ground floor and 0 represents the underground floor;
[0014] The 2nd to 4th digits represent the floor number where the floor is located;
[0015] The 5th to 7th digits represent the total number of floors in the building;
[0016] The 8th to 11th digits represent the floor height data of this floor, with the unit of cm.
[0017] Preferably, in step S2, the 1st to 2nd digits in the code B represent the total number of divisions on this floor;
[0018] The 3rd to 4th digits represent the sequential number from bottom to top.
[0019] Preferably, in step S3, the first digit in the code C represents the number of division levels, which are 4 levels from 0 to 3;
[0020] The 2nd to 5th digits represent the projection number of the first division;
[0021] The 6th to 9th digits represent the projection number of the second division;
[0022] The 10th to 13th digits represent the projection number of the third division;
[0023] Among them, the projection numbers of each level of division are all 4 digits. The first two digits represent the abscissa serial number, and the last two digits represent the ordinate serial number. XX represents that this module is the topmost space block in the X coordinate, and YY represents that this module is the topmost space block in the Y coordinate.
[0024] Compared with the prior art, the present invention has the following beneficial effects:
[0025] 1. The present invention divides according to floors in the internal elevation of the building, thus solving the difficulty of elevation division and rounding alignment caused by different building floor heights, and also avoiding the actual operation problem of grid spanning floors.
[0026] 2. In the present invention, there is a large degree of freedom in the partial division of code B and code C, and it can be divided arbitrarily, which is more conducive to the description of uneven spaces during the actual engineering implementation, and can effectively reduce the phenomenon of spatial objects crossing or occupying grids.
[0027] 3. The spatial grid code generated by the present invention is an interpretive code. The spatial grid position can be determined simultaneously when the code is generated, without additional calculation. When using it, only a single grid needs to be interpreted according to the basic division information. BRIEF DESCRIPTION OF THE DRAWINGS
[0028] Figure 1This is a schematic flow chart of a method for dividing the space of a building complex into multi-level rectangular grids and encoding. Specific implementation mode
[0029] Next, the technical solutions in the embodiments of the present invention will be clearly and completely described in conjunction with the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are only a part of the embodiments of the present invention, rather than all the embodiments.
[0030] Embodiment 1: As Figure 1 shown, a method for dividing the space of a building complex into multi-level rectangular grids and encoding includes the following steps:
[0031] S1. Divide the entire building space strictly according to the number of building floors in terms of elevation, and assign an 11-bit encoding with explanatory meaning, and record the 11-bit encoding as Encoding A;
[0032] S2. Divide the first floor sequentially from bottom to top. Each divided block has no nested relationship, and the number of divisions has no strict limit. Then assign it a 4-bit encoding, and record the 4-bit encoding as Encoding B;
[0033] S3. Project the building onto the two-dimensional plane composed of the X and Y axes, and divide it with different rectangles that are closely connected, and regard it as the projection of different space blocks on the two-dimensional plane;
[0034] Among them, the division of the space projection plane adopts a multi-level nested method, with a maximum of 3 levels of nesting. Then use 13 digits and English letters for encoding, and record it as Encoding C;
[0035] S4. The encoding of the space block in the building = Encoding A + Encoding B + Encoding C.
[0036] In step S1, the first digit in the Encoding A represents the positive or negative of the floor space. 1 represents the above-ground floor, and 0 represents the underground floor;
[0037] The 2nd to 4th digits represent the floor number where the floor is located;
[0038] The 5th to 7th digits represent the total number of building floors;
[0039] The 8th to 11th digits represent the floor height data of this floor, with the unit of cm.
[0040] Among them, an example of Encoding A is shown in the following table:
[0041] Table 1 is an example of Encoding A:
[0042] 11591591269 The 159th floor of a 159-story building above ground, with a floor height of 12.69 meters 11231590450 The 123rd floor of a 159-story building above ground, with a floor height of 4.5 meters 10331590000 The 33rd floor of a 159-story building above ground 10011590780 The 1st floor of a 159-story building above ground, with a floor height of 7.8 meters 00010120960 The basement 1st floor of a 12-story building underground, with a floor height of 9.6 meters 00100120480 The basement 10th floor of a 12-story building underground, with a floor height of 4.8 meters
[0043] As can be seen from the above, in the specific implementation process, if the project only considers the relative position, the last three digits can be cancelled or marked as zero.
[0044] Example 2:
[0045] As Figure 1 shown, it includes the following steps:
[0046] S1. Divide the entire building space strictly according to the number of building floors in elevation, assign an 11-bit explanatory code, and denote the 11-bit code as code A;
[0047] S2. Divide the first floor sequentially from bottom to top, with no nested relationship between the divided blocks and no strict limit on the number of divisions. Then assign it a 4-bit code and denote the 4-bit code as code B;
[0048] S3. Project the building onto the two-dimensional plane composed of the XY axes, and divide it with different rectangles that are closely connected, and regard it as the projection of different space blocks on the two-dimensional plane;
[0049] Among them, the space projection plane is divided in a multi-level nested manner, with a maximum of 3 levels of nesting. Then, it is encoded with 13 digits and English letters and denoted as code C;
[0050] S4. The space block code in the building = code A + code B + code C.
[0051] In step S2, the first and second digits in the code B represent the total number of divisions on this floor;
[0052] The third and fourth digits represent the sequential number from bottom to top.
[0053] Among them, an example of code B is shown in the following table:
[0054] Table 2 is an example of code B:
[0055] 1209 Divided into 12 parts in total, the 9th from the bottom up 0201 Divided into 2 parts in total, the 1st from the bottom up 0101 Not divided in the Z-axis direction, the whole floor has one number
[0056] Example 3:
[0057] As Figure 1 shown, it includes the following steps:
[0058] S1. Divide the entire building space strictly according to the number of building floors in elevation, assign an 11-bit explanatory code, and denote the 11-bit code as code A;
[0059] S2. Divide the first floor sequentially from bottom to top, with no nested relationship between the divided blocks and no strict limit on the number of divisions. Then assign it a 4-bit code and denote the 4-bit code as code B;
[0060] S3. Project the building onto the two-dimensional plane composed of the X and Y axes, divide it with different closely connected rectangles, and regard it as the projection of different spatial blocks on the two-dimensional plane;
[0061] Among them, the spatial projection plane division adopts a multi-level nested method, with a maximum of 3 levels of nesting, and then encodes it with 13 digits and English letters, and records it as code C;
[0062] S4. The spatial block code in the building = code A + code B + code C.
[0063] In step S3, the first digit in the code C represents the level of division, which are 4 levels from 0 to 3 in total;
[0064] For example, if the first digit is 0, it means that the spatial block is based on the entire building projection.
[0065] The 2nd to 5th digits represent the projection number of the first division;
[0066] The 6th to 9th digits represent the projection number of the second division;
[0067] The 10th to 13th digits represent the projection number of the third division;
[0068] Among them, the projection numbers of each level of division are all 4 digits. The first two digits represent the abscissa serial number, and the last two digits represent the ordinate serial number. XX represents that this module is the topmost spatial block of the X coordinate, and YY represents that this module is the topmost spatial block of the Y coordinate;
[0069] Significantly, the 0101 block and the XXYY block are diagonal spatial blocks in the same plane. Considering that there are many buildings that cannot be aligned up and down, the upper and lower cases of XY can be defined separately. The capital XY represents the boundary of the entire building projection, and the lowercase xy can be defined as the boundary of the layer where the spatial block is located, which can be defined flexibly here.
[0070] Among them, the numbering examples of each level are shown in the following table:
[0071] Table 3 is the numbering example of each level:
[0072] 01YY 02YY 03YY 04YY 05YY 06YY 07YY XXYY 0112 0212 0312 0412 0512 0612 0712 XX12 0111 0211 0311 0411 0511 0611 0711 XX11 0110 0210 0310 0410 0510 0610 0710 XX10 0109 0209 0309 0409 0509 0609 0709 XX09 0108 0208 0308 0408 0508 0608 0708 XX08 0107 0207 0307 0407 0507 0607 0707 XX07 0106 0206 0306 0406 0506 0606 0706 XX06 0105 0205 0305 0405 0505 0605 0705 XX05 0104 0204 0304 0404 0504 0604 0704 XX04 0103 0203 0303 0403 0503 0603 0703 XX03 0102 0202 0302 0402 0502 0602 0702 XX02 0101 0201 0301 0401 0501 0601 0701 XX01
[0073] Among them, the numbering examples are shown in the following table:
[0074] Table 4 is the numbering example:
[0075] 2020103040000 The 2-level segmentation projection with the number 02010304 1030300000000 The 1-level segmentation projection with the number 0303 0000000000000 The entire building projection
[0076] To sum up, if the project only considers the relative position, the last three digits can be cancelled or marked as zero. If the number of digits is not cancelled, that is, the spatial block code in the building = code A + code B + code C, a total of 28 digits;
[0077] By dividing according to floors at the internal elevation of the building, the difficulty of elevation segmentation and rounding alignment caused by different storey heights of the building is solved, and the practical operation problem of the grid spanning floors is also avoided. The segmentation of parts of coding B and coding C has greater freedom and can be divided arbitrarily, which is more conducive to the description of uneven spaces during the actual engineering implementation, can effectively reduce the phenomenon of spatial objects crossing or occupying grids, and the generated spatial grid coding is an interpretive coding. The spatial grid position can be determined simultaneously when the coding is generated without additional calculation. When in use, only a single grid needs to be interpreted according to the basic division information.
[0078] As described above, it is only the preferred specific implementation manner of the present invention, but the protection scope of the present invention is not limited thereto. The substitution may be the substitution of part of the structure, device, method steps, or a complete technical solution. Any equivalent substitution or change made according to the technical solution of the present invention and its inventive concept should be covered within the protection scope of the present invention.
Claims
1. A method for dividing a building park space into multi-level rectangular grids and encoding the grid, characterized in that: The steps include: S1. Divide the entire building space strictly according to the number of building floors in terms of elevation, and assign an explanatory 11-bit code, and record the 11-bit code as code A, where the first digit of code A indicates the positive or negative of the floor space, 1 represents an above-ground floor, and 0 represents an underground floor; The 2nd to 4th digits indicate the floor number of the building; The 5th to 7th digits indicate the total number of floors of the building; The 8th to 11th digits represent the floor height data of the current floor, in cm; S2. Split a layer from bottom to top in order, without nesting of the split blocks, and without strict limit on the number of splits, and then assign a 4-bit code to it, and record the 4-bit code as code B, wherein the first and second digits of code B represent the total number of splits in this layer; The 3rd to 4th digits represent the order number from bottom to top; S3, project the building onto a two-dimensional plane composed of XY axes, divide it with different closely connected rectangles, and regard it as the projection of different space blocks on the two-dimensional plane; The spatial projection plane segmentation adopts a multi-level nesting method, which can be nested up to 3 levels, and then encoded with 13 digits and English letters, and recorded as code C. The first digit in the code C represents the level of segmentation, which is 4 levels from 0 to 3; The 2nd to 5th digits indicate the projection number of the first segmentation; The 6th to 9th digits represent the projection number of the second segmentation; The 10th to 13th digits represent the projection number of the third segmentation; S4. The space block code within the building = code A + code B + code C.
2. A method for dividing a building park space into multi-level rectangular grids and encoding as claimed in claim 1, characterized in that The projection numbers of each level of segmentation in step S3 are all 4 digits, the first two digits represent the horizontal coordinate sequence number, the last two digits represent the vertical coordinate sequence number, XX represents that this module is the top spatial block of the X coordinate, and YY represents that this module is the top spatial block of the Y coordinate.
Citation Information
Patent Citations
Space-time coding method of building information
CN109033251A
Earth space three-dimensional mesh generation method and system
CN114140599A
Method and system for quickly constructing three-dimensional space model of multi-level building
CN118172503A