What is a (computationally) fast way of determining whether two polygons intersect, without actually computing this area of intersection?
- polygon: a counterclockwise simply connected sequence of points.
- intersects: have a nonzero area of overlap.
An example predicate would be that when all segments from p1 are intersected with all segments of p2, there are at least two intersections. But this is an O(N^2) predicate to evaluate.