Tamar Shinar
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Tamar Shinar has a total of 39 co-authors. Here are the top co-authors by number of shared publications:
Adam W. Bargteil
University of Maryland
6 shared publicationsBen Jones
University of Utah
5 shared publications- Craig Schroeder
University of California Riverside
4 shared publications Ronald Fedkiw
Stanford University, Industrial Light + Magic
4 shared publicationsAndrew Selle
Stanford University
2 shared publicationsApril Martin
University of Utah
2 shared publications
Latest Publications
- Open Access
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-11
Buoyancy-driven Phase Separation in the Material Point Method
- 19 July 2026
- Published by Association for Computing Machinery (ACM)
- p. 1-11
Open AccessBuoyancy-driven Phase Separation in the Material Point Method
- Open Access
- 8 August 2025
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Computer Graphics and Interactive Techniques
- Vol. 8 (4) , 1-25
Singularity-free Twist Limit Constraints for the Ball Joint 47
Ball joints are commonly used in graphics and robotics in the simulation of articulated rigid body systems. The ball joint orientation can be decomposed, non-uniquely, into swing and twist components. In modeling with ball joints, it can be advantageous to include limit constraints on the swing, twist, or both. While many physics engines include such limit constraints, we have found that twist limit constraints, when present, are lacking in robustness, typically due to unhandled singularities in commonly employed swing-twist decompositions, where the twist state is undefined. In this paper, we introduce two novel, robust models of the ball joint twist limit constraint. The first utilizes the Euler angle decomposition of the orientation, which has two singularity points. To robustly handle the twist limit constraint, we propose a novel treatment at singularities based on the physical behavior of a three-hinge system. Thus, our model significantly reduces the dramatic motion that can occur around the singularities, eliminating the need to directly avoid them. Second, we introduce an alternative incremental model that avoids singularities altogether during simulations. In this model, the twist is quantified by integrating the instantaneous twist velocity in time, ensuring that the singularity shifts from one time step to the next and remains far from the current state. We investigate the properties of both proposed models. We demonstrate that both models offer robust and practical solutions to common issues encountered in constraining the motion of ball joints.
- 8 August 2025
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Computer Graphics and Interactive Techniques
- Vol. 8 (4) , 1-25
Open AccessSingularity-free Twist Limit Constraints for the Ball Joint 47
Ball joints are commonly used in graphics and robotics in the simulation of articulated rigid body systems. The ball joint orientation can be decomposed, non-uniquely, into swing and twist components. In modeling with ball joints, it can be advantageous to include limit constraints on the swing, twist, or both. While many physics engines include such limit constraints, we have found that twist limit constraints, when present, are lacking in robustness, typically due to unhandled singularities in commonly employed swing-twist decompositions, where the twist state is undefined. In this paper, we introduce two novel, robust models of the ball joint twist limit constraint. The first utilizes the Euler angle decomposition of the orientation, which has two singularity points. To robustly handle the twist limit constraint, we propose a novel treatment at singularities based on the physical behavior of a three-hinge system. Thus, our model significantly reduces the dramatic motion that can occur around the singularities, eliminating the need to directly avoid them. Second, we introduce an alternative incremental model that avoids singularities altogether during simulations. In this model, the twist is quantified by integrating the instantaneous twist velocity in time, ensuring that the singularity shifts from one time step to the next and remains far from the current state. We investigate the properties of both proposed models. We demonstrate that both models offer robust and practical solutions to common issues encountered in constraining the motion of ball joints.
- Open Access
- 8 August 2025
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Computer Graphics and Interactive Techniques
- Vol. 8 (4) , 1-15
Fast reconstruction of implicit surfaces using convolutional neural networks 51
Recently, Zhao et al. [Zhao et al. 2024 ] proposed a new method for constructing signed distance functions from fluid simulation particles. This method was able to achieve superior surface smoothness, noise reduction, and temporal coherence compared with previous methods. One of the main limitations of the method was its relatively slow construction times, even though it utilized both the CPU and GPU. In this paper, we consider two modifications to this scheme that make the algorithm easier to optimize without introducing any perceptible changes in reconstruction quality, as illustrated in Figure 1 . With these improvements, a surface can be reconstructed from a single fluid simulation with 2M particles in 2.21 seconds, compared with 72.3 seconds for the original method, resulting in a single-frame reconstruction speedup of about 33 × , making the surface reconstruction fast enough for use within a simulation framework. When reconstructing surface for multiple simulation frames together, we achieve a speedup of about 5 × compared with the original. The optimized implementation will be released with the publication.
- 8 August 2025
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Computer Graphics and Interactive Techniques
- Vol. 8 (4) , 1-15
Open AccessFast reconstruction of implicit surfaces using convolutional neural networks 51
Recently, Zhao et al. [Zhao et al. 2024 ] proposed a new method for constructing signed distance functions from fluid simulation particles. This method was able to achieve superior surface smoothness, noise reduction, and temporal coherence compared with previous methods. One of the main limitations of the method was its relatively slow construction times, even though it utilized both the CPU and GPU. In this paper, we consider two modifications to this scheme that make the algorithm easier to optimize without introducing any perceptible changes in reconstruction quality, as illustrated in Figure 1 . With these improvements, a surface can be reconstructed from a single fluid simulation with 2M particles in 2.21 seconds, compared with 72.3 seconds for the original method, resulting in a single-frame reconstruction speedup of about 33 × , making the surface reconstruction fast enough for use within a simulation framework. When reconstructing surface for multiple simulation frames together, we achieve a speedup of about 5 × compared with the original. The optimized implementation will be released with the publication.
- 9 October 2024
- Published by Wiley in Computer Graphics Forum
- Vol. 43 (8)
Reconstruction of implicit surfaces from fluid particles using convolutional neural networks
In this paper, we present a novel network‐based approach for reconstructing signed distance functions from fluid particles. The method uses a weighting kernel to transfer particles to a regular grid, which forms the input to a convolutional neural network. We propose a regression‐based regularization to reduce surface noise without penalizing high‐curvature features. The reconstruction exhibits improved spatial surface smoothness and temporal coherence compared with existing state of the art surface reconstruction methods. The method is insensitive to particle sampling density and robustly handles thin features, isolated particles, and sharp edges.
- 9 October 2024
- Published by Wiley in Computer Graphics Forum
- Vol. 43 (8)
Reconstruction of implicit surfaces from fluid particles using convolutional neural networks
In this paper, we present a novel network‐based approach for reconstructing signed distance functions from fluid particles. The method uses a weighting kernel to transfer particles to a regular grid, which forms the input to a convolutional neural network. We propose a regression‐based regularization to reduce surface noise without penalizing high‐curvature features. The reconstruction exhibits improved spatial surface smoothness and temporal coherence compared with existing state of the art surface reconstruction methods. The method is insensitive to particle sampling density and robustly handles thin features, isolated particles, and sharp edges.
- 24 April 2021
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 33 (17) , e6305
Enabling simulation of high‐dimensional micro‐macro biophysical models through hybrid CPU and multi‐GPU parallelism
Micro‐macro models provide a powerful tool to study the relationship between microscale mechanisms and emergent macroscopic behavior. However, the detailed microscopic modeling requires tracking and evolving a potentially high‐dimensional configuration space at high computational cost. In this work, we present a novel parallel algorithm for simulating a high‐dimensional micro‐macro model of a gliding motility assay. We utilize a holistic approach aligning the data residency and simulation scales with the hybrid CPU and multi‐GPU hardware. Our novel approach achieves a speedup factor of 9.25× over previous GPU‐accelerated micro‐macro methods on the same hardware. Furthermore, by decoupling dependencies in the microstructure update, we are able to efficiently distribute the microstructure over multiple GPUs with minimal overhead. We test on up to four GPUs and observe excellent scaling, suggesting that significant further speedups are achievable with additional GPUs. Our approach enables micro‐macro simulations of higher complexity and resolution than would otherwise be feasible.
- 24 April 2021
- Published by Wiley in Concurrency and Computation: Practice and Experience
- Vol. 33 (17) , e6305
Enabling simulation of high‐dimensional micro‐macro biophysical models through hybrid CPU and multi‐GPU parallelism
Micro‐macro models provide a powerful tool to study the relationship between microscale mechanisms and emergent macroscopic behavior. However, the detailed microscopic modeling requires tracking and evolving a potentially high‐dimensional configuration space at high computational cost. In this work, we present a novel parallel algorithm for simulating a high‐dimensional micro‐macro model of a gliding motility assay. We utilize a holistic approach aligning the data residency and simulation scales with the hybrid CPU and multi‐GPU hardware. Our novel approach achieves a speedup factor of 9.25× over previous GPU‐accelerated micro‐macro methods on the same hardware. Furthermore, by decoupling dependencies in the microstructure update, we are able to efficiently distribute the microstructure over multiple GPUs with minimal overhead. We test on up to four GPUs and observe excellent scaling, suggesting that significant further speedups are achievable with additional GPUs. Our approach enables micro‐macro simulations of higher complexity and resolution than would otherwise be feasible.
- 24 November 2020
- Published by Wiley in Computer Graphics Forum
- Vol. 39 (8) , 55-67
Effective time step restrictions for explicit MPM simulation
Time steps for explicit MPM simulation in computer graphics are often selected by trial and error due to the challenges in automatically selecting stable time step sizes. Our time integration scheme uses time step restrictions that take into account forces, collisions, and even grid‐to‐particle transfers calculated near the end of the time step. We propose a novel set of time step restrictions that allow a time step to be selected that is stable, efficient to compute, and not too far from optimal. We derive the general solution for the sound speed in nonlinear isotropic hyperelastic materials, which we use to enforce the classical CFL time step restriction. We identify a single‐particle instability in explicit MPM integration and propose a corresponding time step restriction in the fluid case. We also propose a reflection‐based boundary condition for domain walls that supports separation and accurate Coulomb friction while preventing particles from penetrating the domain walls.
- 24 November 2020
- Published by Wiley in Computer Graphics Forum
- Vol. 39 (8) , 55-67
Effective time step restrictions for explicit MPM simulation
Time steps for explicit MPM simulation in computer graphics are often selected by trial and error due to the challenges in automatically selecting stable time step sizes. Our time integration scheme uses time step restrictions that take into account forces, collisions, and even grid‐to‐particle transfers calculated near the end of the time step. We propose a novel set of time step restrictions that allow a time step to be selected that is stable, efficient to compute, and not too far from optimal. We derive the general solution for the sound speed in nonlinear isotropic hyperelastic materials, which we use to enforce the classical CFL time step restriction. We identify a single‐particle instability in explicit MPM integration and propose a corresponding time step restriction in the fluid case. We also propose a reflection‐based boundary condition for domain walls that supports separation and accurate Coulomb friction while preventing particles from penetrating the domain walls.
- Open Access
- 28 July 2019
- Published by Association for Computing Machinery (ACM)
- p. 1-57
An introduction to physics-based animation
- 28 July 2019
- Published by Association for Computing Machinery (ACM)
- p. 1-57
Open AccessAn introduction to physics-based animation
- Open Access
- 12 August 2018
- Published by Association for Computing Machinery (ACM)
- Vol. 2, 1
An introduction to physics-based animation
- 12 August 2018
- Published by Association for Computing Machinery (ACM)
- Vol. 2, 1
Open AccessAn introduction to physics-based animation
- Open Access
- 30 July 2018
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 37 (4) , 1-12
An extended partitioned method for conservative solid-fluid coupling
We present a novel extended partitioned method for two-way solid-fluid coupling, where the fluid and solid solvers are treated as black boxes with limited exposed interfaces, facilitating modularity and code reusability. Our method achieves improved stability and extended range of applicability over standard partitioned approaches through three techniques. First, we couple the black-box solvers through a small, reduced-order monolithic system, which is constructed on the fly from input/output pairs generated by the solid and fluid solvers. Second, we use a conservative, impulse-based interaction term to couple the solid and fluid rather than typical pressure-based forces. We show that both of these techniques significantly improve stability and reduce the number of iterations needed for convergence. Finally, we propose a novel boundary pressure projection method that allows for the partitioned simulation of a fully enclosed fluid coupled to a dynamic solid, a scenario that has been problematic for partitioned methods. We demonstrate the benefits of our extended partitioned method by coupling Eulerian fluid solvers for smoke and water to Lagrangian solid solvers for volumetric and thin deformable and rigid objects in a variety of challenging scenarios. We further demonstrate our method by coupling a Lagrangian SPH fluid solver to a rigid body solver.
- 30 July 2018
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 37 (4) , 1-12
Open AccessAn extended partitioned method for conservative solid-fluid coupling
We present a novel extended partitioned method for two-way solid-fluid coupling, where the fluid and solid solvers are treated as black boxes with limited exposed interfaces, facilitating modularity and code reusability. Our method achieves improved stability and extended range of applicability over standard partitioned approaches through three techniques. First, we couple the black-box solvers through a small, reduced-order monolithic system, which is constructed on the fly from input/output pairs generated by the solid and fluid solvers. Second, we use a conservative, impulse-based interaction term to couple the solid and fluid rather than typical pressure-based forces. We show that both of these techniques significantly improve stability and reduce the number of iterations needed for convergence. Finally, we propose a novel boundary pressure projection method that allows for the partitioned simulation of a fully enclosed fluid coupled to a dynamic solid, a scenario that has been problematic for partitioned methods. We demonstrate the benefits of our extended partitioned method by coupling Eulerian fluid solvers for smoke and water to Lagrangian solid solvers for volumetric and thin deformable and rigid objects in a variety of challenging scenarios. We further demonstrate our method by coupling a Lagrangian SPH fluid solver to a rigid body solver.