1. Math
  2. Advanced Math
  3. the onlogn algorithm to compute the convex hull of a...

Question: the onlogn algorithm to compute the convex hull of a...

Question details

The O(nlogn) algorithm to compute the convex hull of a set of n points in the plane that was described in this chapter is based on the paradigm of incremental construction: add the points one by one, and update the convex hull after each addition. In this exercise we shall develop an algorithm based on another paradigm, namely divide-and-conquer. a. Let Pi and P2 be two disjoint convex polygons with n vertices in total. Give an O(n) time algorithm that computes the convex hull of Pi UP2. b. Use the algorithm from part a to develop an O(nlog n) time divide-and- conquer algorithm to compute the convex hull of a set of n points in the plane.

Solution by an expert tutor
Blurred Solution
This question has been solved
Subscribe to see this solution