Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Yixin Chen 0006

dblp:59/983-6 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
4since 2021 · last 2026
0000-0001-7547-9587ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Graphics, computer vision, multimedia, augmented reality and games · 5 · 2 first-author · 4 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer graphics and multimedia
3 papers
Computer animation and physical simulation · 100%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
GPUs and heterogeneous computing · 100%

Topics — the 8 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computer animation and physical simulation
fluid simulation
1.932025
Fast Subspace Fluid Simulation with a Temporally-Aware Basis · ACM Trans. Graph. 2025
GPU Optimization for High-Quality Kinetic Fluid Simulation · IEEE Trans. Vis. Comput. Graph. 2022
Fast and scalable turbulent flow simulation with two-way coupling · ACM Trans. Graph. 2020
Computer animation and physical simulation
model reduction
0.912025
Fast Subspace Fluid Simulation with a Temporally-Aware Basis · ACM Trans. Graph. 2025
Computer animation and physical simulation › model reduction
subspace simulation
0.912025
Fast Subspace Fluid Simulation with a Temporally-Aware Basis · ACM Trans. Graph. 2025
Computer animation and physical simulation › fluid simulation
solid-fluid coupling
0.412020
Fast and scalable turbulent flow simulation with two-way coupling · ACM Trans. Graph. 2020
Computer animation and physical simulation › fluid simulation
turbulent flow simulation
0.412020
Fast and scalable turbulent flow simulation with two-way coupling · ACM Trans. Graph. 2020
Computer animation and physical simulation › fluid simulation › solid-fluid coupling
two-way coupling
0.412020
Fast and scalable turbulent flow simulation with two-way coupling · ACM Trans. Graph. 2020
GPUs and heterogeneous computing
GPU performance optimization
0.212022
GPU Optimization for High-Quality Kinetic Fluid Simulation · IEEE Trans. Vis. Comput. Graph. 2022
GPUs and heterogeneous computing
GPU computing
0.112020
Fast and scalable turbulent flow simulation with two-way coupling · ACM Trans. Graph. 2020

Methods — techniques the papers use, named apart from their topics

