Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2409.06246

Particle-Laden Fluid on Flow Maps

Zhiqi Li·Duowen Chen·Candong Lin·Jinyuan Liu·Bo Zhu
View original source ↗Read source document ↗Export metadata ↓

Abstract

We propose a novel framework for simulating ink as a particle-laden flow using particle flow maps. Our method addresses the limitations of existing flow-map techniques, which struggle with dissipative forces like viscosity and drag, thereby extending the application scope from solving the Euler equations to solving the Navier-Stokes equations with accurate viscosity and laden-particle treatment. Our key contribution lies in a coupling mechanism for two particle systems, coupling physical sediment particles and virtual flow-map particles on a background grid by solving a Poisson system. We implemented a novel path integral formula to incorporate viscosity and drag forces into the particle flow map process. Our approach enables state-of-the-art simulation of various particle-laden flow phenomena, exemplified by the bulging and breakup of suspension drop tails, torus formation, torus disintegration, and the coalescence of sedimenting drops. In particular, our method delivered high-fidelity ink diffusion simulations by accurately capturing vortex bulbs, viscous tails, fractal branching, and hierarchical structures.

Explore related subjects

cs.GRphysics.flu-dyn

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Zhiqi Li, Duowen Chen, Candong Lin, Jinyuan Liu, Bo Zhu. 2024-09-10. Particle-Laden Fluid on Flow Maps. https://doi.org/10.1145/3687916

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

KEEP EXPLORING

Related papers

arXiv2026

KaiNinja: Extending Native 3D Generators to the Part Level

Native 3D generators turn one image into a single mesh. TRELLIS.2 and its peers deliver high-fidelity non-watertight geometry with materials, but the output is one fused object, while downstream work such as editing, rigging and simulation operates on part-level assets. A naive idea is to run a 3D segmentation network on the fused mesh that TRELLIS.2 generates, but such pipelines are slow and bounded by the accuracy of the segmentation. We want a simple way to extend an existing native 3D generator to the part level. But we face a critical problem: the O-Voxel grid stores one sheet of surface per voxel, so a single volume cannot represent the interface where two parts touch, at any resolution. We introduce a dual-volume representation to solve this problem and put forward KaiNinja, a part-level extension of TRELLIS.2 built on a dual-volume form of its O-Voxel representation. KaiNinja keeps the generation speed and quality of TRELLIS.2 while extending it to the part level, with no mask or segmenter in the pipeline. Its training data come from sources of many kinds, including CAD models and assets authored by an LLM-driven agent; to our knowledge it is the first 3D generative model trained on agent-authored part data. Surprisingly, we also find that whole-object fidelity improves over the same backbone fine-tuned on the same dataset. Against part generation pipelines of different paradigms, it lowers whole-object Chamfer distance by 40% and raises strict part F-score by 16%.

cs.GR↗
arXiv2026

HairCS: Reconstructing Strand-Based Hair from Hair Cards

We present an automated pipeline that converts hair-card models into high-quality strand-based hairstyles. Given a collection of textured triangular or quad strips as input, our method produces a strand-based representation that preserves the original hairstyle while enriching it with fine-scale geometric detail and adhering to standard production requirements: strands originate from the scalp, roots are uniformly distributed, and the hair volume is plausibly filled. The resulting assets are directly compatible with strand-based rendering, physics-based simulation, and common grooming modifiers (e.g., clumping, curling, noise) for enhanced realism and artistic control. We validate our approach on a large and diverse set of hairstyles, including short and long hair, curly styles, and complex styles such as buns and ponytails.

cs.GR↗
arXiv2026

RBF Your SDF: Radial Basis Function Interpolation of Signed Distance Fields with Implied Tangent Points

Signed distance fields (SDFs) are a popular implicit representation of geometry. Converting a discrete set of SDF samples into an explicit surface is a fundamental problem in geometry processing. Traditional reconstruction methods such as marching cubes and dual contouring ignore the geometric information carried by samples far from the surface. Recently, Sellán et al.[2023] and several follow-up works leveraged the tangent-sphere structure of SDFs; every sample implies a point on a sphere tangent to the surface. However, these approaches extract the zero-level set via surface reconstruction, which considers only points and normals on the surface and ignores the remaining samples. We propose an approach that marries the tangent-sphere observation with radial basis function interpolation of all data, the implied surface points and the original data. By detecting spheres with extremely constrained tangent points, a configuration geometrically forced at sharp surface features, we identify and preserve surface corners that surface reconstruction-based methods systematically round. A partition-of-unity decomposition allows our method to scale efficiently to large grid resolutions. Our reconstructions improve both Chamfer and Hausdorff accuracy at every tested resolution.

cs.GR↗