iShapeUnity/Triangulation
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.
C#MIT
Stargazers
- fetisov
- martinkallstrom
- martinmaxkDenmark
- laurel0220
- Hellq
- felixopt17
- PavelTorgashovUkraine
- EricBeetsOfficial-OpuscopeFrance
- tomkrikorianParis
- gcj2450北京
- WaylandGod
- Cnicehs
- andybakBrighton, UK
- Pseudopode
- cosformulaShanghai China
- Sahraiee
- Lolitania
- CreepGinIrvine, CA
- api-hausKyiv, Ukraine
- gishadevKharkiv
- BenyaZhosh
- Maoyeedy