A method for geometric segmentation and hierarchical splitting using envelopes of the same level

Abstract

This invention discloses a method for geometric segmentation and hierarchical splitting using envelopes of the same level. The method includes: generating an envelope Bn and an initial geometry Gn in three-dimensional space, establishing a corresponding hierarchy Hn for the envelope; traversing the spatial containment relationships between the initial geometry and the envelope (completely contained, partially contained, and completely outside) and classifying them. When the geometry is completely contained, it is copied to the corresponding sub-level; when it is partially contained, the geometry within the envelope is segmented and extracted; when it is completely outside, it is skipped; and finally, a new hierarchical structure tree is generated. The envelopes are uniquely numbered within the set of initial geometries, and envelopes of the same level are completely separated. This method solves the problems of chaotic hierarchical structures, low segmentation efficiency, and ambiguous attribution in traditional models, thereby improving model management efficiency.

Description

Technical Field

[0001] The present invention relates to the technical field of structural design and processing, and in particular to a method for geometric segmentation and hierarchical splitting using envelopes of the same level. Background Art

[0002] In the field of 3D geometric modeling and spatial data processing, envelopes, as a bounding volume used to quickly determine the spatial relationships between geometric objects, are widely used in fields such as building information modeling, computer-aided design, and geographic information systems. Existing technologies typically employ a hierarchical structure management model to manage the spatial relationships between geometric objects and envelopes, constructing a hierarchical tree to achieve hierarchical organization of complex geometric models. However, when faced with the interaction between large-scale geometric data sets and envelopes at the same level, traditional methods expose the following shortcomings:

[0003] On the one hand, existing hierarchical segmentation methods lack refined logic for determining the spatial containment relationship between geometric objects and their envelopes. Traditional methods lack a specific processing flow for different scenarios, such as when the initial geometric object is "completely contained," "partially contained," or "completely outside" of the envelope. This leads to data redundancy and confusion in hierarchical attribution during the geometric segmentation process. This is particularly true when dealing with geometric objects that are partially contained within the envelope, making it difficult to accurately extract the valid parts and achieve proper stratification, impacting the structural clarity of the model.

[0004] On the other hand, when multiple envelopes exist at the same level, existing technologies do not strictly define the spatial separation between envelopes, which can lead to overlapping or intersecting envelopes at the same level, leading to ambiguity in determining the ownership of geometric objects. For example, in building structure modeling, if multiple envelopes at the same level correspond to different building components but have overlapping spatial ranges, it is impossible to uniquely determine the hierarchy of the geometric objects, increasing the complexity of subsequent model management and analysis.

[0005] To address the above problems, there is an urgent need for a method that can achieve accurate segmentation and hierarchical splitting of geometric objects based on spatial containment relationships. By clarifying the spatial separability of envelopes at the same level, establishing refined processing logic and efficient indexing mechanisms, the defects of existing technologies such as chaotic hierarchical structure, low segmentation efficiency and ambiguous spatial relationships can be solved, thereby improving the accuracy and efficiency of three-dimensional geometric data processing. Summary of the Invention

[0006] The purpose of the present invention is to provide a method for geometric segmentation and hierarchical splitting using envelopes of the same level to solve the problems in the above-mentioned background technology.

[0007] The present invention is achieved through the following technical solutions:

[0008] A method for geometric segmentation and hierarchical splitting using envelopes of the same level, comprising generating envelopes Bn and initial sets Gn in three-dimensional space from an imported envelope set Bn {B1, B2…Bn} and an initial set Gn {G1, G2…Gn}, wherein n in the two sets is a number, and the specific steps are as follows:

[0009] S1. Establish corresponding levels Hn according to the generated envelope Bn, where the level Hn is located is the initial level P;

[0010] S2. Traverse the spatial inclusion relationship between the initial geometry Gn and each envelope Bn in the initial geometry set {G1, G2 ... Gn}, and process the initial geometry Gn based on the spatial inclusion relationship between the initial geometry Gn and the envelope Bn;

[0011] S3. After processing each initial geometry Gn, a hierarchical structure tree is obtained.

