IP Library › Granted Patent US 12,688,648
Granted Patent B2
US 12,688,648 · App. 18/166,179 · Granted Jul 21, 2026

Motion compression for efficient dynamic mesh coding

Inventors: Khaled Mammou (Danville, CA); Alexandros Tourapis (Los Gatos, CA)
Assignee: Apple Inc.
G06T17/20G06T15/04G06T17/205G06V10/25G06T9/001G06T2200/04
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,688,648
App. No.
18/166,179
Filed
Feb 8, 2023
Granted
Jul 21, 2026
Kind
B2
Art Unit
2682
USPC
382/232
Abstract

A method of encoding motion data associated with an input data corresponding to set of 3D meshes M(i), the motion data including at least one of geometry and vertex attribute changes from one frame to another, can include: dividing input mesh M(i) into a set of patches P(i, j), each patch P(i, j) corresponding to a corresponding patch P(k, l) in a previously encoded reference frame; quantizing at least one of vertices and attributes of each patch P(i, j); predicting residuals based on a difference between quantized vertices or attributes of each patch P(i, j) with respect to corresponding patch P(k, l) in the previously encoded reference frame; and entropy encoding the predicted residuals.

Claims (47)

1 . A method of encoding motion data associated with an input data corresponding to a set of 3D meshes M(i), the motion data including at least one of geometry and vertex attribute changes from one frame to another, the method comprising:

dividing input mesh M(i) into a set of patches P(i, j), each patch P(i, j) corresponding to a corresponding patch P(k, l) in a previously encoded reference frame;

quantizing at least one of vertices and attributes of each patch P(i, j);

predicting residuals based on a difference between the quantized vertices or attributes of each patch P(i, j) with respect to a corresponding patch P(k, l) in the previously encoded reference frame; and

entropy encoding the predicted residuals;

wherein the input data is time consistent so that P(i, j) and P(k, l) have the same connectivity.

2 . The method of claim 1 , wherein quantizing at least one of the vertices and attributes of each patch P(i, j) further comprises applying uniform quantization to all vertices or attributes.

3 . The method of claim 1 , wherein quantizing at least one of the vertices and attributes of each patch P(i, j) further comprises applying adaptive quantization that changes a quantization level based on at least one of user input or analysis of mesh M(i).

4 . The method of claim 1 , wherein predicting the residuals based on a difference between quantized vertices or attributes of each patch P(i, j) with respect to corresponding patch P(k, l) in the previously encoded reference frame comprises making at least one of spatial and temporal predictions.

5 . The method of claim 1 , wherein predicting the residuals based on the difference between quantized vertices or attributes of each patch P(i, j) with respect to the corresponding patch P(k, l) in the previously encoded reference frame comprises using a delta temporal predictor.

6 . The method of claim 1 , wherein predicting the residuals based on the difference between quantized vertices or attributes of each patch P(i, j) with respect to the corresponding patch P(k, l) in the previously encoded reference frame comprises using an average spatial predictor.

7 . The method of claim 1 , wherein predicting the residuals based on the difference between quantized vertices or attributes of each patch P(i, j) with respect to the corresponding patch P(k, l) in the previously encoded reference frame comprises using an average predictor using temporal and spatial information.

8 . The method of claim 1 , wherein predicting the residuals based on the difference between quantized vertices or attributes of each patch P(i, j) with respect to the corresponding patch P(k, l) in the previously encoded reference frame comprises using a spatial-temporal parallelogram predictor.

9 . The method of claim 1 , wherein predicting the residuals based on the difference between quantized vertices or attributes of each patch P(i, j) with respect to the corresponding patch P(k, l) in the previously encoded reference frame comprises using a spatial parallelogram predictor.

10 . The method of claim 1 , wherein predicting the residuals based on the difference between quantized vertices or attributes of each patch P(i, j) with respect to the corresponding patch P(k, l) in the previously encoded reference frame comprises using geometry-guided predictors.

11 . The method of claim 1 , wherein entropy encoding the predicted residuals comprises using an entropy coder that is a context adaptive binary arithmetic conder (CABAC).

12 . The method of claim 11 , further comprising employing a CABAC encoder together with Exponential Golomb codes to compress both predictor index and prediction residuals.

13 . A method of encoding motion data associated with an input data corresponding to set of 3D meshes M(i), the motion data including at least one of geometry and vertex attribute changes from one frame to another, the method comprising:

