Polyhedrons closest features.
Posted: Thu Feb 16, 2006 7:28 pm
Hello,
First of all, i'd like to say that this is an extraordinary site.Thanks for making it.
I'm makeing a simple physics library as a hobby project.
So far it supports convex bodies and a binch of static planes that make the static geometry, but i need to move to convex body <> convex body iteraction and need to figure the closest features between the polyhedras.
Can i use your library to just find the closest points ?
Is there some usefull routines that i can use, or the narrow phase is competely integrated into your code, and can't be used separated that easy ? Basicaly i need to send my faces of the convex bodies to the routine, and get the two colsest points/features.
I'm sorry if my question is irrelevant, but i just thought there might be an easier way instead of hacking your code, to get the GJK out of it.
Thanks in advance.
First of all, i'd like to say that this is an extraordinary site.Thanks for making it.
I'm makeing a simple physics library as a hobby project.
So far it supports convex bodies and a binch of static planes that make the static geometry, but i need to move to convex body <> convex body iteraction and need to figure the closest features between the polyhedras.
Can i use your library to just find the closest points ?
Is there some usefull routines that i can use, or the narrow phase is competely integrated into your code, and can't be used separated that easy ? Basicaly i need to send my faces of the convex bodies to the routine, and get the two colsest points/features.
I'm sorry if my question is irrelevant, but i just thought there might be an easier way instead of hacking your code, to get the GJK out of it.
Thanks in advance.