Fastest convex polyhedron collision detection algo

Please don't post Bullet support questions here, use the above forums instead.
Post Reply
XperienS
Posts: 34
Joined: Fri Nov 25, 2005 10:09 am

Fastest convex polyhedron collision detection algo

Post 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.
jiangwei
Posts: 23
Joined: Wed Nov 30, 2005 11:07 am
Location: China

Post by jiangwei »

V-Cilp may be faster than GJK,but I think enhance GJK algorithm is pretty good.
fishboy82
Posts: 91
Joined: Wed Jun 10, 2009 4:01 am

Re: Fastest convex polyhedron collision detection algo

Post 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?
Post Reply