[0012] The present invention imports a set of envelopes Bn {B1, B2...Bn} and an initial geometry Gn set {G1, G2...Gn} with unique numbers in three-dimensional space, establishes a corresponding level Hn (belonging to the same initial level P) for each envelope Bn, traverses the spatial inclusion relationship between the initial geometry Gn and the envelope Bn, and performs classification processing: if Gn is completely included in Bn, a sub-level Pn' is generated under the corresponding level Hn of Bn, Gn is copied to generate a new geometry Gn' and placed in Pn'; if Gn is partially included in Bn, a sub-level Pn' is also generated, Gn is copied to generate a temporary geometry Gt, Gt is split by Bn, and part of the geometry Gp in the envelope is extracted and stored in Pn'; if Gn is completely outside Bn, the envelope is skipped, and finally a new hierarchical structure tree based on spatial relationships is generated, in which envelopes at the same level are completely separated. This method realizes orderly hierarchical management of geometric data through refined processing, thereby improving model processing efficiency and accuracy.

[0013] Further,

[0014] The spatial inclusion relationship between the initial geometry Gn and the envelope Bn is specifically as follows: the initial geometry Gn is completely included in the envelope Bn, part of the initial geometry Gn is included in the envelope Bn, and the initial geometry Gn is completely outside the envelope Bn.

[0015] Further,

[0016] When the spatial inclusion relationship is that the initial geometry Gn is completely contained by the envelope Bn, the initial geometry Gn is processed as follows:

[0017] S20. Find the Hn level corresponding to the envelope Bn under the initial level P according to the envelope Bn, and generate the Pn' level corresponding to the initial level P under the corresponding Hn level;

[0018] S21. Copy the initial geometry Gn, generate a new geometry Gn', and place the new geometry Gn' under the corresponding Pn' level.

[0019] Further,

[0020] When the spatial inclusion relationship is that the initial geometry Gn is contained in the envelope Bn, the initial geometry Gn is processed as follows:

[0021] S20. Find the Hn level corresponding to the envelope Bn under the initial level P according to the envelope Bn, and generate the Pn' level corresponding to the initial level P under the corresponding Hn level;

[0022] S21. Copy the initial geometry Gn to generate a temporary geometry Gt;

[0023] S22. Segment the temporary geometry Gt using the envelope Bn and extract the portion of the temporary geometry Gt in the envelope Bn as the partial geometry Gp;

[0024] S23. Place the partial geometry Gp into the corresponding Pn' level.

[0025] Further,

[0026] When the spatial containment relationship is such that the initial geometry Gn is completely outside the envelope Bn, the next envelope Bn is selected.

[0027] Further,

[0028] The set {B1, B2...Bn} of the envelope Bn and the set {G1, G2...Gn} of the initial geometry Gn have unique n values ​​within their respective sets.

[0029] Further,

[0030] When the envelopes Bn are at the same level, the envelopes Bn are completely separated from each other.

[0031] The present invention has the beneficial effects:

[0032] 1. By clearly dividing the spatial relationship between the initial geometry and the envelope into three categories: "completely contained", "partially contained", and "completely outside", and designing independent processing processes for different categories, geometric processing errors or omissions caused by ambiguous spatial relationships in traditional methods are avoided.

[0033] 2. For geometries that are completely contained within the envelope, new geometries are generated by copying and assigned to the corresponding level of the envelope, achieving hierarchical isolation while preserving the integrity of the original geometry.

[0034] 3. For the geometry partially contained in the envelope, the temporary geometry is segmented by the envelope and the valid part is extracted. Only the part within the envelope is retained and classified into the corresponding hierarchy, irrelevant areas are eliminated, data redundancy is reduced, and the hierarchical structure is more in line with the actual spatial distribution, thereby improving the accuracy of geometric data and analysis efficiency.

[0035] 4. By limiting the uniqueness of the numbers within the envelope and the initial geometry set, a one-to-one correspondence is established between the numbers and the initial geometry of the envelope box to avoid element confusion; at the same time, envelopes at the same level are required to be completely separated to prevent spatial overlap. BRIEF DESCRIPTION OF THE DRAWINGS

[0036] Figure 1 It is a schematic diagram of the process of the present invention;

[0037] Figure 2 Schematic diagram of the envelope Bn;

[0038] Figure 3 is a schematic diagram of the initial geometry Gn;

[0039] Figure 4 Schematic diagram of the relationship between the envelope Bn and the initial geometry Gn;

[0040] Figure 5 It is a schematic diagram of the correspondence between each level of the hierarchical structure tree and each envelope Bn and each geometry. DETAILED DESCRIPTION

[0041] The present invention will be further described in detail below with reference to the embodiments and the accompanying drawings, but the embodiments of the present invention are not limited thereto.

[0042] For example, see Figures 1 to 5 :

[0043] A method for geometric segmentation and hierarchical splitting using envelopes of the same level, comprising generating envelopes Bn and initial sets Gn in three-dimensional space from an imported envelope set Bn {B1, B2…Bn} and an initial set Gn {G1, G2…Gn}, wherein n in the two sets is a number, and the specific steps are as follows:

[0044] S1. Establish corresponding levels Hn according to the generated envelope Bn, where the level Hn is located is the initial level P;

[0045] S2. Traverse the spatial inclusion relationship between the initial geometry Gn and each envelope Bn in the initial geometry set {G1, G2 ... Gn}, and process the initial geometry Gn based on the spatial inclusion relationship between the initial geometry Gn and the envelope Bn;

[0046] S3. After processing each initial geometry Gn, a hierarchical structure tree is obtained.

[0047] Further,

[0048] The spatial inclusion relationship between the initial geometry Gn and the envelope Bn is specifically as follows: the initial geometry Gn is completely included in the envelope Bn, part of the initial geometry Gn is included in the envelope Bn, and the initial geometry Gn is completely outside the envelope Bn.

[0049] The spatial relationship between the initial geometry and the envelope is clearly divided into three categories: "completely contained", "partially contained" and "completely outside". This makes the geometry processing flow logically clear and enables targeted processing of different situations, avoiding errors or omissions in geometry processing due to ambiguity in different spatial relationships.

[0050] In a certain embodiment, in judging the spatial relationship between the initial geometry G1 and the envelope B1, if G1 is entirely located inside B1, it is considered "completely contained"; if half of G1's volume is inside B1 and half is outside B1, it is considered "partially contained"; if G1 and B1 have no spatial intersection, it is considered "completely outside", and the three trigger different processing flows respectively.

[0051] Further,

[0052] When the spatial inclusion relationship is that the initial geometry Gn is completely contained by the envelope Bn, the initial geometry Gn is processed as follows:

[0053] S20. Find the Hn level corresponding to the envelope Bn under the initial level P according to the envelope Bn, and generate the Pn' level corresponding to the initial level P under the corresponding Hn level;

[0054] S21. Copy the initial geometry Gn, generate a new geometry Gn', and place the new geometry Gn' under the corresponding Pn' level.

[0055] The geometry that is completely contained in the envelope is copied hierarchically and placed in a new layer corresponding to the envelope. This not only preserves the integrity of the original geometry but also achieves hierarchical isolation, making it easier to operate the geometry of a specific area and improving management flexibility.

[0056] In one embodiment, the initial geometry G2 is completely contained within the enveloping volume B2. The system first locates the corresponding level H2 within the initial level P and creates a sublevel P2' within H2. G2 is then copied to create a new geometry G2', which is then placed within the P2' level. At this point, G2' is hierarchically associated with B2, facilitating subsequent operations on the geometry within B2.

[0057] Further,

[0058] When the spatial inclusion relationship is that the initial geometry Gn is contained in the envelope Bn, the initial geometry Gn is processed as follows:

[0059] S20. Find the Hn level corresponding to the envelope Bn under the initial level P according to the envelope Bn, and generate the Pn' level corresponding to the initial level P under the corresponding Hn level;

[0060] S21. Copy the initial geometry Gn to generate a temporary geometry Gt;

[0061] S22. Segment the temporary geometry Gt using the envelope Bn and extract the portion of the temporary geometry Gt in the envelope Bn as the partial geometry Gp;

[0062] S23. Place the partial geometry Gp into the corresponding Pn' level.

[0063] The geometry contained in the envelope is segmented, and the part inside the envelope is extracted and classified into a new level, ensuring that the geometry in the level is consistent with the spatial range of the envelope. This can eliminate the part of the geometry that is not related to the envelope, making the hierarchical structure clearer and more consistent with the actual spatial division, and reducing redundant data interference.

[0064] In one embodiment, 1 / 3 of the volume of the cuboid of the initial geometry G3 lies within the envelope B1. The system first copies G3 to generate a temporary geometry Gt, then uses B1 as a cutting tool to segment Gt, extracting the inner 1 / 3 of the sphere as Gp. Finally, a sub-level P1' is created under the level H1 corresponding to B1, and Gp is ​​placed in the P1' level to achieve precise stratification of the partially contained geometry.

[0065] Further,

[0066] When the spatial containment relationship is such that the initial geometry Gn is completely outside the envelope Bn, the next envelope Bn is selected.

[0067] By filtering out geometries without spatial association, redundant operations during traversal are reduced, and algorithm efficiency is improved. This approach is particularly suitable for matching scenarios between large-scale geometries and envelopes.

