#Graph & Geometry Algorithms in Python

This project provides Python implementations of classical computational geometry and graph algorithms:

• Delaunay Triangulation(Bowyer–Watson)
• Gabriel Graph (GG)
• Relative Neighborhood Graph (RNG)
• k-Nearest Neighbors Graph (kNN)
• Minimum Spanning Tree (MST):
  • Prim's Algorithm
  • Kruskal's Algorithm

The project uses matplotlib and k3d for visualization ##Roadmap

• Delaunay triangulation
• MST (Prim / Kruskal)
• Gabriel Graph
• RNG
• Voronoi diagram (coming soon)
• Performance benchmarks

##Visualizations

Delaunay Triangulation Minimum Spanning Tree (Prim's Algorithm) MST with k3d