Semester : SEMESTER 1
Subject : Advanced Data Structures and Algorithms
Year : 2017
Term : DECEMBER
Branch : COMPUTER SCIENCE AND ENGINEERING
Scheme : 2015 Full Time
Course Code : 01 CS 6105
Page:5
. Consider the following problem "Given a set of points
in the plane, the convex hull of the set is the
smallest convex polygon that contains all the points
of it". Give ௨201712௪00) time algorithm that solves the
given problem.