Elie Diaz
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Elie Diaz has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Cem Yuksel
University of Utah, Salt Lake City, UT, USA
6 shared publications - Chris Giles
Roblox, San Mateo, CA, USA
3 shared publications - Eisen Montalvo
University of Utah, United States of America
3 shared publications - Gaurav Bhokare
University of Utah USA
2 shared publications - Anka He Chen
NVIDIA, Kirkland, USA
1 shared publication - Jerry Hsu
University of Utah, Salt Lake City, USA
1 shared publication
Latest Publications
- Open Access
- 14 December 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-9
Implicit Position-Based Fluids
- 14 December 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-9
Open AccessImplicit Position-Based Fluids
- Open Access
- 10 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-2
Crazy Fast Physics! Augmented Vertex Block Descent in Action!
- 10 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-2
Open AccessCrazy Fast Physics! Augmented Vertex Block Descent in Action!
- Open Access
- 27 July 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 44 (4) , 1-12
Augmented Vertex Block Descent
Vertex Block Descent is a fast physics-based simulation method that is unconditionally stable, highly parallelizable, and capable of converging to the implicit Euler solution. We extend it using an augmented Lagrangian formulation to address some of its fundamental limitations. First, we introduce a mechanism to handle hard constraints with infinite stiffness without introducing numerical instabilities. Second, we substantially improve the convergence in the presence of high stiffness ratios. These changes we introduce allow simulating complex contact scenarios involving rigid bodies with stacking and friction, articulated bodies connected with hard constraints, including joints with limited degrees of freedom, and stiff systems interacting with soft bodies. We present evaluations using a parallel GPU implementation that can deliver real-time performance and stable simulations with low iteration counts for millions of objects interacting via collisions, various joint/attachment constraints, and springs of various stiffness. Our results show superior performance, convergence, and stability compared to the state-of-the-art alternatives.
- 27 July 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 44 (4) , 1-12
Open AccessAugmented Vertex Block Descent
Vertex Block Descent is a fast physics-based simulation method that is unconditionally stable, highly parallelizable, and capable of converging to the implicit Euler solution. We extend it using an augmented Lagrangian formulation to address some of its fundamental limitations. First, we introduce a mechanism to handle hard constraints with infinite stiffness without introducing numerical instabilities. Second, we substantially improve the convergence in the presence of high stiffness ratios. These changes we introduce allow simulating complex contact scenarios involving rigid bodies with stacking and friction, articulated bodies connected with hard constraints, including joints with limited degrees of freedom, and stiff systems interacting with soft bodies. We present evaluations using a parallel GPU implementation that can deliver real-time performance and stable simulations with low iteration counts for millions of objects interacting via collisions, various joint/attachment constraints, and springs of various stiffness. Our results show superior performance, convergence, and stability compared to the state-of-the-art alternatives.
- Open Access
- 13 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-10
Real-Time Hair Rendering with Hair Meshes
Hair meshes are known to be effective for modeling and animating hair in computer graphics. We present how the hair mesh structure can be used for efficiently rendering strand-based hair models on the GPU with on-the-fly geometry generation that provides orders of magnitude reduction in storage and memory bandwidth. We use mesh shaders to carefully distribute the computation and a custom texture layout for offloading a part of the computation to the hardware texture units. We also present a set of procedural styling operations to achieve hair strand variations for a wide range of hairstyles and a consistent coordinate-frame generation approach to attach these variations to an animating/deforming hair mesh. Finally, we describe level-of-detail techniques for improving the performance of rendering distant hair models. Our results show an unprecedented level of performance with strand-based hair rendering, achieving hundreds of full hair models animated and rendered at real-time frame rates on a consumer GPU.
- 13 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-10
Open AccessReal-Time Hair Rendering with Hair Meshes
Hair meshes are known to be effective for modeling and animating hair in computer graphics. We present how the hair mesh structure can be used for efficiently rendering strand-based hair models on the GPU with on-the-fly geometry generation that provides orders of magnitude reduction in storage and memory bandwidth. We use mesh shaders to carefully distribute the computation and a custom texture layout for offloading a part of the computation to the hardware texture units. We also present a set of procedural styling operations to achieve hair strand variations for a wide range of hairstyles and a consistent coordinate-frame generation approach to attach these variations to an animating/deforming hair mesh. Finally, we describe level-of-detail techniques for improving the performance of rendering distant hair models. Our results show an unprecedented level of performance with strand-based hair rendering, achieving hundreds of full hair models animated and rendered at real-time frame rates on a consumer GPU.
- Open Access
- 26 July 2023
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 42 (4) , 1-15
Shortest Path to Boundary for Self-Intersecting Meshes
We introduce a method for efficiently computing the exact shortest path to the boundary of a mesh from a given internal point in the presence of self-intersections. We provide a formal definition of shortest boundary paths for self-intersecting objects and present a robust algorithm for computing the actual shortest boundary path. The resulting method offers an effective solution for collision and self-collision handling while simulating deformable volumetric objects, using fast simulation techniques that provide no guarantees on collision resolution. Our evaluation includes complex self-collision scenarios with a large number of active contacts, showing that our method can successfully handle them by introducing a relatively minor computational overhead.
- 26 July 2023
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 42 (4) , 1-15
Open AccessShortest Path to Boundary for Self-Intersecting Meshes
We introduce a method for efficiently computing the exact shortest path to the boundary of a mesh from a given internal point in the presence of self-intersections. We provide a formal definition of shortest boundary paths for self-intersecting objects and present a robust algorithm for computing the actual shortest boundary path. The resulting method offers an effective solution for collision and self-collision handling while simulating deformable volumetric objects, using fast simulation techniques that provide no guarantees on collision resolution. Our evaluation includes complex self-collision scenarios with a large number of active contacts, showing that our method can successfully handle them by introducing a relatively minor computational overhead.
- Open Access
- 23 July 2023
- Published by Association for Computing Machinery (ACM)
- p. 1-2
Super Fast Strand-Based Hair Rendering with Hair Meshes
- 23 July 2023
- Published by Association for Computing Machinery (ACM)
- p. 1-2
Open AccessSuper Fast Strand-Based Hair Rendering with Hair Meshes