I'm a green hand.There is a question about LCP.Who can give me some information.
Collision & contacts <=?=> LCP
My english is poor!
Thx!
Collision & contacts <=?=> LCP
-
- Posts: 231
- Joined: Tue Feb 20, 2007 4:56 pm
Re: Collision & contacts <=?=> LCP
If you want to solve for contacts, you need to solve an MLCP (mixed linear complementarity problem).
-
- Posts: 21
- Joined: Fri Oct 14, 2011 6:18 am
Re: Collision & contacts <=?=> LCP
thank !
I need some tutorial and paper.Where can I find?

I need some tutorial and paper.Where can I find?



-
- Posts: 231
- Joined: Tue Feb 20, 2007 4:56 pm
Re: Collision & contacts <=?=> LCP
A lot of people seem to learn from Box2D by extending it into 3D.
-
- Posts: 231
- Joined: Tue Feb 20, 2007 4:56 pm
Re: Collision & contacts <=?=> LCP
Box2D is the first link in this thread, but the whole thread has some good resources to look at:
http://www.bulletphysics.org/Bullet/php ... p?f=6&t=63
http://www.bulletphysics.org/Bullet/php ... p?f=6&t=63
-
- Posts: 21
- Joined: Fri Oct 14, 2011 6:18 am
Re: Collision & contacts <=?=> LCP
Thank your help!



-
- Posts: 21
- Joined: Fri Oct 14, 2011 6:18 am
Re: Collision & contacts <=?=> LCP
I got it!!!!Any box(special OBB) in 3d space is convex,The method of the shortest distance between two convex is quadratic programming.To solve quadratic programming is LCP.
My English is poor!

My English is poor!



