using openGJK to measures the distance between any convex polytope, including line segments, triangles, tetrahedrons, cubes and could points. If you need to compute the minimum distance between these objects, than openGJK is for you.
-
Notifications
You must be signed in to change notification settings - Fork 0
using openGJK to measures the distance between any convex polytope, including line segments, triangles, tetrahedrons, cubes and could points. If you need to compute the minimum distance between these objects, than openGJK is for you.
License
lirun-sat/collision-detection
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
using openGJK to measures the distance between any convex polytope, including line segments, triangles, tetrahedrons, cubes and could points. If you need to compute the minimum distance between these objects, than openGJK is for you.
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published