A method for representing three-dimensional mesh models based on quadrilateral patch chain codes
By representing a three-dimensional grid model based on quadrilateral panel chain code, the problem of large storage space and long decoding call time in the prior art is solved, and a more compact data representation and efficient decoding process are realized.
Patent Information
- Application Number
- CN202111561017.0
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2021-12-15
- Publication Date
- 2024-12-03
- Estimated Expiration
- 2041-12-15
AI Technical Summary
In the chain code method of the existing three-dimensional grid model, the use of triangle patches often results in gaps and holes in the re-expression model, and the normal vector information of the patches is not effectively saved, resulting in mismatch with the current three-dimensional modeling technology. The space occupies a lot and the decoding call time is longer.
The method of representing a three-dimensional mesh model based on the quadrilateral panel chain code is adopted. Through preprocessing and standardization, data accuracy loss is reduced, and quadrilateral panels are used for encoding to generate a more compact coding sequence, reducing the storage space occupation and decoding call time.
Under the premise of a small amount of loss of the three-dimensional grid model accuracy, the storage space occupation and decoding and calling time of the three-dimensional grid model are significantly reduced, and the data compactness and processing efficiency are improved.
Smart Images

Figure CN114239361B_ABST
Abstract
Description
Technical Field
[0001] The present invention belongs to the technical field of coding description of three-dimensional mesh models, and in particular relates to a method for representing three-dimensional mesh models based on quadrilateral facet chain codes. Background Art
[0002] Chain code technology is a technical method that encodes and describes curves or boundaries through a starting coordinate and a moving direction. It is widely used in the field of graphics and image science due to its advantages such as good regional boundary expression ability and small storage space occupation. In the study of two-dimensional graphics and images, the commonly used chain code methods include Freeman chain code, vertex chain code, angle difference Freeman chain code, Huffman coding vertex chain code, etc. In the study of three-dimensional graphics and images, triangle patch chain code and mixed patch chain code have appeared. At present, the application of chain code methods makes the re-expressed model have more concentrated or scattered gaps and holes. In the previous methods, triangle patches were used more as the basic research objects, and the normal vector information of model patches was rarely saved, which made it not well matched with the current three-dimensional modeling technology. Summary of the invention
[0003] In order to solve the deficiencies in the prior art, the present invention provides a method for representing a three-dimensional mesh model based on a quadrilateral face chain code, which reduces the storage space occupied and the decoding call time of the three-dimensional mesh model data with a small loss of the accuracy of the three-dimensional mesh model.
[0004] The technical solution adopted by the present invention to solve the technical problem is: a method for representing a three-dimensional grid model based on a quadrilateral face chain code, comprising the following steps:
[0005] S1: Input 3D mesh model;
[0006] S2: preprocessing the three-dimensional mesh model to obtain a superimposed point simplified three-dimensional mesh model;
[0007] S3: Normalize and reconstruct the overlapping point simplified three-dimensional mesh model to obtain a normalized three-dimensional mesh model based on quadrilateral patches;
[0008] S4: Encode the quadrilateral facets of the normalized three-dimensional mesh model to obtain a three-dimensional mesh model encoding sequence represented by a quadrilateral facet chain code.
[0009] As a further embodiment of the present invention, step S2 comprises:
[0010] S21: taking all vertices of the three-dimensional mesh model as a benchmark, counting the triangle clusters appearing on the surface of the three-dimensional mesh model;
[0011] S22: Simulate merging the center point in the triangle cluster with the nearest boundary point;
[0012] S23: Calculate the angle values between triangle groups with the same base in the triangle cluster before and after the simulation merger;
[0013] S24: If more than 70% of the triangle groups in a single triangle cluster have a normal vector cosine value greater than 0.85, a simulation merge is performed to complete the data modification;
[0014] S25: In the triangle cluster that has been merged, all points are recorded as not being mergeable again;
[0015] S26: Repeat steps S22, S23, S24, and S25 until all triangle clusters cannot be merged again, thereby obtaining a preprocessed overlapping point simplified three-dimensional mesh model.
[0016] As a further embodiment of the present invention, step S3 comprises:
[0017] S31: Set the precision step value;
[0018] S32: using the precision step value as a unit, using planes parallel to each plane of the spatial rectangular coordinate system to complete the segmentation of the spatial rectangular coordinate system to generate a plurality of unit cubes;
[0019] S33: placing the overlapping point simplified three-dimensional mesh model in the divided space rectangular coordinate system, and dividing the overlapping point simplified three-dimensional mesh model using unit cubes in the space rectangular coordinate system;
[0020] S34: determining the positional relationship between the calculation unit cube and each facet of the overlapping point simplified three-dimensional mesh model, and if there are two or more intersection points between the facet of the overlapping point simplified three-dimensional mesh model and the unit cube, saving the unit cube;
[0021] S35: Repeat step S34 until all overlapping simplified three-dimensional mesh model facets have completed the intersection determination calculation with the unit cube, and obtain a normalized three-dimensional mesh model based on quadrilateral facets.
[0022] As a further embodiment of the present invention, step S4 comprises:
[0023] S41: selecting a main dimension traversal direction, layering the normalized three-dimensional mesh model according to the unit cube precision step value, so that the quadrilateral facets in the main dimension traversal direction are classified into the same layer, and storing the precision step value;
[0024] S42: determining whether the edges in the normalized three-dimensional mesh model layer are used by quadrilateral face patches, determining the starting edge of the layer quadrilateral face patch chain, and in the main dimension traversal direction, using the quadrilateral face patch of the starting edge as the starting face patch of the quadrilateral face patch chain;
[0025] S43: Starting from the starting face, traversing the direction according to the main dimension, in the quadrilateral face layer, searching for all the quadrilateral face that are connected, valid and form a quadrilateral face chain;
[0026] S44: Determine the type of each quadrilateral patch in the quadrilateral patch chain, and complete the binary encoding of the common patch according to the type. If quadrilateral patches with the same normal vector appear continuously in the quadrilateral patch chain, set the binary encoding of the common patch to the binary encoding of the counting patch, and append the binary expression of the number of times the same type of patch appears after the binary encoding of the counting patch, and the count value is at most 15.
[0027] S45: repeating steps S42, S43, and S44 until all layers are traversed and each layer uses a quadrilateral face chain to complete face storage; if the starting edge reference coordinates of several quadrilateral face chains have two identical dimension values, the quadrilateral face chains of each layer are combined into a long chain;
[0028] S46: Repeat step S45 until all layers of quadrilateral face chains are merged at most once, and obtain a three-dimensional mesh model coding sequence represented by the quadrilateral face chain code.
[0029] As a further implementation of the present invention, in step S42, when an edge in a normalized three-dimensional mesh model layer is used by two adjacent quadrilateral facets on the same unit cube, or is used by two non-identical coincident faces or two non-identical adjacent faces with the same normal vector direction on adjacent unit cubes, the edge can be used as the starting edge of a layer quadrilateral facet chain, and the head of the quadrilateral facet chain stores the coordinate value of the edge reference point;
[0030] As a further implementation of the present invention, in step S43, when there are reasonable branch quadrilateral patches of the side dimension among the quadrilateral patches in the traversal direction of the main dimension, the branch quadrilateral patches of the side dimension are integrated into the quadrilateral patch chain.
[0031] As a further implementation of the present invention, the side edges coplanar with the edges in the traversal direction of the main dimension are only used by one preceding face and one lateral face, which means that there are reasonable lateral branch quadrilateral face patches.
[0032] As a further implementation scheme of the present invention, in step S45, the starting edge coordinate reference values of each layer of quadrilateral face chain are summarized, and the minimum value in different coordinate value dimensions is used as a reference to calculate the difference between the different coordinate dimension values and the minimum reference value between each layer of quadrilateral face chain. The starting coordinate reference value of the non-minimum quadrilateral face chain is replaced by the binary code value marked with different dimensions, the binary form of the ratio of the difference to the precision step value, and the end code value to complete the combination of each layer of quadrilateral face chain.
[0033] The beneficial effects of the present invention include: reducing the storage space occupied by the three-dimensional mesh model data and the decoding call time under the premise of slightly losing the accuracy of the three-dimensional mesh model. BRIEF DESCRIPTION OF THE DRAWINGS
[0034] Figure 1 It is a schematic diagram of vertex position determination of three-dimensional angles;
[0035] Figure 2 Schematic diagram of vertex position determination of two-dimensional angle (1);
[0036] Figure 3 Schematic diagram of vertex position determination of two-dimensional angle (2);
[0037] Figure 4 Schematic diagram for determining the vertex position of a two-dimensional angle (3);
[0038] Figure 5 It is a schematic diagram of surface position determination at a three-dimensional angle;
[0039] Figure 6 It is a schematic diagram of unit cube stacking and face traversal in three-dimensional perspective;
[0040] Figure 7 Schematic diagram of the invalid faces and edges of a four-unit cube stack;
[0041] Figure 8 This is a schematic diagram for entering the side dimension traversal;
[0042] Fig. 9 Schematic diagram of a unit cube. DETAILED DESCRIPTION
[0043] The technical solution of the present invention will be described clearly and completely below in conjunction with the accompanying drawings. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of them. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.
[0044] In the description of the present invention, it should be noted that the terms "vertical", "horizontal", "inside", "outside" and the like indicate positions or positional relationships based on the positions or positional relationships shown in the drawings, and are only for the convenience of describing the present invention and simplifying the description, rather than indicating or implying that the device or component referred to must have a specific orientation, be constructed and operated in a specific orientation, and therefore cannot be understood as limiting the present invention. In addition, the terms "first", "second", and "third" are only used to distinguish components, and cannot be understood as indicating or implying relative importance.
[0045] In addition, the technical features involved in the different embodiments of the present invention described below can be combined with each other as long as they do not conflict with each other.
[0046] Example 1
[0047] A method for representing a three-dimensional mesh model based on a quadrilateral face chain code comprises the following steps:
[0048] S1: Input 3D mesh model;
[0049] S2: preprocessing the three-dimensional mesh model to obtain a superimposed point simplified three-dimensional mesh model;
[0050] S21: taking all vertices of the three-dimensional mesh model as a benchmark, counting the triangle clusters appearing on the surface of the three-dimensional mesh model;
[0051] S22: Simulate merging the center point in the triangle cluster with the nearest boundary point;
[0052] S23: Calculate the angle values between triangle groups with the same base in the triangle cluster before and after the simulation merger;
[0053] S24: If more than 70% of the triangle groups in a single triangle cluster have a normal vector cosine value greater than 0.85, a simulation merge is performed to complete the data modification;
[0054] S25: In the triangle cluster that has been merged, all points are recorded as not being mergeable again;
[0055] S26: Repeat steps S22, S23, S24, and S25 until all triangle clusters cannot be merged again, thereby obtaining a preprocessed overlapping point simplified three-dimensional mesh model.
[0056] S3: Normalize and reconstruct the overlapping point simplified three-dimensional mesh model to obtain a normalized three-dimensional mesh model based on quadrilateral patches;
[0057] S31: Set the precision step value;
[0058] S32: using the precision step value as a unit, using planes parallel to each plane of the spatial rectangular coordinate system to complete the segmentation of the spatial rectangular coordinate system to generate a plurality of unit cubes;
[0059] S33: placing the overlapping point simplified three-dimensional mesh model in the divided space rectangular coordinate system, and dividing the overlapping point simplified three-dimensional mesh model using unit cubes in the space rectangular coordinate system;
[0060] S34: determining the positional relationship between the calculation unit cube and each facet of the overlapping point simplified three-dimensional mesh model, and if there are two or more intersection points between the facet of the overlapping point simplified three-dimensional mesh model and the unit cube, saving the unit cube;
[0061] S35: Repeat step S34 until all overlapping simplified three-dimensional mesh model facets have completed the intersection determination calculation with the unit cube, and obtain a normalized three-dimensional mesh model based on quadrilateral facets.
[0062] S4: Encode the quadrilateral facets of the normalized three-dimensional mesh model to obtain a three-dimensional mesh model encoding sequence represented by a quadrilateral facet chain code;
[0063] S41: selecting a main dimension traversal direction, layering the normalized three-dimensional mesh model according to the unit cube precision step value, so that the quadrilateral facets in the main dimension traversal direction are classified into the same layer, and storing the precision step value;
[0064] S42: determining whether the edges in the normalized three-dimensional mesh model layer are used by quadrilateral face patches, determining the starting edge of the layer quadrilateral face patch chain, and in the main dimension traversal direction, using the quadrilateral face patch of the starting edge as the starting face patch of the quadrilateral face patch chain;
[0065] In the above implementation scheme, when an edge in a normalized three-dimensional mesh model layer is used by two adjacent quadrilateral facets on the same unit cube, or by two non-identical coincident faces or two non-identical adjacent faces with the same normal vector direction on adjacent unit cubes, the edge can be used as the starting edge of the layer quadrilateral facet chain, and the head of the quadrilateral facet chain stores the coordinate value of the edge reference point;
[0066] S43: Starting from the starting face, traversing the direction according to the main dimension, in the quadrilateral face layer, searching for all the quadrilateral face that are connected, valid and form a quadrilateral face chain;
[0067] In the above implementation scheme, when there are reasonable branch quadrilateral facets in the side dimension among the quadrilateral facets in the traversal direction of the main dimension, the branch quadrilateral facets in the side dimension are integrated into the quadrilateral facet chain.
[0068] It should be noted that the side edge coplanar with the edge in the traversal direction of the main dimension is only used by one preceding face and one side dimension face, which means that there is a reasonable side dimension branch quadrilateral face;
[0069] S44: Determine the type of each quadrilateral patch in the quadrilateral patch chain, and complete the binary encoding of the common patch according to the type. If quadrilateral patches with the same normal vector appear continuously in the quadrilateral patch chain, set the binary encoding of the common patch to the binary encoding of the counting patch, and append the binary expression of the number of times the same type of patch appears after the binary encoding of the counting patch, and the count value is at most 15.
[0070] S45: repeating steps S42, S43, and S44 until all layers are traversed and each layer uses a quadrilateral face chain to complete face storage; if the starting edge reference coordinates of several quadrilateral face chains have two identical dimension values, the quadrilateral face chains of each layer are combined into a long chain;
[0071] In the above implementation scheme, the starting edge coordinate reference values of each layer of quadrilateral face chain are summarized, and the minimum value in different coordinate value dimensions is used as a reference to calculate the difference between the different coordinate dimension values and the minimum reference value between the quadrilateral face chains of each layer. The starting coordinate reference value of the non-minimum quadrilateral face chain is replaced by the binary code value of the different dimension mark, the binary form of the ratio of the difference value to the precision step value, and the end code value to complete the combination of each layer of quadrilateral face chain;
[0072] S46: Repeat step S45 until all layers of quadrilateral face chains are merged at most once, and obtain a three-dimensional mesh model coding sequence represented by the quadrilateral face chain code.
[0073] Example 2
[0074] This embodiment provides a specific implementation scheme for determining the positional relationship between the unit cube and each facet of the overlapping point simplified three-dimensional mesh model in step S34 of embodiment 1:
[0075] If any vertex of the triangular patch is within the detected unit cube, the triangular patch must pass through the current unit cube and save the unit cube, such as Figure 1 -a as shown;
[0076] If any two points of a triangular patch are located on different faces of the detected unit cube, the triangular patch must pass through the current unit cube and save the unit cube, such as Figure 1 -b as shown;
[0077] If all points of the triangular patch are located on the same face of the detected unit cube, the triangular patch coincides with the face of the detected unit cube, and the unit cube is saved, such as Figure 1 -c as shown;
[0078] If two points of the triangular patch are located on the same face of the unit cube being tested, but at least one point is not on the edge of the unit cube face, and the third point is located on the plane where the unit cube face is located, the triangular patch coincides with the unit cube face being tested, and the unit cube is saved. Figure 2 -a, Figure 2 -b as shown;
[0079] If two points of the triangular patch are located on the same face of the unit cube being detected, but not on the edge of the same unit cube face, and the third point is located on the plane where the unit cube face is located, the triangular patch coincides with the unit cube face being detected, and the unit cube is saved. Figure 2 -c as shown;
[0080] If two points of the triangular patch are located on the same edge of the same face of the unit cube being detected, and the third point is located on the plane where the unit cube face is located, the straight line between the two points will divide the two-dimensional plane into the unit cube face direction and the non-unit cube face direction. When the third point is located in the unit cube face direction, the triangular patch coincides with the unit cube face being detected, and the unit cube is saved. Figure 2 -d as shown;
[0081] If one point of the triangular patch is located on the surface of the unit cube being detected, but not on the edge of the unit cube surface, and the other two points are located on the plane where the unit cube surface is located, the triangular patch coincides with the surface of the unit cube being detected, and the unit cube is saved, such as Figure 3 -a as shown;
[0082] If a point of the triangular patch is located on the unit cube face to be detected and on the edge of the unit cube face, the straight line where the edge is located will divide the two-dimensional plane into the unit cube face direction and the non-unit cube face direction. Among the other two points, when any one point is located in the unit cube face direction, the triangular patch coincides with the unit cube face to be detected, and the unit cube is saved. Figure 3 -b, Figure 3 -c, Figure 3 -d as shown;
[0083] If no point of the triangular patch is located on the unit cube face to be detected, but all points are located on the plane where the same unit cube face is located, when the straight line where any two points of the triangular patch are located has two reasonable intersections with the unit cube face edge, the triangular patch coincides with the unit cube face to be detected, and the unit cube is saved, such as Figure 4 -a as shown;
[0084] If no point of the triangular patch is located on the unit cube face to be detected, but all points are located on the plane where the same unit cube face is located, when the straight line where any two points of the triangular patch are located has a reasonable intersection with the unit cube face edge, the straight line divides the two-dimensional plane into the unit cube face direction and the non-unit cube face direction, and when the third point is located in the unit cube face direction, the triangular patch coincides with the unit cube face to be detected, and the unit cube is saved, such as Figure 4 -b, Figure 4 -c, Figure 4 -d as shown;
[0085] If the triangular patch does not coincide with any unit cube face or the plane where the unit cube face is located, but intersects with the unit cubes and there are 3 or 4 reasonable intersection points, the triangular patch passes through the detected unit cube and the unit cube is saved, such as Figure 5 As shown;
[0086] If the triangular patch does not coincide with any unit cube face or the plane where the unit cube face is located, but there are 0 to 2 reasonable intersections with the unit cube, and any edge of the triangular patch has an in-plane intersection with the unit cube face being detected, the triangular patch passes through the unit cube being detected and the unit cube is saved.
[0087] Example 3
[0088] This embodiment provides a specific implementation plan for the main dimension traversal and the integration of the side dimension traversal in step S4 of embodiment 1:
[0089] The specific meanings of the main dimension preceding face, main dimension post-face, main dimension edge, side dimension face and invalid face are given here: the unit cube face that is most recently traversed and saved is the main dimension preceding face, the unit cube face that is about to be traversed and saved is the main dimension post-face, the edge shared by the main dimension preceding face and the main dimension post-face is the main dimension edge, and the unit cube face that is not in the main dimension traversal direction is the side dimension face or invalid face.
[0090] When a principal dimension edge is shared by two unit cube faces, the unit cube faces adjacent to the principal dimension preceding face and using the edge are principal dimension succeeding faces, and the remaining faces are invalid faces, such as Figure 6 -a as shown;
[0091] When a principal dimension edge is shared by four unit cube faces, the four unit cube faces are divided into two groups of the same body, and there is a group of overlapping faces, among the four unit cube faces, the unit cube faces with different bodies and the same normal vector direction as the principal dimension preceding faces are the principal dimension following faces, and the remaining faces are invalid faces, such as Figure 6 -b as shown;
[0092] When a principal dimension edge is shared by four unit cube faces, and the four unit cube faces are divided into two groups of the same body, but there is no overlapping face, among the four unit cube faces, the unit cube faces with different bodies and different normal vector directions from the principal dimension preceding faces are principal dimension following faces, and the remaining faces are invalid faces, such as Figure 6 -c as shown;
[0093] When a principal dimension edge is shared by six unit cube faces, the six unit cube faces are divided into three groups of identical bodies, and there are two pairs of overlapping faces, among the six unit cube faces, the unit cube faces without overlapping faces are the principal dimension subsequent faces, and the remaining faces are invalid faces, such as Figure 6-d as shown;
[0094] When a principal dimension edge is shared by eight unit cube faces, the eight unit cube faces are all invalid faces, such as Figure 7 As shown;
[0095] When the side edge coplanar with the main dimension edge is only used by one preceding face and one side dimension face, the side dimension traversal is added. When a side dimension edge is shared by two unit cube faces, the unit cube face adjacent to the preceding side dimension face and using this edge is the following side dimension face, such as Figure 8 shown.
[0096] Example 4
[0097] This embodiment provides the specific content of the data structure definition.
[0098] The data structure is specifically defined as follows: a quadrilateral patch chain code data structure, which consists of three parts: reference point coordinates, patch common code value or patch count code value and patch count value binary form, and layer conversion mark code value and layer conversion count value binary form. The reference point coordinates are the starting position of the quadrilateral patch chain code, which determines the position of the patch in the chain in the three-dimensional space; the patch common code value is 4 bits, which determines the direction of the patch normal vector; the patch count code value is 4 bits, which determines the direction of the patch normal vector and marks the analysis of the count value following it; the patch count value binary form is 4 bits, which determines the number of times continuous and same type quadrilateral patches appear; the layer conversion mark code value is divided into two parts, the first part is the starting mark value of 4 bits, which determines the layer conversion method, and the second part is the end mark value of 4 bits, which determines the end of the layer conversion calculation; the layer conversion count value binary form is based on 4 bits, and the number of bits is added in multiples of 4 as appropriate, which determines the forward step length when converting layers. All bits can only appear in two states: 0 and 1. Table 1 shows all the code values applicable to the quadrilateral face chain code, where the representation of each face in the unit cube is as follows: Fig. 9 , as shown in Table 2.
[0099] Table 1 Code value settings applicable to quadrilateral patch chain codes
[0100]
[0101] Table 2 The order of vertex numbers of quadrilateral patches based on unit cube faces
[0102]
[0103] Obviously, the above embodiments are merely examples for the purpose of clear explanation, and are not intended to limit the implementation methods. For those skilled in the art, other different forms of changes or modifications can be made based on the above description. It is not necessary and impossible to list all the implementation methods here. The obvious changes or modifications derived therefrom are still within the scope of protection of the present invention.
Claims
1. A method for representing a three-dimensional mesh model based on a quadrilateral face chain code, characterized in that: The steps include: S1: Input 3D mesh model; S2: preprocessing the three-dimensional mesh model to obtain a superimposed point simplified three-dimensional mesh model; S3: Normalize and reconstruct the overlapping point simplified three-dimensional mesh model to obtain a normalized three-dimensional mesh model based on quadrilateral patches; S4: Encode the quadrilateral facets of the normalized three-dimensional mesh model to obtain a three-dimensional mesh model encoding sequence represented by a quadrilateral facet chain code; Step S2 includes: S21: taking all vertices of the three-dimensional mesh model as a benchmark, counting the triangle clusters appearing on the surface of the three-dimensional mesh model; S22: Simulate merging the center point in the triangle cluster with the nearest boundary point; S23: Calculate the angle values between triangle groups with the same base in the triangle cluster before and after the simulation merger; S24: If more than 70% of the triangle groups in a single triangle cluster have a normal vector cosine value greater than 0.85, a simulation merge is performed to complete the data modification; S25: In the triangle cluster that has been merged, all points are recorded as not being mergeable again; S26: repeating steps S22, S23, S24, and S25 until all triangle clusters cannot be merged again, thereby obtaining a preprocessed overlapping point simplified three-dimensional mesh model; Step S3 includes: S31: Set the precision step value; S32: using the precision step value as a unit, using planes parallel to each plane of the spatial rectangular coordinate system to complete the segmentation of the spatial rectangular coordinate system to generate a plurality of unit cubes; S33: placing the overlapping point simplified three-dimensional mesh model in the divided space rectangular coordinate system, and dividing the overlapping point simplified three-dimensional mesh model using unit cubes in the space rectangular coordinate system; S34: determining the positional relationship between the calculation unit cube and each facet of the overlapping point simplified three-dimensional mesh model, and if there are two or more intersection points between the facet of the overlapping point simplified three-dimensional mesh model and the unit cube, saving the unit cube; S35: repeating step S34 until all overlapped simplified three-dimensional mesh model face pieces have completed intersection determination calculations with unit cubes, thereby obtaining a normalized three-dimensional mesh model based on quadrilateral face pieces; Step S4 includes: S41: selecting a main dimension traversal direction, layering the normalized three-dimensional mesh model according to the unit cube precision step value, so that the quadrilateral facets in the main dimension traversal direction are classified into the same layer, and storing the precision step value; S42: determining whether the edges in the normalized three-dimensional mesh model layer are used by quadrilateral face patches, determining the starting edge of the layer quadrilateral face patch chain, and in the main dimension traversal direction, using the quadrilateral face patch of the starting edge as the starting face patch of the quadrilateral face patch chain; S43: Starting from the starting face, traversing the direction according to the main dimension, in the quadrilateral face layer, searching for all the quadrilateral face that are connected, valid and form a quadrilateral face chain; S44: Determine the type of each quadrilateral patch in the quadrilateral patch chain, and complete the binary encoding of the common patch according to the type. If quadrilateral patches with the same normal vector appear continuously in the quadrilateral patch chain, set the binary encoding of the common patch to the binary encoding of the counting patch, and append the binary expression of the number of times the same type of patch appears after the binary encoding of the counting patch, and the count value is at most 15. S45: repeating steps S42, S43, and S44 until all layers are traversed and each layer uses a quadrilateral face chain to complete face storage; if the starting edge reference coordinates of several quadrilateral face chains have two identical dimension values, the quadrilateral face chains of each layer are combined into a long chain; S46: Repeat step S45 until all layers of quadrilateral face chains are merged at most once, and obtain a three-dimensional mesh model coding sequence represented by the quadrilateral face chain code.
2. A method for representing a three-dimensional mesh model based on a quadrilateral face chain code according to claim 1, characterized in that: In step S42, when an edge within a normalized three-dimensional mesh model layer is used by two adjacent quadrilateral facets on the same unit cube, or is used by two non-identical overlapping faces or two non-identical adjacent faces with the same normal vector direction on adjacent unit cubes, the edge serves as the starting edge of the layer quadrilateral facet chain, and the coordinate value of the edge reference point is stored at the head of the quadrilateral facet chain.
3. The method for representing a three-dimensional mesh model based on a quadrilateral face chain code according to claim 1, characterized in that: In step S43, when there are reasonable branch quadrilateral patches of the side dimension among the quadrilateral patches in the traversal direction of the main dimension, the branch quadrilateral patches of the side dimension are integrated into the quadrilateral patch chain.
4. The method for representing a three-dimensional mesh model based on a quadrilateral face chain code according to claim 3, characterized in that: The side edges that are coplanar with the edges in the traversal direction of the main dimension are only used by one preceding face and one side dimension face, which means that there are reasonable side dimension branch quadrilateral faces.
5. The method for representing a three-dimensional mesh model based on a quadrilateral face chain code according to claim 1, characterized in that: In step S45, the starting edge coordinate reference values of each layer of quadrilateral face chain are summarized, and the minimum value in different coordinate value dimensions is used as a reference to calculate the difference between the different coordinate dimension values and the minimum reference value between each layer of quadrilateral face chain. The starting coordinate reference value of the non-minimum quadrilateral face chain is replaced by the binary code value marked with different dimensions, the binary form of the ratio of the difference and the precision step value, and the end code value to complete the combination of each layer of quadrilateral face chain.
Citation Information
Patent Citations
Three-dimensional mesh model expression method based on surface patch chain codes
CN105184849A
A method for representing a three-dimensional grid model based on a mixed patch chain code
CN109903381A
