Pith. sign in

REVIEW 3 major objections 5 minor 36 references

Motion Estimation Techniques for Volumetric Video Attribute Compression

T0 review · 3 major / 5 minor · reviewed 2026-07-12 · grok-4.5

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Graph-smoothed integer motion plus interpolation-free fractional refinement cuts attribute bitrate for dynamic solid point clouds by tens of percent versus G-PCC, GeS-TM, and V-PCC.

desk verdict Solid G-PCC attribute ME pipeline with real technical novelty, but the headline BD-rate numbers do not match the body tables, so the magnitude of the claim is not self-consistent. read the letter →

arxiv 2607.03576 v1 pith:B2N6EQM3 submitted 2026-07-03 eess.IV cs.CV

Haoran Hong , Eduardo Pavez , Antonio Ortega , Ryosuke Watanabe , Keisuke Nonaka This is my paper · ORCID
classification eess.IVcs.CV
keywords dynamicsolidpointcloudsattributecompressionmotionestimationgraph-basedregularizationfractional-voxelG-PCCinter-prediction
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

Dynamic solid point clouds carry both geometry and color attributes that must be compressed for transmission. Geometry inter-coding already removes a lot of temporal redundancy inside the geometry-based point-cloud compression pipeline, yet attribute inter-coding has lagged, so color rates stay high. This paper supplies a full geometry-based attribute inter-prediction pipeline that first estimates a coherent block-wise integer motion field by matching both color and geometry while regularizing neighboring blocks toward local isometry, then refines that field to fractional-voxel accuracy without ever interpolating a super-resolved cloud. The resulting motion-compensated residuals are fed to the existing transform and entropy coder. On standard MPEG sequences the method beats pure intra G-PCC, the current geometry-based solid test model, and the video-based competitor under both lossless and lossy geometry, with the largest reported average savings reaching roughly 55 percent versus G-PCC when geometry is lossy.

What carries the argument

Interpolation-free fractional-voxel motion estimation (IF-FvME): after graph-based integer motion is fixed, each block’s fractional offset is recovered by solving a convex quadratic program over the probability simplex of 27 neighboring integer predictors, then quantizing the optimal weights back onto a discrete trilinear grid; this supplies fractional-precision compensation without explicit sub-voxel sample generation.

What would settle it

Re-run the identical rate-distortion comparison on sequences dominated by hair, fluttering garments, or soft-tissue deformation; if average BD-rate savings versus G-PCC fall near zero or become negative while residual energy after compensation remains high, the motion model (and therefore the central claim) fails.

Watch

Extended reading notes

Core claim

A two-stage motion estimator that first solves a globally regularized integer-voxel problem (color-geometry hybrid matching plus graph-based isometry preservation across block faces) and then recovers fractional displacements by optimizing trilinear combination weights of neighboring integer predictors yields measurably better attribute residuals than existing G-PCC, GeS-TM, and V-PCC attribute coders, producing average BD-rate reductions of 55.3 percent, 42.3 percent, and 16.5 percent respectively under a common lossy-geometry condition.

Load-bearing premise

Block-level translations that only gently stretch or compress local edge lengths are a good enough motion model for color prediction on solid dynamic clouds; when hair, cloth, or soft tissue move in highly non-rigid ways the residual energy stays large and the reported savings shrink.

Share X Bluesky LinkedIn Reddit HN

Signed reviews

No signed human review yet.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 5 minor

Summary. The paper proposes a geometry-based inter-coding pipeline for attributes of dynamic solid point clouds inside G-PCC. It contributes (i) a graph-based integer-voxel motion estimation (IvME) that jointly uses color-geometry matching and an inter-block isometry regularizer with local rotations (Section IV-C, Eqs. 16–37), (ii) a local color-driven integer refinement (Section IV-D), and (iii) an interpolation-free fractional-voxel ME (IF-FvME) that optimizes convex combination weights of 27 neighboring IvMC predictors via Frank–Wolfe with cube locking, then quantizes to a fractional grid (Section V). Residues are coded with G-PCC RAHT. Experiments on MPEG sequences (GoF=32, low-delay) report gains over G-PCCv23, GeS-TMv3 and V-PCCv24 under both lossless geometry and a fair lossy-geometry isolation that shares V-PCC geometry and recoloring.

Significance. If the quantitative claims hold after correction, the work is a solid incremental advance for geometry-based attribute inter-coding: it supplies an explicit, optimizable motion model that improves on independent block matching and on coarse RAHT-domain MC, and the IF-FvME formulation is a useful 3D generalization of interpolation-free fractional ME. The shared-geometry experimental design (Table IV) is a methodological strength that cleanly isolates attribute coding. The closed-form alternating updates for IvME and the convex relaxation for FvME are clearly derived and implementable. The paper itself notes the limitation of pure translational/isometry motion for highly non-rigid regions (hair, garments), so the contribution is best read as a strong baseline for solid DSPCs rather than a universal solution.

major comments (3)
  1. Abstract and Section VI-C claim average BD-rate savings of 55.3%/42.3%/16.5% over G-PCC/GeS-TM/V-PCC under the common lossy-geometry setting of Table IV. Table V instead reports column averages of -55.2 / -24.27 / -46.9 for Proposed / GeS-TMv3 / V-PCCv24, and the surrounding text states both “16.5% BD-BR savings” vs V-PCC and the table’s -46.9 figure. These numbers are mutually inconsistent; the headline magnitude of the central claim cannot be verified from the manuscript. The authors must recompute BD-rates from a single, fully specified rate-distortion set, publish one coherent table (with per-sequence and average BD-BR of the proposed method relative to each anchor), and align abstract, body text and table.
  2. Section VI-B (lossless geometry) has a parallel inconsistency: abstract-style claims of large gains vs V-PCC appear as +146.4% in Table III (i.e., V-PCC worse), while the lossy-geometry narrative treats V-PCC as competitive. Clarify whether the reported percentages are always “proposed vs anchor” BD-BR (negative = savings) and ensure every abstract number maps to an explicit table entry.
  3. The free parameters (β_p=0.3, β=10, k_max=15, l_max=1, f_max=4, r=1/4, and rate-dependent block sizes 16/32/64) are stated without sensitivity or ablation (Section VI-A). Because the graph regularizer weight β and the hybrid distance weight β_p directly control the motion field that drives the reported gains, at least a short ablation or justification that the chosen values are not sequence-tuned is needed for the quantitative claims to be reproducible.
minor comments (5)
  1. Table I comparison with prior work [18],[19] is useful; add a short note on whether the same G-PCC RAHT backend is used for all three rows so residual-coding differences are not confounded with ME gains.
  2. Equation (58) defines “PRSN”; this is almost certainly PSNR—correct the acronym throughout.
  3. Figure 3/4 captions and axis labels should state units (bpip, dB) and which geometry condition each plot corresponds to; currently the reader must cross-reference Tables II/IV.
  4. Complexity Table VI mixes MATLAB ME with C++ G-PCC; a brief note that absolute times are not directly comparable to pure-C++ anchors would avoid over-interpretation of the 6.7× ratio.
  5. Typographical issues: “V olumetric”, “GeS-TM” vs “GeS-TMv3”, and occasional missing spaces after periods in the introduction.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: empirical codec design with external MPEG anchors and independent RD evaluation; self-citations are prior baselines being extended, not load-bearing definitions of the reported savings.

full rationale

The paper proposes concrete algorithmic components (graph-based IvME via the regularized objective in Eqs. 16/33/37 with hybrid distance (17) and isometry-promoting reg (29); local refinement (39); interpolation-free FvME via Frank-Wolfe on the simplex relaxation (51) followed by quantization to trilinear coefficients (57)) that are fully specified from first principles of block matching, graph Laplacians, and convex optimization. These are then plugged into the G-PCC RAHT pipeline and measured by BD-rate against external, independently implemented anchors (G-PCCv23, GeS-TMv3, V-PCCv24) on public MPEG sequences under controlled lossless/lossy geometry settings (Tables II/IV). The self-citations to the authors' earlier [18],[19] appear only as historical baselines that the new pipeline improves upon (explicitly contrasted in Table I and the introduction); they do not define the motion model, the residual criterion, or the reported savings. There is no fitted parameter that is later called a prediction, no uniqueness theorem imported from the authors, and no self-definitional loop. Number inconsistencies between abstract and body tables are a separate correctness issue, not circularity. The derivation chain is therefore self-contained and non-circular.

Assumptions & free parameters 5 free parameters · 5 assumptions · 2 invented entities

Load-bearing content is algorithmic and empirical: standard graph/ICP/RAHT machinery plus hand-set ME hyperparameters and the modeling choice that block translations with local isometry regularization suffice for attribute MC. No new physical entities; invented pieces are method constructs (graph IvME objective, IF-FvME coefficient optimization).

free parameters (5)
  • β_p (hybrid geometry-color distance weight) = 0.3
    Set to 0.3 in (17); balances geometry vs color in reference matching; not derived from first principles.
  • β (graph regularization weight in IvME) = 10
    Set to 10 in (16); trades fidelity to NN matching against inter-block isometry regularizer.
  • IvME outer/inner iteration limits k_max, l_max = 15 / 1
    k_max=15, l_max=1 chosen for Algorithm 1 optimization schedule.
  • FvME Frank–Wolfe iterations f_max and fractional step r = 4 / 1/4
    f_max=4, r=1/4 control fractional precision and optimizer budget; finer r multiplies candidate cost.
  • Block size by rate region (16/32/64) = 16, 32, 64
    Chosen to control MV overhead vs prediction quality at high/mid/low rates; uniform per rate point.
assumptions (5)
  • domain assumption Decoded geometry is available at encoder and decoder; under lossy geometry, V-PCC recoloring yields the attribute field to be coded.
    Stated in §III pipeline; enables NN search for MC and fair attribute-only comparison.
  • domain assumption Nearest-neighbor mapping of motion-displaced reference attributes is a valid MC operator on irregular voxel sets.
    §IV-B equations (8)–(12); standard in voxel-domain PC MC but approximate under sparse/non-rigid motion.
  • ad hoc to paper Local Euclidean edge preservation on a face-adjacent graph (τ=1) adequately approximates isometry/geodesic preservation for solid voxel surfaces.
    §IV-C2; justifies the graph regularizer (29) and rotation offset via SVD.
  • domain assumption RAHT + arithmetic coding of residuals (G-PCC tools) is an appropriate rate proxy when optimizing MC residual energy.
    §III step 6 and experiments; residual energy is used as coding-oriented objective in (39),(47).
  • standard math Closed-form SVD rotation on SO(3) and linear solve for block translations minimize the stated quadratic IvME objective under alternation.
    §IV-C4 equations (35)–(37); standard block-coordinate descent on quadratic+orthogonal constraints.
invented entities (2)
  • Graph-based IvME objective with inter-block isometry regularizer and local rotations
    purpose: Jointly estimate coherent block translations using color-geometry matching plus smoothness/isometry.
    Core method construct of §IV-C; not a physical entity, but a new optimization formulation relative to independent block ME.
  • Interpolation-free FvME (convex combination of 27 IvMC predictors + Frank–Wolfe + cube locking)
    purpose: Obtain fractional-precision MC without explicit sub-voxel point-cloud interpolation.
    §V; generalizes weighted NN averaging; validated only via RD experiments in this paper.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Motion Estimation Techniques for Volumetric Video Attribute Compression." pith.science (2026). https://pith.science/paper/B2N6EQM3

@misc{pith2026260703576,
  author       = {Pith},
  title        = {Pith review of: Motion Estimation Techniques for Volumetric Video Attribute Compression},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/B2N6EQM3}},
  note         = {Machine review of arXiv:2607.03576}
}
abstract

Point cloud compression relies on techniques to compress both geometry and attributes. Motion-based approaches for dynamic solid point cloud geometry compression within the geometry-based point cloud compression (G-PCC) framework have achieved significant reductions in geometry rate. However, motion-based techniques for attribute compression remain underexplored, making it challenging to achieve significant reductions in the temporal redundancy of attributes. Firstly, this paper proposes a geometry-based inter-coding scheme to compress the attributes of dynamic solid point clouds. Secondly, a graph-based motion-estimation scheme for point-cloud attribute compression is proposed. Thirdly, an interpolation-free fractional-voxel motion estimation method is proposed to refine motion accuracy to fractional-voxel precision. Our experimental results on the MPEG point cloud dataset show that the proposed scheme outperforms G-PCC, GeS-TM, and V-PCC in lossless and lossy geometry conditions. We achieve average bitrate savings of $55.3\%$, $42.3\%$, and $16.5\%$ over G-PCC, GeS-TM, and V-PCC, respectively, under lossy-geometry conditions.

Figures

Figures reproduced from arXiv: 2607.03576 by the authors.

