IP Library Granted Patent US 12,548,201
Granted Patent B2
US 12,548,201 · App. 18/312,722 · Granted Feb 10, 2026

Connectivity coding for symmetry mesh

Inventors: Thuong Nguyen Canh (San Bruno, CA); Xiaozhong Xu (State College, PA); Joel Jung (Palo Alto, CA); Shan Liu (San Jose, CA)
Assignee: TENCENT AMERICA LLC
G06T9/001G06T9/20H04N19/119H04N19/167H04N19/50H04N19/88
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,548,201
App. No.
18/312,722
Granted
Feb 10, 2026
Kind
B2
Abstract

A method of encoding includes receiving a polygon mesh comprising a plurality of faces and a plurality vertices; separating the polygon mesh into a left side half mesh and a right side half mesh by a plane; extracting the left side half mesh comprising a first plurality of vertices in-plane and on a left side of the polygon mesh; remapping the plurality of faces to represent a new vertices order in order to generate a plurality of remapped faces; extracting the plurality of remapped faces; compressing the left side half mesh by a codec; predicting a location of a second plurality of vertices on the right side half mesh using a symmetry based prediction on the compressed left side half mesh; and connecting the left side half mesh and the right side half mesh.

Claims (51)

1 . A method of video encoding performed by at least one processor, the method comprising:

receiving a polygon mesh comprising a plurality of faces and a plurality of vertices;

separating the polygon mesh into a left side half mesh and a right side half mesh by a plane;

extracting the left side half mesh comprising a first plurality of vertices in-plane and on a left side of the polygon mesh;

remapping the plurality of faces to represent a new vertices order in order to generate a plurality of remapped faces;

extracting the plurality of remapped faces;

compressing the left side half mesh by a codec;

predicting a location of a second plurality of vertices on the right side half mesh using a symmetry based prediction on the compressed left side half mesh; and

connecting the left side half mesh and the right side half mesh.

2 . The method according to claim 1 , further comprising determining a displacement for the second plurality of vertices.

3 . The method according to claim 1 , further comprising reordering the first plurality of vertices.

4 . The method according to claim 1 , wherein each face of the plurality of faces is represented by a set of indices of corresponding vertices.

5 . The method according to claim 4 , wherein the set of indices of corresponding vertices describe a connectivity between the plurality of faces, and

wherein the connectivity is divided into left face, right face, or cross symmetry plane face.

6 . The method according to claim 5 , further comprising adding new vertices and new edges to the polygon mesh at an intersection of one or more cross symmetry faces and the plane.

7 . The method according to claim 1 , wherein the symmetry prediction further comprises:

adding an offset to an index of each of the plurality of vertices on the right side half mesh; and

flipping a prediction of one or more faces on the right side half mesh in an order of predicted vertices.

8 . An apparatus comprising:

at least one memory configured to store program code; and

at least one processor configured to read the program code and operate as instructed by the program code, the program code including:

receiving code configured to cause the at least one processor to receive a polygon mesh comprising a plurality of faces and a plurality of vertices;

separating code configured to cause the at least one processor to separate the polygon mesh into a left side half mesh and a right side half mesh by a plane;

first extracting code configured to cause the at least one processor to extract the left side half mesh comprising a first plurality of vertices in-plane and on a left side of the polygon mesh;

remapping code configured to cause the at least one processor to remap the plurality of faces to represent a new vertices order in order to generate a plurality of remapped faces;

second extracting code configured to cause the at least one processor to extract the plurality of remapped faces;

compressing code configured to cause the at least one processor to compress the left side half mesh by a codec;

predicting code configured to cause the at least one processor to predict a location of a second plurality of vertices on the right side half mesh using a symmetry based prediction on the compressed left side half mesh; and

connecting code configured to cause the at least one processor to connect the left side half mesh and the right side half mesh.

9 . The apparatus according to claim 8 , further comprising determining code configured to cause the at least one processor to determine a displacement for the second plurality of vertices.

10 . The apparatus according to claim 8 , further comprising reordering code configured to cause the at least one processor to reorder the first plurality of vertices.

11 . The apparatus according to claim 8 , wherein each face of the plurality of faces is represented by a set of indices of corresponding vertices.

12 . The apparatus according to claim 11 , wherein the set of indices of corresponding vertices describe a connectivity between the plurality of faces, the connectivity is divided into left face, right face, or cross symmetry plane face.

