You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Currently the GPU SAT clipping implementation for convex-convex collision detection only works fast between convexes with few edges, such as boxes and tetrahedra. Many edge-edge tests slows down the simulation a lot.
We could add a GJK/EPA style collision detection, with persistent contact caches.
Another thing to try it to use the Gauss map optimization, reducing the number of edge-edge cases.
The text was updated successfully, but these errors were encountered:
Currently the GPU SAT clipping implementation for convex-convex collision detection only works fast between convexes with few edges, such as boxes and tetrahedra. Many edge-edge tests slows down the simulation a lot.
We could add a GJK/EPA style collision detection, with persistent contact caches.
Another thing to try it to use the Gauss map optimization, reducing the number of edge-edge cases.
The text was updated successfully, but these errors were encountered: