Search arXivSearch

arXiv · 2412.17144

Augmented Mass-Spring model for Real-Time Dense Hair Simulation

Abstract

We propose a novel Augmented Mass-Spring (AMS) model for real-time simulation of dense hair at strand level. Our approach considers the traditional edge, bending, and torsional degrees of freedom in mass-spring systems, but incorporates an additional one-way biphasic coupling with a ghost rest-shape configuration. Trough multiple evaluation experiments with varied dynamical settings, we show that AMS improves the stability of the simulation in comparison to mass-spring discretizations, preserves global features, and enables the simulation of non-Hookean effects. Using an heptadiagonal decomposition of the resulting matrix, our approach provides the efficiency advantages of mass-spring systems over more complex constitutive hair models, while enabling a more robust simulation of multiple strand configurations. Finally, our results demonstrate that our framework enables the generation, complex interactivity, and editing of simulation-ready dense hair assets in real-time. More details can be found on our project page: https://agrosamad.github.io/AMS/.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jorge Alejandro Amador Herrera, Yi Zhou, Xin Sun, Zhixin Shu, Chengan He, Sören Pirk, Dominik L. Michels. 2025-10-14. Augmented Mass-Spring model for Real-Time Dense Hair Simulation. https://arxiv.org/abs/2412.17144

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

KEEP EXPLORING

Related papers

Constrained Program Generation for 3D Reaction Animation with a 0.8B Model

Visualizing a chemical reaction requires making its molecular changes visible while keeping the animation faithful to the stated chemistry. Equations, structural diagrams and molecular viewers provide complementary descriptions, but assembling an interactive three-dimensional explanation still requires specifying the changes and checking their consistency. We present ChemXRG, a domain-specific language (DSL) framework that addresses this gap by representing a reaction animation as an executable program. Persistent atom identifiers and explicit bond, charge and grouping operations connect the symbolic reaction to the displayed transformation. This shared representation lets generation, verification and rendering operate on the same account of what changes. Given known, atom-mapped reactant and product structures, reaction-grounded constraints fix input-determined facts and restrict action choices; execution checks validate the resulting transformation before geometry and frames are constructed. We implement this paradigm with a reaction-program corpus and ChemQwen, a trained 0.8B DSL generator. Paired and component evaluations show improved compiler acceptance and normalized full-program agreement under input-conditioned constraints, while identifying remaining failures that require execution checks. A public browser application demonstrates the connection from symbolic reaction descriptions to inspectable programs and interactive 3D animations.

cs.GR

NaRPA: Navigation and Rendering Pipeline for Astronautics

This paper presents the applications of scientific ray-tracing in modeling and simulating light transport for space-borne image data generation. A ray-tracing engine, the Navigation and Rendering Pipeline for Astronautics (NaRPA), is introduced as a rendering framework to generate virtual datasets and support simulations for robust navigation pipelines. Sensor and environment models that enable the synthesis of space-to-space and ground-to-space virtual observations are presented. The work demonstrates the capabilities of simulating passive and active vision-based sensors using NaRPA to facilitate the design, testing, and verification of aerospace visual navigation algorithms. Additionally, the paper describes a velocimeter LiDAR model and its statistical validation with experimental data.

cs.GR

VoroUDF: Meshing Unsigned Distance Fields with Voronoi Optimization

We present VoroUDF, an algorithm for reconstructing high-quality triangle meshes from Unsigned Distance Fields (UDFs). Our algorithm supports non-manifold geometry, sharp features, and open boundaries, without relying on error-prone inside/outside estimation, restrictive look-up tables nor topologically noisy optimization. Unlike fixed-grid approaches, our Voronoi-based formulation optimizes a set of movable seeds that travel freely along the iso-surface, jointly minimizing a tangent-plane fitting energy, driven by a fixed set of surface samples queried once from the UDF and its gradient, and a repulsion energy that keeps the seeds evenly distributed. It achieves significantly improved topological consistency and geometric fidelity compared to existing methods, while producing lightweight meshes suitable for downstream real-time and interactive applications.

cs.GR