GitHub / iShape-Swift / iShapeTriangulation
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.
JSON API: http://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/iShape-Swift%2FiShapeTriangulation
Stars: 29
Forks: 5
Open issues: 1
License: mit
Language: Swift
Size: 4.03 MB
Dependencies parsed at: Pending
Created at: over 5 years ago
Updated at: 11 months ago
Pushed at: over 1 year ago
Last synced at: 11 months ago
Commit Stats
Commits: 222
Authors: 1
Mean commits per author: 222.0
Development Distribution Score: 0.0
More commit stats: https://commits.ecosyste.ms/hosts/GitHub/repositories/iShape-Swift/iShapeTriangulation
Topics: algorithm, convex-polygons, delaunay, delaunay-triangulation, mesh, monotone-polygons, polygon, swift, tesselation, triangle-vertices, triangulation