js-draw 0.23.1 → 0.24.1

package/dist/mjs/math/Vec3.mjs

@@ -0,0 +1,181 @@
+/**
+ * A vector with three components. Can also be used to represent a two-component vector.
+ *
+ * A `Vec3` is immutable.
+ */
+var Vec3 = /** @class */ (function () {
+    function Vec3(x, y, z) {
+        this.x = x;
+        this.y = y;
+        this.z = z;
+    }
+    Object.defineProperty(Vec3.prototype, "xy", {
+        /** Returns the x, y components of this. */
+        get: function () {
+            // Useful for APIs that behave differently if .z is present.
+            return {
+                x: this.x,
+                y: this.y,
+            };
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Vec3.of = function (x, y, z) {
+        return new Vec3(x, y, z);
+    };
+    /** Returns this' `idx`th component. For example, `Vec3.of(1, 2, 3).at(1) → 2`. */
+    Vec3.prototype.at = function (idx) {
+        if (idx === 0)
+            return this.x;
+        if (idx === 1)
+            return this.y;
+        if (idx === 2)
+            return this.z;
+        throw new Error("".concat(idx, " out of bounds!"));
+    };
+    /** Alias for this.magnitude. */
+    Vec3.prototype.length = function () {
+        return this.magnitude();
+    };
+    Vec3.prototype.magnitude = function () {
+        return Math.sqrt(this.dot(this));
+    };
+    Vec3.prototype.magnitudeSquared = function () {
+        return this.dot(this);
+    };
+    /**
+     * Return this' angle in the XY plane (treats this as a Vec2).
+     *
+     * This is equivalent to `Math.atan2(vec.y, vec.x)`.
+     */
+    Vec3.prototype.angle = function () {
+        return Math.atan2(this.y, this.x);
+    };
+    /**
+     * Returns a unit vector in the same direction as this.
+     *
+     * If `this` has zero length, the resultant vector has `NaN` components.
+     */
+    Vec3.prototype.normalized = function () {
+        var norm = this.magnitude();
+        return Vec3.of(this.x / norm, this.y / norm, this.z / norm);
+    };
+    /** @returns A copy of `this` multiplied by a scalar. */
+    Vec3.prototype.times = function (c) {
+        return Vec3.of(this.x * c, this.y * c, this.z * c);
+    };
+    Vec3.prototype.plus = function (v) {
+        return Vec3.of(this.x + v.x, this.y + v.y, this.z + v.z);
+    };
+    Vec3.prototype.minus = function (v) {
+        return Vec3.of(this.x - v.x, this.y - v.y, this.z - v.z);
+    };
+    Vec3.prototype.dot = function (other) {
+        return this.x * other.x + this.y * other.y + this.z * other.z;
+    };
+    Vec3.prototype.cross = function (other) {
+        // | i  j  k |
+        // | x1 y1 z1| = (i)(y1z2 - y2z1) - (j)(x1z2 - x2z1) + (k)(x1y2 - x2y1)
+        // | x2 y2 z2|
+        return Vec3.of(this.y * other.z - other.y * this.z, other.x * this.z - this.x * other.z, this.x * other.y - other.x * this.y);
+    };
+    /**
+     * If `other` is a `Vec3`, multiplies `this` component-wise by `other`. Otherwise,
+     * if `other is a `number`, returns the result of scalar multiplication.
+     *
+     * @example
+     * ```
+     * Vec3.of(1, 2, 3).scale(Vec3.of(2, 4, 6)); // → Vec3(2, 8, 18)
+     * ```
+     */
+    Vec3.prototype.scale = function (other) {
+        if (typeof other === 'number') {
+            return this.times(other);
+        }
+        return Vec3.of(this.x * other.x, this.y * other.y, this.z * other.z);
+    };
+    /**
+     * Returns a vector orthogonal to this. If this is a Vec2, returns `this` rotated
+     * 90 degrees counter-clockwise.
+     */
+    Vec3.prototype.orthog = function () {
+        // If parallel to the z-axis
+        if (this.dot(Vec3.unitX) === 0 && this.dot(Vec3.unitY) === 0) {
+            return this.dot(Vec3.unitX) === 0 ? Vec3.unitX : this.cross(Vec3.unitX).normalized();
+        }
+        return this.cross(Vec3.unitZ.times(-1)).normalized();
+    };
+    /** Returns this plus a vector of length `distance` in `direction`. */
+    Vec3.prototype.extend = function (distance, direction) {
+        return this.plus(direction.normalized().times(distance));
+    };
+    /** Returns a vector `fractionTo` of the way to target from this. */
+    Vec3.prototype.lerp = function (target, fractionTo) {
+        return this.times(1 - fractionTo).plus(target.times(fractionTo));
+    };
+    /**
+     * `zip` Maps a component of this and a corresponding component of
+     * `other` to a component of the output vector.
+     *
+     * @example
+     * ```
+     * const a = Vec3.of(1, 2, 3);
+     * const b = Vec3.of(0.5, 2.1, 2.9);
+     *
+     * const zipped = a.zip(b, (aComponent, bComponent) => {
+     *   return Math.min(aComponent, bComponent);
+     * });
+     *
+     * console.log(zipped.toString()); // → Vec(0.5, 2, 2.9)
+     * ```
+     */
+    Vec3.prototype.zip = function (other, zip) {
+        return Vec3.of(zip(other.x, this.x), zip(other.y, this.y), zip(other.z, this.z));
+    };
+    /**
+     * Returns a vector with each component acted on by `fn`.
+     *
+     * @example
+     * ```
+     * console.log(Vec3.of(1, 2, 3).map(val => val + 1)); // → Vec(2, 3, 4)
+     * ```
+     */
+    Vec3.prototype.map = function (fn) {
+        return Vec3.of(fn(this.x, 0), fn(this.y, 1), fn(this.z, 2));
+    };
+    Vec3.prototype.asArray = function () {
+        return [this.x, this.y, this.z];
+    };
+    /**
+     * [fuzz] The maximum difference between two components for this and [other]
+     * to be considered equal.
+     *
+     * @example
+     * ```
+     * Vec3.of(1, 2, 3).eq(Vec3.of(4, 5, 6), 100);  // → true
+     * Vec3.of(1, 2, 3).eq(Vec3.of(4, 5, 6), 0.1);  // → false
+     * Vec3.of(1, 2, 3).eq(Vec3.of(4, 5, 6), 3);    // → true
+     * Vec3.of(1, 2, 3).eq(Vec3.of(4, 5, 6), 3.01); // → true
+     * Vec3.of(1, 2, 3).eq(Vec3.of(4, 5, 6), 2.99); // → false
+     * ```
+     */
+    Vec3.prototype.eq = function (other, fuzz) {
+        if (fuzz === void 0) { fuzz = 1e-10; }
+        for (var i = 0; i < 3; i++) {
+            if (Math.abs(other.at(i) - this.at(i)) > fuzz) {
+                return false;
+            }
+        }
+        return true;
+    };
+    Vec3.prototype.toString = function () {
+        return "Vec(".concat(this.x, ", ").concat(this.y, ", ").concat(this.z, ")");
+    };
+    Vec3.unitX = Vec3.of(1, 0, 0);
+    Vec3.unitY = Vec3.of(0, 1, 0);
+    Vec3.unitZ = Vec3.of(0, 0, 1);
+    Vec3.zero = Vec3.of(0, 0, 0);
+    return Vec3;
+}());
+export default Vec3;

package/dist/mjs/math/Vec3.test.d.ts

@@ -0,0 +1 @@
+export {};

package/dist/mjs/math/lib.d.ts

@@ -0,0 +1,7 @@
+import LineSegment2 from './shapes/LineSegment2';
+import Mat33 from './Mat33';
+import Path from './shapes/Path';
+import Rect2 from './shapes/Rect2';
+import { Vec2 } from './Vec2';
+import Vec3 from './Vec3';
+export { LineSegment2, Mat33, Path, Rect2, Vec3, Vec2, };

package/dist/mjs/math/lib.mjs

@@ -0,0 +1,7 @@
+import  LineSegment2  from './shapes/LineSegment2.mjs';
+import  Mat33  from './Mat33.mjs';
+import  Path  from './shapes/Path.mjs';
+import  Rect2  from './shapes/Rect2.mjs';
+import  { Vec2 }  from './Vec2.mjs';
+import  Vec3  from './Vec3.mjs';
+export { LineSegment2, Mat33, Path, Rect2, Vec3, Vec2, };

package/dist/mjs/math/polynomial/solveQuadratic.d.ts

@@ -0,0 +1,9 @@
+/**
+ * Solves an equation of the form ax² + bx + c = 0.
+ * The larger solution is returned first.
+ *
+ * If there are no solutions, returns `[NaN, NaN]`. If there is one solution,
+ * repeats the solution twice in the result.
+ */
+declare const solveQuadratic: (a: number, b: number, c: number) => [number, number];
+export default solveQuadratic;

package/dist/mjs/math/polynomial/solveQuadratic.mjs

@@ -0,0 +1,37 @@
+/**
+ * Solves an equation of the form ax² + bx + c = 0.
+ * The larger solution is returned first.
+ *
+ * If there are no solutions, returns `[NaN, NaN]`. If there is one solution,
+ * repeats the solution twice in the result.
+ */
+var solveQuadratic = function (a, b, c) {
+    // See also https://en.wikipedia.org/wiki/Quadratic_formula
+    if (a === 0) {
+        var solution = void 0;
+        if (b === 0) {
+            solution = c === 0 ? 0 : NaN;
+        }
+        else {
+            // Then we have bx + c = 0
+            // which implies bx = -c.
+            // Thus, x = -c/b
+            solution = -c / b;
+        }
+        return [solution, solution];
+    }
+    var discriminant = b * b - 4 * a * c;
+    if (discriminant < 0) {
+        return [NaN, NaN];
+    }
+    var rootDiscriminant = Math.sqrt(discriminant);
+    var solution1 = (-b + rootDiscriminant) / (2 * a);
+    var solution2 = (-b - rootDiscriminant) / (2 * a);
+    if (solution1 > solution2) {
+        return [solution1, solution2];
+    }
+    else {
+        return [solution2, solution1];
+    }
+};
+export default solveQuadratic;

package/dist/mjs/math/polynomial/solveQuadratic.test.d.ts

@@ -0,0 +1 @@
+export {};

package/dist/mjs/math/rounding.mjs

@@ -0,0 +1,133 @@
+// @packageDocumentation @internal
+// Clean up stringified numbers
+export var cleanUpNumber = function (text) {
+    // Regular expression substitions can be somewhat expensive. Only do them
+    // if necessary.
+    if (text.indexOf('e') > 0) {
+        // Round to zero.
+        if (text.match(/[eE][-]\d{2,}$/)) {
+            return '0';
+        }
+    }
+    var lastChar = text.charAt(text.length - 1);
+    if (lastChar === '0' || lastChar === '.') {
+        // Remove trailing zeroes
+        text = text.replace(/([.]\d*[^0]+)0+$/, '$1');
+        text = text.replace(/[.]0+$/, '.');
+        // Remove trailing period
+        text = text.replace(/[.]$/, '');
+    }
+    var firstChar = text.charAt(0);
+    if (firstChar === '0' || firstChar === '-') {
+        // Remove unnecessary leading zeroes.
+        text = text.replace(/^(0+)[.]/, '.');
+        text = text.replace(/^-(0+)[.]/, '-.');
+        text = text.replace(/^(-?)0+$/, '$10');
+    }
+    if (text === '-0') {
+        return '0';
+    }
+    return text;
+};
+export var toRoundedString = function (num) {
+    // Try to remove rounding errors. If the number ends in at least three/four zeroes
+    // (or nines) just one or two digits, it's probably a rounding error.
+    var fixRoundingUpExp = /^([-]?\d*\.\d{3,})0{4,}\d{1,4}$/;
+    var hasRoundingDownExp = /^([-]?)(\d*)\.(\d{3,}9{4,})\d{1,4}$/;
+    var text = num.toString(10);
+    if (text.indexOf('.') === -1) {
+        return text;
+    }
+    var roundingDownMatch = hasRoundingDownExp.exec(text);
+    if (roundingDownMatch) {
+        var negativeSign = roundingDownMatch[1];
+        var postDecimalString = roundingDownMatch[3];
+        var lastDigit = parseInt(postDecimalString.charAt(postDecimalString.length - 1), 10);
+        var postDecimal = parseInt(postDecimalString, 10);
+        var preDecimal = parseInt(roundingDownMatch[2], 10);
+        var origPostDecimalString = roundingDownMatch[3];
+        var newPostDecimal = (postDecimal + 10 - lastDigit).toString();
+        var carry = 0;
+        if (newPostDecimal.length > postDecimal.toString().length) {
+            // Left-shift
+            newPostDecimal = newPostDecimal.substring(1);
+            carry = 1;
+        }
+        // parseInt(...).toString() removes leading zeroes. Add them back.
+        while (newPostDecimal.length < origPostDecimalString.length) {
+            newPostDecimal = carry.toString(10) + newPostDecimal;
+            carry = 0;
+        }
+        text = "".concat(negativeSign + (preDecimal + carry).toString(), ".").concat(newPostDecimal);
+    }
+    text = text.replace(fixRoundingUpExp, '$1');
+    return cleanUpNumber(text);
+};
+var numberExp = /^([-]?)(\d*)[.](\d+)$/;
+export var getLenAfterDecimal = function (numberAsString) {
+    var numberMatch = numberExp.exec(numberAsString);
+    if (!numberMatch) {
+        // If not a match, either the number is exponential notation (or is something
+        // like NaN or Infinity)
+        if (numberAsString.search(/[eE]/) !== -1 || /^[a-zA-Z]+$/.exec(numberAsString)) {
+            return -1;
+            // Or it has no decimal point
+        }
+        else {
+            return 0;
+        }
+    }
+    var afterDecimalLen = numberMatch[3].length;
+    return afterDecimalLen;
+};
+// [reference] should be a string representation of a base-10 number (no exponential (e.g. 10e10))
+export var toStringOfSamePrecision = function (num) {
+    var references = [];
+    for (var _i = 1; _i < arguments.length; _i++) {
+        references[_i - 1] = arguments[_i];
+    }
+    var text = num.toString(10);
+    var textMatch = numberExp.exec(text);
+    if (!textMatch) {
+        return text;
+    }
+    var decimalPlaces = -1;
+    for (var _a = 0, references_1 = references; _a < references_1.length; _a++) {
+        var reference = references_1[_a];
+        decimalPlaces = Math.max(getLenAfterDecimal(reference), decimalPlaces);
+    }
+    if (decimalPlaces === -1) {
+        return toRoundedString(num);
+    }
+    // Make text's after decimal length match [afterDecimalLen].
+    var postDecimal = textMatch[3].substring(0, decimalPlaces);
+    var preDecimal = textMatch[2];
+    var nextDigit = textMatch[3].charAt(decimalPlaces);
+    if (nextDigit !== '') {
+        var asNumber = parseInt(nextDigit, 10);
+        if (asNumber >= 5) {
+            // Don't attempt to parseInt() an empty string.
+            if (postDecimal.length > 0) {
+                var leadingZeroMatch = /^(0+)(\d*)$/.exec(postDecimal);
+                var leadingZeroes = '';
+                var postLeading = postDecimal;
+                if (leadingZeroMatch) {
+                    leadingZeroes = leadingZeroMatch[1];
+                    postLeading = leadingZeroMatch[2];
+                }
+                postDecimal = (parseInt(postDecimal) + 1).toString();
+                // If postDecimal got longer, remove leading zeroes if possible
+                if (postDecimal.length > postLeading.length && leadingZeroes.length > 0) {
+                    leadingZeroes = leadingZeroes.substring(1);
+                }
+                postDecimal = leadingZeroes + postDecimal;
+            }
+            if (postDecimal.length === 0 || postDecimal.length > decimalPlaces) {
+                preDecimal = (parseInt(preDecimal) + 1).toString();
+                postDecimal = postDecimal.substring(1);
+            }
+        }
+    }
+    var negativeSign = textMatch[1];
+    return cleanUpNumber("".concat(negativeSign).concat(preDecimal, ".").concat(postDecimal));
+};

package/dist/mjs/math/rounding.test.d.ts

@@ -0,0 +1 @@
+export {};

package/dist/mjs/math/shapes/Abstract2DShape.d.ts

@@ -0,0 +1,49 @@
+import LineSegment2 from './LineSegment2';
+import { Point2 } from '../Vec2';
+import Rect2 from './Rect2';
+declare abstract class Abstract2DShape {
+    protected static readonly smallValue = 1e-12;
+    /**
+     * @returns the distance from `point` to this shape. If `point` is within this shape,
+     * this returns the distance from `point` to the edge of this shape.
+     *
+     * @see {@link signedDistance}
+     */
+    distance(point: Point2): number;
+    /**
+     * Computes the [signed distance function](https://en.wikipedia.org/wiki/Signed_distance_function)
+     * for this shape.
+     */
+    abstract signedDistance(point: Point2): number;
+    /**
+     * @returns points at which this shape intersects the given `lineSegment`.
+     *
+     * If this is a closed shape, returns points where the given `lineSegment` intersects
+     * the **boundary** of this.
+     */
+    abstract intersectsLineSegment(lineSegment: LineSegment2): Point2[];
+    /**
+     * Returns `true` if and only if the given `point` is contained within this shape.
+     *
+     * `epsilon` is a small number used to counteract floating point error. Thus, if
+     * `point` is within `epsilon` of the inside of this shape, `containsPoint` may also
+     * return `true`.
+     *
+     * The default implementation relies on `signedDistance`.
+     * Subclasses may override this method to provide a more efficient implementation.
+     */
+    containsPoint(point: Point2, epsilon?: number): boolean;
+    /**
+     * Returns a bounding box that precisely fits the content of this shape.
+     */
+    abstract getTightBoundingBox(): Rect2;
+    /**
+     * Returns a bounding box that **loosely** fits the content of this shape.
+     *
+     * The result of this call can be larger than the result of {@link getTightBoundingBox},
+     * **but should not be smaller**. Thus, a call to `getLooseBoundingBox` can be significantly
+     * faster than a call to {@link getTightBoundingBox} for some shapes.
+     */
+    getLooseBoundingBox(): Rect2;
+}
+export default Abstract2DShape;

package/dist/mjs/math/shapes/Abstract2DShape.mjs

@@ -0,0 +1,40 @@
+var Abstract2DShape = /** @class */ (function () {
+    function Abstract2DShape() {
+    }
+    /**
+     * @returns the distance from `point` to this shape. If `point` is within this shape,
+     * this returns the distance from `point` to the edge of this shape.
+     *
+     * @see {@link signedDistance}
+     */
+    Abstract2DShape.prototype.distance = function (point) {
+        return Math.abs(this.signedDistance(point));
+    };
+    /**
+     * Returns `true` if and only if the given `point` is contained within this shape.
+     *
+     * `epsilon` is a small number used to counteract floating point error. Thus, if
+     * `point` is within `epsilon` of the inside of this shape, `containsPoint` may also
+     * return `true`.
+     *
+     * The default implementation relies on `signedDistance`.
+     * Subclasses may override this method to provide a more efficient implementation.
+     */
+    Abstract2DShape.prototype.containsPoint = function (point, epsilon) {
+        if (epsilon === void 0) { epsilon = Abstract2DShape.smallValue; }
+        return this.signedDistance(point) < epsilon;
+    };
+    /**
+     * Returns a bounding box that **loosely** fits the content of this shape.
+     *
+     * The result of this call can be larger than the result of {@link getTightBoundingBox},
+     * **but should not be smaller**. Thus, a call to `getLooseBoundingBox` can be significantly
+     * faster than a call to {@link getTightBoundingBox} for some shapes.
+     */
+    Abstract2DShape.prototype.getLooseBoundingBox = function () {
+        return this.getTightBoundingBox();
+    };
+    Abstract2DShape.smallValue = 1e-12;
+    return Abstract2DShape;
+}());
+export default Abstract2DShape;

package/dist/mjs/math/shapes/BezierJSWrapper.d.ts

@@ -0,0 +1,36 @@
+import { Bezier } from 'bezier-js';
+import { Point2, Vec2 } from '../Vec2';
+import Abstract2DShape from './Abstract2DShape';
+import LineSegment2 from './LineSegment2';
+import Rect2 from './Rect2';
+/**
+ * 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.
+ * @internal
+ */
+declare abstract class BezierJSWrapper extends Abstract2DShape {
+    #private;
+    /** Returns the start, control points, and end point of this Bézier. */
+    abstract getPoints(): Point2[];
+    protected getBezier(): Bezier;
+    signedDistance(point: Point2): number;
+    /**
+     * @returns the (more) exact distance from `point` to this.
+     *
+     * @see {@link approximateDistance}
+     */
+    distance(point: Point2): number;
+    /**
+     * @returns the curve evaluated at `t`.
+     */
+    at(t: number): Point2;
+    derivativeAt(t: number): Point2;
+    normal(t: number): Vec2;
+    getTightBoundingBox(): Rect2;
+    intersectsLineSegment(line: LineSegment2): Point2[];
+}
+export default BezierJSWrapper;

package/dist/mjs/math/shapes/BezierJSWrapper.mjs

@@ -0,0 +1,107 @@
+var __extends = (this && this.__extends) || (function () {
+    var extendStatics = function (d, b) {
+        extendStatics = Object.setPrototypeOf ||
+            ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
+            function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };
+        return extendStatics(d, b);
+    };
+    return function (d, b) {
+        if (typeof b !== "function" && b !== null)
+            throw new TypeError("Class extends value " + String(b) + " is not a constructor or null");
+        extendStatics(d, b);
+        function __() { this.constructor = d; }
+        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
+    };
+})();
+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 _BezierJSWrapper_bezierJs;
+import { Bezier } from 'bezier-js';
+import  { Vec2 }  from '../Vec2.mjs';
+import  Abstract2DShape  from './Abstract2DShape.mjs';
+import  Rect2  from './Rect2.mjs';
+/**
+ * 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.
+ * @internal
+ */
+var BezierJSWrapper = /** @class */ (function (_super) {
+    __extends(BezierJSWrapper, _super);
+    function BezierJSWrapper() {
+        var _this = _super !== null && _super.apply(this, arguments) || this;
+        _BezierJSWrapper_bezierJs.set(_this, null);
+        return _this;
+    }
+    BezierJSWrapper.prototype.getBezier = function () {
+        if (!__classPrivateFieldGet(this, _BezierJSWrapper_bezierJs, "f")) {
+            __classPrivateFieldSet(this, _BezierJSWrapper_bezierJs, new Bezier(this.getPoints().map(function (p) { return p.xy; })), "f");
+        }
+        return __classPrivateFieldGet(this, _BezierJSWrapper_bezierJs, "f");
+    };
+    BezierJSWrapper.prototype.signedDistance = function (point) {
+        // .d: Distance
+        return this.getBezier().project(point.xy).d;
+    };
+    /**
+     * @returns the (more) exact distance from `point` to this.
+     *
+     * @see {@link approximateDistance}
+     */
+    BezierJSWrapper.prototype.distance = function (point) {
+        // A Bézier curve has no interior, thus, signed distance is the same as distance.
+        return this.signedDistance(point);
+    };
+    /**
+     * @returns the curve evaluated at `t`.
+     */
+    BezierJSWrapper.prototype.at = function (t) {
+        return Vec2.ofXY(this.getBezier().get(t));
+    };
+    BezierJSWrapper.prototype.derivativeAt = function (t) {
+        return Vec2.ofXY(this.getBezier().derivative(t));
+    };
+    BezierJSWrapper.prototype.normal = function (t) {
+        return Vec2.ofXY(this.getBezier().normal(t));
+    };
+    BezierJSWrapper.prototype.getTightBoundingBox = function () {
+        var bbox = this.getBezier().bbox();
+        var width = bbox.x.max - bbox.x.min;
+        var height = bbox.y.max - bbox.y.min;
+        return new Rect2(bbox.x.min, bbox.y.min, width, height);
+    };
+    BezierJSWrapper.prototype.intersectsLineSegment = function (line) {
+        var bezier = this.getBezier();
+        var intersectionPoints = bezier.intersects(line).map(function (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);
+            }
+            var point = Vec2.ofXY(bezier.get(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) {
+                return null;
+            }
+            return point;
+        }).filter(function (entry) { return entry !== null; });
+        return intersectionPoints;
+    };
+    return BezierJSWrapper;
+}(Abstract2DShape));
+_BezierJSWrapper_bezierJs = new WeakMap();
+export default BezierJSWrapper;

package/dist/mjs/math/shapes/CubicBezier.d.ts

@@ -0,0 +1,17 @@
+import { Point2 } from '../Vec2';
+import BezierJSWrapper from './BezierJSWrapper';
+import Rect2 from './Rect2';
+/**
+ * A wrapper around [`bezier-js`](https://github.com/Pomax/bezierjs)'s cubic Bezier.
+ */
+declare class CubicBezier extends BezierJSWrapper {
+    readonly p0: Point2;
+    readonly p1: Point2;
+    readonly p2: Point2;
+    readonly p3: Point2;
+    constructor(p0: Point2, p1: Point2, p2: Point2, p3: Point2);
+    getPoints(): import("../Vec3").default[];
+    /** Returns an overestimate of this shape's bounding box. */
+    getLooseBoundingBox(): Rect2;
+}
+export default CubicBezier;