Complex polygon triangulation, tessellation and split into convex polygons. A fast O(n*log(n)) algorithm based on "Triangulation of monotone polygons". The result can be represented as a Delaunay triangulation.
💡 Fast O(n*log(n)) algorithm based on "Triangulation of monotone polygons"
💡 All code is written to suit "Data Oriented Design". No reference type like class, just structs.
💡 Supports polygons with holes
💡 Supports plain and Delaunay triangulation
💡 Supports tesselation
💡 Supports building centroid net
💡 Same points is not restricted
💡 Polygon must not have self intersections
💡 Use integer geometry for calculations
💡 More then 100 tests
To use iShape.Triangulation in your Unity project, follow these steps:
The TriangulationDebug project is a samll demo project with some showcases.