Triangular mesh processing method and device, electronic equipment and storage medium

Abstract

The triangular mesh processing method, device, electronic equipment and storage medium provided by the present application relate to the field of oral digital technology. The method obtains an original triangular mesh; based on the geometric structure and topological connection relationship of the original triangular mesh, the curvature of each vertex and the characteristic mark of each edge in the original triangular mesh are obtained; according to the curvature of each vertex and the characteristic mark of each edge, each triangle face to be subdivided and each edge to be folded in the original triangular mesh are determined; each triangle face to be subdivided is subjected to subdivision processing, and each edge to be folded is subjected to folding processing to obtain a target triangular mesh, so that an optimal balance is achieved between geometric fidelity, topological rationality and data compression ratio, and the practicability and robustness of the triangular mesh in three-dimensional reconstruction, real-time rendering, physical simulation and downstream AI-driven mesh processing tasks are improved.

Description

Technical Field

[0001] This invention relates to the field of digital oral cavity technology, and more specifically, to a triangular mesh processing method, apparatus, electronic device, and storage medium. Background Technology

[0002] In the field of digital oral diagnosis and treatment, intraoral scanners have become the core equipment for rapidly acquiring three-dimensional tooth morphology, replacing traditional impressions. Their working principle involves non-contact scanning of the teeth, gums, and occlusal relationships within the patient's mouth using technologies such as structured light or confocal imaging, outputting a triangular mesh composed of numerous triangular facets. This mesh serves as the fundamental data source for subsequent CAD design, 3D-printed dentures, orthodontic scheme simulation, and AI-assisted diagnosis; its geometric quality and topological robustness directly affect the accuracy and reliability of clinical applications.

[0003] However, in actual scanning, due to factors such as the small space of the oral cavity, saliva reflection, soft tissue obstruction, patient micro-movement, and inherent noise of the sensor, the obtained triangular meshes generally suffer from defects such as geometric distortion, topological redundancy, and feature blurring, which seriously affect subsequent processing and application. Summary of the Invention

[0004] In view of this, the object of the present invention is to provide a triangular mesh processing method, apparatus, electronic device and storage medium.

[0005] To achieve the above objectives, the technical solutions adopted in the embodiments of the present invention are as follows: In a first aspect, the present invention provides a method for processing triangular meshes, the method comprising: Obtain the original triangular mesh; Based on the geometric structure and topological connections of the original triangular mesh, the curvature of each vertex and the feature label of each edge in the original triangular mesh are obtained; Based on the curvature of each vertex and the feature markers of each edge, determine each subdivided triangle face and each folded edge in the original triangular mesh; Each of the triangles to be subdivided is subdivided, and each of the edges to be folded is folded to obtain the target triangular mesh.

[0006] Optionally, the step of obtaining the curvature of each vertex and the feature marker of each edge in the original triangular mesh based on the geometry and topological connectivity of the original triangular mesh includes: Based on the geometry and topological connections of the original triangular mesh, the ring neighborhood of each vertex is determined; The curvature of each vertex is obtained based on the interior angles of each adjacent triangle face within the annular domain of each vertex and the included angle between the normals of two adjacent triangle faces corresponding to each side. Generate feature labels for each edge based on the triangular faces connected to each edge.

[0007] Optionally, the step of generating feature labels for each edge based on the triangular faces connected by each edge includes: For any target edge among all edges, obtain all adjacent triangle faces associated with the two endpoints of the target edge; If the number of adjacent triangular faces is one, then the feature marker of the target edge is set as a boundary edge; If there are two adjacent triangular faces and the included angle between the normals of the two adjacent triangular faces is greater than a preset included angle threshold, then the feature marker of the target edge is set as a feature edge; If there are two adjacent triangular faces and the included angle between the normals of the two adjacent triangular faces is not greater than the preset included angle threshold, then the feature mark of the target edge is set as a transition edge; Traverse each edge to obtain the feature label of each edge.

[0008] Optionally, the step of determining each subdivided triangle face and each folded edge in the original triangular mesh based on the curvature of each vertex and the feature marker of each edge includes: The triangle face containing each vertex with a curvature greater than a preset curvature threshold is defined as the triangle face to be subdivided. Each edge whose feature marker is not a feature edge and whose curvature at both vertices is less than a preset curvature threshold is identified as the edge to be folded.

