Find an algorithm which determines intersection of two inputconvex polygons.
Such intersection can be either empty, consist of one vertex,one segment or can be a convex polygon.
Describe your algorithm precisely, justify its correctness andestimate its complexity.
(*)pseudo algorithm
Expert Answer
An answer will be send to you shortly. . . . .