Function GeometrySingleton.triangulateDelaunay2d
Triangulates the area specified by discrete set of points
such that no point is inside the circumcircle of any resulting triangle. Returns a PoolIntArray
where each triangle consists of three consecutive point indices into points
(i.e. the returned array will have n * 3
elements, with n
being the number of found triangles). If the triangulation did not succeed, an empty PoolIntArray
is returned.