plotboilerplate 1.29.0 → 1.31.0

package/dist/index.esm.js

@@ -356,7 +356,8 @@ class VertexListeners {
  * @modified 2026-07-08 Adding the `Circle.setRadius` method (for chaining).
  * @mofified 2026-07-31 Adding the `radicalAxis(Circle)` method. Added the `Circle.circleUtils.createRadicalAxisHelperCircle` and `.circleDistance` helper methods.
  * @modified 2026-08-03 Adding `Circle.tangentsFromPoint`.
- * @version  1.7.0
+ * @modified 2026-08-16 Adding the `Circle.sectorAngleByArcLength` method and the `Circle.circleUtils.sectorAngleByArcLength` helper method.
+ * @version  1.8.0
  **/
 /**
  * @classdesc A simple circle: center point and radius.
@@ -731,6 +732,15 @@ class Circle {
         }
         return [new Vector(intersection.a, vert), new Vector(intersection.b, vert)];
     }
+    /**
+     * Calculate inner sector angle for this circle and a given circle arc length.
+     *
+     * @param {number} sectorArcLength - The desired arc length (in units).
+     * @returns The sector's inner angle (in radians).
+     */
+    sectorAngleByArcLength(sectorArcLength) {
+        return Circle.circleUtils.sectorAngleByArcLength(sectorArcLength, this.radius);
+    }
     /**
      * Create a deep copy of this circle.
      *
@@ -809,6 +819,16 @@ Circle.circleUtils = {
      */
     circleDistance: (circleA, circleB) => {
         return circleA.center.distance(circleB.center) - circleA.radius - circleB.radius;
+    },
+    /**
+     * Calculate the inner sector angle for a given circle arc length and radius.
+     *
+     * @param {number} sectorArcLength - The desired arc length.
+     * @param {number} circleRadius - The circle's radius.
+     * @returns The sector angle in radians.
+     */
+    sectorAngleByArcLength: (sectorArcLength, circleRadius) => {
+        return sectorArcLength / circleRadius;
     }
 };
 
