One popular method for identifying collisions between convex objects is the Gilbert-Johnson-Keerthi (GJK) Algorithm. It is very helpful in computer graphics, physics simulations, and game creation because it is effective and multidimensional. The purpose of this procedure is to determine whether two convex objects intersect or not. It carries the names of the three people who invented... https://www.tpointtech.com/gilbert-johnson-keerthi-algorithm-in-cpp