##
Deleting points from Convex Hull
June 11, 2017

Given a fixed set of points. We need to find convex hull of given set. We also need to find convex hull when a point… Read More »

June 11, 2017

Given a fixed set of points. We need to find convex hull of given set. We also need to find convex hull when a point… Read More »

June 7, 2017

Given ‘n’ points on 2-D plane, find the maximum number of points that can be enclosed by a fixed-radius circle of radius ‘R’. Note: The… Read More »

June 4, 2017

Given a circle of radius r and center in point(x1, y1) and given a point(x2, y2). The task is move center of circle from given… Read More »

June 2, 2017

Given a convex hull, we need to add a given number of points to the convex hull and print the convex hull after every point… Read More »

May 28, 2017

Convex hull is the smallest convex polygon containing all the given points. Input is an array of points specified by their x and y coordinates.… Read More »

May 22, 2017

Given two convex polygons, we need to find the lower and upper tangents to these polygons. As shown in the figure below, and show upper… Read More »

May 21, 2017

Given coordinates of all three vertices of the triangle in the 2D plane, the task is to find all three angles. Example: Input : A… Read More »

May 7, 2017

Given N points in 2-dimensional space, we need to find three points such that triangle made by choosing these points should not contain any other… Read More »

May 4, 2017

A convex polygon and a convex clipping area are given. The task is to clip polygon edges using the Sutherland–Hodgman Algorithm. Input is in the… Read More »

April 19, 2017

Given a set of points, a Convex hull is the smallest convex polygon containing all the given points. Input is an array of points specified… Read More »

April 15, 2017

Given N lines and one starting point and destination point in 2-dimensional space. These N lines divide the space into some blocks. We need to… Read More »

April 14, 2017

Given area and hypotenuse, the aim is to print all sides if right triangle can exist, else print -1. We need to print all sides… Read More »

April 13, 2017

Given N points in 2-dimensional space, we need to print the count of the minimum number of lines which traverse through all these N points… Read More »

April 8, 2017

What is the maximum number of squares of size 2×2 units that can be fit in a right angled isosceles triangle of a given base… Read More »

March 4, 2017

Given number of cuts, find the maximum number of possible pieces. Examples: Input : 2 Output : 4 Input : 3 Output : 7 Recommended:… Read More »