I have a mesh made up of several tetrahedrons, I know for sure that there are intersections between some of them: how can I remove these intersections, without generating others? In other terms: if between a couple of tetrahedrons there is an intersection, how can I remove it?
I found these articles: the Method of Separating Axes, the Tetrahedron Overlap Algorithm. But they are only useful for checking if there are intersections or not.
Is there an algorithm to solve this problem?