Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

One-dimensional nondestructive geometric compressing method of three-dimensional grid model

A compression method and technology of 3D mesh, applied in image data processing, instrumentation, calculation, etc., can solve problems such as affecting the effect of model compression processing, unable to meet the requirements of lossless compression of geometric data parts, etc.

Inactive Publication Date: 2010-06-02
DALIAN NATIONALITIES UNIVERSITY
View PDF1 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Unable to meet the lossless compression requirements for the geometric data part of massive model data, which affects the compression processing effect of the model in graphics

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
  • One-dimensional nondestructive geometric compressing method of three-dimensional grid model
  • One-dimensional nondestructive geometric compressing method of three-dimensional grid model
  • One-dimensional nondestructive geometric compressing method of three-dimensional grid model

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0026] Utilize the processing method of the present invention to compress the geometric coordinate data of the triangular mesh model

[0027] The specific compression process is as follows Figure 5 As shown, first put the figure 1 The three-dimensional coordinates of each vertex in the point table are converted into their corresponding one-dimensional position numbers. The numbering is to number the x-coordinate, y-coordinate, and z-coordinate respectively, and each point position in the three-dimensional space corresponds to a unique number; the conversion relationship between the number s and the coordinate value of the corresponding point position is as follows:

[0028] s=(z×N 2 +y×N+x)×10 d (1)

[0029] Among them, N is the number of possible values ​​​​of the coordinate value (16777216 for the single-precision floating-point number); d is the maximum number of digits after the decimal point of the coordinate value (7 digits for the single-precision floating-poin...

Embodiment 2

[0040] To the improved algorithm of band data pretreatment by processing method of the present invention: following process only takes x as example, and y and z are similar;

[0041] First, in order to facilitate the subsequent compression, the vertex coordinates are preprocessed, and the three-dimensional floating point coordinates are losslessly quantized into integers. The preprocessing quantization process is as follows: For a certain point (x, y, z), the point after the above transformation is recorded as (x’, y’, z’), and x is expressed as a×10 p , where a∈[0.1, 1), p is the index. Then traverse all the data to find the smallest index in the x, y and z coordinates respectively, which are recorded as e1, e2 and e3.

[0042] Let x'=p-e1+a, the floating-point numbers we encounter in the future are all processed numbers (including the following X' max etc.) Such processing can greatly reduce the value range of the model coordinate data on the x-axis.

[0043] Traverse the...

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 belongs to the computer graphics processing field, providing a one-dimensional lossless geometry compression method for three-dimensional mesh models. The method comprises the followingsteps that: a data processing module converts three-dimensional coordinate data into one-dimensional position numbers; all the position numbers are sorted; the difference value of adjacent positions is evaluated; a first position number, as well as the difference value of the position number and an adjacent previous position number are stored in a memory module; and the processed data is compressed by use of arithmetic coding. The invention puts forward a brand-new geometry data compression method, which carries out unified numbering to the positions of all points. The position of every pointin three-dimensional space corresponds to a unique number; and the order of vertices in a compression point table after sorting is different from that of the vertices in an original table, but the order change of the vertices can not change an object model. Experimental results show that the method has higher compression efficiency.

Description

technical field [0001] The invention belongs to the field of computer graphics processing, in particular to a compression method for models in graphics. Background technique [0002] Triangular meshes are the most popular representation of 3D model data. The reason is that the simplicity of the triangular mesh enables it to be rendered quickly, thus effectively promoting the development of corresponding rendering hardware. In addition, the 3D grid representation is the most common mainstream representation of 3D model data, because almost all model representations (splines, implicit functions, voxels) can be converted into triangular grids to represent a The mesh model of the object needs at least two data tables of point table and surface table. The point table is used to store all vertices of the mesh model, and each vertex uses 3 units to store its three coordinate values ​​of x, y and z, such as figure 1 shown. Therefore, in the fields of medical treatment, scientifi...

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
Patent Type & Authority Patents(China)
IPC IPC(8): G06T9/00
Inventor 刘勇奎何丽君王鹏杰博鲁特·扎利克
Owner DALIAN NATIONALITIES UNIVERSITY
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

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

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