@itwin/core-geometry 3.0.0-dev.76 → 3.0.0-dev.80

package/lib/esm/bspline/InterpolationCurve3d.js

@@ -0,0 +1,281 @@
+/*---------------------------------------------------------------------------------------------
+* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+* See LICENSE.md in the project root for license terms and full copyright notice.
+*--------------------------------------------------------------------------------------------*/
+/** @packageDocumentation
+ * @module Bspline
+ */
+import { Vector3d } from "../geometry3d/Point3dVector3d";
+import { Geometry } from "../Geometry";
+import { Point3dArray } from "../geometry3d/PointHelpers";
+import { ProxyCurve } from "../curve/ProxyCurve";
+import { BSplineCurveOps } from "../bspline/BSplineCurveOps";
+import { BSplineCurve3d } from "./BSplineCurve";
+/**
+ * fitPoints and end condition data for [[InterpolationCurve3d]]
+ * * This is a "typed object" version of the serializer-friendly [[InterpolationCurve3dProps]]
+ * * Typical use cases rarely require all parameters, so the constructor does not itemize them as parameters.
+ * @public
+ */
+export class InterpolationCurve3dOptions {
+    /**
+     * Constructor.
+     * @param fitPoints points to CAPTURE
+     * @param knots array to CAPTURE
+     */
+    constructor(fitPoints, knots) {
+        this._fitPoints = fitPoints ? fitPoints : [];
+        this._knots = knots;
+    }
+    /** `order` as property */
+    get order() { return Geometry.resolveNumber(this._order, 4); }
+    set order(val) { this._order = val; }
+    /** `closed` as property */
+    get closed() { return Geometry.resolveValue(this._closed, false); }
+    set closed(val) { this._closed = val; }
+    /** `isChordLenKnots` as property */
+    get isChordLenKnots() { return Geometry.resolveNumber(this._isChordLenKnots, 0); }
+    set isChordLenKnots(val) { this._isChordLenKnots = val; }
+    /** `isColinearTangents` as property */
+    get isColinearTangents() { return Geometry.resolveNumber(this._isColinearTangents, 0); }
+    set isColinearTangents(val) { this._isColinearTangents = val; }
+    /** `isChordLenTangents` as property */
+    get isChordLenTangents() { return Geometry.resolveNumber(this._isChordLenTangents, 0); }
+    set isChordLenTangents(val) { this._isChordLenTangents = val; }
+    /** `isNaturalTangents` as property */
+    get isNaturalTangents() { return Geometry.resolveNumber(this._isNaturalTangents, 0); }
+    set isNaturalTangents(val) { this._isNaturalTangents = val; }
+    /** access POSSIBLY UNDEFINED start tangent. Setter CAPTURES. */
+    get startTangent() { return this._startTangent; }
+    set startTangent(val) { this._startTangent = val; }
+    /** access POSSIBLY UNDEFINED end tangent. Setter CAPTURES. */
+    get endTangent() { return this._endTangent; }
+    set endTangent(val) { this._endTangent = val; }
+    /** access POINTER TO fit points. Setter CAPTURES. */
+    get fitPoints() { return this._fitPoints; }
+    set fitPoints(val) { this._fitPoints = val; }
+    /** access POSSIBLY UNDEFINED knots array. Setter CAPTURES. */
+    get knots() { return this._knots; }
+    set knots(val) { this._knots = val; }
+    /** One step setup of properties not named in constructor.
+     * * CAPTURE pointers to tangents.
+     * * OPTIONALLY downgrade "0" values to undefined.
+     */
+    captureOptionalProps(order, closed, isChordLenKnots, isColinearTangents, isChordLenTangent, isNaturalTangents, startTangent, endTangent) {
+        this._order = Geometry.resolveToUndefined(order, 0);
+        this._closed = Geometry.resolveToUndefined(closed, false);
+        this._isChordLenKnots = Geometry.resolveToUndefined(isChordLenKnots, 0);
+        this._isColinearTangents = Geometry.resolveToUndefined(isColinearTangents, 0);
+        this._isChordLenTangents = Geometry.resolveToUndefined(isChordLenTangent, 0);
+        this._isNaturalTangents = Geometry.resolveToUndefined(isNaturalTangents, 0);
+        this._startTangent = startTangent;
+        this._endTangent = endTangent;
+    }
+    /** Clone with strongly typed members reduced to simple json, with "undefined" members omitted */
+    cloneAsInterpolationCurve3dProps() {
+        var _a, _b, _c;
+        const props = {
+            fitPoints: Point3dArray.cloneDeepJSONNumberArrays(this.fitPoints),
+            knots: (_a = this._knots) === null || _a === void 0 ? void 0 : _a.slice(),
+        };
+        if (this._order !== undefined)
+            props.order = this._order;
+        if (this._closed !== undefined)
+            props.closed = this._closed;
+        if (this._isChordLenKnots !== undefined)
+            props.isChordLenKnots = this._isChordLenKnots;
+        if (this._isColinearTangents !== undefined)
+            props.isColinearTangents = this._isColinearTangents;
+        if (this._isChordLenTangents !== undefined)
+            props.isChordLenTangents = this._isChordLenTangents;
+        if (this._isNaturalTangents !== undefined)
+            props.isNaturalTangents = this._isNaturalTangents;
+        if (this._startTangent !== undefined)
+            props.startTangent = (_b = this._startTangent) === null || _b === void 0 ? void 0 : _b.toArray();
+        if (this._endTangent !== undefined)
+            props.endTangent = (_c = this._endTangent) === null || _c === void 0 ? void 0 : _c.toArray();
+        return props;
+    }
+    /** Clone with strongly typed members reduced to simple json. */
+    clone() {
+        var _a, _b, _c;
+        const clone = new InterpolationCurve3dOptions(Point3dArray.clonePoint3dArray(this.fitPoints), (_a = this.knots) === null || _a === void 0 ? void 0 : _a.slice());
+        clone._order = this.order;
+        clone._closed = this.closed;
+        clone._isChordLenKnots = this.isChordLenKnots;
+        clone._isColinearTangents = this.isColinearTangents;
+        clone._isChordLenTangents = this.isChordLenTangents;
+        clone._isNaturalTangents = this.isNaturalTangents;
+        clone._startTangent = (_b = this._startTangent) === null || _b === void 0 ? void 0 : _b.clone();
+        clone._endTangent = (_c = this._endTangent) === null || _c === void 0 ? void 0 : _c.clone();
+        return clone;
+    }
+    /** Clone with strongly typed members reduced to simple json. */
+    static create(source) {
+        var _a;
+        const result = new InterpolationCurve3dOptions(Point3dArray.clonePoint3dArray(source.fitPoints), (_a = source.knots) === null || _a === void 0 ? void 0 : _a.slice());
+        result._order = source.order;
+        result._closed = source.closed;
+        result._isChordLenKnots = source.isChordLenKnots;
+        result._isColinearTangents = source.isColinearTangents;
+        result._isChordLenTangents = source.isChordLenTangents;
+        result._isNaturalTangents = source.isNaturalTangents;
+        result._startTangent = source.startTangent ? Vector3d.fromJSON(source.startTangent) : undefined;
+        result._endTangent = source.endTangent ? Vector3d.fromJSON(source.endTangent) : undefined;
+        return result;
+    }
+    // ugh.
+    // vector equality test with awkward rule that 000 matches undefined.
+    static areAlmostEqualAllow000AsUndefined(a, b) {
+        if (a !== undefined && a.maxAbs() === 0)
+            a = undefined;
+        if (b !== undefined && b.maxAbs() === 0)
+            b = undefined;
+        if (a !== undefined && b !== undefined)
+            return a.isAlmostEqual(b);
+        return a === undefined && b === undefined;
+    }
+    static areAlmostEqual(dataA, dataB) {
+        if (dataA === undefined && dataB === undefined)
+            return true;
+        if (dataA !== undefined && dataB !== undefined) {
+            if (Geometry.areEqualAllowUndefined(dataA.order, dataB.order)
+                && Geometry.areEqualAllowUndefined(dataA.closed, dataB.closed)
+                && Geometry.areEqualAllowUndefined(dataA.isChordLenKnots, dataB.isChordLenKnots)
+                && Geometry.areEqualAllowUndefined(dataA.isColinearTangents, dataB.isColinearTangents)
+                && Geometry.areEqualAllowUndefined(dataA.isNaturalTangents, dataB.isNaturalTangents)
+                && this.areAlmostEqualAllow000AsUndefined(dataA.startTangent, dataB.startTangent)
+                && this.areAlmostEqualAllow000AsUndefined(dataA.endTangent, dataB.endTangent)
+                && Geometry.almostEqualArrays(dataA.fitPoints, dataB.fitPoints, (a, b) => a.isAlmostEqual(b))) {
+                if (Geometry.almostEqualNumberArrays(dataA.knots, dataB.knots, (a, b) => a === b))
+                    return true;
+                if (dataA.knots === undefined && dataB.knots === undefined)
+                    return true;
+                /* alas .. need to allow tricky mismatch of end replication */
+                const knotsA = BSplineCurveOps.C2CubicFit.convertCubicKnotVectorToFitParams(dataA.knots, dataA.fitPoints.length, false);
+                const knotsB = BSplineCurveOps.C2CubicFit.convertCubicKnotVectorToFitParams(dataB.knots, dataB.fitPoints.length, false);
+                return Geometry.almostEqualNumberArrays(knotsA, knotsB, (a, b) => Geometry.isAlmostEqualNumber(a, b));
+            }
+        }
+        return false;
+    }
+    /** reverse the order or sense of all start-to-end related properties. */
+    reverseInPlace() {
+        this.fitPoints.reverse();
+        if (this.knots)
+            this.knots.reverse();
+        // Swap pointers to tangents.
+        // NEEDS WORK: Do the vector coordinates need to be negated?
+        const oldStart = this._startTangent;
+        this._startTangent = this.endTangent;
+        this._endTangent = oldStart;
+    }
+}
+/**
+ * Interpolating curve.
+ * * Derive from [[ProxyCurve]]
+ * * Use a [[BSplineCurve3d]] as the proxy
+ * *
+ * @public
+ */
+export class InterpolationCurve3d extends ProxyCurve {
+    /**
+     * CAPTURE properties and proxy curve.
+     */
+    constructor(properties, proxyCurve) {
+        super(proxyCurve);
+        this.curvePrimitiveType = "interpolationCurve";
+        this._options = properties;
+    }
+    dispatchToGeometryHandler(handler) {
+        return handler.handleInterpolationCurve3d(this);
+    }
+    /**
+     * Create an [[InterpolationCurve3d]] based on points, knots, and other properties in the [[InterpolationCurve3dProps]] or [[InterpolationCurve3dOptions]].
+     * * This saves a COPY OF the options or props.
+     * * Use createCapture () if the options or props can be used without copy
+     */
+    static create(options) {
+        let optionsCopy;
+        if (options instanceof InterpolationCurve3dOptions) {
+            optionsCopy = options.clone();
+        }
+        else {
+            optionsCopy = InterpolationCurve3dOptions.create(options);
+        }
+        return InterpolationCurve3d.createCapture(optionsCopy);
+    }
+    /** Create an [[InterpolationCurve3d]]
+     * * The options object is captured into the new curve object (not copied)
+     */
+    static createCapture(options) {
+        const proxyCurve = BSplineCurve3d.createFromInterpolationCurve3dOptions(options);
+        if (proxyCurve)
+            return new InterpolationCurve3d(options, proxyCurve);
+        return undefined;
+    }
+    /** Return a (copy of) the defining points, packed as a Float64Array */
+    copyFitPointsFloat64Array() {
+        return Point3dArray.cloneXYZPropsAsFloat64Array(this._options.fitPoints);
+    }
+    /**
+     * Return json key-value pairs for for this [[InterpolationCurve3d]].
+     * @returns
+     */
+    toJSON() {
+        return this._options.cloneAsInterpolationCurve3dProps();
+    }
+    /** Clone the [[InterpolationCurve3dProps]] object in this [[InterpolationCurve3d]] */
+    cloneProps() {
+        return this._options.cloneAsInterpolationCurve3dProps();
+    }
+    /** return the options pointer */
+    get options() { return this._options; }
+    /**
+     * Reverse the curve direction.
+     * * This updates both the defining properties and the proxy bspline.
+     */
+    reverseInPlace() {
+        this._proxyCurve.reverseInPlace();
+        this._options.reverseInPlace();
+    }
+    /**
+     * Transform this [[InterpolationCurve3d]] and its defining data in place
+     */
+    tryTransformInPlace(transform) {
+        const proxyOk = this._proxyCurve.tryTransformInPlace(transform);
+        if (proxyOk) {
+            transform.multiplyPoint3dArrayInPlace(this._options.fitPoints);
+            // START HERE: transform start/endTangent
+        }
+        return proxyOk;
+    }
+    /**
+     * Return a transformed clone.
+     */
+    cloneTransformed(transform) {
+        const myClone = this.clone();
+        if (myClone && (myClone === null || myClone === void 0 ? void 0 : myClone.tryTransformInPlace(transform)))
+            return myClone;
+        return undefined;
+    }
+    /**
+     * Return a clone.
+     */
+    clone() {
+        const proxyClone = this._proxyCurve.clone();
+        if (proxyClone) {
+            return new InterpolationCurve3d(this._options.clone(), proxyClone);
+        }
+        return undefined;
+    }
+    isAlmostEqual(other) {
+        if (other instanceof InterpolationCurve3d) {
+            return InterpolationCurve3dOptions.areAlmostEqual(this._options, other._options);
+        }
+        return false;
+    }
+    /** Test if `other` is also an [[InterpolationCurve3d]] */
+    isSameGeometryClass(other) { return other instanceof InterpolationCurve3d; }
+}
+//# sourceMappingURL=InterpolationCurve3d.js.map

