CN110287351A - A kind of threedimensional model lightweight displaying optimization method - Google Patents
A kind of threedimensional model lightweight displaying optimization method Download PDFInfo
- Publication number
- CN110287351A CN110287351A CN201910564986.8A CN201910564986A CN110287351A CN 110287351 A CN110287351 A CN 110287351A CN 201910564986 A CN201910564986 A CN 201910564986A CN 110287351 A CN110287351 A CN 110287351A
- Authority
- CN
- China
- Prior art keywords
- file
- threedimensional model
- identification code
- optimization method
- data base
- 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
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/50—Information retrieval; Database structures therefor; File system structures therefor of still image data
- G06F16/54—Browsing; Visualisation therefor
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/957—Browsing optimisation, e.g. caching or content distillation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/958—Organisation or management of web site content, e.g. publishing, maintaining pages or automatic linking
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Databases & Information Systems (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Processing Or Creating Images (AREA)
Abstract
The present invention provides a kind of threedimensional model lightweight displaying optimization method, belong to threedimensional model display technique field, the threedimensional model lightweight shows that optimization method includes: the first file according to three-dimension modeling based on the threedimensional model, and first file storage has the information of the threedimensional model；According to the first file generated first list file；According to corresponding second identification code of the first list file generated；It shows that end obtains second identification code and judges whether store second identification code in the first local data base: being to call second identification code from first local data base, first file is obtained according to second identification code；It is no, the first list file is obtained, according to the first file described in the first list file acquisition；First file is handled, the information of the threedimensional model is obtained；The displaying of threedimensional model is shown according to the information realization of the threedimensional model.
Description
Technical field
The present invention relates to the lightweight display technique fields of threedimensional model, and in particular to a kind of threedimensional model lightweight displaying
Optimization method.
Background technique
With the development of network technology and computer technology, the three-dimensional visualization technique based on Web has also been obtained quickly
Development, and have a wide range of applications.
But often data are big for threedimensional model, transmission time is long, is unfavorable for the displaying of the end Wed.
Summary of the invention
Problems solved by the invention is that the end Wed three-dimensional modeling data is big, and transmission time is long, is unfavorable for asking for the end Wed displaying
Topic.
The present invention provides a kind of threedimensional model lightweight displaying optimization method, includes the following steps: to be built according to threedimensional model
Be based on the first file of the threedimensional model, and first file storage has the information of the threedimensional model；
According to the first file generated first list file；
According to corresponding second identification code of the first list file generated；
Show that end obtains second identification code and judges whether store second identification in the first local data base
Code: being that second identification code is called from first local data base, obtains described first according to second identification code
File；It is no, the first list file is obtained, according to the first file described in the first list file acquisition；
First file is handled, the information of the threedimensional model is obtained；
According to the displaying of threedimensional model described in the information realization of the threedimensional model.
Therefore, when the displaying end needs to show the threedimensional model, first by described in second identification code judgement
Show end whether have existed the threedimensional model, avoid transmission duplicate file caused by transmission time it is long, influence described three
The displaying of dimension module, high reliablity are practical.
Optionally, described to include: according to the first file generated first list Files step
According to corresponding first identification code of first file generated；
The first list file is generated according to first identification code.
Therefore, when the displaying end obtains the first list file, so that it may obtain first identification code
Information list then can judge whether store described first in first local data base according to first identification code
File, avoid show end described in the first file repeat there are the case where.
Optionally, first Files step according to the first list file acquisition includes:
According to the first identification code described in the first list file acquisition；And judge in first local data base whether
It stores first identification code: being, from the first file described in the described first local data base call；It is no, obtain described first
File.
Therefore, for first file present in first local data base, call directly, avoid from
The generation end or server download first file, reduce the threedimensional model at the displaying end and realize displaying needs
The data volume of processing improves processing speed, practical.
Optionally, acquisition first Files step includes:
Judge whether first file belongs to standard component: being, download first file, first file is added
To first local data base；It is no, download first file.
Therefore, during the displaying end obtains first file, by corresponding first file of standard component
It is added to first local data base, so that the standard component is saved, facilitates subsequent lookup and calling, is avoided every time
All from end or the server downloading standard component is generated, processing speed is improved, it is practical.
Optionally, first file according to three-dimension modeling based on the threedimensional model, the first file storage
The information Step for having the threedimensional model includes:
The components of the threedimensional model are carried out subtracting surface treatment；
The geometric data of the components after subtracting surface treatment described in acquisition；
The geometric data is handled, geometric data compressed file is generated.
Therefore, subtract surface treatment by described the part vertex of the components is merged, reduce the components
Geometric data, and generate the geometric data compressed file, reduce size of data, improve treatment effeciency, high reliablity.
The surface treatment step that subtracts includes:
The triangular apex data for obtaining the components generate the set of adjacent vertex group to any vertex；
Calculate the cost value cost (u, v) that the vertex is incorporated into adjacent vertex；
Adjacent vertex group to be combined is determined according to the cost value cost (u, v)；
The adjacent vertex group to be combined is merged.
Therefore, by calculating the cost value, it can judge that the adjacent vertex group merges by comparing intuitive data
It is influenced caused by the spare part profile, and determines the adjacent vertex group to be combined, high reliablity is practical.
It is optionally, described that adjacent vertex group to be combined is determined according to the cost value cost (u, v) are as follows:
When the cost value cost (u, v) is less than preset threshold, the adjacent vertex group is determined as described to be combined
Adjacent vertex group.
Therefore, the cost value cost (u, v) is less than to the adjacent vertex group (u, v) of preset threshold, it can be to described
While the geometric data of components is reduced, moreover it is possible to guarantee that influence is in certain limit caused by the spare part profile
Interior, high reliablity is practical.
It is optionally, described that adjacent vertex group to be combined is determined according to the cost value cost (u, v) are as follows:
According to the size of the cost value cost (u, v), the adjacent vertex group to be combined is successively carried out from small to large
It determines.
Therefore, according to the size of the cost value cost (u, v), the adjacent vertex to be combined is successively carried out from small to large
The determination of group, so that influencing profiles of the determination of the adjacent vertex group to be combined described each time to the threedimensional model or components
All be it is the smallest, the determination on the vertex to be combined is reasonable, high reliablity.
Optionally, the surface treatment step that subtracts further includes before classification processing step:
Judge whether the components belong to standard component: no, execution subtracts surface treatment step；It is to judge the second local data
The geometric data compressed file of the components whether is stored in library: being, is transferred from second local data base
The geometric data compressed file；It is no, subtract surface treatment described in execution.
Therefore, when generation end handles the threedimensional model, portion is reduced by second local data base
The treatment process for dividing the standard component, improves processing speed.
Optionally, first file further include:
Material object indexing compressed file is suitable for storing material object and material in the threedimensional model and indexes corresponding relationship
Information；
Material index data compressed file, suitable for storing the information of the components and material index corresponding relationship；
Spatial position data compressed file, suitable for storing space bit confidence of the components in the threedimensional model
Breath.
Therefore, first file includes the geometric data compressed file, the material compressed file and the space
Position data compressed file, the displaying end include the geometric data compressed file, the material according to first file
The information of compressed file and the spatial position data compressed file can be realized the complete displaying of the threedimensional model, validity
It is high.
Detailed description of the invention
Fig. 1 is the process that threedimensional model lightweight of the present invention shows optimization method one of which embodiment.
Specific embodiment
To make the above purposes, features and advantages of the invention more obvious and understandable, with reference to the accompanying drawing to the present invention
Specific embodiment be described in detail.
A kind of threedimensional model lightweight displaying optimization method, includes the following steps:
S1: the first file according to three-dimension modeling based on the threedimensional model, first file storage have described
The information of threedimensional model；
S2: according to the first file generated first list file；
S3: according to corresponding second identification code of the first list file generated；
S4: show that end obtains second identification code and judges that whether storing described second in the first local data base knows
Other code: being, second identification code is called from first local data base, obtains described the according to second identification code
One file；It is no, the first list file is obtained, according to the first file described in the first list file acquisition；
S5: first file is handled, the information of the threedimensional model is obtained；
S6: according to the displaying of threedimensional model described in the information realization of the threedimensional model.
It should be understood that in step s 4, the second identification code main function is to judge the described first local number
It whether there is the threedimensional model according to library, second identification code is corresponding with first file, the first database storage
There is second identification code, that is, represents and store the first list file, that is, represents and store first file.
When obtaining the first list file every time, it is added to first local data base.
Specifically, in some embodiments, described that the three-dimensional mould is based on according to three-dimension modeling in the step S1
First file of type, the information Step that first file storage has the threedimensional model include:
The components of the threedimensional model are carried out subtracting surface treatment；
The geometric data of the components after subtracting surface treatment described in acquisition；
The geometric data is handled, geometric data compressed file is generated.
Specifically, the components execution to the threedimensional model subtracts surface treatment, merge small on spare part profile influence
Adjacent vertex, the size of the components can be reduced within certain limits, caused very without to the spare part profile
Big influence.
It should be understood that first file includes the geometric data compressed file, the geometric data includes zero
Triangular apex coordinate information, triangular apex index information, triangulation method vector information and UV information of component etc., it is described
Being handled the geometric data of the components also may include some operations reduced to the geometric data.
Therefore, subtract surface treatment by described the part vertex of the components is merged, reduce the components
Geometric data, and generate the geometric data compressed file, reduce size of data, improve treatment effeciency, high reliablity.
It should be understood that in the present embodiment, each the described components corresponding one geometric data compression text
Part.
In the above-described embodiments, the surface treatment step that subtracts includes:
The triangular apex data for obtaining the components generate the set of adjacent vertex group to any vertex；
Calculate the cost value cost (u, v) that the vertex is incorporated into adjacent vertex；
Adjacent vertex group to be combined is determined according to the cost value cost (u, v)；
The adjacent vertex group to be combined is merged.
Specifically, cost value cost (u, the v) calculation formula are as follows:
Wherein, Tu is the set of the triangle comprising vertex u, and Tuv is the set of the triangle comprising vertex u and vertex v；
The cost value cost (u, v) is smaller, and the vertex u is incorporated into vertex v influence caused by the spare part profile
It is smaller；
The same components to determining vertex u1, and may include more containing multiple vertex u1, u2, u3 ... un
A adjacent vertex v1, v2, v3 ... vn, for determining set of vertices (u1, v1), Tu1 is the set of the triangle comprising vertex u1,
Tu1v1 be include simultaneously vertex u1 and vertex v 1 triangle set, pass through the calculation formula of the cost value cost (u, v)
The cost that vertex u1 is incorporated into vertex v 1 is calculated in traversal, i.e., vertex u1 is incorporated into vertex v 1 to the spare part profile
Influence.
Therefore, by calculating the cost value, it can judge that the adjacent vertex group merges by comparing intuitive data
It is influenced caused by the spare part profile, high reliablity is practical.
It should be understood that cost value is the maximum value after traversal calculates for determining set of vertices (u1, v1).
Specifically, in some embodiments, it is described that adjacent vertex group to be combined is determined according to the cost value cost (u, v)
Are as follows:
When the cost value cost (u, v) is less than preset threshold, the adjacent vertex group is determined as described to be combined
Adjacent vertex group.
It should be understood that in the present embodiment, can be for entire threedimensional model, can also be for single zero
Part.
Therefore, the cost value cost (u, v) is less than to the adjacent vertex group (u, v) of preset threshold, it can be to described
While the geometric data of components is reduced, moreover it is possible to guarantee that influence is in certain limit caused by the spare part profile
Interior, high reliablity is practical.
Specifically, in further embodiments, according to the size of the cost value cost (u, v), from small to large successively into
The determination of the row adjacent vertex group to be combined.
Specifically, with the merging of the adjacent vertex group to be combined, memory shared by the threedimensional model or components
It can change；According to the size of the cost value cost (u, v), from small to large by the adjacent vertex group be determined as it is described to
Merge adjacent vertex group, until the memory that the components occupy meets the first default memory value；In further embodiments, root
According to the sequence of the cost value cost (u, v) from small to large, successively the adjacent vertex group is determined as described to be combined adjacent
Set of vertices, until the memory that the components occupy meets the second default memory value.
Specifically, in some embodiments, the described first default memory value is artificial specified, in further embodiments,
The first default memory value determines according to a certain percentage according to the initial size of entire threedimensional model.In some embodiments,
According to the components initial memory value, the proportion in the threedimensional model determines the second default memory value.
Therefore, according to the size of the cost value cost (u, v), the adjacent vertex to be combined is successively carried out from small to large
The determination of group, so that influencing profiles of the determination of the adjacent vertex group to be combined described each time to the threedimensional model or components
All be it is the smallest, the determination on the vertex to be combined is reasonable, high reliablity.
In the above-described embodiments, the surface treatment step that subtracts further includes before classification processing step:
Judge whether the components belong to standard component: no, execution subtracts surface treatment step；It is to judge the second local data
The geometric data compressed file of the components whether is stored in library: being, is transferred from second local data base
The geometric data compressed file；It is no, subtract surface treatment described in execution.
It should be understood that second local data base is the standard part database for generating end.
Therefore, when generation end handles the threedimensional model, portion is reduced by second local data base
The treatment process for dividing the standard component, improves processing speed.
In the above-described embodiments, it when judging that the components belong to standard component, and is not stored in the second local data base
When having the geometric data compressed file of the components, execution subtracts surface treatment, and by the institute for subtracting and generating after surface treatment
It states geometric data compressed file and is added to second local data base, in this way, the standard component in second local data base
It is continuously increased, the processing time of standard component can be greatly reduced in subsequent processing.
Specifically, first file further include:
Material object indexing compressed file is suitable for storing material object and material in the threedimensional model and indexes corresponding relationship
Information；
Material index data compressed file, suitable for storing the information of the components and material index corresponding relationship；
Spatial position data compressed file, suitable for storing space bit confidence of the components in the threedimensional model
Breath.
Therefore, first file includes the geometric data compressed file, the material compressed file and the space
Position data compressed file, the displaying end include the geometric data compressed file, the material according to first file
The information of compressed file and the spatial position data compressed file can be realized the complete displaying of the threedimensional model, validity
It is high.
In step s 5, first file is handled, obtains the information of the threedimensional model；Including to described several
What compressed data file, the material object indexing compressed file, the material index data compressed file and space bit
It sets compressed data file to unzip it, obtains the information of the threedimensional model.
Include the following steps: specifically, generating the material index data compressed file
The material object of each threedimensional model is obtained, and deletes duplicate material object；
It obtains and whether there is third local data base: being the information for obtaining the third local data base；It is no, create institute
State third local data base；
To every kind of material object, judges the material index for whether having corresponding in the third local data base: being, from
The correspondence relationship information that the third local data base calls the material object and material to index；It is no, it generates and the material
The correspondence relationship information of the material object and material index is added to the third sheet by the corresponding material object indexing of object
Ground database, and record the correspondence relationship information of the material object and material index；
The correspondence relationship information indexed to the material object of all records with material is handled, and generates the material
It verifies as index compression file；
Specifically, all material objects are obtained, and delete duplicate material object, are avoided subsequent because processing repeats material
The waste of time caused by object.
The material object includes: colouring information, material type information (such as metal-like), polishing degree information, Alpha
Channel information, base color value, environment light, specular light, self-luminous, spontaneous luminous intensity, luminous intensity, opacity, basic textures,
Bump Mapping, line width, the coefficient of roughness, metallic luster coefficient, two-sided rendering etc..
Corresponding relationship in the third local data base comprising material object and material index, it is local to create the third
Database ensures that the material index of all processed material objects is unique.
Therefore, the material object is not only simplified, and can ensure all material object ropes of processed threedimensional model
Draw and be recorded and be contained in the third local data base, the material object of all threedimensional models shares third local number
According to library, it is ensured that the index of material object is unique.
It should be understood that in the above-described embodiments, material object indexing can not also be individually recorded, directly by described
Json file is written in material object indexing in three local data bases, generates the material index data compressed file.It grasps in this way
Make it is simpler, but be only suitable for the third local data base memory value it is lesser when use.
Specifically, in the present embodiment, the generation material index data compressed file includes:
The corresponding material index information of each components is obtained, and is handled, the material index data is generated
Compressed file.
Therefore, material object indexing and the corresponding material index information of the components are generated into file respectively, reduced
The size of material file, and ensure that by the third local data base uniqueness of material object indexing, high reliablity.
Specifically, in the above-described embodiments, described according to the first file generated first list text in the step S2
Part step includes:
S201: according to corresponding first identification code of first file generated；
S202: the first list file is generated according to first identification code.
Specifically, first identification code and second identification code are unique MD5 code, first text can be verified
The integrality and uniqueness of part；The first list file is generated according to first identification code, it should be appreciated that described the
One listing file stores the information list of first identification code.
Therefore, when the displaying end obtains the first list file, so that it may obtain first identification code
Information list then can judge whether store described first in first local data base according to first identification code
File, avoid show end described in the first file repeat there are the case where.
Specifically, in the present embodiment, in the step S4, first text according to the first list file acquisition
Part step includes the following steps:
According to the first identification code described in the first list file acquisition；And judge in first local data base whether
It stores first identification code: being, from the first file described in the described first local data base call；It is no, obtain described first
File.
Specifically, it should be understood that there are first identification codes in first local data base, then it represents that described
There is first file corresponding with first identification code in first local data base.
Therefore, for first file present in first local data base, call directly, avoid from
The generation end or server download first file, reduce the threedimensional model at the displaying end and realize displaying needs
The data volume of processing improves processing speed, practical.
In the present embodiment, obtaining first Files step includes:
Judge whether first file belongs to standard component: being, download first file, first file is added
To first local data base；It is no, download first file.
It should be understood that judging whether first file belongs to standard component: being to judge first file storage
Whether information belongs to the information of standard component, can be judged by the file name of first file, can also be by artificially referring to
It is fixed.
Therefore, during the displaying end obtains first file, by corresponding first file of standard component
It is added to first local data base, so that the standard component is saved, facilitates subsequent lookup and calling, is avoided every time
All from end or the server downloading standard component is generated, processing speed is improved, it is practical.
It should be understood that the standard component in first local data base is increasing with the accumulation of time, it may
Can because caused by memory is excessive usage experience decline, at this moment, the part standard component can be deleted according to frequency is transferred, described in reduction
The burden of first local data base.
Specifically, on the basis of the above embodiments, further include establishing neural network model, pass through the neural network mould
Subtract adjacent vertex group to be combined described in the step of face described in type prediction.
Specifically, the neural network model includes input layer, hidden layer and output layer, wherein input layer is the phase
The coordinate data of adjacent vertices group (u, v)；Output layer is the coordinate data of the adjacent vertex group to be combined.
The training neural model includes the following steps:
Data mark is carried out, by the coordinate data of the adjacent vertex group (u, v) of the components in csv file,
The coordinate data of the adjacent vertex group to be combined is marked simultaneously.
The data marked are split with the test data of 70% training data and 30%；
Neural network is constructed, it is the full connection of four layers of 256 neuron in hidden layer that input layer, which is that mark set is done on vertex,
Layer, using logistic regression algorithm, fits most suitable parameter model.Wherein hyper parameter is set as learning rate 0.01, activates letter
Number uses Relu function, and loss function uses cross entropy.
Trained model is tested with test data, guarantees that accuracy rate reaches 95% or more.
Trained model is saved, to predict the following vertex for needing to reduce.
Therefore, it by the training neural network model, realizes adjacent vertex group to be combined described in automatic Prediction, can operate
Property it is high, it is practical.
Threedimensional model lightweight of the present invention shows optimization method, and the displaying end needs to show the threedimensional model
When, judge whether the displaying end has existed the threedimensional model by second identification code first, avoids transmission weight
Transmission time caused by multiple file is long, influences the displaying of the threedimensional model, high reliablity is practical.
Although the disclosure discloses as above, the protection scope of the disclosure is not limited only to this.Those skilled in the art, not
Under the premise of being detached from spirit and scope of the present disclosure, it can make various changes and modify, these changes will fall into this with modification
The protection scope of invention.
Claims (10)
1. a kind of threedimensional model lightweight shows optimization method, which comprises the steps of:
The first file according to three-dimension modeling based on the threedimensional model, first file storage have the threedimensional model
Information；
According to the first file generated first list file；
According to corresponding second identification code of the first list file generated；
Show that end obtains second identification code and judges whether store second identification code in the first local data base:
It is to call second identification code from first local data base, first text is obtained according to second identification code
Part；It is no, the first list file is obtained, according to the first file described in the first list file acquisition；
First file is handled, the information of the threedimensional model is obtained；
According to the displaying of threedimensional model described in the information realization of the threedimensional model.
2. threedimensional model lightweight as described in claim 1 shows optimization method, which is characterized in that described according to described first
File generated first list Files step includes:
According to corresponding first identification code of first file generated；
The first list file is generated according to first identification code.
3. threedimensional model lightweight as claimed in claim 2 shows optimization method, which is characterized in that described according to described first
Listing file obtains first Files step
According to the first identification code described in the first list file acquisition；And judge whether store in first local data base
First identification code: being, from the first file described in the described first local data base call；It is no, obtain first file.
4. threedimensional model lightweight as claimed in claim 3 shows optimization method, which is characterized in that described to obtain described first
Files step includes:
Judge whether first file belongs to standard component: being, downloads first file, first file is added to institute
State the first local data base；It is no, download first file.
5. threedimensional model lightweight as described in claim 1 shows optimization method, which is characterized in that described according to threedimensional model
The first file based on the threedimensional model is established, the information Step that first file storage has the threedimensional model includes:
The components of the threedimensional model are carried out subtracting surface treatment；
The geometric data of the components after subtracting surface treatment described in acquisition；
The geometric data is handled, geometric data compressed file is generated.
6. threedimensional model lightweight as claimed in claim 5 shows optimization method, which is characterized in that described to subtract surface treatment step
Include:
The triangular apex data for obtaining the components generate the set of adjacent vertex group to any vertex；
Calculate the cost value cost (u, v) that the vertex is incorporated into adjacent vertex；
Adjacent vertex group to be combined is determined according to the cost value cost (u, v)；
The adjacent vertex group to be combined is merged.
7. threedimensional model lightweight as claimed in claim 6 shows optimization method, which is characterized in that described according to the cost
Value cost (u, v) determines adjacent vertex group to be combined are as follows:
When the cost value cost (u, v) is less than preset threshold, the adjacent vertex group is determined as described to be combined adjacent
Set of vertices.
8. threedimensional model lightweight as claimed in claim 6 shows optimization method, which is characterized in that described according to the cost
Value cost (u, v) determines adjacent vertex group to be combined are as follows:
According to the size of the cost value cost (u, v), the determination of the adjacent vertex group to be combined is successively carried out from small to large.
9. threedimensional model lightweight as claimed in claim 5 shows optimization method, which is characterized in that described to subtract surface treatment step
Before further include classification processing step:
Judge whether the components belong to standard component: no, execution subtracts surface treatment step；It is to judge in the second local data base
Whether store the geometric data compressed file of the components: being, is transferred from second local data base described
Geometric data compressed file；It is no, subtract surface treatment described in execution.
10. threedimensional model lightweight as claimed in claim 5 shows optimization method, which is characterized in that first file is also
Include:
Material object indexing compressed file, suitable for storing the letter of material object and material index corresponding relationship in the threedimensional model
Breath；
Material index data compressed file, suitable for storing the information of the components and material index corresponding relationship；
Spatial position data compressed file, suitable for storing spatial positional information of the components in the threedimensional model.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910564986.8A CN110287351B (en) | 2019-06-27 | 2019-06-27 | Three-dimensional model lightweight display optimization method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910564986.8A CN110287351B (en) | 2019-06-27 | 2019-06-27 | Three-dimensional model lightweight display optimization method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110287351A true CN110287351A (en) | 2019-09-27 |
| CN110287351B CN110287351B (en) | 2021-11-02 |
Family
ID=68007694
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910564986.8A Active CN110287351B (en) | 2019-06-27 | 2019-06-27 | Three-dimensional model lightweight display optimization method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110287351B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112652070A (en) * | 2020-12-21 | 2021-04-13 | 深圳市彬讯科技有限公司 | Three-dimensional model surface reduction method, device, equipment and medium |
| CN114022616A (en) * | 2021-11-16 | 2022-02-08 | 北京城市网邻信息技术有限公司 | Model processing method and device, electronic device and storage medium |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102063534A (en) * | 2010-12-27 | 2011-05-18 | 北京中冶设备研究设计总院有限公司 | High furnace overhaul project schedule three-dimensional simulation device and method |
| CN103714577A (en) * | 2014-01-23 | 2014-04-09 | 焦点科技股份有限公司 | Three-dimensional model simplification method suitable for model with textures |
| JP2016212335A (en) * | 2015-05-13 | 2016-12-15 | 賢三 伊達 | Exhibit, and frame |
| CN107292068A (en) * | 2017-08-21 | 2017-10-24 | 上海中建东孚投资发展有限公司 | A kind of assembled architecture BIM model treatments method and processing system |
| CN107895401A (en) * | 2017-11-23 | 2018-04-10 | 塔普翊海（上海）智能科技有限公司 | The data reduction system and its method for simplifying of threedimensional model and application |
| CN108230439A (en) * | 2017-12-28 | 2018-06-29 | 苏州慧筑信息科技有限公司 | One kind is used for web terminal three-dimensional model lightweight method, electronic equipment and storage medium |
-
2019
- 2019-06-27 CN CN201910564986.8A patent/CN110287351B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102063534A (en) * | 2010-12-27 | 2011-05-18 | 北京中冶设备研究设计总院有限公司 | High furnace overhaul project schedule three-dimensional simulation device and method |
| CN103714577A (en) * | 2014-01-23 | 2014-04-09 | 焦点科技股份有限公司 | Three-dimensional model simplification method suitable for model with textures |
| JP2016212335A (en) * | 2015-05-13 | 2016-12-15 | 賢三 伊達 | Exhibit, and frame |
| CN107292068A (en) * | 2017-08-21 | 2017-10-24 | 上海中建东孚投资发展有限公司 | A kind of assembled architecture BIM model treatments method and processing system |
| CN107895401A (en) * | 2017-11-23 | 2018-04-10 | 塔普翊海（上海）智能科技有限公司 | The data reduction system and its method for simplifying of threedimensional model and application |
| CN108230439A (en) * | 2017-12-28 | 2018-06-29 | 苏州慧筑信息科技有限公司 | One kind is used for web terminal three-dimensional model lightweight method, electronic equipment and storage medium |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112652070A (en) * | 2020-12-21 | 2021-04-13 | 深圳市彬讯科技有限公司 | Three-dimensional model surface reduction method, device, equipment and medium |
| CN112652070B (en) * | 2020-12-21 | 2023-01-13 | 深圳市彬讯科技有限公司 | Three-dimensional model surface reduction method, device, equipment and medium |
| CN114022616A (en) * | 2021-11-16 | 2022-02-08 | 北京城市网邻信息技术有限公司 | Model processing method and device, electronic device and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110287351B (en) | 2021-11-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11270497B2 (en) | Object loading method and apparatus, storage medium, and electronic device | |
| CN110427434B (en) | Multidimensional data query method and device | |
| EP4120199A1 (en) | Image rendering method and apparatus, and electronic device and storage medium | |
| CN112755535B (en) | Illumination rendering method and device, storage medium and computer equipment | |
| CN110392902A (en) | Use the operation of sparse volume data | |
| AU2018226403B2 (en) | Brush stroke generation with deep neural networks | |
| US12019959B2 (en) | Distributed tensor network contraction scheme with splitting based on dynamic ordering | |
| CN110287351A (en) | A kind of threedimensional model lightweight displaying optimization method | |
| CN112148820B (en) | Underwater terrain data identification and service method and system based on deep learning | |
| CN112489213A (en) | Three-dimensional terrain model generation method and device, electronic equipment and storage medium | |
| CN116152460B (en) | Method, device, terminal and medium for generating rock stratum model based on UE4 | |
| CN110727836B (en) | Social network analysis system based on Spark GraphX and implementation method thereof | |
| CN116824092A (en) | Three-dimensional model generation method, three-dimensional model generation device, computer equipment and storage medium | |
| US8446425B1 (en) | Object transformation for object trees utilized with multiprocessor systems | |
| CN108520532B (en) | Method and device for identifying motion direction of object in video | |
| CN107016732A (en) | Positioned using the 3D objects of descriptor | |
| US9251548B1 (en) | Object transformation for object trees utilized with multiprocessor systems | |
| CN112883102A (en) | Data visualization display method and device, electronic equipment and storage medium | |
| CN115239746B (en) | Object-oriented remote sensing image segmentation method, device, equipment and medium | |
| Mateo et al. | Hierarchical, Dense and Dynamic 3D Reconstruction Based on VDB Data Structure for Robotic Manipulation Tasks | |
| Amiraghdam et al. | LOCALIS: Locally‐adaptive Line Simplification for GPU‐based Geographic Vector Data Visualization | |
| CN114913305B (en) | Model processing method, device, equipment, storage medium and computer program product | |
| CN114399002A (en) | Image scene classification method and device based on graph neural network | |
| CN110473272B (en) | Oil painting generation method and device based on image, electronic equipment and storage medium | |
| US10262021B2 (en) | Methods and systems for processing data using QR factorization |
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 | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20230725 Address after: 101318 152-7, Yutianxia Phase IV, Gangjie Street, Shunyi District, Beijing Patentee after: Yu Ming Address before: 075421 west side of Putao Avenue, Xindong Huayuan Town, Huailai County, Zhangjiakou City, Hebei Province Patentee before: HARBIN INSTITUTE OF TECHNOLOGY AT ZHANGJIAKOU |