Pith. sign in

REVIEW 1 cited by

Sparse Data Driven Mesh Deformation

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1709.01250 v1 pith:DL33DQW3 submitted 2017-09-05 cs.GR

classification cs.GR
keywords deformationmodesglobalincludinglocalizedmeshrepresentationresults
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Example-based mesh deformation methods are powerful tools for realistic shape editing. However, existing techniques typically combine all the example deformation modes, which can lead to overfitting, i.e. using a overly complicated model to explain the user-specified deformation. This leads to implausible or unstable deformation results, including unexpected global changes outside the region of interest. To address this fundamental limitation, we propose a sparse blending method that automatically selects a smaller number of deformation modes to compactly describe the desired deformation. This along with a suitably chosen deformation basis including spatially localized deformation modes leads to significant advantages, including more meaningful, reliable, and efficient deformations because fewer and localized deformation modes are applied. To cope with large rotations, we develop a simple but effective representation based on polar decomposition of deformation gradients, which resolves the ambiguity of large global rotations using an as-consistent-as-possible global optimization. This simple representation has a closed form solution for derivatives, making it efficient for sparse localized representation and thus ensuring interactive performance. Experimental results show that our method outperforms state-of-the-art data-driven mesh deformation methods, for both quality of results and efficiency.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Mesh Variational Autoencoders with Edge Contraction Pooling

    cs.GR 2019-08 conditional novelty 6.0 of 10

    Meshes with shared connectivity are simplified into a hierarchy, and a VAE with graph convolutions and edge-contraction pooling reconstructs unseen deformations with lower error and fewer parameters than prior mesh VAEs.

Pith tools