dividing input mesh M(i) into a set of patches P(i, j), each patch P(i, j) corresponding to a corresponding patch P(k, l) in a previously encoded reference frame;

quantizing at least one of vertices and attributes of each patch P(i, j);

predicting residuals based on a difference between quantized vertices or attributes of each patch P(i, j) with respect to corresponding patch P(k, l) in the previously encoded reference frame; and

entropy encoding the predicted residuals;

wherein predicting the residuals based on the difference between the quantized vertices or attributes of each patch P(i, j) with respect to the corresponding patch P(k, l) in the previously encoded reference frame comprises comparing the residuals using two or more predictors and selecting the residuals based on rate distortion performance of the two or more predictors.

14 . The method of claim 13 , wherein the two or more predictors are selected from the group consisting of:

a delta temporal predictor;

a average spatial predictor;

an average predictor using temporal and spatial information;

a spatial parallelogram predictor;

a spatial-temporal parallelogram predictor; or

geometry-guided predictors.

15 . A method of encoding motion data associated with an input data corresponding to set of 3D meshes M(i), the motion data including at least one of geometry and vertex attribute changes from one frame to another, the method comprising:

dividing input mesh M(i) into a set of patches P(i, j), each patch P(i, j) corresponding to a corresponding patch P(k, l) in a previously encoded reference frame;

quantizing at least one of the vertices and attributes of each patch P(i, j);

predicting residuals based on a difference between quantized vertices or attributes of each patch P(i, j) with respect to the corresponding patch P(k, l) in the previously encoded reference frame; and

entropy encoding the predicted residuals;

wherein if the input data is not time consistent, the method further comprises preprocessing the input data by applying a time consistent remeshing process so that P(i, j) and P(k, l) have the same connectivity.

16 . The method of claim 15 , wherein quantizing at least one of the vertices and attributes of each patch P(i, j) further comprises applying uniform quantization to all vertices or attributes.

17 . The method of claim 15 , wherein quantizing at least one of the vertices and attributes of each patch P(i, j) further comprises applying adaptive quantization that changes a quantization level based on at least one of user input or analysis of mesh M(i).

18 . The method of claim 15 , wherein predicting the residuals based on the difference between the quantized vertices or attributes of each patch P(i, j) with respect to the corresponding patch P(k, l) in the previously encoded reference frame comprises making at least one of the spatial and temporal predictions.

19 . The method of claim 15 , wherein predicting the residuals based on the difference between quantized vertices or attributes of each patch P(i, j) with respect to the corresponding patch P(k, l) in the previously encoded reference frame comprises using a delta temporal predictor.

20 . The method of claim 15 , wherein predicting the residuals based on the difference between quantized vertices or attributes of each patch P(i, j) with respect to the corresponding patch P(k, l) in the previously encoded reference frame comprises using an average spatial predictor.

21 . The method of claim 15 , wherein predicting the residuals based on the difference between quantized vertices or attributes of each patch P(i, j) with respect to the corresponding patch P(k, l) in the previously encoded reference frame comprises using an average predictor using temporal and spatial information.

22 . The method of claim 15 , wherein predicting the residuals based on the difference between quantized vertices or attributes of each patch P(i, j) with respect to the corresponding patch P(k, l) in the previously encoded reference frame comprises using a spatial-temporal parallelogram predictor.

23 . The method of claim 15 , wherein predicting the residuals based on the difference between quantized vertices or attributes of each patch P(i, j) with respect to the corresponding patch P(k, l) in the previously encoded reference frame comprises using a spatial parallelogram predictor.

24 . The method of claim 15 , wherein predicting the residuals based on the difference between quantized vertices or attributes of each patch P(i, j) with respect to the corresponding patch P(k, l) in the previously encoded reference frame comprises using geometry-guided predictors.

25 . The method of claim 15 , wherein entropy encoding the predicted residuals comprises using an entropy coder that is a context adaptive binary arithmetic coder (CABAC).

26 . The method of claim 25 , further comprising employing a CABAC encoder together with Exponential Golomb codes to compress both predictor index and prediction residuals.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 9, 2023
From: MAMMOU, KHALED; TOURAPIS, ALEXANDROS
To: APPLE INC.
Reel/Frame 062638/0841 →
Continuity (8)
Provisional Application 63368793 · Jul 19, 2022
Provisional Application 63269211 · Mar 11, 2022
Provisional Application 63269219 · Mar 11, 2022
Provisional Application 63269217 · Mar 11, 2022
Provisional Application 63269214 · Mar 11, 2022
Provisional Application 63269218 · Mar 11, 2022
Provisional Application 63269213 · Mar 11, 2022
Related Publication 20230290010A1 · Sep 14, 2023
References Cited (119)
US 883136A · Johnson · 1908 [cited by applicant]
US 6046744A · Hoppe · 2000 [cited by applicant]
US 6047088A · van Beek · 2000 [cited by applicant]
US 6573890B1 · Lengyel · 2003 [cited by applicant]
US 6801215B1 · Silva · 2004 [cited by applicant]
US 8665267B2 · Joshi · 2014 [cited by applicant]
US 9442905B1 · Kawaguchi · 2016 [cited by applicant]
US 10861233B1 · De Goes · 2020 [cited by applicant]
US 11100721B1 · Bois · 2021 [cited by applicant]
US 20040090438A1 · Alliez · 2004 [cited by applicant]
US 20070053435A1 · Kirenko · 2007 [cited by applicant]
US 20070081593A1 · Jeong · 2007 [cited by applicant]
US 20080031325A1 · Qi · 2008 [cited by applicant]
US 20080036760A1 · Smith · 2008 [cited by applicant]
US 20080181522A1 · Hosaka · 2008 [cited by applicant]
US 20090168880A1 · Jeon · 2009 [cited by applicant]
US 20100036647A1 · Reem · 2010 [cited by applicant]
US 20170140631A1 · Pietrocola · 2017 [cited by applicant]
US 20170208417A1 · Thakur · 2017 [cited by applicant]
US 20170287112A1 · Stafford · 2017 [cited by applicant]
US 20180152688A1 · Graziosi · 2018 [cited by applicant]
US 20190213778A1 · Du · 2019 [cited by applicant]
US 20200050965A1 · Harvill · 2020 [cited by applicant]
US 20200098137A1 · Hemmer · 2020 [cited by applicant]
US 20200211230A1 · Zhao · 2020 [cited by applicant]
US 20200219323A1 · Varshney · 2020 [cited by applicant]
US 20200265552A1 · Hemmer · 2020 [cited by applicant]
US 20200265611A1 · Hemmer · 2020 [cited by applicant]
US 20200286261A1 · Faramarzi · 2020 [cited by applicant]
US 20200327719A1 · Mason · 2020 [cited by applicant]
US 20210014522A1 · Jung · 2021 [cited by applicant]
US 20210217203A1 · Kim · 2021 [cited by examiner]
US 20220108482A1 · Graziosi · 2022 [cited by applicant]
US 20220108483A1 · Graziosi · 2022 [cited by applicant]
US 20220164994A1 · Joshi · 2022 [cited by applicant]
US 20220329886A1 · Phillips · 2022 [cited by applicant]
US 20230169732A1 · Wickramasinghe · 2023 [cited by applicant]
US 20230171427A1 · Bachhuber · 2023 [cited by applicant]
US 20230297737A1 · Beriot · 2023 [cited by applicant]
EP 3882859A1 · 2021 [cited by applicant]
WO WO2020123252A1 · 2020 [cited by examiner]
Don Fussell; “Subdivision Curves”, University of Texas at Austin, CS384G Computer Graphics Course—Lecture 17—Fall 2010; 20 pgs. [retrieved from https://www.cs.utexas.edu/users/fussell/courses/cs384g-fall2011/lectures/le… [cited by applicant]
Sweldens et al.: “Morning Section: Introductory Material—Building Your Own Wavelets at Home”; Chapter 1 [retrieved from http://www.mat.unimi.it/users/naldi/lifting.pdf]. [cited by applicant]
Garland et al.; “Surface Simplification Using Quadric Error Metrics”; 8 pgs. [retrived from https://www.cs.cmu.edu/~garland/Papers/quadrics.pdf]. [cited by applicant]
Wikipedia—Subdivision surface ; 5 pgs.[retrieved from https://en.wikipedia.org/wiki/Subdivision_surface]. [cited by applicant]
Rahul Sheth; “Open 3D Graphics Compression” ; 2 pgs.[retrieved from https://github.com/amd/rest3d/tree/master/server/o3dgc]. [cited by applicant]
Draco 3D Data Compression; 3 pgs. [retrieved from https://google.github.io/draco/]. [cited by applicant]
Peng et al.; “Technologies for 3D mesh compression: A survey”; J. Vis. Commun. Image R. 16 (2005) pp. 688-733 [retrieved on http://mcl.usc.edu/wp-content/uploads/2014/01/200503-Technologies-for-3D-triangular-mesh-compre… [cited by applicant]
Maglo et al.; “3D mesh compression: survey, comparisons and emerging trends”; ACM Computing Surveys, vol. 9, No. 4, Article 39, Publication date: Sep. 2013; 40 pgs. [retrieved from https://perso.liris.cnrs.fr/glavoue/tr… [cited by applicant]
Wikipedia—Z-order curve; 8 pgs. [retrieved from https://en.wikipedia.org/wiki/Z-order_curve]. [cited by applicant]
“Smoothing”; 55 pgs. [retrieved from https://graphics.stanford.edu/courses/cs468-12-spring/LectureSlides/06_smoothing.pdf]. [cited by applicant]
Liu et al.; “Seamless: Seam erasure and seam-aware decoupling of shape from mesh resolution”; CraGL Computational Reality Creativity and Graphics Lab; 4 pgs. [retrieved from https://cragl.cs.gmu.edu/seamless/]. [cited by applicant]
Sebastian Sylvan, “Fixing Texture Seam With linear Least-Squares”; [retrieved from https://www.sebastiansylvan.com/post/LeastSquaresTextureSeams/]. [cited by applicant]
Michael Bunnell; “Chapter 7. Adaptive Tessellation of Subdivision Surfaces with Displacement Mapping”; Nvidia—GPU Gems 2; 16 pgs. [retrieved from https://developer.nvidia.com/gpugems/gpugems2/part-i-geometric-complexity… [cited by applicant]
Schafer et al.; Dynamic Feature-Adaptive Subdivision; 8 pgs. [retrieved from https://niessnerlab.org/papers/2015/0dynamic/schaefer2015dynamic.pdf]. [cited by applicant]
Pakdel, et al.; “Incremental adaptive loop subdivision” ; Computational Science and Its Applications—ICCS, vol. 3045; May 2004; pp. 237-246 [ retrieved from https://giv.cpsc.ucalgary.ca/publication/c5/]. [cited by applicant]
Jiang et al.; “Rate-distortion Optimized Trellis-Coded Quantization”; IEEE ICME 2007; 4 plgs. [retrieved from https://projet.liris.cnrs.fr/imagine/pub/proceedings/ICME-2007/pdfs/0000468.pdf]. [cited by applicant]
G.J.Sullivan: “Adaptive Quantization Encoding Technique Using an Equal Expected-value Rule”, Joint Video Team, JVT-N011, Hong Kong (Jan. 2005); https://www.google.com/url?sa=t&rct=j&q=&esrc=s&source=web&cd=&ved=2ahUKEwi… [cited by applicant]
Jerry O. Talton III; “A Short Survey of Mesh Simplification Algorithms”; Course Notes for CS 598 MJG, Oct. 2004, Univity of Illinois at Urbana-Champaign; 8 pgs. [retrieved from http://jerrytalton.net/research/t-ssmsa-04… [cited by applicant]
https://graphics.stanford.edu/courses/cs468-10-fall/LectureSlides/08_Simplification.pdf. [cited by applicant]
Floater et al.: “Surface Parameterization: a Tutorial and Survey”; 30 pgs. [retrieved from https://graphics.stanford.edu/courses/cs468-05-fall/Papers/param-survey.pdf]. [cited by applicant]
Snyder et al.; “Iso-charts: sstretch-driven mesh parameterization using spectral analysis”; Computer Science, Eurographics Symposium on Geometric Processing, Jul. 8, 2004 [retrieved from https://www.semanticscholar.org/… [cited by applicant]
Leby et al.; “Least Squares Conformal Maps for Automatic Texture Atlas Generation”; ISA, France; 10 pgs. [retrieved from https://members.loria.fr/Bruno.Levy/papers/LSCM_SIGGRAPH_2002.pdf]. [cited by applicant]
Open Subdiv Introductions; Pixar; [retrieved from https://graphics.pixar.com/opensubdiv/docs/intro.html]. [cited by applicant]
How to compute mesh normals; New York University courses Fall 2002 [retrieved from https://cs.nyu.edu/~perlin/courses/fall2002/meshnormals.html]. [cited by applicant]
Changkun Ou; “Geometry Processing—3 Smoothing”; Ludwig-Maximilians-Universitat—Munich; 63 pgs. [retrieved from https://www.medien.ifi.lmu.de/lehre/ws2122/gp/slides/gp-ws2122-3-smooth.pdf]. [cited by applicant]
Li et al.; “Global Correspondence Optimization for Non-Rigid Registration of Depth Scans”; Applied Geometry Group, ETCH Zurich; The Eurographics Association and Blackwell Publishing Ltd.; 2008 [ retrieved from https://l… [cited by applicant]
Yao et al.; “Quasi-Newton Solver for Robust Non-Rigid Registration” Computer Science-Computer Vision and Pattern Recognition, Apr. 9, 2020 [retrieved on https://arxiv.org/abs/2004.04322]. [cited by applicant]
Sumner et al.; “Embedded Deformation for Shape Manipulation”; Applied Geometry Group, ETH Zurich, 7 pgs. [retrieved from https://people.inf.ethz.ch/~sumnerb/research/embdef/Sumner2007EDF.pdf]. [cited by applicant]
Rambo; “The Conjugate Gradient Method for Solving Linear Systems of Equations”; Department of Mathematics, Saint Mary's College of California, May 2016 [retrieved from http://math.stmarys-ca.edu/wp-content/uploads/2017/… [cited by applicant]
Khalid Sayood; “Adaptive Quantization—Differential Encoding”; [retrieved from https://www.sciencedirect.com/topics/computer-science/adaptive-quantization]. [cited by applicant]
Wikipedia—“Context-adaptive binary arithmetic coding”; [retrieved from https://en.wikipedia.org/wiki/Context-adaptive_binary_arithmetic_coding]. [cited by applicant]
Wikipedia—“Huffman coding”; 2 pgs. [retrieved from https://en.wikipedia.org/wiki/Huffman_coding]. [cited by applicant]
Wikipedia—“Asymmetric numeral systems”; 1 pg. [retrieved from https://en.wikipedia.org/wiki/ Asymmetric_numeral_systems]. [cited by applicant]
Wikipedia—“Universal code (data compression”; 1 pg. [retrieved from https://en.wikipedia.org/wiki/Universal_code_(data_compression)]. [cited by applicant]
https://www.researchgate.net/publication/224359352_Two_Optimizations_of_the_MPEG-4_FAMC_standard_for_Enhanced_Compression_of_Animated_3D_ Meshes/link/0912f50b3802603f34000000/download. [cited by applicant]
Pakdel et al.; “Incremental Adaptive Loop Subdivision”; 11 pgs. [retrived from https://www.researchgate.net/publication/221434740_Incremental_Adaptive _Loop_Subdivision]. [cited by applicant]
Amresh et al.; “Adaptive Subdivisional Schemes for Triangular Meshes”; 10 pgs. [retrieved from https://www.researchgate.net/publication/2554610_Adaptive_Subdivision_Schemes_for_Triangular_Meshes/link/546e58c30cf2b5fc176… [cited by applicant]
Settgast et al.; “Adaptive Tesselation of Subdivision Surfaces in Open SG”; 9 pgs. [retrieved from http://diglib.eg.org/bitstream/handle/10.2312/osg20031418/05settgast.pdf]. [cited by applicant]
Brainerd et al.; “Efficient GPU Rendering of Subdivision Surfaces using Adaptive Quadtrees”; 12 pgs. [retrieved from http://www.graphics.stanford.edu/~niessner/brainerd2016efficient.html]. [cited by applicant]
Fisher et al.; “DiagSplit: Parallel, Crack-free, Adaptive Tessellation for Micropolygon Rendering”; 10 pgs. [retrieved from https://www.cs.cmu.edu/afs/cs/academic/class/15869-f11/www/readings/fisher09_diagsplit.pdf]. [cited by applicant]
Lai et al.; “Near-Optimum Adaptive Tessellation of General Catmull-Clark Subdivision Surfaces”; 9 pgs. [retrieved from https://www.researchgate.net/publication/220954613_Near-Optimum_Adaptive_Tessellation_of_General_Cat… [cited by applicant]
Wu et al.; “An Accurate Error Measure for Adaptive Subdivision Surfaces”; 6 pgs. [retrieved from https://www.cise.ufl.edu/research/SurfLab/papers/05adapsub.pdf]. [cited by applicant]
Patney et al.; “Parallel View-Dependent Tessellation of Catmull-clark Subdivision Surfaces”; 10 pgs.[retrieved from https://anjulpatney.com/docs/papers/2009_Patney_PVT.pdf]. [cited by applicant]
Schwarz et al.; “Fast GPU-based Adaptive Tessellation with CUDA”; 10 pgs. [retrieved from http://research.michael-schwarz.com/publ/files/cudatess-eg09.pdf]. [cited by applicant]
L. Ibarria et J. Rossignac. Dynapack : space-time compression of the 3D animations of triangle meshes with fixed connectivity. In Eurographics Symposium on Computer Animation, pp. 126-133, San Diego, E'tats-Unis, 2003. … [cited by applicant]
N. Stefanoski et J. Ostermann. Connectivity-guided predictive compression of dynamic 3D meshes. In IEEE International Conference on Image Processing, pp. 2973-2976, Atlanta, E'tats-Unis, 2006. [cited by applicant]
J.-H. Yang, C.-S. Kim, et S.-U. Lee. Compression of 3-D triangle mesh sequences based on vertex-wise motion vector prediction. IEEE Transactions on Circuits and Systems for Video Technology, 12(12) :1178-1184, 2002. [cited by applicant]
N. Stefanoski, P. Klie, X. Liu, et J. Ostermann. Scalable linear predictive coding of time-consistent 3D mesh sequences. In The True Vision—Capture, Transmission and Display of 3D Video, pp. 1-4, Kos Island, Greece, 200… [cited by applicant]
N. Stefanoski, X. Liu, P. Klie, et J. Ostermann. Layered predictive coding of time- consistent dynamic 3D meshes using a non-linear predictor. In IEEE International Conference on Image Processing, pp. 109-112, San Anton… [cited by applicant]
V. Libor et S. Vaclav. Coddyac : Connectivity driven dynamic mesh compression. In 3DTV International Conference : True Vision-Capture, Transmission and Display of 3D Video, Kos Island, Greece, 2007. [cited by applicant]
Final Office Action for U.S. Appl. No. 17/661,193 dated Jun. 12, 2024; 23 pages. [cited by applicant]
Graziosi et al.; “[V-PCC] ]EE2.6-related] Mesh Patch Data”, 132; MPEG Meeting; Oct. 12, 2020-Oct. 16, 2020; Online (Motion Picutre Expert Group or ISO/IEC JTC1/SC29/WG11); Oct. 7, 2020, XP030292889 [retrieved from inter… [cited by applicant]
Ma et al.; “Meshes Simplification Based on Reverse Subdivision”, Nov. 29, 2006, SAT 2015 18th International Conference, Austin, TX, Sep. 24-27, 2015; XP047402200; 12 pgs. [cited by applicant]
Sadeghi et al.; “Smooth reverse Subdivision”; Computers and Graphics, Elsevier, GB, vol. 33, No. 3, Jun. 1, 2009; pp. 217-225, XP026448476. [cited by applicant]
Juergen et al.; “Clarification of N18979 EIF Specification Regarding Absolute Waveform Lebelling”, 130. MPEG Meeting; Apr. 20, 2020-Apr. 24, 2020; Alpbach (Motion Picture Expert Group or ISO/IEC JTCI/SC29/WG11), No. M53… [cited by applicant]
International Search Report and Written Opinion for PCT Application No. PCT/US2023/014617, dated Apr. 24, 2023; 18 pgs. [cited by applicant]
M. Sattler, R. Sarlette, et R. Klein. Simple and efficient compression of animation sequences. In Eurographics Symposium on Computer Animation, pp. 209-217, Los Angeles, E'tats-Unis, 2005. [cited by applicant]
I. Guskov et A. Khodakovsky. Wavelet compression of parametrically coherent mesh sequences. In Eurographics Symposium on Computer Animation, pp. 183-192, Grenoble, France, 2004. [cited by applicant]
J.W. Cho, M.S. Kim, S. Valette, H.Y. Jung, et R. Prost. 3D dynamic mesh compression using wavelet-based multiresolution analysis. In IEEE International Conference on Image Processing, pp. 529-532, Atlanta, E'tats-Unis, … [cited by applicant]
K. Mamou, T. Zaharia, F. Preteux, A skinning approach for dynamic 3D mesh com-pression, Computer Animation and Virtual Worlds, vol. 17(3-4), Jul. 2006, p. 337-346. [cited by applicant]
K. Mamou, N. Stefanoski, H. Kirchhoffer, K. Muller, T. Zaharia, F. Preteux, D. Marpe, J. Ostermann, The new MPEG-4/FAMC standard for animated 3D mesh compression, 3DTV Conference (3DTV-CON 2008), Istanbul, Turkey, May 2… [cited by applicant]
K. Mamou, T. Zaharia, F. Preteux, A. Kamoun, F. Payan, M. Antonini. Two optimizations of the MPEG-4 FAMC standard for enhanced compression of animated 3D meshes. IEEE International Conference on Image Processing (2008). [cited by applicant]
ISO/IEC 23090-5 ISO/IEC Information technology—Coded Representation of Immersive Media—Part 5: Visual Volumetric Video-based Coding (V3C) and Video-based Point Cloud Compression (V-PCC). [cited by applicant]
K. Mammou, J. Kim, A. Tourapis, D. Podborski, K. Kolarov, “[V-CG] Apple's Dynamic Mesh Coding CfP Response,” ISO/IEC JTC1/SC29/WG7/m59281, Online, Apr. 2022. [cited by applicant]
A. Tourapis, J. Kim, D. Podborski, K. Mammou, “Base mesh data substream format for VDMC ,” ISO/IEC JTC1/SC29/WG7/m60362, Online, Jul. 2022. [cited by applicant]
Pakdel, et al.; “Incremental adaptive loop subdivision”; ICCSA 2004, LNCS 3045, pp. 237-246, 2004 [retrieved from https://giv.cpsc.ucalgary.ca/publication/c5/]. [cited by applicant]
Kraus; “The Pull-Push Algorithm Revisited—Improvements, Computation of Point Densities, and GPU Implementation”; Proceedings of the Fourth International Conference on Computer Graphics THeory and Applications, pp. 179-1… [cited by applicant]
Office Action for U.S. Appl. No. 17/661,193 dated Dec. 7, 2023; 14 pg. [cited by applicant]
Lee et al.; “Displaced subdivision surfaces”, Proceedings of the ACM SIGOPS 28th Symposium on Operating Systems Principles, ACMPUS27, Jul. 1, 2000, pp. 85-94 (XP059025634). [cited by applicant]
International Search Report and Written Opinion for PCT Application No. PCT/US2023/014516 dated Jul. 24, 2023; 15 pgs. [cited by applicant]
Doggett et al., “Adaptive View Dependent Tessellation of Displacement Maps”, Aug. 2000, Proceedings of the ACM SIGGRAPH/EUROGRAPHICS Workshop on Graphics Hardware, pp. 59-66 (Year:2000). [cited by applicant]
Khaled Mamou; “Volumetric Hierarchical Approximate Convex Decomposition”; [retrieved Feb. 1, 2022 from https://code.google.com/p/v-hacd/]; (2016) 19 pgs. [cited by applicant]
Barrill et al.; “Fast Winding Nos. for Soups and Clouds”; ACM Transaction on Graphics, vol. 37, No. 4, Article 43, Aug. 2018; 12 pgs. [cited by applicant]
Reinforcement learning, Wikipedia, published Feb. 2, 2022. [cited by applicant]
Crassin et al.: “Octree-Based Sparse Voxelization Using the GPU Hardware Rasterizer”; OpenGL Insights; CRC Press; Chapter 22, (Jul. 23, 2012), pp. 303-219. [cited by applicant]
Jyh-Ming Lien et al.: “Approximate convex decomposition of Polyhedra”; Solid and Physical Modeling, Jun. 4, 2007 (XP058273626); pp. 121-131. [cited by applicant]
Mamou, Khaled; Multi-Resolution 3d Mesh Coding in MPEG; Dec. 2011; 2011 Visual Communications and Image Processing; p. 1-4; https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=6116054&tag=1 (Year 2011). [cited by applicant]
Office Action for U.S. Appl. No. 18/166,213 dated May 27, 2025; 26 pgs. [cited by applicant]