Parsimonious simplicial intersection algorithm

Intersection algorithms are crucial in many applications, but they may not be robust. Without robustness these algorithms may fail to correctly identify large intersections. To prevent that, this article develops a parsimonious algorithm for the intersection of simplices. This generalizes earlier algorithms on triangle and tetrahedral intersections. This paper outlines the algorithm and its parsimony and proves its consistency. Numerical experiments confirm its applicability.