bezier-self-intersection

function bezierSelfIntersection(ps: number[][], inRange?: boolean): number[]

Defined in intersection/self-intersection/bezier-self-intersection.ts:53

Returns the unique self-intersection parameter t values of the given bezier curve if they exist, else return [] (see also the inRange parameter below).

• only cubic (or higher order) bezier curves can have unique self-intersections
• this algorithm is mathematically guaranteed accurate to within an absolute error of 4 * Number.EPSILON for the returned t values satisfying |t| <= 1 or a relative error of the same 4 * Number.EPSILON otherwise.
• special case: a cusp is considered a degenerate self-intersection and the (duplicate) t values will be returned

Note!

Green circles are draggable!

0

Parameters:

Name	Type	Default value	Description
ps	number[][]	-	a bezier curve given as an array of its control points
inRange	boolean	true	if inRange === true (the default) then return the two t parameter values only if both are in [0,1] else return []. If inRange === false then return the (0,1 or 2) t values in [0,1] even if only one is in that range.