[0009] Optionally, the step of subdividing each of the triangles to be subdivided includes: For each of the triangles to be subdivided, insert a new vertex on each edge of the triangle to be subdivided; Based on all the new vertices, the triangle to be subdivided is split into multiple sub-triangles.

[0010] Optionally, the step of folding each of the edges to be folded includes: For each edge to be folded, merge the two vertices of the edge into a new vertex; The adjacent triangular faces of the edge to be folded are updated based on the new vertex.

[0011] Optionally, the method further includes: Based on the positions of all adjacent vertices of each target vertex in the target triangular mesh, the position of each target vertex is smoothed to obtain a smoothed triangular mesh; Determine whether the curvature change of all target vertices in the smoothed triangular mesh satisfies the preset convergence condition; If so, the smoothed triangular mesh is considered a valid triangular mesh; If not, the smoothed triangular mesh is taken as the target triangular mesh, and the step of smoothing the position of each target vertex according to the position of all adjacent vertices of each target vertex in the target triangular mesh is returned until the curvature change of all target vertices in the smoothed triangular mesh satisfies the preset convergence condition.

[0012] In a second aspect, the present invention provides a triangular mesh processing apparatus, the apparatus comprising: The acquisition module is used to acquire the original triangular mesh; The processing module is used to obtain the curvature of each vertex and the feature marker of each edge in the original triangular mesh based on the geometric structure and topological connection relationship of the original triangular mesh; determine each subdivided triangular face and each folded edge in the original triangular mesh according to the curvature of each vertex and the feature marker of each edge; perform subdivision processing on each subdivided triangular face and folding processing on each folded edge to obtain the target triangular mesh.

[0013] Thirdly, the present invention provides an electronic device including a processor and a memory, the memory storing machine-executable instructions executable by the processor, the processor executing the machine-executable instructions to implement the triangular mesh processing method described in the first aspect above.

[0014] Fourthly, the present invention provides a computer-readable storage medium having a computer program stored thereon, wherein the computer program, when executed by a processor, implements the triangular mesh processing method as described in the first aspect above.

[0015] The triangular mesh processing method, apparatus, electronic device, and storage medium provided in this invention obtain an original triangular mesh; based on the geometric structure and topological connections of the original triangular mesh, the curvature of each vertex and the feature marker of each edge in the original triangular mesh are obtained; according to the curvature of each vertex and the feature marker of each edge, each subdivided triangular face and each foldable edge in the original triangular mesh are determined; each subdivided triangular face is subdivided, and each foldable edge is folded to obtain the target triangular mesh. Because this invention identifies high-curvature regions based on vertex curvature and triggers local subdivision to preserve geometric details, and combines edge feature markers to identify subdivided triangular faces and foldable edges, edge folding is performed in flat regions to effectively reduce the number of faces, improve mesh simplicity and computational efficiency, and achieves an optimal balance between geometric fidelity, topological rationality, and data compression ratio in the generated target triangular mesh, improving its practicality and robustness in 3D reconstruction, real-time rendering, physical simulation, and downstream AI-driven mesh processing tasks.

[0016] To make the above-mentioned objects, features and advantages of the present invention more apparent and understandable, preferred embodiments are described below in detail with reference to the accompanying drawings. Attached Figure Description

[0017] To more clearly illustrate the technical solutions of the embodiments of the present invention, the accompanying drawings used in the embodiments will be briefly introduced below. It should be understood that the following drawings only show some embodiments of the present invention and should not be regarded as a limitation on the scope. For those skilled in the art, other related drawings can be obtained based on these drawings without creative effort.

[0018] Figure 1 A schematic block diagram of an electronic device provided by an embodiment of the present invention is shown.