package/lib/esm/bspline/InterpolationCurve3d.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"InterpolationCurve3d.js","sourceRoot":"","sources":["../../../src/bspline/InterpolationCurve3d.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH,OAAO,EAAW,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAClE,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AACvC,OAAO,EAAE,YAAY,EAAE,MAAM,4BAA4B,CAAC;AAC1D,OAAO,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAC;AAEjD,OAAO,EAAE,eAAe,EAAE,MAAM,4BAA4B,CAAC;AAC7D,OAAO,EAAE,cAAc,EAAE,MAAM,gBAAgB,CAAC;AAkChD;;;;;GAKG;AACH,MAAM,OAAO,2BAA2B;IACtC;;;;OAIG;IACH,YAAmB,SAAqB,EAAE,KAAgB;QACxD,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC;QAC7C,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;IACtB,CAAC;IAaD,0BAA0B;IAC1B,IAAW,KAAK,KAAa,OAAO,QAAQ,CAAC,aAAa,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7E,IAAW,KAAK,CAAC,GAAW,IAAI,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC;IACpD,2BAA2B;IAC3B,IAAW,MAAM,KAAc,OAAO,QAAQ,CAAC,YAAY,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;IACnF,IAAW,MAAM,CAAC,GAAY,IAAI,IAAI,CAAC,OAAO,GAAG,GAAG,CAAC,CAAC,CAAC;IACvD,oCAAoC;IACpC,IAAW,eAAe,KAAa,OAAO,QAAQ,CAAC,aAAa,CAAC,IAAI,CAAC,gBAAgB,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACjG,IAAW,eAAe,CAAC,GAAW,IAAI,IAAI,CAAC,gBAAgB,GAAG,GAAG,CAAC,CAAC,CAAC;IACxE,uCAAuC;IACvC,IAAW,kBAAkB,KAAa,OAAO,QAAQ,CAAC,aAAa,CAAC,IAAI,CAAC,mBAAmB,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACvG,IAAW,kBAAkB,CAAC,GAAW,IAAI,IAAI,CAAC,mBAAmB,GAAG,GAAG,CAAC,CAAC,CAAC;IAC9E,uCAAuC;IACvC,IAAW,kBAAkB,KAAa,OAAO,QAAQ,CAAC,aAAa,CAAC,IAAI,CAAC,mBAAmB,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACvG,IAAW,kBAAkB,CAAC,GAAW,IAAI,IAAI,CAAC,mBAAmB,GAAG,GAAG,CAAC,CAAC,CAAC;IAC9E,sCAAsC;IACtC,IAAW,iBAAiB,KAAa,OAAO,QAAQ,CAAC,aAAa,CAAC,IAAI,CAAC,kBAAkB,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACrG,IAAW,iBAAiB,CAAC,GAAW,IAAI,IAAI,CAAC,kBAAkB,GAAG,GAAG,CAAC,CAAC,CAAC;IAC5E,gEAAgE;IAChE,IAAW,YAAY,KAA2B,OAAO,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC;IAC9E,IAAW,YAAY,CAAC,GAAyB,IAAI,IAAI,CAAC,aAAa,GAAG,GAAG,CAAC,CAAC,CAAC;IAChF,8DAA8D;IAC9D,IAAW,UAAU,KAA2B,OAAO,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;IAC1E,IAAW,UAAU,CAAC,GAAyB,IAAI,IAAI,CAAC,WAAW,GAAG,GAAG,CAAC,CAAC,CAAC;IAC5E,qDAAqD;IACrD,IAAW,SAAS,KAAgB,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;IAC7D,IAAW,SAAS,CAAC,GAAc,IAAI,IAAI,CAAC,UAAU,GAAG,GAAG,CAAC,CAAC,CAAC;IAC/D,8DAA8D;IAC9D,IAAW,KAAK,KAA2B,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IAChE,IAAW,KAAK,CAAC,GAAyB,IAAI,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC;IAElE;;;OAGG;IACI,oBAAoB,CACzB,KAAyB,EACzB,MAA2B,EAC3B,eAAmC,EACnC,kBAAsC,EACtC,iBAAqC,EACrC,iBAAqC,EACrC,YAAkC,EAClC,UAAgC;QAEhC,IAAI,CAAC,MAAM,GAAG,QAAQ,CAAC,kBAAkB,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QACpD,IAAI,CAAC,OAAO,GAAG,QAAQ,CAAC,kBAAkB,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QAC1D,IAAI,CAAC,gBAAgB,GAAG,QAAQ,CAAC,kBAAkB,CAAC,eAAe,EAAE,CAAC,CAAC,CAAC;QACxE,IAAI,CAAC,mBAAmB,GAAG,QAAQ,CAAC,kBAAkB,CAAC,kBAAkB,EAAE,CAAC,CAAC,CAAC;QAC9E,IAAI,CAAC,mBAAmB,GAAG,QAAQ,CAAC,kBAAkB,CAAC,iBAAiB,EAAE,CAAC,CAAC,CAAC;QAC7E,IAAI,CAAC,kBAAkB,GAAG,QAAQ,CAAC,kBAAkB,CAAC,iBAAiB,EAAE,CAAC,CAAC,CAAC;QAC5E,IAAI,CAAC,aAAa,GAAG,YAAY,CAAC;QAClC,IAAI,CAAC,WAAW,GAAG,UAAU,CAAC;IAEhC,CAAC;IACD,iGAAiG;IAC1F,gCAAgC;;QACrC,MAAM,KAAK,GAA8B;YACvC,SAAS,EAAE,YAAY,CAAC,yBAAyB,CAAC,IAAI,CAAC,SAAS,CAAC;YACjE,KAAK,EAAE,MAAA,IAAI,CAAC,MAAM,0CAAE,KAAK,EAAE;SAC5B,CAAC;QACF,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS;YAC3B,KAAK,CAAC,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QAC5B,IAAI,IAAI,CAAC,OAAO,KAAK,SAAS;YAC5B,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC;QAC9B,IAAI,IAAI,CAAC,gBAAgB,KAAK,SAAS;YACrC,KAAK,CAAC,eAAe,GAAG,IAAI,CAAC,gBAAgB,CAAC;QAChD,IAAI,IAAI,CAAC,mBAAmB,KAAK,SAAS;YACxC,KAAK,CAAC,kBAAkB,GAAG,IAAI,CAAC,mBAAmB,CAAC;QACtD,IAAI,IAAI,CAAC,mBAAmB,KAAK,SAAS;YACxC,KAAK,CAAC,kBAAkB,GAAG,IAAI,CAAC,mBAAmB,CAAC;QACtD,IAAI,IAAI,CAAC,kBAAkB,KAAK,SAAS;YACvC,KAAK,CAAC,iBAAiB,GAAG,IAAI,CAAC,kBAAkB,CAAC;QACpD,IAAI,IAAI,CAAC,aAAa,KAAK,SAAS;YAClC,KAAK,CAAC,YAAY,GAAG,MAAA,IAAI,CAAC,aAAa,0CAAE,OAAO,EAAE,CAAC;QACrD,IAAI,IAAI,CAAC,WAAW,KAAK,SAAS;YAChC,KAAK,CAAC,UAAU,GAAG,MAAA,IAAI,CAAC,WAAW,0CAAE,OAAO,EAAE,CAAC;QACjD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,gEAAgE;IACzD,KAAK;;QACV,MAAM,KAAK,GAAG,IAAI,2BAA2B,CAAC,YAAY,CAAC,iBAAiB,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,MAAA,IAAI,CAAC,KAAK,0CAAE,KAAK,EAAE,CAAC,CAAC;QACnH,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC;QAC1B,KAAK,CAAC,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC;QAC5B,KAAK,CAAC,gBAAgB,GAAG,IAAI,CAAC,eAAe,CAAC;QAC9C,KAAK,CAAC,mBAAmB,GAAG,IAAI,CAAC,kBAAkB,CAAC;QACpD,KAAK,CAAC,mBAAmB,GAAG,IAAI,CAAC,kBAAkB,CAAC;QACpD,KAAK,CAAC,kBAAkB,GAAG,IAAI,CAAC,iBAAiB,CAAC;QAClD,KAAK,CAAC,aAAa,GAAG,MAAA,IAAI,CAAC,aAAa,0CAAE,KAAK,EAAE,CAAC;QAClD,KAAK,CAAC,WAAW,GAAG,MAAA,IAAI,CAAC,WAAW,0CAAE,KAAK,EAAE,CAAC;QAC9C,OAAO,KAAK,CAAC;IACf,CAAC;IAED,gEAAgE;IACzD,MAAM,CAAC,MAAM,CAAC,MAAiC;;QACpD,MAAM,MAAM,GAAG,IAAI,2BAA2B,CAAC,YAAY,CAAC,iBAAiB,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,MAAA,MAAM,CAAC,KAAK,0CAAE,KAAK,EAAE,CAAC,CAAC;QACxH,MAAM,CAAC,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC;QAC7B,MAAM,CAAC,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC;QAC/B,MAAM,CAAC,gBAAgB,GAAG,MAAM,CAAC,eAAe,CAAC;QACjD,MAAM,CAAC,mBAAmB,GAAG,MAAM,CAAC,kBAAkB,CAAC;QACvD,MAAM,CAAC,mBAAmB,GAAG,MAAM,CAAC,kBAAkB,CAAC;QACvD,MAAM,CAAC,kBAAkB,GAAG,MAAM,CAAC,iBAAiB,CAAC;QACrD,MAAM,CAAC,aAAa,GAAG,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QAChG,MAAM,CAAC,WAAW,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QAC1F,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,OAAO;IACP,qEAAqE;IAC7D,MAAM,CAAC,iCAAiC,CAAC,CAAuB,EAAE,CAAuB;QAC/F,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,CAAC,MAAM,EAAE,KAAK,CAAC;YACrC,CAAC,GAAG,SAAS,CAAC;QAChB,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,CAAC,MAAM,EAAE,KAAK,CAAC;YACrC,CAAC,GAAG,SAAS,CAAC;QAChB,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,SAAS;YACpC,OAAO,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;QAC5B,OAAO,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,SAAS,CAAC;IAC5C,CAAC;IACM,MAAM,CAAC,cAAc,CAAC,KAA8C,EAAE,KAA8C;QACzH,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,KAAK,SAAS;YAC5C,OAAO,IAAI,CAAC;QACd,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,KAAK,SAAS,EAAE;YAC9C,IAAI,QAAQ,CAAC,sBAAsB,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC;mBACxD,QAAQ,CAAC,sBAAsB,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC;mBAC3D,QAAQ,CAAC,sBAAsB,CAAC,KAAK,CAAC,eAAe,EAAE,KAAK,CAAC,eAAe,CAAC;mBAC7E,QAAQ,CAAC,sBAAsB,CAAC,KAAK,CAAC,kBAAkB,EAAE,KAAK,CAAC,kBAAkB,CAAC;mBACnF,QAAQ,CAAC,sBAAsB,CAAC,KAAK,CAAC,iBAAiB,EAAE,KAAK,CAAC,iBAAiB,CAAC;mBACjF,IAAI,CAAC,iCAAiC,CAAC,KAAK,CAAC,YAAY,EAAE,KAAK,CAAC,YAAY,CAAC;mBAC9E,IAAI,CAAC,iCAAiC,CAAC,KAAK,CAAC,UAAU,EAAE,KAAK,CAAC,UAAU,CAAC;mBAC1E,QAAQ,CAAC,iBAAiB,CAAC,KAAK,CAAC,SAAS,EAAE,KAAK,CAAC,SAAS,EAAE,CAAC,CAAU,EAAE,CAAU,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,EAAE;gBACjH,IAAI,QAAQ,CAAC,uBAAuB,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,EAAE,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;oBAC/F,OAAO,IAAI,CAAC;gBACd,IAAI,KAAK,CAAC,KAAK,KAAK,SAAS,IAAI,KAAK,CAAC,KAAK,KAAK,SAAS;oBACxD,OAAO,IAAI,CAAC;gBACd,8DAA8D;gBAC9D,MAAM,MAAM,GAAG,eAAe,CAAC,UAAU,CAAC,iCAAiC,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,SAAS,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;gBACxH,MAAM,MAAM,GAAG,eAAe,CAAC,UAAU,CAAC,iCAAiC,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,SAAS,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;gBACxH,OAAO,QAAQ,CAAC,uBAAuB,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE,CAAC,QAAQ,CAAC,mBAAmB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;aACvH;SACF;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,yEAAyE;IAClE,cAAc;QACnB,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC;QACzB,IAAI,IAAI,CAAC,KAAK;YACZ,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC;QACvB,6BAA6B;QAC7B,4DAA4D;QAC5D,MAAM,QAAQ,GAAG,IAAI,CAAC,aAAa,CAAC;QACpC,IAAI,CAAC,aAAa,GAAG,IAAI,CAAC,UAAU,CAAC;QACrC,IAAI,CAAC,WAAW,GAAG,QAAQ,CAAC;IAC9B,CAAC;CACF;AAED;;;;;;GAMG;AACH,MAAM,OAAO,oBAAqB,SAAQ,UAAU;IAGlD;;OAEG;IACH,YAAoB,UAAuC,EAAE,UAA0B;QACrF,KAAK,CAAC,UAAU,CAAC,CAAC;QANJ,uBAAkB,GAAG,oBAAoB,CAAC;QAOxD,IAAI,CAAC,QAAQ,GAAG,UAAU,CAAC;IAC7B,CAAC;IACe,yBAAyB,CAAC,OAAwB;QAChE,OAAO,OAAO,CAAC,0BAA0B,CAAC,IAAI,CAAC,CAAC;IAClD,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,MAAM,CAAC,OAAgE;QACnF,IAAI,WAAW,CAAC;QAChB,IAAI,OAAO,YAAY,2BAA2B,EAAE;YAClD,WAAW,GAAG,OAAO,CAAC,KAAK,EAAE,CAAC;SAC/B;aAAM;YACL,WAAW,GAAG,2BAA2B,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;SAC3D;QACD,OAAO,oBAAoB,CAAC,aAAa,CAAC,WAAW,CAAC,CAAC;IACzD,CAAC;IACD;;OAEG;IACI,MAAM,CAAC,aAAa,CAAC,OAAoC;QAC9D,MAAM,UAAU,GAAG,cAAc,CAAC,qCAAqC,CAAC,OAAO,CAAC,CAAC;QACjF,IAAI,UAAU;YACZ,OAAO,IAAI,oBAAoB,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;QACvD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,uEAAuE;IAChE,yBAAyB;QAC9B,OAAO,YAAY,CAAC,2BAA2B,CAAC,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;IAC3E,CAAC;IAED;;;OAGG;IACI,MAAM;QACX,OAAO,IAAI,CAAC,QAAQ,CAAC,gCAAgC,EAAE,CAAC;IAC1D,CAAC;IACD,sFAAsF;IAC/E,UAAU;QACf,OAAO,IAAI,CAAC,QAAQ,CAAC,gCAAgC,EAAE,CAAC;IAC1D,CAAC;IAED,iCAAiC;IACjC,IAAW,OAAO,KAAkC,OAAO,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;IAE3E;;;OAGG;IACI,cAAc;QACnB,IAAI,CAAC,WAAW,CAAC,cAAc,EAAE,CAAC;QAClC,IAAI,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC;IACjC,CAAC;IACD;;OAEG;IACI,mBAAmB,CAAC,SAAoB;QAC7C,MAAM,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC,mBAAmB,CAAC,SAAS,CAAC,CAAC;QAChE,IAAI,OAAO,EAAE;YACX,SAAS,CAAC,2BAA2B,CAAC,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;YAC/D,yCAAyC;SAC1C;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IACD;;OAEG;IACI,gBAAgB,CAAC,SAAoB;QAC1C,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;QAC7B,IAAI,OAAO,KAAI,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,mBAAmB,CAAC,SAAS,CAAC,CAAA;YACpD,OAAO,OAAO,CAAC;QACjB,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;OAEG;IACI,KAAK;QACV,MAAM,UAAU,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC;QAC5C,IAAI,UAAU,EAAE;YACd,OAAO,IAAI,oBAAoB,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,EAAE,UAA4B,CAAC,CAAC;SACtF;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACe,aAAa,CAAC,KAAoB;QAChD,IAAI,KAAK,YAAY,oBAAoB,EAAE;YACzC,OAAO,2BAA2B,CAAC,cAAc,CAAC,IAAI,CAAC,QAAQ,EAAE,KAAK,CAAC,QAAQ,CAAC,CAAC;SAClF;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,0DAA0D;IACnD,mBAAmB,CAAC,KAAoB,IAAa,OAAO,KAAK,YAAY,oBAAoB,CAAC,CAAC,CAAC;CAE5G","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @packageDocumentation\r\n * @module Bspline\r\n */\r\n\r\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\r\nimport { Geometry } from \"../Geometry\";\r\nimport { Point3dArray } from \"../geometry3d/PointHelpers\";\r\nimport { ProxyCurve } from \"../curve/ProxyCurve\";\r\nimport { CurvePrimitive } from \"../curve/CurvePrimitive\";\r\nimport { BSplineCurveOps } from \"../bspline/BSplineCurveOps\";\r\nimport { BSplineCurve3d } from \"./BSplineCurve\";\r\nimport { GeometryQuery } from \"../curve/GeometryQuery\";\r\nimport { Transform } from \"../geometry3d/Transform\";\r\nimport { GeometryHandler } from \"../geometry3d/GeometryHandler\";\r\nimport { XYZProps } from \"../geometry3d/XYZProps\";\r\n\r\n/**\r\n * fitPoints and end condition data for [[InterpolationCurve3d]]\r\n * * This is a \"json compatible\" version of [[InterpolationCurve3dOptions]]\r\n * @public\r\n */\r\nexport interface InterpolationCurve3dProps {\r\n  /** order of the computed bspline (one more than degree) */\r\n  order?: number;\r\n  /** true if the B-spline construction should be periodic */\r\n  closed?: boolean;\r\n  /** if closed and no knots, compute chord length knots (1) or uniform knots (0). Chord length knots give best fit. */\r\n  isChordLenKnots?: number;\r\n  /** if !closed but first and last fitPoints are equal, pivot computed start/end tangent(s) so that they are colinear (1) or leave them be (0). */\r\n  isColinearTangents?: number;\r\n  /** if !closed and start/endTangent is given, set its magnitude to the first/last fit point chord length (1) or to the magnitude of the Bessel tangent (0). Bessel gives best fit. */\r\n  isChordLenTangents?: number;\r\n  /** if !closed and start/endTangent is absent, compute it using the natural end condition (1) or Bessel (0). Bessel gives best fit. */\r\n  isNaturalTangents?: number;\r\n  /** optional start tangent, pointing into curve. Magnitude is ignored. */\r\n  startTangent?: XYZProps;\r\n  /** optional end tangent, pointing into curve. Magnitude is ignored. */\r\n  endTangent?: XYZProps;\r\n  /** points that the curve must pass through */\r\n  fitPoints: XYZProps[];\r\n  /** parameters for curve fitting, one per fit point */\r\n  knots?: number[];\r\n}\r\n\r\n/**\r\n * fitPoints and end condition data for [[InterpolationCurve3d]]\r\n * * This is a \"typed object\" version of the serializer-friendly [[InterpolationCurve3dProps]]\r\n * * Typical use cases rarely require all parameters, so the constructor does not itemize them as parameters.\r\n * @public\r\n */\r\nexport class InterpolationCurve3dOptions {\r\n  /**\r\n   * Constructor.\r\n   * @param fitPoints points to CAPTURE\r\n   * @param knots array to CAPTURE\r\n   */\r\n  public constructor(fitPoints?: Point3d[], knots?: number[]) {\r\n    this._fitPoints = fitPoints ? fitPoints : [];\r\n    this._knots = knots;\r\n  }\r\n\r\n  private _order?: number;\r\n  private _closed?: boolean;\r\n  private _isChordLenKnots?: number;\r\n  private _isColinearTangents?: number;\r\n  private _isChordLenTangents?: number;\r\n  private _isNaturalTangents?: number;\r\n  private _startTangent?: Vector3d;\r\n  private _endTangent?: Vector3d;\r\n  private _fitPoints: Point3d[];\r\n  private _knots?: number[];\r\n\r\n  /** `order` as property */\r\n  public get order(): number { return Geometry.resolveNumber(this._order, 4); }\r\n  public set order(val: number) { this._order = val; }\r\n  /** `closed` as property */\r\n  public get closed(): boolean { return Geometry.resolveValue(this._closed, false); }\r\n  public set closed(val: boolean) { this._closed = val; }\r\n  /** `isChordLenKnots` as property */\r\n  public get isChordLenKnots(): number { return Geometry.resolveNumber(this._isChordLenKnots, 0); }\r\n  public set isChordLenKnots(val: number) { this._isChordLenKnots = val; }\r\n  /** `isColinearTangents` as property */\r\n  public get isColinearTangents(): number { return Geometry.resolveNumber(this._isColinearTangents, 0); }\r\n  public set isColinearTangents(val: number) { this._isColinearTangents = val; }\r\n  /** `isChordLenTangents` as property */\r\n  public get isChordLenTangents(): number { return Geometry.resolveNumber(this._isChordLenTangents, 0); }\r\n  public set isChordLenTangents(val: number) { this._isChordLenTangents = val; }\r\n  /** `isNaturalTangents` as property */\r\n  public get isNaturalTangents(): number { return Geometry.resolveNumber(this._isNaturalTangents, 0); }\r\n  public set isNaturalTangents(val: number) { this._isNaturalTangents = val; }\r\n  /** access POSSIBLY UNDEFINED start tangent. Setter CAPTURES. */\r\n  public get startTangent(): Vector3d | undefined { return this._startTangent; }\r\n  public set startTangent(val: Vector3d | undefined) { this._startTangent = val; }\r\n  /** access POSSIBLY UNDEFINED end tangent. Setter CAPTURES. */\r\n  public get endTangent(): Vector3d | undefined { return this._endTangent; }\r\n  public set endTangent(val: Vector3d | undefined) { this._endTangent = val; }\r\n  /** access POINTER TO fit points. Setter CAPTURES. */\r\n  public get fitPoints(): Point3d[] { return this._fitPoints; }\r\n  public set fitPoints(val: Point3d[]) { this._fitPoints = val; }\r\n  /** access POSSIBLY UNDEFINED knots array. Setter CAPTURES. */\r\n  public get knots(): number[] | undefined { return this._knots; }\r\n  public set knots(val: number[] | undefined) { this._knots = val; }\r\n\r\n  /** One step setup of properties not named in constructor.\r\n   * * CAPTURE pointers to tangents.\r\n   * * OPTIONALLY downgrade \"0\" values to undefined.\r\n   */\r\n  public captureOptionalProps(\r\n    order: number | undefined,\r\n    closed: boolean | undefined,\r\n    isChordLenKnots: number | undefined,\r\n    isColinearTangents: number | undefined,\r\n    isChordLenTangent: number | undefined,\r\n    isNaturalTangents: number | undefined,\r\n    startTangent: Vector3d | undefined,\r\n    endTangent: Vector3d | undefined\r\n  ) {\r\n    this._order = Geometry.resolveToUndefined(order, 0);\r\n    this._closed = Geometry.resolveToUndefined(closed, false);\r\n    this._isChordLenKnots = Geometry.resolveToUndefined(isChordLenKnots, 0);\r\n    this._isColinearTangents = Geometry.resolveToUndefined(isColinearTangents, 0);\r\n    this._isChordLenTangents = Geometry.resolveToUndefined(isChordLenTangent, 0);\r\n    this._isNaturalTangents = Geometry.resolveToUndefined(isNaturalTangents, 0);\r\n    this._startTangent = startTangent;\r\n    this._endTangent = endTangent;\r\n\r\n  }\r\n  /** Clone with strongly typed members reduced to simple json, with \"undefined\" members omitted */\r\n  public cloneAsInterpolationCurve3dProps(): InterpolationCurve3dProps {\r\n    const props: InterpolationCurve3dProps = {\r\n      fitPoints: Point3dArray.cloneDeepJSONNumberArrays(this.fitPoints),\r\n      knots: this._knots?.slice(),\r\n    };\r\n    if (this._order !== undefined)\r\n      props.order = this._order;\r\n    if (this._closed !== undefined)\r\n      props.closed = this._closed;\r\n    if (this._isChordLenKnots !== undefined)\r\n      props.isChordLenKnots = this._isChordLenKnots;\r\n    if (this._isColinearTangents !== undefined)\r\n      props.isColinearTangents = this._isColinearTangents;\r\n    if (this._isChordLenTangents !== undefined)\r\n      props.isChordLenTangents = this._isChordLenTangents;\r\n    if (this._isNaturalTangents !== undefined)\r\n      props.isNaturalTangents = this._isNaturalTangents;\r\n    if (this._startTangent !== undefined)\r\n      props.startTangent = this._startTangent?.toArray();\r\n    if (this._endTangent !== undefined)\r\n      props.endTangent = this._endTangent?.toArray();\r\n    return props;\r\n  }\r\n  /** Clone with strongly typed members reduced to simple json. */\r\n  public clone(): InterpolationCurve3dOptions {\r\n    const clone = new InterpolationCurve3dOptions(Point3dArray.clonePoint3dArray(this.fitPoints), this.knots?.slice());\r\n    clone._order = this.order;\r\n    clone._closed = this.closed;\r\n    clone._isChordLenKnots = this.isChordLenKnots;\r\n    clone._isColinearTangents = this.isColinearTangents;\r\n    clone._isChordLenTangents = this.isChordLenTangents;\r\n    clone._isNaturalTangents = this.isNaturalTangents;\r\n    clone._startTangent = this._startTangent?.clone();\r\n    clone._endTangent = this._endTangent?.clone();\r\n    return clone;\r\n  }\r\n\r\n  /** Clone with strongly typed members reduced to simple json. */\r\n  public static create(source: InterpolationCurve3dProps): InterpolationCurve3dOptions {\r\n    const result = new InterpolationCurve3dOptions(Point3dArray.clonePoint3dArray(source.fitPoints), source.knots?.slice());\r\n    result._order = source.order;\r\n    result._closed = source.closed;\r\n    result._isChordLenKnots = source.isChordLenKnots;\r\n    result._isColinearTangents = source.isColinearTangents;\r\n    result._isChordLenTangents = source.isChordLenTangents;\r\n    result._isNaturalTangents = source.isNaturalTangents;\r\n    result._startTangent = source.startTangent ? Vector3d.fromJSON(source.startTangent) : undefined;\r\n    result._endTangent = source.endTangent ? Vector3d.fromJSON(source.endTangent) : undefined;\r\n    return result;\r\n  }\r\n  // ugh.\r\n  // vector equality test with awkward rule that 000 matches undefined.\r\n  private static areAlmostEqualAllow000AsUndefined(a: Vector3d | undefined, b: Vector3d | undefined): boolean {\r\n    if (a !== undefined && a.maxAbs() === 0)\r\n      a = undefined;\r\n    if (b !== undefined && b.maxAbs() === 0)\r\n      b = undefined;\r\n    if (a !== undefined && b !== undefined)\r\n      return a.isAlmostEqual(b);\r\n    return a === undefined && b === undefined;\r\n  }\r\n  public static areAlmostEqual(dataA: InterpolationCurve3dOptions | undefined, dataB: InterpolationCurve3dOptions | undefined): boolean {\r\n    if (dataA === undefined && dataB === undefined)\r\n      return true;\r\n    if (dataA !== undefined && dataB !== undefined) {\r\n      if (Geometry.areEqualAllowUndefined(dataA.order, dataB.order)\r\n        && Geometry.areEqualAllowUndefined(dataA.closed, dataB.closed)\r\n        && Geometry.areEqualAllowUndefined(dataA.isChordLenKnots, dataB.isChordLenKnots)\r\n        && Geometry.areEqualAllowUndefined(dataA.isColinearTangents, dataB.isColinearTangents)\r\n        && Geometry.areEqualAllowUndefined(dataA.isNaturalTangents, dataB.isNaturalTangents)\r\n        && this.areAlmostEqualAllow000AsUndefined(dataA.startTangent, dataB.startTangent)\r\n        && this.areAlmostEqualAllow000AsUndefined(dataA.endTangent, dataB.endTangent)\r\n        && Geometry.almostEqualArrays(dataA.fitPoints, dataB.fitPoints, (a: Point3d, b: Point3d) => a.isAlmostEqual(b))) {\r\n        if (Geometry.almostEqualNumberArrays(dataA.knots, dataB.knots, (a: number, b: number) => a === b))\r\n          return true;\r\n        if (dataA.knots === undefined && dataB.knots === undefined)\r\n          return true;\r\n        /* alas .. need to allow tricky mismatch of end replication */\r\n        const knotsA = BSplineCurveOps.C2CubicFit.convertCubicKnotVectorToFitParams(dataA.knots, dataA.fitPoints.length, false);\r\n        const knotsB = BSplineCurveOps.C2CubicFit.convertCubicKnotVectorToFitParams(dataB.knots, dataB.fitPoints.length, false);\r\n        return Geometry.almostEqualNumberArrays(knotsA, knotsB, (a: number, b: number) => Geometry.isAlmostEqualNumber(a, b));\r\n      }\r\n    }\r\n    return false;\r\n  }\r\n  /** reverse the order or sense of all start-to-end related properties. */\r\n  public reverseInPlace() {\r\n    this.fitPoints.reverse();\r\n    if (this.knots)\r\n      this.knots.reverse();\r\n    // Swap pointers to tangents.\r\n    // NEEDS WORK: Do the vector coordinates need to be negated?\r\n    const oldStart = this._startTangent;\r\n    this._startTangent = this.endTangent;\r\n    this._endTangent = oldStart;\r\n  }\r\n}\r\n\r\n/**\r\n * Interpolating curve.\r\n * * Derive from [[ProxyCurve]]\r\n * * Use a [[BSplineCurve3d]] as the proxy\r\n * *\r\n * @public\r\n */\r\nexport class InterpolationCurve3d extends ProxyCurve {\r\n  public readonly curvePrimitiveType = \"interpolationCurve\";\r\n  private _options: InterpolationCurve3dOptions;\r\n  /**\r\n   * CAPTURE properties and proxy curve.\r\n   */\r\n  private constructor(properties: InterpolationCurve3dOptions, proxyCurve: CurvePrimitive) {\r\n    super(proxyCurve);\r\n    this._options = properties;\r\n  }\r\n  public override dispatchToGeometryHandler(handler: GeometryHandler) {\r\n    return handler.handleInterpolationCurve3d(this);\r\n  }\r\n  /**\r\n   * Create an [[InterpolationCurve3d]] based on points, knots, and other properties in the [[InterpolationCurve3dProps]] or [[InterpolationCurve3dOptions]].\r\n   * * This saves a COPY OF the options or props.\r\n   * * Use createCapture () if the options or props can be used without copy\r\n   */\r\n  public static create(options: InterpolationCurve3dOptions | InterpolationCurve3dProps): InterpolationCurve3d | undefined {\r\n    let optionsCopy;\r\n    if (options instanceof InterpolationCurve3dOptions) {\r\n      optionsCopy = options.clone();\r\n    } else {\r\n      optionsCopy = InterpolationCurve3dOptions.create(options);\r\n    }\r\n    return InterpolationCurve3d.createCapture(optionsCopy);\r\n  }\r\n  /** Create an [[InterpolationCurve3d]]\r\n   * * The options object is captured into the new curve object (not copied)\r\n   */\r\n  public static createCapture(options: InterpolationCurve3dOptions): InterpolationCurve3d | undefined {\r\n    const proxyCurve = BSplineCurve3d.createFromInterpolationCurve3dOptions(options);\r\n    if (proxyCurve)\r\n      return new InterpolationCurve3d(options, proxyCurve);\r\n    return undefined;\r\n  }\r\n  /** Return a (copy of) the defining points, packed as a Float64Array */\r\n  public copyFitPointsFloat64Array(): Float64Array {\r\n    return Point3dArray.cloneXYZPropsAsFloat64Array(this._options.fitPoints);\r\n  }\r\n\r\n  /**\r\n   * Return json key-value pairs for for this [[InterpolationCurve3d]].\r\n   * @returns\r\n   */\r\n  public toJSON(): any {\r\n    return this._options.cloneAsInterpolationCurve3dProps();\r\n  }\r\n  /** Clone the [[InterpolationCurve3dProps]] object in this [[InterpolationCurve3d]] */\r\n  public cloneProps(): InterpolationCurve3dProps {\r\n    return this._options.cloneAsInterpolationCurve3dProps();\r\n  }\r\n\r\n  /** return the options pointer */\r\n  public get options(): InterpolationCurve3dOptions { return this._options; }\r\n\r\n  /**\r\n   * Reverse the curve direction.\r\n   * * This updates both the defining properties and the proxy bspline.\r\n   */\r\n  public reverseInPlace(): void {\r\n    this._proxyCurve.reverseInPlace();\r\n    this._options.reverseInPlace();\r\n  }\r\n  /**\r\n   * Transform this [[InterpolationCurve3d]] and its defining data in place\r\n   */\r\n  public tryTransformInPlace(transform: Transform): boolean {\r\n    const proxyOk = this._proxyCurve.tryTransformInPlace(transform);\r\n    if (proxyOk) {\r\n      transform.multiplyPoint3dArrayInPlace(this._options.fitPoints);\r\n      // START HERE: transform start/endTangent\r\n    }\r\n    return proxyOk;\r\n  }\r\n  /**\r\n   * Return a transformed clone.\r\n   */\r\n  public cloneTransformed(transform: Transform): GeometryQuery | undefined {\r\n    const myClone = this.clone();\r\n    if (myClone && myClone?.tryTransformInPlace(transform))\r\n      return myClone;\r\n    return undefined;\r\n  }\r\n  /**\r\n   * Return a clone.\r\n   */\r\n  public clone(): GeometryQuery | undefined {\r\n    const proxyClone = this._proxyCurve.clone();\r\n    if (proxyClone) {\r\n      return new InterpolationCurve3d(this._options.clone(), proxyClone as CurvePrimitive);\r\n    }\r\n    return undefined;\r\n  }\r\n  public override isAlmostEqual(other: GeometryQuery): boolean {\r\n    if (other instanceof InterpolationCurve3d) {\r\n      return InterpolationCurve3dOptions.areAlmostEqual(this._options, other._options);\r\n    }\r\n    return false;\r\n  }\r\n  /** Test if `other` is also an [[InterpolationCurve3d]] */\r\n  public isSameGeometryClass(other: GeometryQuery): boolean { return other instanceof InterpolationCurve3d; }\r\n\r\n}\r\n"]}

