Question: You are given n points P = {P1, P2, . , Pn} on 2D plane, represented as their coordinates. You are informed that the convex

You are given n points P = {P1, P2, . , Pn} on 2D plane, represented as their coordinates. You are informed that the convex hull of P contains O(Vlog n) points in P. Design an algorithm to compute the convex hull of P in O(n. Vlog n) time. Describe your algorithm and analyze its running time. You may assume that no three points in P are on the same line
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
