search

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.
MIT License
20 stars 3 forks source link

Disposing of layout. #2

Closed PavelTorgashov closed 1 year ago

PavelTorgashov commented 1 year ago

https://github.com/iShapeUnity/Triangulation/blob/d04f2c7d2bf8e9ced4177a41fa7eb55223079b9d/Runtime/iShape/Triangulation/Shape/Delaunay/Triangulation.cs#L74

Looks like you can not dispose this here. It used below in code.

NailxSharipov commented 1 year ago

Yes you right! Don't know why it still not fixed. Will do it on this week

NailxSharipov commented 1 year ago

Done! I also create project https://github.com/iShapeUnity/TriangulationDebug with tests and some test scene