CN110287351B - Three-dimensional model lightweight display optimization method - Google Patents
Three-dimensional model lightweight display optimization method Download PDFInfo
- Publication number
- CN110287351B CN110287351B CN201910564986.8A CN201910564986A CN110287351B CN 110287351 B CN110287351 B CN 110287351B CN 201910564986 A CN201910564986 A CN 201910564986A CN 110287351 B CN110287351 B CN 110287351B
- Authority
- CN
- China
- Prior art keywords
- file
- dimensional model
- identification code
- local database
- information
- 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
Images
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 invention provides a three-dimensional model lightweight display optimization method, which belongs to the technical field of three-dimensional model display and comprises the following steps: establishing a first file based on the three-dimensional model according to the three-dimensional model, wherein the information of the three-dimensional model is stored in the first file; generating a first list file according to the first file; generating a corresponding second identification code according to the first list file; the display terminal obtains the second identification code and judges whether the first local database stores the second identification code: if so, calling the second identification code from the first local database, and acquiring the first file according to the second identification code; if not, acquiring the first list file, and acquiring the first file according to the first list file; processing the first file to acquire information of the three-dimensional model; and realizing the display of the displayed three-dimensional model according to the information of the three-dimensional model.
Description
Technical Field
The invention relates to the technical field of lightweight display of three-dimensional models, in particular to a lightweight display optimization method of a three-dimensional model.
Background
With the development of network technology and computer technology, three-dimensional visualization technology based on Web has also been rapidly developed and widely applied.
However, the three-dimensional model is often large in data and long in transmission time, and is not favorable for display at the Wed end.
Disclosure of Invention
The invention solves the problems that the three-dimensional model of the Wed end has large data and long transmission time and is not beneficial to display of the Wed end.
The invention provides a three-dimensional model lightweight display optimization method, which comprises the following steps: establishing a first file based on the three-dimensional model according to the three-dimensional model, wherein the information of the three-dimensional model is stored in the first file;
generating a first list file according to the first file;
generating a corresponding second identification code according to the first list file;
the display terminal obtains the second identification code and judges whether the first local database stores the second identification code: if so, calling the second identification code from the first local database, and acquiring the first file according to the second identification code; if not, acquiring the first list file, and acquiring the first file according to the first list file;
processing the first file to acquire information of the three-dimensional model;
and displaying the three-dimensional model according to the information of the three-dimensional model.
Therefore, when the display end needs to display the three-dimensional model, whether the display end already has the three-dimensional model is judged through the second identification code, the phenomenon that the display of the three-dimensional model is influenced due to the fact that the transmission time is long when repeated files are transmitted is avoided, the reliability is high, and the practicability is high.
Optionally, the step of generating a first list file according to the first file includes:
generating a corresponding first identification code according to the first file;
and generating the first list file according to the first identification code.
Therefore, when the display terminal acquires the first list file, the information list of the first identification code can be acquired, and then whether the first file is stored in the first local database or not can be judged according to the first identification code, so that the situation that the first file exists repeatedly at the display terminal is avoided.
Optionally, the step of obtaining the first file according to the first list file includes:
acquiring the first identification code according to the first list file; and judging whether the first local database stores the first identification code: if yes, calling the first file from the first local database; and if not, acquiring the first file.
Therefore, the first file existing in the first local database can be directly called, the first file is prevented from being downloaded from the generating terminal or the server, the data volume of the three-dimensional model needing to be processed when the display terminal realizes display is reduced, the processing speed is improved, and the practicability is high.
Optionally, the step of acquiring the first file includes:
judging whether the first file belongs to a standard part: if yes, downloading the first file, and adding the first file to the first local database; and if not, downloading the first file.
Therefore, in the process of acquiring the first file by the display end, the first file corresponding to the standard component is added to the first local database, so that the standard component can be stored, subsequent searching and calling are facilitated, downloading of the standard component from a generating end or a server every time is avoided, the processing speed is increased, and the practicability is high.
Optionally, the creating a first file based on the three-dimensional model according to the three-dimensional model, where the information of the three-dimensional model is stored in the first file includes:
carrying out surface reduction treatment on the parts of the three-dimensional model;
acquiring geometric data of the part subjected to the surface reduction processing;
and processing the geometric data to generate a geometric data compression file.
Therefore, part of vertexes of the parts are combined through the face reduction processing, the geometric data of the parts are reduced, the geometric data compression file is generated, the data size is reduced, the processing efficiency is improved, and the reliability is high.
The step of reducing the surface comprises the following steps:
triangular vertex data of the parts are obtained, and a set of adjacent vertex groups is generated for any vertex;
calculating a cost value cost (u, v) for merging the vertex into an adjacent vertex;
determining an adjacent vertex group to be merged according to the cost value cost (u, v);
and merging the adjacent vertex groups to be merged.
Therefore, by calculating the cost value, the influence of the combination of the adjacent vertexes on the contour of the part can be judged through more visual data, and the adjacent vertex group to be combined is determined, so that the reliability is high, and the practicability is high.
Optionally, the determining, according to the cost value cost (u, v), an adjacent vertex group to be merged is:
and when the cost value cost (u, v) is smaller than a preset threshold value, determining the adjacent vertex group as the adjacent vertex group to be merged.
Therefore, the adjacent vertex group (u, v) with the cost value cost (u, v) smaller than the preset threshold value can reduce the geometric data of the part and ensure that the influence on the part outline is within a certain limit, and has high reliability and strong practicability.
Optionally, the determining, according to the cost value cost (u, v), an adjacent vertex group to be merged is:
and according to the size of the cost value cost (u, v), sequentially determining the adjacent vertex groups to be merged from small to large.
Therefore, the adjacent vertex groups to be merged are determined sequentially from small to large according to the cost value cost (u, v), so that the influence of each determination of the adjacent vertex groups to be merged on the contour of the three-dimensional model or the part is minimum, the vertices to be merged are determined reasonably, and the reliability is high.
Optionally, the step of reducing the area further comprises a step of classifying:
judging whether the parts belong to standard parts: if not, executing a face reduction processing step; if yes, judging whether the geometric data compression file of the part is stored in a second local database: if yes, calling the geometric data compressed file from the second local database; otherwise, executing the face reduction processing.
Therefore, when the three-dimensional model is processed at the generating end, the processing process of part of the standard parts is reduced through the second local database, and the processing speed is improved.
Optionally, the first file further includes:
the material object index compressed file is suitable for storing information of the corresponding relation between the material object and the material index in the three-dimensional model;
the material index data compression file is suitable for storing the information of the corresponding relation between the parts and the material index;
and the spatial position data compression file is suitable for storing the spatial position information of the parts in the three-dimensional model.
Therefore, the first file comprises the geometric data compressed file, the material compressed file and the spatial position data compressed file, the display end can realize the complete display of the three-dimensional model according to the information that the first file comprises the geometric data compressed file, the material compressed file and the spatial position data compressed file, and the third file is high in reality degree.
Drawings
Fig. 1 is a flow of one embodiment of the three-dimensional model lightweight display optimization method of the present invention.
Detailed Description
In order to make the aforementioned objects, features and advantages of the present invention comprehensible, embodiments accompanied with figures are described in detail below.
A three-dimensional model lightweight display optimization method comprises the following steps:
s1: establishing a first file based on the three-dimensional model according to the three-dimensional model, wherein the information of the three-dimensional model is stored in the first file;
s2: generating a first list file according to the first file;
s3: generating a corresponding second identification code according to the first list file;
s4: the display terminal obtains the second identification code and judges whether the first local database stores the second identification code: if so, calling the second identification code from the first local database, and acquiring the first file according to the second identification code; if not, acquiring the first list file, and acquiring the first file according to the first list file;
s5: processing the first file to acquire information of the three-dimensional model;
s6: and displaying the three-dimensional model according to the information of the three-dimensional model.
It should be understood that, in step S4, the second identification code mainly serves to determine whether the three-dimensional model exists in the first local database, the second identification code corresponds to the first file, and the first database stores the second identification code, i.e. represents that the first listed file is stored, i.e. represents that the first file is stored. And adding the first list file to the first local database every time the first list file is acquired.
Specifically, in some embodiments, in the step S1, the creating a first file based on the three-dimensional model according to the three-dimensional model, the first file storing information of the three-dimensional model includes:
carrying out surface reduction treatment on the parts of the three-dimensional model;
acquiring geometric data of the part subjected to the surface reduction processing;
and processing the geometric data to generate a geometric data compression file.
Specifically, by performing surface reduction processing on the part of the three-dimensional model and combining adjacent vertices that have a small influence on the part contour, the size of the part can be reduced within a certain limit without greatly affecting the part contour.
It should be understood that the first file includes the geometry data compression file, the geometry data includes triangle vertex coordinate information, triangle vertex index information, triangle normal vector information, UV information, and the like of the part, and the processing of the geometry data of the part may also include some operations of reducing the geometry data.
Therefore, part of vertexes of the parts are combined through the face reduction processing, the geometric data of the parts are reduced, the geometric data compression file is generated, the data size is reduced, the processing efficiency is improved, and the reliability is high.
It should be understood that, in the present embodiment, each of the parts corresponds to one of the geometry data compression files.
In the above embodiment, the step of reducing the surface includes:
triangular vertex data of the parts are obtained, and a set of adjacent vertex groups is generated for any vertex;
calculating a cost value cost (u, v) for merging the vertex into an adjacent vertex;
determining an adjacent vertex group to be merged according to the cost value cost (u, v);
and merging the adjacent vertex groups to be merged.
Specifically, the cost value cost (u, v) is calculated by the following formula:
wherein Tu is a set of triangles including vertex u, and Tuv is a set of triangles including vertex u and vertex v; the smaller the cost value cost (u, v), the smaller the influence on the part contour caused by merging the vertex u to the vertex v;
for the same part, the component comprises a plurality of vertices u1, u2, u3 … un, and for a determined vertex u1, which may further include a plurality of adjacent vertices v1, v2, v3 … vn, for a determined vertex group (u1, v1), Tu1 is a set of triangles including vertex u1, Tu1v1 is a set of triangles including both vertex u1 and vertex v1, and the cost of merging vertex u1 into vertex v1 is obtained through traversal calculation of a calculation formula of the cost value cost (u, v), that is, the influence of merging vertex u1 into vertex v1 on the contour of the part.
Therefore, by calculating the cost value, the influence of the combination of the adjacent vertexes and the contour of the part can be judged through more visual data, the reliability is high, and the practicability is high.
It will be appreciated that for the determined set of vertices (u1, v1), the cost value is the maximum value calculated by the traversal.
Specifically, in some embodiments, the determining, according to the cost value cost (u, v), that the adjacent vertex group to be merged is:
and when the cost value cost (u, v) is smaller than a preset threshold value, determining the adjacent vertex group as the adjacent vertex group to be merged.
It should be understood that in the present embodiment, the three-dimensional model may be the whole or a single component.
Therefore, the adjacent vertex group (u, v) with the cost value cost (u, v) smaller than the preset threshold value can reduce the geometric data of the part and ensure that the influence on the part outline is within a certain limit, and has high reliability and strong practicability.
Specifically, in other embodiments, the determination of the adjacent vertex groups to be merged is performed sequentially from small to large according to the size of the cost value cost (u, v).
Specifically, with the combination of the adjacent vertex groups to be combined, the memory occupied by the three-dimensional model or the part may change; determining the adjacent vertex group as the adjacent vertex group to be merged from small to large according to the size of the cost value cost (u, v) until the memory occupied by the part meets a first preset memory value; in other embodiments, according to the order from small to large of the cost values cost (u, v), the adjacent vertex groups are sequentially determined as the adjacent vertex groups to be merged until the memory occupied by the component satisfies a second preset memory value.
Specifically, in some embodiments, the first preset memory value is manually specified, and in other embodiments, the first preset memory value is determined according to a certain ratio according to an initial size of the entire three-dimensional model. In some embodiments, the second predetermined memory value is determined according to a ratio of the initial memory value of the component in the three-dimensional model.
Therefore, the adjacent vertex groups to be merged are determined sequentially from small to large according to the cost value cost (u, v), so that the influence of each determination of the adjacent vertex groups to be merged on the contour of the three-dimensional model or the part is minimum, the vertices to be merged are determined reasonably, and the reliability is high.
In the above embodiment, the step of reducing the area further includes a step of classifying:
judging whether the parts belong to standard parts: if not, executing a face reduction processing step; if yes, judging whether the geometric data compression file of the part is stored in a second local database: if yes, calling the geometric data compressed file from the second local database; otherwise, executing the face reduction processing.
It should be understood that the second local database is a standard component database of the generating end.
Therefore, when the three-dimensional model is processed at the generating end, the processing process of part of the standard parts is reduced through the second local database, and the processing speed is improved.
In the above embodiment, when it is determined that the component belongs to a standard component and the geometric data compressed file of the component is not stored in the second local database, a surface reduction process is performed, and the geometric data compressed file generated after the surface reduction process is added to the second local database, so that the standard component in the second local database is continuously increased, and the processing time of the standard component can be greatly reduced in subsequent processing.
Specifically, the first file further includes:
the material object index compressed file is suitable for storing information of the corresponding relation between the material object and the material index in the three-dimensional model;
the material index data compression file is suitable for storing the information of the corresponding relation between the parts and the material index;
and the spatial position data compression file is suitable for storing the spatial position information of the parts in the three-dimensional model.
Therefore, the first file comprises the geometric data compressed file, the material compressed file and the spatial position data compressed file, the display end can realize the complete display of the three-dimensional model according to the information that the first file comprises the geometric data compressed file, the material compressed file and the spatial position data compressed file, and the third file is high in reality degree.
In step S5, the first file is processed to obtain information of the three-dimensional model; decompressing the geometric data compressed file, the material object index compressed file, the material index data compressed file and the spatial position data compressed file to obtain the information of the three-dimensional model.
Specifically, the step of generating the texture index data compressed file includes the following steps:
acquiring a material object of each three-dimensional model, and deleting repeated material objects;
obtaining whether a third local database exists: if yes, acquiring information of the third local database; if not, creating the third local database;
for each material object, judging whether a material index corresponding to the material object exists in the third local database: if so, calling the corresponding relation information of the material object and the material index from the third local database; if not, generating a material object index corresponding to the material object, adding the corresponding relation information of the material object and the material index to the third local database, and recording the corresponding relation information of the material object and the material index;
processing the corresponding relation information of the material object and the material index of all records, and generating a material object index compressed file;
specifically, all material objects are acquired, and repeated material objects are deleted, so that time waste caused by processing repeated material objects in the follow-up process is avoided.
The material object includes: color information, material type information (such as metal texture), polishing degree information, alpha channel information, basic color value, ambient light, specular light, self-luminescence, self-luminous intensity, light intensity, opacity, basic chartlet, concave-convex chartlet, line width, roughness coefficient, metallic gloss coefficient, double-sided rendering, and the like.
And the third local database comprises the corresponding relation between the material object and the material index, and is established to ensure that the material indexes of all the processed material objects are unique.
Therefore, the material object is simplified, and the index of all the material objects of the processed three-dimensional model is ensured to be recorded and contained in the third local database, and the material objects of all the three-dimensional models share the third local database, so that the index of the material object is ensured to be unique.
It should be understood that, in the above embodiment, the texture object index in the third local database may also be directly written into the json file without separately recording the texture object index, so as to generate the texture index data compressed file. This is simpler to operate, but is only suitable for use when the memory value of the third local database is small.
Specifically, in this embodiment, the generating the texture index data compressed file includes:
and acquiring material index information corresponding to each part, processing the material index information and generating the material index data compression file.
Therefore, the material object index and the material index information corresponding to the parts are respectively generated into files, the size of the material file is reduced, the uniqueness of the material object index is ensured through the third local database, and the reliability is high.
Specifically, in the above embodiment, in the step S2, the step of generating the first list file according to the first file includes:
s201: generating a corresponding first identification code according to the first file;
s202: and generating the first list file according to the first identification code.
Specifically, the first identification code and the second identification code are unique MD5 codes, so that the integrity and uniqueness of the first file can be verified; the first list file is generated based on the first identification code, it being understood that the first list file stores a list of information of the first identification code.
Therefore, when the display terminal acquires the first list file, the information list of the first identification code can be acquired, and then whether the first file is stored in the first local database or not can be judged according to the first identification code, so that the situation that the first file exists repeatedly at the display terminal is avoided.
Specifically, in this embodiment, in the step S4, the step of acquiring the first file according to the first list file includes the following steps:
acquiring the first identification code according to the first list file; and judging whether the first local database stores the first identification code: if yes, calling the first file from the first local database; and if not, acquiring the first file.
Specifically, it should be understood that the existence of the first identification code in the first local database indicates that the first file corresponding to the first identification code exists in the first local database.
Therefore, the first file existing in the first local database can be directly called, the first file is prevented from being downloaded from the generating terminal or the server, the data volume of the three-dimensional model needing to be processed when the display terminal realizes display is reduced, the processing speed is improved, and the practicability is high.
In this embodiment, the step of acquiring the first file includes:
judging whether the first file belongs to a standard part: if yes, downloading the first file, and adding the first file to the first local database; and if not, downloading the first file.
It should be understood that determining whether the first file belongs to a standard: the information stored in the first file is the information for judging whether the information belongs to the standard component, and the information can be judged by the file name of the first file or can be specified manually.
Therefore, in the process of acquiring the first file by the display end, the first file corresponding to the standard component is added to the first local database, so that the standard component can be stored, subsequent searching and calling are facilitated, downloading of the standard component from a generating end or a server every time is avoided, the processing speed is increased, and the practicability is high.
It should be understood that, as time goes up, the standard components in the first local database are increased continuously, which may cause a reduction in the use experience due to an excessively large memory, and at this time, a part of the standard components may be deleted according to the calling frequency, so as to reduce the burden on the first local database.
Specifically, on the basis of the above embodiment, a neural network model is further established, and the group of adjacent vertices to be merged in the step of face reduction is predicted through the neural network model.
Specifically, the neural network model comprises an input layer, a hidden layer and an output layer, wherein the input layer is coordinate data of the adjacent vertex group (u, v); and the output layer is the coordinate data of the adjacent vertex groups to be merged.
Training the neural model comprises the following steps:
and carrying out data annotation, namely, enabling the coordinate data of the adjacent vertex groups (u, v) of the part to be in a CSV file, and simultaneously annotating the coordinate data of the adjacent vertex groups to be merged.
Segmenting the marked data by 70% of training data and 30% of test data;
and (3) constructing a neural network, wherein the input layer is a vertex marking set, the hidden layer is a full connection layer with four layers of 256 neurons, and a most appropriate parameter model is fitted by utilizing a logistic regression algorithm. The super parameter is set as the learning rate 0.01, the Relu function is adopted as the activation function, and the cross entropy is adopted as the loss function.
And testing the trained model by using test data to ensure that the accuracy rate reaches more than 95%.
And saving the trained model to predict the vertexes needing to be deducted in the future.
Therefore, the neural network model is trained to automatically predict the adjacent vertex groups to be merged, so that the method is high in operability and strong in practicability.
According to the light-weight display optimization method of the three-dimensional model, when the display end needs to display the three-dimensional model, whether the three-dimensional model exists at the display end is judged through the second identification code, the phenomenon that the display of the three-dimensional model is influenced by long transmission time caused by transmission of repeated files is avoided, and the light-weight display optimization method of the three-dimensional model is high in reliability and strong in practicability.
Although the present disclosure has been described above, the scope of the present disclosure is not limited thereto. Those skilled in the art can make various changes and modifications without departing from the spirit and scope of the present disclosure, and such changes and modifications will fall within the scope of the present invention.
Claims (9)
1. A three-dimensional model lightweight display optimization method is characterized by comprising the following steps:
establishing a first file based on a three-dimensional model according to the three-dimensional model, wherein the first file stores information of the three-dimensional model, and the first file comprises a geometric data compression file of a part based on the three-dimensional model and a spatial position data compression file storing spatial position information of the part in the three-dimensional model;
generating a corresponding first identification code according to the first file;
generating a first list file according to the first identification code;
generating a corresponding second identification code according to the first list file;
the display terminal obtains the second identification code and judges whether the first local database stores the second identification code: if so, calling the second identification code from the first local database, and acquiring the first file according to the second identification code; if not, acquiring the first list file, and acquiring the first file according to the first identification code in the first list file;
processing the first file to acquire information of the three-dimensional model;
and displaying the three-dimensional model according to the information of the three-dimensional model.
2. The method for optimizing the display of the three-dimensional model by reducing the weight of the three-dimensional model according to claim 1, wherein the step of obtaining the first file according to the first identification code in the first list file comprises:
acquiring the first identification code according to the first list file; and judging whether the first local database stores the first identification code: if yes, calling the first file from the first local database; and if not, acquiring the first file.
3. The three-dimensional model lightweight display optimization method according to claim 2, wherein the step of obtaining the first file comprises:
judging whether the first file belongs to a standard part: if yes, downloading the first file, and adding the first file to the first local database; and if not, downloading the first file.
4. The method for displaying and optimizing the lightweight of the three-dimensional model according to claim 1, wherein the step of establishing a first file based on the three-dimensional model according to the three-dimensional model, the first file storing information of the three-dimensional model comprises:
carrying out surface reduction processing on the parts of the three-dimensional model;
acquiring geometric data of the part subjected to the surface reduction processing;
and processing the geometric data to generate the geometric data compressed file.
5. The three-dimensional model lightweight display optimization method according to claim 4, wherein the surface reduction processing step includes:
triangular vertex data of the parts are obtained, and a set of adjacent vertex groups is generated for any vertex;
calculating a cost value cost (u, v) for merging the vertex into an adjacent vertex;
determining an adjacent vertex group to be merged according to the cost value cost (u, v);
and merging the adjacent vertex groups to be merged.
6. The optimization method for displaying the three-dimensional model through light weight according to claim 5, wherein the determining of the adjacent vertex groups to be merged according to the cost value cost (u, v) is as follows:
and when the cost value cost (u, v) is less than a preset threshold value, determining the adjacent vertex group as the adjacent vertex group to be merged.
7. The optimization method for displaying the three-dimensional model through light weight according to claim 5, wherein the determining of the adjacent vertex groups to be merged according to the cost value cost (u, v) is as follows:
and according to the size of the cost value cost (u, v), sequentially determining the adjacent vertex groups to be merged from small to large.
8. The three-dimensional model lightweight display optimization method according to claim 4, further comprising a classification processing step before the step of reducing the surface:
judging whether the parts belong to standard parts: if not, executing a face reduction processing step; if yes, judging whether the geometric data compression file of the part is stored in a second local database: if yes, calling the geometric data compressed file from the second local database; otherwise, executing the face reduction processing.
9. The three-dimensional model lightweight display optimization method according to claim 4, wherein the first file further comprises:
the material object index compressed file is suitable for storing information of the corresponding relation between the material object and the material index in the three-dimensional model;
and the material index data compression file is suitable for storing the information of the corresponding relation between the parts and the material index.
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 CN110287351A (en) | 2019-09-27 |
| CN110287351B true 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) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112652070B (en) * | 2020-12-21 | 2023-01-13 | 深圳市彬讯科技有限公司 | Three-dimensional model surface reduction method, device, equipment and medium |
| CN114022616B (en) * | 2021-11-16 | 2023-07-07 | 北京城市网邻信息技术有限公司 | Model processing method and device, electronic equipment 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 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110287351A (en) | 2019-09-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108171260B (en) | Picture identification method and system | |
| CN107784288B (en) | Iterative positioning type face detection method based on deep neural network | |
| EP4390881A1 (en) | Image generation method and related device | |
| CN112016546A (en) | Text region positioning method and device | |
| EP3675061A1 (en) | Forming a dataset for inference of editable feature trees | |
| CN110287351B (en) | Three-dimensional model lightweight display optimization method | |
| US20220156987A1 (en) | Adaptive convolutions in neural networks | |
| CN112101364B (en) | Semantic segmentation method based on parameter importance increment learning | |
| CN114066718A (en) | Image style migration method and device, storage medium and terminal | |
| CN110222710B (en) | Data processing method, device and storage medium | |
| CN112241565A (en) | Modeling method and related device | |
| CN117058271A (en) | Method and computing device for generating commodity main graph background | |
| CN115293332A (en) | Method, device and equipment for training graph neural network and storage medium | |
| Kim et al. | Generating 3D texture models of vessel pipes using 2D texture transferred by object recognition | |
| Mao et al. | A self-attention based wasserstein generative adversarial networks for single image inpainting | |
| CN112883102B (en) | Method and device for visual display of data, electronic equipment and storage medium | |
| CN115713585B (en) | Texture image reconstruction method, apparatus, computer device and storage medium | |
| CN112183303A (en) | Transformer equipment image classification method and device, computer equipment and medium | |
| CN110544166A (en) | Sample generation method, device and storage medium | |
| CN115239746A (en) | Object-oriented remote sensing image segmentation method, device, equipment and medium | |
| CN115205496A (en) | Digital twin model lightweight method and system | |
| CN113963011A (en) | Image recognition method and device, electronic equipment and storage medium | |
| CN113223102A (en) | Image obtaining method and device | |
| CN114913305B (en) | Model processing method, device, equipment, storage medium and computer program product | |
| KR102624934B1 (en) | Image super-resolution-based selective labeling device and method for improving the efficiency of deep learning model training |
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 |
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 |
|
| TR01 | Transfer of patent right |