Can you tell me guys if you've tested algos for convex polyhedron CD. I wanna know what algo is the fastest for this case and how accurate it is. Preferable hear in this topic about algos which faster than GJK algorithm.
Thx for answers.
Fastest convex polyhedron collision detection algo
-
- Posts: 34
- Joined: Fri Nov 25, 2005 10:09 am
-
- Posts: 23
- Joined: Wed Nov 30, 2005 11:07 am
- Location: China
-
- Posts: 91
- Joined: Wed Jun 10, 2009 4:01 am
Re: Fastest convex polyhedron collision detection algo
I am interseted in how V-Clip calculate penetrate Depth , use SAT to find PD after detect an overlap, or use GJK's EPA algo again?