Supercharge Your Innovation With Domain-Expert AI Agents!

Data compression method of vertex animation

A data compression and animation technology, applied in the field of data processing, can solve problems affecting performance and save disk space

Inactive Publication Date: 2014-02-26
ZHUHAI KINGSOFT ONLINE GAME TECH CO LTD +1
View PDF3 Cites 1 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

When loading and playing animation, it also consumes a lot of memory and a large number of file I / O operations, affecting performance

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Data compression method of vertex animation
  • Data compression method of vertex animation
  • Data compression method of vertex animation

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0017] The present invention provides a data compression method for vertex animation. By using this method, the duplicate data in the original animation data file can be eliminated, and the compressed data can be saved into a new file, thereby reducing the disk occupation of the file and reducing the memory occupation after the file is loaded. .

[0018] According to the present invention, the system first reads in a vertex animation file from the disk, and stores it in the memory according to a certain data organization format. Specifically, the file header of the stored animation file contains the number of animation frames and the number of vertices, while the file data contains the timestamp of each frame of animation and the displacement data of all vertices, such as figure 1 As shown, the animation has M vertices and N frames.

[0019] Then, the system traverses the data frame by frame, and compares the displacement data of adjacent animation frames of animation vertice...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention provides a data compression method of a vertex animation. The data compression method comprises the steps that firstly, an animation file is read from a disk and stored in an internal memory according to a specific data organization format, a file header of the stored animation file comprises the number of animation frames and the number of vertexes, and file data comprise the timestamp of each frame of animation and the displacement data of all the vertexes; then, the data are traversed frame by frame and comparative analysis is conducted on the displacement data of the animation frames, wherein if the displacement data of the adjacent animation frames of one vertex are the same, the repeated displacement data are deleted and only one frame of data is stored; at last, the compressed animation data are read into the disk again. For an animation file with a large number of vertexes, by means of the data compression method, the relatively static vertexes in an animation can be screened out, only a small number of data are stored and then the animation can be completed. Compared with the method in which all the displacement data of the vertexes are stored, the data compression method can save a lot of internal memory space and disk space, greatly reduce file I / O operation and minimize the influences on system performance.

Description

technical field [0001] The invention relates to a data processing method, in particular to a data compression method for vertex animation. Background technique [0002] Existing vertex animations usually save frame animations in the form of key frame export, and each frame saves the time stamp information of the frame and the position information of all vertices. The number of vertices is often in the tens of thousands. Even if some vertices have not changed in displacement for a few frames, the position data will be exported, which increases the file size. When loading and playing animation, it also consumes a lot of memory and a large number of file I / O operations, which affects performance. Contents of the invention [0003] In order to solve the above-mentioned problems existing in the prior art, the present invention provides a data compression method for vertex animation. By using this method, the data volume of vertices that have not been displaced in the animation...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
IPC IPC(8): G06F17/30
CPCG11B27/3081
Inventor 梁波吴才忠刘畅
Owner ZHUHAI KINGSOFT ONLINE GAME TECH CO LTD
Features
  • R&D
  • Intellectual Property
  • Life Sciences
  • Materials
  • Tech Scout
Why Patsnap Eureka
  • Unparalleled Data Quality
  • Higher Quality Content
  • 60% Fewer Hallucinations
Social media
Patsnap Eureka Blog
Learn More

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2025 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com