GJK algorithm distance of closest points in 3D
Computes the coordinates where the minimum distance between two convex polyhedrons occure.
You are now following this Submission
- You will see updates in your followed content feed
- You may receive emails, depending on your communication preferences
It uses the GJK algorithm to find the point, on the minkowsky negative sum of the polyhedrons, closest to the origin. It then uses barycentric coordinates to find the the points on those polyhedrons belonging to the selected point on the minkowsky negative sum.
A video made by Casey Muratori as well as an implementation of the GJK collision detection made by Matthew Sheen right here on matlabcentral have helped me a lot to understand what I was doing.
https://mollyrocket.com/849
https://www.mathworks.com/matlabcentral/fileexchange/57907-fast-3d-collision-detection-gjk-algorithm
Cite As
Philippe Lebel (2026). GJK algorithm distance of closest points in 3D (https://au.mathworks.com/matlabcentral/fileexchange/62429-gjk-algorithm-distance-of-closest-points-in-3d), MATLAB Central File Exchange. Retrieved .
Acknowledgements
Inspired by: Fast 3D Collision Detection -- GJK algorithm, Distance between a point and a triangle in 3D, geom3d, platonic_solid, Patch Slim (patchslim.m)
General Information
- Version 1.1.0.0 (20.1 KB)
MATLAB Release Compatibility
- Compatible with any release
Platform Compatibility
- Windows
- macOS
- Linux
