8ย years, 7ย months ago
Highlights
Community contributions featuredWell I think the answer might be the general case can be formulated as some kind of Linear Programming problem solvable by simplex method (I think this is what's called "Dantzigโฆ
8ย years, 7ย months ago
As an exercise I wrote a solver for a non-peneration constraint of three 1D spheres (intervals). Basically the solution is found by projecting to the nearest surfaces or edges oโฆ
8ย years, 7ย months ago
9ย years ago
What do people usually do when a contact resolution algorithm doesn't succeed in preventing overlap of collision manifolds? I have n-object contact resolution working in 3D usinโฆ
9ย years ago
So I have implemented a sequential impulses collision/contact solver including the contact manifold generation (up to 4 points for a pair of objects) in the 3-dimensional case.โฆ
9ย years, 7ย months ago
Latest Activity
See all in DiscussionsWell I think the answer might be the general case can be formulated as some kind of Linear Programming problem โฆ
8ย years, 7ย months ago
As an exercise I wrote a solver for a non-peneration constraint of three 1D spheres (intervals). Basically the solution is โฆ
8ย years, 7ย months ago
Not sure what the "gradient" is supposed to be here? Here is how I currently solve for normal velocity constraints: โฆ
9ย years ago