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

Three-dimensional model compression method based on three-dimensional mesh subdivision and coding

A 3D model and 3D mesh technology, applied in image coding, 3D modeling, image data processing, etc., can solve the problem of low compression ratio of 3D models, reduce the space occupied by offsets, improve the compression ratio, and reduce occupancy effect of space

Active Publication Date: 2015-12-09
上海未高科技有限公司
View PDF3 Cites 15 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0005] Aiming at the disadvantages of low compression ratio of 3D models in the prior art, the present invention provides a 3D model compression method based on 3D grid subdivision and coding

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
  • Three-dimensional model compression method based on three-dimensional mesh subdivision and coding

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0020] The specific compression process is as follows figure 1 As shown, a 3D model compression method based on 3D mesh subdivision and coding includes the following steps:

[0021] Step 1. Read the vertex coordinate data of the 3D model, compare the x, y, and z coordinates of the vertices one by one, and calculate the maximum and minimum vertex coordinates of the 3D model; determine the boundary parameters of the axial bounding box by the maximum and minimum vertex coordinates , the boundary parameters include the maximum and minimum position coordinates of the axial bounding box in the three-dimensional coordinate system, store the boundary parameters, and confirm the range of the axial bounding box through the boundary parameters; the bounding box algorithm is a method for solving the optimal enclosing of discrete point sets The basic idea of ​​the spatial method is to approximately replace complex geometric objects with slightly larger and simpler geometric objects (called...

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 relates to the field of computer graph processing, and particularly relates to a three-dimensional model compression method based on three-dimensional mesh subdivision and coding. The method comprises the steps that the boundary parameter of an axial bounding box is determined; the aliquot factor of the axial bounding box is calculated; according to the aliquot factor, three-dimensional mesh subdivision is carried out on the axial bounding box, and the unique index coding of a subdivision mesh is established; index coding data, which are corresponding to the three-dimensional subdivision mesh, of the vertex are calculated; the coordinate of each subdivision mesh origin is calculated; the offset of the three-dimensional model vertex coordinate relative to a three-dimensional subdivision mesh origin is calculated to acquire the floating-point precision of the vertex coordinate, and the offset is integerized; data entropy coding is carried out on the data; and an open-source LZMA compression algorithm is used to carry out parameter data compression. According to the invention, three-dimensional subdivision mesh index coding is carried out on the three-dimensional model vertex according to relevant parameters, and the corresponding offset is calculated; space occupied by the offset is greatly reduced compared with the original vertex coordinate data; and the compression ratio is improved.

Description

technical field [0001] The invention relates to the field of computer graphics processing, in particular to a three-dimensional model compression method based on three-dimensional grid subdivision and coding. Background technique [0002] With the development of computer graphics, the actual 3D models needed are getting larger and more complex, and the amount of 3D model data has increased sharply, resulting in large-scale 3D models. At the same time, with the rapid development of the mobile Internet, there is a strong demand for 3D use on more and more mobile terminal devices. In the current situation of limited mobile network bandwidth, there is a certain contradiction between the huge data of large-scale 3D models and limited network bandwidth resources. Only by efficiently compressing large-scale 3D models to reduce the amount of transmitted data can it be possible to solve the transmission bandwidth limitation in the use of large-scale 3D models. [0003] The 3D model...

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): G06T17/00G06T9/00
Inventor 林秀全
Owner 上海未高科技有限公司
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