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)
다운로드 수: 542
업데이트 날짜: 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.