Problem 2: Computational Geometry Given two arbitrary convex polygons P and Q with n and m vertices respectively (Remind

[answerhappygod]

Problem 2 Computational Geometry Given Two Arbitrary Convex Polygons P And Q With N And M Vertices Respectively Remind 1 (48.51 KiB) Viewed 45 times

Problem 2: Computational Geometry Given two arbitrary convex polygons P and Q with n and m vertices respectively (Reminder: we defined a convex hull as a set of points in counter- clockwise order). The polygons can be disjoint, one inside the other, or the boundaries might intersect a number of times. (a) (5 points) What is the smallest and largest number of vertices that can be on the convex hull of PUQ. Give an exact expression and not an asymptotic bound. Explain your answer and describe a set of points for each.