A simple Delaunay mesh generator based on the Bowyer-Watson algorithm. I have based my code on the pseudocode present in the Wikipedia page. I have viewed other people's code and I believe this code is simpler and easier to understand the algorithm. This is an incremental algorithm and it is slower than the Divide and conquer method available.
This code is a java implementation of Bowyer-Watson algorithm to compute Delaunary triangulation.
Bowyer Watson incremental delaunay triangulation
Implementation of the Bowyer-Watson Algorithm
A C++ library for computing triangulation and Traveling Saleseman Problem approximations
Delaunay Triangulation Based on Bowyer–Watson algorithm (Python)
A Bowyer–Watson algorithm for Triangulation, with a Unity3D demo provided.
Implementation of the Bowyer Watson Algorithm with C++
This is a C# implementation of Bowyer Watson Delaunay triangulation.
An implementation of Delaunay Triangulation in Pygame using the Bowyer-Watson algorithm
Add a description, image, and links to the bowyer-watson-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the bowyer-watson-algorithm topic, visit your repo's landing page and select "manage topics."