IP Library › Granted Patent US 12,718,418
Granted Patent B2
US 12,718,418 · App. 18/690,187 · Granted Aug 25, 2026

Method for decoding 3D content, encoder, and decoder

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,718,418
App. No.
18/690,187
Filed
Mar 7, 2024
Granted
Aug 25, 2026
Kind
B2
Art Unit
2613
USPC
345/419
Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 3, 2024
From: INNOPEAK TECHNOLOGY, INC.
To: GUANGDONG OPPO MOBILE TELECOMMUNICATIONS CORP., LTD.
Reel/Frame 066994/0119 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 8, 2024
From: ZAKHARCHENKO, VLADYSLAV; YU, HAOPING; YU, YUE
To: INNOPEAK TECHNOLOGY, INC.
Reel/Frame 066694/0146 →
Continuity (2)
Provisional Application 63243016 · Sep 10, 2021
Related Publication 20240289997A1 · Aug 29, 2024
References Cited (71)
US 6075540A · Hoppe · 2000 [cited by applicant]
US 6396490B1 · Gorman · 2002 [cited by applicant]
US 6614428B1 · Lengyel · 2003 [cited by applicant]
US 6628277B1 · Deering et al. · 2003 [cited by applicant]
US 6959114B2 · Kim et al. · 2005 [cited by applicant]
US 6982715B2 · Isenburg · 2006 [cited by applicant]
US 7538769B2 · Hoppe · 2009 [cited by applicant]
US 8502815B2 · Stefanoski et al. · 2013 [cited by applicant]
US 8860719B2 · Ahn et al. · 2014 [cited by applicant]
US 9607434B2 · Ahn et al. · 2017 [cited by applicant]
US 10535162B2 · Laroche et al. · 2020 [cited by applicant]
US 10552987B2 · Laroche et al. · 2020 [cited by applicant]
US 10643352B2 · Hemmer et al. · 2020 [cited by applicant]
US 11393132B2 · Faramarzi et al. · 2022 [cited by applicant]
US 11915373B1 · Mammou · 2024 [cited by applicant]
US 12131508B2 · Huang et al. · 2024 [cited by applicant]
US 12524917B2 · Xu et al. · 2026 [cited by applicant]
US 12524920B2 · Zakharchenko et al. · 2026 [cited by applicant]
US 12530813B2 · Zakharchenko et al. · 2026 [cited by applicant]
US 12536709B2 · Zakharchenko et al. · 2026 [cited by applicant]
US 12536710B2 · Zakharchenko et al. · 2026 [cited by applicant]
US 20110046923A1 · Lee et al. · 2011 [cited by applicant]
US 20180189982A1 · Laroche et al. · 2018 [cited by applicant]
US 20190251734A1 · Li et al. · 2019 [cited by applicant]
US 20190371045A1 · Li et al. · 2019 [cited by applicant]
US 20200221125A1 · Budagavi et al. · 2020 [cited by applicant]
US 20200265611A1 · Hemmer et al. · 2020 [cited by applicant]
US 20200286261A1 · Faramarzi et al. · 2020 [cited by applicant]
US 20210082146A1 · Kashiwagi et al. · 2021 [cited by applicant]
US 20210090301A1 · Mammou et al. · 2021 [cited by applicant]
US 20210248504A1 · De Haan et al. · 2021 [cited by applicant]
US 20210250576A1 · Kim · 2021 [cited by applicant]
US 20210279957A1 · Eder et al. · 2021 [cited by applicant]
US 20220141487A1 · Oh · 2022 [cited by applicant]
US 20220292684A1 · Wang et al. · 2022 [cited by applicant]
US 20220392115A1 · Mammou · 2022 [cited by examiner]
US 20230014820A1 · Zhang et al. · 2023 [cited by applicant]
US 20230090677A1 · Zhang et al. · 2023 [cited by applicant]
US 20230132180A1 · Hsieh et al. · 2023 [cited by applicant]
US 20230143284A1 · Xu et al. · 2023 [cited by applicant]
US 20230319293A1 · Zhang et al. · 2023 [cited by applicant]
US 20240242391A1 · Zakharchenko et al. · 2024 [cited by applicant]
US 20240289997A1 · Zakharchenko et al. · 2024 [cited by applicant]
US 20240420376A1 · Zakharchenko et al. · 2024 [cited by applicant]
US 20240430480A1 · Lee et al. · 2024 [cited by applicant]
US 20250024057A1 · Nguyen Canh et al. · 2025 [cited by applicant]
US 20250069273A1 · Zakharchenko et al. · 2025 [cited by applicant]
US 20250111545A1 · Zakharchenko et al. · 2025 [cited by applicant]
US 20250131600A1 · Zakharchenko et al. · 2025 [cited by applicant]
US 20250148715A1 · Zakharchenko et al. · 2025 [cited by applicant]
US 20250166231A1 · Zakharchenko et al. · 2025 [cited by applicant]
US 20250240453A1 · Cao · 2025 [cited by applicant]
US 20260019639A1 · Zakharchenko et al. · 2026 [cited by applicant]
JP 2012068881 · 2012 [cited by applicant]
KR 20100007685 · 2010 [cited by applicant]
WO 2020180161 · 2020 [cited by applicant]
WO 2021053262 · 2021 [cited by applicant]
“Information technology—Coded representation of immersive media—Part 5: Visual Volumetric Video-based Coding (V3C) and Video-based Point Cloud Compression (V-PCC),” ISO/IEC 23090-5:2021(2E), ISO/IEC JTC 1/SC 29/WG 07, 2… [cited by applicant]
Rossignac, “Edgebreaker: Connectivity compression for triangle meshes,” IEEE Transactions on Visualization and Computer Graphics, Jan. 1999, vol. 5, No. 1. [cited by applicant]
Mamou et al., “TFAN: A low complexity 3D mesh compression algorithm,” Computer Animation and Virtual Worlds, 2009, vol. 20. [cited by applicant]
Faramarzi et al., “Mesh Coding Extensions to MPEG-I V-PCC,” IEEE 22nd International Workshop on Multimedia Signal Processing (MMSP), 2020. [cited by applicant]
WIPO, International Search Report and Written Opinion for International Application No. PCT/US2022/043086, Jan. 3, 2023. [cited by applicant]
Yang et al., “Semi-Regular Representation and Progressive Compression of 3-D Dynamic Mesh Sequences,” IEEE Transactions on Image Processing, Sep. 2006, vol. 15, No. 9. [cited by applicant]
WIPO, International Search Report and Written Opinion for International Application No. PCT/US2022/043098, Feb. 3, 2023. [cited by applicant]
WIPO, International Search Report and Written Opinion for International Application No. PCT/US2022/043104, Feb. 3, 2023. [cited by applicant]
USPTO, Non-Final Office Action for U.S. Appl. No. 18/690,052, Oct. 27, 2025. [cited by applicant]
Li et al., “A Survey on Recent Approaches of Mesh Compressions,” 2014 International Conference on Virtual Reality and Visualization, 2014. [cited by applicant]
Chou et al., “Dynamic Polygon Clouds: Representation and Compression for VR/AR,” arXiv: 1610.00402v2, Mar. 8, 2017. [cited by applicant]
Gupta et al., “Registration and Partitioning-based Compression of 3-D Dynamic Data,” IEEE transactions on circuits and systems for video technology, Nov. 2003, vol. 13, No. 11. [cited by applicant]
Kwan et al., “Packing Vertex Data into Hardware-Decompressible Textures,” IEEE transactions on visualization and computer graphics, May 2018, vol. 24, No. 5. [cited by applicant]
USPTO, Final Office Action for U.S. Appl. No. 18/690,052, Feb. 11, 2026. [cited by applicant]