Lines
- Program to find the mid-point of a line
- Section formula (Point that divides a line in given ratio)
- Program to find slope of a line
- Program to find line passing through 2 Points
- Program for Point of Intersection of Two Lines
- Reflection of a point about a line in C++
- Find points at a given distance on a line of given slope
- Given n line segments, find if any two segments intersect
- Count maximum points on same line
- Minimum lines to cover all points
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