Skip to content

← ArchivePaper2019

Direct Delta Mush Skinning and Variants

Binh Huy Le, J. P. Lewis

SIGGRAPHIndustrial36 cites1 descendantSkinning

Folds the iterative delta mush smoothing into a single precomputed direct skinning operator, making it real-time and game-ready.

Abstract

A significant fraction of the world's population have experienced virtual characters through games and movies, and the possibility of online VR social experiences may greatly extend this audience. At present, the skin deformation for interactive and real-time characters is typically computed using geometric skinning methods. These methods are efficient and simple to implement, but obtaining quality results requires considerable manual "rigging" effort involving trial-and-error weight painting, the addition of virtual helper bones, etc. The recently introduced Delta Mush algorithm largely solves this rig authoring problem, but its iterative computational approach has prevented direct adoption in real-time engines. This paper introduces Direct Delta Mush, a new algorithm that simultaneously improves on the efficiency and control of Delta Mush while generalizing previous algorithms. Specifically, we derive a direct rather than iterative algorithm that has the same ballpark computational form as some previous geometric weight blending algorithms. Straightforward variants of the algorithm are then proposed to further optimize computational and storage cost with insignificant quality losses. These variants are equivalent to special cases of several previous skinning algorithms. Our algorithm simultaneously satisfies the goals of reasonable efficiency, quality, and ease of authoring.

How to read this

Category
Method: a skinning algorithm
Contributions
  • Derives Direct Delta Mush, a non-iterative skinning operator that folds Delta Mush smoothing into a single precomputed form
  • Achieves a computational form comparable to prior geometric weight-blending methods, making it suitable for real-time engines
  • Proposes variants that further reduce computation and storage cost with insignificant quality loss, and generalizes previous algorithms
Context
Builds directly on Delta Mush (Mancewicz et al., 2014), removing its iterative bottleneck so the rig-authoring benefit can be used in interactive and game contexts.Builds on: Delta Mush: Smoothing Deformations While Preserving Detail
Correctness
The core claim is that an iterative smoother can be reformulated as a precomputed direct operator at little quality cost; the precompute and per-vertex storage are the practical tradeoffs a reader should weigh against the runtime savings.
Clarity
Well-motivated and accessible in intent; a first pass conveys the direct-versus-iterative idea, but the derivation warrants a careful second pass.
How to read it
Read the abstract and intuition first, then do a second pass on the derivation that turns iterative Delta Mush into the direct operator, plus the variants if you care about storage and runtime budgets.

Builds on

Built upon by

Related work

Keywords

This page summarises the entry and links to its original source. The archive never hosts or redistributes the publication itself.Show it in the full archive list →