-
Tensor
- Turkey
-
18:09
(UTC +03:00)
Pinned Loading
-
iShape-Swift/iShapeTriangulation
iShape-Swift/iShapeTriangulation PublicComplex polygon triangulation. A fast O(n*log(n)) algorithm based on "Triangulation of monotone polygons". The result can be represented as a Delaunay triangulation.
-
iShapeUnity/Triangulation
iShapeUnity/Triangulation PublicComplex polygon triangulation. A fast O(n*log(n)) algorithm based on "Triangulation of monotone polygons". The result can be represented as a Delaunay triangulation.
-
iShape-Rust/iOverlay
iShape-Rust/iOverlay PublicBoolean Operations for 2D Polygons: Supports intersection, union, difference, xor, and self-intersections for all polygon varieties.
-
iShape-Rust/iShape-js
iShape-Rust/iShape-js PublicA poly-bool library supports main operations such as union, intersection, difference, xor, and self-intersection. This algorithm is based on Vatti clipping ideas but is an original implementation.
JavaScript 4
-
iShape-Swift/iOverlay
iShape-Swift/iOverlay PublicBoolean Operations for 2D Polygons: Supports intersection, union, difference, xor, and self-intersections for all polygon varieties.
Swift 2
-
iShape-Swift/iTriangle
iShape-Swift/iTriangle PublicA fast and efficient library for Delaunay triangulation and converting complex polygons into convex shapes, including advanced self-intersection resolution.
If the problem persists, check the GitHub status page or contact support.