search

iShapeUnity / Triangulation

Complex polygon triangulation. A fast O(n*log(n)) algorithm based on "Triangulation of monotone polygons". The result can be represented as a Delaunay triangulation.
MIT License
23 stars 3 forks source link

issues

Newest
Newest Most commented Recently updated Oldest Least commented Least recently updated