# Geometric Algorithms

**‘Recent Articles’ on Geometric Algorithms!**

**Topic :**

- How to check if two given line segments intersect?
- Given n line segments, find if any two segments intersect
- Klee’s Algorithm (Length Of Union Of Segments of a line)
- Count maximum points on same line
- Line Clipping | Set 1 (Cohen–Sutherland Algorithm)
- Find an Integer point on a line segment with given two ends
- Minimum lines to cover all points
- Minimum block jumps to reach destination
- Program for Point of Intersection of Two Lines
- Represent a given set of points by the best possible straight line
- Program to find line passing through 2 Points
- Reflection of a point about a line in C++
- Find points at a given distance on a line of given slope

- Check whether a given point lies inside a triangle or not
- C program to find area of a triangle
- Count Integral points inside a Triangle
- Classify a triangle
- Maximum height when coins are arranged in a triangle
- Find all sides of a right angled triangle from given hypotenuse and area | Set 1
- Maximum number of 2×2 squares that can be fit inside a right isosceles triangle
- Check if right triangle possible from given area and hypotenuse
- Triangle with no point inside
- Find all angles of a given triangle
- Program to find Circumcenter of a Triangle
- Number of Triangles that can be formed given a set of lines in Euclidean Plane

- Find if two rectangles overlap
- Check if four segments form a rectangle
- Find Corners of Rectangle using mid points
- How to check if given four points form a square
- Paper Cut into Minimum Number of Squares
- Program to find area of a circle
- Non-crossing lines to connect points in a circle
- Circle and Lattice Points
- Queries on count of points lie inside a circle
- Check whether a point exists in circle sector or not
- Count of acute, obtuse and right triangles with given sides
- Pizza cut problem (Or Circle Division by Lines)
- Minimum revolutions to move center of a circle to a target
- Angular Sweep (Maximum points that can be enclosed in a circle of given radius)

- How to check if a given point lies inside or outside a polygon?
- Minimum Cost Polygon Triangulation
- Area of a polygon with given n ordered vertices
- Polygon Clipping | Sutherland–Hodgman Algorithm
- Tangents between two Convex Polygons
- Regular polygon using only 1s in a binary numbered circle
- Find number of diagonals in n sided convex polygon
- Convex Hull | Set 1 (Jarvis’s Algorithm or Wrapping)
- Convex Hull | Set 2 (Graham Scan)
- Quickhull Algorithm for Convex Hull
- Convex Hull (Simple Divide and Conquer Algorithm)
- Dynamic Convex hull | Adding Points to an Existing Convex Hull
- Deleting points from Convex Hull

- Find Simple Closed Path for a given set of points
- Orientation of 3 ordered points
- Number of Integral Points between Two Points
- Divide and Conquer | Set 2 (Closest Pair of Points)
- Closest Pair of Points | O(nlogn) Implementation
- Optimum location of point to minimize total distance
- n’th Pentagonal Number
- Find perimeter of shapes formed with 1s in binary matrix
- Count of parallelograms in a plane
- Minimum distance to travel to cover all intervals
- Rotation of a point about another point in C++
- Find the Missing Point of Parallelogram
- LS3/NS3 sphere generation algorithm and its implementation
- Equable Shapes
- Find mirror image of a point in 2-D plane

If you like GeeksforGeeks and would like to contribute, you can also write an article and mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above