A method for simplifying 3D models
By simplifying the model through edge folding and introducing termination conditions, combined with texture boundary constraints, the problem of generating slender triangles was solved, achieving efficient simplification of the mesh quality and texture continuity of the 3D model, and improving rendering performance.
Patent Information
- Application Number
- CN202310864126.2
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2023-07-14
- Publication Date
- 2026-11-17
- Estimated Expiration
- 2043-07-14
AI Technical Summary
Existing 3D model simplification algorithms tend to generate a large number of thin, elongated triangles while keeping boundary points unchanged, which affects mesh quality and texture deviation, resulting in poor rendering effects.
The model is simplified by using edge folding, a termination condition is introduced to control the proportion of slender triangles, and the boundary of the texture chart is used as a constraint to prohibit the folding of boundary vertices. Combined with bottom-up partitioning and texture parameterization, texture continuity is ensured.
While simplifying the model to the maximum extent, it maintains mesh quality and texture consistency, reduces rendering overhead, and improves running speed without affecting visual effects.
Smart Images

Figure CN116843861B_ABST
Abstract
Description
Technical Field
[0001] This invention relates to the field of image modeling technology, and in particular to a method for simplifying three-dimensional models. Background Technology
[0002] Polygonal models are the most popular, important, and widely supported model representation method in computer graphics. With technological advancements, especially the maturity of image-based modeling and laser scanning technologies, the complexity of models (usually measured by the number of polygons) often exceeds the system's processing capacity. To address this, many simplification algorithms have been proposed to simplify relatively small, distant, or unimportant areas of the model, thereby reducing rendering overhead or bandwidth consumption. This improves performance without significantly impacting the scene's visual appeal.
[0003] For models with boundaries and holes, if the boundaries are to be preserved during the simplification process, that is, the points on the boundaries are not simplified, a large number of thin and long triangles will be generated because a large number of simplification operations are performed inside the model during the simplification process, but the boundary points are not simplified. This will affect the mesh quality of the simplified model. Such thin and long triangles should be avoided as much as possible when constructing the model.
[0004] When a vertex located on a texture boundary is deleted by edge collapse, the texture of that vertex is assigned to the collapsed vertex, causing the texture to deviate from its original geometric position, resulting in texture stretching and deformation.
[0005] Polygonal models are the most popular, important, and widely supported model representation method in computer graphics. With technological advancements, especially image-based modeling and laser scanning techniques, the complexity of models (typically measured by the number of polygons) often exceeds the system's processing capabilities. To address this, many simplification algorithms have been proposed to simplify relatively small, distant, or unimportant areas of the model, reducing rendering overhead or bandwidth consumption. This improves speed without significantly impacting the scene's visual appeal.
[0006] Common simplification methods include vertex clustering, incremental simplification, sampling, and adaptive subdivision. Different simplification methods typically have different adaptability, efficiency, and implementation difficulty.
[0007] The idea behind vertex clustering is simple: for a given polygonal surface, divide the space containing the model into many small grids (the size of each grid is smaller than the user-specified approximation error threshold ε), calculate a representative vertex for each grid, and merge all vertices of the original model that fall within that grid into the representative vertex. If a triangle has two or three vertices located within the same grid, it will be deleted, thus simplifying the mesh.
[0008] Incremental deletion starts from the original model, selecting one point for deletion each time based on user-specified criteria, and re-triangulating the relevant region. This criterion may only determine whether a vertex can be deleted, or it may provide a quantified value (called an error metric) regarding the impact of this operation on model quality. Candidate points to be deleted are typically stored in a heap structure in ascending order of their error metrics. The main computational overhead is the selection and deletion of the point corresponding to the minimum error metric, followed by recalculating the error metrics for vertices whose neighborhoods have changed and adjusting their positions in the heap.
[0009] The sampling algorithm distributes new sampling points on the surface of the original model, triangulates the new sampling points on the model, deletes the original vertices, and obtains a simplified mesh. The algorithm attempts to construct a simplified model that best fits these sampling points.
[0010] The adaptive subdivision algorithm starts with a simple base grid and iteratively subdivides the grid, adding more details to the model with each subdivision, until the similarity between the subdivided model and the original model reaches a user-defined threshold.
[0011] The information disclosed in this background section is intended only to enhance the understanding of the general background of the invention and should not be construed as an admission or in any way implying that the information constitutes prior art known to those skilled in the art. Summary of the Invention
[0012] The purpose of this invention is to provide a method for simplifying three-dimensional models in order to solve the technical problems existing in the prior art.
[0013] To achieve the above objectives, the present invention adopts the following technical solution: This invention provides a method for simplifying three-dimensional models, the method comprising the following steps: S1 model surface repair fills in small holes, repairs non-manifold conditions of edges and surfaces, and ensures that the output 3D model is a 2D manifold. S2 model surface partitioning: Based on the criteria of flatness and compactness, the model surface is divided into charts. The S3 model texture is reparameterized. After obtaining the parameterized result, the texture of the facet in the chart is applied to the parameterized surface to generate the texture atlas of this chart. The texture atlases corresponding to all charts are combined to form a texture image, which realizes the reparameterization of the model texture. Moreover, the regenerated texture can ensure that each chart is in a continuous texture space. The S4 model is simplified by using an edge-folding method, and during the simplification process, the vertices on the chart boundary are preserved and the texture coordinates remain unchanged, thus performing a constrained simplification. During the simplification process, the proportion of slender triangles to all current triangles is used as the condition for determining whether the simplification process has ended, and the ratio of vertices, edges and faces is used as a heuristic rule for determining the end of a model simplification process.
[0014] Furthermore, in step S2, the division process adopts a bottom-up approach. First, each surface polygon of the model is set as a chart, and then adjacent charts are gradually merged to obtain a division of the model surface.
[0015] Furthermore, during the simplification process, the boundaries of the texture chart are used as constraints to prevent vertices on the texture boundaries from collapsing onto other vertices.
[0016] Furthermore, the simplification process ends when the proportion of the slender triangles to all the current triangles exceeds 30%.
[0017] Furthermore, the slender triangle is determined by either angle or side length. The angle determination is based on the following: the smallest interior angle of the triangle is less than 20.7 degrees, or the largest interior angle exceeds 138.6 degrees. The side length determination is based on the following: the ratio of the radius of the circumcircle of the triangle to the smallest side of the triangle exceeds [a certain value]. .
[0018] Furthermore, the ratio of the vertices, edges, and faces is approximately 1:3:2.
[0019] By adopting the above technical solution, the present invention has the following beneficial effects: In the model simplification stage, this invention uses an edge-folding method to simplify the polygons on the model surface. For models with boundaries and holes, if the boundaries are to be preserved during simplification (i.e., points on the boundaries are not simplified), a large number of thin, elongated triangles will be generated because many simplification operations are performed inside the model while the boundary points are not simplified. This will reduce the mesh quality of the simplified model and affect the final rendering effect. During the simplification process, this invention introduces a simplification termination condition. First, the proportion of such triangles among all current triangles can be used as a condition to determine whether the simplification process has ended. Then, the ratio of edges to faces in the model is considered. In a normal model, the ratio of vertices, edges, and faces is approximately 1:3:2. When the model is simplified to a certain extent, due to constraints such as model boundaries, the ratio of vertices and edges to faces usually increases. Therefore, this ratio can be considered as a heuristic rule for determining the end of the model simplification process.
[0020] The simplification process termination condition employed in this invention simplifies the model to the maximum extent without affecting its geometric or textural features. This reduces rendering overhead or bandwidth usage, thereby improving running speed without significantly impacting the scene's visual effects.
[0021] When a vertex located on a texture boundary is deleted by edge collapse, the texture of that vertex is assigned to the collapsed vertex, causing the texture to deviate from its original geometric position. To avoid this, it is necessary to introduce constraints on the continuity of texture space to ensure that the texture assignment is not affected during the simplification of geometric information. One approach is to use the boundary of the texture chart as a constraint during the simplification process, prohibiting vertices on the texture boundary from being collapsed onto other vertices. However, for some image-reconstructed 3D models, the texture boundaries may be very fragmented, and adding constraints will affect the simplification efficiency. Therefore, it is advisable to first merge the texture charts to generate a larger chart, and then perform constrained simplification. Attached Figure Description
[0022] To more clearly illustrate the specific embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the specific embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are some embodiments of the present invention. For those skilled in the art, other drawings can be obtained from these drawings without creative effort.
[0023] Figure 1 A flowchart of a three-dimensional model simplification method provided in an embodiment of the present invention; Figure 2 This is a schematic diagram of an elongated triangle provided in an embodiment of the present invention. Detailed Implementation
[0024] The technical solution of the present invention will now be clearly and completely described with reference to the accompanying drawings. Obviously, the described embodiments are only some, not all, of the embodiments of the present invention. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.
[0025] The specific embodiments of the present invention will be described in detail below with reference to the accompanying drawings. It should be understood that the specific embodiments described herein are for illustration and explanation only and are not intended to limit the present invention.
[0026] Combination Figure 1 and Figure 2 As shown, this embodiment provides a specific implementation of a 3D model simplification method. Specifically, a 3D model is loaded, and the triangular mesh is a piecewise linear surface formed by connecting triangles in 3D space through edges and vertices. The triangular mesh M can be composed of a set of vertices. and triangular sets The binary pair To express.
[0027] First, perform simple repairs on the model surface, filling in small holes and fixing non-manifold conditions of edges and surfaces, such as deleting overlapping surfaces and outliers in the model, so that the model becomes a two-dimensional manifold.
[0028] Then, based on the flatness and compactness criteria, the model surface is divided into charts. The division process adopts a bottom-up approach, initially assuming that each surface polygon of the model is a chart, and then gradually merging adjacent charts. During the merging process, it is checked whether the flatness and compactness criteria are satisfied, and the merging process is terminated under appropriate conditions to obtain a division of the model surface.
[0029] After obtaining the parameterized result, the texture of the facet in the chart is applied to the parameterized surface to generate the texture atlas of this chart. The texture atlases corresponding to all charts are then combined to form a texture image, which realizes the reparameterization of the model texture. The regenerated texture can ensure that each chart is in a continuous texture space.
[0030] Vertices on the chart boundary are preserved, and texture coordinates remain unchanged. These serve as constraints for edge folding simplification. The simplified model is obtained by recursively performing edge folding operations, with the edges to be simplified... Perform the deletion operation, removing the two points. and Merge into one point Shared edge The two triangles degenerate into sides and are then deleted.
[0031] While setting the number of faces as the target condition, two termination conditions are designed: the proportion of slender triangles among all current triangles is used as the condition to determine whether the simplification process ends; the ratio of vertices, edges, and faces serves as a heuristic rule for ending the model simplification process. During the simplification process, if the target number of faces has not been reached and the termination condition has not been triggered, iteration continues, executing a recursive edge-folding simplification algorithm until the termination condition for model simplification is triggered, or the target number of faces is reached, at which point the model simplification process terminates, and the simplified model result is saved.
[0032] A slender triangle can be identified by either its angles or its side lengths. Angle identification typically occurs when the largest angle is close to 180 degrees, or when the ratio of the largest to the smallest angle exceeds a predetermined value. Side length identification generally occurs when the smallest side differs significantly from the radius of the circumcircle of the triangle, or by the ratio of the lengths of the largest and smallest sides.
[0033] This embodiment optimizes the termination criteria for model simplification; by first merging the texture charts to generate a larger chart, and then performing constrained simplification with the texture boundaries as constraints; it also optimizes the method of preserving textures during model simplification to avoid textures deviating from their original geometric positions and causing stretching deformation.
[0034] Finally, it should be noted that the above embodiments are only used to illustrate the technical solutions of the present invention, and not to limit them; although the present invention has been described in detail with reference to the foregoing embodiments, those skilled in the art should understand that modifications can still be made to the technical solutions described in the foregoing embodiments, or equivalent substitutions can be made to some or all of the technical features; and these modifications or substitutions do not cause the essence of the corresponding technical solutions to deviate from the scope of the technical solutions of the embodiments of the present invention.
Claims
1. A method for simplifying a three-dimensional model, characterized in that, The method includes the following steps: S1 model surface repair fills in small holes, repairs non-manifold conditions of edges and surfaces, and ensures that the output 3D model is a 2D manifold. S2 model surface partitioning: Based on the flatness and compactness criteria, the model surface is divided into charts. The S3 model texture is reparameterized. After obtaining the parameterization result, the texture of the facet in the chart is applied to the parameterized surface to generate the texture atlas of the chart. The texture atlases corresponding to all charts are combined to form a texture image, which realizes the reparameterization of the model texture. The regenerated texture can ensure that each chart is in a continuous texture space. The S4 model is simplified by using an edge-folding method, and during the simplification process, the vertices on the chart boundary are preserved and the texture coordinates remain unchanged, thus performing a constrained simplification. During the simplification process, the proportion of slender triangles to all current triangles is used as the condition for determining whether the simplification process has ended, and the ratio of vertices, edges and faces is used as a heuristic criterion for determining whether a model simplification process has ended. In step S2, the division process adopts a bottom-up approach. First, each surface polygon of the model is set as a chart, and then adjacent charts are gradually merged to obtain a division of the model surface. During the simplification process, the boundaries of the texture chart are used as constraints to prevent vertices on the texture boundaries from collapsing onto other vertices. The simplification process ends when the proportion of the slender triangles to all the current triangles exceeds 30%. The slender triangle is determined by either angle or side length. Angle determination is based on the following: the smallest interior angle is less than 20.7 degrees, or the largest interior angle exceeds 138.6 degrees. Side length determination is based on the following: the ratio of the radius of the circumcircle of the triangle to the smallest side exceeds [a certain value]. ; The ratio of the vertex, the edge, and the face is 1:3:2.
Citation Information
Patent Citations
Method for repairing three-dimensional grid model based on global structure
CN101877148A
Method for simplifying vertex clustering of three-dimensional models with texture constraint
CN102509339A
