Skinning mesh animations

James, Doug L.; Twigg, Christopher D.

doi:10.1145/1073204.1073206

Cited by 303 publications

(195 citation statements)

References 26 publications

Supporting

Mentioning

194

Contrasting

Order By: Relevance

“…Lots of static mesh segmentation methods have been proposed, and the readers can refer to Shamir's work [23] for a recent survey on mesh segmentation. Similarly, the animated object decomposition is also important for the following processing algorithms, including rigid bone estimation [11], morphing [15,25], shape interpolation [4], and deformation transfer [14].…”

Section: Related Workmentioning

confidence: 99%

“…Katz et al [12] transformed the given poses into a multi-dimensional space with the property that all of the poses are similar in this space. James and Twigg [11] considered the rotational sequences between corresponding triangles in different poses. Each rotational sequence is mapped to a high-dimensional space and the near-rigid components are found using mean shift clustering in this space.…”

Section: Related Workmentioning

confidence: 99%

“…Segmentation benchmarks also have been proposed for evaluation and comparison of different static object decomposition methods [3]. Similarly, the decomposition of an animated 3d object is a fundamental operation for many geometric modeling applications, including rigid bone estimation [11], morphing [15,25], shape interpolation [4], and deformation transfer [14]. There exist several methods for segmenting nonstatic (e.g., deforming) meshes [11][12][13]21], and these approaches target at different applications due to their different requirements.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Fast hierarchical animated object decomposition using approximately invariant signature

Liao

Xiao

et al. 2011

Vis Comput

View full text Add to dashboard Cite

