Collision & contacts <=?=> LCP

[ljb]

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!

[bone]

If you want to solve for contacts, you need to solve an MLCP (mixed linear complementarity problem).

[ljb]

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

[bone]

A lot of people seem to learn from Box2D by extending it into 3D.

[bone]

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

[ljb]

Thank your help!

[ljb]

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!