# Category Archives: Geometric

## Deleting points from Convex HullJune 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 »

## Angular Sweep (Maximum points that can be enclosed in a circle of given radius)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 »

## Minimum revolutions to move center of a circle to a targetJune 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 »

## Dynamic Convex hull | Adding Points to an Existing Convex HullJune 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 »

## Convex Hull (Simple Divide and Conquer Algorithm)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 »

## Tangents between two Convex PolygonsMay 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 »

## Find all angles of a given triangleMay 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 »

## Triangle with no point insideMay 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 »

## Polygon Clipping | Sutherland–Hodgman AlgorithmMay 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 »

## Quickhull Algorithm for Convex HullApril 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 »

## Minimum block jumps to reach destinationApril 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 »

## Check if right triangle possible from given area and hypotenuseApril 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 »

## Minimum lines to cover all pointsApril 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 »

## Maximum number of 2×2 squares that can be fit inside a right isosceles triangleApril 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 »

## Pizza cut problem (Or Circle Division by Lines)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 »