Dynamic Mesh Geometry Coding via 3D Sub-Block Segmentation

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing 3D graphics technologies face challenges in efficiently encoding and decoding large datasets associated with complex 3D models, leading to bottlenecks during data transfer and rendering.

Innovation Solution

The proposed solution involves efficient geometry component coding for dynamic mesh coding, which includes normalizing and integerizing vertex coordinates, segmenting them into 3D sub-blocks, and mapping these sub-blocks to 2D patches in a geometry component image, followed by compression using a video encoder.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Measurement precision

If vertex coordinates are encoded using high bit depth to maintain precision, then encoding precision is improved, but data size increases and transfer efficiency deteriorates

Engineering Contradiction:
Improveencoding precisionVSAvoidtransfer efficiency
Core Design Contradiction:
Measurement precisionVSProductivity

Solution Approach 1:

The patent segments the 3D space into multiple 3D sub-blocks, each with its own local coordinate system. This segmentation allows each sub-block to use a reduced bit depth for encoding vertex coordinates within its local range, while maintaining overall precision through the hierarchical structure. The geometry component image is divided into multiple 2D patches corresponding to these 3D sub-blocks, enabling efficient encoding without requiring high bit depth for the entire mesh.

Inventive Principle:
Principle #1Segmentation

2Reliability

If occupancy maps are encoded to track vertex presence, then decoding accuracy is improved, but encoding complexity increases

Engineering Contradiction:
Improvedecoding accuracyVSAvoidencoding complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The patent extracts and eliminates the occupancy map encoding step from the traditional mesh encoding process. Instead of explicitly encoding occupancy information, the method uses the 3D sub-block segmentation and local coordinate transformation to implicitly define vertex presence. The geometry component image directly stores vertex position information in the 2D patches, and vertices are reconstructed based on their positions relative to the 3D sub-block origins, thereby simplifying the encoding process while maintaining decoding accuracy.

Inventive Principle:
Principle #2Taking out (Extraction)

Data Source

PatentUS20250148715A1Efficient geometry component coding for dynamic mesh coding
Publication Date: 2025.05.08 GUANGDONG OPPO MOBILE TELECOMMUNICATIONS CORP LTD
  • US20250148715A1 patent drawing
  • US20250148715A1 patent drawing
  • US20250148715A1 patent drawing

AI summary

In some embodiments, a mesh encoder encodes a dynamic mesh with efficient geometry coding. The encoder normalizes and integerizes the coordinates of vertices of a mesh frame. The encoder segments the integerized coordinates for the vertices into 3D sub-blocks, each 3D sub-block containing at least one vertex and local coordinates of vertices in each 3D sub-block having a value range fitting into a video bit depth. For each 3D sub-block, the encoder converts coordinates of a vertex inside the 3D sub-block to a local coordinate system of the 3D sub-block and maps each vertex inside the 3D sub-block to a corresponding 2D patch in a geometry component image that represents the mesh frame. The encoder compresses the geometry component image to generate a geometry component bitstream and further generates the coded mesh bitstream for the dynamic mesh by including the geometry component bitstream.