diff options
| author | Rémi Verschelde <remi@verschelde.fr> | 2022-02-22 22:06:16 +0100 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2022-02-22 22:06:16 +0100 |
| commit | 002ab1060862431731cd528a0887ad8362ab404c (patch) | |
| tree | 74db6d85db552e070bac0dd17003cf9b7667a1cb /doc/classes | |
| parent | e17c29ab80e9bf4ac6ccf60e023252b3113cbf39 (diff) | |
| parent | bcc4d26c48c609bb751a2bd9a88b1aae22caaf5c (diff) | |
Merge pull request #57664 from skyace65/TriangulateInfo
Add more information on triangulate polygon
Diffstat (limited to 'doc/classes')
| -rw-r--r-- | doc/classes/Geometry2D.xml | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/doc/classes/Geometry2D.xml b/doc/classes/Geometry2D.xml index 446a90463d..cbd83e8d7d 100644 --- a/doc/classes/Geometry2D.xml +++ b/doc/classes/Geometry2D.xml @@ -209,7 +209,7 @@ <return type="PackedInt32Array" /> <argument index="0" name="polygon" type="PackedVector2Array" /> <description> - Triangulates the polygon specified by the points in [code]polygon[/code]. Returns a [PackedInt32Array] where each triangle consists of three consecutive point indices into [code]polygon[/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 [PackedInt32Array] is returned. + Triangulates the polygon specified by the points in [code]polygon[/code]. Returns a [PackedInt32Array] where each triangle consists of three consecutive point indices into [code]polygon[/code] (i.e. the returned array will have [code]n * 3[/code] elements, with [code]n[/code] being the number of found triangles). Output triangles will always be counter clockwise, and the contour will be flipped if it's clockwise. If the triangulation did not succeed, an empty [PackedInt32Array] is returned. </description> </method> </methods> |