Question: Computational Geometry Given two arbitrary convex polygons P and Q with n and m vertices respectively. The polygons can be disjoint, one inside the other,

Computational Geometry

Given two arbitrary convex polygons P and Q with n and m vertices respectively. The polygons can be disjoint, one inside the other, or the boundaries might intersect a number of times.

a) What is the smallest and largest number of vertices that can be on the convex hull of P Q. Give an exact expression and nut an asymptotic bound.Explain your answer.

b) Give a O(n + m) time algorithm to compute the convex hull of P Q. Argue your algorithm's correctness and analyze its complexity.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Mathematics Questions!