Defined in File sat_2d.hpp
Check if 2 convex polygons intersect using the SAT algorithm.
faster than boost::geometry::overlap() but speed decline sharply as vertices increase