CN117315192A - Three-dimensional grid model simplification method for Chinese space station - Google Patents
Three-dimensional grid model simplification method for Chinese space station Download PDFInfo
- Publication number
- CN117315192A CN117315192A CN202311187026.7A CN202311187026A CN117315192A CN 117315192 A CN117315192 A CN 117315192A CN 202311187026 A CN202311187026 A CN 202311187026A CN 117315192 A CN117315192 A CN 117315192A
- Authority
- CN
- China
- Prior art keywords
- space station
- dimensional grid
- model
- point
- grid model
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 61
- 238000004422 calculation algorithm Methods 0.000 claims abstract description 14
- 238000004364 calculation method Methods 0.000 claims abstract description 12
- 238000012545 processing Methods 0.000 claims description 11
- 230000009467 reduction Effects 0.000 claims description 5
- 238000005259 measurement Methods 0.000 claims description 4
- 239000013598 vector Substances 0.000 claims description 3
- 230000000694 effects Effects 0.000 abstract description 6
- 230000008569 process Effects 0.000 description 9
- 230000000875 corresponding effect Effects 0.000 description 6
- 238000012800 visualization Methods 0.000 description 5
- 238000005457 optimization Methods 0.000 description 4
- 238000009877 rendering Methods 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 3
- 238000004088 simulation Methods 0.000 description 3
- 230000000007 visual effect Effects 0.000 description 3
- 238000004458 analytical method Methods 0.000 description 2
- 230000005540 biological transmission Effects 0.000 description 2
- 230000006835 compression Effects 0.000 description 2
- 238000007906 compression Methods 0.000 description 2
- 238000010276 construction Methods 0.000 description 2
- 238000013461 design Methods 0.000 description 2
- 238000009499 grossing Methods 0.000 description 2
- 230000003993 interaction Effects 0.000 description 2
- 230000008439 repair process Effects 0.000 description 2
- 230000003044 adaptive effect Effects 0.000 description 1
- 238000012512 characterization method Methods 0.000 description 1
- 238000004040 coloring Methods 0.000 description 1
- 238000011960 computer-aided design Methods 0.000 description 1
- 230000001276 controlling effect Effects 0.000 description 1
- 230000002596 correlated effect Effects 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 238000012217 deletion Methods 0.000 description 1
- 230000037430 deletion Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000018109 developmental process Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000012850 discrimination method Methods 0.000 description 1
- 238000003708 edge detection Methods 0.000 description 1
- 230000003203 everyday effect Effects 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 230000002452 interceptive effect Effects 0.000 description 1
- 238000012423 maintenance Methods 0.000 description 1
- 230000014759 maintenance of location Effects 0.000 description 1
- 230000035800 maturation Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000011218 segmentation Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 230000007704 transition Effects 0.000 description 1
- 239000011800 void material Substances 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T17/00—Three dimensional [3D] modelling, e.g. data description of 3D objects
- G06T17/20—Finite element generation, e.g. wire-frame surface description, tesselation
- G06T17/205—Re-meshing
Landscapes
- Physics & Mathematics (AREA)
- Engineering & Computer Science (AREA)
- Computer Graphics (AREA)
- Geometry (AREA)
- Software Systems (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Image Generation (AREA)
- Processing Or Creating Images (AREA)
Abstract
The invention discloses a three-dimensional grid model simplifying method for a Chinese space station, which comprises the following steps: loading a space station three-dimensional grid model in an OBJ format by a system, and executing a simplified initialization operation; step two, simplifying a space station three-dimensional grid model; step three, calculating the distance between the candidate point and the average plane of the candidate point, if the distance is smaller than a given threshold value, eliminating the point, otherwise, reserving the point; fourthly, filling the cavity formed in the grid after eliminating the vertex by establishing a cavity boundary, triangulating the cavity boundary, connecting the cavity boundary with the original grid and repairing the potential topology problem; step five, iterating until all original space station three-dimensional grid models are traversed, and generating a simplified space station three-dimensional grid model; and step six, calculating the grid color of the simplified three-dimensional grid model of the space station. The method solves the problem that the grid simplifying algorithm loses color information, and simultaneously combines the calculation efficiency and the grid simplifying effect.
Description
Technical Field
The invention relates to a three-dimensional grid model simplifying method, in particular to a three-dimensional grid model simplifying method for a Chinese space station.
Background
The computer three-dimensional grid model simplification technique is a model simplification technique in the field of computer graphics. Computer graphics is the discipline of studying how images are generated, processed, and displayed using computers. In computer graphics, three-dimensional mesh model simplification techniques are an important technique for reducing the data volume and complexity of complex three-dimensional models in order to improve efficiency in computation and visualization.
The goal of three-dimensional mesh model simplification techniques is to reduce the number of vertices, patches, or voxels in the model while maintaining the basic features of the shape and appearance of the model. By reducing the details and complexity of the model, the computer processing speed, graphics rendering speed, and network transmission efficiency can be improved.
The technology has application in many fields including computer animation, virtual reality, game development, architectural design, engineering simulation, and the like. By simplifying the three-dimensional grid model, the storage space can be saved, the model loading and rendering speed can be increased, and the interactivity and user experience can be improved.
With the continuous maturation of three-dimensional acquisition technology and the increasing precision of three-dimensional measuring instruments, the volume of three-dimensional model data acquired presents a rapidly growing trend. This places high demands on computer storage, drawing speed of the graphics system, processing speed, and network transmission efficiency. However, not all everyday applications require such high resolution fine models.
In order to balance between a three-dimensional model with large data volume and computer processing capacity and meet the demands of different application scenes on a level of detail model, it is important to simplify the three-dimensional model with large data volume and complexity. This simplification enables the generation of relatively simple approximation models to meet the requirements of computer processing speed, display analysis, and network transport. The method has the advantages of simplifying a large-data-volume complex three-dimensional model, meeting the processing capacity of a computer and providing models with different levels of detail suitable for various application scenes.
The grid simplification algorithm is a core technology of three-dimensional grid model simplification. Among the most common algorithms are simplified methods based on error metrics, such as vertex merging based on error metrics and edge collapsing based on error metrics. These algorithms determine which vertices or edges can be merged or collapsed in the simplification process by calculating the error metrics for the vertices or edges. However, these algorithms have problems such as poor effect in handling complex topologies, and the possibility of shape deformation or loss of detail in the simplified model.
In order to solve the problems of shape deformation and detail loss in the simplified algorithm, researchers have proposed some grid optimization techniques. These techniques include surface smoothing, normal adjustment, edge folding, etc., to simplify the process while maintaining model smoothness, shape features and details. However, these techniques may cause problems of increased computational complexity and memory consumption when processing high resolution models.
Hierarchical detail model techniques are a method for managing three-dimensional models of different levels of detail. It achieves fast display and rendering by preserving representations of multiple different resolutions, from coarse to fine, in the model. LOD techniques may be used in conjunction with grid reduction techniques to dynamically select appropriate levels of detail as needed under different application scenarios. However, LOD techniques may present challenges in model switching and smooth transitions, resulting in visual discontinuities or undesirable transitional effects.
In many areas, such as computer graphics, computer aided design, etc., it is often desirable to simplify complex models or images to increase computational efficiency or reduce data storage requirements. However, when a large-scale simplification is performed, some important detail features are often lost, so that subsequent analysis, rendering or visualization processes are affected. Therefore, there is a need to address the issue of how to simplify the large scale while maintaining important detailed features. And in particular how to effectively preserve those detailed features critical to the overall structure, shape or appearance when model or image simplification is performed. These detail features may include sharp edges, complex textures, fine geometric details, and the like. Conventional simplification methods typically focus only on overall shape or surface topology, and ignore the importance of these detail features.
The three-dimensional model of the Chinese space station is used for a series of tasks such as extravehicular layout planning, extravehicular mechanical arm motion simulation, space station maintenance and the like. The space station is a complex system, the model is also a huge and complex model, along with the continuous increase of equipment outside the cabin of the Chinese space station, the three-dimensional model of the space station for three-dimensional simulation planning is also continuously complex, and the model simplification of the space station has the following significance:
1. the calculation efficiency is improved: space stations are complex systems whose three-dimensional model may contain a great deal of detail and complex structure. In order to increase computational efficiency, the model may be simplified, removing some unnecessary detail and complexity to reduce the consumption of computational resources.
2. Simplifying visualization and interaction: a three-dimensional model that is too complex may lead to visual confusion and interactive difficulties. By simplifying the model, the model is clearer and easier to understand, and the visualization and interaction experience of the user on the model can be improved.
3. Optimizing data processing: in some cases, the raw data of the space station may be very bulky and may be very difficult to process. By simplifying the model, the amount of data can be reduced, thereby simplifying the process of data processing.
Disclosure of Invention
The invention provides a three-dimensional grid model simplifying method for a Chinese space station, which solves the problems of complexity and excessive consumption of computing resources in the construction of the Chinese space station of a traditional three-dimensional grid model. The method can effectively simplify the three-dimensional grid model, and greatly reduce the use of computing resources while maintaining the accuracy and the visual effect of the model. The method solves the problem that the grid simplifying algorithm loses color information, and simultaneously combines the calculation efficiency and the grid simplifying effect.
The invention aims at realizing the following technical scheme:
compared with other models, the three-dimensional grid model of the space station has the characteristics of huge volume, rich details and importance, so the invention designs the characteristic discrimination to reserve important detail characteristics, and effectively simplifies places with unobvious characteristics such as solar sailboards, cylindrical shells and the like to reduce the three-dimensional model of the space station, thereby facilitating the rapid calculation in the follow-up simulation software, and the method specifically comprises the following steps:
step one, loading a space station three-dimensional grid model in an OBJ format by a system, and executing simplified initialization operation, wherein the method comprises the following specific steps:
the method comprises the steps that one by one, the system reads relevant information of a three-dimensional grid model of a space station, and a list is generated to store the information, wherein the information comprises vertex coordinates, normal vectors, texture coordinates and connection relations of triangular patches;
step two, calculating the number of theoretical triangular patches after simplification and the number of characteristic edges according to the set model simplification precision, wherein the size of a storage space occupied by the model after simplification;
step two, simplifying a space station three-dimensional grid model, which comprises the following specific steps:
step two, selecting a point from the three-dimensional grid model of the space station, judging the characteristics of the point, and determining whether the point is an indispensable characteristic point in the three-dimensional grid model of the space station through vertex measurement, boundary protection, characteristic line protection and area protection;
step two, if a certain point is determined to be a characteristic point after the judging method of the step two, the certain point is reserved in the simplified three-dimensional grid model of the space station, otherwise, the point is marked as a candidate point which is possibly eliminated, and further processing is carried out in subsequent operation;
step three, calculating the distance between the candidate point and the average plane of the candidate point, if the distance is smaller than a given threshold value, eliminating the point, otherwise, reserving the point;
fourthly, filling the cavity formed in the grid after eliminating the vertex by establishing a cavity boundary, triangulating the cavity boundary, connecting the cavity boundary with the original grid and repairing the potential topology problem;
step five, iterating until all original space station three-dimensional grid models are traversed, and generating a simplified space station three-dimensional grid model;
step six, calculating the grid color of the simplified three-dimensional grid model of the space station, which comprises the following specific steps:
step six, a triangle Q is taken from the simplified three-dimensional grid model of the space station, and all triangles in the adjacent area of the triangle Q are taken from the original three-dimensional grid model of the space station as an alternative set;
step six, for each triangle P in the alternative set, calculating the projection area S of Q to P pq And centroid distance d pq And further calculates the correlation coefficient r=s of P and Q pq /d pq The larger the correlation coefficient is, the higher the feature similarity corresponding to the two triangular plates is, and the same color is used for representing the same feature, so that the three-dimensional model of the space station is clearly displayed;
step six, for Q, selecting a triangle with the largest correlation coefficient from the alternative set corresponding to Q as the color of Q;
and step six, repeating the step six, the step one and the step six, traversing all the simplified triangular surfaces, and completing color calculation.
Compared with the prior art, the invention has the following advantages:
1. high-efficiency simplification: the method can automatically simplify the three-dimensional grid model of the Chinese space station with high efficiency, remove redundant details and unnecessary data, and reduce the complexity of the model. The simplified model can greatly reduce the use of computing resources and improve the computing efficiency.
2. Accurate fidelity: the method of the present invention, although simplified, can maintain the accuracy and visualization effect of the model. Key structural features and details will be preserved, ensuring that the model is visually consistent with the original model.
3. And (3) self-adaptive optimization: the method of the invention can adaptively optimize according to the requirements of different parts and functions. For areas requiring more details, the model retains more detail information; for areas where high precision is not required, a greater degree of simplification is possible. The adaptive optimization enables the model to have better flexibility and adaptability in different scenes.
4. The computing resources are saved: by using the method of the invention, the use of computing resources, including computing time and memory space, can be greatly reduced. This is very important for the construction and operation of the chinese space station, and can improve the efficiency and performance of the system.
Drawings
FIG. 1 is an error metric for a point-to-plane distance;
FIG. 2 is an error metric for a point-to-boundary straight line distance;
FIG. 3 is a simplified color calculation of a rear triangular surface;
FIG. 4 is a simplified algorithm flow diagram of a three-dimensional model;
FIG. 5 is a simplified model color calculation flow chart;
fig. 6 is a simplified front-to-back comparison of the model.
Detailed Description
The following description of the present invention is provided with reference to the accompanying drawings, but is not limited to the following description, and any modifications or equivalent substitutions of the present invention should be included in the scope of the present invention without departing from the spirit and scope of the present invention.
The present invention provides a simplified method of three-dimensional mesh model for a chinese space station, the process of which is relatively simple, by performing multiple passes over all vertices in the mesh. In each traversal, each vertex is considered a potential candidate vertex, which is deleted if specified simplification criteria are met, as well as all triangles that use that vertex. In order to fill the holes generated in the grid, a local triangulation method is adopted. This process is repeated for vertex removal and possibly adjustment of the reduction criteria until certain termination conditions are met. Typically, the termination condition may be set as a percentage reduction of the original grid (or equivalent), or some maximum culling value. As shown in fig. 4, the method comprises the steps of:
step one, loading a three-dimensional grid model in an OBJ format by a system, and executing simplified initialization operation, wherein the method comprises the following specific steps:
step one, the system reads the relevant information of the three-dimensional grid model and generates a list to store the information, wherein the information can comprise vertex coordinates, normal vectors, texture coordinates and connection relations of triangular patches.
And step two, calculating the number of the theoretical triangular patches after simplification and the number of the characteristic edges according to the set model simplification precision, wherein the size of the storage space occupied by the model after simplification. The simplifying precision is a user-set value for controlling the degree of simplifying the operation, a higher simplifying precision will retain more detail, and a lower simplifying precision will lead to a greater degree of simplification.
Step two, representing the geometric topological shape of the local vertex, simplifying the three-dimensional grid model, and specifically comprising the following steps:
and step two, selecting a point from the three-dimensional grid model, judging the characteristics of the point, and determining whether the point is an indispensable characteristic point in the three-dimensional grid model through vertex measurement, boundary protection, characteristic line protection and region protection.
In order to keep key characteristic points, proper characterization is needed to be carried out on the geometric topology of the local vertexes, and four methods are comprehensively considered to characterize the topology of the vertexes of the triangular surface grid. (a) vertex metrics: vertex metrics are used to evaluate the importance and characteristics of vertices. These metrics include curvature, normal direction, vertex color, etc. By calculating and comparing these metric values, it is determined which vertices are critical feature points, thereby avoiding their deletion. (b) boundary protection: vertices on the boundary typically have important geometric features. In the simplification process, the weights of the boundary vertices are set higher to ensure that they are not deleted or excessively simplified to preserve the shape and topology of the boundary. (c) feature line protection: a feature line is a curve or edge in the model that has significant geometric features. By detecting and protecting vertices associated with feature lines, retention of critical features is ensured. Feature lines are identified using curvature measurement and edge detection algorithms and correlated with the importance of vertices. (d) area protection: sometimes, certain areas in the model are very important to the overall shape. By defining and protecting these areas, it can be ensured that key feature points are preserved. By manual marking or automatic segmentation algorithms.
And step two, if a certain point is determined to be a characteristic point after the discrimination method of the step two, the certain point is reserved in the simplified three-dimensional grid model, otherwise, the point is marked as a candidate point which is possibly eliminated, and further processing is carried out in subsequent operation.
And thirdly, calculating the distance between the candidate point and the average plane of the candidate point, if the distance is smaller than a given threshold value, rejecting the point, otherwise, reserving the point.
In this step, the criteria for evaluating the culling grid are as follows:
first criterion: as shown in fig. 1, the distance d from a vertex to its average plane is calculated, and when the value of d is smaller than a given threshold, the feature point is eliminated.
Second criterion: as shown in fig. 2, for a feature edge, the distance d from the vertex to the feature edge is calculated. The boundary and inner edge vertices use distance criteria to the edge (fig. 2) (lower graph). In this case, the algorithm determines the shortest distance of the vertex to the feature edge. If the distance to the straight line is less than d, the vertex may be deleted. The edges of objects are often feature rich regions, so the source of feature edges has two aspects, one is selected from the edges of the original three-dimensional model, and the other is artificially given some edges.
In this step, the method for determining the average plane is as follows:
(1) Calculate a vertex v i For a vertex, the normal N to its average plane is calculated with the following formula:
wherein n is k Method for each triangle in triangle groupWire S k Is the area of each triangle in the triangle group. Triangle group refers to all triangular patches in which the vertex participates.
(2) The point c in the average plane is calculated as follows:
wherein c k Is the midpoint of each triangle in the triangle set.
(3) Through the above calculation, an average plane corresponding to one vertex can be determined, and this plane will be used for the vertex reduction operation.
Fourthly, filling holes generated by removing grids by triangular splicing: by establishing a hole boundary, triangulating the hole boundary, connecting the hole boundary with the original grid and repairing potential topology problems, filling holes formed in the grid after vertices are removed can be realized. This ensures that the simplified grid remains intact and continuous. The method comprises the following specific steps:
step four, establishing a cavity boundary by searching edges and vertexes adjacent to the cavity. The hole boundary is composed of a set of edges and corresponding vertices.
And step four, converting the cavity boundary into a group of triangles by using a proper triangularization method, connecting the vertexes on the cavity boundary to form triangles, and filling the cavity.
And fourthly, after filling the hole, connecting the newly generated triangle with the original grid by creating a proper connecting edge between the hole boundary and the original grid. These connecting edges connect the triangles of the void boundary with the adjacent triangles on the original mesh, ensuring overall continuity and consistency.
In the process of filling the cavity by local triangularization, sometimes a bad topological structure, such as singular vertexes or overlapped triangles, may be introduced. To repair these problems, topology repair algorithms, such as mesh smoothing, reconstruction, or optimization, are applied to ensure the correctness and rationality of the filled mesh topology.
And fifthly, iterating until all the original three-dimensional grid models are traversed, and generating a simplified three-dimensional grid model.
And step six, calculating the grid color of the simplified three-dimensional grid model.
For the simplified triangle Q, calculate its projected area S to either triangle P before simplification pq Centroid distance d pq The method comprises the steps of carrying out a first treatment on the surface of the Then calculate the correlation coefficient r=s of P and Q pq /d pq Based on the correlation coefficient ranking, the adjacent triangular surface coloring with the largest correlation coefficient is obtained, as shown in fig. 3.
As shown in fig. 5, the specific steps of the mesh color calculation are as follows:
(1) A triangle Q is taken from the simplified model and all triangles within the neighborhood of Q are taken from the original model as an alternative set.
(2) For each triangle P in the candidate set, calculate the projected area S of Q to P pq And centroid distance d pq And further calculates the correlation coefficient r=s of P and Q pq /d pq . The larger the correlation coefficient is, the higher the feature similarity corresponding to the two triangular plates is, and the same color is used for representing the same feature, so that the three-dimensional model is clearly displayed.
(3) For Q, a triangle with the largest correlation coefficient is selected from the candidate set corresponding to Q and used as the color of Q.
(4) Repeating the steps (1) to (3), traversing all the simplified triangular surfaces, and completing the color calculation.
Fig. 6 shows a solar panel apparatus in a space station, taking this apparatus as an example, running the grid simplification algorithm of the present invention, the simplification effect is shown in table 1:
TABLE 1
| IV model | File size | Triangle number of dough sheets | Compression ratio |
| Original, original | 1722kb | 5736 | 1 |
| After compression | 246kb | 860 | 0.15 |
As can also be seen from fig. 6, the compressed solar sailboard retains the detailed features while also greatly reducing the storage space of the model.
Claims (5)
1. A three-dimensional grid model simplification method for a chinese space station, characterized in that the method comprises the steps of:
loading a space station three-dimensional grid model in an OBJ format by a system, and executing a simplified initialization operation;
step two, simplifying a space station three-dimensional grid model, which comprises the following specific steps:
step two, selecting a point from the three-dimensional grid model of the space station, judging the characteristics of the point, and determining whether the point is an indispensable characteristic point in the three-dimensional grid model of the space station through vertex measurement, boundary protection, characteristic line protection and area protection;
step two, if a certain point is determined to be a characteristic point after the judging method of the step two, the certain point is reserved in the simplified three-dimensional grid model of the space station, otherwise, the point is marked as a candidate point which is possibly eliminated, and further processing is carried out in subsequent operation;
step three, calculating the distance between the candidate point and the average plane of the candidate point, if the distance is smaller than a given threshold value, eliminating the point, otherwise, reserving the point;
fourthly, filling the cavity formed in the grid after eliminating the vertex by establishing a cavity boundary, triangulating the cavity boundary, connecting the cavity boundary with the original grid and repairing the potential topology problem;
step five, iterating until all original space station three-dimensional grid models are traversed, and generating a simplified space station three-dimensional grid model;
and step six, calculating the grid color of the simplified three-dimensional grid model of the space station.
2. The method for simplifying three-dimensional grid model for Chinese space station according to claim 1, wherein the specific steps of the step one are as follows:
the method comprises the steps that one by one, the system reads relevant information of a three-dimensional grid model of a space station, and a list is generated to store the information, wherein the information comprises vertex coordinates, normal vectors, texture coordinates and connection relations of triangular patches;
and step two, calculating the number of the theoretical triangular patches after simplification and the number of the characteristic edges according to the set model simplification precision, wherein the size of the storage space occupied by the model after simplification.
3. The method for simplifying three-dimensional grid model for chinese space station according to claim 1, wherein in said step three, the method for determining average plane is as follows:
(1) Calculate a vertex v i For a vertex, the normal N to its average plane is calculated with the following formula:
wherein n is k Is the normal of each triangle in the triangle group, S k Is the area of each triangle in the triangle group. Triangle group refers to all triangular patches in which the vertex participates.
(2) The point c in the average plane is calculated as follows:
wherein c k Is the midpoint of each triangle in the triangle set.
(3) Through the above calculation, an average plane corresponding to one vertex can be determined, and this plane will be used for the vertex reduction operation.
4. The three-dimensional grid model simplifying method for a Chinese space station according to claim 1, wherein the specific steps of the fourth step are as follows:
step four, establishing a cavity boundary by searching edges and vertexes adjacent to the cavity;
step four, converting the cavity boundary into a group of triangles by using a triangularization method, connecting the vertexes on the cavity boundary to form triangles, and filling the cavity;
fourthly, after filling the hole, connecting the newly generated triangle with the original grid by creating a connecting edge between the hole boundary and the original grid;
and fourthly, repairing potential topology problems by using a topology repairing algorithm so as to ensure the correctness and rationality of the filled grid topology structure.
5. The three-dimensional grid model simplifying method for a chinese space station according to claim 1, wherein the specific steps of the step six are as follows:
step six, a triangle Q is taken from the simplified three-dimensional grid model of the space station, and all triangles in the adjacent area of the triangle Q are taken from the original three-dimensional grid model of the space station as an alternative set;
step six, for each triangle P in the alternative set, calculating the projection area S of Q to P pq And centroid distance d pq And further calculates the correlation coefficient r=s of P and Q pq /d pq The larger the correlation coefficient is, the higher the feature similarity corresponding to the two triangular plates is, and the same color is used for representing the same feature, so that the three-dimensional model of the space station is clearly displayed;
step six, for Q, selecting a triangle with the largest correlation coefficient from the alternative set corresponding to Q as the color of Q;
and step six, repeating the step six, the step one and the step six, traversing all the simplified triangular surfaces, and completing color calculation.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311187026.7A CN117315192B (en) | 2023-09-14 | 2023-09-14 | Three-dimensional grid model simplification method for Chinese space station |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311187026.7A CN117315192B (en) | 2023-09-14 | 2023-09-14 | Three-dimensional grid model simplification method for Chinese space station |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN117315192A true CN117315192A (en) | 2023-12-29 |
| CN117315192B CN117315192B (en) | 2024-04-05 |
Family
ID=89241727
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311187026.7A Active CN117315192B (en) | 2023-09-14 | 2023-09-14 | Three-dimensional grid model simplification method for Chinese space station |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117315192B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117541751A (en) * | 2024-01-04 | 2024-02-09 | 支付宝(杭州)信息技术有限公司 | Three-dimensional model degradation method and device |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102881044A (en) * | 2012-09-27 | 2013-01-16 | 重庆大学 | Simplification method of three-dimensional grid model based on triangle folding |
| CN108171780A (en) * | 2017-12-28 | 2018-06-15 | 电子科技大学 | A kind of method that indoor true three-dimension map is built based on laser radar |
| CN112258655A (en) * | 2020-11-13 | 2021-01-22 | 河北地质大学 | Three-dimensional grid simplification method applied to VR virtual bank |
| CN116109783A (en) * | 2022-11-18 | 2023-05-12 | 东北大学 | Open-pit mine three-dimensional mining planning system and method |
-
2023
- 2023-09-14 CN CN202311187026.7A patent/CN117315192B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102881044A (en) * | 2012-09-27 | 2013-01-16 | 重庆大学 | Simplification method of three-dimensional grid model based on triangle folding |
| CN108171780A (en) * | 2017-12-28 | 2018-06-15 | 电子科技大学 | A kind of method that indoor true three-dimension map is built based on laser radar |
| CN112258655A (en) * | 2020-11-13 | 2021-01-22 | 河北地质大学 | Three-dimensional grid simplification method applied to VR virtual bank |
| CN116109783A (en) * | 2022-11-18 | 2023-05-12 | 东北大学 | Open-pit mine three-dimensional mining planning system and method |
Non-Patent Citations (4)
| Title |
|---|
| 乔娇娇: ""三维激光扫描技术在古建筑保护复原中的应用及空洞修补研究"", 《中国优秀硕士学位论文全文数据库 基础科学辑》, 15 February 2023 (2023-02-15), pages 32 - 38 * |
| 沈旭昆等: ""一种保留几何及属性边界的网格简化方法‘", 《北京航空航天大学学报》, vol. 32, no. 12, 31 December 2006 (2006-12-31), pages 1485 - 1489 * |
| 董艳: ""基于重要度的保形三角网格简化方法研究"", 中国优秀硕士学位论文全文数据库 信息科技辑》, 15 February 2014 (2014-02-15), pages 14 - 18 * |
| 连明明等: ""基于顶点删除的三角网格模型简化新方法"", 《微电子学与计算机》, vol. 26, no. 5, 31 May 2009 (2009-05-31), pages 142 - 148 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117541751A (en) * | 2024-01-04 | 2024-02-09 | 支付宝(杭州)信息技术有限公司 | Three-dimensional model degradation method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN117315192B (en) | 2024-04-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8711143B2 (en) | System and method for interactive image-based modeling of curved surfaces using single-view and multi-view feature curves | |
| US6307554B1 (en) | Apparatus and method for generating progressive polygon data, and apparatus and method for generating three-dimensional real-time graphics using the same | |
| CN110309458B (en) | BIM model display and rendering method based on WebGL | |
| US20050052452A1 (en) | 3D computer surface model generation | |
| CN117315192B (en) | Three-dimensional grid model simplification method for Chinese space station | |
| CN111581776B (en) | Iso-geometric analysis method based on geometric reconstruction model | |
| CN101231761B (en) | Graticule model simplification method for keeping external appearance characteristic | |
| JPH05266212A (en) | Method for generating object | |
| CN103632394B (en) | The Model Simplification Method that a kind of feature keeps | |
| CN113724401B (en) | Three-dimensional model cutting method and device, computer equipment and storage medium | |
| CN110717967A (en) | Large-scene-model-oriented web-side dynamic rendering LOD processing method | |
| CN115018992A (en) | Method and device for generating hair style model, electronic equipment and storage medium | |
| CN111047684A (en) | Model simplification method based on three-dimensional model characteristics | |
| Chen et al. | An improved texture-related vertex clustering algorithm for model simplification | |
| CN114119837A (en) | Geometric processing compression method and device in Revit model lightweight rendering process | |
| Wiemann et al. | Automatic Map Creation For Environment Modelling In Robotic Simulators. | |
| Hu et al. | Parallel BVH construction using locally density clustering | |
| Huang et al. | Mesh simplification algorithm based on edge curvature metrics and local optimization | |
| CN107895398B (en) | Relief editing method combined with visual saliency | |
| WO2000041138A1 (en) | Three-dimensional skeleton data error absorber | |
| Dobashi et al. | Radiosity for point-sampled geometry | |
| CN113591208A (en) | Oversized model lightweight method based on ship feature extraction and electronic equipment | |
| Pan et al. | Improved QEM simplification algorithm based on local area feature information constraint | |
| CN117807782B (en) | Method for realizing three-dimensional simulation model | |
| CN112215951B (en) | Out-of-core multi-resolution point cloud representation method and point cloud display method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |