function toPoints(s, cp, e) {
  const { cp1, cp2 } = toCubic(s, cp, e);

  return cubicToPoints(s, cp1, cp2, e);
}
/**
 * Recursive subdivision of a curve using de Casteljau algorithm.
 * Splits the curve into multiple line segments where each segments is choosen based on a level of flatness.
 * @ignore
 * @param {Point} s - Start point
 * @param {Point} cp - Control point
 * @param {Point} e - End point
 * @returns {Point[]} Array of points
 */
Recursive subdivision of a curve using de Casteljau algorithm.
Splits the curve into multiple line segments where each segments is choosen based on a level of flatness.
Recursive subdivision of a curve using de Casteljau algorithm . Splits the curve into multiple line segments where each segments is choosen based on a level of flatness .
function toPoints(s, cp, e) {
  const { cp1, cp2 } = toCubic(s, cp, e);
  return cubicToPoints(s, cp1, cp2, e);
}
function toPoints ( s , cp , e ) { const { cp1 , cp2 } = toCubic ( s , cp , e ) ; return cubicToPoints ( s , cp1 , cp2 , e ) ; }
Recursive subdivision of a curve using de Casteljau algorithm.
Recursive subdivision of a curve using de Casteljau algorithm .