Unformatted text preview: S l ), n/ 3 input points lying between L l and L r (denoted by the subset S m ), and n/ 3 input points lying to the right of L r (denoted by the subset S r ); (2) recursively compute the convex hull of each of the three subsets S l , S m , and S r ; (3) in the “combine” step, compute and return the convex hull of the n input points from the convex hulls of S l , S m , and S r . —————————————————————– We assume that in the above algorithm, Steps (1) and (3) together take no more than a ∗ n 2 time for some constant a > 0. You are asked to do the following. (i) Model the running time of the above algorithm by a recurrence relation. (10 points) (ii) Solve your recurrence relation by giving a tight closeform solution (in the bigO notation). (15 points) Total Points : 80...
View
Full
Document
This note was uploaded on 01/06/2012 for the course MANAGEMENT 000 taught by Professor 游啟璋 during the Spring '11 term at National Taiwan University.
 Spring '11
 游啟璋

Click to edit the document details