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

Molin Deng

dblp:377/6873 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
2since 2021 · last 2024
0009-0000-0901-6728ORCID · reported

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

Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 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
2 papers
Computer animation and physical simulation · 100%

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

TopicWeightPapersLastEvidence papers
Computer animation and physical simulation
fluid simulation
1.522024
Eulerian-Lagrangian Fluid Simulation on Particle Flow Maps · ACM Trans. Graph. 2024
An Eulerian Vortex Method on Flow Maps · ACM Trans. Graph. 2024
Computer animation and physical simulation › fluid simulation
eulerian-lagrangian simulation
0.812024
Eulerian-Lagrangian Fluid Simulation on Particle Flow Maps · ACM Trans. Graph. 2024
Computer animation and physical simulation › fluid simulation
incompressible fluid simulation
0.812024
Eulerian-Lagrangian Fluid Simulation on Particle Flow Maps · ACM Trans. Graph. 2024
Computer animation and physical simulation › fluid simulation
vortex methods
0.812024
An Eulerian Vortex Method on Flow Maps · ACM Trans. Graph. 2024

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

poisson solver · 0.8particle-to-grid interpolation · 0.8particle flow maps · 0.8impulse-based solver · 0.8flow map · 0.8bi-directional marching · 0.8
YearPublicationVenuePosition
2024 An Eulerian Vortex Method on Flow Maps
abstract
We present an Eulerian vortex method based on the theory of flow maps to simulate the complex vortical motions of incompressible fluids. Central to our method is the novel incorporation of the flow-map transport equations for line elements , which, in combination with a bi-directional marching scheme for flow maps, enables the high-fidelity Eulerian advection of vorticity variables. The fundamental motivation is that, compared to impulse m , which has been recently bridged with flow maps to encouraging results, vorticity ω promises to be preferable for its numerical stability and physical interpretability. To realize the full potential of this novel formulation, we develop a new Poisson solving scheme for vorticity-to-velocity reconstruction that is both efficient and able to accurately handle the coupling near solid boundaries. We demonstrate the efficacy of our approach with a range of vortex simulation examples, including leapfrog vortices, vortex collisions, cavity flow, and the formation of complex vortical structures due to solid-fluid interactions.
Yitong Deng, Molin Deng, Hong-Xing Yu, Junwei Zhou 0001, Duowen Chen 0003, Taku Komura, Jiajun Wu 0001, Bo Zhu 0002
ACM Trans. Graph.3
2024 Eulerian-Lagrangian Fluid Simulation on Particle Flow Maps
abstract
We propose a novel Particle Flow Map (PFM) method to enable accurate long-range advection for incompressible fluid simulation. The foundation of our method is the observation that a particle trajectory generated in a forward simulation naturally embodies a perfect flow map. Centered on this concept, we have developed an Eulerian-Lagrangian framework comprising four essential components: Lagrangian particles for a natural and precise representation of bidirectional flow maps; a dual-scale map representation to accommodate the mapping of various flow quantities; a particle-to-grid interpolation scheme for accurate quantity transfer from particles to grid nodes; and a hybrid impulse-based solver to enforce incompressibility on the grid. The efficacy of PFM has been demonstrated through various simulation scenarios, highlighting the evolution of complex vortical structures and the details of turbulent flows. Notably, compared to NFM, PFM reduces computing time by up to 49 times and memory consumption by up to 41%, while enhancing vorticity preservation as evidenced in various tests like leapfrog, vortex tube, and turbulent flow.
Junwei Zhou 0001, Duowen Chen 0003, Molin Deng, Yitong Deng, Yuchen Sun 0002, Shiying Xiong, Bo Zhu 0002
ACM Trans. Graph.3