Page 1 of 1

Fastest convex polyhedron collision detection algo

Posted: Sun Apr 02, 2006 11:25 am
by XperienS
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.

Posted: Wed Sep 09, 2009 5:50 am
by jiangwei
V-Cilp may be faster than GJK,but I think enhance GJK algorithm is pretty good.

Re: Fastest convex polyhedron collision detection algo

Posted: Thu Sep 10, 2009 2:51 am
by fishboy82
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?