I finally got my GJK algorithm working and now i want to be able to find the depth of the intersection of the two polyhedra in a particular direction (the direction of momentum).(adsbygoogle = window.adsbygoogle || []).push({});

I figure the best way would be to find the distance from the origin of the minkowski difference to the hull of the minkowski difference. Is this the most efficient means?

If so, im having several problems which include:

A) efficiently calculating only the vertices located on the hull of the minkowski difference

B) determining which triangular face of the polyhedral hull the ray from the origin will intersect with

I've been told using an MPR algorithm would help me find the correct triangular face to intersect, but i can't find any in depth explanations of that algorithm, especially in 3D.

Any help is greatly appretiated!

**Physics Forums - The Fusion of Science and Community**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Determining intersection depth of two polyhedra in a specific direction?

Can you offer guidance or do you also need help?

Draft saved
Draft deleted

Loading...

Similar Threads for Determining intersection depth |
---|

Java: Which Term determines this is a Sum? |

**Physics Forums - The Fusion of Science and Community**