13 . The apparatus according to claim 12 , further comprising adding code configured to cause the at least one processor to add new vertices and new edges to the polygon mesh at an intersection of one or more cross symmetry faces and the plane.

14 . The apparatus according to claim 8 , wherein the predicting code is further configured to cause the at least one processor to:

add an offset to an index of each of the plurality of vertices on the right side half mesh; and

flip a prediction of one or more faces on the right side half mesh in an order of predicted vertices.

15 . A non-transitory computer readable medium having instructions stored therein, which, when executed by at least one processor in an encoder, cause the at least one processor to:

receive a polygon mesh comprising a plurality of faces and a plurality of vertices;

separate the polygon mesh into a left side half mesh and a right side half mesh by a plane;

extract the left side half mesh comprising a first plurality of vertices in-plane and on a left side of the polygon mesh;

remap the plurality of faces to represent a new vertices order in order to generate a plurality of remapped faces;

extract the plurality of remapped faces;

compress the left side half mesh by a codec;

predict a location of a second plurality of vertices on the right side half mesh using a symmetry based prediction on the compressed left side half mesh; and

connect the left side half mesh and the right side half mesh.

16 . The non-transitory computer readable medium according to claim 15 , wherein the instructions further cause the at least one processor to determine a displacement for the second plurality of vertices.

17 . The non-transitory computer readable medium according to claim 15 , wherein the instructions further cause the at least one processor to reorder the first plurality of vertices.

18 . The non-transitory computer readable medium according to claim 15 , wherein each face of the plurality of faces is represented by a set of indices of corresponding vertices.

19 . The non-transitory computer readable medium according to claim 18 , wherein the set of indices of corresponding vertices describe a connectivity between the plurality of faces, the connectivity is divided into left face, right face, or cross symmetry plane face.

20 . The non-transitory computer readable medium according to claim 19 , wherein the instructions further cause the at least one processor to add new vertices and new edges to the polygon mesh at an intersection of one or more cross symmetry faces and the plane.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 5, 2023
From: NGUYEN CANH, THUONG; XU, XIAOZHONG; JUNG, JOEL; LIU, SHAN
To: TENCENT AMERICA LLC
Reel/Frame 063549/0916 →
Continuity (2)
Provisional Application 63409938 · Sep 26, 2022
Related Publication 20240127490A1 · Apr 18, 2024
References Cited (14)
US 20130057550A1 · Kishikawa et al. · 2013 [cited by applicant]
US 20170177771A1 · Letzelter · 2017 [cited by examiner]
US 20190259184A1 · Ostermann et al. · 2019 [cited by applicant]
US 20200111237A1 · Tourapis · 2020 [cited by examiner]
US 20200265611A1 · Hemmer · 2020 [cited by examiner]
US 20230290011A1 · Kim · 2023 [cited by examiner]
US 20240242391A1 · Zakharchenko · 2024 [cited by examiner]
US 20240289997A1 · Zakharchenko · 2024 [cited by examiner]
“A Distance-Based Compression of 3D Meshes for Mobile Devices”—Kim et al., IEEE Transactions on Consumer Electronics, vol. 54, No. 3, Aug. 2008. (Year: 2008). [cited by examiner]
“Benchmarking Open-Source Static 3D Mesh Codecs for Immersive Media Interactive Live Streaming”—Doumanoglou et al., IEEE Journal on Emerging and Selected Topics in Circuits and Systems, vol. 9, No. 1, Mar. 2019 (Year: 2… [cited by examiner]
“Hierarchical Representation and Coding of 3D Mesh Geometry”—Celasun et al., 1-4244-0481-9/06/$20.00 C2006 IEEE (Year: 2006). [cited by examiner]
Khaled Mammou et al., “[V-CG] Apple's Dynamic Mesh Coding CfP Response”, International Organisation for Standardisation Organisation Internationale de Normalisation, ISO/IEC JTC 1/SC 29/WG 7 Coding of Moving Pictures an… [cited by applicant]
International Search Report dated Aug. 15, 2023 in Application No. PCT/US 23/23298. [cited by applicant]
Written Opinion of the International Search Authority dated Aug. 15, 2023 in Application No. PCT/US23/23298. [cited by applicant]