package.json

{
  "name": "com.ishape.triangulation",
  "version": "0.0.8",
  "displayName": "iShape.Triangulation",
  "description": "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.",
  "unity": "2022.2",
  "keywords": [
    "iShape",
    "triangulation",
    "tesselation",
    "centroid"
  ],
  "license": "MIT",
  "author": {
    "name": "iShape",
    "email": "nailxsharipov@gmail.com"
  },
  "repository": {
    "type": "git",
    "url": "https://github.com/iShapeUnity/Triangulation.git"
  },
  "dependencies": {
    "com.ishape.geometry": "0.0.5",
    "com.unity.mathematics": "1.3.1",
    "com.unity.collections": "2.2.0"
  }
}