Polygon and Convex Hull
- How to check if a given point lies inside or outside a polygon?
- Area of a polygon with given n ordered vertices
- Tangents between two Convex Polygons
- Find number of diagonals in n sided convex polygon
- Convex Hull using Jarvis’ Algorithm or Wrapping
- Quickhull Algorithm for Convex Hull
- Deleting points from Convex Hull
- Minimum area of a Polygon with three points given
Geometric Algorithms
Geometric algorithms are a type of algorithm that deal with solving problems related to geometry. These algorithms are used to solve various geometric problems such as computing the area of a polygon, finding the intersection of geometric shapes, determining the convex hull of a set of points, and many other tasks related to geometric objects and their properties. Geometric algorithms are important in various fields such as computer graphics, computer-aided design, robotics, and geographical information systems.
Table of Content
- What are Geometric Algorithms?
- Pattern Printing
- Lines
- Triangle
- Rectangle | Square | Circle
- Quadrilateral
- 3D Objects
- Polygon and Convex Hull
- Standard Problems on Geometric Algorithm
Contact Us