A method for storing a triangular mesh model

Abstract

The application discloses a triangular mesh model storage method, characterized in that the method comprises the following steps: a, the surface of the model comprises a plane and a curved surface; b, model input; c, triangular mesh surface attribute judgment; and d, triangular vertex index and normal vector storage. The triangular mesh model storage method has the advantages of reducing redundant data, improving access speed, enhancing data consistency and supporting more complex operations.

Description

Technical Field

[0001] This invention belongs to the field of architectural engineering technology, specifically, it is a method for storing triangular mesh models. Background Technology

[0002] The development of BIM (Building Information Modeling) grid storage optimization technology stems primarily from the continuous advancements in BIM technology itself and the diversification of application needs. Initially, BIM technology was mainly used for the design and display of building models, and subsequently expanded to model-based applications such as building information management. In this process, the application of BIM technology is no longer limited to professional modeling software, but requires more flexible and convenient usage methods, especially on web browsers and mobile applications.

[0003] BIM grid storage optimization technology has emerged, which compresses BIM models to enable them to be used more efficiently on different devices and platforms. The advent of grid storage optimization technology has made the application of BIM models more widespread and convenient, thereby promoting the informatization process of the entire construction industry.

[0004] Traditional BIM grid storage optimization engines began to emerge overseas around 2013, utilizing advanced technologies such as WebGL. With continuous technological advancements, grid storage optimization BIM engines have also experienced rapid development and application in China.

[0005] The development of BIM grid storage optimization technology is driven by the deepening and expansion of BIM technology applications, as well as the demand for more efficient and convenient building information management tools. This technological advancement has not only improved the efficiency of the construction industry but also promoted technological innovation and transformation across the entire sector.

[0006] Therefore, in the existing technology, the processing of triangular mesh model storage methods has become a technical problem that urgently needs to be solved in this field. Summary of the Invention

[0007] Storage optimization for triangular mesh models aims to improve storage efficiency, reduce data transfer volume, accelerate processing speed, and enhance rendering performance. Here are some specific objectives: 1. Adapt to different application scenarios: Different application scenarios have different requirements for the accuracy and complexity of the mesh model. Storage optimization can adjust the level of detail of the mesh as needed to balance performance and visual effects.

[0008] 2. Facilitate hardware acceleration: Many modern graphics processing units (GPUs) are optimized for specific types of data structures, and storage optimization can enable triangular mesh models to better utilize these hardware acceleration features.

[0009] 3. Improve algorithm efficiency: The optimized storage structure can reduce the amount of computation when the algorithm processes the grid, thereby improving the efficiency and response speed of the algorithm.

[0010] 4. Supports large-scale data processing: For large or complex grid models, storage optimization is key to processing these models, which can keep them manageable with limited resources.

[0011] Storage optimization for triangular mesh models is a multifaceted process involving improvements to data structures, algorithm optimization, and utilization of hardware features. The aim is to enhance overall system performance and user experience while maintaining model quality. This invention aims to propose a secure and reliable method for storing triangular mesh models.

[0012] To achieve the above objectives, the technical solution of the present invention is: A method for storing a triangular mesh model, characterized by the following steps: a. The model's surfaces include planes and curved surfaces. Triangles in the same plane are coplanar, while triangles in the same curved surface are not coplanar. When storing triangular mesh data, coplanar triangles often share the same vertex normal vectors. It is not necessary to store an independent normal vector for each vertex. Establishing vertex indexes ensures that the vertex normal vectors of coplanar triangles are stored only once, reducing mesh storage space. b. Model Input: Input the model file containing the version number and model data, loop through the data of each face of the model, and read the number of triangles in the same face; c. Triangular mesh face property judgment: Determine whether all triangles on the same face are coplanar; d. Storage of triangle vertex indices and normal vectors: If all triangles on the same face are coplanar, then read the compressed normal vectors, iterate through all triangle data in this plane and read the vertex index of each triangle; if not all triangles on the same face are coplanar, then iterate through all triangle data and read the vertex index and compressed normal vector of each triangle, and finally store it as a simplified model file.

[0013] After adopting the above technical solution, the triangular mesh model storage method of the present invention has the following advantages: 1. Reduce redundant data: By optimizing the storage structure, such as using indexes to avoid repeatedly storing vertex information, data redundancy can be significantly reduced, thereby saving storage space and transmission bandwidth; 2. Improved access speed: Optimized storage structures can usually be read and parsed by the processor faster, which is especially important for real-time rendering and interactive applications; 3. Enhanced data consistency: When the grid model changes, the optimized storage structure can more easily maintain data consistency and integrity; 4. Support for more complex operations: The optimized storage structure can support more efficient mesh processing operations, such as simplification, subdivision and repartition, which are crucial for generating higher quality mesh models. Attached Figure Description

[0014] Figure 1 This is a flowchart of the storage program for the triangular mesh model according to an embodiment of the present invention. Detailed Implementation

[0015] The present invention will be further described below with reference to the embodiments and accompanying drawings. Example

[0016] Please see now Figure 1 , Figure 1 This is a flowchart illustrating the procedure for storing a triangular mesh model according to an embodiment of the present invention. The method for storing a triangular mesh model according to the present invention includes the following steps: 1. The model's surfaces include planes and curved surfaces. Triangles within the same plane are coplanar, while triangles within the same curved surface are not coplanar. When storing triangular mesh data, coplanar triangles often share the same vertex normal vectors, eliminating the need to store a separate normal vector for each vertex. Establishing vertex indices ensures that the vertex normal vectors of coplanar triangles are stored only once, reducing mesh storage space. 2. Model Input: Input the model file containing the version number and model data, loop through the data of each face of the model, and read the number of triangles in the same face; 3. Triangular mesh face property judgment: Determine whether all triangles on the same face are coplanar; 4. Storage of triangle vertex indices and normal vectors: If all triangles on the same face are coplanar, the compressed normal vectors are read, and the data of all triangles in this plane is iterated and the vertex index of each triangle is read. If not all triangles on the same face are coplanar, the data of all triangles is iterated and the vertex index and compressed normal vector of each triangle are read. Finally, the data is stored as a simplified model file.

[0017] This invention possesses substantial features and significant technological advancements. The triangular mesh model storage method of this invention, by optimizing the storage structure, such as using indexes to avoid duplicate storage of vertex information, can significantly reduce data redundancy, thereby saving storage space and transmission bandwidth. The optimized storage structure can typically be read and parsed by the processor faster, which is particularly important for real-time rendering and interactive applications. When the mesh model changes, the optimized storage structure makes it easier to maintain data consistency and integrity. The optimized storage structure can support more efficient mesh processing operations, such as simplification, subdivision, and repartitioning, which are crucial for generating higher-quality mesh models.

[0018] The triangular mesh model storage method of the present invention has been applied to the Xiong'an International Trade Center project and has achieved good economic benefits.

[0019] The above embodiments are for illustrative purposes only and are not intended to limit the invention. Those skilled in the art can make various modifications and variations without departing from the spirit and scope of the invention. Therefore, all equivalent technical solutions should also fall within the scope of this invention and are defined by the claims.

Claims

1. A method for storing a triangular mesh model, characterized in that... Includes the following steps: a. The model's surfaces include planes and curved surfaces. Triangles in the same plane are coplanar, while triangles in the same curved surface are not coplanar. When storing triangular mesh data, coplanar triangles often share the same vertex normal vectors. It is not necessary to store an independent normal vector for each vertex. Establishing vertex indexes ensures that the vertex normal vectors of coplanar triangles are stored only once, reducing mesh storage space. b. Model Input: Input the model file containing the version number and model data, loop through the data of each face of the model, and read the number of triangles in the same face; c. Triangular mesh face property judgment: Determine whether all triangles on the same face are coplanar; d. Storage of triangle vertex indices and normal vectors: If all triangles on the same face are coplanar, then read the compressed normal vectors, iterate through all triangle data in this plane and read the vertex index of each triangle; if not all triangles on the same face are coplanar, then iterate through all triangle data and read the vertex index and compressed normal vector of each triangle, and finally store it as a simplified model file.

Images