@js-draw/math 1.16.0 → 1.18.0

package/dist/cjs/Mat33.js

@@ -340,7 +340,11 @@ class Mat33 {
             return Mat33.identity;
         }
         const parseArguments = (argumentString) => {
-            return argumentString.split(/[, \t\n]+/g).map(argString => {
+            const parsed = argumentString.split(/[, \t\n]+/g).map(argString => {
+                // Handle trailing spaces/commands
+                if (argString.trim() === '') {
+                    return null;
+                }
                 let isPercentage = false;
                 if (argString.endsWith('%')) {
                     isPercentage = true;
@@ -361,6 +365,7 @@ class Mat33 {
                 }
                 return argNumber;
             });
+            return parsed.filter(n => n !== null);
         };
         const keywordToAction = {
             matrix: (matrixData) => {

package/dist/cjs/Vec3.d.ts

@@ -35,11 +35,31 @@ export declare class Vec3 {
     length(): number;
     magnitude(): number;
     magnitudeSquared(): number;
+    /**
+     * Interpreting this vector as a point in ℝ^3, computes the square distance
+     * to another point, `p`.
+     *
+     * Equivalent to `.minus(p).magnitudeSquared()`.
+     */
+    squareDistanceTo(p: Vec3): number;
+    /**
+     * Interpreting this vector as a point in ℝ³, returns the distance to the point
+     * `p`.
+     *
+     * Equivalent to `.minus(p).magnitude()`.
+     */
+    distanceTo(p: Vec3): number;
     /**
      * Returns the entry of this with the greatest magnitude.
      *
      * In other words, returns $\max \{ |x| : x \in {\bf v} \}$, where ${\bf v}$ is the set of
      * all entries of this vector.
+     *
+     * **Example**:
+     * ```ts,runnable,console
+     * import { Vec3 } from '@js-draw/math';
+     * console.log(Vec3.of(-1, -10, 8).maximumEntryMagnitude()); // -> 10
+     * ```
      */
     maximumEntryMagnitude(): number;
     /**
@@ -50,6 +70,7 @@ export declare class Vec3 {
      * As such, observing that `Math.atan2(-0, -1)` $\approx -\pi$ and `Math.atan2(0, -1)`$\approx \pi$
      * the resultant angle is in the range $[-\pi, pi]$.
      *
+     * **Example**:
      * ```ts,runnable,console
      * import { Vec2 } from '@js-draw/math';
      * console.log(Vec2.of(-1, -0).angle()); // atan2(-0, -1)
@@ -113,7 +134,8 @@ export declare class Vec3 {
      * Returns a vector with each component acted on by `fn`.
      *
      * @example
-     * ```
+     * ```ts,runnable,console
+     * import { Vec3 } from '@js-draw/math';
      * console.log(Vec3.of(1, 2, 3).map(val => val + 1)); // → Vec(2, 3, 4)
      * ```
      */

package/dist/cjs/Vec3.js

@@ -58,11 +58,38 @@ class Vec3 {
     magnitudeSquared() {
         return this.dot(this);
     }
+    /**
+     * Interpreting this vector as a point in ℝ^3, computes the square distance
+     * to another point, `p`.
+     *
+     * Equivalent to `.minus(p).magnitudeSquared()`.
+     */
+    squareDistanceTo(p) {
+        const dx = this.x - p.x;
+        const dy = this.y - p.y;
+        const dz = this.z - p.z;
+        return dx * dx + dy * dy + dz * dz;
+    }
+    /**
+     * Interpreting this vector as a point in ℝ³, returns the distance to the point
+     * `p`.
+     *
+     * Equivalent to `.minus(p).magnitude()`.
+     */
+    distanceTo(p) {
+        return Math.sqrt(this.squareDistanceTo(p));
+    }
     /**
      * Returns the entry of this with the greatest magnitude.
      *
      * In other words, returns $\max \{ |x| : x \in {\bf v} \}$, where ${\bf v}$ is the set of
      * all entries of this vector.
+     *
+     * **Example**:
+     * ```ts,runnable,console
+     * import { Vec3 } from '@js-draw/math';
+     * console.log(Vec3.of(-1, -10, 8).maximumEntryMagnitude()); // -> 10
+     * ```
      */
     maximumEntryMagnitude() {
         return Math.max(Math.abs(this.x), Math.max(Math.abs(this.y), Math.abs(this.z)));
@@ -75,6 +102,7 @@ class Vec3 {
      * As such, observing that `Math.atan2(-0, -1)` $\approx -\pi$ and `Math.atan2(0, -1)`$\approx \pi$
      * the resultant angle is in the range $[-\pi, pi]$.
      *
+     * **Example**:
      * ```ts,runnable,console
      * import { Vec2 } from '@js-draw/math';
      * console.log(Vec2.of(-1, -0).angle()); // atan2(-0, -1)
@@ -178,7 +206,8 @@ class Vec3 {
      * Returns a vector with each component acted on by `fn`.
      *
      * @example
-     * ```
+     * ```ts,runnable,console
+     * import { Vec3 } from '@js-draw/math';
      * console.log(Vec3.of(1, 2, 3).map(val => val + 1)); // → Vec(2, 3, 4)
      * ```
      */
@@ -202,12 +231,9 @@ class Vec3 {
      * ```
      */
     eq(other, fuzz = 1e-10) {
-        for (let i = 0; i < 3; i++) {
-            if (Math.abs(other.at(i) - this.at(i)) > fuzz) {
-                return false;
-            }
-        }
-        return true;
+        return (Math.abs(other.x - this.x) <= fuzz
+            && Math.abs(other.y - this.y) <= fuzz
+            && Math.abs(other.z - this.z) <= fuzz);
     }
     toString() {
         return `Vec(${this.x}, ${this.y}, ${this.z})`;

package/dist/cjs/lib.d.ts

@@ -17,8 +17,9 @@
  * @packageDocumentation
  */
 export { LineSegment2 } from './shapes/LineSegment2';
-export { Path, PathCommandType, PathCommand, LinePathCommand, MoveToPathCommand, QuadraticBezierPathCommand, CubicBezierPathCommand, } from './shapes/Path';
+export { Path, IntersectionResult as PathIntersectionResult, CurveIndexRecord as PathCurveIndex, stepCurveIndexBy as stepPathIndexBy, compareCurveIndices as comparePathIndices, PathCommandType, PathCommand, LinePathCommand, MoveToPathCommand, QuadraticBezierPathCommand, CubicBezierPathCommand, } from './shapes/Path';
 export { Rect2 } from './shapes/Rect2';
+export { Parameterized2DShape } from './shapes/Parameterized2DShape';
 export { QuadraticBezier } from './shapes/QuadraticBezier';
 export { Abstract2DShape } from './shapes/Abstract2DShape';
 export { Mat33, Mat33Array } from './Mat33';

package/dist/cjs/lib.js

@@ -32,14 +32,18 @@ var __exportStar = (this && this.__exportStar) || function(m, exports) {
     for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
 };
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.Color4 = exports.Vec3 = exports.Vec2 = exports.Mat33 = exports.Abstract2DShape = exports.QuadraticBezier = exports.Rect2 = exports.PathCommandType = exports.Path = exports.LineSegment2 = void 0;
+exports.Color4 = exports.Vec3 = exports.Vec2 = exports.Mat33 = exports.Abstract2DShape = exports.QuadraticBezier = exports.Parameterized2DShape = exports.Rect2 = exports.PathCommandType = exports.comparePathIndices = exports.stepPathIndexBy = exports.Path = exports.LineSegment2 = void 0;
 var LineSegment2_1 = require("./shapes/LineSegment2");
 Object.defineProperty(exports, "LineSegment2", { enumerable: true, get: function () { return LineSegment2_1.LineSegment2; } });
 var Path_1 = require("./shapes/Path");
 Object.defineProperty(exports, "Path", { enumerable: true, get: function () { return Path_1.Path; } });
+Object.defineProperty(exports, "stepPathIndexBy", { enumerable: true, get: function () { return Path_1.stepCurveIndexBy; } });
+Object.defineProperty(exports, "comparePathIndices", { enumerable: true, get: function () { return Path_1.compareCurveIndices; } });
 Object.defineProperty(exports, "PathCommandType", { enumerable: true, get: function () { return Path_1.PathCommandType; } });
 var Rect2_1 = require("./shapes/Rect2");
 Object.defineProperty(exports, "Rect2", { enumerable: true, get: function () { return Rect2_1.Rect2; } });
+var Parameterized2DShape_1 = require("./shapes/Parameterized2DShape");
+Object.defineProperty(exports, "Parameterized2DShape", { enumerable: true, get: function () { return Parameterized2DShape_1.Parameterized2DShape; } });
 var QuadraticBezier_1 = require("./shapes/QuadraticBezier");
 Object.defineProperty(exports, "QuadraticBezier", { enumerable: true, get: function () { return QuadraticBezier_1.QuadraticBezier; } });
 var Abstract2DShape_1 = require("./shapes/Abstract2DShape");

package/dist/cjs/shapes/Abstract2DShape.d.ts

@@ -38,6 +38,9 @@ export declare abstract class Abstract2DShape {
     containsPoint(point: Point2, epsilon?: number): boolean;
     /**
      * Returns a bounding box that precisely fits the content of this shape.
+     *
+     * **Note**: This bounding box should aligned with the x/y axes. (Thus, it may be
+     * possible to find a tighter bounding box not axes-aligned).
      */
     abstract getTightBoundingBox(): Rect2;
     /**

package/dist/cjs/shapes/BezierJSWrapper.d.ts

@@ -1,21 +1,22 @@
 import { Bezier } from 'bezier-js';
 import { Point2, Vec2 } from '../Vec2';
-import Abstract2DShape from './Abstract2DShape';
 import LineSegment2 from './LineSegment2';
 import Rect2 from './Rect2';
+import Parameterized2DShape from './Parameterized2DShape';
 /**
  * A lazy-initializing wrapper around Bezier-js.
  *
  * Subclasses may override `at`, `derivativeAt`, and `normal` with functions
  * that do not initialize a `bezier-js` `Bezier`.
  *
- * Do not use this class directly. It may be removed/replaced in a future release.
+ * **Do not use this class directly.** It may be removed/replaced in a future release.
  * @internal
  */
-declare abstract class BezierJSWrapper extends Abstract2DShape {
+export declare abstract class BezierJSWrapper extends Parameterized2DShape {
     #private;
+    protected constructor(bezierJsBezier?: Bezier);
     /** Returns the start, control points, and end point of this Bézier. */
-    abstract getPoints(): Point2[];
+    abstract getPoints(): readonly Point2[];
     protected getBezier(): Bezier;
     signedDistance(point: Point2): number;
     /**
@@ -29,8 +30,21 @@ declare abstract class BezierJSWrapper extends Abstract2DShape {
      */
     at(t: number): Point2;
     derivativeAt(t: number): Point2;
+    secondDerivativeAt(t: number): Point2;
     normal(t: number): Vec2;
+    normalAt(t: number): Vec2;
+    tangentAt(t: number): Vec2;
     getTightBoundingBox(): Rect2;
-    intersectsLineSegment(line: LineSegment2): Point2[];
+    argIntersectsLineSegment(line: LineSegment2): number[];
+    splitAt(t: number): [BezierJSWrapper] | [BezierJSWrapper, BezierJSWrapper];
+    nearestPointTo(point: Point2): {
+        parameterValue: number;
+        point: import("../Vec3").Vec3;
+    };
+    intersectsBezier(other: BezierJSWrapper): {
+        parameterValue: number;
+        point: import("../Vec3").Vec3;
+    }[];
+    toString(): string;
 }
 export default BezierJSWrapper;

package/dist/cjs/shapes/BezierJSWrapper.js

@@ -1,37 +1,42 @@
 "use strict";
-var __classPrivateFieldGet = (this && this.__classPrivateFieldGet) || function (receiver, state, kind, f) {
-    if (kind === "a" && !f) throw new TypeError("Private accessor was defined without a getter");
-    if (typeof state === "function" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError("Cannot read private member from an object whose class did not declare it");
-    return kind === "m" ? f : kind === "a" ? f.call(receiver) : f ? f.value : state.get(receiver);
-};
 var __classPrivateFieldSet = (this && this.__classPrivateFieldSet) || function (receiver, state, value, kind, f) {
     if (kind === "m") throw new TypeError("Private method is not writable");
     if (kind === "a" && !f) throw new TypeError("Private accessor was defined without a setter");
     if (typeof state === "function" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError("Cannot write private member to an object whose class did not declare it");
     return (kind === "a" ? f.call(receiver, value) : f ? f.value = value : state.set(receiver, value)), value;
 };
+var __classPrivateFieldGet = (this && this.__classPrivateFieldGet) || function (receiver, state, kind, f) {
+    if (kind === "a" && !f) throw new TypeError("Private accessor was defined without a getter");
+    if (typeof state === "function" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError("Cannot read private member from an object whose class did not declare it");
+    return kind === "m" ? f : kind === "a" ? f.call(receiver) : f ? f.value : state.get(receiver);
+};
 var __importDefault = (this && this.__importDefault) || function (mod) {
     return (mod && mod.__esModule) ? mod : { "default": mod };
 };
 var _BezierJSWrapper_bezierJs;
 Object.defineProperty(exports, "__esModule", { value: true });
+exports.BezierJSWrapper = void 0;
 const bezier_js_1 = require("bezier-js");
 const Vec2_1 = require("../Vec2");
-const Abstract2DShape_1 = __importDefault(require("./Abstract2DShape"));
+const LineSegment2_1 = __importDefault(require("./LineSegment2"));
 const Rect2_1 = __importDefault(require("./Rect2"));
+const Parameterized2DShape_1 = __importDefault(require("./Parameterized2DShape"));
 /**
  * A lazy-initializing wrapper around Bezier-js.
  *
  * Subclasses may override `at`, `derivativeAt`, and `normal` with functions
  * that do not initialize a `bezier-js` `Bezier`.
  *
- * Do not use this class directly. It may be removed/replaced in a future release.
+ * **Do not use this class directly.** It may be removed/replaced in a future release.
  * @internal
  */
-class BezierJSWrapper extends Abstract2DShape_1.default {
-    constructor() {
-        super(...arguments);
+class BezierJSWrapper extends Parameterized2DShape_1.default {
+    constructor(bezierJsBezier) {
+        super();
         _BezierJSWrapper_bezierJs.set(this, null);
+        if (bezierJsBezier) {
+            __classPrivateFieldSet(this, _BezierJSWrapper_bezierJs, bezierJsBezier, "f");
+        }
     }
     getBezier() {
         if (!__classPrivateFieldGet(this, _BezierJSWrapper_bezierJs, "f")) {
@@ -41,7 +46,7 @@ class BezierJSWrapper extends Abstract2DShape_1.default {
     }
     signedDistance(point) {
         // .d: Distance
-        return this.getBezier().project(point.xy).d;
+        return this.nearestPointTo(point).point.distanceTo(point);
     }
     /**
      * @returns the (more) exact distance from `point` to this.
@@ -61,34 +66,181 @@ class BezierJSWrapper extends Abstract2DShape_1.default {
     derivativeAt(t) {
         return Vec2_1.Vec2.ofXY(this.getBezier().derivative(t));
     }
+    secondDerivativeAt(t) {
+        return Vec2_1.Vec2.ofXY(this.getBezier().dderivative(t));
+    }
     normal(t) {
         return Vec2_1.Vec2.ofXY(this.getBezier().normal(t));
     }
+    normalAt(t) {
+        return this.normal(t);
+    }
+    tangentAt(t) {
+        return this.derivativeAt(t).normalized();
+    }
     getTightBoundingBox() {
         const bbox = this.getBezier().bbox();
         const width = bbox.x.max - bbox.x.min;
         const height = bbox.y.max - bbox.y.min;
         return new Rect2_1.default(bbox.x.min, bbox.y.min, width, height);
     }
-    intersectsLineSegment(line) {
+    argIntersectsLineSegment(line) {
+        // Bezier-js has a bug when all control points of a Bezier curve lie on
+        // a line. Our solution involves converting the Bezier into a line, then
+        // finding the parameter value that produced the intersection.
+        //
+        // TODO: This is unnecessarily slow. A better solution would be to fix
+        // the bug upstream.
+        const asLine = LineSegment2_1.default.ofSmallestContainingPoints(this.getPoints());
+        if (asLine) {
+            const intersection = asLine.intersectsLineSegment(line);
+            return intersection.map(p => this.nearestPointTo(p).parameterValue);
+        }
         const bezier = this.getBezier();
-        const intersectionPoints = bezier.intersects(line).map(t => {
+        return bezier.intersects(line).map(t => {
             // We're using the .intersects(line) function, which is documented
             // to always return numbers. However, to satisfy the type checker (and
             // possibly improperly-defined types),
             if (typeof t === 'string') {
                 t = parseFloat(t);
             }
-            const point = Vec2_1.Vec2.ofXY(bezier.get(t));
+            const point = Vec2_1.Vec2.ofXY(this.at(t));
             // Ensure that the intersection is on the line segment
-            if (point.minus(line.p1).magnitude() > line.length
-                || point.minus(line.p2).magnitude() > line.length) {
+            if (point.distanceTo(line.p1) > line.length
+                || point.distanceTo(line.p2) > line.length) {
                 return null;
             }
-            return point;
+            return t;
         }).filter(entry => entry !== null);
-        return intersectionPoints;
+    }
+    splitAt(t) {
+        if (t <= 0 || t >= 1) {
+            return [this];
+        }
+        const bezier = this.getBezier();
+        const split = bezier.split(t);
+        return [
+            new BezierJSWrapperImpl(split.left.points.map(point => Vec2_1.Vec2.ofXY(point)), split.left),
+            new BezierJSWrapperImpl(split.right.points.map(point => Vec2_1.Vec2.ofXY(point)), split.right),
+        ];
+    }
+    nearestPointTo(point) {
+        // One implementation could be similar to this:
+        //   const projection = this.getBezier().project(point);
+        //   return {
+        //    point: Vec2.ofXY(projection),
+        //    parameterValue: projection.t!,
+        //   };
+        // However, Bezier-js is rather impercise (and relies on a lookup table).
+        // Thus, we instead use Newton's Method:
+        // We want to find t such that f(t) = |B(t) - p|² is minimized.
+        // Expanding,
+        //   f(t)  = (Bₓ(t) - pₓ)² + (Bᵧ(t) - pᵧ)²
+        // ⇒ f'(t) = Dₜ(Bₓ(t) - pₓ)² + Dₜ(Bᵧ(t) - pᵧ)²
+        // ⇒ f'(t) = 2(Bₓ(t) - pₓ)(Bₓ'(t)) + 2(Bᵧ(t) - pᵧ)(Bᵧ'(t))
+        //         = 2Bₓ(t)Bₓ'(t) - 2pₓBₓ'(t) + 2Bᵧ(t)Bᵧ'(t) - 2pᵧBᵧ'(t)
+        // ⇒ f''(t)= 2Bₓ'(t)Bₓ'(t) + 2Bₓ(t)Bₓ''(t) - 2pₓBₓ''(t) + 2Bᵧ'(t)Bᵧ'(t)
+        //         + 2Bᵧ(t)Bᵧ''(t) - 2pᵧBᵧ''(t)
+        // Because f'(t) = 0 at relative extrema, we can use Newton's Method
+        // to improve on an initial guess.
+        const sqrDistAt = (t) => point.squareDistanceTo(this.at(t));
+        const yIntercept = sqrDistAt(0);
+        let t = 0;
+        let minSqrDist = yIntercept;
+        // Start by testing a few points:
+        const pointsToTest = 4;
+        for (let i = 0; i < pointsToTest; i++) {
+            const testT = i / (pointsToTest - 1);
+            const testMinSqrDist = sqrDistAt(testT);
+            if (testMinSqrDist < minSqrDist) {
+                t = testT;
+                minSqrDist = testMinSqrDist;
+            }
+        }
+        // To use Newton's Method, we need to evaluate the second derivative of the distance
+        // function:
+        const secondDerivativeAt = (t) => {
+            // f''(t) = 2Bₓ'(t)Bₓ'(t) + 2Bₓ(t)Bₓ''(t) - 2pₓBₓ''(t)
+            //        + 2Bᵧ'(t)Bᵧ'(t) + 2Bᵧ(t)Bᵧ''(t) - 2pᵧBᵧ''(t)
+            const b = this.at(t);
+            const bPrime = this.derivativeAt(t);
+            const bPrimePrime = this.secondDerivativeAt(t);
+            return (2 * bPrime.x * bPrime.x + 2 * b.x * bPrimePrime.x - 2 * point.x * bPrimePrime.x
+                + 2 * bPrime.y * bPrime.y + 2 * b.y * bPrimePrime.y - 2 * point.y * bPrimePrime.y);
+        };
+        // Because we're zeroing f'(t), we also need to be able to compute it:
+        const derivativeAt = (t) => {
+            // f'(t) = 2Bₓ(t)Bₓ'(t) - 2pₓBₓ'(t) + 2Bᵧ(t)Bᵧ'(t) - 2pᵧBᵧ'(t)
+            const b = this.at(t);
+            const bPrime = this.derivativeAt(t);
+            return (2 * b.x * bPrime.x - 2 * point.x * bPrime.x
+                + 2 * b.y * bPrime.y - 2 * point.y * bPrime.y);
+        };
+        const iterate = () => {
+            const slope = secondDerivativeAt(t);
+            if (slope === 0)
+                return;
+            // We intersect a line through the point on f'(t) at t with the x-axis:
+            //    y = m(x - x₀) + y₀
+            // ⇒  x - x₀ = (y - y₀) / m
+            // ⇒  x = (y - y₀) / m + x₀
+            //
+            // Thus, when zeroed,
+            //   tN = (0 - f'(t)) / m + t
+            const newT = (0 - derivativeAt(t)) / slope + t;
+            //const distDiff = sqrDistAt(newT) - sqrDistAt(t);
+            //console.assert(distDiff <= 0, `${-distDiff} >= 0`);
+            t = newT;
+            if (t > 1) {
+                t = 1;
+            }
+            else if (t < 0) {
+                t = 0;
+            }
+        };
+        for (let i = 0; i < 12; i++) {
+            iterate();
+        }
+        return { parameterValue: t, point: this.at(t) };
+    }
+    intersectsBezier(other) {
+        const intersections = this.getBezier().intersects(other.getBezier());
+        if (!intersections || intersections.length === 0) {
+            return [];
+        }
+        const result = [];
+        for (const intersection of intersections) {
+            // From http://pomax.github.io/bezierjs/#intersect-curve,
+            // .intersects returns an array of 't1/t2' pairs, where curve1.at(t1) gives the point.
+            const match = /^([-0-9.eE]+)\/([-0-9.eE]+)$/.exec(intersection);
+            if (!match) {
+                throw new Error(`Incorrect format returned by .intersects: ${intersections} should be array of "number/number"!`);
+            }
+            const t = parseFloat(match[1]);
+            result.push({
+                parameterValue: t,
+                point: this.at(t),
+            });
+        }
+        return result;
+    }
+    toString() {
+        return `Bézier(${this.getPoints().map(point => point.toString()).join(', ')})`;
     }
 }
+exports.BezierJSWrapper = BezierJSWrapper;
 _BezierJSWrapper_bezierJs = new WeakMap();
+/**
+ * Private concrete implementation of `BezierJSWrapper`, used by methods above that need to return a wrapper
+ * around a `Bezier`.
+ */
+class BezierJSWrapperImpl extends BezierJSWrapper {
+    constructor(controlPoints, curve) {
+        super(curve);
+        this.controlPoints = controlPoints;
+    }
+    getPoints() {
+        return this.controlPoints;
+    }
+}
 exports.default = BezierJSWrapper;

package/dist/cjs/shapes/LineSegment2.d.ts

@@ -1,13 +1,14 @@
 import Mat33 from '../Mat33';
 import Rect2 from './Rect2';
 import { Vec2, Point2 } from '../Vec2';
-import Abstract2DShape from './Abstract2DShape';
+import Parameterized2DShape from './Parameterized2DShape';
+import Vec3 from '../Vec3';
 interface IntersectionResult {
     point: Point2;
     t: number;
 }
 /** Represents a line segment. A `LineSegment2` is immutable. */
-export declare class LineSegment2 extends Abstract2DShape {
+export declare class LineSegment2 extends Parameterized2DShape {
     private readonly point1;
     private readonly point2;
     /**
@@ -24,12 +25,24 @@ export declare class LineSegment2 extends Abstract2DShape {
     readonly bbox: Rect2;
     /** Creates a new `LineSegment2` from its endpoints. */
     constructor(point1: Point2, point2: Point2);
+    /**
+     * Returns the smallest line segment that contains all points in `points`, or `null`
+     * if no such line segment exists.
+     *
+     * @example
+     * ```ts,runnable
+     * import {LineSegment2, Vec2} from '@js-draw/math';
+     * console.log(LineSegment2.ofSmallestContainingPoints([Vec2.of(1, 0), Vec2.of(0, 1)]));
+     * ```
+     */
+    static ofSmallestContainingPoints(points: readonly Point2[]): LineSegment2 | null;
     /** Alias for `point1`. */
     get p1(): Point2;
     /** Alias for `point2`. */
     get p2(): Point2;
+    get center(): Point2;
     /**
-     * Gets a point a distance `t` along this line.
+     * Gets a point a **distance** `t` along this line.
      *
      * @deprecated
      */
@@ -42,8 +55,20 @@ export declare class LineSegment2 extends Abstract2DShape {
      * `t` should be in `[0, 1]`.
      */
     at(t: number): Point2;
+    normalAt(_t: number): Vec2;
+    tangentAt(_t: number): Vec3;
+    splitAt(t: number): [LineSegment2] | [LineSegment2, LineSegment2];
+    /**
+     * Returns the intersection of this with another line segment.
+     *
+     * **WARNING**: The parameter value returned by this method does not range from 0 to 1 and
+     *              is currently a length.
+     *              This will change in a future release.
+     * @deprecated
+     */
     intersection(other: LineSegment2): IntersectionResult | null;
     intersects(other: LineSegment2): boolean;
+    argIntersectsLineSegment(lineSegment: LineSegment2): number[];
     /**
      * Returns the points at which this line segment intersects the
      * given line segment.
@@ -52,8 +77,12 @@ export declare class LineSegment2 extends Abstract2DShape {
      * line segment. This method, by contrast, returns **the point** at which the intersection
      * occurs, if such a point exists.
      */
-    intersectsLineSegment(lineSegment: LineSegment2): import("../Vec3").Vec3[];
-    closestPointTo(target: Point2): import("../Vec3").Vec3;
+    intersectsLineSegment(lineSegment: LineSegment2): Vec3[];
+    closestPointTo(target: Point2): Vec3;
+    nearestPointTo(target: Vec3): {
+        point: Vec3;
+        parameterValue: number;
+    };
     /**
      * Returns the distance from this line segment to `target`.
      *
@@ -66,5 +95,16 @@ export declare class LineSegment2 extends Abstract2DShape {
     /** @inheritdoc */
     getTightBoundingBox(): Rect2;
     toString(): string;
+    /**
+     * Returns `true` iff this is equivalent to `other`.
+     *
+     * **Options**:
+     * - `tolerance`: The maximum difference between endpoints. (Default: 0)
+     * - `ignoreDirection`: Allow matching a version of `this` with opposite direction. (Default: `true`)
+     */
+    eq(other: LineSegment2, options?: {
+        tolerance?: number;
+        ignoreDirection?: boolean;
+    }): boolean;
 }
 export default LineSegment2;