Figure 1
Figure 1. The pipeline of the motion-based inter-coding scheme. The blue [PITH_FULL_IMAGE:figures/full_fig_p004_1.png] view at source ↗
Figure 2
Figure 2. Steps of the proposed FvME for one block. (a) Geometric view: the [PITH_FULL_IMAGE:figures/full_fig_p010_2.png] view at source ↗
Figure 3
Figure 3. Comparison with the baselines on the Table II settings [PITH_FULL_IMAGE:figures/full_fig_p012_3.png] view at source ↗
Figures from the paper (1 more)
Figure 4
Figure 4. Figure 4: Comparison with the anchors on the Table IV settings Our scheme outperforms V-PCC, achieving 16.5% BD￾BR savings on average (Table V), suggesting that working directly in 3D is beneficial. In V-PCC, the generated 2D patches cannot be guaranteed to remain temporally con…

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

36 extracted references

  1. [1]

    V olumivive: An authoring system for adding interactivity to volumetric video,

    Q. Jin, Y . Liu, P. Zhou, B. Han, S. Yarosh, and F. Qian, “V olumivive: An authoring system for adding interactivity to volumetric video,” in 2023 IEEE Conf. on Virtual Reality and 3D User Interfaces Abstracts and Workshops (VRW), pp. 569–570, 2023

    2023

  2. [2]

    Emerging MPEG standards for point cloud compression,

    S. Schwarz, M. Preda, V . Baroncini, M. Budagavi, P. Cesar, P. A. Chou, R. A. Cohen, M. Krivoku ´ca, S. Lasserre, Z. Li, J. Llach, K. Mammou, R. Mekuria, O. Nakagami, E. Siahaan, A. Tabatabai, A. M. Tourapis, and V . Zakharchenko, “Emerging MPEG standards for point cloud compression,”IEEE Journal on Emerging and Selected Topics in Circuits and Systems, vo...

    2019

  3. [3]

    Objective point cloud clas- sification according to density distribution

    D. G. Alexandre Zaghetto and A. T. (Sony), “Objective point cloud clas- sification according to density distribution.” WG7, MPEG 3D Graphics Coding and Haptics, ISO/IEC JTC 1/SC 29/WG 7 m62063 Online - January 2023

    2023

  4. [4]

    An overview of ongoing point cloud compression stan- dardization activities: video-based (V-PCC) and geometry-based (G- PCC),

    D. Graziosi, O. Nakagami, S. Kuma, A. Zaghetto, T. Suzuki, and A. Tabatabai, “An overview of ongoing point cloud compression stan- dardization activities: video-based (V-PCC) and geometry-based (G- PCC),”APSIPA Trans. on Signal and Information Proc., vol. 9, p. e13, 2020

    2020

  5. [5]

    Compression of 3D point clouds using a region-adaptive hierarchical transform,

    R. L. de Queiroz and P. A. Chou, “Compression of 3D point clouds using a region-adaptive hierarchical transform,”IEEE Trans. on Image Processing, vol. 25, no. 8, pp. 3947–3956, 2016

    2016

  6. [6]

    On an improvement of raht to exploit attribute correlation

    S. Lasserre and D. Flynn, “On an improvement of raht to exploit attribute correlation.” input document m47378, ISO/IEC JTC1/SC29/WG11 MPEG, 2019

    2019

  7. [7]

    Region adaptive graph Fourier transform for 3D point clouds,

    E. Pavez, B. Girault, A. Ortega, and P. A. Chou, “Region adaptive graph Fourier transform for 3D point clouds,” in2020 IEEE Intl. Conf. on Image Proc. (ICIP), pp. 2726–2730, 2020

    2020

  8. [8]

    Peer upsampled transform domain prediction for g-pcc,

    W. Wang, Y . Xu, K. Zhang, and L. Zhang, “Peer upsampled transform domain prediction for g-pcc,” in2023 IEEE Intl. Conf. on Multimedia and Expo (ICME), pp. 708–713, 2023

    2023

