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:
-
Notifications
You must be signed in to change notification settings - Fork 1
vocheretnyi/Delaunay-Triangulations
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Implementation of algorithm for finding Euclidean minimum spanning tree using Delaunay triangulations.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published