In this paper, we introduce a novel method to hierarchically decompose the animated 3d object efficiently by utilizing high-dimensional and multi-scale geometric information. The key idea is to treat the animated surface sequences as a whole and extract the near-rigid components from it. Our approach firstly detects a set of the multi-scale feature points on the animated object and computes approximately invariant signature vectors for these points. Then, exploiting both the geometric attributes and the local signature vector of each point (vertex) of the animated object, all the points (vertices) of the animated object can be clustered efficiently using a GPU-accelerated mean shift clustering algorithm. To refine the decomposition boundaries, the Electronic supplementary material The online version of this article (initially-generated boundaries of the animated object can be further improved by applying a boundary refinement technique based on Gaussian Mixture Models (GMMs). Furthermore, we propose a hierarchical decomposition technique using a topology merging strategy without introducing additional computations.Our animated object decomposition approach does not require the topological connectivity of the animated object, thus it can be applied for both triangle mesh and point-sampled geometry sequences. The experimental results demonstrate that our method achieves both good quality results and high performance for the decomposition of animated object.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Fast hierarchical animated object decomposition using approximately invariant signature

Liao

Xiao

et al. 2011

Vis Comput

View full text Add to dashboard Cite

show abstract

“…Compressed mesh animations are attractive for real-time hardwareaccelerated playback of complex mesh deformation phenomena that is otherwise too expensive to compute on the fly [James and Twigg 2005]. Mesh ensembles with numerous distributed mesh elements, such as a garden of flowers or thousands of colliding flags driven by stochastic wind forces, provide a challenge for datadriven animation given the intrinsically high-dimensional dynamic phenomena.…”

Section: Asynchronous Mesh Transitionsmentioning

confidence: 99%

“…Similar to other randomized constraint programming techniques [Selman et al 1996], we either eventually find a feasible τ that eliminates all existing interpenetrations, or we time-out and investigate other transition opportunities. Deformable collision detection is optimized by exploiting the compressed shape representation [James and Twigg 2005], as well as sparse functional dependencies of the noninterpenetration constraints on τ. Thus, in a fraction of the time required to compute the original highquality robust-contact physically based animations, we can compute noninterpenetrating asynchronous transitions to build Mesh Ensemble Motion Graphs for interactive animation of complex high-dimensional, deformation phenomena.…”

Section: Noninterpenetration Constraint Programmingmentioning

confidence: 99%

Mesh ensemble motion graphs

James

Twigg

Cove

et al. 2006

ACM SIGGRAPH 2006 Sketches on - SIGGRAPH '06

Self Cite

View full text Add to dashboard Cite

We describe a technique for using space-time cuts to smoothly transition between stochastic mesh animation clips while subject to physical noninterpenetration constraints. These transitions are used to construct Mesh Ensemble Motion Graphs for interactive datadriven animation of high-dimensional mesh animation datasets, such as those arising from expensive physical simulations of deformable objects blowing in the wind (see Figure 1). We formulate the transition computation as an integer programming problem, and use a novel randomized algorithm to compute transitions subject to noninterpenetration constraints. Asynchronous Mesh TransitionsCompressed mesh animations are attractive for real-time hardwareaccelerated playback of complex mesh deformation phenomena that is otherwise too expensive to compute on the fly [James and Twigg 2005]. Mesh ensembles with numerous distributed mesh elements, such as a garden of flowers or thousands of colliding flags driven by stochastic wind forces, provide a challenge for datadriven animation given the intrinsically high-dimensional dynamic phenomena. However, such examples are appealing candidates for interactive data-driven animation given the high cost of simulation using robust contact handling [Bridson et al. 2002]. Motion graph techniques [Kovar et al. 2002;Lee et al. 2002] provide the basic abstraction for data-driven animation, yet simply splicing together motion clips (to loop or transition within the dataset) leads to transition artifacts, since in high dimensional state spaces it is exceedingly rare to find close transitions, and synchronized transitions introduce undesirable errors with strong spatial correlation.To overcome these limitations, we allow asychonous transitions whereby each mesh subgroup can transition at a different frame so as to minimize its transition error (see Figure 2). In practice this is easily achieved by minimizing a separable objective function Φ( τ) that measures the smoothness of the transition as a function of each of the G mesh groups' transition offset times, τ ∈ Z G . Given a transition τ, we exploit tree-structured scene kinematics to reconstruct the scene shape during the asynchronous transition. Figure 2: Asynchronous transitions allow scene components to transition at slightly different times-yellow indicates mesh groups undergoing transitions-and thus avoid transition artifacts by (i) reducing total transition error, and (ii) diffusing group transition errors in both space and time. Noninterpenetration Constraint ProgrammingAlthough asynchronous mesh ensemble transitions are conceptually similar to space-time cut techniques used for video-based rendering [Kwatra et al. 2003], mesh animations have the added complexity of a 3D embedding for which not all shape configurations are feasible due to interpenetrations. Unfortunately, allowing mesh groups to transition any time they desire can lead to low-quality animations with substantial and unsightly interpenetration artifacts. We address this by minimizing the transition cost ...

show abstract

Optimized motion simplification for crowd animation

Ahn

Oh²,

Wohn³

2006

Computer Animation & Virtual

View full text Add to dashboard Cite

Simulating a huge number of articulate figures in a real-time application is one of the challenging research topics in character animation. Several researchers have tried to improve the performance of animation using the image-based technique such as 'impostor.' This method improved the speed of the animation; however, the accuracy, memory, and interactivity problems related to motion remain to be resolved. In this regard, a 'motion simplification' framework for an articulate figure is proposed, which not only improves the speed of the animation but also conserves the features of the original motion. First, the motion sequence is analyzed using mean shift clustering for the purpose of extracting key postures and automatically generating the priority of joint reductions. These motion analysis results are directly utilized as the input of the proposed posture optimization. The least square method is applied in order to minimize the error between the original and the simplified posture. Finally, how to apply the proposed simplified motion in a real-time application without decreasing the visual quality of the scene is shown. The experimental result shows that the proposed motion simplification can be successfully applied in a realtime animation system.

show abstract

Skinning mesh animations

Cited by 303 publications

References 26 publications

Fast hierarchical animated object decomposition using approximately invariant signature

Fast hierarchical animated object decomposition using approximately invariant signature

Mesh ensemble motion graphs

Optimized motion simplification for crowd animation

Contact Info

Product

Resources

About