package/lib/esm/bspline/KnotVector.d.ts

@@ -0,0 +1,160 @@
+/** @packageDocumentation
+ * @module Bspline
+ */
+/**
+ * Enumeration of the possible ways of converting a "periodic" knot vector to an open knot vector.
+ * None (0) ==> no wrap possible
+ * OpenByAddingControlPoints (1)  ==> wrapped by adding poles
+ * OpenByRemovingKnots (2)  ==> wrapped by deleting extreme knots.
+ * @public
+ */
+export declare enum BSplineWrapMode {
+    /** No conversion to periodic */
+    None = 0,
+    /** Convert to periodic by removing control points.  This is typical for closed bcurve constructed by control points with maximum continuity.
+     * * Knots stay the same in open and periodic form.
+     * * Periodic form omits {degree} control points.
+     */
+    OpenByAddingControlPoints = 1,
+    /** Convert to periodic by adding special knots.  This is typical of closed bcurve constructed as exact circular or elliptic arc
+     * * 2 knots on each end are omitted in open form
+     * * poles stay the same.
+     */
+    OpenByRemovingKnots = 2
+}
+/**
+ * Array of non-decreasing numbers acting as a knot array for bsplines.
+ *
+ * * Essential identity: numKnots = numPoles + order = numPoles + degree - 1
+ * * Various bspline libraries have confusion over how many "end knots" are needed. "Many" libraries (including MicroStation)
+ *     incorrectly demand "order" knots at each end for clamping.   But only "order - 1" are really needed.
+ * * This class uses the "order-1" convention.
+ * * This class provides queries to convert among spanIndex and knotIndex
+ * * A span is a single interval of the knots.
+ * * The left knot of span {k} is knot {k+degree-1}
+ * * This class provides queries to convert among spanFraction, fraction of knot range, and knot
+ * * core computations (evaluateBasisFunctions) have leftKnotIndex and global knot value as inputs.  Caller's need to
+ * know their primary values (global knot, spanFraction).
+ * @public
+ */
+export declare class KnotVector {
+    /** The simple array of knot values. */
+    knots: Float64Array;
+    /** Return the degree of basis functions defined in these knots. */
+    degree: number;
+    private _knot0;
+    private _knot1;
+    private _wrapMode?;
+    /** tolerance for considering two knots to be the same. */
+    static readonly knotTolerance = 1e-9;
+    /** Return the leftmost knot value (of the active interval, ignoring unclamped leading knots)*/
+    get leftKnot(): number;
+    /** Return the rightmost knot value (of the active interval, ignoring unclamped leading knots)*/
+    get rightKnot(): number;
+    /** Return the index of the leftmost knot of the active interval */
+    get leftKnotIndex(): number;
+    /** Return the index of the rightmost knot of the active interval */
+    get rightKnotIndex(): number;
+    /** Whether the bspline was created by adding poles into "closed" structure. This is used by serialize/deserialize to mark knotVector's that were converted from periodic style. */
+    get wrappable(): BSplineWrapMode;
+    set wrappable(value: BSplineWrapMode);
+    /** Return the number of bezier spans.  Not that this includes zero-length spans if there are repeated knots. */
+    get numSpans(): number;
+    /**
+     *
+     * * If knots is a number array or Float64Array, the those values become the local knot array.
+     * * If knots is a simple number, the local knot array is allocated to that size but left as zeros.
+     * @param knots
+     * @param degree
+     */
+    private constructor();
+    /** copy degree and knots to a new KnotVector. */
+    clone(): KnotVector;
+    private setupFixedValues;
+    /** Return the total knot distance from beginning to end. */
+    get knotLength01(): number;
+    /**
+     * Returns true if all numeric values have wraparound conditions for "closed" knotVector with specified wrap mode
+     * @param mode optional test mode.  If undefined, use the this.wrappable.
+     */
+    testClosable(mode?: BSplineWrapMode): boolean;
+    /** Test matching degree and knot values */
+    isAlmostEqual(other: KnotVector): boolean;
+    /** install knot values from an array, optionally ignoring first and last.
+     */
+    setKnots(knots: number[] | Float64Array, skipFirstAndLast?: boolean): void;
+    /**
+     * Create knot vector with {degree-1} replicated knots at start and end, and uniform knots between.
+     * @param numPoles Number of poles
+     * @param degree degree of polynomial
+     * @param a0 left knot value for active interval
+     * @param a1 right knot value for active interval
+     */
+    static createUniformClamped(numPoles: number, degree: number, a0: number, a1: number): KnotVector;
+    /**
+     * Create knot vector with {degree-1} replicated knots at start and end, and uniform knots between.
+     * @param  numInterval number of intervals in knot space.  (NOT POLE COUNT)
+     * @param degree degree of polynomial
+     * @param a0 left knot value for active interval
+     * @param a1 right knot value for active interval
+     */
+    static createUniformWrapped(numInterval: number, degree: number, a0: number, a1: number): KnotVector;
+    /**
+     * Create knot vector with given knot values and degree.
+     * @param knotArray knot values
+     * @param degree degree of polynomial
+     * @param skipFirstAndLast true to skip class overclamped end knots.
+     */
+    static create(knotArray: number[] | Float64Array, degree: number, skipFirstAndLast?: boolean): KnotVector;
+    /**
+     * Return the average of degree consecutive knots beginning at spanIndex.
+     */
+    grevilleKnot(spanIndex: number): number;
+    /** Return an array sized for a set of the basis function values. */
+    createBasisArray(): Float64Array;
+    /** Convert localFraction within the interval following an indexed knot to a knot value. */
+    baseKnotFractionToKnot(knotIndex0: number, localFraction: number): number;
+    /** Convert localFraction within an indexed bezier span to a knot value. */
+    spanFractionToKnot(spanIndex: number, localFraction: number): number;
+    /** Convert localFraction within an indexed bezier span to fraction of active knot range. */
+    spanFractionToFraction(spanIndex: number, localFraction: number): number;
+    /** Return fraction of active knot range to knot value. */
+    fractionToKnot(fraction: number): number;
+    /**
+     * Evaluate basis functions f[] at knot value u.
+     *
+     * @param u knot value for evaluation
+     * @param f array of basis values.  ASSUMED PROPER LENGTH
+     */
+    evaluateBasisFunctions(knotIndex0: number, u: number, f: Float64Array): void;
+    /**
+     * Evaluate basis fucntions f[] at knot value u.
+     *
+     * @param u knot value for evaluation
+     * @param f array of basis values.  ASSUMED PROPER LENGTH
+     */
+    evaluateBasisFunctions1(knotIndex0: number, u: number, f: Float64Array, df: Float64Array, ddf?: Float64Array): void;
+    /** Return the (highest) index of the knot less than or equal to u */
+    knotToLeftKnotIndex(u: number): number;
+    /**
+     * Given a span index, return the index of the knot at its left.
+     * @param spanIndex index of span
+     */
+    spanIndexToLeftKnotIndex(spanIndex: number): number;
+    /** Return the knot interval length of indexed bezier span. */
+    spanIndexToSpanLength(spanIndex: number): number;
+    /**
+     * Given a span index, test if it is within range and has nonzero length.
+     * * note that a false return does not imply there are no more spans.  This may be a double knot (zero length span) followed by more real spans
+     * @param spanIndex index of span to test.
+     */
+    isIndexOfRealSpan(spanIndex: number): boolean;
+    /** Reflect all knots so `leftKnot` and `rightKnot` are maintained but interval lengths reverse. */
+    reflectKnots(): void;
+    /**
+     * return a simple array form of the knots.  optionally replicate the first and last
+     * in classic over-clamped manner
+     */
+    copyKnots(includeExtraEndKnot: boolean): number[];
+}
+//# sourceMappingURL=KnotVector.d.ts.map

