CN109961515A - A kind of efficient Spatial three-dimensional dispersion model meshes reconstructing method - Google Patents
A kind of efficient Spatial three-dimensional dispersion model meshes reconstructing method Download PDFInfo
- Publication number
- CN109961515A CN109961515A CN201910272220.2A CN201910272220A CN109961515A CN 109961515 A CN109961515 A CN 109961515A CN 201910272220 A CN201910272220 A CN 201910272220A CN 109961515 A CN109961515 A CN 109961515A
- Authority
- CN
- China
- Prior art keywords
- grid cell
- grid
- vertex
- model
- operator
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 27
- 239000006185 dispersion Substances 0.000 title claims abstract description 16
- 238000012545 processing Methods 0.000 claims description 5
- 230000000694 effects Effects 0.000 description 3
- 238000009877 rendering Methods 0.000 description 3
- 230000009286 beneficial effect Effects 0.000 description 2
- 238000011160 research Methods 0.000 description 2
- 230000005540 biological transmission Effects 0.000 description 1
- 238000010835 comparative analysis Methods 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 239000007787 solid 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
-
- 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
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)
Abstract
The invention discloses a kind of efficient Spatial three-dimensional dispersion model meshes reconstructing methods, include the following steps: S1: setting grid cell simultaneously sets grid operator；S2: original three-dimensional model is read, and traverses grid cell；S3: setting and simplify threshold value, and the simplified threshold definitions are the mean value of the grid operator on each vertex of the grid cell；S4: model simplification operation traverses the grid cell again, the grid operator of each grid cell and the simplified threshold value comparison deletes the qualified grid cell；The present invention can while reducing model data amount it is as much as possible retain original three-dimensional model local detail feature.
Description
Technical field
The present invention relates to dimensional Modeling Technology field, more particularly to a kind of efficient Spatial three-dimensional dispersion model net
Lattice reconstructing method.
Background technique
Currently, dimensional Modeling Technology and the equipment that three-dimensional data obtains are improved day by day, video display with the fast development of science and technology
The 3D product of animation, 3D game, terrain modeling etc. starts to enter into people's lives gradually, meet people figure accuracy with
Demand in terms of the sense of reality.
However, nowadays large complicated threedimensional model is very common, the data volume of these models is huge, to storage,
The problem of transmission, display bring very hang-up with rendering, therefore Model reducing technique slowly becomes people's urgent need to resolve, such as
Yongzhi Wang is united by the geological information of single order abutment points and second order abutment points to each vertex of model meshes unit
Meter analysis (Yongzhi Wang, Jianwen Zheng, Hui Wang, Fast Mesh Simplification Method
for Three-Dimensional Geometric Models with Feature-Preserving Efficiency,
Scientific Programming, 2019), the spy of model is kept while model data amount can be reduced to a certain extent
Sign property alleviates contradiction between data storage and modeling rendering；Although model simplification is a more mature research direction, possess
A large amount of research method, but there are still will cause geometrical characteristic to a certain degree when simplifying extensive threedimensional model to lose
The problem of mistake.
Therefore, how to provide one kind not losing the Spatial three-dimensional dispersion model method of geometrical characteristic is those skilled in the art
The problem of urgent need to resolve.
Summary of the invention
In view of this, can reduced the present invention provides a kind of efficient Spatial three-dimensional dispersion model meshes reconstructing method
The local detail feature as much as possible for retaining original three-dimensional model while model data amount, while improving efficiency of algorithm.
To achieve the goals above, the present invention adopts the following technical scheme:
A kind of efficient Spatial three-dimensional dispersion model meshes reconstructing method, includes the following steps:
S1: setting grid cell simultaneously sets grid operator, defines the grid operator formula are as follows:
In formula, E (v) is grid operator, and V represents a vertex in the grid cell, PvFor entering for grid cell vertex V
Degree, PvjIt is the j-th vertex V adjacent with vertex VjIn-degree, be that adjacent with vertex V vertex is all defeated in the grid cell
Enter the average length on side；
S2: original three-dimensional model is read, and traverses the grid cell；
S3: setting and simplify threshold value, and the simplified threshold definitions are the mean value of the grid operator on each vertex of the grid cell；
S4: model simplification operation traverses the grid cell, by the grid operator of each grid cell and institute again
Simplified threshold value comparison is stated, judges whether the grid operator meets simplified condition, the qualified grid cell is carried out
It deletes.
Archetype is divided by grid cell using having the beneficial effect that for the above method, grid operator and letter
Change threshold value and be compared while deleting qualified grid cell, the simplified model of generation can effectively retain original mould
The characteristic of type local detail feature as much as possible for retaining original three-dimensional model while reducing model data amount.
Preferably, further include following steps in the step S4:
S41: when the grid operator is less than or equal to the simplified threshold value, delete processing is carried out to the grid cell；
S42: the hole region generated after deleting the grid cell add a new summit and with the original three-dimensional model
Carry out Space Reconstruction；
S43: output is through treated model.
Selectively grid cell is deleted based on grid operator using having the beneficial effect that for the above method, when
Grid operator indicates that grid distribution is more smooth, characteristic is weaker when lower, delete the grid on the aspect of model influence compared with
It is small, therefore retain the higher grid cell of grid operator, delete lesser grid cell.
Preferably, the average length on the input side is defined as:
Wherein,It is j-th vertex adjacent with vertex VIn-degree,It is adjacent with the vertex V in model meshes unit
VertexThe average length on all input sides, LjFor the total length on the input side.
Preferably, in the step S4, when the grid operator be greater than the simplified threshold value when, to the grid operator into
Row weighting processing, and the grid cell is traversed again.
Preferably, the range of the weighting coefficient is (0,1).Weighting coefficient has simplified time efficiency and simplified degree
Important influence, the degree that the bigger three-dimensional space model of coefficient is simplified is bigger, otherwise the smaller model simplification of energy threshold coefficient
Degree is smaller.
Preferably, the grid cell can also be curved face unit, simplification steps all at this time and all steps above-mentioned
It is consistent.
It can be seen via above technical scheme that the invention discloses a kind of efficient Spatial three-dimensional dispersion model meshes reconstruct sides
Method can generate the relatively low approximate model of precision to replace archetype, while reducing grid cell quantity
Retain archetype local detail feature, effectively alleviate the contradiction between complex scene and model Real-time rendering requirements, is three
Dimension space mockup and application provide support.
Detailed description of the invention
In order to more clearly explain the embodiment of the invention or the technical proposal in the existing technology, to embodiment or will show below
There is attached drawing needed in technical description to be briefly described, it should be apparent that, the accompanying drawings in the following description is only this
The embodiment of invention for those of ordinary skill in the art without creative efforts, can also basis
The attached drawing of offer obtains other attached drawings.
Fig. 1 attached drawing is a kind of flow chart of efficient Spatial three-dimensional dispersion model meshes reconstructing method of the present invention；
Fig. 2 attached drawing is a kind of application effect figure of efficient Spatial three-dimensional dispersion model meshes reconstructing method embodiment 2 of the present invention；
Fig. 3 attached drawing is the application effect figure that scheme is compared in the embodiment of the present invention 2；
Fig. 4 attached drawing is two methods execution efficiency comparison diagram in the embodiment of the present invention 2.
Specific embodiment
Following will be combined with the drawings in the embodiments of the present invention, and technical solution in the embodiment of the present invention carries out clear, complete
Site preparation description, it is clear that described embodiments are only a part of the embodiments of the present invention, instead of all the embodiments.It is based on
Embodiment in the present invention, it is obtained by those of ordinary skill in the art without making creative efforts every other
Embodiment shall fall within the protection scope of the present invention.
Embodiment 1
Referring to figure 1, the embodiment of the present invention 1 provides a kind of efficient Spatial three-dimensional dispersion model meshes reconstructing method, packet
Include following steps:
S1: setting grid cell simultaneously sets grid operator, defines the grid operator formula are as follows:
In formula, E (v) is grid operator, and V represents a vertex in the grid cell, PvFor entering for grid cell vertex V
Degree, the item number for the adjacent side being connected with a vertex is the in-degree of a point, PvjIt is the j-th vertex V adjacent with vertex Vj
In-degree,For vertex V adjacent with vertex V in the grid celljThe average length on all input sides；
S2: original three-dimensional model is read, and traverses the grid cell；
S3: setting and simplify threshold value, and the simplified threshold definitions are the mean value of the grid operator on each vertex of the grid cell；
S4: model simplification operation traverses the grid cell, by the grid operator of each grid cell and institute again
Simplified threshold value comparison is stated, judges whether the grid operator meets simplified condition, the qualified grid cell is carried out
It deletes.
Specifically, constructing grid cell based on half of data structure in the step S2, half of data structure is that entity is several
In what Modeling Technology, the most common data structure of solid object surface model is constructed；When carrying out simplifying operation to grid cell, use
Half of data structure building model will significantly improve model ergod and search efficiency.
In a specific embodiment, further include following steps in the step S4:
S41: when the grid operator is less than or equal to the simplified threshold value, delete processing is carried out to the grid cell；
S42: the hole region generated after deleting the grid cell add a new summit and with the original three-dimensional model
Carry out Space Reconstruction；
S43: output is through treated model.
Specifically, the new summit and archetype vertex reconstruction attractor topological relation, and opened up to being rebuild in step S42
The half of data structure for flutterring the geometric element of relationship carries out perfect, recalculates the grid operator of respective vertices and grid cell.
In a specific embodiment, the average length on the input side is defined as:
Wherein,It is j-th vertex adjacent with vertex VIn-degree,It is adjacent with the vertex V in model meshes unit
VertexThe average length on all input sides, LjFor the total length on the input side.
Specifically, vertexIt can be single order consecutive points.
In a specific embodiment, right when the grid operator is greater than the simplified threshold value in the step S4
The grid operator is weighted processing, and traverses the grid cell again.
In a specific embodiment, the range of the weighting coefficient is (0,1).
Specifically, the value of weighting coefficient can be any of 0.2,0.5 and 0.8.
In a specific embodiment, the grid cell can also be curved face unit.
Embodiment 2
Propose the validity and high efficiency of simplified method herein to further verify, by method provided by the invention and
The QEM Mesh simplification algorithm that OpenMesh is realized compares and analyzes, which is that CPU is Intel
(R) Core (TM) i7-4700U CPU 3.40GHZ, inside saves as the PC machine of 16G, and the instance data used is Stanford
The dragon model of University Computer Graphics Laboratory includes 47800 nets under original state altogether
Lattice unit simplifies result as shown in table 1-1.
1.1 Model Simplification Algorithm of table executes time statistical form
Referring to shown in attached drawing 2-4, it can be seen that two kinds of simplified Algorithm Demo effects are approximate, can keep important office well
Portion's minutia, but the mentioned algorithm of this paper can be seen that with higher time efficiency by time efficiency comparative analysis.
Each embodiment in this specification is described in a progressive manner, the highlights of each of the examples are with other
The difference of embodiment, the same or similar parts in each embodiment may refer to each other.For device disclosed in embodiment
For, since it is corresponded to the methods disclosed in the examples, so being described relatively simple, related place is said referring to method part
It is bright.
The foregoing description of the disclosed embodiments enables those skilled in the art to implement or use the present invention.
Various modifications to these embodiments will be readily apparent to those skilled in the art, as defined herein
General Principle can be realized in other embodiments without departing from the spirit or scope of the present invention.Therefore, of the invention
It is not intended to be limited to the embodiments shown herein, and is to fit to and the principles and novel features disclosed herein phase one
The widest scope of cause.
Claims (5)
1. a kind of efficient Spatial three-dimensional dispersion model meshes reconstructing method, which comprises the steps of:
S1: setting grid cell simultaneously sets grid operator, defines the grid operator formula are as follows:
In formula, E (v) is grid operator, and vertex V represents a vertex in the grid cell, PvFor grid cell vertex V's
In-degree, PvIt is the j-th vertex V adjacent with the vertex VjIn-degree,For top adjacent with vertex V in the grid cell
PointThe average length on all input sides；
S2: original three-dimensional model is read, and traverses the grid cell；
S3: setting and simplify threshold value, and the simplified threshold definitions are the mean value of the grid operator on each vertex of the grid cell；
S4: model simplification operation traverses the grid cell, by the grid operator of each grid cell and institute again
Simplified threshold value comparison is stated, judges whether the grid operator meets simplified condition, the qualified grid cell is carried out
It deletes.
2. a kind of efficient Spatial three-dimensional dispersion model meshes reconstructing method according to claim 1, which is characterized in that described
Further include following steps in step S4:
S41: when the grid operator is less than or equal to the simplified threshold value, delete processing is carried out to the grid cell；
S42: the hole region generated after deleting the grid cell add a new summit and with the original three-dimensional model
Carry out Space Reconstruction；
S43: output is through treated model.
3. a kind of efficient Spatial three-dimensional dispersion model meshes reconstructing method according to claim 1, which is characterized in that described
Input the average length on side is defined as:
Wherein, PvjIt is the j-th vertex V adjacent with vertex VjIn-degree,It is adjacent with the vertex V in model meshes unit
Vertex VjThe average length on all input sides, LjFor the total length on the input side.
4. a kind of efficient Spatial three-dimensional dispersion model meshes reconstructing method according to claim 1-3, feature
It is, in the step S4, when the grid operator is greater than the simplified threshold value, place is weighted to the grid operator
Reason, and the grid cell is traversed again.
5. a kind of efficient Spatial three-dimensional dispersion model meshes reconstructing method according to claim 4, which is characterized in that described
The range of weighting coefficient is (0,1).
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910272220.2A CN109961515A (en) | 2019-04-04 | 2019-04-04 | A kind of efficient Spatial three-dimensional dispersion model meshes reconstructing method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910272220.2A CN109961515A (en) | 2019-04-04 | 2019-04-04 | A kind of efficient Spatial three-dimensional dispersion model meshes reconstructing method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109961515A true CN109961515A (en) | 2019-07-02 |
Family
ID=67025799
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910272220.2A Pending CN109961515A (en) | 2019-04-04 | 2019-04-04 | A kind of efficient Spatial three-dimensional dispersion model meshes reconstructing method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109961515A (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107527384A (en) * | 2017-07-14 | 2017-12-29 | 中山大学 | A kind of lattice simplified method of Three-Dimensional Dynamic based on motion feature and its system |
| CN108961411A (en) * | 2018-07-02 | 2018-12-07 | 南京大学 | A kind of simplified method of the complex three-dimensional building model keeping external appearance characteristic |
-
2019
- 2019-04-04 CN CN201910272220.2A patent/CN109961515A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107527384A (en) * | 2017-07-14 | 2017-12-29 | 中山大学 | A kind of lattice simplified method of Three-Dimensional Dynamic based on motion feature and its system |
| CN108961411A (en) * | 2018-07-02 | 2018-12-07 | 南京大学 | A kind of simplified method of the complex three-dimensional building model keeping external appearance characteristic |
Non-Patent Citations (1)
| Title |
|---|
| YONGZHI WANG等: "fast mesh simplification method for three-dimensional geometric models with feature-preserving efficiency", 《SCIENTIFIC PROGRAMMING》 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Lindstrom et al. | Terrain simplification simplified: A general framework for view-dependent out-of-core visualization | |
| Baert et al. | Out-of-core construction of sparse voxel octrees | |
| CN109147048A (en) | A kind of three-dimensional grid method for reconstructing using individual cromogram | |
| CN100570641C (en) | Plant leaf analogy method based on physics | |
| Ma et al. | Dynamic element textures | |
| WO2001008263A2 (en) | Method and apparatus for generating atomic parts of graphic representation through skeletonization for interactive visualization applications | |
| CN103530030B (en) | Page switching system and method and curtain special-effect page switching method | |
| Gribble et al. | Coherent ray tracing via stream filtering | |
| Wald et al. | Simd ray stream tracing-simd ray traversal with generalized ray packets and on-the-fly re-ordering | |
| CN103035030A (en) | Hair model modeling method | |
| CN109745704A (en) | A kind of management method of voxel landform | |
| CN101169871A (en) | HLOD pretreatment method facing to large scale static scene real-time rendering | |
| Viitanen et al. | MergeTree: A fast hardware HLBVH constructor for animated ray tracing | |
| Chang et al. | A new solid subdivision scheme based on box splines | |
| Ota et al. | 1/f/sup/spl beta//noise-based real-time animation of trees swaying in wind fields | |
| Dey et al. | Procedural feature generation for volumetric terrains using voxel grammars | |
| CN109961515A (en) | A kind of efficient Spatial three-dimensional dispersion model meshes reconstructing method | |
| Crawfis | Real-time slicing of data space | |
| Upchurch et al. | Dynamic cloud simulation using cellular automata and texture splatting | |
| Yang et al. | Physically-based tree animation and leaf deformation using CUDA in real-time | |
| Schmalstieg | The remote rendering pipeline-managing geometry and bandwidth in distributed virtual environments | |
| Wang et al. | Isosurface extraction and view-dependent filtering from time-varying fields using persistent time-octree (PTOT) | |
| Shao | Fluids, threads and fibers: towards high performance physics-based modeling and simulation | |
| Vrolijk et al. | Interactive out-of-core isosurface visualisation in time-varying data sets | |
| Wu et al. | Physically based animation of broad-leaf plant |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20190702 |
|
| RJ01 | Rejection of invention patent application after publication |