CN117456109B - Three-dimensional scene lightweight optimization method - Google Patents
Three-dimensional scene lightweight optimization method Download PDFInfo
- Publication number
- CN117456109B CN117456109B CN202311786010.8A CN202311786010A CN117456109B CN 117456109 B CN117456109 B CN 117456109B CN 202311786010 A CN202311786010 A CN 202311786010A CN 117456109 B CN117456109 B CN 117456109B
- Authority
- CN
- China
- Prior art keywords
- undirected edge
- undirected
- dimensional
- endpoint
- edge
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 41
- 238000005457 optimization Methods 0.000 title claims abstract description 10
- 239000011159 matrix material Substances 0.000 claims description 5
- 238000012163 sequencing technique Methods 0.000 claims description 4
- 238000011946 reduction process Methods 0.000 claims description 3
- 238000009877 rendering Methods 0.000 abstract description 3
- 230000000007 visual effect Effects 0.000 abstract description 3
- 238000004364 calculation method Methods 0.000 description 8
- 238000010586 diagram Methods 0.000 description 6
- 238000004590 computer program Methods 0.000 description 5
- 230000006870 function Effects 0.000 description 4
- 239000013598 vector Substances 0.000 description 3
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 239000013585 weight reducing agent Substances 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000001186 cumulative effect Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 239000000284 extract Substances 0.000 description 1
- 230000002427 irreversible effect Effects 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000010606 normalization Methods 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
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T15/00—3D [Three Dimensional] image rendering
- G06T15/005—General purpose rendering architectures
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Computer Graphics (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Geometry (AREA)
- Software Systems (AREA)
- Processing Or Creating Images (AREA)
Abstract
The invention discloses a three-dimensional scene lightweight optimization method, which comprises the steps of obtaining triangular components in three-dimensional scene data; extracting three corresponding edges from all triangular components to construct an undirected edge set; setting endpoint weights of the undirected edges according to the position information of whether each undirected edge in the undirected edge set is positioned at the boundary of the three-dimensional space, and calculating geometrical deformation values of the undirected edge reducing process according to the endpoint weights of the undirected edges; and determining the processing sequence for reducing the undirected edges according to the geometric deformation value calculated by each undirected edge in the undirected edge set. According to the invention, by judging the end points on the tile boundary and forcing the end points to be reduced only to the tile boundary, visual flaws caused by boundary hollows of adjacent tiles during rendering are avoided, and the texture quality of a three-dimensional model lightweight result can be effectively improved.
Description
Technical Field
The invention relates to the technical field of three-dimensional scene weight reduction, in particular to a three-dimensional scene weight reduction optimization method.
Background
In the light weight process of a large-scale three-dimensional scene, it is unavoidable to cut the scene. In some cases it is possible for a member to be cut into two adjacent shingles (referred to as tiles), where the member is formed from a network of a large number of triangles (referred to as a triangle mesh) such that there are very small triangles between adjacent tiles that would have been shredded into, but were the same triangle in the member, but were cut into different shingles. When two adjacent tiles are each light, these small triangles at the tile boundaries shrink toward the inside of the tile, resulting in the tile boundaries collapsing toward the inside of the tile, when the two adjacent tiles are re-aligned into memory during rendering and spatially stitched together, a hole appears at the boundary of the two tiles, which would otherwise be spatially continuous at the boundary of the tiles, causing visually unacceptable imperfections.
Disclosure of Invention
Aiming at the defects in the prior art, the invention provides a three-dimensional scene lightweight optimization method, which is characterized in that special judgment and processing on tile boundaries are added in the lightweight process of a tile file to avoid inward collapse of small triangles at the tile file boundaries, so that visual flaws caused by hollows at adjacent tile boundaries are completely eliminated, and the problem that texture flaws exist in lightweight results when deformed grid data exist in 3D scene data such as BIM or 3DMAX is solved.
In order to achieve the aim of the invention, the invention adopts the following technical scheme:
a three-dimensional scene lightweight optimization method comprises the following steps:
s1, acquiring a triangular member in three-dimensional scene data;
s2, extracting three corresponding edges of all the triangular components to construct an undirected edge set;
s3, setting endpoint weights of the undirected edges according to the position information of whether each undirected edge in the undirected edge set is positioned at the boundary of the three-dimensional space, and calculating geometric deformation values of the undirected edge reduction process according to the endpoint weights of the undirected edges;
s4, determining a processing sequence for reducing the undirected edges according to the geometric deformation value calculated by each undirected edge in the undirected edge set.
Optionally, in step S3, the method for determining whether the undirected edge is at a three-dimensional boundary is:
calculating three-dimensional components of the endpoints according to the three-dimensional coordinates of the two endpoints of the undirected edge;
calculating three-dimensional components of the vertexes according to three-dimensional coordinates of the two vertexes of the three-dimensional space;
judging whether the absolute values of the differences between the three-dimensional components of each endpoint of the undirected edge and the corresponding three-dimensional components of all vertexes of the three-dimensional space are smaller than or equal to a set threshold value; if yes, the endpoints of the undirected edge are positioned at the boundary of the three-dimensional space; otherwise, the end points of the undirected edge are not positioned at the boundary of the three-dimensional space.
Alternatively, in step A3, determining whether the absolute value of the difference between the three-dimensional components of each endpoint of the undirected edge and the corresponding three-dimensional components of all vertices of the three-dimensional space is less than or equal to a set threshold value specifically includes:
and judging whether the absolute value of the difference between the X-axis components of each endpoint of the undirected edge and the X-axis components of all vertexes of the three-dimensional space, or the absolute value of the difference between the Y-axis components of each endpoint of the undirected edge and the Y-axis components of all vertexes of the three-dimensional space, or the absolute value of the difference between the Z-axis components of each endpoint of the undirected edge and the Z-axis components of all vertexes of the three-dimensional space is smaller than or equal to a set threshold value.
Alternatively, the setting threshold is specifically: 1e-6.
Alternatively, in step S3, setting the endpoint weight of the undirected edge according to the location information of whether each undirected edge in the undirected edge set is at the boundary of the three-dimensional space specifically includes:
if the endpoint of the undirected edge is at the three-dimensional space boundary, adding 1 to the endpoint weight of the undirected edge;
if the endpoint of the undirected edge is not at the boundary of the three-dimensional space, the endpoint weight of the undirected edge is kept unchanged.
Optionally, in step S3, calculating the geometric deformation value of the process of reducing the undirected edge according to the endpoint weight of the undirected edge specifically includes:
if the weights of the two end points of the undirected edge are 0, calculating and reducing the geometric deformation value generated by the undirected edge according to the vertex coordinates of the three-dimensional space determined by the plane of the triangle connected with the undirected edge;
if the weight of the two endpoints of the undirected edge is not equal to 0, the geometric deformation value generated by the undirected edge is reduced according to the three-dimensional coordinates of the endpoint with the larger endpoint weight.
Optionally, in step S3, the method for calculating the geometric deformation value of the reduced undirected edge process includes:
，
wherein,representing the vertex error and,Vvertex coordinates representing three-dimensional space,/->Representing the plane of the triangle connected by the current undirected edge,nthe number of planes is represented and,Trepresenting the matrix transpose.
Optionally, in step S4, the method for determining the processing sequence for reducing the undirected edges according to the geometric deformation value calculated by each undirected edge in the undirected edge set includes:
s51, sequencing geometric deformation values calculated by each undirected edge in the undirected edge set, and constructing an undirected edge priority queue;
s52, sequentially reducing the undirected edges according to the undirected edge priority queue, and judging whether preset conditions are met or not;
if yes, ending the flow;
otherwise, the current undirected edges are reduced to edges of all triangles associated with one point to construct an undirected edge set, and the step S3 is returned.
Alternatively, the method for judging whether the preset condition is satisfied comprises the following steps:
judging whether the number of triangle members in the three-dimensional scene data is reduced to a set threshold value; or whether the undirected edge priority queue is empty;
if yes, ending the flow; otherwise, step S4 is performed.
The invention has the following beneficial effects:
according to the invention, by judging the end points on the tile boundary and forcing the end points to be reduced only to the tile boundary, visual flaws caused by boundary hollows of adjacent tiles during rendering are avoided, and the texture quality of a three-dimensional model lightweight result can be effectively improved.
Drawings
Fig. 1 is a schematic flow chart of a three-dimensional scene lightweight optimization method in the invention.
Detailed Description
The following description of the embodiments of the present invention is provided to facilitate understanding of the present invention by those skilled in the art, but it should be understood that the present invention is not limited to the scope of the embodiments, and all the inventions which make use of the inventive concept are protected by the spirit and scope of the present invention as defined and defined in the appended claims to those skilled in the art.
As shown in fig. 1, an embodiment of the present invention provides a three-dimensional scene lightweight optimization method, which includes steps S1 to S4:
s1, acquiring a triangular member in three-dimensional scene data;
in an alternative embodiment of the present invention, for three-dimensional scene data of a three-dimensional model, the present embodiment obtains all triangle members a { v0, v1, v2} from the three-dimensional scene data, where v0, v1, v2 represent three vertices of a triangle.
S2, extracting three corresponding edges of all the triangular components to construct an undirected edge set;
in an alternative embodiment of the present invention, the present embodiment extracts corresponding three sides { v0v1, v1v2, v2v0} for all triangle members a, and constructs an undirected side set E from the extracted three sides of all triangle members.
S3, setting endpoint weights of the undirected edges according to the position information of whether each undirected edge in the undirected edge set is positioned at the boundary of the three-dimensional space, and calculating geometric deformation values of the undirected edge reduction process according to the endpoint weights of the undirected edges;
in an alternative embodiment of the present invention, the three-dimensional space cube boxes are used to cut the three-dimensional scene, so that the data of the three-dimensional scene is divided into a plurality of adjacent cube boxes, and the scene divided into each cube box is individually stored as an independent disk file, called a tile or a tile file. The size of each cube box is the same, and the side length is recorded as tile_size in meters. The Tile file adopts a naming mode of Tile-i-j-k, wherein i, j and k are non-negative integers, the value of i starts from 0, i represents that a three-dimensional scene starts from an origin O, and every tile_size distance is moved along the positive direction of the X axis, i=i+1, and i=0 at the origin; similarly, j represents that every tile_size distance is moved along the Y axis in the positive direction of the three-dimensional scene from the origin O, j=j+1, and j=0 at the origin; k represents that every tile_size distance is moved in the positive direction along the Z axis from its origin O, then k=k+1, where k=0.
In the embodiment, whether one vertex is on a tile boundary or not is judged in the light-weight process of the tile file, and weights are given, and then when edges are reduced in the light-weight process of the tile, the edges automatically slide to the boundary of the tile according to the weights given by the vertices, so that the boundary of the tile is prevented from collapsing inwards.
In an optional embodiment of the present invention, the method for determining whether the undirected edge is at a boundary of the three-dimensional space in this embodiment is:
calculating three-dimensional components of the endpoints according to the three-dimensional coordinates of the two endpoints of the undirected edge;
calculating three-dimensional components of the vertexes according to three-dimensional coordinates of the two vertexes of the three-dimensional space;
judging whether the absolute values of the differences between the three-dimensional components of each endpoint of the undirected edge and the corresponding three-dimensional components of all vertexes of the three-dimensional space are smaller than or equal to a set threshold value; if yes, the endpoints of the undirected edge are positioned at the boundary of the three-dimensional space; otherwise, the end points of the undirected edge are not positioned at the boundary of the three-dimensional space.
In this embodiment, determining whether the absolute value of the difference between the three-dimensional components of each endpoint of the undirected edge and the corresponding three-dimensional components of all vertices of the three-dimensional space is less than or equal to a set threshold value specifically includes:
and judging whether the absolute value of the difference between the X-axis components of each endpoint of the undirected edge and the X-axis components of all vertexes of the three-dimensional space, or the absolute value of the difference between the Y-axis components of each endpoint of the undirected edge and the Y-axis components of all vertexes of the three-dimensional space, or the absolute value of the difference between the Z-axis components of each endpoint of the undirected edge and the Z-axis components of all vertexes of the three-dimensional space is smaller than or equal to a set threshold value.
The threshold setting in this embodiment is specifically: 1e-6.
In this embodiment, setting endpoint weights of undirected edges according to position information of whether each undirected edge in the undirected edge set is at a three-dimensional space boundary specifically includes:
if the endpoint of the undirected edge is at the three-dimensional space boundary, adding 1 to the endpoint weight of the undirected edge;
if the endpoint of the undirected edge is not at the boundary of the three-dimensional space, the endpoint weight of the undirected edge is kept unchanged.
Specifically, for each undirected edge { vi, vj } in the set E, where 0< =i, j < =2, it is first determined whether the undirected edge { vi, vj } is on the boundary of the tile, and the endpoints vi, vj are given weight values wi, wj, respectively, where the weight values are nonnegative integers, and default to 0.
Each tile has a corresponding three-dimensional box, which can be represented by two three-dimensional coordinates, tile_min and tile_max. Comparing the three components of the endpoint vi with all six components of the two three-dimensional coordinates tile_min and tile_max of the cube box respectively, and if the absolute value of the difference between the x component of the endpoint vi and the x component of tile_min or tile_max, or the absolute value of the difference between the y component of the endpoint vi and the y component of tile_min or tile_max, or the absolute value of the difference between the z component of the endpoint vi and the z component of tile_min or tile_max is smaller than or equal to 1e-6, then the endpoint vi is considered to be in place on the plane aligned with one axis of the cube box, and meanwhile the weight wi of the endpoint vi is added with 1, namely wi=wi+1. Similarly, the endpoint vj is calculated to obtain the endpoint weight wj.
In an optional embodiment of the present invention, the calculating the geometric deformation value of the process of reducing the undirected edge according to the endpoint weight of the undirected edge specifically includes:
if the weights of the two end points of the undirected edge are 0, calculating and reducing the geometric deformation value generated by the undirected edge according to the vertex coordinates of the three-dimensional space determined by the plane of the triangle connected with the undirected edge;
if the weight of the two endpoints of the undirected edge is not equal to 0, the geometric deformation value generated by the undirected edge is reduced according to the three-dimensional coordinates of the endpoint with the larger endpoint weight.
Specifically, if wi=wj=0, i.e. neither of the endpoints vi, vj is on the axis alignment plane of the tile cube box, or on the boundary of the tile, the geometric deformation value resulting from reducing this undirected edge is directly calculated as:
，
wherein,representing the vertex error and,Vvertex coordinates representing three-dimensional space,/->Representing the plane of the triangle connected by the current undirected edge, i.e. +.>Whereina，b，cIndicating the normal direction of the plane,drepresenting the directed distance from the origin to the plane,nthe number of planes is represented and,Trepresenting the matrix transpose.a，b，c，dThe plane equation forming the plane of the triangle satisfies the following conditions: ax+by+cz+d=0, and the specific calculation process is as follows:
，
，
wherein,、/>、/>three vertices of triangle>Is vertex->And->The component edge vectors of the two-dimensional image are used for generating the edge vectors,is vertex->And->And (5) forming an edge vector.
，
Normalization is performed with the mode length of the plane normal, expressed as:
，
thereby obtaining the directional distance from the origin to the plane as follows:
，
wherein,、/>、/>is vertex->In three directions.
The vertex coordinates V of the three-dimensional space in this embodiment can be obtained by the following procedure:
constructing a basic error quadratic equation of a plane where a triangle connected by the current undirected edge is located, wherein the basic error quadratic equation is expressed as follows:
，
the cumulative sum of the basic error quadratic equations for all triangles associated with the two vertices of the current undirected edge is calculated as:
，
if the matrix Q is invertible, it can be calculated as:
，
at this time will V min Substituting the geometric deformation value into V in the geometric deformation value calculation formula to obtain the geometric deformation value generated by reducing the undirected edge.
If the matrix Q is irreversible, taking V in a geometric deformation value calculation formula as the average value of two vertexes and vertexes of the current undirected edge, and selecting the minimum value in the obtained three calculation values as the geometric deformation value generated by reducing the undirected edge.
If wi > wj > = 0, i.e. at least the end point vi is on the axis alignment plane of the tile cube box, or on the boundary of the tile, the three-dimensional coordinates of the end point vi are directly taken into the variable V in the geometric deformation calculation formula, and the geometric deformation generated by reducing the undirected edge is calculated, where vmin=vi. Otherwise, 0< = wi < wj, directly introducing the three-dimensional coordinates of the vertex vj into a variable V in a geometric deformation value calculation formula, and calculating and reducing the geometric deformation value generated by the undirected edge, wherein Vmin = vj.
In this embodiment, the coordinates of the undirected edges { vi, vj } are reduced to a three-dimensional point in step S3 to be located on the boundary of the tile file, so that the tile file is ensured not to collapse inwards at the boundary in the light-weight process.
S4, determining a processing sequence for reducing the undirected edges according to the geometric deformation value calculated by each undirected edge in the undirected edge set.
In an alternative embodiment of the present invention, the method for determining a processing sequence for reducing the undirected edges according to the geometric deformation value calculated by each undirected edge in the undirected edge set includes:
s51, sequencing geometric deformation values calculated by each undirected edge in the undirected edge set, and constructing an undirected edge priority queue;
s52, sequentially reducing the undirected edges according to the undirected edge priority queue, and judging whether preset conditions are met or not;
if yes, ending the flow;
otherwise, the current undirected edges are reduced to edges of all triangles associated with one point to construct an undirected edge set, and the step S3 is returned.
The method for judging whether the preset condition is met comprises the following steps:
judging whether the number of triangle members in the three-dimensional scene data is reduced to a set threshold value; or whether the undirected edge priority queue is empty;
if yes, ending the flow; otherwise, step S4 is performed.
Specifically, in this embodiment, for each undirected edge in the set E formed by undirected edges in step S2, the geometric deformation value generated after each undirected edge in the undirected edge set E is reduced to one point can be calculated by using the calculation method in step S3, and meanwhile, the three-dimensional coordinate Vmin when the undirected edge is reduced to one point can be obtained. And according to the size of the geometric deformation value generated when each undirected edge is reduced to one point, sequencing all undirected edges in the undirected edge set E from small arrivals according to the size of the geometric deformation value, and obtaining a priority queue Q consisting of undirected edges.
The undirected edge at the front of the queue Q is reduced, the undirected edge is removed from the queue Q, and the triangle associated with the undirected edge passing edge is removed from the three-dimensional scene. Each time the undirected edge of the queue Q arranged at the front is reduced to a point, the operation of step S3 is repeated for all the edges of the triangles associated with the point, and the undirected edge in the set E is the undirected edge in all the triangles associated with the point at the input of step S3. Through the processing in step S3, the geometric deformation value of the undirected edge associated with the point in the priority queue Q is updated, and the ordering of the queue Q is changed.
The operation of step S4 is repeated until the number of triangles of the three-dimensional scene is reduced to a predetermined number or the queue Q is empty, and the calculation is stopped.
The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
The principles and embodiments of the present invention have been described in detail with reference to specific examples, which are provided to facilitate understanding of the method and core ideas of the present invention; meanwhile, as those skilled in the art will have variations in the specific embodiments and application scope in accordance with the ideas of the present invention, the present description should not be construed as limiting the present invention in view of the above.
Those of ordinary skill in the art will recognize that the embodiments described herein are for the purpose of aiding the reader in understanding the principles of the present invention and should be understood that the scope of the invention is not limited to such specific statements and embodiments. Those of ordinary skill in the art can make various other specific modifications and combinations from the teachings of the present disclosure without departing from the spirit thereof, and such modifications and combinations remain within the scope of the present disclosure.
Claims (6)
1. The light-weight optimization method for the three-dimensional scene is characterized by comprising the following steps of:
s1, acquiring a triangular member in three-dimensional scene data;
s2, extracting three corresponding edges of all the triangular components to construct an undirected edge set;
s3, setting endpoint weights of the undirected edges according to the position information of whether each undirected edge in the undirected edge set is positioned at the boundary of the three-dimensional space, and calculating geometric deformation values of the undirected edge reduction process according to the endpoint weights of the undirected edges;
the setting of the endpoint weight of the undirected edge according to the position information of whether each undirected edge in the undirected edge set is at the boundary of the three-dimensional space specifically comprises:
if the endpoint of the undirected edge is at the three-dimensional space boundary, adding 1 to the endpoint weight of the undirected edge;
if the endpoint of the undirected edge is not at the boundary of the three-dimensional space, the endpoint weight of the undirected edge is kept unchanged;
the calculating the geometric deformation value of the process of reducing the undirected edge according to the endpoint weight of the undirected edge specifically comprises the following steps:
if the weights of the two end points of the undirected edge are 0, calculating and reducing the geometric deformation value generated by the undirected edge according to the vertex coordinates of the three-dimensional space determined by the plane of the triangle connected with the undirected edge;
if the weight of the two endpoints of the undirected edge is not equal to 0, calculating and reducing the geometric deformation value generated by the undirected edge according to the three-dimensional coordinates of the endpoint with larger endpoint weight;
the method for calculating the geometric deformation value of the reduced undirected edge process comprises the following steps:
，
wherein,representing the vertex error and,Vvertex coordinates representing three-dimensional space,/->Representing the plane of the triangle connected by the current undirected edge,nthe number of planes is represented and,Trepresenting a matrix transpose;
s4, determining a processing sequence for reducing the undirected edges according to the geometric deformation value calculated by each undirected edge in the undirected edge set.
2. The method for optimizing three-dimensional scene weight according to claim 1, wherein in step S3, the method for determining whether the undirected edge is at the boundary of the three-dimensional space is as follows:
calculating three-dimensional components of the endpoints according to the three-dimensional coordinates of the two endpoints of the undirected edge;
calculating three-dimensional components of the vertexes according to three-dimensional coordinates of the two vertexes of the three-dimensional space;
judging whether the absolute values of the differences between the three-dimensional components of each endpoint of the undirected edge and the corresponding three-dimensional components of all vertexes of the three-dimensional space are smaller than or equal to a set threshold value; if yes, the endpoints of the undirected edge are positioned at the boundary of the three-dimensional space; otherwise, the end points of the undirected edge are not positioned at the boundary of the three-dimensional space.
3. The method for optimizing three-dimensional scene weight according to claim 2, wherein in step S3, it is determined whether the absolute value of the difference between the three-dimensional components of each endpoint of the undirected edge and the corresponding three-dimensional components of all vertices of the three-dimensional space is less than or equal to a set threshold, and specifically includes:
and judging whether the absolute value of the difference between the X-axis components of each endpoint of the undirected edge and the X-axis components of all vertexes of the three-dimensional space, or the absolute value of the difference between the Y-axis components of each endpoint of the undirected edge and the Y-axis components of all vertexes of the three-dimensional space, or the absolute value of the difference between the Z-axis components of each endpoint of the undirected edge and the Z-axis components of all vertexes of the three-dimensional space is smaller than or equal to a set threshold value.
4. A three-dimensional scene lightweight optimization method according to claim 2 or 3, characterized in that the set threshold is specifically: 1e-6.
5. The method for optimizing three-dimensional scene weight according to claim 1, wherein in step S4, the method for determining the processing order of reducing the undirected edges according to the geometric deformation value calculated by each undirected edge in the undirected edge set comprises:
s51, sequencing geometric deformation values calculated by each undirected edge in the undirected edge set, and constructing an undirected edge priority queue;
s52, sequentially reducing the undirected edges according to the undirected edge priority queue, and judging whether preset conditions are met or not;
if yes, ending the flow;
otherwise, the current undirected edges are reduced to edges of all triangles associated with one point to construct an undirected edge set, and the step S3 is returned.
6. The method for optimizing three-dimensional scene weight according to claim 5, wherein the method for judging whether the preset condition is satisfied comprises:
judging whether the number of triangle members in the three-dimensional scene data is reduced to a set threshold value; or whether the undirected edge priority queue is empty;
if yes, ending the flow; otherwise, step S4 is performed.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311786010.8A CN117456109B (en) | 2023-12-25 | 2023-12-25 | Three-dimensional scene lightweight optimization method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311786010.8A CN117456109B (en) | 2023-12-25 | 2023-12-25 | Three-dimensional scene lightweight optimization method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN117456109A CN117456109A (en) | 2024-01-26 |
| CN117456109B true CN117456109B (en) | 2024-03-15 |
Family
ID=89584132
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311786010.8A Active CN117456109B (en) | 2023-12-25 | 2023-12-25 | Three-dimensional scene lightweight optimization method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117456109B (en) |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2014001694A1 (en) * | 2012-06-29 | 2014-01-03 | Real Fusio France | Method and system for simplifying a meshing of a scene in three dimensions |
| CN103810747A (en) * | 2014-01-29 | 2014-05-21 | 辽宁师范大学 | Three-dimensional point cloud object shape similarity comparing method based on two-dimensional mainstream shape |
| US9911039B1 (en) * | 2015-09-08 | 2018-03-06 | National Technology & Engineering Solutions Of Sandia, Llc | Searches over graphs representing geospatial-temporal remote sensing data |
| CN115311418A (en) * | 2022-10-10 | 2022-11-08 | 深圳大学 | Multi-detail-level tree model single reconstruction method and device |
| CN116091526A (en) * | 2023-04-10 | 2023-05-09 | 北京飞渡科技股份有限公司 | Smart city three-dimensional scene tiling acceleration method |
| EP4187898A2 (en) * | 2021-11-30 | 2023-05-31 | Plantronics, Inc. | Securing image data from unintended disclosure at a videoconferencing endpoint |
| CN117173370A (en) * | 2023-11-03 | 2023-12-05 | 北京飞渡科技股份有限公司 | Method for maintaining object boundary in light weight process |
| CN117197396A (en) * | 2023-11-03 | 2023-12-08 | 北京飞渡科技股份有限公司 | Rapid light-weight method for large-scale three-dimensional scene |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US11604298B2 (en) * | 2020-02-12 | 2023-03-14 | ExxonMobil Technology and Engineering Company | Subsurface fault extraction using undirected graphs |
-
2023
- 2023-12-25 CN CN202311786010.8A patent/CN117456109B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2014001694A1 (en) * | 2012-06-29 | 2014-01-03 | Real Fusio France | Method and system for simplifying a meshing of a scene in three dimensions |
| CN103810747A (en) * | 2014-01-29 | 2014-05-21 | 辽宁师范大学 | Three-dimensional point cloud object shape similarity comparing method based on two-dimensional mainstream shape |
| US9911039B1 (en) * | 2015-09-08 | 2018-03-06 | National Technology & Engineering Solutions Of Sandia, Llc | Searches over graphs representing geospatial-temporal remote sensing data |
| EP4187898A2 (en) * | 2021-11-30 | 2023-05-31 | Plantronics, Inc. | Securing image data from unintended disclosure at a videoconferencing endpoint |
| CN115311418A (en) * | 2022-10-10 | 2022-11-08 | 深圳大学 | Multi-detail-level tree model single reconstruction method and device |
| CN116091526A (en) * | 2023-04-10 | 2023-05-09 | 北京飞渡科技股份有限公司 | Smart city three-dimensional scene tiling acceleration method |
| CN117173370A (en) * | 2023-11-03 | 2023-12-05 | 北京飞渡科技股份有限公司 | Method for maintaining object boundary in light weight process |
| CN117197396A (en) * | 2023-11-03 | 2023-12-08 | 北京飞渡科技股份有限公司 | Rapid light-weight method for large-scale three-dimensional scene |
Non-Patent Citations (2)
| Title |
|---|
| 一种保留几何及属性边界的网格简化方法;沈旭昆;赵学伟;齐越;蔡苏;;北京航空航天大学学报;20061230(第12期);94-98 * |
| 顶点重要度调整的三维场景集成简化方法;李慧婷;李朝奎;卜璞;;测绘科学;20160920(第09期);150-154 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN117456109A (en) | 2024-01-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111932688B (en) | Indoor plane element extraction method, system and equipment based on three-dimensional point cloud | |
| US9972128B2 (en) | Methods and systems for generating polycubes and all-hexahedral meshes of an object | |
| US8711143B2 (en) | System and method for interactive image-based modeling of curved surfaces using single-view and multi-view feature curves | |
| KR20180107192A (en) | Orthogonal-projection-based texture atlas packing of 3D meshes | |
| US11200737B2 (en) | Adaptive mesh non-regularized Booleans | |
| US10452788B2 (en) | Modeling a three-dimensional object having multiple materials | |
| CN117173370B (en) | Method for maintaining object boundary in light weight process | |
| CN110264405B (en) | Image processing method, device, server and storage medium based on interpolation algorithm | |
| EP3035291B1 (en) | Rendering based generation of occlusion culling models | |
| CN107622530B (en) | Efficient and robust triangulation network cutting method | |
| CN117197396B (en) | Rapid light-weight method for large-scale three-dimensional scene | |
| US10650586B2 (en) | Automated mesh generation | |
| CN108986218B (en) | PMVS-based rapid building dense point cloud reconstruction method | |
| CN116091526B (en) | Smart city three-dimensional scene tiling acceleration method | |
| CN113012259B (en) | Method for filling concave polygon based on triangulation algorithm | |
| CN115222879B (en) | Model face reduction processing method and device, electronic equipment and storage medium | |
| CN112070908B (en) | Automatic splitting method for three-dimensional model, computer equipment and storage medium | |
| CN117456109B (en) | Three-dimensional scene lightweight optimization method | |
| CN111210520A (en) | Reverse forming method and system for physical model | |
| US20240096022A1 (en) | Low-poly mesh generation for three-dimensional models | |
| CN111161129A (en) | Three-dimensional interaction design method and system for two-dimensional image | |
| CN113781642A (en) | Three-dimensional model multi-level LOD generation method based on face reduction algorithm | |
| CN113379826A (en) | Method and device for measuring volume of logistics piece | |
| CN113674294A (en) | 3D model slice processing method and device | |
| CN110111249B (en) | Method and system for acquiring and generating tunnel inner wall jigsaw image |
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 |