[0068] In one embodiment, the initial geometry G4 is completely outside the envelope B3. The system does not perform any splitting or copying operations, but directly skips B3 and continues to determine the spatial relationship between G4 and the next envelope B4 until an envelope with a containment relationship is found or all envelopes are traversed.

[0069] Further,

[0070] The set {B1, B2...Bn} of the envelope Bn and the set {G1, G2...Gn} of the initial geometry Gn have unique n values ​​within their respective sets.

[0071] Ensure that the number n of each element in the envelope set {Bn} and the initial geometry set {Gn} is unique, establish a one-to-one corresponding index relationship, avoid confusion caused by different elements having the same number, and ensure accuracy during the traversal and matching process.

[0072] Further,

[0073] When the envelopes Bn are at the same level, the envelopes Bn are completely separated from each other.

[0074] Ensure that the envelopes at the same level do not overlap or intersect in space, forming independent spatial areas. This can avoid ambiguity in geometric attribution judgment caused by overlapping envelopes at the same level, making spatial relationship judgment clearer and the hierarchical structure more reasonable.

[0075] In one embodiment, at the initial level P, volumes B1, B2, and B3 correspond to levels H1, H2, and H3 at the same level, and these volumes do not intersect in three-dimensional space. In this case, the spatial relationship between any initial geometry and these volumes must belong to a unique volume. For example, if G1 is within B1, it must not be within B2 or B3, ensuring unique hierarchical splitting results.

[0076] It will be understood that the above embodiments are merely exemplary embodiments for illustrating the principles of the present invention, and the present invention is not limited thereto. Persons skilled in the art will readily appreciate that various modifications and improvements can be made without departing from the spirit and substance of the present invention, and such modifications and improvements are considered within the scope of protection of the present invention.

Claims

1. A method for geometric segmentation and hierarchical splitting using envelopes of the same level, characterized in that: The imported envelope Bn set {B1, B2…Bn} and the initial geometry Gn set {G1, G2…Gn} are used to generate the envelope Bn and the initial set Gn in three-dimensional space, where n in the two sets is a number. The specific steps are as follows: S1. Establish corresponding levels Hn according to the generated envelope Bn, where the level Hn is located is the initial level P; S2. Traverse the spatial inclusion relationship between the initial geometry Gn and each envelope Bn in the initial geometry set {G1, G2 ... Gn}, and process the initial geometry Gn based on the spatial inclusion relationship between the initial geometry Gn and the envelope Bn; The spatial inclusion relationship between the initial geometry Gn and the envelope Bn is specifically as follows: the initial geometry Gn is completely contained by the envelope Bn, part of the initial geometry Gn is contained in the envelope Bn, and the initial geometry Gn is completely outside the envelope Bn; When the spatial inclusion relationship is that the initial geometry Gn is completely contained by the envelope Bn, the initial geometry Gn is processed as follows: S20. Find the Hn level corresponding to the envelope Bn under the initial level P according to the envelope Bn, and generate the Pn' level corresponding to the initial level P under the corresponding Hn level; S21. Copy the initial geometry Gn to generate a new geometry Gn', and place the new geometry Gn' under the corresponding Pn' level; When the spatial inclusion relationship is that the initial geometry Gn is contained in the envelope Bn, the initial geometry Gn is processed as follows: S200. Find the Hn level corresponding to the envelope Bn under the initial level P according to the envelope Bn, and generate the Pn' level corresponding to the initial level P under the corresponding Hn level; S201. Copy the initial geometry Gn to generate a temporary geometry Gt; S202. The corresponding envelope Bn segments the temporary geometry Gt and extracts the portion of the temporary geometry Gt in the envelope Bn as the partial geometry Gp; S203. Place the partial geometry Gp into the corresponding Pn' level; S3. After processing each initial geometry Gn, a hierarchical structure tree is obtained.

2. The method for geometric segmentation and hierarchical splitting using the same-level envelope according to claim 1, characterized in that: If the spatial containment relationship is that the initial geometry Gn is completely outside the envelope Bn, it is skipped and the traversal continues.

3. The method for geometric segmentation and hierarchical splitting using the same-level envelope according to claim 1, characterized in that: The set {B1, B2...Bn} of the envelope Bn and the set {G1, G2...Gn} of the initial geometry Gn have unique n values ​​within their respective sets.

4. The method of geometric segmentation and hierarchical splitting using the same-level envelope according to claim 1, characterized in that: When the envelopes Bn are at the same level, the envelopes Bn are completely separated from each other.

Images