CN114140569B - Three-dimensional scene serialization compression method - Google Patents
Three-dimensional scene serialization compression method Download PDFInfo
- Publication number
- CN114140569B CN114140569B CN202210096970.0A CN202210096970A CN114140569B CN 114140569 B CN114140569 B CN 114140569B CN 202210096970 A CN202210096970 A CN 202210096970A CN 114140569 B CN114140569 B CN 114140569B
- Authority
- CN
- China
- Prior art keywords
- data
- compression
- vertex
- dimensional scene
- embedded
- 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
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T15/00—3D [Three Dimensional] image rendering
- G06T15/04—Texture mapping
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
- G06T9/00—Image coding
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Computer Graphics (AREA)
- Multimedia (AREA)
- Processing Or Creating Images (AREA)
Abstract
The invention discloses a three-dimensional scene serialization compression method, which belongs to the field of data compression processing and comprises the steps of serializing a three-dimensional scene into three-dimensional scene data in a json format, separating vertex data from chartlet data, respectively compressing the vertex data and the chartlet data, and only keeping one copy of repeated data when the compressed chartlet data are packed. The invention can effectively reduce the memory occupation amount and optimize the three-dimensional scene display effect.
Description
Technical Field
The invention relates to the field of data compression processing, in particular to a three-dimensional scene serialization compression method.
Background
A rendering engine based on the WebGL standard generally serializes a three-dimensional scene into a json format, and the data amount of vertex data and map data is large, which results in a large amount of occupied space. The vertex data is typically serialized into a json array, and a floating point number will occupy 8-10 bytes. The map data is typically serialized as a string encoded in base64, the length of the encoded data being approximately four times three times the length of the original data. In particular, for the map data, generally, hundreds of model pictures exist in a scene, and the memory occupation of the accumulated pictures is large. In addition, for some serialization formats, repeated map data is stored repeatedly, further affecting the space efficiency of storage.
In the prior art, the three-dimensional model format of the gltf is converted, the occupied space is smaller than that of the three-dimensional scene format, key data required by three-dimensional scenes such as animation data and the like are lacked, and the three-dimensional scene display effect is poor. The existing application numbers are: 201911095810.9 discloses a three-dimensional model data compression method and system, which can improve the compression efficiency, but the compression process is complex and the compression effect is not ideal.
In view of the above, it is necessary to provide a new technical solution to solve the above problems.
Disclosure of Invention
In order to solve at least one technical problem, the application provides a three-dimensional scene serialization compression method which can effectively reduce the memory occupation amount and optimize the three-dimensional scene display effect.
A three-dimensional scene serialization compression method comprises the following steps:
serializing the three-dimensional scene into three-dimensional scene data in a json format;
creating a tar tool program write stream, and outputting the data of the tar tool program write stream to a compressed stream;
writing a version number identification file into a tar tool program;
searching all vertex data in the three-dimensional scene data, moving the vertex data to a tar tool program or a draco compression tool for storage, and placing mark data at the original vertex data position;
traversing the texture of the material, and searching embedded chartlet data in a base64 format in the three-dimensional scene data;
the embedded map data is decoded in base64 and is moved to a map data buffer area for storage;
calculating a hash value of the embedded chartlet data in the chartlet data buffer area, and judging whether a corresponding file of the embedded chartlet data exists in the tar tool program or not according to the hash value;
storing the embedded chartlet data without the corresponding file in the tar tool program into the tar tool program, otherwise releasing the corresponding embedded chartlet data in the chartlet data buffer area;
placing a map data placeholder in an original position of the in-line map data;
and storing the vertex data and the three-dimensional scene data except the map data into the tar tool program, finishing the compression operation of the tar tool program, and collecting data output by a compression stream.
Preferably, the creation of a tar tool program write stream, and the output of the tar tool program write stream are output to a compression stream, and the compression algorithm used in the compression stream includes a gzip compression algorithm or a bzip2 compression algorithm or an xz compression algorithm.
Preferably, the searching for the vertex data in the three-dimensional scene data, moving the vertex data to a tar tool program or a draco compression tool for storage, and the placing of the mark data at the original vertex data position includes:
searching all vertex data in the three-dimensional scene data;
judging whether a user configures a draco compression tool;
if the user configures the draco compression tool, initializing a counter with a value of 0, initializing a compression parameter of the draco compression tool, and instantiating a compression instance of the draco compression tool; compressing vertex data by using a draco compression tool, increasing the value of a counter by taking the step length as 1, writing the compressed data into the value of a dracoMesh/counter, removing the vertex data in the three-dimensional scene data, and placing a draco mark and the value of the counter in situ;
if the user does not configure the draco compression tool, a vertex data buffer area is created; taking out the vertex data, screening the vertex data into different data types, and then putting the data types into a vertex data buffer area; calculating a hash value of the vertex data; and judging whether a file corresponding to the vertex data exists in the tar tool program or not according to the hash value, storing the vertex data which does not have the corresponding file in the tar tool program into the tar tool program, releasing the vertex data buffer area, and placing a vertex data placeholder in the original position of the vertex data.
Preferably, the length of the vertex data buffer area is consistent with that of the vertex data; the vertex data buffer type is adapted to the vertex data storage type.
Preferably, the data types include 16-bit shaped data, 32-bit shaped data and 32-bit floating point data.
Preferably, the vertex data is taken out, screened into different data types, and then placed into the vertex data buffer area, and the screening of the different data types includes:
traversing vertex data;
and (3) performing storage type screening on vertex data:
non-integer data in the vertex data is regarded as 32-bit floating point data, data not less than 65535 in the vertex data is regarded as 32-bit shaping data, and other types of data are regarded as 16-bit shaping data.
Preferably, the 32-bit shaped data and the 16-bit shaped data are unsigned shaped data.
Preferably, the writing of the version number identification file into the tar tool program includes metadata/version, and the value of the version number identification file is 2.
Preferably, the calculating a hash value of the embedded map data in the map data buffer area, and determining whether the tar tool program has a corresponding file of the embedded map data according to the hash value specifically includes:
judging whether a user configures a compression tool supporting a compression mapping data format;
if a compression tool supporting a compressed mapping data format is not configured, calculating and obtaining a hash value of the embedded mapping data by using an SHA-256 hash value algorithm with the embedded mapping data as a parameter;
if a compression tool supporting a compressed mapping data format is configured, the embedded mapping data in the mapping data buffer area is compressed by the compression tool, the data lengths before and after compression are compared, the embedded mapping data with small data length is reserved, the embedded mapping data with large data length is released, the embedded mapping data with small data length is used for calculation, and the hash value of the embedded mapping data is calculated and obtained by using an SHA-256 hash value algorithm and the embedded mapping data with small data length as a parameter.
Preferably, the map data placeholder is placed in the original position of the in-map data, and the map data placeholder comprises a map type and a hash value.
Compared with the prior art, the application has at least the following beneficial effects:
the method can compress the three-dimensional scene, uses a relatively universal tar compression tool packaging format, is easy to analyze and adapt, can efficiently store the compressed mapping data, only one copy of repeated mapping data is reserved by calculating a hash value before storage, reduces the storage space occupied by the three-dimensional scene, only separates vertex data and mapping data which have low compression ratio and occupy large memory, and has high integrity of the compressed three-dimensional scene data.
Drawings
Some specific embodiments of the invention will be described in detail hereinafter, by way of illustration and not limitation, with reference to the accompanying drawings. The same reference numbers in the drawings identify the same or similar elements or components. Those skilled in the art will appreciate that the drawings are not necessarily drawn to scale. In the drawings:
FIG. 1 is a schematic overall flow chart of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present application more apparent, the technical solutions of the present application will be described in detail and completely with reference to the following specific embodiments of the present application and the accompanying drawings. It should be apparent that the described embodiments are only some of the embodiments of the present application, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
As shown in fig. 1, a three-dimensional scene serialization compression method includes the following steps:
and step S1, serializing the three-dimensional scene into three-dimensional scene data in json format.
And step S2, creating a tar tool program write stream, and outputting the data of the tar tool program write stream to the compression stream.
Specifically, the gzip compression algorithm or bzip2 compression algorithm or xz compression algorithm may be selected according to the compression algorithm in the user configuration, and if the user does not pre-configure the compression algorithm, the gzip compression algorithm is selected by default. The user configuration and execution policy cases are shown in table 1.
TABLE 1 user configuration and execution policy scenarios
The user profile in the preferred embodiment of the present invention is shown in table 2.
Table 2 user configuration table of the preferred embodiment of the present invention
And step S3, writing the version number identification file into the tar tool program.
The version number identification file comprises metadata/version, the value of the version number identification file is 2, and the version number identification file is used for being downward compatible when a subsequent format is changed or expanded.
And step S4, searching all vertex data in the three-dimensional scene data, moving the vertex data to a tar tool program or a draco compression tool for storage, and placing mark data at the original vertex data position.
Specifically, the method comprises the following steps:
and step S41, judging whether the user configures the draco compression tool, if the user configures the draco compression tool, initializing a counter with the value of 0, and initializing a draco compression parameter. If the user has not configured the draco compression tool, this step is skipped.
Specifically, if the draco compression tool is configured, a counter is initialized, the value of the counter is 0, a draco compression parameter is initialized, the compression speed is 3, and compression data including a POSITION parameter, a NORMAL parameter, a COLOR parameter, a TEX _ COORD parameter, and a GENERIC parameter are set.
And step S42, searching all vertex data in the three-dimensional scene data.
The vertex data type and the corresponding identifier thereof are shown in table 3:
TABLE 3 vertex data types and their corresponding identification tables
Step S43, if the user configures the parameters of the draco compression tool, using the draco compression tool to compress the vertex data, increasing the value of the counter in the step S41 by taking the step length as 1, writing the compressed data into the value of the draco mesh/counter, removing the vertex data in the original three-dimensional scene data, writing the compressed data into the compressed data, and placing the value of the draco mark and the counter in the original position.
Specifically, the step of compressing the vertex data by using the draco compression tool comprises the following steps:
and step S431, instantiating the draco mesh based on the compression parameters of the initialized draco compression tool.
Step S432, calculating the number of faces included in the vertex data, the formula of which is:
the number of faces = number of vertex indices/3 in this vertex data.
Step S433, the vertex index data is converted into a 32-bit unsigned integer array, and added to the draco mesh as a face.
And step S434, converting the vertex normal line, the vertex position and the UV coordinate into a 32-bit floating point number array, and adding the 32-bit floating point number array to the draco mesh according to the corresponding draco type.
The corresponding relationship between the vertex data type, the identifier and the corresponding draco type is shown in table 4.
Table 4 is a table of correspondence between vertex data types, identifiers, and corresponding draco types
Step S435, calling draco api for compression, and analyzing the output data to a vertex data buffer area.
And step S436, releasing the draco mesh data reference.
If the parameters of the draco compression tool are not configured, the vertex data of each part is taken out, and the storage type of the part is determined according to the content of the vertex data. The storage types include 16-bit shaping data, 32-bit shaping data and 32-bit floating point data. Creating a vertex data buffer area with the length consistent with the length of the part of the vertex data and the type suitable for the storage type, putting the vertex data into the vertex data buffer area, and calculating the hash value of the vertex data by using an SHA-256 hash value algorithm. And judging whether a file corresponding to the vertex data exists in the tar tool program or not according to the hash value, storing the vertex data which does not have the corresponding file in the tar tool program into the tar tool program, releasing the vertex data buffer area, and placing a vertex data placeholder in the original position of the vertex data. And if the file corresponding to the hash value exists in the tar tool program, directly releasing the vertex data buffer.
Preferably, the vertex data buffer is in the form of a binary buffer.
Preferably, the vertex data is traversed, a numerical range is screened, and the storage type is determined according to the numerical range, specifically as follows:
if non-integers exist, the floating point data is regarded as 32-bit floating point data;
if there is a value > =65535, consider 32 bits of shaped data;
the rest cases are taken as 16-bit shaping data;
here, the shaping data is unsigned shaping data.
Here, the present example configures the compression parameters of the draco compression tool, so the relevant step of configuring the parameters of the draco compression tool by the user in step S43 is executed.
Otherwise, if there is other vertex data, go to step S42 until the vertex data compression is completed.
Preferably, if the user configures the compression parameters of the draco compression tool, the resource can be recycled by releasing the draco compression instance instantiated in the above step, cancelling the reference.
And S5, traversing the texture, and searching embedded map data in a base64 format in the three-dimensional scene data.
Step S6, base64 decoding is carried out on the embedded map data, and the embedded map data are moved to a map data buffer area for storage;
preferably, the map data buffer is in the form of a binary buffer.
And step S7, calculating the hash value of the embedded map data in the map data buffer area, and judging whether the tar tool program has the corresponding file of the embedded map data according to the hash value.
The method specifically comprises the following steps:
step S71, calculating the hash value of the embedded map data in the map data buffer area by using SHA-256 hash value algorithm.
And step S72, judging whether the user configures mozjpeg compression tool, pngquant compression tool and zopflipping compression tool, wherein the compression tool supports the format of the compressed map data.
If the compression tool supporting the compressed mapping data format is not configured, the embedded mapping data is used as a parameter, and the SHA-256 hash value algorithm is used for calculating and obtaining the hash value of the embedded mapping data.
If the compression tool supporting the compressed mapping data format is configured, the embedded mapping data in the mapping data buffer area is compressed by the compression tool, the data lengths before and after compression are compared, the embedded mapping data with small data length is reserved, the embedded mapping data with large data length is released, the embedded mapping data with small data length is used for calculation, and the hash value of the embedded mapping data is calculated and obtained by using the SHA-256 hash value algorithm and the embedded mapping data with small data length as a parameter.
The picture content in the Base64 format is determined to be in the png format or the jpg format according to the data, img/field, for example:
data:image/png;base64,iVBORw0KGgoAAA
data:image/jpeg;base64,/9j/4AAQSkZJRgABA
in the preferred embodiment of the invention, no mozjpeg compression tool, pngquant compression tool or zopflwing compression tool is configured, so that the embedded chartlet data is adopted as a parameter, and the hash value of the embedded chartlet data is calculated and obtained by using the SHA-256 hash value algorithm.
And step S8, storing the embedded map data of the corresponding file which does not exist in the tar tool program into the tar tool program, otherwise, releasing the corresponding embedded map data in the map data buffer area.
Step S9, placing the map data placeholder in the original position of the embedded map data.
Preferably, the map data placeholder includes a map type and a hash value.
And step S10, storing the three-dimensional scene data except the vertex data and the map data into the tar tool program, finishing the compression operation of the tar tool program, and collecting data output by a compressed stream.
It is noted that the terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of example embodiments according to the present application. As used herein, the singular is intended to include the plural unless the context clearly dictates otherwise, and it should be further understood that the terms "comprises" and/or "comprising," when used in this specification, specify the presence of features, steps, operations, devices, components, and/or combinations thereof.
It should be noted that the terms "first," "second," and the like in the description and claims of this application and in the drawings described above are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used is interchangeable under appropriate circumstances such that the embodiments of the application described herein are capable of operation in sequences other than those illustrated or described herein.
The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention, and various modifications and changes may be made by those skilled in the art. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
Claims (10)
1. A three-dimensional scene serialization compression method is characterized by comprising the following steps:
serializing the three-dimensional scene into three-dimensional scene data in a json format;
creating a tar tool program write stream, and outputting the data of the tar tool program write stream to a compressed stream;
writing a version number identification file into a tar tool program;
searching all vertex data in the three-dimensional scene data, moving the vertex data to a tar tool program or a draco compression tool for storage, and placing mark data at the original vertex data position;
traversing the texture of the material, and searching embedded chartlet data in a base64 format in the three-dimensional scene data;
the embedded map data is decoded in base64 and is moved to a map data buffer area for storage;
calculating a hash value of the embedded chartlet data in the chartlet data buffer area, and judging whether a corresponding file of the embedded chartlet data exists in the tar tool program or not according to the hash value;
storing the embedded chartlet data without the corresponding file in the tar tool program into the tar tool program, otherwise releasing the corresponding embedded chartlet data in the chartlet data buffer area;
placing a map data placeholder in an original position of the in-line map data;
and storing the vertex data and the three-dimensional scene data except the map data into the tar tool program, finishing the compression operation of the tar tool program, and collecting data output by a compression stream.
2. The three-dimensional scene serialization compression method of claim 1, wherein said creating a tar tool program write stream, outputting the data output by the tar tool program write stream into a compression stream, and the compression algorithm used in the compression stream comprises gzip compression algorithm or bzip2 compression algorithm or xz compression algorithm.
3. The three-dimensional scene serialization compression method of claim 1, wherein said searching all vertex data in the three-dimensional scene data, moving the vertex data to a tar tool program or a draco compression tool for storage, and placing the mark data at the original vertex data position comprises:
judging whether a user configures a draco compression tool;
searching all vertex data in the three-dimensional scene data;
if the user configures the draco compression tool, initializing a counter with a value of 0, initializing a compression parameter of the draco compression tool, and instantiating a compression instance of the draco compression tool; compressing vertex data by using a draco compression tool, increasing the value of a counter by taking the step length as 1, writing the compressed data into the value of a dracoMesh/counter, removing the vertex data in the three-dimensional scene data, and placing a draco mark and the value of the counter in situ;
if the user does not configure the draco compression tool, a vertex data buffer area is created; taking out the vertex data, screening the vertex data into different data types, and then putting the data types into a vertex data buffer area; calculating a hash value of the vertex data; and judging whether a file corresponding to the vertex data exists in the tar tool program or not according to the hash value, storing the vertex data which does not have the corresponding file in the tar tool program into the tar tool program, releasing the vertex data buffer area, and placing a vertex data placeholder in the original position of the vertex data.
4. The three-dimensional scene serialization compression method of claim 3, wherein said vertex data buffer length is consistent with vertex data length; the vertex data buffer type is adapted to the vertex data storage type.
5. The method of claim 3, wherein the data types include 16-bit reshaped data, 32-bit reshaped data, and 32-bit floating point data.
6. The three-dimensional scene serialization compression method of claim 5, wherein said extracting vertex data, screening into different data types, and then placing into a vertex data buffer, the screening of different data types comprising:
traversing vertex data;
and (3) performing storage type screening on vertex data:
non-integer data in the vertex data is regarded as 32-bit floating point data, data not less than 65535 in the vertex data is regarded as 32-bit shaping data, and other types of data are regarded as 16-bit shaping data.
7. The three-dimensional scene serialization compression method of claim 5 or 6, wherein said 32-bit reshaping data and 16-bit reshaping data are unsigned reshaping data.
8. The three-dimensional scene serialization compression method of claim 1, wherein said writing of the version number identification file into the tar tool program, the version number identification file includes metadata/version, and the value of the version is 2.
9. The method as claimed in claim 1, wherein the calculating the hash value of the embedded map data in the map data buffer area, and determining whether the tar tool program has a corresponding file of the embedded map data according to the hash value comprises:
judging whether a user configures a compression tool supporting a compression mapping data format;
if a compression tool supporting a compressed mapping data format is not configured, calculating and obtaining a hash value of the embedded mapping data by using an SHA-256 hash value algorithm with the embedded mapping data as a parameter;
if a compression tool supporting a compressed mapping data format is configured, the embedded mapping data in the mapping data buffer area is compressed by the compression tool, the data lengths before and after compression are compared, the embedded mapping data with small data length is reserved, the embedded mapping data with large data length is released, the embedded mapping data with small data length is used for calculation, and the hash value of the embedded mapping data is calculated and obtained by using an SHA-256 hash value algorithm and the embedded mapping data with small data length as a parameter.
10. The method of claim 1, wherein the placement of the map data placeholder in the original location of the embedded map data, the map data placeholder comprising the map type and the hash value.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210096970.0A CN114140569B (en) | 2022-01-27 | 2022-01-27 | Three-dimensional scene serialization compression method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210096970.0A CN114140569B (en) | 2022-01-27 | 2022-01-27 | Three-dimensional scene serialization compression method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114140569A CN114140569A (en) | 2022-03-04 |
| CN114140569B true CN114140569B (en) | 2022-04-26 |
Family
ID=80381592
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210096970.0A Active CN114140569B (en) | 2022-01-27 | 2022-01-27 | Three-dimensional scene serialization compression method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114140569B (en) |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110841293A (en) * | 2019-10-30 | 2020-02-28 | 珠海西山居移动游戏科技有限公司 | Method and system for automatically and dynamically outputting game map with appropriate fitness |
Family Cites Families (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| GB2387094B (en) * | 2002-03-26 | 2005-12-07 | Imagination Tech Ltd | 3-D Computer graphics rendering system |
| US7643032B2 (en) * | 2004-11-02 | 2010-01-05 | Microsoft Corporation | Texture-based packing, such as for packing 8-bit pixels into two bits |
| US8325177B2 (en) * | 2008-12-29 | 2012-12-04 | Microsoft Corporation | Leveraging graphics processors to optimize rendering 2-D objects |
| CN105160705B (en) * | 2015-09-10 | 2018-02-23 | 李晓强 | A kind of processing method based on d engine to mobile terminal 3 d image data |
| CN108537891A (en) * | 2017-03-01 | 2018-09-14 | 黎志毅 | The method that three-dimensional material and textures data are automatically switched to UE4 |
| EP3419286A1 (en) * | 2017-06-23 | 2018-12-26 | Koninklijke Philips N.V. | Processing of 3d image information based on texture maps and meshes |
| CN110570518A (en) * | 2019-09-02 | 2019-12-13 | 紫光云技术有限公司 | Mass model loading method based on high compression of model data |
| CN112785696A (en) * | 2021-02-06 | 2021-05-11 | 招商局重庆交通科研设计院有限公司 | Three-dimensional live-action model generation method based on game engine and oblique photography data |
| CN113345063B (en) * | 2021-08-05 | 2021-10-29 | 南京万生华态科技有限公司 | PBR three-dimensional reconstruction method, system and computer storage medium based on deep learning |
-
2022
- 2022-01-27 CN CN202210096970.0A patent/CN114140569B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110841293A (en) * | 2019-10-30 | 2020-02-28 | 珠海西山居移动游戏科技有限公司 | Method and system for automatically and dynamically outputting game map with appropriate fitness |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114140569A (en) | 2022-03-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103488709B (en) | A kind of index establishing method and system, search method and system | |
| US20080080778A1 (en) | Image data compression method and apparatuses, image display method and apparatuses | |
| CN105096367B (en) | Optimize the method and device of Canvas rendering performances | |
| CN113568995B (en) | Dynamic tile map manufacturing method and tile map system based on search conditions | |
| US11210821B2 (en) | Graphics processing systems | |
| CN107301194A (en) | The compression storage of tile type grating map and dissemination method | |
| CN112165331A (en) | Data compression method and device, data decompression method and device, storage medium and electronic equipment | |
| CN110008192A (en) | A kind of data file compression method, apparatus, equipment and readable storage medium storing program for executing | |
| CN104410424B (en) | The fast and lossless compression method of embedded device internal storage data | |
| CN104427341A (en) | Image processing method and apparatus, and terminal | |
| CN105302915A (en) | High-performance data processing system based on memory calculation | |
| CN105719321A (en) | Texture compression method and device | |
| CN114140569B (en) | Three-dimensional scene serialization compression method | |
| CN105099460B (en) | Dictionary compression method, dictionary decompression method and dictionary constructing method | |
| CN112843700A (en) | Terrain image generation method and device, computer equipment and storage medium | |
| CN108416425A (en) | A kind of convolution method and device | |
| CN114491914A (en) | Model simplifying method and device, terminal device and readable storage medium | |
| CN115718726A (en) | Lightweight and encrypted storage method for BIM model data | |
| CN116386819A (en) | Data processing method, storage medium and equipment | |
| CN114998699A (en) | Distortion recovery method and device for compressed point cloud and electronic equipment | |
| CN108829872A (en) | Immediate processing method, equipment, system and the storage medium of lossless compression file | |
| CN111951352A (en) | Bitmap-based freehand drawing material generation method | |
| CN112817526A (en) | Data storage method, device and medium | |
| CN111209615A (en) | Building management and control-oriented BIM scene lightweight method | |
| CN109271463A (en) | A method of restoring the innodb compressed data of MySQL database |
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 |