# Category Archives: Geometric

## Rotation of a point about another point in C++

We have already discussed the rotation of a point P about the origin in the Set 1 and Set 2. The rotation of point P… Read More »

## Reflection of a point about a line in C++

Let’s first consider a general case where the line is nothing but the X-Axis. We can now definitely say that the conjugate of a point… Read More »

## Program to find Circumcenter of a Triangle

Given 3 non-collinear points in the 2D Plane P, Q and R with their respective x and y coordinates, find the circumcenter of the triangle.… Read More »

## Program to find line passing through 2 Points

Given two points P and Q in the coordinate plane, find the equation of the line passing through both the points. This kind of conversion… Read More »

## Find Corners of Rectangle using mid points

Consider a rectangle ABCD, we’re given the co-ordinates of the mid points of side AD and BC (p and q respectively) along with their length… Read More »

## Find number of diagonals in n sided convex polygon

Given n > 3, find number of diagonals in n sided convex polygon. According to Wikipedia, In geometry, a diagonal is a line segment joining… Read More »

## Represent a given set of points by the best possible straight line

Find the value of m and c such that a straight line y = mx + c, best represents the equation of a given set… Read More »

## Program for Point of Intersection of Two Lines

Given points A and B corresponding to line AB and points P and Q corresponding to line PQ, find the point of intersection of these… Read More »

## Regular polygon using only 1s in a binary numbered circle

Given an array of binary integers, suppose these values are kept on the circumference of a circle at an equal distance. We need to tell… Read More »

## Deleting points from Convex Hull

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)

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 target

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 Hull

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)

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 Polygons

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 »