Don't provide the same answer as 7,6. I already had that answer wrong twice. Please explain it properly. Don't copy and
Posted: Thu May 12, 2022 8:01 am
Don't provide the same answer as 7,6. I already had that
answer wrong twice. Please explain it properly. Don't copy and
paste it from other answer.
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.
answer wrong twice. Please explain it properly. Don't copy and
paste it from other answer.
- Don T Provide The Same Answer As 7 6 I Already Had That Answer Wrong Twice Please Explain It Properly Don T Copy And 1 (48.51 KiB) Viewed 20 times