plotboilerplate 1.29.0 → 1.31.0

package/src/ts/CubicBezierCurve.ts

@@ -32,8 +32,9 @@
  * @modified 2025-04-18 Added evaluation method for cubic Bézier curves `CubicBezierCurve.utils.evaluateT`.
  * @modified 2025-04-18 Refactored method `CubicBezierCurve.getPointAt` to use `evaluateT`.
  * @modified 2025-04-18 Fixed the `CubicBezierCurve.getBounds` method: now returning the real bounding box. Before it was an approximated one.
- * @modified 2025-ß4-18 Added helper methods for bounding box calculation `CubucBezierCurve.util.cubicPolyMinMax` and `cubicPoly`.
- * @version 2.9.0
+ * @modified 2025-04-18 Added helper methods for bounding box calculation `CubucBezierCurve.util.cubicPolyMinMax` and `cubicPoly`.
+ * @modified 2026-09-09 Adding methods `CubicBezierCurve.trimStartEnd` and `CubicBezierCurve.trimStartEndAt`.
+ * @version 2.10.0
  *
  * @file CubicBezierCurve
  * @public
@@ -401,30 +402,30 @@ export class CubicBezierCurve implements IBounded, Intersectable, PathSegment {
     // Thanks to Richard "RM" for the Bézier bounds calculatin
     //    https://jsfiddle.net/SalixAlba/QQnvm/4/
 
-      const xMinMax = CubicBezierCurve.utils.cubicPolyMinMax(
-        this.startPoint.x,
-        this.startControlPoint.x,
-        this.endControlPoint.x,
-        this.endPoint.x
-      );
-      const xl = xMinMax.min;
-      const xh = xMinMax.max;
-
-      const yMinMax = CubicBezierCurve.utils.cubicPolyMinMax(
-        this.startPoint.y,
-        this.startControlPoint.y,
-        this.endControlPoint.y,
-        this.endPoint.y
-      );
-      const yl = yMinMax.min;
-      const yh = yMinMax.max;
-
-      return Bounds.computeFromVertices([
-        { x: xl, y: yl },
-        { x: xl, y: yh },
-        { x: xh, y: yh },
-        { x: xh, y: yl }
-      ]);
+    const xMinMax = CubicBezierCurve.utils.cubicPolyMinMax(
+      this.startPoint.x,
+      this.startControlPoint.x,
+      this.endControlPoint.x,
+      this.endPoint.x
+    );
+    const xl = xMinMax.min;
+    const xh = xMinMax.max;
+
+    const yMinMax = CubicBezierCurve.utils.cubicPolyMinMax(
+      this.startPoint.y,
+      this.startControlPoint.y,
+      this.endControlPoint.y,
+      this.endPoint.y
+    );
+    const yl = yMinMax.min;
+    const yh = yMinMax.max;
+
+    return Bounds.computeFromVertices([
+      { x: xl, y: yl },
+      { x: xl, y: yh },
+      { x: xh, y: yh },
+      { x: xh, y: yl }
+    ]);
   }
   //--- END --- Implement interface `IBounded`
 
@@ -526,8 +527,20 @@ export class CubicBezierCurve implements IBounded, Intersectable, PathSegment {
     //   this.startControlPoint.y * 3 * t * Math.pow(1.0 - t, 2) +
     //   this.endControlPoint.y * 3 * Math.pow(t, 2) * (1.0 - t) +
     //   this.endPoint.y * Math.pow(t, 3);
-    const x: number = CubicBezierCurve.utils.evaluateT(this.startPoint.x, this.startControlPoint.x, this.endControlPoint.x, this.endPoint.x, t);
-    const y: number = CubicBezierCurve.utils.evaluateT(this.startPoint.y, this.startControlPoint.y, this.endControlPoint.y, this.endPoint.y, t);
+    const x: number = CubicBezierCurve.utils.evaluateT(
+      this.startPoint.x,
+      this.startControlPoint.x,
+      this.endControlPoint.x,
+      this.endPoint.x,
+      t
+    );
+    const y: number = CubicBezierCurve.utils.evaluateT(
+      this.startPoint.y,
+      this.startControlPoint.y,
+      this.endControlPoint.y,
+      this.endPoint.y,
+      t
+    );
     return new Vertex(x, y);
   }
 
