First, I am far from a mathematician, and this question may be easy, if that's the case, please don't hesitate to let me know.
Suppose I have 2 tetrahedra (2 3D simplex), with known
DEFG coordinates in euclidean space.
Is there an algorithm/approach to known whether this tetrahedra intersect, and if so know the volume of that intersection in a general case?
I can imagine that the first question is not hard to solve, e.g. checking if the 4 vertices of a tetrahedron are inside the other one, but there may be smarter approaches, hence I will leave the question there.
EDIT: As pointed out in the comments, the intersection may be a bit more complicated than I assumed.