The binary curve approximation algorithm is an algorithm designed to approximate a ParametricCurve using as few
points as possible but keeping the overall visual appearance of the curve smooth.
Checks that the point array has the specified capacity, otherwise the capacity of the point
array is increased to be the maximum between twice the current capacity and the specified capacity.
Checks that the value array has the specified capacity, otherwise the capacity of the
value array is increased to be the maximum between twice the current capacity and the
specified capacity.
Checks that the curve array has the specified capacity, otherwise the capacity of the
curve array is increased to be the maximum between twice the current capacity or
the specified capacity.
Checks that the point array has the specified capacity, otherwise the capacity of the
point array is increased to be the maximum between twice the current capacity or
the specified capacity.
This method returns true if any line segment in this multi-path intersects any of the
4 line segments formed by the rectangle or any corner of the rectangle is inside the
shape or any point of the shape is inside the rectangle.
The natural-cubic-spline is constructed using piecewise third order polynomials which pass through all the
control-points specified by the group-iterator.
Curves that extend the ParametricCurve class are continuous and can use the
BinaryCurveApproximationAlgorithm class to generate a sequence of points that
approximate the curve.
The base-index is an index location into the knot vector such that, for each section, the curve is
evaluated between [knot[baseIndex], knot[baseIndex + baseLength]].