Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.09822

Simulation Methods for Multiphysics Phenomena in Visual Computing

Fabian Löschner·Stefan Rhys Jeske·José Antonio Fernández-Fernández·Jan Bender
View original source ↗Read source document ↗Export metadata ↓

Abstract

Physics simulation is a cornerstone of many computer graphics applications, ranging from video games and virtual reality to visual effects and computational design. The number of techniques for physically-based modeling and animation has thus skyrocketed over the past few decades, facilitating the simulation of a wide variety of materials and physical phenomena. These course notes provide an in-depth introduction to multiphysics simulation methods for computer graphics, covering the mathematical foundations, key algorithms, and practical considerations behind the most widely used approaches. We focus on methods developed by the computer graphics community for simulating various physical phenomena and materials -- including rigid and deformable bodies, fluids, and granular materials -- as well as the interactions between them. For each method, we present the underlying mathematical framework with detailed derivations and discuss how different materials and coupling strategies fit into the formulation. A selection of software frameworks that offer out-of-the-box multiphysics modeling capabilities is also presented. Finally, we touch on emerging trends in physics-based animation, including machine learning-based methods which have become increasingly popular in recent years.

Explore related subjects

cs.GR

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Fabian Löschner, Stefan Rhys Jeske, José Antonio Fernández-Fernández, Jan Bender. 2026-10-07. Simulation Methods for Multiphysics Phenomena in Visual Computing. https://doi.org/10.2312/egt.20261002

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

HistCAD: Constraint-Aware Parametric CAD Histories for Evaluating Editability

Sketch constraints specify geometric conditions for constructing and modifying parametric CAD models. We study whether predicted constraints allow a given history to reproduce the required initial model and support prescribed dimensional edits. We introduce HistCAD, an executable representation and dataset whose Academic and Industrial collections contain 180,495 parametric construction histories with entity-referenced sketch constraints and retained feature operations. Predictors receive these histories with the geometry and feature definitions retained and explicit sketch constraints removed. They generate constraints for every sketch without seeing the edit request. The benchmark compares models built with alternative constraint sets for the same history under the same dimensional edit. An edit succeeds when the model reproduces the required initial geometry, reaches the target value, preserves specified relations and unedited dimensions in the target sketch, and rebuilds through the complete history. A predictor trained on both collections and supplied with descriptions of the input histories achieves overall edit success of 52.4% on Academic and 29.0% on Industrial. Models retaining only endpoint-connectivity constraints in the target sketch and the history's constraints elsewhere can reach the target and rebuild while failing preservation. For all-sketch predictions, we retain the target-sketch prediction and restore the history's constraints in other sketches. More models then reproduce the required initial geometry, and some of these newly matched models complete the edit. HistCAD connects constraint learning to the construction and revision of parametric CAD models.

cs.GR↗
arXiv2026

Event-T2M: Event-level Conditioning for Complex Text-to-Motion Synthesis

Text-to-motion generation has advanced with diffusion models, yet existing systems often collapse complex multi-action prompts into a single embedding, leading to omissions, reordering, or unnatural transitions. In this work, we shift perspective by introducing a principled definition of an event as the smallest semantically self-contained action or state change in a text prompt that can be temporally aligned with a motion segment. Building on this definition, we propose Event-T2M, a diffusion-based framework that decomposes prompts into events, encodes each with a motion-aware retrieval model, and integrates them through event-based cross-attention in Conformer blocks. Existing benchmarks mix simple and multi-event prompts, making it unclear whether models that succeed on single actions generalize to multi-action cases. To address this, we construct HumanML3D-E, the first benchmark stratified by event count. Experiments on HumanML3D, KIT-ML, and HumanML3D-E show that Event-T2M matches state-of-the-art baselines on standard tests while outperforming them as event complexity increases. Human studies validate the plausibility of our event definition, the reliability of HumanML3D-E, and the superiority of Event-T2M in generating multi-event motions that preserve order and naturalness close to ground-truth. These results establish event-level conditioning as a generalizable principle for advancing text-to-motion generation beyond single-action prompts.

cs.GR↗
arXiv2026

SECA: Strict-Elastic Compact Activation for Differentiable Elastoplastic Deformation

Return mapping keeps an exact elastic domain but switches its response tangent at yield, while smoothing laws with a sub-yield tail admit plastic flow below the threshold. We present SECA, a Strict-Elastic Compact Activation method for differentiable elastoplastic simulation. SECA prescribes a bounded $C^2$ activation over a finite positive-overstress interval and integrates it into a Perzyna-type flow law, so the implicit update returns exactly zero plastic increment for sub-yield trials while smoothing the onset. For scalar and proportional isotropic $J_2$ updates we derive an exact decomposition of the plastic-increment discrepancy into finite-width and viscosity contributions, and an explicit algebraic budget for the transition width. The update is embedded in finite-deformation loading histories with contact and complete unloading, and differentiated to released equilibria. Controlled indentation results stay closely matched. In the tested coarse cube-indentation run, where the transition is crossed without intermediate increments, SECA reduces whole-run Newton iterations by 47% and backtracking halvings by 93% against return mapping. A four-method comparison evaluates released-shape error and computational cost across loading partitions, and on a contact scene the path derivative drives a bounded control task to its target in three iterations. Further examples show elastic recovery and residual deformation under compression, tension and bending.

cs.GR↗