A geometric segmentation and hierarchical splitting method based on envelopes of different layers

Abstract

The present invention discloses a method for geometric segmentation and hierarchical splitting based on envelopes of different layers. By inputting a parent geometry envelope set, a child geometry envelope set, and an initial geometry set, the method first generates parent geometry envelope nodes and an initial hierarchy. The inclusion relationship between the initial geometry and the parent geometry envelope is traversed, and the geometry is screened, processed, and stored in a new set L. The inclusion relationship between the child geometry envelope and the parent geometry is then determined to generate a sub-hierarchy. The geometry in set L is traversed, and based on its inclusion relationship with the child geometry envelope (complete inclusion, partial inclusion, or non-inclusion), it is copied, cropped, split, or created as an independent hierarchical storage process, ultimately forming a structure tree. This method accurately processes geometric elements through three inclusion relationships, utilizes unique numbering to ensure data traceability, and achieves efficient geometric segmentation and reasonable hierarchical splitting, improving the automation and reliability of the design and processing process while reducing data redundancy and hierarchical confusion.

Description

Technical Field

[0001] The present invention relates to the technical field of structural design and processing engineering, and in particular to a geometric segmentation and hierarchical splitting method based on envelopes of different layers. Background Art

[0002] In the engineering field of structural design and processing, the geometric segmentation and hierarchical splitting of three-dimensional models are key links in achieving efficient design, precise processing and subsequent analysis. Traditional methods rely on manual operations to complete geometric segmentation and hierarchical division. The process is cumbersome and inefficient. It is very easy to cause errors such as geometric omissions and hierarchical confusion due to human factors, which seriously affects the quality and processing accuracy of the downstream design. Although computer-aided design (CAD) technology has been widely used in three-dimensional design, there is currently a lack of an efficient method that can automatically segment and split the geometry and hierarchy of structural models based on the spatial relationship of the envelope, which makes it difficult to meet the efficiency and accuracy requirements of geometric processing in engineering practice. For this reason, it is urgent to propose a geometric segmentation and hierarchical splitting method based on different layers of envelopes to solve the pain points of traditional technologies and improve the automation level and reliability of structural design and processing processes. Summary of the Invention

[0003] The purpose of the present invention is to provide a solution to the problem of low efficiency in geometric division and structural hierarchical splitting of structural models in the above-mentioned background technology.

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

[0005] A geometric segmentation and hierarchical splitting method based on envelopes of different layers, comprising the following steps: inputting a parent geometric envelope set {B1, B2…Bn} and its subordinate child envelope sets {b1, b2,…bn} for forming a parent geometric envelope Bn and a child envelope bn, an initial geometric set {G1, G2,…Gn} for forming an initial geometry Gn, and an empty new set L, wherein n in the three sets is a number. The specific steps are as follows:

[0006] S1. Generate a node Hn corresponding to each parent envelope Bn in the parent envelope set {B1, B2…Bn}, where the level of the node Hn is the initial level p;

[0007] S2. Traverse the initial geometry Gn in the initial geometry set and determine the inclusion relationship with the parent envelope Bn, select all initial geometry Gn that are partially or completely included in each parent envelope Bn, and store them in the new set L;

[0008] S3. Determine the inclusion relationship between the parent envelope Bn and the child envelope bn. If the corresponding child envelope bn is in the parent envelope Bn, then generate a level h corresponding to the child envelope under the node H corresponding to the parent envelope Bn;

[0009] S4. Traverse the geometry in the new set L and determine the inclusion relationship with the corresponding sub-level envelope bn and the corresponding level hn, and process the geometry and sub-level envelope and the corresponding level in the new set L according to the inclusion relationship, and finally obtain a structure tree.

[0010] Further,

[0011] In S2, the specific steps of selecting all initial geometries Gn that intersect with each parent envelope Bn and forming a new set L are:

[0012] S20. Traverse the initial geometry set {G1, G2, ...Gn} and determine the inclusion relationship between each initial geometry Gn and each parent envelope Bn. If the initial geometry Gn is completely contained in the parent envelope Bn, rotate it S21. If the initial geometry Gn is partially in the parent envelope Bn, rotate it S22. If the initial geometry Gn is completely outside the parent envelope Bn, rotate it S23.

[0013] S21. Store the corresponding initial geometry Gn into the new set L;

[0014] S22. Take the partial geometry Gn' of the corresponding initial geometry Gn contained in the parent envelope Bn and store the partial geometry Gn' in the new set L;

[0015] S23. Discard the corresponding initial geometry Gn.

[0016] Further,

[0017] There are three types of inclusion relationships between the new geometry in the new set L and the sub-level envelope bn, namely: the new geometry in the new set L is completely included in the sub-level envelope bn, the new geometry in the new set L is partially included in the sub-level envelope bn, and the new geometry in the new set L is completely not in the sub-level envelope bn.

[0018] Further,

[0019] The processing steps for the case where the new geometry in the new set L is completely contained in the corresponding sub-level envelope bn are:

[0020] S40. Query the initial level P to which the new geometry in the new set L belongs according to the level h corresponding to the corresponding sub-level envelope bn, and generate a level P' corresponding to the initial level P under the corresponding level h;

[0021] S41. Copy the new geometry to generate a new geometry Gn' and place it in the level P'.

[0022] Further,

[0023] The processing steps for the case where the new geometric part of the new set L is contained in the sub-level envelope bn are:

[0024] S50. Query the sub-level envelope bn to which the new geometry belongs, and generate a level P' corresponding to the initial level P under the level h corresponding to the sub-level envelope bn;

[0025] S51. Copy the new geometry to obtain the copied geometry Gt;

[0026] S52. Use the corresponding sub-level envelope b to split the copied geometry Gt, take the part inside the corresponding sub-level envelope bn, obtain the internal geometry Gtp and put it into the level P';

[0027] S53. Generate an independent geometry level Geo_Hn belonging to the corresponding parent level Hn under the parent level Hn corresponding to the child level envelope bn;

[0028] S54. Generate a level P' corresponding to the initial level P under the Geo_Hn level;

[0029] S55. Take the part of the new geometry outside the child envelope bn as the external geometry Gtp and put it into the level P'.

[0030] Further,

[0031] The processing steps when the new geometry in the new set L is not within the sub-level envelope bn are:

[0032] S60. Find the level Hn corresponding to the parent volume Bn of the new geometry, and generate an independent geometry level Geo_Hn under the corresponding level Hn;

[0033] S61. Generate a level P' corresponding to the initial level P under the Geo_Hn level;

[0034] S62. Take the part of the new geometry outside the child envelope bn as the external geometry Gtp and put it into the level P'.

[0035] Further,

[0036] The number n is unique within each set and each level.

[0037] The present invention has the beneficial effects:

[0038] 1. This invention realizes the automatic screening, segmentation and hierarchical allocation of geometric elements by judging the inclusion relationship (complete inclusion, partial intersection, non-inclusion) between the initial geometry and the parent and child envelopes, thus avoiding data redundancy and invalid information interference caused by manual intervention.

[0039] 2. For the three relationships between sub-level envelopes and geometry (complete inclusion, partial intersection, and non-inclusion), copying, clipping, and independent hierarchical storage are used respectively to ensure the reasonable attribution of geometric elements in the hierarchical structure, maintain the original hierarchical logical consistency, and avoid hierarchical confusion.

[0040] 3. The traceability and integrity of geometric data are guaranteed through number uniqueness constraints, reducing errors caused by duplicate numbers or logical confusion. Overall, the automation of geometric segmentation and hierarchical splitting is achieved, significantly improving the accuracy and efficiency of the design and manufacturing process. It provides a reliable hierarchical data foundation for subsequent structural design, processing and analysis, and meets the needs of efficient and accurate geometric processing in engineering practice. BRIEF DESCRIPTION OF THE DRAWINGS

[0041] Figure 1 This is a logical schematic diagram of the present invention;

[0042] Figure 2 It is a schematic diagram of the relationship between the initial geometry and the corresponding parent envelope;

[0043] Figure 3 It is a schematic diagram of the relationship between the parent envelope and the internal child envelope;

[0044] Figure 4 Generate the results and geometric correspondence diagrams for the hierarchical levels of the new geometry in the new set L that is fully contained and partially contained in the corresponding sub-level envelope bn;

[0045] Figure 5 Schematic diagram of the hierarchical and geometric correspondence relationship between the new geometry in the new set L that is not included in the corresponding sub-level envelope bn. DETAILED DESCRIPTION

[0046] 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.

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

[0048] A geometric segmentation and hierarchical splitting method based on envelopes of different layers, comprising the following steps: inputting a parent geometric envelope set {B1, B2…Bn} and its subordinate child envelope sets {b1, b2,…bn} for forming a parent geometric envelope Bn and a child envelope bn, an initial geometric set {G1, G2,…Gn} for forming an initial geometry Gn, and an empty new set L, wherein n in the three sets is a number. The specific steps are as follows:

[0049] S1. Generate a node Hn corresponding to each parent envelope Bn in the parent envelope set {B1, B2…Bn}, where the level of the node Hn is the initial level p;

[0050] S2. Traverse the initial geometry Gn in the initial geometry set and determine the inclusion relationship with the parent envelope Bn, select all initial geometry Gn that are partially or completely included in each parent envelope Bn, and store them in the new set L;

[0051] S3. Determine the inclusion relationship between the parent envelope Bn and the child envelope bn. If the corresponding child envelope bn is in the parent envelope Bn, then generate a level h corresponding to the child envelope under the node H corresponding to the parent envelope Bn;

[0052] S4. Traverse the geometry in the new set L and determine the inclusion relationship with the corresponding sub-level envelope bn and the corresponding level hn, and process the geometry and sub-level envelope and the corresponding level in the new set L according to the inclusion relationship, and finally obtain a structure tree.

[0053] like Figure 3 As shown, the outer layer is the parent envelope Bn, and the parent envelope Bn contains the subordinate child envelope bn corresponding to the parent envelope Bn.

[0054] Further,

[0055] The specific steps of selecting all the initial geometries Gn that intersect with each parent envelope Bn in S2 and forming a new set L are as follows:

[0056] S20. Traverse the initial geometry set {G1, G2, ...Gn} and determine the inclusion relationship between each initial geometry Gn and each parent envelope Bn. If the initial geometry Gn is completely contained in the parent envelope Bn, rotate it S21. If the initial geometry Gn is partially in the parent envelope Bn, rotate it S22. If the initial geometry Gn is completely outside the parent envelope Bn, rotate it S23.

[0057] S21. Store the corresponding initial geometry Gn into the new set L;

[0058] S22. Take the partial geometry Gn' of the corresponding initial geometry Gn contained in the parent envelope Bn and store the partial geometry Gn' in the new set L;

[0059] S23. Discard the corresponding initial geometry Gn.

[0060] like Figure 2As shown, the outer rectangle is the parent envelope Bn, and the inner shaded part is the initial geometry Gn. It realizes accurate screening and segmentation of the geometry by judging the three kinds of inclusion relationships between the initial geometry Gn and the parent envelope Bn. Those not included are directly discarded, so as to achieve the effect of placing the initial geometry Gn or the part of the initial geometry Gn contained by the parent envelope Bn into the corresponding parent envelope Bn, avoiding the interference of invalid data, improving the accuracy and efficiency of subsequent level unpacking, and reducing data redundancy.