immersed boundary method · 2.0multi-GPU · 1.1adaptive-central-moment multiple-relaxation-time · 1.1randomized SVD · 0.9dynamic mode decomposition · 0.9DMD with control · 0.9lattice boltzmann · 0.9kinetic formulation · 0.9high-order moment relaxation · 0.9
YearPublicationVenuePosition
2026 Fluid Control with Localized Spacetime Windows
abstract
Abstract We present a physics‐based fluid control method utilizing localized spacetime windows, extending force‐based fluid control to substantially larger simulation scales. In many practical editing scenarios, user‐specified objectives affect only a small region of an otherwise satisfactory simulation, resulting in optimal control force distributions that are highly sparse in both space and time. However, existing optimization‐based fluid control methods typically solve for control forces over the entire spacetime domain, leading to unnecessarily high computational cost and poor scalability. Motivated by this observation, we restrict optimization to localized spacetime regions surrounding the edit of interest, significantly reducing the dimensionality of the control problem. Within this framework, control forces are parameterized on a coarse “floating” background grid, decoupling control degrees of freedom from simulation resolution and promoting smooth, physically plausible forces. We further analyze spacetime‐window selection as a joint spatial‐temporal problem. While the full problem can be formulated as a 2D search over spatial and temporal window extents, practical workflows can often leverage user‐specified spatial regions and lightweight temporal‐window selection strategies to reduce search cost. Our method enables a range of intuitive editing tasks, where sparse user inputs can induce coherent motion in surrounding fluid structures. We demonstrate the effectiveness and efficiency of our method with various 2D and 3D particle‐based free‐surface simulation examples.
Yixin Chen 0006, David I. W. Levin, Timothy R. Langlois
Comput. Graph. Forum1
2025 Fast Subspace Fluid Simulation with a Temporally-Aware Basis
abstract
We present a novel reduced-order fluid simulation technique leveraging Dynamic Mode Decomposition (DMD) to achieve fast, memory-efficient, and user-controllable subspace simulation. We demonstrate that our approach combines the strengths of both spatial reduced order models (ROMs) as well as spectral decompositions. By optimizing for the operator that evolves a system state from one timestep to the next, rather than the system state itself, we gain both the compressive power of spatial ROMs as well as the intuitive physical dynamics of spectral methods. The latter property is of particular interest in graphics applications, where user control of fluid phenomena is of high demand. We demonstrate this in various applications including spatial and temporal modulation tools and fluid upscaling with added turbulence. We adapt DMD for graphics applications by reducing computational overhead, incorporating user-defined force inputs, and optimizing memory usage with randomized SVD. The integration of OptDMD and DMD with Control (DMDc) facilitates noise-robust reconstruction and real-time user interaction. We demonstrate the technique's robustness across diverse simulation scenarios, including artistic editing, time-reversal, and super-resolution. Through experimental validation on challenging scenarios, such as colliding vortex rings and boundary-interacting plumes, our method also exhibits superior performance and fidelity with significantly fewer basis functions compared to existing spatial ROMs. Leveraging the inherent linearity of the DMD formulation, we demonstrate a range of diverse applications. This work establishes another avenue for developing real-time, high-quality fluid simulations, enriching the space of fluid simulation techniques in interactive graphics and animation.
Yixin Chen 0006, Jonathan Panuelos, Otman Benchekroun, Eitan Grinspun, Zhecheng Wang 0001
ACM Trans. Graph.2
2023 Multi-agent Path Planning with Heterogenous Interactions in Tight Spaces
abstract
Abstract By starting with the assumption that motion is fundamentally a decision making problem, we use the world‐line concept from Special Relativity as the inspiration for a novel multi‐agent path planning method. We have identified a particular set of problems that have so far been overlooked by previous works. We present our solution for the global path planning problem for each agent and ensure smooth local collision avoidance for each pair of agents in the scene. We accomplish this by modelling the collision‐free trajectories of the agents through 2D space and time as rods in 3D. We obtain smooth trajectories by solving a non‐linear optimization problem with a quasi‐Newton interior point solver, initializing the solver with a non‐intersecting configuration from a modified Dijkstra's algorithm. This space–time formulation allows us to simulate previously ignored phenomena such as highly heterogeneous interactions in very constrained environments. It also provides a solution for scenes with unnaturally symmetric agent alignments without the need for jittering agent positions or velocities.
Vismay Modi, Yixin Chen 0006, Abhishek Madan, Shinjiro Sueda, David I. W. Levin
Comput. Graph. Forum2
2022 GPU Optimization for High-Quality Kinetic Fluid Simulation
abstract
Fluid simulations are often performed using the incompressible Navier-Stokes equations (INSE), leading to sparse linear systems which are difficult to solve efficiently in parallel. Recently, kinetic methods based on the adaptive-central-moment multiple-relaxation-time (ACM-MRT) model [1], [2] have demonstrated impressive capabilities to simulate both laminar and turbulent flows, with quality matching or surpassing that of state-of-the-art INSE solvers. Furthermore, due to its local formulation, this method presents the opportunity for highly scalable implementations on parallel systems such as GPUs. However, an efficient ACM-MRT-based kinetic solver needs to overcome a number of computational challenges, especially when dealing with complex solids inside the fluid domain. In this article, we present multiple novel GPU optimization techniques to efficiently implement high-quality ACM-MRT-based kinetic fluid simulations in domains containing complex solids. Our techniques include a new communication-efficient data layout, a load-balanced immersed-boundary method, a multi-kernel launch method using a simplified formulation of ACM-MRT calculations to enable greater parallelism, and the integration of these techniques into a parametric cost model to enable automated prameter search to achieve optimal execution performance. We also extended our method to multi-GPU systems to enable large-scale simulations. To demonstrate the state-of-the-art performance and high visual quality of our solver, we present extensive experimental results and comparisons to other solvers.
Yixin Chen 0006, Wei Li 0112, Rui Fan 0004, Xiaopei Liu
IEEE Trans. Vis. Comput. Graph.1
2020 Fast and scalable turbulent flow simulation with two-way coupling
abstract
Despite their cinematic appeal, turbulent flows involving fluid-solid coupling remain a computational challenge in animation. At the root of this current limitation is the numerical dispersion from which most accurate Navier-Stokes solvers suffer: proper coupling between fluid and solid often generates artificial dispersion in the form of local, parasitic trains of velocity oscillations, eventually leading to numerical instability. While successive improvements over the years have led to conservative and detail-preserving fluid integrators, the dispersive nature of these solvers is rarely discussed despite its dramatic impact on fluid-structure interaction. In this paper, we introduce a novel low-dissipation and low-dispersion fluid solver that can simulate two-way coupling in an efficient and scalable manner, even for turbulent flows. In sharp contrast with most current CG approaches, we construct our solver from a kinetic formulation of the flow derived from statistical mechanics. Unlike existing lattice Boltzmann solvers, our approach leverages high-order moment relaxations as a key to controlling both dissipation and dispersion of the resulting scheme. Moreover, we combine our new fluid solver with the immersed boundary method to easily handle fluid-solid coupling through time adaptive simulations. Our kinetic solver is highly parallelizable by nature, making it ideally suited for implementation on single- or multi-GPU computing platforms. Extensive comparisons with existing solvers on synthetic tests and real-life experiments are used to highlight the multiple advantages of our work over traditional and more recent approaches, in terms of accuracy, scalability, and efficiency.
Wei Li 0112, Yixin Chen 0006, Mathieu Desbrun, Changxi Zheng, Xiaopei Liu
ACM Trans. Graph.2