##
Given n line segments, find if any two segments intersect
November 9, 2013

We have discussed the problem to detect if two given line segments intersect or not. In this post, we extend the problem.

November 9, 2013

We have discussed the problem to detect if two given line segments intersect or not. In this post, we extend the problem.

July 24, 2013

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.

July 13, 2013

July 11, 2013

Given a polygon and a point ‘p’, find if ‘p’ lies inside the polygon or not. The points lying on the border are considered inside.

July 10, 2013

Given two line segments (p1, q1) and (p2, q2), find if the given line segments intersect with each other.

November 28, 2012

We are given an array of n points in the plane, and the problem is to find out the closest pair of points in the array. This problem arises in a number of applications.

July 20, 2012

Given three corner points of a triangle, and one more point P. Write a function to check whether P lies within the triangle or not.