Skip to content

Latest commit

 

History

History
9 lines (8 loc) · 387 Bytes

README.md

File metadata and controls

9 lines (8 loc) · 387 Bytes
Raw

Delaunay-Triangulations

Here is an implementation of finding Euclidean Minimum Spannig Tree using Delaunay Triangulations. All code is on C++, for drawing I use GLUT. Here is small example of working algorithm on 20 and 500 random points: