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

Zahra Forootaninia

dblp:212/6088 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2020
0009-0005-0620-8886ORCID · corroborated

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

Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-author

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 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computer animation and physical simulation
fluid simulation
0.412020
Frequency-domain smoke guiding · ACM Trans. Graph. 2020
Computer animation and physical simulation › fluid simulation
smoke simulation
0.412020
Frequency-domain smoke guiding · ACM Trans. Graph. 2020
Computer animation and physical simulation
deformable body simulation
0.312018
Accurate dissipative forces in optimization integrators · ACM Trans. Graph. 2018
Computer animation and physical simulation
time integration
0.312018
Accurate dissipative forces in optimization integrators · ACM Trans. Graph. 2018
Computer animation and physical simulation › fluid simulation › grid-based fluid simulation
eulerian fluid simulation
0.112020
Frequency-domain smoke guiding · ACM Trans. Graph. 2020

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

low-pass filter · 0.4high-pass filter · 0.4frequency-domain filtering · 0.4momentum conservation · 0.3dissipation functions · 0.3TR-BDF2 integrator · 0.3
YearPublicationVenuePosition
2020 Frequency-domain smoke guiding
abstract
We propose a simple and efficient method for guiding an Eulerian smoke simulation to match the behavior of a specified velocity field, such as a low-resolution animation of the same scene, while preserving the rich, turbulent details arising in the simulated fluid. Our method works by simply combining the high-frequency component of the simulated fluid velocity with the low-frequency component of the input guiding field. We show how to eliminate the grid-aligned artifacts that appear in naive guiding approaches, and provide a frequency-domain analysis that motivates the use of ideal low-pass and high-pass filters to prevent artificial dissipation of small-scale details. We demonstrate our method on many scenes including those with static and moving obstacles, and show that it produces high-quality results with very little computational overhead.
Zahra Forootaninia, Rahul Narain
ACM Trans. Graph.1
2018 Accurate dissipative forces in optimization integrators
abstract
We propose a method for accurately simulating dissipative forces in deformable bodies when using optimization-based integrators. We represent such forces using dissipation functions which may be nonlinear in both positions and velocities, enabling us to model a range of dissipative effects including Coulomb friction, Rayleigh damping, and power-law dissipation. We propose a general method for incorporating dissipative forces into optimization-based time integration schemes, which hitherto have been applied almost exclusively to systems with only conservative forces. To improve accuracy and minimize artificial damping, we provide an optimization-based version of the second-order accurate TR-BDF2 integrator. Finally, we present a method for modifying arbitrary dissipation functions to conserve linear and angular momentum, allowing us to eliminate the artificial angular momentum loss caused by Rayleigh damping.
George E. Brown, Matthew Overby, Zahra Forootaninia, Rahul Narain
ACM Trans. Graph.3