Design testing criteria for the problem of finding the intersection of two convex polygons.
1. Design testing criteria for the problem of finding the intersection of two convex polygons. given as sequences of points the integer Cartesian plane. The program must also be able to check whether the polygons are convex or not. Take into account. the fact that, even if the vertices have integer coordinates, their intersections may […]