[0061] In one embodiment, the parent volume B1 is a cubic space. The initial geometry G2 is a cylinder completely contained within B1. The initial geometry G5 is a cone that intersects the parent volume B1. The initial geometry G1 is a sphere completely outside the parent volume B1. During processing, G2 is directly stored in the set L and its number is retained. The portion of G5 that intersects B1, G5', is extracted and stored in L, still numbered G5. G1 is discarded because it is completely outside. The final set L contains only the valid geometries G2 and G5' within B1, providing a clean data foundation for subsequent hierarchical decomposition.

[0062] Further,

[0063] There are three types of inclusion relationships between the new geometry in the new set L and the sub-level envelope bn, namely: the new geometry in the new set L is completely included in the sub-level envelope bn, the new geometry in the new set L is partially included in the sub-level envelope bn, and the new geometry in the new set L is completely not in the sub-level envelope bn.

[0064] Further,

[0065] The processing steps for the case where the new geometry in the new set L is completely contained in the corresponding sub-level envelope bn are:

[0066] S40. Query the initial level P to which the new geometry in the new set L belongs according to the level h corresponding to the corresponding sub-level envelope bn, and generate a level P' corresponding to the initial level P under the corresponding level h;

[0067] S41. Copy the new geometry to generate a new geometry Gn' and place it in the level P'.

[0068] When the new geometry in the new set L is completely contained in the sub-level envelope bn, by copying the new geometry and generating a sub-level P' corresponding to the original level under the sub-level h, the consistency of the original level logic can be maintained, ensuring the reasonable attribution of geometric elements in the new level structure and avoiding level confusion.

[0069] In one embodiment, if Figure 4 As shown, under different parent levels Hn, the P' level (such as P1', P2') will automatically generate sub-levels. The generated sub-levels are different and unique. Figure 4Sub-level hierarchies in the model include P1'-2, P1'-3, P1'-4, P2'-1, and P2'-3. For example, within parent level H1 (corresponding to B1), child volume b1 contains geometry G2 (originally from initial level P1) and G3 (originally from P1). During processing, P1' is first generated at level h1, corresponding to P1. Then, G2 and G3 are copied to G2' and G3', respectively, and stored at level P1'. Sub-level P1'-2 is automatically generated at P1', with G2' and G3' ultimately stored at sub-level P1'-2. Finally, level P1', under level h1, fully retains the geometry within level b1 from the original P1 level, creating a clear hierarchical structure that facilitates subsequent specialized design or machining operations targeting the b1 region.

[0070] Further,

[0071] The processing steps for the case where the new geometric part of the new set L is contained in the sub-level envelope bn are:

[0072] S50. Query the sub-level envelope bn to which the new geometry belongs, and generate a level P' corresponding to the initial level P under the level h corresponding to the sub-level envelope bn;

[0073] S51. Copy the new geometry to obtain the copied geometry Gt;

[0074] S52. Use the corresponding sub-level envelope b to split the copied geometry Gt, take the part inside the corresponding sub-level envelope bn, obtain the internal geometry Gtp and put it into the level P';

[0075] S53. Generate an independent geometry level Geo_Hn belonging to the corresponding parent level Hn under the parent level Hn corresponding to the child level envelope bn;

[0076] S54. Generate a level P 'corresponding to the initial level P under the Geo_Hn level;

[0077] S55. Take the part of the new geometry outside the child envelope bn as the external geometry Gtp and put it into the level P'.

[0078] For new geometries that are partially contained in the sub-level envelope bn, the internal part is extracted by copying and then clipping, which can accurately split the geometric elements and ensure that each sub-level only contains the local structure related to the envelope, avoiding cross-regional geometric interference.