@@ -611,6 +624,7 @@ export class CubicBezierCurve implements IBounded, Intersectable, PathSegment {
     this.endControlPoint.set(subCurbePoints[3]);
     this.updateArcLengths();
     return this;
+    // return this.trimStartEndAt(t, null);
   }
 
   /**
@@ -648,8 +662,88 @@ export class CubicBezierCurve implements IBounded, Intersectable, PathSegment {
     this.endControlPoint.set(subCurbePoints[3]);
     this.updateArcLengths();
     return this;
+    // return this.trimStartEndAt(null, t);
   }
 
+  /**
+   * Trim off a start and end section of this curve. The position parameters `uStart` and `uEnd` are the absolute positions in [0..arcLength].
+   * The remaining curve will be the one in the bounds `[uStart,uEnd]` (so `[0.0,uStart]` and `[uEnd,1.0]` are cut off).
+   *
+   * Parameters out of bounds (< 0.0 or > arcLength) are ignored.
+   * If `uEnd` is smaller than `uStart` then a curve with length zero (0) at `uStart` is returned.
+   *
+   * @method trimStartEndAt
+   * @instance
+   * @memberof CubicBezierCurve
+   * @param {number} tStart - The relative position parameter where to cut off the head curve.
+   * @param {number} tEnd - The relative position parameter where to cut off the tail curve.
+   * @returns {CubicBezierCurve} `this` for chanining.
+   */
+
+  trimStartEnd(uStart: number, uEnd: number): CubicBezierCurve {
+    return this.trimStartEndAt(this.convertU2T(uStart), this.convertU2T(uEnd));
+  }
+
+  /**
+   * Trim off a start and end section of this curve. The position parameters `tStart` and `tEnd` are the relative positions in [0..1].
+   * The remaining curve will be the one in the bounds `[tStart,tEnd]` (so `[0.0,tStart]` and `[tEnd,1.0]` are cut off).
+   *
+   * Parameters out of bounds (< 0.0 or > 1.0) are ignored.
+   * If `tEnd` is smaller than `tStart` then a curve with length zero (0) at `tStart` is returned.
+   *
+   * @method trimStartEndAt
+   * @instance
+   * @memberof CubicBezierCurve
+   * @param {number} tStart - The relative position parameter where to cut off the head curve.
+   * @param {number} tEnd - The relative position parameter where to cut off the tail curve.
+   * @returns {CubicBezierCurve} `this` for chanining.
+   */
+
+  trimStartEndAt(tStart: number, tEnd: number): CubicBezierCurve {
+    const cleanTrimStart = Math.min(Math.max(0.0, tStart), 1.0);
+    const cleanTrimEnd = Math.min(Math.max(cleanTrimStart, tEnd), 1.0);
+    this.trimStartAt(cleanTrimStart);
+    const relativeTrimEnd = (cleanTrimEnd - cleanTrimStart) / (1.0 - cleanTrimStart);
+    this.trimEndAt(relativeTrimEnd);
+    return this;
+  }
+
+  // __trimStartEndAt(tStart: number, tEnd: number): CubicBezierCurve {
+  //   var finalCurvePoints = [
+  //     this.startPoint.clone(),
+  //     this.endPoint.clone(),
+  //     this.startControlPoint.clone(),
+  //     this.endControlPoint.clone()
+  //   ];
+  //   if (typeof tStart === "number" && !Number.isNaN(tStart)) {
+  //     const subCurvePointsStart = CubicBezierCurve.utils.getSubCurvePointsAt(this, tStart, 1.0);
+  //     finalCurvePoints[0].set(subCurvePointsStart[0]);
+  //     finalCurvePoints[2].set(subCurvePointsStart[2]);
+  //     // this.startPoint.set(subCurvePointsStart[0]);
+  //     // this.startControlPoint.set(subCurvePointsStart[2]);
+  //     // this.endPoint.set(subCurvePointsStart[1]);
+  //     // this.endControlPoint.set(subCurvePointsStart[3]);
+  //   }
+
+  //   if (typeof tEnd === "number" && !Number.isNaN(tEnd)) {
+  //     const subCurvePointsEnd = CubicBezierCurve.utils.getSubCurvePointsAt(this, 0.0, tEnd);
+  //     // this.startPoint.set(subCurvePointsEnd[0]);
+  //     // this.startControlPoint.set(subCurvePointsEnd[2]);
+  //     // this.endPoint.set(subCurvePointsEnd[1]);
+  //     // this.endControlPoint.set(subCurvePointsEnd[3]);
+  //     finalCurvePoints[1].set(subCurvePointsEnd[1]);
+  //     finalCurvePoints[3].set(subCurvePointsEnd[3]);
+  //   }
+
+  //   this.startPoint.set(finalCurvePoints[0]);
+  //   this.endPoint.set(finalCurvePoints[1]);
+  //   this.startControlPoint.set(finalCurvePoints[2]);
+  //   this.endControlPoint.set(finalCurvePoints[3]);
+
+  //   this.updateArcLengths();
+  //   return this;
+  // }
+
   /**
    * Get a sub curve at the given start end end positions (values on the curve's length, between 0 and curve.arcLength).
    *
@@ -1027,15 +1121,13 @@ export class CubicBezierCurve implements IBounded, Intersectable, PathSegment {
    * Helper utils.
    */
   public static utils = {
-
-    evaluateT: (p0:number, p1:number, p2:number, p3:number, t:number) : number => {
-      return p0 * Math.pow(1.0 - t, 3) +
-        p1 * 3 * t * Math.pow(1.0 - t, 2) +
-        p2 * 3 * Math.pow(t, 2) * (1.0 - t) +
-        p3 * Math.pow(t, 3);
+    evaluateT: (p0: number, p1: number, p2: number, p3: number, t: number): number => {
+      return (
+        p0 * Math.pow(1.0 - t, 3) + p1 * 3 * t * Math.pow(1.0 - t, 2) + p2 * 3 * Math.pow(t, 2) * (1.0 - t) + p3 * Math.pow(t, 3)
+      );
     },
 
-    cubicPolyMinMax: (p0:number, p1:number, p2:number, p3:number) : { min: number, max: number }=> {
+    cubicPolyMinMax: (p0: number, p1: number, p2: number, p3: number): { min: number; max: number } => {
       // var polyX = CubicBezierCurve.utils.cubicPoly2(
       //   p0, // P[0].X, // bezierCurve.startPoint.x,
       //   p1, // P[1].X, // bezierCurve.startControlPoint.x,
@@ -1048,7 +1140,6 @@ export class CubicBezierCurve implements IBounded, Intersectable, PathSegment {
       // var c = polyX.c;
       // var disc = polyX.b * polyX.b - 4 * polyX.a * polyX.c;
 
-
       var polyX = CubicBezierCurve.utils.cubicPoly(
         p0, // P[0].X, // bezierCurve.startPoint.x,
         p1, // P[1].X, // bezierCurve.startControlPoint.x,
@@ -1062,7 +1153,6 @@ export class CubicBezierCurve implements IBounded, Intersectable, PathSegment {
       // var disc = b * b - 4 * a * c;
       var disc = polyX[1] * polyX[1] - 4 * polyX[0] * polyX[2];
 
-
       // var polyX = CubicBezierCurve.utils.bezierCoeffs(p3,p2,p1,p0);
       // var a = polyX[0]; //polyX.a;
       // var b = polyX[1]; // .b;
@@ -1111,7 +1201,7 @@ export class CubicBezierCurve implements IBounded, Intersectable, PathSegment {
      * @param {number} tEnd – The end offset if the desired cub curve (must be in [0..1]).
      * @instance
      * @memberof CubicBezierCurve
-     * @return {CubicBezierCurve} The sub curve as a new curve.
+     * @return {[Vertex, Vertex, Vertex, Vertex]} The sub curve as curve vertices.
      **/
     getSubCurvePointsAt: (curve: CubicBezierCurve, tStart: number, tEnd: number): [Vertex, Vertex, Vertex, Vertex] => {
       const startVec: Vector = new Vector(curve.getPointAt(tStart), curve.getTangentAt(tStart));
@@ -1196,8 +1286,8 @@ export class CubicBezierCurve implements IBounded, Intersectable, PathSegment {
      * @param {number} p3 - The end point coordinate.
      * @returns {[number,number,number,number]}
      */
-    bezierCoeffs: (p0: number, p1: number, p2: number, p3: number): [number,number,number,number] => {
-      const coeffs : [number,number,number,number]  = [NaN,NaN,NaN,NaN]; //Array(4);
+    bezierCoeffs: (p0: number, p1: number, p2: number, p3: number): [number, number, number, number] => {
+      const coeffs: [number, number, number, number] = [NaN, NaN, NaN, NaN]; //Array(4);
       coeffs[0] = -p0 + 3 * p1 + -3 * p2 + p3;
       coeffs[1] = 3 * p0 - 6 * p1 + 3 * p2;
       coeffs[2] = -3 * p0 + 3 * p1;
@@ -1207,22 +1297,17 @@ export class CubicBezierCurve implements IBounded, Intersectable, PathSegment {
 
     /**
      * Calculate the cubic polynomial coefficients used to find the bounding box.
-     * 
+     *
      * @param {number} p0 - The start point coordinate.
      * @param {number} p1 - The start control point coordinate.
      * @param {number} p2 - The end control point coordinate.
      * @param {number} p3 - The end point coordinate.
      * @returns {[number,number,number]}
      */
-    cubicPoly: (p0:number, p1:number, p2:number, p3:number) : [number,number,number] => {
-      return [
-         3 * p3 - 9 * p2 + 9 * p1 - 3 * p0,
-         6 * p0 - 12 * p1 + 6 * p2,
-         3 * p1 - 3 * p0
-      ]
+    cubicPoly: (p0: number, p1: number, p2: number, p3: number): [number, number, number] => {
+      return [3 * p3 - 9 * p2 + 9 * p1 - 3 * p0, 6 * p0 - 12 * p1 + 6 * p2, 3 * p1 - 3 * p0];
     },
 
-
     /**
      * sign of number, but is division safe: no zero returned :)
      */

package/src/ts/Line.ts

@@ -18,7 +18,8 @@
  * @modified 2023-09-25 Changed param type of `intersection()` from Line to VertTuple.
  * @modified 2025-04-15 Class `Line` now implements interface `Intersectable`.
  * @modified 2025-04-16 Class `Line` now implements interface `IBounded`.
- * @version  2.4.0
+ * @modified 2026-08-16 Adding methods `Line.trimStart` and `Line.trimEnd`. Adding methods `Line.trimStartAt` and `Line.trimEndAt`.
+ * @version  2.5.0
  *
  * @file Line
  * @public
@@ -165,6 +166,88 @@ export class Line extends VertTuple<Line> implements IBounded, Intersectable, Pa
   }
   //--- END Implement PathSegment ---
 
+  /**
+   * Trim this line segment from the start point by the given amount.
+   * The amount must be positive and should be withing the segment's length. If the amount exceeds the segment's length
+   * then the length of the resulting line will be zero (0.0).
+   *
+   * @method trimStart
+   * @memberof Line
+   * @param {number} amount - The positive amount to trim the line from the start point `a`.
+   * @returns {Line} This for chaining, with updated point `a`.
+   */
+  trimStart(amount: number) {
+    // Calculate the relative position `t` on this line.
+    var t: number = amount / this.length();
+    // `t` should be inside 0..1 – otherwise the amount was too large or negative.
+    if (t < 0.0) {
+      return this;
+    }
+    if (t > 1.0) {
+      // Set the line to length zero (endpoint only)
+      this.a = this.b.clone();
+      return this;
+    }
+    this.a = this.vertAt(t);
+    return this;
+  }
+
+  /**
+   * Trim this line segment from the start point by the given relative amount.
+   * The amount must be positive and should be within 0.0 and 1.0. If the amount exceeds the segment's length
+   * then the length of the resulting line will be zero (0.0).
+   *
+   * @method trimStartAt
+   * @memberof Line
+   * @param {number} amount - The positive amount to trim the line from the start point `a`.
+   * @returns {Line} This for chaining, with updated point `a`.
+   */
+  trimStartAt(relativeAmount: number) {
+    // Calculate the relative position `t` on this line.
+    return this.trimStart(relativeAmount * this.length());
+  }
+
+  /**
+   * Trim this line segment from the end point by the given amount.
+   * The amount must be positive and should be withing the segment's length. If the amount exceeds the segment's length
+   * then the length of the resulting line will be zero (0.0).
+   *
+   * @method trimEnd
+   * @memberof Line
+   * @param {number} amount - The positive amount to trim the line from the end point `b`.
+   * @returns {Line} This for chaining, with updated point `b`.
+   */
+  trimEnd(amount: number) {
+    // Calculate the relative position `t` on this line.
+    var t: number = 1.0 - amount / this.length();
+    // `t` should be inside 0..1 – otherwise the amount was too large or negative.
+    if (t < 0.0) {
+      return this;
+    }
+    if (t > 1.0) {
+      // Set the line to length zero (endpoint only)
+      this.b = this.a.clone();
+      return this;
+    }
+    this.b = this.vertAt(t);
+    return this;
+  }
+
+  /**
+   * Trim this line segment from the end point by the given relative amount.
+   * The amount must be positive and should be within 0.0 and 1.0. If the amount exceeds the segment's length
+   * then the length of the resulting line will be zero (0.0).
+   *
+   * @method trimEndAt
+   * @memberof Line
+   * @param {number} amount - The positive amount to trim the line from the start point `a`.
+   * @returns {Line} This for chaining, with updated point `a`.
+   */
+  trimEndAt(relativeAmount: number) {
+    // Calculate the relative position `t` on this line.
+    return this.trimEnd(relativeAmount * this.length());
+  }
+
   //--- BEGIN --- Implement interface `Intersectable`
   /**
    * Get all line intersections with this polygon.

package/src/ts/Polygon.ts

@@ -38,7 +38,9 @@
  * @modified 2025-05-16 Class `Polygon` now implements `IBounded`.
  * @modified 2025-05-20 Tweaking `Polygon.getInnerAngleAt` and `Polygo.isAngleAcute` to handle indices out of array bounds as well.
  * @modified 2025-06-07 Adding `Polygon.closestLineIntersectionIndex` to determine line intersections plus detected edge index.
- * @version 1.16.0
+ * @modified 2026-09-16 Adding a `forceClockwise` parameter to the `Polygon.getCentroid()` method.
+ * @modified 2026-09-21 Adding `Polygon.revert` method to change the winding order.
+ * @version 1.17.0
  *
  * @file Polygon
  * @public
@@ -400,6 +402,21 @@ export class Polygon implements IBounded, Intersectable, SVGSerializable {
     return Polygon.utils.isClockwise(this.vertices);
   }
 
+  /**
+   * Revert the order of this polygon's vertices to change the winding order.
+   * This operation is in-place.
+   *
+   * @method revert
+   * @instance
+   * @memberof Polygon
+   * @return {Polygon} This for chaining.
+   */
+  revert(): Polygon {
+    // this.vertices.slice().reverse(); // Copy?
+    this.vertices.reverse();
+    return this;
+  }
+
   /**
    * Get the perimeter of this polygon.
    * The perimeter is the absolute length of the outline.
@@ -483,35 +500,37 @@ export class Polygon implements IBounded, Intersectable, SVGSerializable {
 
   /**
    * Get centroid.
-   * Centroids define the barycenter of any non self-intersecting convex polygon.
+   * Centroids define the barycenter of any non self-intersecting convex clockwise polygon.
    *
-   * If the polygon is self intersecting or non konvex then the barycenter is not well defined.
+   * If the polygon is self intersecting or non convex or not clockwise then the barycenter is not well defined.
    *
    * https://mathworld.wolfram.com/PolygonCentroid.html
    *
    * @method getCentroid
    * @instance
+   * @param {boolean} forceClockwise - [optiona] If set to true then the centroid will be calculated for the clockwise polygon.
    * @memberof Polygon
    * @returns {Vertex|null}
    */
-  getCentroid(): Vertex | null {
+  getCentroid(forceClockwise?: boolean): Vertex | null {
     if (this.vertices.length === 0) {
       return null;
     }
-    const center: Vertex = new Vertex(0.0, 0.0);
-    const n = this.vertices.length;
-    for (var i = 0; i < n; i++) {
-      // center.add(this.vertices[i]);
-      const cur: Vertex = this.vertices[i];
-      const next: Vertex = this.vertices[(i + 1) % n];
-      var factor: number = cur.x * next.y - next.x * cur.y;
-      center.x += (cur.x + next.x) * factor;
-      center.y += (cur.y + next.y) * factor;
-    }
-    const area = this.area();
-    center.x *= 1 / (6 * area);
-    center.y *= 1 / (6 * area);
-    return center;
+    // const centroid: Vertex = new Vertex(0.0, 0.0);
+    // const n = this.vertices.length;
+    // for (var i = 0; i < n; i++) {
+    //   // center.add(this.vertices[i]);
+    //   const cur: Vertex = this.vertices[i];
+    //   const next: Vertex = this.vertices[(i + 1) % n];
+    //   var factor: number = cur.x * next.y - next.x * cur.y;
+    //   centroid.x += (cur.x + next.x) * factor;
+    //   centroid.y += (cur.y + next.y) * factor;
+    // }
+    // const area = this.area();
+    // centroid.x *= 1 / (6 * area);
+    // centroid.y *= 1 / (6 * area);
+    // return centroid;
+    return Polygon.utils.calculateCentroid(this.vertices, forceClockwise);
   }
 
   //--- BEGIN --- Implement interface `Intersectable`
@@ -972,6 +991,27 @@ export class Polygon implements IBounded, Intersectable, SVGSerializable {
       return Polygon.utils.signedArea(vertices) < 0;
     },
 
+    calculateCentroid(vertices: XYCoords[], forceClockwise?: boolean): Vertex {
+      const centroid: Vertex = new Vertex(0.0, 0.0);
+      const n = vertices.length;
+      if (forceClockwise && !Polygon.utils.isClockwise(vertices)) {
+        return Polygon.utils.calculateCentroid(vertices.slice().reverse());
+      }
+      for (var i = 0; i < n; i++) {
+        // center.add(this.vertices[i]);
+        const cur: XYCoords = vertices[i];
+        const next: XYCoords = vertices[(i + 1) % n];
+        var factor: number = cur.x * next.y - next.x * cur.y;
+        centroid.x += (cur.x + next.x) * factor;
+        centroid.y += (cur.y + next.y) * factor;
+      }
+      // const area = this.area();
+      const area = Polygon.utils.area(vertices);
+      centroid.x *= 1 / (6 * area);
+      centroid.y *= 1 / (6 * area);
+      return centroid;
+    },
+
     /**
      * Calulate the signed polyon area by interpreting the polygon as a matrix
      * and calculating its determinant.

package/src/ts/VertTuple.ts

@@ -17,13 +17,17 @@
  * @modified 2025-04-15 Changed param of `VertTuple.moveTo` method from `Vertex` to `XYCoords`.
  * @modified 2025-04-15 Added method `VertTuple.move` method.
  * @modified 2026-06-10 Adding helper function `VertTuple.utils.calcCircumcircle`.
- * @version 1.5.0
+ * @modified 2026-06-17 Adding method `VertTuple.asLine` for converting TertTuples to Line instances.
+ * @modified 2026-09-21 Adding method `VertTuple.asVector` for converting TertTuples to Vector instances.
+ * @version 1.7.0
  */
 
 import { Vertex } from "./Vertex";
 import { UIDGenerator } from "./UIDGenerator";
 import { XYCoords, UID } from "./interfaces";
 import { ICircle } from "./Circle";
+import { Line } from "./Line";
+import { Vector } from "./Vector";
 
 /**
  * @classdesc An abstract base classes for vertex tuple constructs, like Lines or Vectors.
@@ -360,7 +364,7 @@ export class VertTuple<T extends VertTuple<T>> {
   /**
    * Create a deep clone of this instance.
    *
-   * @method cloneLine
+   * @method clone
    * @return {T} A type safe clone if this instance.
    * @instance
    * @memberof VertTuple
@@ -369,6 +373,30 @@ export class VertTuple<T extends VertTuple<T>> {
     return this.factory(this.a.clone(), this.b.clone());
   }
 
+  /**
+   * Converts this `VertTuple` to a `Line` (segment).
+   *
+   * @method asLine
+   * @return {Line} This tuple as `Line` instance.
+   * @instance
+   * @memberof VertTuple
+   **/
+  asLine(): Line {
+    return new Line(this.a, this.b);
+  }
+
+  /**
+   * Converts this `VertTuple` to a `Vector` (arrow).
+   *
+   * @method asVector
+   * @return {Line} This tuple as `Vector` instance.
+   * @instance
+   * @memberof VertTuple
+   **/
+  asVector(): Vector {
+    return new Vector(this.a, this.b);
+  }
+
   /**
    * Create a string representation of this line.
    *

package/src/ts/Vertex.ts

@@ -37,7 +37,7 @@
  * @modified 2025-04-13 Adding the `Vertex.move(amount: XYCoords)` method (does the same as `add`, added by naming convention).
  * @modified 2025-05-07 Class `Vertex` is now implementing interface `IBounded` (to meet convention).
  * @modified 2026-06-10 Adding methods `Vertex.findClosestPoint` and `Vertex.findFarestPoint`.
- * @version  2.12.0
+ * @version  2.12.1
  *
  * @file Vertex
  * @public
@@ -569,7 +569,7 @@ export class Vertex implements IBounded, XYCoords, SVGSerializable {
    * around given center.
    *
    * @method rotate
-   * @param {number} angle - The angle to 'rotate' this vertex; 0.0 means no change.
+   * @param {number} angle - The angle in radians to 'rotate' this vertex; 0.0 means no change.
    * @param {XYCoords=} center - The center of rotation; default is (0,0).
    * @return {Vertex} this
    * @instance

package/src/ts/utils/_AppContext.ts_

@@ -0,0 +1,22 @@
+/**
+ * An experimental top class to wrap demo environments.
+ *
+ * @date     2026-04-13
+ * @modified 2026-09-15 Ported to Typescript.
+ * @author   Ikaros Kappler
+ * @version  1.0.0
+ */
+
+import PlotBoilerplate from "../PlotBoilerplate";
+
+export class AppContext<GlobalVars = Record<string, any>> {
+  pb: PlotBoilerplate;
+  config: any;
+
+  globals: Record<keyof GlobalVars, GlobalVars[keyof GlobalVars]>;
+
+  constructor(pb, config) {
+    this.pb = pb;
+    this.config = config;
+  }
+}