GJK algorithm distance of closest points in 3D

Versión 1.1.0.0 (20,1 KB) por Philippe Lebel
Computes the coordinates where the minimum distance between two convex polyhedrons occure.
5.0
(2)
546 descargas
Actualizado 5 ene 2018

Ver licencia

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

Citar como

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. Recuperado .

Compatibilidad con la versión de MATLAB
Se creó con R2016a
Compatible con cualquier versión
Compatibilidad con las plataformas
Windows macOS Linux
Categorías
Más información sobre Simulation en Help Center y MATLAB Answers.

Community Treasure Hunt

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

Start Hunting!

GJK DISTANCE/

Versión Publicado Notas de la versión
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.