[0079] In one embodiment, if Figure 4As shown, under different parent hierarchies Hn, the P' level (such as P1' and P2') automatically generates sub-levels. The generated sub-levels are different and unique. For example, the new geometry G7 is a cuboid spanning the sub-level envelopes b2 and b3, with part of it located within b2. During processing, a sub-level P1' of the original level P1 is first generated under the h2 level corresponding to b2. Then, G7 is copied to Gt, which is clipped with the boundary of b2. The part Gtp7 inside b2 is extracted and stored in the P1' level. After storing it under the P1' level, the sub-level P1'-4 is automatically generated under the P1' level. Gtp7 is finally stored in the sub-level P1'-4. Finally, the h2 level P1' contains only the local geometry where G7 intersects with b2, while the b3 level processes the other part of G7. This achieves a reasonable division of the same geometry into different sub-level envelopes, facilitating independent operation of each region.

[0080] Further,

[0081] The processing steps when the new geometry in the set L is not within the sub-level envelope bn are:

[0082] S60. Find the level Hn corresponding to the parent volume Bn of the new geometry, and generate an independent geometry level Geo_Hn under the corresponding level Hn;

[0083] S61. Generate a level P' corresponding to the initial level P under the Geo_Hn level;

[0084] S62. Take the part of the new geometry outside the child envelope bn as the external geometry Gtp and put it into the level P'.

[0085] When new geometry is completely uncontained by any child volume bn, an independent geometry level, Geo_Hn, is created under the parent level Hn. The external portion of the geometry is extracted and stored in the corresponding level. This allows geometric elements that do not belong to any subdivision to be classified separately, avoiding confusion with geometry in the child volume levels. This approach ensures the integrity of the hierarchical structure and provides a clear entry point for global or cross-region geometry management.

[0086] In one embodiment, if Figure 5As shown, P' levels (such as P1', P2') corresponding to the original levels of the new geometry are generated under different independent levels (such as Geo_H3, Geo_H2), and the sub-level levels (such as P2'-4, P1'-4) automatically generated under the P' level are different and unique; for example, the new geometry G11 is located in the parent envelope B3, but is not contained in any child envelopes b4, b5 of the parent envelope B3. During processing, first generate an independent level Geo_H3 under the parent level H3 corresponding to B3, then create P2' corresponding to the original level P2 of G11 under Geo_H3, extract the part Gtp11 outside all child envelopes of G11 and store it in the P2' level. When storing it in the P2' level, the secondary level P2'-4 will be automatically generated under the P2' level, and Gtp11 will be finally stored in the secondary level P2'-4. Finally, the Geo_H3 level clearly contains the unsubdivided geometry within the B3 range, making it convenient for designers to quickly locate the global structure or process cross-regional connections.

[0087] Further,

[0088] The number n is unique within each set and each level.

[0089] All geometries, volumes, levels, and nodes are uniquely numbered, and the correspondence between numbers and geometric integrity is verified during output to ensure data traceability and completeness. This avoids logical confusion caused by duplicate numbering and improves the reliability of the entire method by preventing human or algorithmic errors through integrity checks.

[0090] In one embodiment, when generating new geometries G' and Gtp, the numbers are retained consistent with the original geometries (e.g., G2' corresponds to the original G2, and Gtp7 corresponds to the original G7). During output, the hierarchical structure is visualized using a mind map to verify the mapping relationship between the new geometries and the original geometries. For example, this verifies that geometries G2 and G5' in set L are correctly split into corresponding sub-levels and that no redundant geometries are generated, ensuring that the final hierarchical structure fully meets the design requirements.

[0091] 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 be able to make various modifications and improvements without departing from the spirit and substance of the present invention, and such modifications and improvements are also considered to be within the scope of protection of the present invention.

Claims