package/lib/esm/bspline/KnotVector.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"KnotVector.d.ts","sourceRoot":"","sources":["../../../src/bspline/KnotVector.ts"],"names":[],"mappings":"AAIA;;GAEG;AAOH;;;;;;GAMG;AACH,oBAAY,eAAe;IACzB,gCAAgC;IAChC,IAAI,IAAI;IACR;;;OAGG;IACH,yBAAyB,IAAI;IAC7B;;;OAGG;IACH,mBAAmB,IAAI;CACxB;AACD;;;;;;;;;;;;;;GAcG;AACH,qBAAa,UAAU;IACrB,uCAAuC;IAChC,KAAK,EAAE,YAAY,CAAC;IAC3B,mEAAmE;IAC5D,MAAM,EAAE,MAAM,CAAC;IACtB,OAAO,CAAC,MAAM,CAAS;IACvB,OAAO,CAAC,MAAM,CAAS;IAEvB,OAAO,CAAC,SAAS,CAAC,CAAkB;IACpC,0DAA0D;IAC1D,gBAAuB,aAAa,QAAU;IAC9C,+FAA+F;IAC/F,IAAW,QAAQ,WAA0B;IAC7C,gGAAgG;IAChG,IAAW,SAAS,WAA0B;IAC9C,mEAAmE;IACnE,IAAW,aAAa,WAA8B;IACtD,oEAAoE;IACpE,IAAW,cAAc,WAA8C;IACvE,mLAAmL;IACnL,IAAW,SAAS,IACQ,eAAe,CAD4D;IACvG,IAAW,SAAS,CAAC,KAAK,EAAE,eAAe,EAA6B;IACxE,gHAAgH;IAChH,IAAW,QAAQ,WAAuD;IAC1E;;;;;;OAMG;IACH,OAAO;IAkBP,iDAAiD;IAC1C,KAAK,IAAI,UAAU;IAC1B,OAAO,CAAC,gBAAgB;IAKxB,4DAA4D;IAC5D,IAAW,YAAY,IAAI,MAAM,CAAsC;IACvE;;;OAGG;IACI,YAAY,CAAC,IAAI,CAAC,EAAE,eAAe,GAAG,OAAO;IAkCpD,2CAA2C;IACpC,aAAa,CAAC,KAAK,EAAE,UAAU,GAAG,OAAO;IAIhD;OACG;IACI,QAAQ,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,YAAY,EAAE,gBAAgB,CAAC,EAAE,OAAO;IAc1E;;;;;;OAMG;WACW,oBAAoB,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,UAAU;IAWxG;;;;;;OAMG;WACW,oBAAoB,CAAC,WAAW,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,GAAG,UAAU;IAU3G;;;;;OAKG;WACW,MAAM,CAAC,SAAS,EAAE,MAAM,EAAE,GAAG,YAAY,EAAE,MAAM,EAAE,MAAM,EAAE,gBAAgB,CAAC,EAAE,OAAO,GAAG,UAAU;IAOhH;;OAEG;IACI,YAAY,CAAC,SAAS,EAAE,MAAM,GAAG,MAAM;IAQ9C,oEAAoE;IAC7D,gBAAgB,IAAI,YAAY;IACvC,2FAA2F;IACpF,sBAAsB,CAAC,UAAU,EAAE,MAAM,EAAE,aAAa,EAAE,MAAM,GAAG,MAAM;IAIhF,2EAA2E;IACpE,kBAAkB,CAAC,SAAS,EAAE,MAAM,EAAE,aAAa,EAAE,MAAM,GAAG,MAAM;IAI3E,4FAA4F;IACrF,sBAAsB,CAAC,SAAS,EAAE,MAAM,EAAE,aAAa,EAAE,MAAM,GAAG,MAAM;IAI/E,0DAA0D;IACnD,cAAc,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM;IAG/C;;;;;OAKG;IACI,sBAAsB,CAAC,UAAU,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,YAAY;IA2B5E;;;;;OAKG;IACI,uBAAuB,CAAC,UAAU,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,YAAY,EAAE,EAAE,EAAE,YAAY,EAAE,GAAG,CAAC,EAAE,YAAY;IA0DnH,qEAAqE;IAC9D,mBAAmB,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;IAY7C;;;OAGG;IACI,wBAAwB,CAAC,SAAS,EAAE,MAAM,GAAG,MAAM;IAK1D,8DAA8D;IACvD,qBAAqB,CAAC,SAAS,EAAE,MAAM,GAAG,MAAM;IAIvD;;;;OAIG;IACI,iBAAiB,CAAC,SAAS,EAAE,MAAM,GAAG,OAAO;IAKpD,mGAAmG;IAC5F,YAAY;IAQnB;;;OAGG;IACI,SAAS,CAAC,mBAAmB,EAAE,OAAO,GAAG,MAAM,EAAE;CAyBzD"}