GJK algorithm distance of closest points in 3D

版本 1.1.0.0 (20.1 KB) 作者: Philippe Lebel
Computes the coordinates where the minimum distance between two convex polyhedrons occure.
5.0
(2)
546.0 次下载
更新时间 2018/1/5

查看许可证

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

引用格式

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. 检索来源 .

MATLAB 版本兼容性
创建方式 R2016a
兼容任何版本
平台兼容性
Windows macOS Linux
类别
在 Help Center 和 MATLAB Answers 中查找有关 Simulation 的更多信息

Community Treasure Hunt

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

Start Hunting!

GJK DISTANCE/

版本 已发布 发行说明
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.