This repository implement basic algorithms for voronoi diagram and visualize them.
source: bowyer_watson.h, bowyer_watson.cpp, bowyer_watson_test.cpp
For finding bad triangulation, we can use some data structure to speed. (If you have considerable fine meshes)
source: direct.h, direct.cpp, direct_test.cpp
We compute distance map preliminary to speed up.
The for loop for scanning all pixels can be parallelized. (If you have a lot of pixels)
Euclidean distance
Manhattan distance
Cubic distance
source; cv_example.cpp
