iShapeTriangulation
iShapeTriangulation copied to clipboard
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.
Results
1
iShapeTriangulation issues
Sort by
recently updated
recently updated
newest added
I'm getting this exception thrown from PlainShape.split(). Seems to happen when a polygon has two very nearby vertices. ``` throw SplitError.unusedPoint ``` Is it safe to ignore the unused point...