Ruicheng Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Ruicheng Wang has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- Bo Zhu
Georgia Institute of Technology, Atlanta, USA
5 shared publications - Sinan Wang
Georgia Institute of Technology, Atlanta, USA
5 shared publications - Zhiqi Li
Georgia Institute of Technology, Atlanta, USA
4 shared publications - Jinjin He
Georgia Institute of Technology, Atlanta, USA
3 shared publications - Yuchen Sun
Georgia Institute of Technology, Atlanta, USA
3 shared publications - Bin Wang
Beijing Institute for General Artificial Intelligence, Beijing, China
2 shared publications
Latest Publications
- Open Access
- 30 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-12
Unified Long-Short Flow Maps for Fast Generation
- 30 November 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-12
Open AccessUnified Long-Short Flow Maps for Fast Generation
- Open Access
- 9 November 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 45 (6) , 1-20
Hamiltonian Two-Way Coupling of Nonlinear Waves and 3D Flows
Simulating large-scale free-surface flow by coupling a localized 3D fluid solver to a cheaper 2D surface model has long faced a mismatch in wave dynamics: efficient 2D wave models used in graphics are typically either linear or non-dispersive. These models are fast, simple, and accurate for calm, small-amplitude seas, but coupling them to strongly nonlinear 3D solvers produces visible reflections and artifacts at the 2D-3D interface. We address this problem by introducing a nonlinear and dispersive 2D wave model based on the canonical Zakharov formulation. Its Hamiltonian structure enables canonically consistent two-way coupling, allowing information to pass smoothly across the 2D-3D interface. Our 2D solver reduces mean wave-height error by factors of 1.7–5× relative to SWE, BEM, and Airy baselines while running more than 10 3 × faster than BEM; it achieves greater nonlinear accuracy and coupling fidelity than SWE and Airy, with minor losses in speed and stability. Coupling it with a 3D Navier-Stokes solver yields a full system that suppresses visible seam artifacts across a range of experiments, including dispersion-matching and Kelvin-wake tests, and runs over 4× faster than a full-domain GPU NB-FLIP simulation.
- 9 November 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 45 (6) , 1-20
Open AccessHamiltonian Two-Way Coupling of Nonlinear Waves and 3D Flows
Simulating large-scale free-surface flow by coupling a localized 3D fluid solver to a cheaper 2D surface model has long faced a mismatch in wave dynamics: efficient 2D wave models used in graphics are typically either linear or non-dispersive. These models are fast, simple, and accurate for calm, small-amplitude seas, but coupling them to strongly nonlinear 3D solvers produces visible reflections and artifacts at the 2D-3D interface. We address this problem by introducing a nonlinear and dispersive 2D wave model based on the canonical Zakharov formulation. Its Hamiltonian structure enables canonically consistent two-way coupling, allowing information to pass smoothly across the 2D-3D interface. Our 2D solver reduces mean wave-height error by factors of 1.7–5× relative to SWE, BEM, and Airy baselines while running more than 10 3 × faster than BEM; it achieves greater nonlinear accuracy and coupling fidelity than SWE and Airy, with minor losses in speed and stability. Coupling it with a 3D Navier-Stokes solver yields a full system that suppresses visible seam artifacts across a range of experiments, including dispersion-matching and Kelvin-wake tests, and runs over 4× faster than a full-domain GPU NB-FLIP simulation.
- Open Access
- 3 July 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 45 (4) , 1-27
Generative Modeling with Orbit-Space Particle Flow Matching
We present Orbit-Space Geometric Probability Paths (OGPP) , a particle-native flow-matching framework for generative modeling of particle systems. OGPP is motivated by two insights: (i) particles are defined up to permutation symmetries , so anonymous indexing inflates per-index target variance and yields curved, hard-to-learn flows; (ii) particles live in physical space, so the flow's terminal velocity has physical meaning and can encode geometric attributes (e.g., surface normals). OGPP instantiates three key components: (1) orbit-space canonicalization of the probability-path terminal endpoint, (2) particle index embeddings for role specialization, and (3) geometric probability paths with arc-length-aware terminal velocities that generate normals as a byproduct of the flow. We evaluate OGPP on minimal-surface benchmarks, where it reduces metric error by up to two orders of magnitude in a single inference step; on ShapeNet, where it matches the state-of-the-art with 5× fewer steps and reaches airplane EMD comparable to DiT-3D with 26× fewer parameters and 5× fewer steps; and on single-shape encoding, where it produces normals and reconstructions competitive with 6D generators while operating entirely in 3D.
- 3 July 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 45 (4) , 1-27
Open AccessGenerative Modeling with Orbit-Space Particle Flow Matching
We present Orbit-Space Geometric Probability Paths (OGPP) , a particle-native flow-matching framework for generative modeling of particle systems. OGPP is motivated by two insights: (i) particles are defined up to permutation symmetries , so anonymous indexing inflates per-index target variance and yields curved, hard-to-learn flows; (ii) particles live in physical space, so the flow's terminal velocity has physical meaning and can encode geometric attributes (e.g., surface normals). OGPP instantiates three key components: (1) orbit-space canonicalization of the probability-path terminal endpoint, (2) particle index embeddings for role specialization, and (3) geometric probability paths with arc-length-aware terminal velocities that generate normals as a byproduct of the flow. We evaluate OGPP on minimal-surface benchmarks, where it reduces metric error by up to two orders of magnitude in a single inference step; on ShapeNet, where it matches the state-of-the-art with 5× fewer steps and reaches airplane EMD comparable to DiT-3D with 26× fewer parameters and 5× fewer steps; and on single-shape encoding, where it produces normals and reconstructions competitive with 6D generators while operating entirely in 3D.
- 15 April 2026
- Published by Wiley in Computer Graphics Forum
- p. e70418
Magnetic Modeling and Simulation for Computer Graphics
Physics‐based modeling and simulation have long been central to computer graphics, enabling the creation of realistic and expressive digital worlds. While extensive progress has been made in simulating physical phenomena of various materials, magnetic interactions, characterized by their long‐range, nonlinear, and material‐dependent nature, have only recently attracted sustained attention. Emerging research has explored magnetic effects across rigid bodies, deformable solids, ferrofluids, and magneto‐viscoelastic materials, leading to a diverse set of models and solvers. However, these efforts have often evolved in isolation, leaving the broader landscape fragmented. This survey provides the first consolidated perspective on magnetic modeling and simulation for computer graphics. We begin by revisiting the fundamentals of magnetostatics and magneto‐mechanical coupling, summarizing the governing equations that underlie existing methods. Building on this foundation, we review numerical algorithms in two complementary aspects: those addressing magnetic fields and magnetization, and those focused on force computation and integration with simulation frameworks. By clarifying common principles and comparing methodological choices, we discuss the successes and challenges of existing literature and outline promising directions for advancing the modeling and simulation of magnetic phenomena.
- 15 April 2026
- Published by Wiley in Computer Graphics Forum
- p. e70418
Magnetic Modeling and Simulation for Computer Graphics
Physics‐based modeling and simulation have long been central to computer graphics, enabling the creation of realistic and expressive digital worlds. While extensive progress has been made in simulating physical phenomena of various materials, magnetic interactions, characterized by their long‐range, nonlinear, and material‐dependent nature, have only recently attracted sustained attention. Emerging research has explored magnetic effects across rigid bodies, deformable solids, ferrofluids, and magneto‐viscoelastic materials, leading to a diverse set of models and solvers. However, these efforts have often evolved in isolation, leaving the broader landscape fragmented. This survey provides the first consolidated perspective on magnetic modeling and simulation for computer graphics. We begin by revisiting the fundamentals of magnetostatics and magneto‐mechanical coupling, summarizing the governing equations that underlie existing methods. Building on this foundation, we review numerical algorithms in two complementary aspects: those addressing magnetic fields and magnetization, and those focused on force computation and integration with simulation frameworks. By clarifying common principles and comparing methodological choices, we discuss the successes and challenges of existing literature and outline promising directions for advancing the modeling and simulation of magnetic phenomena.
- Open Access
- 27 July 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 44 (4) , 1-12
Leapfrog Flow Maps for Real-Time Fluid Simulation
We propose Leapfrog Flow Maps (LFM) to simulate incompressible fluids with rich vortical flows in real time. Our key idea is to use a hybrid velocityimpulse scheme enhanced with leapfrog method to reduce the computational workload of impulse-based flow map methods, while possessing strong ability to preserve vortical structures and fluid details. In order to accelerate the impulse-to-velocity projection, we develop a fast matrix-free Algebraic Multigrid Preconditioned Conjugate Gradient (AMGPCG) solver with customized GPU optimization, which makes projection comparable with impulse evolution in terms of time cost. We demonstrate the performance of our method and its efficacy in a wide range of examples and experiments, such as real-time simulated burning fire ball and delta wingtip vortices.
- 27 July 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 44 (4) , 1-12
Open AccessLeapfrog Flow Maps for Real-Time Fluid Simulation
We propose Leapfrog Flow Maps (LFM) to simulate incompressible fluids with rich vortical flows in real time. Our key idea is to use a hybrid velocityimpulse scheme enhanced with leapfrog method to reduce the computational workload of impulse-based flow map methods, while possessing strong ability to preserve vortical structures and fluid details. In order to accelerate the impulse-to-velocity projection, we develop a fast matrix-free Algebraic Multigrid Preconditioned Conjugate Gradient (AMGPCG) solver with customized GPU optimization, which makes projection comparable with impulse evolution in terms of time cost. We demonstrate the performance of our method and its efficacy in a wide range of examples and experiments, such as real-time simulated burning fire ball and delta wingtip vortices.
- Open Access
- 27 July 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 44 (4) , 1-11
EDGE: Epsilon-Difference Gradient Evolution for Buffer-Free Flow Maps
We propose the Epsilon Difference Gradient Evolution (EDGE) method for accurate flow-map calculation on grids via Hermite interpolation without using velocity buffers. Our key idea is to integrate Gradient Evolution for accurate first-order derivatives and a tetrahedron-based Epsilon Difference scheme to compute higher-order derivatives with reduced memory consumption. EDGE achieves O (1) memory usage, independent of flow map length, while maintaining vorticity preservation comparable to buffer-based methods. We validate our methods across diverse vortical flow scenarios, demonstrating up to 90% backward map memory reduction and significant computational efficiency, broadening the applicability of flow-map methods to large-scale and complex fluid simulations.
- 27 July 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 44 (4) , 1-11
Open AccessEDGE: Epsilon-Difference Gradient Evolution for Buffer-Free Flow Maps
We propose the Epsilon Difference Gradient Evolution (EDGE) method for accurate flow-map calculation on grids via Hermite interpolation without using velocity buffers. Our key idea is to integrate Gradient Evolution for accurate first-order derivatives and a tetrahedron-based Epsilon Difference scheme to compute higher-order derivatives with reduced memory consumption. EDGE achieves O (1) memory usage, independent of flow map length, while maintaining vorticity preservation comparable to buffer-based methods. We validate our methods across diverse vortical flow scenarios, demonstrating up to 90% backward map memory reduction and significant computational efficiency, broadening the applicability of flow-map methods to large-scale and complex fluid simulations.
- Open Access
- 19 July 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 43 (4) , 1-14
An Induce-on-Boundary Magnetostatic Solver for Grid-Based Ferrofluids
This paper introduces a novel Induce-on-Boundary (IoB) solver designed to address the magnetostatic governing equations of ferrofluids. The IoB solver is based on a single-layer potential and utilizes only the surface point cloud of the object, offering a lightweight, fast, and accurate solution for calculating magnetic fields. Compared to existing methods, it eliminates the need for complex linear system solvers and maintains minimal computational complexities. Moreover, it can be seamlessly integrated into conventional fluid simulators without compromising boundary conditions. Through extensive theoretical analysis and experiments, we validate both the convergence and scalability of the IoB solver, achieving state-of-the-art performance. Additionally, a straightforward coupling approach is proposed and executed to showcase the solver's effectiveness when integrated into a grid-based fluid simulation pipeline, allowing for realistic simulations of representative ferrofluid instabilities.
- 19 July 2024
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 43 (4) , 1-14
Open AccessAn Induce-on-Boundary Magnetostatic Solver for Grid-Based Ferrofluids
This paper introduces a novel Induce-on-Boundary (IoB) solver designed to address the magnetostatic governing equations of ferrofluids. The IoB solver is based on a single-layer potential and utilizes only the surface point cloud of the object, offering a lightweight, fast, and accurate solution for calculating magnetic fields. Compared to existing methods, it eliminates the need for complex linear system solvers and maintains minimal computational complexities. Moreover, it can be seamlessly integrated into conventional fluid simulators without compromising boundary conditions. Through extensive theoretical analysis and experiments, we validate both the convergence and scalability of the IoB solver, achieving state-of-the-art performance. Additionally, a straightforward coupling approach is proposed and executed to showcase the solver's effectiveness when integrated into a grid-based fluid simulation pipeline, allowing for realistic simulations of representative ferrofluid instabilities.