Scribd
Upload
42 views

Quickhull in Distributed Scenario

The document describes the distributed quickhull algorithm for finding the convex hull of a set of points. The algorithm works by first finding the leftmost and rightmost extreme points, then recursively dividing the remaining points based on whether they are left or right of the line connecting the extreme points. It chooses the point forming the largest triangle at each iteration to divide the points until all that remain are on the convex hull. The process is repeated for any additional extreme points to fully map out the convex hull.

Uploaded by

suratsujit
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
42 views

Quickhull in Distributed Scenario

The document describes the distributed quickhull algorithm for finding the convex hull of a set of points. The algorithm works by first finding the leftmost and rightmost extreme points, then recursively dividing the remaining points based on whether they are left or right of the line connecting the extreme points. It chooses the point forming the largest triangle at each iteration to divide the points until all that remain are on the convex hull. The process is repeated for any additional extreme points to fully map out the convex hull.

Uploaded by

suratsujit
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 7

Distributed Quickhull Algorithm

By, Radhanpara Vishal Anil (12CS18F)

Introduction

Quick Hull is an algorithm for problem of Convex Hull Convex Hull To create a convex polygon from a set of points on a given plane Quick Hull is a divide and conquer approach for solution of Convex Hull

Quick Hull Algorithm

Get the left and right extreme points from set of points If there is more than one left extreme points on a plane then select two points: one having maximum y-co ordinate and other minimum Similarly for the case of right extreme point

Quick Hull Algorithm contd..

In case there is only one left extreme point, p1 and one right extreme point, p2, divide the points into two parts one on the left of line p1->p2 and other right of the same. Now consider points on the left of p1->p2 Choose a point p for which area of triangle formed by p1p2p is maximum In case there is tie choose p for which angle pp1p2 is maximum

Quick Hull Algorithm contd..

Repeat the same process recursively for points p1 and p & p and p2 until any point p is found. The same process is to be repeated for points on the right of p1->p2 All points found as p and the points p1 and p2 lies on convex hull so formed

Quick Hull Algorithm contd..

For the case when they are multiple extreme points on either left or right side, choose the point with maximum y co-ordinate say p1 for left extreme point and choose point with maximum y co-ordinate say p2 and then repeat the same process with p1 and p2

Thank you

You might also like