diff options
| author | Rémi Verschelde <rverschelde@gmail.com> | 2019-05-24 13:27:11 +0200 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2019-05-24 13:27:11 +0200 |
| commit | 33239a5ada02ad05152fb4a0905261e8feddae9f (patch) | |
| tree | c1efaa0fdfb3ec12392b1ebb3b07ebabb76b5d8d /doc | |
| parent | eaff86f8bdcafa9fcd3a1d14ce916c06490a4c2e (diff) | |
| parent | 24e9a881c0b5ec0c475e0992c723585ebcf1a570 (diff) | |
Merge pull request #29127 from Xrayez/geometry-delaunay-bind
Expose 2D Delaunay triangulation in Geometry singleton
Diffstat (limited to 'doc')
| -rw-r--r-- | doc/classes/Geometry.xml | 9 |
1 files changed, 9 insertions, 0 deletions
diff --git a/doc/classes/Geometry.xml b/doc/classes/Geometry.xml index b95b888cf1..e2ba3fb7b0 100644 --- a/doc/classes/Geometry.xml +++ b/doc/classes/Geometry.xml @@ -428,6 +428,15 @@ Can be useful in conjuction with performing polygon boolean operations in CSG manner, see [method merge_polygons_2d], [method clip_polygons_2d], [method intersect_polygons_2d], [method exclude_polygons_2d]. </description> </method> + <method name="triangulate_delaunay_2d"> + <return type="PoolIntArray"> + </return> + <argument index="0" name="points" type="PoolVector2Array"> + </argument> + <description> + Triangulates the area specified by discrete set of [code]points[/code] 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 [code]points[/code] (i.e. the returned array will have [code]n * 3[/code] elements, with [code]n[/code] being the number of found triangles). If the triangulation did not succeed, an empty [PoolIntArray] is returned. + </description> + </method> <method name="triangulate_polygon"> <return type="PoolIntArray"> </return> |