This is a simple implementation of Delanuay Triangulation which I did for my Computational Geometry course. I have written all the necessary functions along with the main function in a single file ...

Delaunay Triangulation in Python using Bowyer–Watson algorithm.. In computational geometry, the Bowyer–Watson algorithm is a method for computing the Delaunay triangulation of a finite set of points ...

A triangulation contains roughly three edges for every two triangles. Hence, the triangular data structure is more space-efficient. Figure 1: A triangulation (top) and its corresponding ...