1. A geometric segmentation and hierarchical splitting method based on envelopes of different layers, characterized in that: It includes the input geometric parent envelope set {B1, B2...Bn} and its subordinate child envelope set {b1, b2,...bn} used to form the geometric parent envelope Bn and the child envelope bn, the initial geometric set {G1, G2,...Gn} forming the initial geometry Gn, and an empty new set L, where n in the three sets is a number. The specific steps are: S1. Generate a node Hn corresponding to each parent envelope Bn in the parent envelope set {B1, B2…Bn}, where the level of the node Hn is the initial level p; S2. Traverse the initial geometry Gn in the initial geometry set {G1, G2, ...Gn} and determine the inclusion relationship with the parent envelope Bn. Select all initial geometry Gn that are partially or completely included in each parent envelope Bn and store them in the new set L; S3. Determine the inclusion relationship between the parent envelope Bn and the child envelope bn. If the corresponding child envelope bn is in the parent envelope Bn, then generate a level h corresponding to the child envelope under the node H corresponding to the parent envelope Bn; S4. Traverse the new geometry in the new set L and determine the inclusion relationship with the corresponding sub-envelope bn and the corresponding level hn and process the new geometry and sub-envelope in the new set L and the corresponding level according to the inclusion relationship to finally obtain a structure tree; The inclusion relationship between the new geometry in the new set L and the sub-level envelope bn and the corresponding level hn includes that the new geometry in the new set L is completely included in the sub-level envelope bn, the new geometry in the new set L is partially included in the sub-level envelope bn, and the new geometry in the new set L is completely not in the sub-level envelope bn; The specific processing steps when the new geometry in the new set L is completely contained in the corresponding sub-level envelope bn are: S40. Query the initial level P to which the new geometry in the new set L belongs according to the level h corresponding to the corresponding sub-level envelope bn, and generate a level P' corresponding to the initial level P under the corresponding level h; S41. Copy the new geometry to generate a new geometry Gn' and place it in level P'; The specific processing steps when the new geometric part in the new set L is included in the sub-level envelope bn are: S400. Query the sub-level envelop bn to which the new geometry belongs, and generate a level P' corresponding to the initial level P under the level h corresponding to the sub-level envelop bn; S401. Copy the new geometry to obtain the copied geometry Gt; S402. Use the corresponding sub-level envelope bn to split the copied geometry Gt, take the part inside the corresponding sub-level envelope bn, obtain the internal geometry Gtp and put it into the level P'; S403. Find the level Hn corresponding to the parent level envelope Bn of the child level envelope bn, and generate an independent geometric level Geo_Hn under the corresponding level Hn; S404. Generate a level P' corresponding to the initial level P under the Geo_Hn level; S405. Take the part of the new geometry outside the sub-level envelope bn as the external geometry Gtp and put it into the level P'.

2. The method of geometric segmentation and hierarchical splitting based on envelopes of different layers according to claim 1, characterized in that: In S2, the specific steps of selecting all initial geometries Gn that intersect with each parent envelope Bn and forming a new set L are: S20. Traverse the initial geometry set {G1, G2, ...Gn} and determine the inclusion relationship between each initial geometry Gn and each parent envelope Bn. If the initial geometry Gn is completely contained in the parent envelope Bn, rotate it S21. If the initial geometry Gn is partially in the parent envelope Bn, rotate it S22. If the initial geometry Gn is completely outside the parent envelope Bn, rotate it S23. S21. Store the corresponding initial geometry Gn into the new set L; S22. Take the partial geometry Gn' of the corresponding initial geometry Gn contained in the parent envelope Bn and store the partial geometry Gn' in the new set L; S23. Discard the corresponding initial geometry Gn.

3. The method of geometric segmentation and hierarchical splitting based on envelopes of different layers according to claim 1, characterized in that: The processing steps when the new geometry in the new set L is not within the sub-level envelope bn are: S4000. Find the level Hn corresponding to the parent volume Bn of the new geometry, and generate an independent geometry level Geo_Hn under the corresponding level Hn; S4001. Generate a level P' corresponding to the initial level P under the Geo_Hn level; S4002. Take the part of the new geometry outside the sub-level envelope bn as the external geometry Gtp and put it into the level P'.

4. The method of geometric segmentation and hierarchical splitting based on envelopes of different layers according to claim 3, characterized in that: The number n is unique within each set and each level.

Images