What are Geometric Algorithms?
Geometric algorithms are a set of computational techniques used in Competitive Programming to solve problems related to geometry and spatial relationships. These problems often involve points, lines, polygons, and other geometric objects.
Basic Geometry for Competitive Programming
Ever wondered how to tackle tricky problems in competitive programming? Well, basic geometry is your secret weapon! In this article, we’re diving into the basics Geometric Algorithms. It’s like a power-up for your problem-solving skills, giving you the tools to crack those coding challenges like a pro.
Table of Content
- What are Geometric Algorithms?
- Why to use Geometric Algorithms?
- Vector Addition/Subtraction
- Dot Product and Cross Product
- Distance from a point to a line
- Intersection Point of two lines
- Practice Problems on Basic Geometry for Competitive Programming