Scribd
Upload
3 views3 pages

Assignment5

The document contains C++ code that implements an algorithm to find the convex hull of a set of 2D points using the Graham scan method. It defines a structure for points, functions for calculating direction and squared distance, and a main function that demonstrates the convex hull calculation. The output displays the boundary points of the convex hull.

Uploaded by

Vandana Singh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
3 views3 pages

Assignment5

The document contains C++ code that implements an algorithm to find the convex hull of a set of 2D points using the Graham scan method. It defines a structure for points, functions for calculating direction and squared distance, and a main function that demonstrates the convex hull calculation. The output displays the boundary points of the convex hull.

Uploaded by

Vandana Singh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

#include<iostream>

#include<stack>

#include<algorithm>

#include<vector>

using namespace std;

struct point { //define points for 2d plane

int x, y;

};

point p0; //used to another two points

point secondTop(stack<point> &stk) {

point tempPoint = stk.top();

stk.pop();

point res = stk.top(); //get the second top element

stk.push(tempPoint); //push previous top again

return res;

int squaredDist(point p1, point p2) {

return ((p1.x-p2.x)*(p1.x-p2.x) + (p1.y-p2.y)*(p1.y-p2.y));

int direction(point a, point b, point c) {

int val = (b.y-a.y)*(c.x-b.x)-(b.x-a.x)*(c.y-b.y);

if (val == 0)

return 0; //colinear

else if(val < 0)

return 2; //anti-clockwise direction

return 1; //clockwise direction

int comp(const void *point1, const void*point2) {


point *p1 = (point*)point1;

point *p2 = (point*)point2;

int dir = direction(p0, *p1, *p2);

if(dir == 0)

return (squaredDist(p0, *p2) >= squaredDist(p0, *p1))?-1 : 1;

return (dir==2)? -1 : 1;

vector<point> findConvexHull(point points[], int n) {

vector<point> convexHullPoints;

int minY = points[0].y, min = 0;

for(int i = 1; i<n; i++) {

int y = points[i].y;

//find bottom most or left most point

if((y < minY) || (minY == y) && points[i].x < points[min].x) {

minY = points[i].y;

min = i;

swap(points[0], points[min]); //swap min point to 0th location

p0 = points[0];

qsort(&points[1], n-1, sizeof(point), comp); //sort points from 1 place to end

int arrSize = 1; //used to locate items in modified array

for(int i = 1; i<n; i++) {

//when the angle of ith and (i+1)th elements are same, remove points

while(i < n-1 && direction(p0, points[i], points[i+1]) == 0)

i++;

points[arrSize] = points[i];

arrSize++;
}

if(arrSize < 3)

return convexHullPoints; //there must be at least 3 points, return empty list.

//create a stack and add first three points in the stack

stack<point> stk;

stk.push(points[0]); stk.push(points[1]); stk.push(points[2]);

for(int i = 3; i<arrSize; i++) { //for remaining vertices

while(direction(secondTop(stk), stk.top(), points[i]) != 2)

stk.pop(); //when top, second top and ith point are not making left turn, remove
point

stk.push(points[i]);

while(!stk.empty()) {

convexHullPoints.push_back(stk.top()); //add points from stack

stk.pop();

int main() {

point points[] = {{0,0},{0,4},{-4,0},{5,0},{0,-6},{1,0}};

int n = 6;

vector<point> result;

result = findConvexHull(points, n);

cout << "Boundary points of convex hull are: "<<endl;

vector<point>::iterator it;

for(it = result.begin(); it!=result.end(); it++)

cout << "(" << it->x << ", " <<it->y <<") ";

You might also like