# US 2025/0148715 A1 · Efficient geometry component coding for dynamic mesh coding

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2025/0148715 A1
- Document ID: US20250148715A1
- Status: Published application
- Kind: A1
- Application number: 18/840,747
- Filed: 2023-02-24
- Published: 2025-05-08
- Earliest claimed: 2022-02-24
- Assignees: Guangdong Oppo Mobile Telecommunications Corp., Ltd.
- Applicants: Guangdong Oppo Mobile Telecommunications Corp., Ltd.
- Inventors: Vladyslav ZAKHARCHENKO; Haoping YU; Yue YU
- Web page: https://patentgrep.com/patent/US20250148715A1

## CPC

- G06T 17/20: Finite element generation, e.g. wire-frame surface description, {tesselation}
- G06T 9/001: {Model-based coding, e.g. wire frame}
- G06T: IMAGE DATA PROCESSING OR GENERATION, IN GENERAL

## Abstract

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.

## Claims

### Claim 1

A computer-implemented method for encoding three-dimensional (3D) content represented by a dynamic mesh, the method comprising:
normalizing coordinates of each vertex of a plurality of vertices in a mesh frame of the dynamic mesh;
integerizing the coordinates of each vertex of the plurality of vertices;
segmenting the integerized coordinates for the plurality of vertices into one or more 3D sub-blocks, each 3D sub-block containing at least one vertex of the plurality of vertices, 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,
converting coordinates of a vertex inside the 3D sub-block to a local coordinate system of the 3D sub-block; and
mapping each vertex inside the 3D sub-block to a corresponding 2D patch in a geometry component image of the dynamic mesh that represents the mesh frame;
compressing the geometry component image and other geometry component images of the dynamic mesh using a video encoder to generate a geometry component bitstream; and
generating a coded mesh bitstream for the dynamic mesh by including at least the geometry component bitstream.

### Claim 2 (depends on 1)

The computer-implemented method of claim 1, wherein normalizing the coordinates of a vertex in the mesh frame of the dynamic mesh comprises:
converting the coordinates of the vertex into a positive range; and
integerizing the converted coordinates to fit into a geometry bit depth.

### Claim 3 (depends on 1)

The computer-implemented method of claim 1, further comprising:
determining coordinates of a bounding box based on the normalized coordinates of the vertices in the mesh frame; and
storing the coordinates of the bounding box in a bitstream header of the geometry component bitstream.

### Claim 4 (depends on 3)

The computer-implemented method of claim 3, wherein integerizing the coordinates of each vertex of the plurality of vertices is performed based on an integerization parameter for geometry coordinates that is determined based on the bounding box and a geometry bit depth for the dynamic mesh, and wherein the integerization parameter is stored in the bitstream header of the geometry component bitstream.

### Claim 5 (depends on 1)

The computer-implemented method of claim 1, wherein the video bit depth is specified in a sequence parameter set or a geometry sequence parameter set of the geometry component bitstream.

### Claim 6 (depends on 1)

The computer-implemented method of claim 1, wherein the geometry component image comprises a Y plane, a U plane, and a V plane, and wherein mapping each vertex inside the 3D sub-block to a corresponding 2D patch in the geometry component image of the dynamic mesh comprises:
mapping a first coordinate of the vertex to a first value in the Y plane of the corresponding 2D patch;
mapping a second coordinate of the vertex to a second value in the U plane of the corresponding 2D patch; and
mapping a third coordinate of the vertex to a third value in the V plane of the corresponding 2D patch.

### Claim 7 (depends on 1)

The computer-implemented method of claim 1, wherein each vertex of the plurality of vertices belongs to one and only one 3D sub-block.

### Claim 8 (depends on 1)

The computer-implemented method of claim 1, further comprising:
for each 3D sub-block, sorting the vertices in the 3D sub-block according to a space-filling curve order, wherein mapping each vertex inside the 3D sub-block to the corresponding 2D patch is performed according to the space-filling curve order.

### Claim 9

A non-transitory computer-readable medium storing a coded mesh bitstream generated according to the following operations:
normalizing coordinates of each vertex of a plurality of vertices in a mesh frame of a dynamic mesh;
integerizing the coordinates of each vertex of the plurality of vertices;
segmenting the integerized coordinates for the plurality of vertices into one or more 3D sub-blocks, each 3D sub-block containing at least one vertex of the plurality of vertices, 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,
converting coordinates of a vertex inside the 3D sub-block to a local coordinate system of the 3D sub-block, and
mapping each vertex inside the 3D sub-block to a corresponding 2D patch in a geometry component image of the dynamic mesh that represents the mesh frame;
compressing the geometry component image and other geometry component images of the dynamic mesh using a video encoder to generate a geometry component bitstream; and
generating the coded mesh bitstream for the dynamic mesh by including at least the geometry component bitstream.

### Claim 10 (depends on 9)

The non-transitory computer-readable medium of claim 9, wherein normalizing the coordinates of a vertex in the mesh frame of the dynamic mesh comprises:
converting the coordinates of the vertex into a positive range; and
integerizing the converted coordinates to fit into a geometry bit depth.

### Claim 11 (depends on 9)

The non-transitory computer-readable medium of claim 9, wherein the operations further comprise:
determining coordinates of a bounding box based on the normalized coordinates of the vertices in the mesh frame; and
storing the coordinates of the bounding box in a bitstream header of the geometry component bitstream.

### Claim 12 (depends on 11)

The non-transitory computer-readable medium of claim 11, wherein integerizing the coordinates of each vertex of the plurality of vertices is performed based on an integerization parameter for geometry coordinates that is determined based on the bounding box and a geometry bit depth for the dynamic mesh, and wherein the integerization parameter is stored in the bitstream header of the geometry component bitstream.

### Claim 13 (depends on 9)

The non-transitory computer-readable medium of claim 9, wherein the video bit depth is specified in a sequence parameter set or a geometry sequence parameter set of the geometry component bitstream.

### Claim at position 14

-20. (canceled)

### Claim 21

A computer-implemented method for decoding a coded mesh bitstream of a dynamic mesh representing three-dimensional (3D) content, the method comprising:
generating a geometry component image for a mesh frame of the dynamic mesh by decoding a geometry component bitstream in the coded mesh bitstream;
reconstructing coordinates of vertices in a local coordinate system of a 3D sub-block of the mesh frame from a corresponding 2D patch in the geometry component image by converting color information from color planes of the corresponding 2D patch to the coordinates of vertices in the local coordinate system of the 3D sub-block;
reconstructing global coordinates of the vertices in the mesh frame from the coordinates of vertices in the local coordinate system of the 3D sub-block;
reconstructing geometry coordinates of the vertices by applying inverse integerization based on integerization parameter for geometry information of the dynamic mesh;
reconstructing the dynamic mesh based, at least in part, on the reconstructed geometry coordinates; and
causing the reconstructed dynamic mesh to be rendered for display.

### Claim 22 (depends on 21)

The computer-implemented method of claim 21, wherein the integerization parameter is decoded from a bitstream header of the geometry component bitstream.

### Claim 23 (depends on 21)

The computer-implemented method of claim 21, further comprising:
decoding patch information for the 2D patch from an atlas bitstream; and
converting the color information from the color planes of the 2D patch to the coordinates of vertices in the local coordinate system of the 3D sub-block is performed based on the patch information.

### Claim 24 (depends on 23)

The computer-implemented method of claim 23, wherein the patch information for the 2D patch comprises:
a number of vertices in the 2D patch;
2D coordinates of an origin of the 2D patch;
a size of the 2D patch; and
coordinates of an origin of the 2D patch.

### Claim 25 (depends on 24)

The computer-implemented method of claim 24, wherein converting the color information from the color planes of the 2D patch to the coordinates of vertices in the local coordinate system of the 3D sub-block is performed further based on a color space of the geometry component image.

### Claim 26 (depends on 24)

The computer-implemented method of claim 24, wherein the 2D patch comprises a Y plane, a U plane, and a V plane, and wherein converting the color information from the color planes of the 2D patch to the coordinates of vertices in the local coordinate system of the 3D sub-block comprises:
converting a first value in the Y plane of the 2D patch to a first coordinate of a vertex in the 3D sub-block;
converting a second value in the U plane of the 2D patch that corresponds to the first value in the Y plane to a second coordinate of the vertex in the 3D sub-block; and
converting a third value in the V plane of the 2D patch that corresponds to the first value in the Y plane to a third coordinate of the vertex in the 3D sub-block.

### Claim 27 (depends on 21)

The computer-implemented method of claim 21, wherein decoding the geometry component bitstream is performed via lossy video encoding.

### Claim at position 22

-40. (canceled)
