Algorithm for Finding the Domain Intersection of a Set of Polytopes

The modified version of GJK algorithm for finding a common point of two polytopes is considered. Knowing this point and using the duality theorem the intersection of two polytopes can be found. Considering polytopes in pairs, we can find an intersection region of m polytopes.