Implemented various computational geometry algorithms such as Convex Hull construction, Voronoi Diagrams and Range Trees.
- Convex Hull Algorithms (ConvexHull.py, convex_hull_alg.cpython-311.pyc)
- Jarvis March (Gift Wrapping) Algorithm (jarvis_march_algorithm.py)
- QuickHull Algorithm (quick_hull_algorithm.py)
- Divide and Conquer Approach (divide_and_conquer_algorithm.py)
- Incremental Algorithm (incremental_algorithm.py, incremental_algorithm2.py)
- Voronoi Diagram & Delaunay Triangulation (Delanuay_Voronoi.py)
-
Voronoi diagrams and Delaunay triangulations using geometric algorithms.
-
Linear Programming (Linear_Programming.py)
- Used for solving optimization problems in computational geometry. Range Trees (range_tree.py)
- Implementaion of a 2D range query structure for efficient spatial queries.