GJK algorithm distance of closest points in 3D

Computes the coordinates where the minimum distance between two convex polyhedrons occure.
Updated 5 Jan 2018

View License

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.

Cite As

Philippe Lebel (2024). GJK algorithm distance of closest points in 3D (https://www.mathworks.com/matlabcentral/fileexchange/62429-gjk-algorithm-distance-of-closest-points-in-3d), MATLAB Central File Exchange. Retrieved .

MATLAB Release Compatibility
Created with R2016a
Compatible with any release
Platform Compatibility
Windows macOS Linux
Find more on Simulation in Help Center and MATLAB Answers

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!
Version Published Release Notes

Updated for a case where we instantly converge and a variable was not assigned.

added thumbnail picture, no code was modified.