Eurographics 2020

Local Bases for Model-reduced Smoke Simulations

Olivier Mercier, Derek Nowrouzezahrai

We present a flexible model reduction method for simulating incompressible fluids. We derive a novel vector field basis composed of localized basis flows that have simple analytic forms and can be tiled on regular lattices, avoiding the use of complicated data structures or neighborhood queries. Local basis flow interactions can be precomputed and reused to simulate fluid dynamics on any simulation domain without additional overhead. We introduce heuristic simulation dynamics tailored to our basis and derived from a projection of the Navier-Stokes equations to produce physically plausible motion, exposing intuitive parameters to control energy distribution across scales. Our basis can adapt to curved simulation boundaries, can be coupled with dynamic obstacles, and offers simple adjustable trade-offs between speed and visual resolution.

Local Bases for Model-reduced Smoke Simulations

Displacement-Correlated XFEM for Simulating Brittle Fracture

Floyd M. Chitalu, Qinghai Miao, Kartic Subr, Taku Komura

We present a remeshing-free brittle fracture simulation method under the assumption of quasi-static linear elastic fracture mechanics (LEFM). To achieve this, we devise two algorithms. First, we develop an approximate volumetric simulation, based on the extended Finite Element Method (XFEM), to initialize and propagate Lagrangian crack-fronts. We model the geometry of fracture explicitly as a surface mesh, which allows us to generate high-resolution crack surfaces that are decoupled from the resolution of the deformation mesh. Our second contribution is a mesh cutting algorithm, which produces fragments of the input mesh using the fracture surface. We do this by directly operating on the half-edge data structures of two surface meshes, which enables us to cut general surface meshes including those of concave polyhedra and meshes with abutting concave polygons. Since we avoid triangulation for cutting, the connectivity of the resulting fragments is identical to the (uncut) input mesh except at edges introduced by the cut. We evaluate our simulation and cutting algorithms and show that they outperform state-of-the-art approaches both qualitatively and quantitatively.

Displacement-Correlated XFEM for Simulating Brittle Fracture

Mixing Yarns and Triangles in Cloth Simulation

Juan J. Casafranca, Gabriel Cirio, Alejandro Rodríguez, Eder Miguel, Miguel A. Otaduy

This paper presents a method to combine triangle and yarn models in cloth simulation, and hence leverage their best features. The majority of a garment uses a triangle-based model, which reduces the overall computational and memory cost. Key areas of the garment use a yarn-based model, which elicits rich effects such as structural nonlinearity and plasticity. To combine both models in a seamless and robust manner, we solve two major technical challenges. We propose an enriched kinematic representation that augments triangle-based deformations with yarn-level details. Naive enrichment suffers from kinematic redundancy, but we devise an optimal kinematic filter that allows a smooth transition between triangle and yarn models. We also introduce a preconditioner that resolves the poor conditioning produced by the extremely different inertia of triangle and yarn nodes. This preconditioner deals effectively with rank deficiency introduced by the kinematic filter. We demonstrate that mixed yarns and triangles succeed to efficiently capture rich effects in garment fit and drape.

Mixing Yarns and Triangles in Cloth Simulation

Binary Ostensibly-Implicit Trees for Fast Collision Detection

Floyd M. Chitalu, Christophe Dubach, Taku Komura

We present a simple, efficient and low-memory technique, targeting fast construction of bounding volume hierarchies (BVH) for broad-phase collision detection. To achieve this, we devise a novel representation of BVH trees in memory. We develop a mapping of the implicit index representation to compact memory locations, based on simple bit-shifts, to then construct andevaluate bounding volume test trees (BVTT) during collision detection with real-time performance. We model the topology of the BVH tree implicitly as binary encodings which allows us to determine the nodes missing from a complete binary tree using the binary representation of the number of missing nodes. The simplicity of our technique allows for fast hierarchy construction achieving over6×speedup over the state-of-the-art. Making use of these characteristics, we show that not only it is feasible to rebuild the BVH at every frame, but that using our technique, it is actually faster than refitting and more memory efficient.

Binary Ostensibly-Implicit Trees for Fast Collision Detection

A Practical Method for Animating Anisotropic Elastoplastic Materials

Camille Schreck, Chris Wojtan

This paper introduces a simple method for simulating highly anisotropic elastoplastic material behaviors like the dissolution of fibrous phenomena (splintering wood, shredding bales of hay) and materials composed of large numbers of irregularly-shaped bodies (piles of twigs, pencils, or cards). We introduce a simple transformation of the anisotropic problem into an equivalent isotropic one, and we solve this new “fictitious’’ isotropic problem using an existing simulator based on the material point method. Our approach results in minimal changes to existing simulators, and it allows us to re-use popular isotropic plasticity models like the Drucker-Prager yield criterion instead of inventing new anisotropic plasticity models for every phenomenon we wish to simulate.

A Practical Method for Animating Anisotropic Elastoplastic Materials