GJK algorithm distance of closest points in 3D

Version 1.1.0.0 (20,1 ko) par Philippe Lebel
Computes the coordinates where the minimum distance between two convex polyhedrons occure.
5.0
(2)
544 téléchargements
Mise à jour 5 jan. 2018

Afficher la licence

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

Citation pour cette source

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. Récupéré le .

Compatibilité avec les versions de MATLAB
Créé avec R2016a
Compatible avec toutes les versions
Plateformes compatibles
Windows macOS Linux
Catégories
En savoir plus sur Simulation dans Help Center et MATLAB Answers

Community Treasure Hunt

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

Start Hunting!

GJK DISTANCE/

Version Publié le Notes de version
1.1.0.0

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

added thumbnail picture, no code was modified.