@@ -1548,7 +1568,7 @@ const geomutils = {
  * @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
@@ -2019,7 +2039,7 @@ class Vertex$1 {
      * 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
@@ -2263,7 +2283,9 @@ Vertex$1.utils = {
  * @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
  */
 /**
  * @classdesc An abstract base classes for vertex tuple constructs, like Lines or Vectors.
@@ -2547,7 +2569,7 @@ class VertTuple {
     /**
      * Create a deep clone of this instance.
      *
-     * @method cloneLine
+     * @method clone
      * @return {T} A type safe clone if this instance.
      * @instance
      * @memberof VertTuple
@@ -2555,6 +2577,28 @@ class VertTuple {
     clone() {
         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() {
+        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() {
+        return new Vector(this.a, this.b);
+    }
     /**
      * Create a string representation of this line.
      *
@@ -2785,7 +2829,8 @@ Vector.utils = {
  * @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
@@ -2912,6 +2957,84 @@ class Line extends VertTuple {
         return this;
     }
     //--- 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) {
+        // Calculate the relative position `t` on this line.
+        var t = 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) {
+        // 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) {
+        // Calculate the relative position `t` on this line.
+        var t = 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) {
+        // 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.
@@ -2997,7 +3120,9 @@ class Line extends VertTuple {
  * @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
@@ -3291,6 +3416,20 @@ class Polygon {
         // return Polygon.utils.signedArea(this.vertices) < 0;
         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() {
+        // 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.
@@ -3372,35 +3511,37 @@ class Polygon {
     }
     /**
      * 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() {
+    getCentroid(forceClockwise) {
         if (this.vertices.length === 0) {
             return null;
         }
-        const center = new Vertex$1(0.0, 0.0);
-        const n = this.vertices.length;
-        for (var i = 0; i < n; i++) {
-            // center.add(this.vertices[i]);
-            const cur = this.vertices[i];
-            const next = this.vertices[(i + 1) % n];
-            var factor = 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`
     /**
@@ -3825,6 +3966,26 @@ Polygon.utils = {
     isClockwise(vertices) {
         return Polygon.utils.signedArea(vertices) < 0;
     },
+    calculateCentroid(vertices, forceClockwise) {
+        const centroid = new Vertex$1(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 = vertices[i];
+            const next = vertices[(i + 1) % n];
+            var factor = 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.
@@ -4214,8 +4375,9 @@ class Bounds {
  * @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
@@ -4664,6 +4826,7 @@ class CubicBezierCurve {
         this.endControlPoint.set(subCurbePoints[3]);
         this.updateArcLengths();
         return this;
+        // return this.trimStartEndAt(t, null);
     }
     /**
      * Trim off the end of this curve. The position parameter `uValue` is the absolute position on the
@@ -4699,7 +4862,79 @@ class CubicBezierCurve {
         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, uEnd) {
+        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, tEnd) {
+        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).
      *
@@ -5051,10 +5286,7 @@ CubicBezierCurve.END_POINT = 3;
  */
 CubicBezierCurve.utils = {
     evaluateT: (p0, p1, p2, p3, t) => {
-        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);
+        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, p1, p2, p3) => {
         // var polyX = CubicBezierCurve.utils.cubicPoly2(
@@ -5126,7 +5358,7 @@ CubicBezierCurve.utils = {
      * @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, tStart, tEnd) => {
         const startVec = new Vector(curve.getPointAt(tStart), curve.getTangentAt(tStart));
@@ -5215,11 +5447,7 @@ CubicBezierCurve.utils = {
      * @returns {[number,number,number]}
      */
     cubicPoly: (p0, p1, p2, p3) => {
-        return [
-            3 * p3 - 9 * p2 + 9 * p1 - 3 * p0,
-            6 * p0 - 12 * p1 + 6 * p2,
-            3 * p1 - 3 * p0
-        ];
+        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 :)
@@ -19184,7 +19412,8 @@ class Delaunay {
  * @modified 2020-08-12 Ported this class from vanilla JS to TypeScript.
  * @modified 2020-08-17 Added some missing type declarations.
  * @modified 2021-01-20 Members `triangles` and `sharedVertex` are now public.
- * @version  1.1.3
+ * @modified 2026-09-15 Added the `VoronoiCell.sharedVertexIndex` attribute.
+ * @version  1.2.0
  *
  * @file VoronoiCell
  * @public
@@ -19200,15 +19429,15 @@ class VoronoiCell {
      * @param {Vertex}     sharedVertex This is the 'center' of the voronoi cell; all triangles must share
      *                                  that vertex.
      **/
-    constructor(triangles, sharedVertex) {
-        if (typeof triangles === 'undefined')
+    constructor(triangles, sharedVertex, sharedVertexIndex) {
+        if (typeof triangles === "undefined")
             triangles = [];
-        if (typeof sharedVertex === 'undefined')
+        if (typeof sharedVertex === "undefined")
             sharedVertex = new Vertex$1(0, 0);
         this.triangles = triangles;
         this.sharedVertex = sharedVertex;
+        this.sharedVertexIndex = sharedVertexIndex;
     }
-    ;
     /**
      * Check if the first and the last triangle in the path are NOT connected.
      *
@@ -19221,7 +19450,6 @@ class VoronoiCell {
         // There must be at least three triangles
         return this.triangles.length < 3 || !this.triangles[0].isAdjacent(this.triangles[this.triangles.length - 1]);
     }
-    ;
     /**
      * Convert this Voronoi cell to a path polygon, consisting of all Voronoi cell corner points.
      *
@@ -19236,7 +19464,32 @@ class VoronoiCell {
     toPolygon() {
         return new Polygon(this.toPathArray(), this.isOpen());
     }
-    ;
+    /**
+     * Get all 'umbrella' triangles for this Voronoi cell.
+     *
+     * The 'umbrella' is that sequence of triangles that covers the whole Voronoi cell and
+     * meet in the cell's centroid.
+     *
+     * @method getUmbrellaTriangles
+     * @instance
+     * @memberof VoronoiCell
+     * @return {Array<Triangle>}
+     **/
+    getUmbrellaTriangles() {
+        var tris = [];
+        // for (var i = 0; i < this.triangles.length; i++) {
+        //   var delaunayTri = this.triangles[i];
+        //   var tri = new Triangle(this.sharedVertex, delaunayTri.b, delaunayTri.c);
+        //   tris.push(tri);
+        // }
+        var vertices = this.toPathArray();
+        var n = vertices.length;
+        for (var i = 0; i < n; i++) {
+            var tri = new Triangle(this.sharedVertex, vertices[i], vertices[(i + 1) % n]);
+            tris.push(tri);
+        }
+        return tris;
+    }
     /**
      * Convert the voronoi cell path data to an SVG polygon data string.
      *
@@ -19251,9 +19504,12 @@ class VoronoiCell {
         if (this.triangles.length == 0)
             return "";
         const arr = this.toPathArray();
-        return arr.map((vert) => { return '' + vert.x + ',' + vert.y; }).join(' ');
+        return arr
+            .map((vert) => {
+            return "" + vert.x + "," + vert.y;
+        })
+            .join(" ");
     }
-    ;
     /**
      * Convert the voronoi cell path data to an array.
      *
@@ -19305,7 +19561,6 @@ class VoronoiCell {
         const openEdgePoint = new Vertex$1(perpendicular.x + (center.x - perpendicular.x) * 1000, perpendicular.y + (center.y - perpendicular.y) * 1000);
         return openEdgePoint;
     }
-    ;
     /**
      * A helper function.
      *
@@ -19329,13 +19584,12 @@ class VoronoiCell {
                 return tri.a;
         }
         // Here:
-        //    tri.c.equals(sharedVertex) 
+        //    tri.c.equals(sharedVertex)
         if (neighbour.a.equals(tri.a) || neighbour.b.equals(tri.a) || neighbour.c.equals(tri.a))
             return tri.b;
         else
             return tri.a;
     }
-    ;
 }
 
 /**
@@ -19343,7 +19597,8 @@ class VoronoiCell {
  * @date     2018-04-07
  * @modified 2018-04-11 Using VoronoiCells now (was array before).
  * @modified 2020-08-15 Ported from vanilla JS to TypeScript.
- * @version  1.0.2
+ * @modified 2026-09-15 Added the `sharedVertexIndex` attribute to each Voronoi cell.
+ * @version  1.1.0
  **/
 /**
  * @classdesc Create the voronoi diagram from the given delaunay triangulation (they are dual graphs).
@@ -19358,13 +19613,12 @@ class delaunay2voronoi {
         this.pointList = pointList;
         this.triangles = triangles;
     }
-    ;
     // +---------------------------------------------------------------------------------
     // | Convert the triangle set to the Voronoi diagram.
     // +-------------------------------
     build() {
         const voronoiDiagram = [];
-        for (var p in this.pointList) {
+        for (var p = 0; p < this.pointList.length; p++) {
             var point = this.pointList[p];
             // Find adjacent triangles for first point
             var adjacentSubset = [];
@@ -19373,12 +19627,12 @@ class delaunay2voronoi {
                     adjacentSubset.push(this.triangles[t]);
             }
             var path = this.subsetToPath(adjacentSubset);
-            if (path) // There may be errors
-                voronoiDiagram.push(new VoronoiCell(path, point));
+            if (path)
+                // There may be errors
+                voronoiDiagram.push(new VoronoiCell(path, point, p));
         }
         return voronoiDiagram;
     }
-    ;
     // +---------------------------------------------------------------------------------
     // | Re-order a tiangle subset so the triangle define a single path.
     // |
@@ -19391,7 +19645,7 @@ class delaunay2voronoi {
     subsetToPath(triangleSet, startPosition, tryOnce) {
         if (triangleSet.length == 0)
             return [];
-        if (typeof startPosition === 'undefined')
+        if (typeof startPosition === "undefined")
             startPosition = 0;
         let t = startPosition;
         const result = [triangleSet[t]];
@@ -19432,8 +19686,7 @@ class delaunay2voronoi {
             return result;
         }
     }
-    ;
-}
+} // END delaunay2voronoi
 
 /**
  * @requires Line