convex hull

Divide-and-Conquer,
Technique used :
Convex Hull by Graham’s Scan
Presented by
• Aabid Amin Shah
•MSC-IT IST Sem
• Roll no: 140201
•Central University of Kashmir.
Sub: Data Structure
1 Presented by Aabid Shah

Divide-and-Conquer
The most-well known algorithm design strategy:
1. Divide instance of problem into two or more
smaller instances
2. Solve smaller instances recursively
3. Obtain solution to original (larger) instance by
combining these solutions

3
 In divide and conquer, method we divide the set
of n points in 0(n) time into two subsets, one
containing the leftmost [n/2] points, and one
containing the right most [n/2] points, recursively
compute the convex hull of the subsets, and then
combine the hulls in 0(n) time. The running time is
described by the familiar recurrence
 T(n) =2T(n/2) +o(n),
so the divide and conquer method runs in o(n log
n) time.
Presented by Aabid Shah

Divide-and-Conquer Technique
subproblem 2
of size n/2
subproblem 1
of size n/2
a solution to
subproblem 1
a solution to
the original problem
a solution to
subproblem 2
a problem of size n

Control Abstraction for Divide and Conquer
Algorithm DAndC( P ) {
if Small( P ) then return S( P );
else {
divide P into smaller instances P1, P2, …, Pk , k >= 1;
Apply DAndC to each these sub-problems;
return Combine(DAndC(P1), DAndC(P1),…, DAndC(Pk));
}
}

Definition of convex Hull
 Convex hull of set Q of points is the smallest convex polygon P
for which each point of Q is either on boundary of p or inside it.
 We have a set of points P0,P1,P2….Pn. These are the set of
point and from among them we will choose a subset of points
such that when we make a polygon out of it which has
minimum sides than all other points lies inside it and these
points are on the polygon. This is the simple and cute definition
of convex hull . so we have convex hull, we have set of points
so for example .we will use graham ‘s scan algorithm to solve
this problem .

7 Steps of creation of Convex Hull.Presented by Aabid Shah

Graham’s scan Algorithm
1. let p0 be the point in Q with the minimum y-coordinates or the left most
such point in case of a tie
2. let <p1,p2,p3….pn> be the remaining points in Q, sorted by polar angle
in the counter clock wise order around the p0 (if more than one point
has same angle, remove all but that is farthest from p0)
3. let s be the a empty stack i.e. top[s]<--0
4. push (p0,s)
5. Push (p1,s)
6. Push (p2,s)
7. For i = 3 to n
8. While the angle formed by points NEXT-TO-TOP(S),TOP(S),and pi
makes a
non left turn
9. Pop (s)
10. Push (pi,s)
Note: When the algorithm terminates
stack[s] contains exactly the vertices
of Q in the counter clockwise order of
their appearance on the boundary.

How to use of Graham’s scan algorithm.
 1. we take a point with a minimum y coordinate and if
we have multiple such points with y coordinates break
the tie with left most of them.
 Let p0,p1,p2……pn is the set of q then we sort them by
polar angle counter clockwise order and start from p0
then what we do we maintain a stack. Now the top of
stack is 0 we push the first three points on it i.e.
p0,p1,p2.
Stack
top
p2
p1
P0
Polar
angle
The polar angle is theta 3> theta 2> theta 1
i.e p1 has lowest polar angle then p2,p3..pn
p0 p1
p2
p3
pn

Conditions to check
1. Find the next minimum y coordinate or the leftmost
such point in case of a tie.
2. Sort them by polar angle in counter clock wise
order around p0 .
3. Maintain the stack to push element on it.
4. Pop the element if it makes a non left turn angle.
5. Join the farthest point to make a convex hull of
vertex pushed on to the stack.

37
That’s all for Convex Hull…..
Presented by Aabid Shah

convex hull

More Related Content

What's hot

Viewers also liked

Similar to convex hull

Recently uploaded

convex hull