Month: June 2010

SIGGRAPH 2010 papers

Kesen’s page of 2010 SIGGRAPH papers is up.

Here’s the list of SIGGRAPH 2010 physics-based animation papers to appear so far:

And a few TOG papers that I understand will be presented there too…

Dynamic Local Remeshing for Elastoplastic SimulationDynamic

SCA 2010 papers

The full list of accepted papers for SCA 2010 has been posted, and Ke-Sen’s collection is here.  Here’s the physics ones:

Efficient Yarn-Based Cloth Simulation With Adaptive Contact Linearization

Yarn-based cloth simulation can improve visual quality but at high computational costs due to the reliance on numerous persistent yarn-yarn contacts to generate material behavior. Finding so many contacts in densely interlinked geometry is a pathological case for traditional collision detection, and the sheer number of contact interactions makes contact processing the simulation bottleneck. In this paper, we propose a method for approximating penalty-based contact forces in yarn-yarn collisions by computing the exact contact response at one time step, then using a rotated linear force model to approximate forces in nearby deformed configurations. Because contacts internal to the cloth exhibit good temporal coherence, sufficient accuracy can be obtained with infrequent updates to the approximation, which are done adaptively in space and time. Furthermore, by tracking contact models we reduce the time to detect new contacts. The end result is a 7- to 9-fold speedup in contact processing and a 4- to 5-fold overall speedup, enabling simulation of character-scale garments.

Efficient Yarn-Based Cloth Simulation With Adaptive Contact Linearization

A Novel Algorithm for Incompressible Flow Using Only A Coarse Grid Projection

Large scale fluid simulation can be difficult using existing techniques due to the high computational cost of using large grids. We present a novel technique for simulating detailed fluids quickly. Our technique coarsens the Eulerian fluid grid during the pressure solve, allowing for a fast implicit update but still maintaining the resolution obtained with a large grid. This allows our simulations to run at a fraction of the cost of existing techniques while still providing the fine scale structure and details obtained with a full projection. Our algorithm scales well to very large grids and large numbers of processors, allowing for high fidelity simulations that would otherwise be intractable.

A Novel Algorithm for Incompressible Flow Using Only A Coarse Grid Projection

A Simple Geometric Model for Elastic Deformations

We advocate a simple geometric model for elasticity: distance between the differential of a deformation and the rotation group. It comes with rigorous differential geometric underpinnings, both smooth and discrete, and is computationally almost as simple and efficient as linear elasticity. Owing to its geometric non-linearity, though, it does not suffer from the usual linearization artifacts. A material model with standard elastic moduli (Lame parameters) falls out naturally, and a minimizer for static problems is easily augmented to construct a fully variational 2nd order time integrator. It has excellent conservation properties even for very coarse simulations, making it very robust. Our analysis was motivated by a number of heuristic, physics-like algorithms from geometry processing (editing, morphing, parameterization, and simulation). Starting with a continuous energy formulation and taking the underlying geometry into account, we simplify and accelerate these algorithms while avoiding common pitfalls. Through the connection with the Biot strain of mechanics, the intuition of previous work that these ideas are “like” elasticity is shown to be spot on.

A Simple Geometric Model for Elastic Deformations