[0019] Figure 2 This illustration shows a flowchart of a triangular mesh processing method provided by an embodiment of the present invention. Figure 1 ; Figure 3 This illustration shows a flowchart of a triangular mesh processing method provided by an embodiment of the present invention. Figure 2 ; Figure 4 This diagram shows a detailed example of the original mesh of a three-dimensional tooth model provided in an embodiment of the present invention. Figure 5 This illustration shows a detailed example of a mesh after processing a three-dimensional tooth model, as provided in an embodiment of the present invention. Figure 6 This diagram shows an overall example of the original mesh of a three-dimensional tooth model provided by an embodiment of the present invention; Figure 7 This diagram shows an overall example of a mesh after processing a three-dimensional tooth model, as provided in an embodiment of the present invention. Figure 8 A functional block diagram of a triangular mesh processing device provided in an embodiment of the present invention is shown.

[0020] Icons: 100 - Electronic device; 110 - Memory; 120 - Processor; 130 - Communication module; 200 - Triangular mesh processing device; 201 - Acquisition module; 202 - Processing module. Detailed Implementation

[0021] The technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. The components of the embodiments of the present invention described and shown in the accompanying drawings can generally be arranged and designed in various different configurations.

[0022] Therefore, the following detailed description of the embodiments of the invention provided in the accompanying drawings is not intended to limit the scope of the claimed invention, but merely to illustrate selected embodiments of the invention. All other embodiments obtained by those skilled in the art based on the embodiments of the invention without inventive effort are within the scope of protection of the invention.

[0023] It should be noted that relational terms such as "first" and "second" are used merely to distinguish one entity or operation from another, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Furthermore, the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or apparatus. Without further limitations, an element defined by the phrase "comprising one..." does not exclude the presence of other identical elements in the process, method, article, or apparatus that includes said element.

[0024] In the field of 3D digital oral diagnosis and treatment, the original point cloud or initial triangular mesh model acquired by intraoral scanners is often affected by factors such as sensor noise, saliva reflection, soft tissue deformation, and occlusion, resulting in problems such as high-frequency jitter, non-manifold edges, inconsistent normals, and local artifacts on the mesh surface. To improve model quality and meet the clinical application needs of CAD / CAM prosthesis design, orthodontic simulation, and 3D printing, existing technologies generally employ the following methods to optimize the initial mesh: (1) Denoising methods based on geometric smoothing: such as Laplacian smoothing and its improved Taubin smoothing. These methods suppress noise by iteratively updating the vertex position to the weighted average of its first-order neighboring vertices. However, they are essentially isotropic diffusion processes, which inevitably lead to overall mesh volume shrinkage while suppressing noise, and significantly blur the geometric details of high-curvature feature areas such as tooth grooves, interproximal contact points, and cervical lines, reducing the anatomical fidelity required for clinical diagnosis.

[0025] (2) Anisotropic smoothing method: By introducing curvature or normal difference as a weight adjustment factor, the ability to preserve edges is enhanced to a certain extent. However, this type of method depends on the accuracy of the initial normal vector. The normal estimation of the mesh obtained by intraoral scanning in low signal-to-noise ratio regions such as the gingival margin and occlusal surface depression is easily affected by noise, resulting in distortion of weight calculation, which in turn leads to local over-smoothing or abnormal distortion, making it difficult to meet the rigid requirements of oral models for micron-level geometric accuracy.

[0026] (3) Global reconstruction method based on energy optimization: For example, constructing an objective function and solving for the optimal mesh with constraints of conformity, smoothness and distance preservation. Although it can theoretically balance denoising and feature preservation, its nonlinear optimization process has high computational complexity and long iteration time, making it impossible to embed into the real-time feedback link of intraoral scanners, and it is also difficult to adapt to the limited computing resources of embedded devices.

[0027] (4) Single-strategy topology adjustment methods: including global subdivision or global simplification. The former can improve the ability to express details, but it causes an exponential increase in the number of vertices / faces, which exacerbates the computational burden of subsequent registration, segmentation and rendering; the latter, although it compresses the data size, causes irreversible geometric collapse at key anatomical landmarks such as cusps, ridges and grooves, which destroys clinical recognizability. Both lack the ability to perceive and respond to the local geometric characteristics of the mesh.

[0028] In summary, existing technologies have not yet provided an adaptive mesh optimization scheme that balances high noise robustness, anatomical feature fidelity, real-time computation, and efficient storage. In particular, it is difficult to achieve topology control that is "dense where necessary, sparse where necessary, and preserved where necessary" in the specific application scenario of intraoral scanning, which is characterized by strong noise, small scale, and high precision constraints.

[0029] To address the aforementioned technical bottlenecks, this invention proposes a triangular mesh processing method, apparatus, electronic device, and storage medium, which will be described in detail below.

[0030] Please refer to Figure 1This is a block diagram of an electronic device 100. The electronic device 100 may be an intraoral scanner. The electronic device 100 includes a memory 110, a processor 120, and a communication module 130. The memory 110, processor 120, and communication module 130 are electrically connected directly or indirectly to each other to achieve data transmission or interaction. For example, these components can be electrically connected to each other through one or more communication buses or signal lines.

[0031] The memory 110 is used to store programs or data. The memory 110 may be, but is not limited to, random access memory (RAM), read-only memory (ROM), programmable read-only memory (PROM), erasable programmable read-only memory (EPROM), electrically erasable programmable read-only memory (EEPROM), etc.

[0032] The processor 120 is used to read / write data or programs stored in the memory 110 and to perform corresponding functions.

[0033] The communication module 130 is used to establish a communication connection between the electronic device 100 and other communication terminals through the network, and to send and receive data through the network.

[0034] It should be understood that, Figure 1 The structure shown is only a schematic diagram of the electronic device 100. The electronic device 100 may also include components that are larger than... Figure 1 The more or fewer components shown, or having the same Figure 1 The different configurations shown. Figure 1 The components shown can be implemented using hardware, software, or a combination thereof.

[0035] Please refer to Figure 2 The triangular mesh processing method includes steps S101 to S104.

[0036] S101, obtain the original triangular mesh.

[0037] The original triangular mesh is the original 3D model of the teeth obtained by the intraoral scanner. This model consists of a set of vertices. Kneading set The representation, where each edge is uniquely determined by two vertices.

[0038] Optionally, a basic topology cleaning is performed on the original triangular mesh, including removing duplicate vertices, eliminating isolated vertices, and repairing non-manifold edges and self-intersecting faces, thereby ensuring geometric consistency between subsequent curvature calculations and neighborhood traversal.

[0039] S102, based on the geometry and topological connections of the original triangular mesh, obtains the curvature of each vertex and the feature label of each edge in the original triangular mesh.

[0040] In a possible implementation, step S102 may include sub-steps S102-1 to S102-3.

[0041] S102-1, based on the geometry and topological connections of the original triangular mesh, determines the ring neighborhood of each vertex.

[0042] For any vertex, its cyclic neighborhood is the set of all vertices that are directly connected to it by an edge.

[0043] S102-2, based on the interior angles of each vertex's adjacent triangular faces within its annular neighborhood and the included angle between the normals of each side's two adjacent triangular faces, obtain the curvature of each vertex.

[0044] In this embodiment of the invention, Gaussian curvature is used. With discrete mean square curvature The weighted fusion value is used as a comprehensive curvature measure.

[0045] remember For all The set of triangular faces with vertices and Gaussian curvature. Satisfy the following formula:

[0046] In the formula, It is the vertex In the face inside angle.

[0047] Discrete mean square curvature Satisfy the following formula:

[0048] In the formula, As vertices The area of ​​the ring neighborhood, , It is the angle between the normals of two adjacent triangular faces.

[0049] S102-3, Generate feature labels for each edge based on the triangular faces connected to each edge.

[0050] Further, the implementation process of step S102-3 can be as follows: for any target edge among all edges, obtain all adjacent triangle faces associated with the two vertices of the target edge; if the number of adjacent triangle faces is one, then set the feature mark of the target edge as a boundary edge; if the number of adjacent triangle faces is two and the included angle of the normals of the two adjacent triangle faces is greater than a preset included angle threshold, then set the feature mark of the target edge as a feature edge; if the number of adjacent triangle faces is two and the included angle of the normals of the two adjacent triangle faces is not greater than a preset included angle threshold, then set the feature mark of the target edge as a transition edge; traverse each edge to obtain the feature mark of each edge.

[0051] In other words, for any edge in the original triangular mesh, the following judgment is performed: If an edge has only one adjacent face, then the edge is marked as a boundary edge, corresponding to the free edge of the tooth or the scan cutoff point.

