Adds a point to a curve at [code]position[/code] relative to the [Curve2D]'s position, with control points [code]in[/code] and [code]out[/code].
If [code]at_position[/code] is given, the point is inserted before the point number [code]at_position[/code], moving that point (and every point after) after the inserted point. If [code]at_position[/code] is not given, or is an illegal value ([code]at_position <0[/code] or [code]at_position >= [method get_point_count][/code]), the point will be appended at the end of the point list.
</description>
</method>
<methodname="clear_points">
<returntype="void"/>
<description>
Removes all points from the curve.
</description>
</method>
<methodname="get_baked_length"qualifiers="const">
<returntype="float"/>
<description>
Returns the total length of the curve, based on the cached points. Given enough density (see [member bake_interval]), it should be approximate enough.
</description>
</method>
<methodname="get_baked_points"qualifiers="const">
<returntype="PoolVector2Array"/>
<description>
Returns the cache of points as a [PoolVector2Array].
Returns the closest baked point (in curve's local space) to [code]to_point[/code].
[code]to_point[/code] must be in this curve's local space.
</description>
</method>
<methodname="get_point_count"qualifiers="const">
<returntype="int"/>
<description>
Returns the number of points describing the curve.
</description>
</method>
<methodname="get_point_in"qualifiers="const">
<returntype="Vector2"/>
<argumentindex="0"name="idx"type="int"/>
<description>
Returns the position of the control point leading to the vertex [code]idx[/code]. The returned position is relative to the vertex [code]idx[/code]. If the index is out of bounds, the function sends an error to the console, and returns [code](0, 0)[/code].
</description>
</method>
<methodname="get_point_out"qualifiers="const">
<returntype="Vector2"/>
<argumentindex="0"name="idx"type="int"/>
<description>
Returns the position of the control point leading out of the vertex [code]idx[/code]. The returned position is relative to the vertex [code]idx[/code]. If the index is out of bounds, the function sends an error to the console, and returns [code](0, 0)[/code].
Returns the position of the vertex [code]idx[/code]. If the index is out of bounds, the function sends an error to the console, and returns [code](0, 0)[/code].
</description>
</method>
<methodname="interpolate"qualifiers="const">
<returntype="Vector2"/>
<argumentindex="0"name="idx"type="int"/>
<argumentindex="1"name="t"type="float"/>
<description>
Returns the position between the vertex [code]idx[/code] and the vertex [code]idx + 1[/code], where [code]t[/code] controls if the point is the first vertex ([code]t = 0.0[/code]), the last vertex ([code]t = 1.0[/code]), or in between. Values of [code]t[/code] outside the range ([code]0.0 >= t <=1[/code]) give strange, but predictable results.
If [code]idx[/code] is out of bounds it is truncated to the first or last vertex, and [code]t[/code] is ignored. If the curve has no points, the function sends an error to the console, and returns [code](0, 0)[/code].
Returns a point within the curve at position [code]offset[/code], where [code]offset[/code] is measured as a pixel distance along the curve.
To do that, it finds the two cached points where the [code]offset[/code] lies between, then interpolates the values. This interpolation is cubic if [code]cubic[/code] is set to [code]true[/code], or linear if set to [code]false[/code].
Cubic interpolation tends to follow the curves better, but linear is faster (and often, precise enough).
</description>
</method>
<methodname="interpolatef"qualifiers="const">
<returntype="Vector2"/>
<argumentindex="0"name="fofs"type="float"/>
<description>
Returns the position at the vertex [code]fofs[/code]. It calls [method interpolate] using the integer part of [code]fofs[/code] as [code]idx[/code], and its fractional part as [code]t[/code].
</description>
</method>
<methodname="remove_point">
<returntype="void"/>
<argumentindex="0"name="idx"type="int"/>
<description>
Deletes the point [code]idx[/code] from the curve. Sends an error to the console if [code]idx[/code] is out of bounds.
</description>
</method>
<methodname="set_point_in">
<returntype="void"/>
<argumentindex="0"name="idx"type="int"/>
<argumentindex="1"name="position"type="Vector2"/>
<description>
Sets the position of the control point leading to the vertex [code]idx[/code]. If the index is out of bounds, the function sends an error to the console. The position is relative to the vertex.
</description>
</method>
<methodname="set_point_out">
<returntype="void"/>
<argumentindex="0"name="idx"type="int"/>
<argumentindex="1"name="position"type="Vector2"/>
<description>
Sets the position of the control point leading out of the vertex [code]idx[/code]. If the index is out of bounds, the function sends an error to the console. The position is relative to the vertex.
</description>
</method>
<methodname="set_point_position">
<returntype="void"/>
<argumentindex="0"name="idx"type="int"/>
<argumentindex="1"name="position"type="Vector2"/>
<description>
Sets the position for the vertex [code]idx[/code]. If the index is out of bounds, the function sends an error to the console.
Returns a list of points along the curve, with a curvature controlled point density. That is, the curvier parts will have more points than the straighter parts.
This approximation makes straight segments between each point, then subdivides those segments until the resulting shape is similar enough.
[code]max_stages[/code] controls how many subdivisions a curve segment may face before it is considered approximate enough. Each subdivision splits the segment in half, so the default 5 stages may mean up to 32 subdivisions per curve segment. Increase with care!
[code]tolerance_degrees[/code] controls how many degrees the midpoint of a segment may deviate from the real curve, before the segment has to be subdivided.
The distance in pixels between two adjacent cached points. Changing it forces the cache to be recomputed the next time the [method get_baked_points] or [method get_baked_length] function is called. The smaller the distance, the more points in the cache and the more memory it will consume, so use with care.
