rendx-curve 0.1.0

package/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2025-present wei.liang (https://github.com/weiliang0121)
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/dist/main.cjs

@@ -0,0 +1,307 @@
+"use strict";
+var __defProp = Object.defineProperty;
+var __getOwnPropDesc = Object.getOwnPropertyDescriptor;
+var __getOwnPropNames = Object.getOwnPropertyNames;
+var __hasOwnProp = Object.prototype.hasOwnProperty;
+var __export = (target, all) => {
+  for (var name in all)
+    __defProp(target, name, { get: all[name], enumerable: true });
+};
+var __copyProps = (to, from, except, desc) => {
+  if (from && typeof from === "object" || typeof from === "function") {
+    for (let key of __getOwnPropNames(from))
+      if (!__hasOwnProp.call(to, key) && key !== except)
+        __defProp(to, key, { get: () => from[key], enumerable: !(desc = __getOwnPropDesc(from, key)) || desc.enumerable });
+  }
+  return to;
+};
+var __toCommonJS = (mod) => __copyProps(__defProp({}, "__esModule", { value: true }), mod);
+
+// src/main.ts
+var main_exports = {};
+__export(main_exports, {
+  basis: () => basis,
+  bumpX: () => bumpX,
+  bumpY: () => bumpY,
+  cardinal: () => cardinal,
+  catmullRom: () => catmullRom,
+  curveMap: () => curveMap,
+  linear: () => linear,
+  monotoneX: () => monotoneX,
+  monotoneY: () => monotoneY,
+  natural: () => natural,
+  step: () => step,
+  stepAfter: () => stepAfter,
+  stepBefore: () => stepBefore
+});
+module.exports = __toCommonJS(main_exports);
+
+// src/curve.ts
+var linear = (path, points, start = true) => {
+  if (points.length <= 0) return;
+  if (start) path.M(points[0][0], points[0][1]);
+  for (let i = 1; i < points.length; i++) path.L(points[i][0], points[i][1]);
+};
+var step = (path, points, start = true) => {
+  if (points.length <= 0) return;
+  if (start) path.M(points[0][0], points[0][1]);
+  for (let i = 1; i < points.length; i++) {
+    const mx = (points[i - 1][0] + points[i][0]) / 2;
+    path.L(mx, points[i - 1][1]);
+    path.L(mx, points[i][1]);
+    path.L(points[i][0], points[i][1]);
+  }
+};
+var stepBefore = (path, points, start = true) => {
+  if (points.length <= 0) return;
+  if (start) path.M(points[0][0], points[0][1]);
+  for (let i = 1; i < points.length; i++) {
+    path.L(points[i - 1][0], points[i][1]);
+    path.L(points[i][0], points[i][1]);
+  }
+};
+var stepAfter = (path, points, start = true) => {
+  if (points.length <= 0) return;
+  if (start) path.M(points[0][0], points[0][1]);
+  for (let i = 1; i < points.length; i++) {
+    path.L(points[i][0], points[i - 1][1]);
+    path.L(points[i][0], points[i][1]);
+  }
+};
+var bumpX = (path, points, start = true) => {
+  if (points.length <= 0) return;
+  if (start) path.M(points[0][0], points[0][1]);
+  for (let i = 1; i < points.length; i++) {
+    const cpx = (points[i - 1][0] + points[i][0]) / 2;
+    path.C(cpx, points[i - 1][1], cpx, points[i][1], points[i][0], points[i][1]);
+  }
+};
+var bumpY = (path, points, start = true) => {
+  if (points.length <= 0) return;
+  if (start) path.M(points[0][0], points[0][1]);
+  for (let i = 1; i < points.length; i++) {
+    const cpy = (points[i - 1][1] + points[i][1]) / 2;
+    path.C(points[i - 1][0], cpy, points[i][0], cpy, points[i][0], points[i][1]);
+  }
+};
+var solveTridiagonal = (coords) => {
+  const n = coords.length - 1;
+  const a = new Array(n);
+  const b = new Array(n);
+  const r = new Array(n);
+  a[0] = 0;
+  b[0] = 2;
+  r[0] = coords[0] + 2 * coords[1];
+  for (let i = 1; i < n - 1; i++) {
+    a[i] = 1;
+    b[i] = 4;
+    r[i] = 4 * coords[i] + 2 * coords[i + 1];
+  }
+  a[n - 1] = 2;
+  b[n - 1] = 7;
+  r[n - 1] = 8 * coords[n - 1] + coords[n];
+  for (let i = 1; i < n; i++) {
+    const m = a[i] / b[i - 1];
+    b[i] -= m;
+    r[i] -= m * r[i - 1];
+  }
+  a[n - 1] = r[n - 1] / b[n - 1];
+  for (let i = n - 2; i >= 0; i--) a[i] = (r[i] - a[i + 1]) / b[i];
+  b[n - 1] = (coords[n] + a[n - 1]) / 2;
+  for (let i = 0; i < n - 1; i++) b[i] = 2 * coords[i + 1] - a[i + 1];
+  return [a, b];
+};
+var natural = (path, points, start = true) => {
+  const len = points.length;
+  if (len <= 1) return;
+  const xs = new Array(len);
+  const ys = new Array(len);
+  for (let i = 0; i < len; i++) {
+    xs[i] = points[i][0];
+    ys[i] = points[i][1];
+  }
+  const [cx, bx] = solveTridiagonal(xs);
+  const [cy, by] = solveTridiagonal(ys);
+  if (start) path.M(points[0][0], points[0][1]);
+  for (let i = 0; i < cx.length; i++) {
+    path.C(cx[i], cy[i], bx[i], by[i], points[i + 1][0], points[i + 1][1]);
+  }
+};
+var sign = (x) => x < 0 ? -1 : 1;
+var { min, abs } = Math;
+var calcSlope = (h0, h1, s0, s1) => {
+  const p = (s0 * h1 + s1 * h0) / (h0 + h1);
+  return (sign(s0) + sign(s1)) * min(abs(s0), abs(s1), 0.5 * abs(p)) || 0;
+};
+var calcEndSlope = (h, dy, t) => h ? (3 * dy / h - t) / 2 : t;
+var monotoneX = (path, points, start = true) => {
+  const n = points.length;
+  if (n <= 0) return;
+  if (start) path.M(points[0][0], points[0][1]);
+  if (n === 1) return;
+  if (n === 2) {
+    path.L(points[1][0], points[1][1]);
+    return;
+  }
+  const slopes = new Array(n);
+  for (let i = 0; i < n - 1; i++) {
+    const h = points[i + 1][0] - points[i][0];
+    const s = (points[i + 1][1] - points[i][1]) / (h || (i + 1 < n - 1 && points[i + 2][0] - points[i + 1][0] < 0 ? -0 : 1));
+    if (i === 0) {
+      slopes[0] = s;
+    }
+    if (i > 0) {
+      const h02 = points[i][0] - points[i - 1][0];
+      const s0 = (points[i][1] - points[i - 1][1]) / (h02 || (h < 0 ? -0 : 1));
+      slopes[i] = calcSlope(h02, h, s0, s);
+    }
+  }
+  const h0 = points[1][0] - points[0][0];
+  slopes[0] = calcEndSlope(h0, points[1][1] - points[0][1], slopes[1]);
+  const hN = points[n - 1][0] - points[n - 2][0];
+  slopes[n - 1] = calcEndSlope(hN, points[n - 1][1] - points[n - 2][1], slopes[n - 2]);
+  for (let i = 0; i < n - 1; i++) {
+    const dx = (points[i + 1][0] - points[i][0]) / 3;
+    path.C(points[i][0] + dx, points[i][1] + dx * slopes[i], points[i + 1][0] - dx, points[i + 1][1] - dx * slopes[i + 1], points[i + 1][0], points[i + 1][1]);
+  }
+};
+var monotoneY = (path, points, start = true) => {
+  const n = points.length;
+  if (n <= 0) return;
+  if (start) path.M(points[0][0], points[0][1]);
+  if (n === 1) return;
+  if (n === 2) {
+    path.L(points[1][0], points[1][1]);
+    return;
+  }
+  const slopes = new Array(n);
+  for (let i = 0; i < n - 1; i++) {
+    const h = points[i + 1][1] - points[i][1];
+    const s = (points[i + 1][0] - points[i][0]) / (h || (i + 1 < n - 1 && points[i + 2][1] - points[i + 1][1] < 0 ? -0 : 1));
+    if (i === 0) slopes[0] = s;
+    if (i > 0) {
+      const h02 = points[i][1] - points[i - 1][1];
+      const s0 = (points[i][0] - points[i - 1][0]) / (h02 || (h < 0 ? -0 : 1));
+      slopes[i] = calcSlope(h02, h, s0, s);
+    }
+  }
+  const h0 = points[1][1] - points[0][1];
+  slopes[0] = calcEndSlope(h0, points[1][0] - points[0][0], slopes[1]);
+  const hN = points[n - 1][1] - points[n - 2][1];
+  slopes[n - 1] = calcEndSlope(hN, points[n - 1][0] - points[n - 2][0], slopes[n - 2]);
+  for (let i = 0; i < n - 1; i++) {
+    const dy = (points[i + 1][1] - points[i][1]) / 3;
+    path.C(points[i][0] + dy * slopes[i], points[i][1] + dy, points[i + 1][0] - dy * slopes[i + 1], points[i + 1][1] - dy, points[i + 1][0], points[i + 1][1]);
+  }
+};
+var basis = (path, points, start = true) => {
+  const n = points.length;
+  if (n <= 0) return;
+  if (start) path.M(points[0][0], points[0][1]);
+  if (n < 3) {
+    for (let i = 1; i < n; i++) path.L(points[i][0], points[i][1]);
+    return;
+  }
+  let x0 = points[0][0], y0 = points[0][1];
+  let x1 = points[1][0], y1 = points[1][1];
+  path.C((2 * x0 + x1) / 3, (2 * y0 + y1) / 3, (x0 + 2 * x1) / 3, (y0 + 2 * y1) / 3, (x0 + 4 * x1 + points[2][0]) / 6, (y0 + 4 * y1 + points[2][1]) / 6);
+  for (let i = 2; i < n - 1; i++) {
+    x0 = points[i - 1][0];
+    y0 = points[i - 1][1];
+    x1 = points[i][0];
+    y1 = points[i][1];
+    const x2 = points[i + 1][0], y2 = points[i + 1][1];
+    path.C((2 * x0 + x1) / 3, (2 * y0 + y1) / 3, (x0 + 2 * x1) / 3, (y0 + 2 * y1) / 3, (x0 + 4 * x1 + x2) / 6, (y0 + 4 * y1 + y2) / 6);
+  }
+  x0 = points[n - 2][0];
+  y0 = points[n - 2][1];
+  x1 = points[n - 1][0];
+  y1 = points[n - 1][1];
+  path.C((2 * x0 + x1) / 3, (2 * y0 + y1) / 3, (x0 + 2 * x1) / 3, (y0 + 2 * y1) / 3, x1, y1);
+};
+var cardinal = (tension = 0) => {
+  const k = (1 - tension) / 6;
+  return (path, points, start = true) => {
+    const n = points.length;
+    if (n <= 0) return;
+    if (start) path.M(points[0][0], points[0][1]);
+    if (n < 3) {
+      for (let i = 1; i < n; i++) path.L(points[i][0], points[i][1]);
+      return;
+    }
+    let p0 = points[0], p1 = points[0], p2 = points[1], p3 = points[2];
+    path.C(p1[0] + k * (p2[0] - p0[0]), p1[1] + k * (p2[1] - p0[1]), p2[0] - k * (p3[0] - p1[0]), p2[1] - k * (p3[1] - p1[1]), p2[0], p2[1]);
+    for (let i = 2; i < n - 1; i++) {
+      p0 = points[i - 2];
+      p1 = points[i - 1];
+      p2 = points[i];
+      p3 = points[i + 1];
+      path.C(p1[0] + k * (p2[0] - p0[0]), p1[1] + k * (p2[1] - p0[1]), p2[0] - k * (p3[0] - p1[0]), p2[1] - k * (p3[1] - p1[1]), p2[0], p2[1]);
+    }
+    p0 = points[n - 3];
+    p1 = points[n - 2];
+    p2 = points[n - 1];
+    p3 = points[n - 1];
+    path.C(p1[0] + k * (p2[0] - p0[0]), p1[1] + k * (p2[1] - p0[1]), p2[0] - k * (p3[0] - p1[0]), p2[1] - k * (p3[1] - p1[1]), p2[0], p2[1]);
+  };
+};
+var catmullRom = (alpha = 0.5) => {
+  return (path, points, start = true) => {
+    const n = points.length;
+    if (n <= 0) return;
+    if (start) path.M(points[0][0], points[0][1]);
+    if (n < 3) {
+      for (let i = 1; i < n; i++) path.L(points[i][0], points[i][1]);
+      return;
+    }
+    for (let i = 1; i < n; i++) {
+      const p0 = points[Math.max(0, i - 2)];
+      const p1 = points[i - 1];
+      const p2 = points[i];
+      const p3 = points[Math.min(n - 1, i + 1)];
+      const d1 = Math.hypot(p2[0] - p1[0], p2[1] - p1[1]);
+      const d0 = Math.hypot(p1[0] - p0[0], p1[1] - p0[1]);
+      const d2 = Math.hypot(p3[0] - p2[0], p3[1] - p2[1]);
+      const a1 = 2 * Math.pow(d0, 2 * alpha);
+      const a2 = 2 * Math.pow(d1, 2 * alpha);
+      const a3 = 2 * Math.pow(d2, 2 * alpha);
+      const den1 = a1 + a2;
+      const den2 = a2 + a3;
+      const cp1x = den1 > 0 ? p1[0] + (p2[0] - p0[0]) * a2 / den1 / 3 : p1[0];
+      const cp1y = den1 > 0 ? p1[1] + (p2[1] - p0[1]) * a2 / den1 / 3 : p1[1];
+      const cp2x = den2 > 0 ? p2[0] - (p3[0] - p1[0]) * a2 / den2 / 3 : p2[0];
+      const cp2y = den2 > 0 ? p2[1] - (p3[1] - p1[1]) * a2 / den2 / 3 : p2[1];
+      path.C(cp1x, cp1y, cp2x, cp2y, p2[0], p2[1]);
+    }
+  };
+};
+var curveMap = {
+  linear,
+  natural,
+  basis,
+  "bump-x": bumpX,
+  "bump-y": bumpY,
+  "monotone-x": monotoneX,
+  "monotone-y": monotoneY,
+  step,
+  "step-before": stepBefore,
+  "step-after": stepAfter,
+  cardinal: cardinal(),
+  "catmull-rom": catmullRom()
+};
+// Annotate the CommonJS export names for ESM import in node:
+0 && (module.exports = {
+  basis,
+  bumpX,
+  bumpY,
+  cardinal,
+  catmullRom,
+  curveMap,
+  linear,
+  monotoneX,
+  monotoneY,
+  natural,
+  step,
+  stepAfter,
+  stepBefore
+});

package/dist/main.d.cts

@@ -0,0 +1,19 @@
+import { Path } from 'rendx-path';
+
+/** 曲线函数签名 */
+type Curve = (path: Path, points: [number, number][], start?: boolean) => void;
+declare const linear: Curve;
+declare const step: Curve;
+declare const stepBefore: Curve;
+declare const stepAfter: Curve;
+declare const bumpX: Curve;
+declare const bumpY: Curve;
+declare const natural: Curve;
+declare const monotoneX: Curve;
+declare const monotoneY: Curve;
+declare const basis: Curve;
+declare const cardinal: (tension?: number) => Curve;
+declare const catmullRom: (alpha?: number) => Curve;
+declare const curveMap: Record<string, Curve>;
+
+export { type Curve, basis, bumpX, bumpY, cardinal, catmullRom, curveMap, linear, monotoneX, monotoneY, natural, step, stepAfter, stepBefore };

package/dist/main.d.ts

@@ -0,0 +1,19 @@
+import { Path } from 'rendx-path';
+
+/** 曲线函数签名 */
+type Curve = (path: Path, points: [number, number][], start?: boolean) => void;
+declare const linear: Curve;
+declare const step: Curve;
+declare const stepBefore: Curve;
+declare const stepAfter: Curve;
+declare const bumpX: Curve;
+declare const bumpY: Curve;
+declare const natural: Curve;
+declare const monotoneX: Curve;
+declare const monotoneY: Curve;
+declare const basis: Curve;
+declare const cardinal: (tension?: number) => Curve;
+declare const catmullRom: (alpha?: number) => Curve;
+declare const curveMap: Record<string, Curve>;
+
+export { type Curve, basis, bumpX, bumpY, cardinal, catmullRom, curveMap, linear, monotoneX, monotoneY, natural, step, stepAfter, stepBefore };

package/dist/main.js

@@ -0,0 +1,268 @@
+// src/curve.ts
+var linear = (path, points, start = true) => {
+  if (points.length <= 0) return;
+  if (start) path.M(points[0][0], points[0][1]);
+  for (let i = 1; i < points.length; i++) path.L(points[i][0], points[i][1]);
+};
+var step = (path, points, start = true) => {
+  if (points.length <= 0) return;
+  if (start) path.M(points[0][0], points[0][1]);
+  for (let i = 1; i < points.length; i++) {
+    const mx = (points[i - 1][0] + points[i][0]) / 2;
+    path.L(mx, points[i - 1][1]);
+    path.L(mx, points[i][1]);
+    path.L(points[i][0], points[i][1]);
+  }
+};
+var stepBefore = (path, points, start = true) => {
+  if (points.length <= 0) return;
+  if (start) path.M(points[0][0], points[0][1]);
+  for (let i = 1; i < points.length; i++) {
+    path.L(points[i - 1][0], points[i][1]);
+    path.L(points[i][0], points[i][1]);
+  }
+};
+var stepAfter = (path, points, start = true) => {
+  if (points.length <= 0) return;
+  if (start) path.M(points[0][0], points[0][1]);
+  for (let i = 1; i < points.length; i++) {
+    path.L(points[i][0], points[i - 1][1]);
+    path.L(points[i][0], points[i][1]);
+  }
+};
+var bumpX = (path, points, start = true) => {
+  if (points.length <= 0) return;
+  if (start) path.M(points[0][0], points[0][1]);
+  for (let i = 1; i < points.length; i++) {
+    const cpx = (points[i - 1][0] + points[i][0]) / 2;
+    path.C(cpx, points[i - 1][1], cpx, points[i][1], points[i][0], points[i][1]);
+  }
+};
+var bumpY = (path, points, start = true) => {
+  if (points.length <= 0) return;
+  if (start) path.M(points[0][0], points[0][1]);
+  for (let i = 1; i < points.length; i++) {
+    const cpy = (points[i - 1][1] + points[i][1]) / 2;
+    path.C(points[i - 1][0], cpy, points[i][0], cpy, points[i][0], points[i][1]);
+  }
+};
+var solveTridiagonal = (coords) => {
+  const n = coords.length - 1;
+  const a = new Array(n);
+  const b = new Array(n);
+  const r = new Array(n);
+  a[0] = 0;
+  b[0] = 2;
+  r[0] = coords[0] + 2 * coords[1];
+  for (let i = 1; i < n - 1; i++) {
+    a[i] = 1;
+    b[i] = 4;
+    r[i] = 4 * coords[i] + 2 * coords[i + 1];
+  }
+  a[n - 1] = 2;
+  b[n - 1] = 7;
+  r[n - 1] = 8 * coords[n - 1] + coords[n];
+  for (let i = 1; i < n; i++) {
+    const m = a[i] / b[i - 1];
+    b[i] -= m;
+    r[i] -= m * r[i - 1];
+  }
+  a[n - 1] = r[n - 1] / b[n - 1];
+  for (let i = n - 2; i >= 0; i--) a[i] = (r[i] - a[i + 1]) / b[i];
+  b[n - 1] = (coords[n] + a[n - 1]) / 2;
+  for (let i = 0; i < n - 1; i++) b[i] = 2 * coords[i + 1] - a[i + 1];
+  return [a, b];
+};
+var natural = (path, points, start = true) => {
+  const len = points.length;
+  if (len <= 1) return;
+  const xs = new Array(len);
+  const ys = new Array(len);
+  for (let i = 0; i < len; i++) {
+    xs[i] = points[i][0];
+    ys[i] = points[i][1];
+  }
+  const [cx, bx] = solveTridiagonal(xs);
+  const [cy, by] = solveTridiagonal(ys);
+  if (start) path.M(points[0][0], points[0][1]);
+  for (let i = 0; i < cx.length; i++) {
+    path.C(cx[i], cy[i], bx[i], by[i], points[i + 1][0], points[i + 1][1]);
+  }
+};
+var sign = (x) => x < 0 ? -1 : 1;
+var { min, abs } = Math;
+var calcSlope = (h0, h1, s0, s1) => {
+  const p = (s0 * h1 + s1 * h0) / (h0 + h1);
+  return (sign(s0) + sign(s1)) * min(abs(s0), abs(s1), 0.5 * abs(p)) || 0;
+};
+var calcEndSlope = (h, dy, t) => h ? (3 * dy / h - t) / 2 : t;
+var monotoneX = (path, points, start = true) => {
+  const n = points.length;
+  if (n <= 0) return;
+  if (start) path.M(points[0][0], points[0][1]);
+  if (n === 1) return;
+  if (n === 2) {
+    path.L(points[1][0], points[1][1]);
+    return;
+  }
+  const slopes = new Array(n);
+  for (let i = 0; i < n - 1; i++) {
+    const h = points[i + 1][0] - points[i][0];
+    const s = (points[i + 1][1] - points[i][1]) / (h || (i + 1 < n - 1 && points[i + 2][0] - points[i + 1][0] < 0 ? -0 : 1));
+    if (i === 0) {
+      slopes[0] = s;
+    }
+    if (i > 0) {
+      const h02 = points[i][0] - points[i - 1][0];
+      const s0 = (points[i][1] - points[i - 1][1]) / (h02 || (h < 0 ? -0 : 1));
+      slopes[i] = calcSlope(h02, h, s0, s);
+    }
+  }
+  const h0 = points[1][0] - points[0][0];
+  slopes[0] = calcEndSlope(h0, points[1][1] - points[0][1], slopes[1]);
+  const hN = points[n - 1][0] - points[n - 2][0];
+  slopes[n - 1] = calcEndSlope(hN, points[n - 1][1] - points[n - 2][1], slopes[n - 2]);
+  for (let i = 0; i < n - 1; i++) {
+    const dx = (points[i + 1][0] - points[i][0]) / 3;
+    path.C(points[i][0] + dx, points[i][1] + dx * slopes[i], points[i + 1][0] - dx, points[i + 1][1] - dx * slopes[i + 1], points[i + 1][0], points[i + 1][1]);
+  }
+};
+var monotoneY = (path, points, start = true) => {
+  const n = points.length;
+  if (n <= 0) return;
+  if (start) path.M(points[0][0], points[0][1]);
+  if (n === 1) return;
+  if (n === 2) {
+    path.L(points[1][0], points[1][1]);
+    return;
+  }
+  const slopes = new Array(n);
+  for (let i = 0; i < n - 1; i++) {
+    const h = points[i + 1][1] - points[i][1];
+    const s = (points[i + 1][0] - points[i][0]) / (h || (i + 1 < n - 1 && points[i + 2][1] - points[i + 1][1] < 0 ? -0 : 1));
+    if (i === 0) slopes[0] = s;
+    if (i > 0) {
+      const h02 = points[i][1] - points[i - 1][1];
+      const s0 = (points[i][0] - points[i - 1][0]) / (h02 || (h < 0 ? -0 : 1));
+      slopes[i] = calcSlope(h02, h, s0, s);
+    }
+  }
+  const h0 = points[1][1] - points[0][1];
+  slopes[0] = calcEndSlope(h0, points[1][0] - points[0][0], slopes[1]);
+  const hN = points[n - 1][1] - points[n - 2][1];
+  slopes[n - 1] = calcEndSlope(hN, points[n - 1][0] - points[n - 2][0], slopes[n - 2]);
+  for (let i = 0; i < n - 1; i++) {
+    const dy = (points[i + 1][1] - points[i][1]) / 3;
+    path.C(points[i][0] + dy * slopes[i], points[i][1] + dy, points[i + 1][0] - dy * slopes[i + 1], points[i + 1][1] - dy, points[i + 1][0], points[i + 1][1]);
+  }
+};
+var basis = (path, points, start = true) => {
+  const n = points.length;
+  if (n <= 0) return;
+  if (start) path.M(points[0][0], points[0][1]);
+  if (n < 3) {
+    for (let i = 1; i < n; i++) path.L(points[i][0], points[i][1]);
+    return;
+  }
+  let x0 = points[0][0], y0 = points[0][1];
+  let x1 = points[1][0], y1 = points[1][1];
+  path.C((2 * x0 + x1) / 3, (2 * y0 + y1) / 3, (x0 + 2 * x1) / 3, (y0 + 2 * y1) / 3, (x0 + 4 * x1 + points[2][0]) / 6, (y0 + 4 * y1 + points[2][1]) / 6);
+  for (let i = 2; i < n - 1; i++) {
+    x0 = points[i - 1][0];
+    y0 = points[i - 1][1];
+    x1 = points[i][0];
+    y1 = points[i][1];
+    const x2 = points[i + 1][0], y2 = points[i + 1][1];
+    path.C((2 * x0 + x1) / 3, (2 * y0 + y1) / 3, (x0 + 2 * x1) / 3, (y0 + 2 * y1) / 3, (x0 + 4 * x1 + x2) / 6, (y0 + 4 * y1 + y2) / 6);
+  }
+  x0 = points[n - 2][0];
+  y0 = points[n - 2][1];
+  x1 = points[n - 1][0];
+  y1 = points[n - 1][1];
+  path.C((2 * x0 + x1) / 3, (2 * y0 + y1) / 3, (x0 + 2 * x1) / 3, (y0 + 2 * y1) / 3, x1, y1);
+};
+var cardinal = (tension = 0) => {
+  const k = (1 - tension) / 6;
+  return (path, points, start = true) => {
+    const n = points.length;
+    if (n <= 0) return;
+    if (start) path.M(points[0][0], points[0][1]);
+    if (n < 3) {
+      for (let i = 1; i < n; i++) path.L(points[i][0], points[i][1]);
+      return;
+    }
+    let p0 = points[0], p1 = points[0], p2 = points[1], p3 = points[2];
+    path.C(p1[0] + k * (p2[0] - p0[0]), p1[1] + k * (p2[1] - p0[1]), p2[0] - k * (p3[0] - p1[0]), p2[1] - k * (p3[1] - p1[1]), p2[0], p2[1]);
+    for (let i = 2; i < n - 1; i++) {
+      p0 = points[i - 2];
+      p1 = points[i - 1];
+      p2 = points[i];
+      p3 = points[i + 1];
+      path.C(p1[0] + k * (p2[0] - p0[0]), p1[1] + k * (p2[1] - p0[1]), p2[0] - k * (p3[0] - p1[0]), p2[1] - k * (p3[1] - p1[1]), p2[0], p2[1]);
+    }
+    p0 = points[n - 3];
+    p1 = points[n - 2];
+    p2 = points[n - 1];
+    p3 = points[n - 1];
+    path.C(p1[0] + k * (p2[0] - p0[0]), p1[1] + k * (p2[1] - p0[1]), p2[0] - k * (p3[0] - p1[0]), p2[1] - k * (p3[1] - p1[1]), p2[0], p2[1]);
+  };
+};
+var catmullRom = (alpha = 0.5) => {
+  return (path, points, start = true) => {
+    const n = points.length;
+    if (n <= 0) return;
+    if (start) path.M(points[0][0], points[0][1]);
+    if (n < 3) {
+      for (let i = 1; i < n; i++) path.L(points[i][0], points[i][1]);
+      return;
+    }
+    for (let i = 1; i < n; i++) {
+      const p0 = points[Math.max(0, i - 2)];
+      const p1 = points[i - 1];
+      const p2 = points[i];
+      const p3 = points[Math.min(n - 1, i + 1)];
+      const d1 = Math.hypot(p2[0] - p1[0], p2[1] - p1[1]);
+      const d0 = Math.hypot(p1[0] - p0[0], p1[1] - p0[1]);
+      const d2 = Math.hypot(p3[0] - p2[0], p3[1] - p2[1]);
+      const a1 = 2 * Math.pow(d0, 2 * alpha);
+      const a2 = 2 * Math.pow(d1, 2 * alpha);
+      const a3 = 2 * Math.pow(d2, 2 * alpha);
+      const den1 = a1 + a2;
+      const den2 = a2 + a3;
+      const cp1x = den1 > 0 ? p1[0] + (p2[0] - p0[0]) * a2 / den1 / 3 : p1[0];
+      const cp1y = den1 > 0 ? p1[1] + (p2[1] - p0[1]) * a2 / den1 / 3 : p1[1];
+      const cp2x = den2 > 0 ? p2[0] - (p3[0] - p1[0]) * a2 / den2 / 3 : p2[0];
+      const cp2y = den2 > 0 ? p2[1] - (p3[1] - p1[1]) * a2 / den2 / 3 : p2[1];
+      path.C(cp1x, cp1y, cp2x, cp2y, p2[0], p2[1]);
+    }
+  };
+};
+var curveMap = {
+  linear,
+  natural,
+  basis,
+  "bump-x": bumpX,
+  "bump-y": bumpY,
+  "monotone-x": monotoneX,
+  "monotone-y": monotoneY,
+  step,
+  "step-before": stepBefore,
+  "step-after": stepAfter,
+  cardinal: cardinal(),
+  "catmull-rom": catmullRom()
+};
+export {
+  basis,
+  bumpX,
+  bumpY,
+  cardinal,
+  catmullRom,
+  curveMap,
+  linear,
+  monotoneX,
+  monotoneY,
+  natural,
+  step,
+  stepAfter,
+  stepBefore
+};

package/package.json

@@ -0,0 +1,46 @@
+{
+  "name": "rendx-curve",
+  "version": "0.1.0",
+  "description": "Curve interpolation algorithms (linear, natural, bump, monotone, step)",
+  "license": "MIT",
+  "author": "wei.liang (https://github.com/weiliang0121)",
+  "type": "module",
+  "keywords": [
+    "rendx",
+    "2d",
+    "canvas",
+    "rendering",
+    "visualization",
+    "scene-graph"
+  ],
+  "homepage": "https://weiliang0121.github.io/rendx/",
+  "repository": {
+    "type": "git",
+    "url": "https://github.com/weiliang0121/rendx.git",
+    "directory": "packages/curve"
+  },
+  "main": "dist/main.cjs",
+  "module": "dist/main.js",
+  "types": "dist/main.d.ts",
+  "exports": {
+    ".": {
+      "types": "./dist/main.d.ts",
+      "import": "./dist/main.js",
+      "require": "./dist/main.cjs"
+    }
+  },
+  "dependencies": {
+    "rendx-path": "^0.1.0"
+  },
+  "sideEffects": false,
+  "files": [
+    "dist"
+  ],
+  "publishConfig": {
+    "access": "public"
+  },
+  "scripts": {
+    "build": "tsup",
+    "dev": "tsup --watch"
+  }
+}