This repository contains materials and implementations created for the Geometric Algorithms course at AGH University of Science and Technology (2025).
The goal of this project is to collect classic computational geometry algorithms and supporting code used during the course—both as references for learning and as a base for solving assignments.
Depending on the specific tasks covered in the course, the repository may include:
- Implementations of fundamental geometric primitives (points, vectors, segments, lines, polygons)
- Orientation / cross-product tests and segment intersection checks
- Convex hull algorithms (e.g., Graham scan, Andrew monotone chain)
- Line sweep / event-based algorithms (when applicable)
- Point-in-polygon and polygon operations
- Distance and closest-pair style computations
- Visualizations or helper scripts (if present in the repo)