Signed distance fields
Thanks for all your help Skorche! I do have one last question though (hopefully)... 
Can I decompose a nonconvex mesh into a series of smaller convex object, then use each existing penetration depth vector as the collision normals? It seems like that would converge to the correct solution over a few frames, which should be fine in practice.

Can I decompose a nonconvex mesh into a series of smaller convex object, then use each existing penetration depth vector as the collision normals? It seems like that would converge to the correct solution over a few frames, which should be fine in practice.
Never mind, that seems to be the correct method. Even if I were to get a nonconvex penetration depth solution working, I found plenty of cases where that isn't the best solution. The only workaround is finding a method that looks at both the minimum penetration depth AND the minimum object rotation, and there's no way I'm going through all that trouble when there are faster and easier solutions.
Using a bunch of connected convex objects seems like it will converge on the correct solution in all the cases I've looked at.
Using a bunch of connected convex objects seems like it will converge on the correct solution in all the cases I've looked at.
Possibly Related Threads...
| Thread: | Author | Replies: | Views: | Last Post | |
| Fast Distance formula? | mikey | 11 | 6,090 |
Nov 23, 2009 10:43 AM Last Post: mikey |
|
| calculating X and Y coordinates w/ an angle and distance | ferum | 13 | 12,731 |
Jun 25, 2008 10:53 PM Last Post: rosenth |
|
| Speed distance velocity and other headaches | Thinker | 6 | 3,231 |
Jul 3, 2003 09:55 AM Last Post: Thinker |
|
| Distance in a shootem up 2D | Mars_999 | 16 | 5,075 |
Mar 2, 2003 03:17 PM Last Post: kberg |
|
| Carbon and edit text fields | Tobi | 1 | 3,126 |
Jun 13, 2002 10:17 PM Last Post: Tobi |
|

