Question: Find an algorithm which determines intersection of two input convex polygons. Such intersection can be either empty, consist of one vertex, one segment or can
Find an algorithm which determines intersection of two input convex 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 and estimate its complexity.
(*)pseudo algorithm
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