Show all 36 references
  1. [9]

    Cylindrical coordinates for lidar point cloud compression,

    S. N. Sridhara, E. Pavez, and A. Ortega, “Cylindrical coordinates for lidar point cloud compression,” in2021 IEEE Intl. Conf. on Image Proc. (ICIP), pp. 3083–3087, 2021

    2021

  2. [10]

    Point cloud attribute compression via chroma subsampling,

    S. N. Sridhara, E. Pavez, A. Ortega, R. Watanabe, and K. Nonaka, “Point cloud attribute compression via chroma subsampling,” inICASSP 2022 - 2022 IEEE Intl. Conf. on Acoustics, Speech and Signal Proc. (ICASSP), pp. 2579–2583, 2022

    2022

  3. [11]

    A motion- compensated inter-frame attribute coding scheme for dynamic dense point clouds,

    G. Sandri, F. Thudor, M. Krivoku ´ca, and B. Chupeau, “A motion- compensated inter-frame attribute coding scheme for dynamic dense point clouds,” in2023 IEEE 25th Intl. Workshop on Multimedia Signal Proc. (MMSP), pp. 1–6, 2023

    2023

  4. [12]

    Ges-tm v9: User manual of test model v9 for geometry-based solid point cloud coding,

    M. D. G. C. WG7 and Haptics, “Ges-tm v9: User manual of test model v9 for geometry-based solid point cloud coding,”ISO/IEC JTC 1/SC 29/WG 7 N01102 Geneva, January 2025

    2025

  5. [13]

    Advances in predictive raht for geometric point cloud compression,

    B. Vishwanath, K. Zhang, and L. Zhang, “Advances in predictive raht for geometric point cloud compression,”IEEE Trans. on Image Proc., vol. 34, pp. 2926–2938, 2025

    2025

  6. [14]

    Predictive generalized graph Fourier transform for attribute compression of dynamic point clouds,

    Y . Xu, W. Hu, S. Wang, X. Zhang, S. Wang, S. Ma, Z. Guo, and W. Gao, “Predictive generalized graph Fourier transform for attribute compression of dynamic point clouds,”IEEE Trans. on Circuits and Systems for Video Technology, vol. 31, no. 5, pp. 1968–1982, 2021

    1968

  7. [15]

    Block-based inter- frame prediction for dynamic point cloud compression,

    C. Santos, M. Gonc ¸alves, G. Corr ˆea, and M. Porto, “Block-based inter- frame prediction for dynamic point cloud compression,” in2021 IEEE Intl. Conf. on Image Proc. (ICIP), pp. 3388–3392, 2021

    2021

  8. [16]

    Motion-compensated predictive raht for dynamic point clouds,

    A. L. Souto, R. L. De Queiroz, and C. Dorea, “Motion-compensated predictive raht for dynamic point clouds,”IEEE Trans. on Image Proc., vol. 32, pp. 2428–2437, 2023

    2023

  9. [17]

    Temporal filtering for region adaptive hierarchical transform in geometric point cloud compression,

    B. Vishwanath, Y . Xu, W. Wang, K. Zhang, and L. Zhang, “Temporal filtering for region adaptive hierarchical transform in geometric point cloud compression,” in2023 IEEE Intl. Conf. on Visual Communica- tions and Image Proc. (VCIP), pp. 1–5, 2023

    2023

  10. [18]

    Motion estimation and filtered prediction for dynamic point cloud attribute compression,

    H. Hong, E. Pavez, A. Ortega, R. Watanabe, and K. Nonaka, “Motion estimation and filtered prediction for dynamic point cloud attribute compression,” in2022 Picture Coding Symposium (PCS), pp. 139–143, 2022

    2022

  11. [19]

    Frac- tional motion estimation for point cloud compression,

    H. Hong, E. Pavez, A. Ortega, R. Watanabe, and K. Nonaka, “Frac- tional motion estimation for point cloud compression,” in2022 Data Compression Conf. (DCC), pp. 369–378, 2022

    2022

  12. [20]

    Recent advances on hevc inter-frame coding: From optimization to implementation and beyond,

    Y . Zhang, C. Zhang, R. Fan, S. Ma, Z. Chen, and C.-C. J. Kuo, “Recent advances on hevc inter-frame coding: From optimization to implementation and beyond,”IEEE Trans. on Circuits and Systems for Video Technology, vol. 30, no. 11, pp. 4321–4339, 2020

    2020

  13. [21]

    A 3D motion vector database for dynamic point clouds,

    A. L. Souto, R. L. de Queiroz, and C. Dorea, “A 3D motion vector database for dynamic point clouds,” 2020

    2020

  14. [22]

    G-PCC reference software

    “G-PCC reference software”.” https://github.com/MPEGGroup/ mpeg-pcc-tmc13. Accessed on: May. 20, 2024

    2024

  15. [23]

    Point cloud attribute compression with graph transform,

    C. Zhang, D. Florencio, and C. Loop, “Point cloud attribute compression with graph transform,” in2014 IEEE Intl. Conf. on Image Proc. (ICIP), pp. 2066–2070, IEEE, 2014

  16. [24]

    Adaptive run-length/Golomb-Rice encoding of quantized generalized gaussian sources with unknown statistics,

    H. Malvar, “Adaptive run-length/Golomb-Rice encoding of quantized generalized gaussian sources with unknown statistics,” inData Com- pression Conf. (DCC’06), pp. 23–32, 2006

    2006

  17. [25]

    Motion-compensated compression of dynamic voxelized point clouds,

    R. L. de Queiroz and P. A. Chou, “Motion-compensated compression of dynamic voxelized point clouds,”IEEE Trans. on Image Proc., vol. 26, no. 8, pp. 3886–3895, 2017

    2017

  18. [26]

    Block-based motion estimation speedup for dynamic voxelized point clouds,

    C. Dorea and R. L. de Queiroz, “Block-based motion estimation speedup for dynamic voxelized point clouds,” in2018 25th IEEE Intl. Conf. on Image Proc. (ICIP), pp. 2964–2968, 2018

    2018

  19. [27]

    Local texture and geometry descriptors for fast block-based motion estimation of dynamic voxelized point clouds,

    C. Dorea, E. M. Hung, and R. L. de Queiroz, “Local texture and geometry descriptors for fast block-based motion estimation of dynamic voxelized point clouds,” in2019 IEEE Intl. Conf. on Image Proc. (ICIP), pp. 3721–3725, 2019

    2019

  20. [28]

    Graph-based compression of dynamic 3D point cloud sequences,

    D. Thanou, P. A. Chou, and P. Frossard, “Graph-based compression of dynamic 3D point cloud sequences,”IEEE Trans. on Image Proc., vol. 25, no. 4, pp. 1765–1778, 2016

    2016

  21. [29]

    Design, implementation, and evaluation of a point cloud codec for tele-immersive video,

    R. Mekuria, K. Blom, and P. Cesar, “Design, implementation, and evaluation of a point cloud codec for tele-immersive video,”IEEE Trans. on Circuits and Systems for Video Technology, vol. 27, no. 4, pp. 828– 842, 2017

    2017

  22. [30]

    U-motion: Learned point cloud video compression with u-structured temporal context generation,

    T. Fan, Y . Hu, R. Gong, and Y . Wang, “U-motion: Learned point cloud video compression with u-structured temporal context generation,” 2024

    2024

  23. [31]

    On predictive RAHT for dynamic point cloud coding,

    A. L. Souto and R. L. de Queiroz, “On predictive RAHT for dynamic point cloud coding,” in2020 IEEE Intl. Conf. on Image Proc. (ICIP), pp. 2701–2705, 2020

    2020

  24. [32]

    Graph signal processing-a probabilistic framework,

    C. Zhang, D. Flor ˆencio, and P. A. Chou, “Graph signal processing-a probabilistic framework,”Microsoft Res., Redmond, WA, USA, Tech. Rep. MSR-TR-2015-31, 2015

    2015

  25. [33]

    Octree-based point-cloud compression.,

    R. Schnabel and R. Klein, “Octree-based point-cloud compression.,” PBG@ SIGGRAPH, vol. 3, no. 3, 2006

    2006

  26. [34]

    As-rigid-as-possible surface modeling,

    O. Sorkine and M. Alexa, “As-rigid-as-possible surface modeling,” inProceedings of EUROGRAPHICS/ACM SIGGRAPH Symposium on Geometry Processing, pp. 109–116, 2007

    2007

  27. [35]

    An algorithm for quadratic programming,

    M. Frank and P. Wolfe, “An algorithm for quadratic programming,” Naval Research Logistics Quarterly, vol. 3, no. 1-2, pp. 95–110, 1956

    1956

  28. [36]

    V-PCC reference software

    “V-PCC reference software”.” https://github.com/MPEGGroup/ mpeg-pcc-tmc2. Accessed on: May. 20, 2024

    2024

Pith tools

Reviewed July 12, 2026 · model on record in the stance chip above.