[0052] If the edge has two adjacent faces, calculate the angle between the normals of the two adjacent faces.

[0053] When the angle between the normals of two adjacent faces is greater than a preset angle threshold, that is... ( and Let these be the normals to two adjacent faces. A preset angle threshold (which can be based on statistical analysis of multiple clinical scan data) is used to mark the edge as a feature edge. All feature edges are locked and protected during subsequent subdivision and simplification processes, prohibiting any topological modifications.

[0054] When the included angle between the normals of two adjacent faces is not greater than a preset included angle threshold, the edge is marked as a transition edge.

[0055] S103, based on the curvature of each vertex and the feature markers of each edge, determine each triangle face to be subdivided and each edge to be folded in the original triangular mesh.

[0056] In a possible implementation, step S103 may include sub-steps S103-1 to S103-2.

[0057] S103-1, each triangle face containing a vertex with a curvature greater than a preset curvature threshold is determined as a triangle face to be subdivided.

[0058] Understandably, for each triangular face If any vertex of it satisfies , ( To preset the curvature threshold (which is set according to clinical needs), the triangle containing the vertex will be... Include it in the face set to be subdivided.

[0059] S103-2, each edge whose feature marker is not a feature edge and whose curvature at both vertices is less than a preset curvature threshold is determined as an edge to be folded.

[0060] For each edge ( , If it is marked as a transition edge and simultaneously satisfies and Then add that edge to the set of edges to be folded.

[0061] It is important to note that the curvature of both vertices must be less than a preset curvature threshold. This constraint avoids accidental deletion of edges in areas with moderate curvature transition (such as the neck of a tooth) and prevents the generation of step artifacts.

[0062] S104: Subdivide each triangle face to be subdivided and fold each edge to be folded to obtain the target triangular mesh.

[0063] In this embodiment of the invention, the subdivided triangular face and the edge to be folded can be processed in parallel to ensure that the operations are mutually exclusive.

[0064] In a possible implementation, the process of "subdividing each triangle face to be subdivided" can be as follows: for each triangle face to be subdivided, insert a new vertex on each edge of the triangle face to be subdivided; based on all the new vertices, split the triangle face to be subdivided into multiple sub-triangle faces.

[0065] In other words, for a triangular face Insert the midpoints on its three sides respectively:

[0066]

[0067]

[0068] Update the normals at each midpoint:

[0069] in, As vertices normal line, As vertices normal line, For the vertex and The midpoint of the edge formed.

[0070] vertex normal Satisfy the following formula:

[0071] In the formula, Is with vertex The set of adjacent triangular faces. It is a triangular face area, It is a triangular face The normal line.

[0072] Using the midpoint , as well as triangular face Divide into four sub-triangles: , , as well as .

[0073] The process of “folding each edge to be folded” can be as follows: for each edge to be folded, merge the two vertices of the edge to be folded into a new vertex; update the adjacent triangle faces of the edge to be folded based on the new vertex.

[0074] In other words, for each edge to be folded ( , ), perform edge folding, and determine the new vertex position as:

[0075] The normal to the new vertex satisfies the following formula:

[0076] Optionally, to prevent elongated triangles due to oversimplification and to ensure mesh quality for subsequent finite element analysis, when Only accept the fold if the condition is met; otherwise, retain the original edge.

[0077] Furthermore, to eliminate the local discontinuities introduced by subdivision / folding, please refer to... Figure 3 The triangular mesh processing method provided in this embodiment of the invention further includes steps S105 to S108.

[0078] S105: Based on the positions of all adjacent vertices of each target vertex in the target triangular mesh, smooth the position of each target vertex to obtain a smoothed triangular mesh.

[0079] Understandably, for each target vertex in the target triangular mesh Update its position according to the following formula:

[0080] In the formula, Is with the target vertex The set of adjacent triangular faces. For the target vertex The adjacent vertices, Used to control the smoothing intensity, ensuring that large areas of curvature are not over-smoothed.

[0081] S106, determine whether the curvature change of all target vertices in the smoothed triangular mesh meets the preset convergence condition.

[0082] After smoothing the positions of all target vertices, calculate the curvature change of each target vertex before and after smoothing. .

[0083] if If the curvature change of all target vertices in the smoothed triangular mesh satisfies the preset convergence condition, then step S107 will be executed.

[0084] if If the curvature change of all target vertices in the smoothed triangular mesh does not meet the preset convergence condition, then step S108 will be executed.

[0085] S107 uses the smoothed triangular mesh as the valid triangular mesh.

[0086] S108, take the smoothed triangular mesh as the target triangular mesh, and return the step of performing position smoothing on each target vertex according to the position of all adjacent vertices of each target vertex in the target triangular mesh, until the curvature change of all target vertices in the smoothed triangular mesh meets the preset convergence condition.

[0087] by Figure 4 Taking the original triangular mesh of the intraoral scan of the maxillary molar as an example, after processing by the method of this embodiment, the following result is obtained: Figure 5 The effective triangular mesh shown has increased vertex density in high-curvature areas such as tooth cusps, developmental grooves, and proximal contact areas, while preserving complete geometric details.

[0088] by Figure 6 Taking the original triangular mesh of all teeth scanned intraorally as an example, after processing by the method of this embodiment, the following result is obtained: Figure 7 The effective triangular mesh shown has fewer vertices on the cheek and tongue sides of the smooth surface, and the mesh has no non-manifold structure.

[0089] To perform the corresponding steps in the above embodiments and various possible methods, an implementation of the triangular mesh processing device 200 is given below. Further, please refer to... Figure 8 , Figure 8This is a functional block diagram of a triangular mesh processing device 200 provided in an embodiment of the present invention. It should be noted that the basic principle and technical effects of the triangular mesh processing device 200 provided in this embodiment are the same as those in the above embodiments. For the sake of brevity, any parts not mentioned in this embodiment can be referred to the corresponding content in the above embodiments. The triangular mesh processing device 200 includes: Module 201 is used to obtain the original triangular mesh.

[0090] The processing module 202 is used to obtain the curvature of each vertex and the feature marker of each edge in the original triangular mesh based on the geometric structure and topological connection relationship of the original triangular mesh; determine each subdivided triangular face and each folded edge in the original triangular mesh according to the curvature of each vertex and the feature marker of each edge; perform subdivision processing on each subdivided triangular face and folding processing on each folded edge to obtain the target triangular mesh.

[0091] Optionally, the above modules can be stored in the form of software or firmware. Figure 1 The memory 110 shown is either stored in or embedded in the operating system (OS) of the electronic device 100, and can be used by... Figure 1 The processor 120 executes the program. Meanwhile, the data and program code required to execute the above modules can be stored in the memory 110.

[0092] In the several embodiments provided in this application, it should be understood that the disclosed apparatus and methods can also be implemented in other ways. The apparatus embodiments described above are merely illustrative; for example, the flowcharts and block diagrams in the accompanying drawings illustrate the architecture, functionality, and operation of possible implementations of apparatus, methods, and computer program products according to various embodiments of the present invention. In this regard, each block in a flowchart or block diagram may represent a module, segment, or portion of code containing one or more executable instructions for implementing a specified logical function. It should also be noted that in some alternative implementations, the functions marked in the blocks may occur in a different order than those marked in the drawings. For example, two consecutive blocks may actually be executed substantially in parallel, and they may sometimes be executed in reverse order, depending on the functions involved. It should also be noted that each block in a block diagram and / or flowchart, and combinations of blocks in block diagrams and / or flowcharts, can be implemented using a dedicated hardware-based system that performs the specified function or action, or using a combination of dedicated hardware and computer instructions.

[0093] In addition, the functional modules in the various embodiments of the present invention can be integrated together to form an independent part, or each module can exist independently, or two or more modules can be integrated to form an independent part.

[0094] If the aforementioned functions are implemented as software functional modules and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of this invention, essentially, or the part that contributes to the prior art, or a portion of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, electronic device 100, or network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of this invention. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.

[0095] The above description is merely a preferred embodiment of the present invention and is not intended to limit the invention. Various modifications and variations can be made to the present invention by those skilled in the art. Any modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of the present invention should be included within the scope of protection of the present invention.

Claims

1. A method for processing triangular meshes, characterized in that, The method includes: Obtain the original triangular mesh; Based on the geometric structure and topological connections of the original triangular mesh, the curvature of each vertex and the feature label of each edge in the original triangular mesh are obtained; Based on the curvature of each vertex and the feature markers of each edge, determine each subdivided triangle face and each folded edge in the original triangular mesh; Each of the triangles to be subdivided is subdivided, and each of the edges to be folded is folded to obtain the target triangular mesh.

2. The triangular mesh processing method as described in claim 1, characterized in that, The step of obtaining the curvature of each vertex and the feature marker of each edge in the original triangular mesh based on the geometric structure and topological connectivity of the original triangular mesh includes: Based on the geometry and topological connections of the original triangular mesh, the ring neighborhood of each vertex is determined; The curvature of each vertex is obtained based on the interior angles of each adjacent triangle face within the annular domain of each vertex and the included angle between the normals of two adjacent triangle faces corresponding to each side. Generate feature labels for each edge based on the triangular faces connected to each edge.

3. The triangular mesh processing method as described in claim 2, characterized in that, The step of generating feature labels for each edge based on the triangular faces connected by each edge includes: For any target edge among all edges, obtain all adjacent triangle faces associated with the two endpoints of the target edge; If the number of adjacent triangular faces is one, then the feature marker of the target edge is set as a boundary edge; If there are two adjacent triangular faces and the included angle between the normals of the two adjacent triangular faces is greater than a preset included angle threshold, then the feature marker of the target edge is set as a feature edge; If there are two adjacent triangular faces and the included angle between the normals of the two adjacent triangular faces is not greater than the preset included angle threshold, then the feature mark of the target edge is set as a transition edge; Traverse each edge to obtain the feature label of each edge.

4. The triangular mesh processing method as described in claim 1, characterized in that, The step of determining each subdivided triangle face and each folded edge in the original triangular mesh based on the curvature of each vertex and the feature marker of each edge includes: The triangle face containing each vertex with a curvature greater than a preset curvature threshold is defined as the triangle face to be subdivided. Each edge whose feature marker is not a feature edge and whose curvature at both vertices is less than a preset curvature threshold is identified as the edge to be folded.

5. The triangular mesh processing method as described in claim 1, characterized in that, The step of subdividing each of the triangular faces to be subdivided includes: For each of the triangles to be subdivided, insert a new vertex on each edge of the triangle to be subdivided; Based on all the new vertices, the triangle to be subdivided is split into multiple sub-triangles.

6. The triangular mesh processing method as described in claim 1, characterized in that, The step of folding each of the edges to be folded includes: For each edge to be folded, merge the two vertices of the edge into a new vertex; The adjacent triangular faces of the edge to be folded are updated based on the new vertex.

7. The triangular mesh processing method as described in claim 1, characterized in that, The method further includes: Based on the positions of all adjacent vertices of each target vertex in the target triangular mesh, the position of each target vertex is smoothed to obtain a smoothed triangular mesh; Determine whether the curvature change of all target vertices in the smoothed triangular mesh satisfies the preset convergence condition; If so, the smoothed triangular mesh is considered a valid triangular mesh; If not, the smoothed triangular mesh is taken as the target triangular mesh, and the step of smoothing the position of each target vertex according to the position of all adjacent vertices of each target vertex in the target triangular mesh is returned until the curvature change of all target vertices in the smoothed triangular mesh satisfies the preset convergence condition.

8. A triangular mesh processing device, characterized in that, The device includes: The acquisition module is used to acquire the original triangular mesh; The processing module is used to obtain the curvature of each vertex and the feature marker of each edge in the original triangular mesh based on the geometric structure and topological connection relationship of the original triangular mesh; determine each subdivided triangular face and each folded edge in the original triangular mesh according to the curvature of each vertex and the feature marker of each edge; perform subdivision processing on each subdivided triangular face and folding processing on each folded edge to obtain the target triangular mesh.

9. An electronic device, characterized in that, It includes a processor and a memory, the memory storing machine-executable instructions that can be executed by the processor to implement the triangular mesh processing method according to any one of claims 1-7.

10. A computer-readable storage medium having a computer program stored thereon, characterized in that, When the computer program is executed by the processor, it implements the triangular mesh processing method as described in any one of claims 1-7.

Images