This algorithm creates polygon triangulation simply by checking whether there is an intersection between edges of closest pairs, updating convex hull.
Before and after triangulation (vtk library used for visualization);
This algorithm creates polygon triangulation simply by checking whether there is an intersection between edges of closest pairs, updating convex hull.
Before and after triangulation (vtk library used for visualization);