I would like to know if it is possible to do this using GJK alghorythm. I know how to find if polygons intersect and also find closest point on polygon from a given external point. Using Minkovski difference I can find a minimum distance between the two polygons, but my question is: is it possible, somehow, using this min distance to find the actual points on each polygon that correspond to this min distance?

New contributor
Mykolas is a new contributor to this site. Take care in asking for clarification, commenting, and answering. Check out our Code of Conduct.

Your Answer

Mykolas is a new contributor. Be nice, and check out our Code of Conduct.

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.