I'm a beginner so sorry if this is a stupid question
I'm trying to implement some collision detection and the most common type I see is SAT, which I believe has a time complexity of O((n+m)^2), where and n and m are the amount of vertices on each polygon.
However, why not turn every side into a line segment, and check if any of the segments are intersecting with the segments in the other polygon? The way I see it is there are going to be n*m comparisons, and each comparison can be done in constant time, so it's faster than SAT and would work with concave polygons.
Again, sorry if this is a stupid question and thanks!