@itwin/core-geometry 3.2.0-dev.0 → 3.2.0-dev.5

package/lib/cjs/bspline/BezierCurveBase.js.map

@@ -1 +1 @@
-{"version":3,"file":"BezierCurveBase.js","sourceRoot":"","sources":["../../../src/bspline/BezierCurveBase.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,2CAA2C;AAC3C,4DAAyD;AAEzD,0DAAuD;AACvD,0CAAuC;AACvC,+CAA4C;AAG5C,8EAA8E;AAC9E,mEAAwD;AAIxD,qEAAiE;AACjE,6CAA0C;AAE1C,yFAAsF;AACtF,yFAA+E;AAE/E;;;;;;;;;GASG;AACH,MAAsB,eAAgB,SAAQ,+BAAc;IAe1D,YAAsB,SAAiB,EAAE,IAAkB;QACzD,KAAK,EAAE,CAAC;QAfV,wCAAwC;QACxB,uBAAkB,GAAG,aAAa,CAAC;QAejD,IAAI,CAAC,QAAQ,GAAG,IAAI,uBAAU,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;QAChD,IAAI,CAAC,WAAW,GAAG,yBAAO,CAAC,MAAM,EAAE,CAAC;QACpC,IAAI,CAAC,WAAW,GAAG,yBAAO,CAAC,MAAM,EAAE,CAAC;QACpC,IAAI,CAAC,UAAU,GAAG,IAAI,YAAY,CAAC,SAAS,CAAC,CAAC;QAC9C,IAAI,CAAC,UAAU,GAAG,IAAI,YAAY,CAAC,SAAS,CAAC,CAAC;IAEhD,CAAC;IACD,iCAAiC;IAC1B,cAAc,KAAW,IAAI,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC;IACjE,4FAA4F;IACrF,eAAe,CAAC,UAAsB,EAAE,SAAiB;QAC9D,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,eAAe,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;QACtE,IAAI,QAAQ,EAAE;YACZ,IAAI,CAAC,WAAW,CACd,UAAU,CAAC,sBAAsB,CAAC,SAAS,EAAE,GAAG,CAAC,EACjD,UAAU,CAAC,sBAAsB,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC,CAAC;SACtD;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD,6EAA6E;IAC7E,IAAW,MAAM;QACf,OAAO,IAAI,CAAC,QAAQ,CAAC,KAAK,GAAG,CAAC,CAAC;IACjC,CAAC;IACD,sDAAsD;IACtD,IAAW,KAAK,KAAa,OAAO,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC;IAC1D,0EAA0E;IAC1E,IAAW,QAAQ,KAAa,OAAO,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC;IAY7D,kIAAkI;IAC3H,WAAW,CAAC,CAAS,EAAE,CAAS,IAAI,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7E;;OAEG;IACI,wBAAwB,CAAC,QAAgB,IAAY,OAAO,IAAI,CAAC,QAAQ,CAAC,wBAAwB,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IAEtH,2GAA2G;IACpG,WAAW,CAAC,IAAkB,EAAE,OAAuB;QAC5D,MAAM,UAAU,GAAG,IAAI,CAAC,4BAA4B,CAAC,OAAO,CAAC,CAAC;QAC9D,MAAM,YAAY,GAAG,GAAG,GAAG,UAAU,CAAC;QACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,UAAU,EAAE,CAAC,EAAE,EAAE;YACpC,MAAM,QAAQ,GAAG,CAAC,GAAG,YAAY,CAAC;YAClC,IAAI,CAAC,eAAe,CAAC,QAAQ,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;YACjD,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;SAC1C;IACH,CAAC;IACD,4CAA4C;IACrC,kBAAkB,CAAC,OAAuB,EAAE,QAAwB;QACzE,MAAM,UAAU,GAAG,IAAI,CAAC,4BAA4B,CAAC,QAAQ,CAAC,CAAC;QAC/D,OAAO,CAAC,qCAAqC,CAAC,IAAI,EAAE,UAAU,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;IAC5E,CAAC;IACD,wFAAwF;IACjF,oBAAoB,KAAY,OAAO,IAAI,CAAC,QAAQ,CAAC,kBAAkB,EAAE,CAAC,CAAC,CAAC;IAEnF,+CAA+C;IACxC,SAAS,CAAC,KAAmC;QAClD,IAAI,KAAK,GAAwB,IAAI,CAAC,WAAW,CAAC;QAClD,KAAK,IAAI,CAAC,GAAG,CAAC,GAAI,CAAC,EAAE,EAAE;YACrB,KAAK,GAAG,IAAI,CAAC,cAAc,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;YACtC,IAAI,CAAC,KAAK;gBACR,OAAO,IAAI,CAAC;YACd,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,KAAK,CAAC;gBAC9B,MAAM,CAAI,mEAAmE;SAChF;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,gDAAgD;IACzC,aAAa;QAClB,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC;YAC3C,OAAO,GAAG,CAAC;QACb,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,IAAI,GAAG,GAAG,GAAG,CAAC;QACd,OAAO,IAAI,CAAC,cAAc,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,EAAE;YACjD,GAAG,IAAI,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YACnD,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;SAC5C;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IACD,qDAAqD;IACrC,UAAU;QACxB,MAAM,MAAM,GAAG,IAAI,CAAC,cAAc,CAAC,CAAC,CAAE,CAAC,CAAG,oEAAoE;QAC9G,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,kDAAkD;IAClC,QAAQ;QACtB,MAAM,MAAM,GAAG,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAE,CAAC,CAAI,8BAA8B;QACtF,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,oEAAoE;IAC7D,WAAW,KAAa,OAAO,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC;IAa7D;;;;;;;OAOG;IACO,6BAA6B,CAAC,kBAA0B,EAAE,MAAc,EAAE,MAAc;QAChG,IAAI,kBAAkB,GAAG,CAAC,EAAE;YAC1B,IAAI,IAAI,CAAC,WAAW,KAAK,SAAS,IAAI,IAAI,CAAC,WAAW,CAAC,KAAK,KAAK,kBAAkB,EAAE;gBACnF,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC;aACzB;;gBACC,IAAI,CAAC,WAAW,GAAG,IAAI,oCAAgB,CAAC,kBAAkB,CAAC,CAAC;SAC/D;QACD,IAAI,MAAM,GAAG,CAAC,EAAE;YACd,IAAI,IAAI,CAAC,WAAW,KAAK,SAAS,IAAI,IAAI,CAAC,WAAW,CAAC,MAAM,KAAK,MAAM;gBACtE,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;;gBAEzB,IAAI,CAAC,WAAW,GAAG,IAAI,YAAY,CAAC,MAAM,CAAC,CAAC;SAC/C;QACD,IAAI,MAAM,GAAG,CAAC,EAAE;YACd,IAAI,IAAI,CAAC,WAAW,KAAK,SAAS,IAAI,IAAI,CAAC,WAAW,CAAC,MAAM,KAAK,MAAM;gBACtE,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;;gBAEzB,IAAI,CAAC,WAAW,GAAG,IAAI,YAAY,CAAC,MAAM,CAAC,CAAC;SAC/C;IACH,CAAC;IACD;;;;;;OAMG;IACI,4BAA4B,CAAC,OAAuB;QAEzD,IAAI,CAAC,cAAc,CAAC,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;QACzC,IAAI,CAAC,cAAc,CAAC,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;QACzC,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,IAAI,IAAI,CAAC,WAAW,IAAI,IAAI,CAAC,WAAW,EAAE;YACxC,IAAI,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;YAClD,IAAI,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;YAClD,IAAI,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;YAClD,IAAI,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,oCAAoC;YACvD,IAAI,UAAU,GAAG,GAAG,CAAC;YACrB,IAAI,UAAU,GAAG,mBAAQ,CAAC,aAAa,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;YACvD,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YAClD,IAAI,SAAS,GAAG,UAAU,CAAC;YAC3B,IAAI,SAAS,GAAG,UAAU,CAAC;YAC3B,IAAI,UAAU,GAAG,GAAG,CAAC;YACrB,IAAI,WAAW,CAAC;YAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,cAAc,CAAC,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC,EAAE,EAAE;gBAC7D,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;gBAC9C,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;gBAC9C,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;gBAC9C,WAAW,GAAG,aAAK,CAAC,wBAAwB,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;gBAC3E,UAAU,IAAI,WAAW,CAAC;gBAC1B,UAAU,GAAG,mBAAQ,CAAC,QAAQ,CAAC,WAAW,EAAE,UAAU,CAAC,CAAC;gBACxD,UAAU,GAAG,mBAAQ,CAAC,aAAa,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;gBACnD,SAAS,IAAI,UAAU,CAAC;gBACxB,SAAS,GAAG,mBAAQ,CAAC,KAAK,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC;gBAClD,GAAG,GAAG,GAAG,CAAC;gBACV,GAAG,GAAG,GAAG,CAAC;gBACV,GAAG,GAAG,GAAG,CAAC;gBACV,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;aAC5C;YACD,MAAM,OAAO,GAAG,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,CAAI,oCAAoC;YAChF,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,GAAG,SAAS,CAAC,CAAC,CAAE,qBAAqB;YACtE,IAAI,QAAQ,GAAG,UAAU,GAAG,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAE,oCAAoC;YACpF,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;gBACjB,QAAQ,IAAI,CAAC,CAAC,CAAE,qCAAqC;YACvD,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,UAAU,CAAC,CAAC;YAClD,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,6HAA6H;YAC3J,UAAU,GAAG,6BAAa,CAAC,aAAa,CAAC,OAAO,EAC9C,6BAAa,CAAC,kBAAkB,CAAC,OAAO,EAAE,QAAQ,EAAE,OAAO,CAAC,EAAE,QAAQ,EAAE,GAAG,CAAC,CAAC;YAC/E,IAAI,OAAO,EAAE;gBACX,UAAU,GAAG,OAAO,CAAC,+BAA+B,CAAC,UAAU,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC;aACvF;SACF;QACD,OAAO,UAAU,CAAC;IACpB,CAAC;IAED;;;;;OAKG;IACa,iBAAiB,CAAC,uBAA+C;QAC/E,MAAM,OAAO,GAAG,oCAAa,CAAC,MAAM,CAAC,uBAAuB,CAAC,CAAC;QAC9D,MAAM,OAAO,GAAG,IAAI,2CAAoB,CAAC,IAAI,EAAE,OAAO,CAAC,kBAAkB,CAAC,CAAC;QAC3E,IAAI,CAAC,kBAAkB,CAAC,OAAO,EAAE,OAAO,CAAC,aAAa,CAAC,CAAC;QACxD,OAAO,OAAO,CAAC,WAAW,EAAE,CAAC;IAC/B,CAAC;CACF;AA/ND,0CA+NC","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\n// import { Point2d } from \"../Geometry2d\";\r\nimport { CurvePrimitive } from \"../curve/CurvePrimitive\";\r\nimport { LineString3d } from \"../curve/LineString3d\";\r\nimport { StrokeOptions } from \"../curve/StrokeOptions\";\r\nimport { Geometry } from \"../Geometry\";\r\nimport { Angle } from \"../geometry3d/Angle\";\r\nimport { IStrokeHandler } from \"../geometry3d/GeometryHandler\";\r\nimport { Plane3dByOriginAndUnitNormal } from \"../geometry3d/Plane3dByOriginAndUnitNormal\";\r\n/* eslint-disable @typescript-eslint/naming-convention, no-empty, no-console*/\r\nimport { Point3d } from \"../geometry3d/Point3dVector3d\";\r\nimport { Range3d } from \"../geometry3d/Range\";\r\nimport { Transform } from \"../geometry3d/Transform\";\r\nimport { Point4d } from \"../geometry4d/Point4d\";\r\nimport { UnivariateBezier } from \"../numerics/BezierPolynomials\";\r\nimport { Bezier1dNd } from \"./Bezier1dNd\";\r\nimport { KnotVector } from \"./KnotVector\";\r\nimport { CurveOffsetXYHandler } from \"../curve/internalContexts/CurveOffsetXYHandler\";\r\nimport { OffsetOptions } from \"../curve/internalContexts/PolygonOffsetContext\";\r\n\r\n/**\r\n * Base class for CurvePrimitive (necessarily 3D) with _polygon.\r\n * * This has a Bezier1dNd polygon as a member, and implements dimension-independent methods\r\n * * This exists to support\r\n *    * BezierCurve3d -- 3 coordinates x,y,z per block in the Bezier1dNd poles\r\n *    * BezierCurve3dH -- 4 coordinates x,y,z,w per block in the Bezier1dNd poles\r\n * * The implementations of \"pure 3d\" queries is based on calling `getPolePoint3d`.\r\n * * This has the subtle failure difference that `getPolePoint3d` call with a valid index on on a 3d curve always succeeds, but on 3dH curve fails when weight is zero.\r\n * @public\r\n */\r\nexport abstract class BezierCurveBase extends CurvePrimitive {\r\n  /** String name for schema properties */\r\n  public readonly curvePrimitiveType = \"bezierCurve\";\r\n\r\n  /** Control points */\r\n  protected _polygon: Bezier1dNd;\r\n  /** scratch data blocks accessible by concrete class.   Initialized to correct blockSize in constructor. */\r\n  protected _workData0: Float64Array;\r\n  /** scratch data blocks accessible by concrete class.   Initialized to correct blockSize in constructor. */\r\n  protected _workData1: Float64Array;\r\n  /** Scratch xyz point accessible by derived classes. */\r\n  protected _workPoint0: Point3d;\r\n  /** Scratch xyz point accessible by derived classes. */\r\n  protected _workPoint1: Point3d;\r\n\r\n  protected constructor(blockSize: number, data: Float64Array) {\r\n    super();\r\n    this._polygon = new Bezier1dNd(blockSize, data);\r\n    this._workPoint0 = Point3d.create();\r\n    this._workPoint1 = Point3d.create();\r\n    this._workData0 = new Float64Array(blockSize);\r\n    this._workData1 = new Float64Array(blockSize);\r\n\r\n  }\r\n  /** reverse the poles in place */\r\n  public reverseInPlace(): void { this._polygon.reverseInPlace(); }\r\n  /** saturate the pole in place, using knot intervals from `spanIndex` of the `knotVector` */\r\n  public saturateInPlace(knotVector: KnotVector, spanIndex: number): boolean {\r\n    const boolStat = this._polygon.saturateInPlace(knotVector, spanIndex);\r\n    if (boolStat) {\r\n      this.setInterval(\r\n        knotVector.spanFractionToFraction(spanIndex, 0.0),\r\n        knotVector.spanFractionToFraction(spanIndex, 1.0));\r\n    }\r\n    return boolStat;\r\n  }\r\n  /** (property accessor) Return the polynomial degree (one less than order) */\r\n  public get degree(): number {\r\n    return this._polygon.order - 1;\r\n  }\r\n  /** (property accessor) Return the polynomial order */\r\n  public get order(): number { return this._polygon.order; }\r\n  /** (property accessor) Return the number of poles (aka control points) */\r\n  public get numPoles(): number { return this._polygon.order; }\r\n  /** Get pole `i` as a Point3d.\r\n   * * For 3d curve, this is simple a pole access, and only fails (return `undefined`) for invalid index\r\n   * * For 4d curve, this deweights the homogeneous pole and can fail due to 0 weight.\r\n   */\r\n  public abstract getPolePoint3d(i: number, point?: Point3d): Point3d | undefined;\r\n\r\n  /** Get pole `i` as a Point4d.\r\n   * * For 3d curve, this accesses the simple pole and returns with weight 1.\r\n   * * For 4d curve, this accesses the (weighted) pole.\r\n   */\r\n  public abstract getPolePoint4d(i: number, point?: Point4d): Point4d | undefined;\r\n  /** Set mapping to parent curve (e.g. if this bezier is a span extracted from a bspline, this is the knot interval of the span) */\r\n  public setInterval(a: number, b: number) { this._polygon.setInterval(a, b); }\r\n  /** map `fraction` from this Bezier curves inherent 0..1 range to the (a,b) range of parent\r\n   * * ( The parent range should have been previously defined with `setInterval`)\r\n   */\r\n  public fractionToParentFraction(fraction: number): number { return this._polygon.fractionToParentFraction(fraction); }\r\n\r\n  /** append stroke points to a linestring, based on `strokeCount` and `fractionToPoint` from derived class*/\r\n  public emitStrokes(dest: LineString3d, options?: StrokeOptions): void {\r\n    const numPerSpan = this.computeStrokeCountForOptions(options);\r\n    const fractionStep = 1.0 / numPerSpan;\r\n    for (let i = 0; i <= numPerSpan; i++) {\r\n      const fraction = i * fractionStep;\r\n      this.fractionToPoint(fraction, this._workPoint0);\r\n      dest.appendStrokePoint(this._workPoint0);\r\n    }\r\n  }\r\n  /** announce intervals with stroke counts */\r\n  public emitStrokableParts(handler: IStrokeHandler, _options?: StrokeOptions): void {\r\n    const numPerSpan = this.computeStrokeCountForOptions(_options);\r\n    handler.announceIntervalForUniformStepStrokes(this, numPerSpan, 0.0, 1.0);\r\n  }\r\n  /** Return a simple array of arrays with the control points as `[[x,y,z],[x,y,z],..]` */\r\n  public copyPolesAsJsonArray(): any[] { return this._polygon.unpackToJsonArrays(); }\r\n\r\n  /** return true if all poles are on a plane. */\r\n  public isInPlane(plane: Plane3dByOriginAndUnitNormal): boolean {\r\n    let point: Point3d | undefined = this._workPoint0;\r\n    for (let i = 0; ; i++) {\r\n      point = this.getPolePoint3d(i, point);\r\n      if (!point)\r\n        return true;\r\n      if (!plane.isPointInPlane(point))\r\n        break;    // which gets to return false, which is otherwise unreachable . . .\r\n    }\r\n    return false;\r\n  }\r\n  /** Return the length of the control polygon. */\r\n  public polygonLength(): number {\r\n    if (!this.getPolePoint3d(0, this._workPoint0))\r\n      return 0.0;\r\n    let i = 0;\r\n    let sum = 0.0;\r\n    while (this.getPolePoint3d(++i, this._workPoint1)) {\r\n      sum += this._workPoint0.distance(this._workPoint1);\r\n      this._workPoint0.setFrom(this._workPoint1);\r\n    }\r\n    return sum;\r\n  }\r\n  /** Return the start point.  (first control point) */\r\n  public override startPoint(): Point3d {\r\n    const result = this.getPolePoint3d(0)!;   // ASSUME non-trivial pole set -- if null comes back, it bubbles out\r\n    return result;\r\n  }\r\n  /** Return the end point.  (last control point) */\r\n  public override endPoint(): Point3d {\r\n    const result = this.getPolePoint3d(this.order - 1)!;    // ASSUME non-trivial pole set\r\n    return result;\r\n  }\r\n  /** Return the control polygon length as a quick length estimate. */\r\n  public quickLength(): number { return this.polygonLength(); }\r\n  /** Concrete classes must implement extendRange . . .  */\r\n  public abstract override extendRange(rangeToExtend: Range3d, transform?: Transform): void;\r\n  /**\r\n   * 1D bezier coefficients for use in range computations.\r\n   * @internal\r\n   */\r\n  protected _workBezier?: UnivariateBezier; // available for bezier logic within a method\r\n  /** scratch array for use by derived classes, using allocateAndZeroBezierWorkData for sizing. */\r\n  protected _workCoffsA?: Float64Array;\r\n  /** scratch array for use by derived classes, using allocateAndZeroBezierWorkData for sizing. */\r\n  protected _workCoffsB?: Float64Array;\r\n\r\n  /**\r\n   * set up the _workBezier members with specific order.\r\n   * * Try to reuse existing members if their sizes match.\r\n   * * Ignore members corresponding to args that are 0 or negative.\r\n   * @param primaryBezierOrder order of expected bezier\r\n   * @param orderA length of _workCoffsA (simple array)\r\n   * @param orderB length of _workCoffsB (simple array)\r\n   */\r\n  protected allocateAndZeroBezierWorkData(primaryBezierOrder: number, orderA: number, orderB: number) {\r\n    if (primaryBezierOrder > 0) {\r\n      if (this._workBezier !== undefined && this._workBezier.order === primaryBezierOrder) {\r\n        this._workBezier.zero();\r\n      } else\r\n        this._workBezier = new UnivariateBezier(primaryBezierOrder);\r\n    }\r\n    if (orderA > 0) {\r\n      if (this._workCoffsA !== undefined && this._workCoffsA.length === orderA)\r\n        this._workCoffsA.fill(0);\r\n      else\r\n        this._workCoffsA = new Float64Array(orderA);\r\n    }\r\n    if (orderB > 0) {\r\n      if (this._workCoffsB !== undefined && this._workCoffsB.length === orderB)\r\n        this._workCoffsB.fill(0);\r\n      else\r\n        this._workCoffsB = new Float64Array(orderB);\r\n    }\r\n  }\r\n  /**\r\n   * Assess length and turn to determine a stroke count.\r\n   * * this method is used by both BSplineCurve3d and BSplineCurve3dH.\r\n   * * points are accessed via getPolePoint3d.\r\n   *   * Hence a zero-weight pole will be a problem\r\n   * @param options stroke options structure.\r\n   */\r\n  public computeStrokeCountForOptions(options?: StrokeOptions): number {\r\n\r\n    this.getPolePoint3d(0, this._workPoint0);\r\n    this.getPolePoint3d(1, this._workPoint1);\r\n    let numStrokes = 1;\r\n    if (this._workPoint0 && this._workPoint1) {\r\n      let dx0 = this._workPoint1.x - this._workPoint0.x;\r\n      let dy0 = this._workPoint1.y - this._workPoint0.y;\r\n      let dz0 = this._workPoint1.z - this._workPoint0.z;\r\n      let dx1, dy1, dz1; // first differences of leading edge\r\n      let sumRadians = 0.0;\r\n      let thisLength = Geometry.hypotenuseXYZ(dx0, dy0, dz0);\r\n      this._workPoint1.setFromPoint3d(this._workPoint0);\r\n      let sumLength = thisLength;\r\n      let maxLength = thisLength;\r\n      let maxRadians = 0.0;\r\n      let thisRadians;\r\n      for (let i = 2; this.getPolePoint3d(i, this._workPoint1); i++) {\r\n        dx1 = this._workPoint1.x - this._workPoint0.x;\r\n        dy1 = this._workPoint1.y - this._workPoint0.y;\r\n        dz1 = this._workPoint1.z - this._workPoint0.z;\r\n        thisRadians = Angle.radiansBetweenVectorsXYZ(dx0, dy0, dz0, dx1, dy1, dz1);\r\n        sumRadians += thisRadians;\r\n        maxRadians = Geometry.maxAbsXY(thisRadians, maxRadians);\r\n        thisLength = Geometry.hypotenuseXYZ(dx1, dy1, dz1);\r\n        sumLength += thisLength;\r\n        maxLength = Geometry.maxXY(maxLength, thisLength);\r\n        dx0 = dx1;\r\n        dy0 = dy1;\r\n        dz0 = dz1;\r\n        this._workPoint0.setFrom(this._workPoint1);\r\n      }\r\n      const length1 = maxLength * this.degree;    // This may be larger than sumLength\r\n      const length2 = Math.sqrt(length1 * sumLength);  // This is in between\r\n      let radians1 = maxRadians * (this.degree - 1);  // As if worst case keeps happening.\r\n      if (this.degree < 3)\r\n        radians1 *= 3;  // so quadratics aren't under-stroked\r\n      const radians2 = Math.sqrt(radians1 * sumRadians);\r\n      const minCount = this.degree; // NOTE: this means 1) a small, nontrivial, straight Bezier is over-stroked, and 2) options.minStrokesPerPrimitive is ignored\r\n      numStrokes = StrokeOptions.applyAngleTol(options,\r\n        StrokeOptions.applyMaxEdgeLength(options, minCount, length2), radians2, 0.1);\r\n      if (options) {\r\n        numStrokes = options.applyChordTolToLengthAndRadians(numStrokes, sumLength, radians1);\r\n      }\r\n    }\r\n    return numStrokes;\r\n  }\r\n\r\n  /**\r\n   * Construct an offset of the instance curve as viewed in the xy-plane (ignoring z).\r\n   * * No attempt is made to join the offsets of smaller constituent primitives. To construct a fully joined offset\r\n   *   for an aggregate instance (e.g., LineString3d, CurveChainWithDistanceIndex), use RegionOps.constructCurveXYOffset() instead.\r\n   * @param offsetDistanceOrOptions offset distance (positive to left of the instance curve), or options object\r\n   */\r\n  public override constructOffsetXY(offsetDistanceOrOptions: number | OffsetOptions): CurvePrimitive | CurvePrimitive[] | undefined {\r\n    const options = OffsetOptions.create(offsetDistanceOrOptions);\r\n    const handler = new CurveOffsetXYHandler(this, options.leftOffsetDistance);\r\n    this.emitStrokableParts(handler, options.strokeOptions);\r\n    return handler.claimResult();\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"BezierCurveBase.js","sourceRoot":"","sources":["../../../src/bspline/BezierCurveBase.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,2CAA2C;AAC3C,4DAAyD;AAEzD,0DAAuD;AACvD,0CAAuC;AACvC,+CAA4C;AAG5C,8EAA8E;AAC9E,mEAAwD;AAIxD,qEAAiE;AACjE,6CAA0C;AAE1C,yFAAsF;AACtF,yFAA+E;AAE/E;;;;;;;;;GASG;AACH,MAAsB,eAAgB,SAAQ,+BAAc;IAe1D,YAAsB,SAAiB,EAAE,IAAkB;QACzD,KAAK,EAAE,CAAC;QAfV,wCAAwC;QACxB,uBAAkB,GAAG,aAAa,CAAC;QAejD,IAAI,CAAC,QAAQ,GAAG,IAAI,uBAAU,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;QAChD,IAAI,CAAC,WAAW,GAAG,yBAAO,CAAC,MAAM,EAAE,CAAC;QACpC,IAAI,CAAC,WAAW,GAAG,yBAAO,CAAC,MAAM,EAAE,CAAC;QACpC,IAAI,CAAC,UAAU,GAAG,IAAI,YAAY,CAAC,SAAS,CAAC,CAAC;QAC9C,IAAI,CAAC,UAAU,GAAG,IAAI,YAAY,CAAC,SAAS,CAAC,CAAC;IAEhD,CAAC;IACD,iCAAiC;IAC1B,cAAc,KAAW,IAAI,CAAC,QAAQ,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC;IACjE,4FAA4F;IACrF,eAAe,CAAC,UAAsB,EAAE,SAAiB;QAC9D,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,eAAe,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC;QACtE,IAAI,QAAQ,EAAE;YACZ,IAAI,CAAC,WAAW,CACd,UAAU,CAAC,sBAAsB,CAAC,SAAS,EAAE,GAAG,CAAC,EACjD,UAAU,CAAC,sBAAsB,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC,CAAC;SACtD;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD,6EAA6E;IAC7E,IAAW,MAAM;QACf,OAAO,IAAI,CAAC,QAAQ,CAAC,KAAK,GAAG,CAAC,CAAC;IACjC,CAAC;IACD,sDAAsD;IACtD,IAAW,KAAK,KAAa,OAAO,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC;IAC1D,0EAA0E;IAC1E,IAAW,QAAQ,KAAa,OAAO,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC;IAY7D,kIAAkI;IAC3H,WAAW,CAAC,CAAS,EAAE,CAAS,IAAI,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7E;;OAEG;IACI,wBAAwB,CAAC,QAAgB,IAAY,OAAO,IAAI,CAAC,QAAQ,CAAC,wBAAwB,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;IAEtH,2GAA2G;IACpG,WAAW,CAAC,IAAkB,EAAE,OAAuB;QAC5D,MAAM,UAAU,GAAG,IAAI,CAAC,4BAA4B,CAAC,OAAO,CAAC,CAAC;QAC9D,MAAM,YAAY,GAAG,GAAG,GAAG,UAAU,CAAC;QACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,UAAU,EAAE,CAAC,EAAE,EAAE;YACpC,MAAM,QAAQ,GAAG,CAAC,GAAG,YAAY,CAAC;YAClC,IAAI,CAAC,eAAe,CAAC,QAAQ,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;YACjD,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;SAC1C;IACH,CAAC;IACD,4CAA4C;IACrC,kBAAkB,CAAC,OAAuB,EAAE,QAAwB;QACzE,MAAM,UAAU,GAAG,IAAI,CAAC,4BAA4B,CAAC,QAAQ,CAAC,CAAC;QAC/D,OAAO,CAAC,qCAAqC,CAAC,IAAI,EAAE,UAAU,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;IAC5E,CAAC;IACD,wFAAwF;IACjF,oBAAoB,KAAY,OAAO,IAAI,CAAC,QAAQ,CAAC,kBAAkB,EAAE,CAAC,CAAC,CAAC;IAEnF,+CAA+C;IACxC,SAAS,CAAC,KAAmC;QAClD,IAAI,KAAK,GAAwB,IAAI,CAAC,WAAW,CAAC;QAClD,KAAK,IAAI,CAAC,GAAG,CAAC,GAAI,CAAC,EAAE,EAAE;YACrB,KAAK,GAAG,IAAI,CAAC,cAAc,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;YACtC,IAAI,CAAC,KAAK;gBACR,OAAO,IAAI,CAAC;YACd,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,KAAK,CAAC;gBAC9B,MAAM,CAAI,mEAAmE;SAChF;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,gDAAgD;IACzC,aAAa;QAClB,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC;YAC3C,OAAO,GAAG,CAAC;QACb,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,IAAI,GAAG,GAAG,GAAG,CAAC;QACd,OAAO,IAAI,CAAC,cAAc,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,EAAE;YACjD,GAAG,IAAI,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YACnD,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;SAC5C;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IACD,qDAAqD;IACrC,UAAU;QACxB,MAAM,MAAM,GAAG,IAAI,CAAC,cAAc,CAAC,CAAC,CAAE,CAAC,CAAG,oEAAoE;QAC9G,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,kDAAkD;IAClC,QAAQ;QACtB,MAAM,MAAM,GAAG,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,CAAE,CAAC,CAAI,8BAA8B;QACtF,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,oEAAoE;IAC7D,WAAW,KAAa,OAAO,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC;IAa7D;;;;;;;OAOG;IACO,6BAA6B,CAAC,kBAA0B,EAAE,MAAc,EAAE,MAAc;QAChG,IAAI,kBAAkB,GAAG,CAAC,EAAE;YAC1B,IAAI,IAAI,CAAC,WAAW,KAAK,SAAS,IAAI,IAAI,CAAC,WAAW,CAAC,KAAK,KAAK,kBAAkB,EAAE;gBACnF,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC;aACzB;;gBACC,IAAI,CAAC,WAAW,GAAG,IAAI,oCAAgB,CAAC,kBAAkB,CAAC,CAAC;SAC/D;QACD,IAAI,MAAM,GAAG,CAAC,EAAE;YACd,IAAI,IAAI,CAAC,WAAW,KAAK,SAAS,IAAI,IAAI,CAAC,WAAW,CAAC,MAAM,KAAK,MAAM;gBACtE,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;;gBAEzB,IAAI,CAAC,WAAW,GAAG,IAAI,YAAY,CAAC,MAAM,CAAC,CAAC;SAC/C;QACD,IAAI,MAAM,GAAG,CAAC,EAAE;YACd,IAAI,IAAI,CAAC,WAAW,KAAK,SAAS,IAAI,IAAI,CAAC,WAAW,CAAC,MAAM,KAAK,MAAM;gBACtE,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;;gBAEzB,IAAI,CAAC,WAAW,GAAG,IAAI,YAAY,CAAC,MAAM,CAAC,CAAC;SAC/C;IACH,CAAC;IACD;;;;;;OAMG;IACI,4BAA4B,CAAC,OAAuB;QAEzD,IAAI,CAAC,cAAc,CAAC,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;QACzC,IAAI,CAAC,cAAc,CAAC,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;QACzC,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,IAAI,IAAI,CAAC,WAAW,IAAI,IAAI,CAAC,WAAW,EAAE;YACxC,IAAI,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;YAClD,IAAI,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;YAClD,IAAI,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;YAClD,IAAI,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,oCAAoC;YACvD,IAAI,UAAU,GAAG,GAAG,CAAC;YACrB,IAAI,UAAU,GAAG,mBAAQ,CAAC,aAAa,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;YACvD,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YAClD,IAAI,SAAS,GAAG,UAAU,CAAC;YAC3B,IAAI,SAAS,GAAG,UAAU,CAAC;YAC3B,IAAI,UAAU,GAAG,GAAG,CAAC;YACrB,IAAI,WAAW,CAAC;YAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,cAAc,CAAC,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,EAAE,CAAC,EAAE,EAAE;gBAC7D,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;gBAC9C,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;gBAC9C,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;gBAC9C,WAAW,GAAG,aAAK,CAAC,wBAAwB,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;gBAC3E,UAAU,IAAI,WAAW,CAAC;gBAC1B,UAAU,GAAG,mBAAQ,CAAC,QAAQ,CAAC,WAAW,EAAE,UAAU,CAAC,CAAC;gBACxD,UAAU,GAAG,mBAAQ,CAAC,aAAa,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;gBACnD,SAAS,IAAI,UAAU,CAAC;gBACxB,SAAS,GAAG,mBAAQ,CAAC,KAAK,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC;gBAClD,GAAG,GAAG,GAAG,CAAC;gBACV,GAAG,GAAG,GAAG,CAAC;gBACV,GAAG,GAAG,GAAG,CAAC;gBACV,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;aAC5C;YACD,MAAM,OAAO,GAAG,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,CAAI,oCAAoC;YAChF,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,GAAG,SAAS,CAAC,CAAC,CAAE,qBAAqB;YACtE,IAAI,QAAQ,GAAG,UAAU,GAAG,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAE,oCAAoC;YACpF,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC;gBACjB,QAAQ,IAAI,CAAC,CAAC,CAAE,qCAAqC;YACvD,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,UAAU,CAAC,CAAC;YAClD,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,6HAA6H;YAC3J,UAAU,GAAG,6BAAa,CAAC,aAAa,CAAC,OAAO,EAC9C,6BAAa,CAAC,kBAAkB,CAAC,OAAO,EAAE,QAAQ,EAAE,OAAO,CAAC,EAAE,QAAQ,EAAE,GAAG,CAAC,CAAC;YAC/E,IAAI,OAAO,EAAE;gBACX,UAAU,GAAG,OAAO,CAAC,+BAA+B,CAAC,UAAU,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC;aACvF;SACF;QACD,OAAO,UAAU,CAAC;IACpB,CAAC;IAKD,uCAAuC;IACvB,gBAAgB,CAAC,SAAoB;QACnD,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;QAC5B,MAAM,CAAC,mBAAmB,CAAC,SAAS,CAAC,CAAC;QACtC,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;OAKG;IACa,iBAAiB,CAAC,uBAA+C;QAC/E,MAAM,OAAO,GAAG,oCAAa,CAAC,MAAM,CAAC,uBAAuB,CAAC,CAAC;QAC9D,MAAM,OAAO,GAAG,IAAI,2CAAoB,CAAC,IAAI,EAAE,OAAO,CAAC,kBAAkB,CAAC,CAAC;QAC3E,IAAI,CAAC,kBAAkB,CAAC,OAAO,EAAE,OAAO,CAAC,aAAa,CAAC,CAAC;QACxD,OAAO,OAAO,CAAC,WAAW,EAAE,CAAC;IAC/B,CAAC;IAED;;;OAGG;IACc,iBAAiB,CAAC,SAAiB,EAAE,SAAiB;QACrE,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;QAClC,YAAY,CAAC,QAAQ,CAAC,0BAA0B,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;QACvE,OAAO,YAAY,CAAC;IACtB,CAAC;CACF;AAnPD,0CAmPC","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\n// import { Point2d } from \"../Geometry2d\";\r\nimport { CurvePrimitive } from \"../curve/CurvePrimitive\";\r\nimport { LineString3d } from \"../curve/LineString3d\";\r\nimport { StrokeOptions } from \"../curve/StrokeOptions\";\r\nimport { Geometry } from \"../Geometry\";\r\nimport { Angle } from \"../geometry3d/Angle\";\r\nimport { IStrokeHandler } from \"../geometry3d/GeometryHandler\";\r\nimport { Plane3dByOriginAndUnitNormal } from \"../geometry3d/Plane3dByOriginAndUnitNormal\";\r\n/* eslint-disable @typescript-eslint/naming-convention, no-empty, no-console*/\r\nimport { Point3d } from \"../geometry3d/Point3dVector3d\";\r\nimport { Range3d } from \"../geometry3d/Range\";\r\nimport { Transform } from \"../geometry3d/Transform\";\r\nimport { Point4d } from \"../geometry4d/Point4d\";\r\nimport { UnivariateBezier } from \"../numerics/BezierPolynomials\";\r\nimport { Bezier1dNd } from \"./Bezier1dNd\";\r\nimport { KnotVector } from \"./KnotVector\";\r\nimport { CurveOffsetXYHandler } from \"../curve/internalContexts/CurveOffsetXYHandler\";\r\nimport { OffsetOptions } from \"../curve/internalContexts/PolygonOffsetContext\";\r\n\r\n/**\r\n * Base class for CurvePrimitive (necessarily 3D) with _polygon.\r\n * * This has a Bezier1dNd polygon as a member, and implements dimension-independent methods\r\n * * This exists to support\r\n *    * BezierCurve3d -- 3 coordinates x,y,z per block in the Bezier1dNd poles\r\n *    * BezierCurve3dH -- 4 coordinates x,y,z,w per block in the Bezier1dNd poles\r\n * * The implementations of \"pure 3d\" queries is based on calling `getPolePoint3d`.\r\n * * This has the subtle failure difference that `getPolePoint3d` call with a valid index on on a 3d curve always succeeds, but on 3dH curve fails when weight is zero.\r\n * @public\r\n */\r\nexport abstract class BezierCurveBase extends CurvePrimitive {\r\n  /** String name for schema properties */\r\n  public readonly curvePrimitiveType = \"bezierCurve\";\r\n\r\n  /** Control points */\r\n  protected _polygon: Bezier1dNd;\r\n  /** scratch data blocks accessible by concrete class.   Initialized to correct blockSize in constructor. */\r\n  protected _workData0: Float64Array;\r\n  /** scratch data blocks accessible by concrete class.   Initialized to correct blockSize in constructor. */\r\n  protected _workData1: Float64Array;\r\n  /** Scratch xyz point accessible by derived classes. */\r\n  protected _workPoint0: Point3d;\r\n  /** Scratch xyz point accessible by derived classes. */\r\n  protected _workPoint1: Point3d;\r\n\r\n  protected constructor(blockSize: number, data: Float64Array) {\r\n    super();\r\n    this._polygon = new Bezier1dNd(blockSize, data);\r\n    this._workPoint0 = Point3d.create();\r\n    this._workPoint1 = Point3d.create();\r\n    this._workData0 = new Float64Array(blockSize);\r\n    this._workData1 = new Float64Array(blockSize);\r\n\r\n  }\r\n  /** reverse the poles in place */\r\n  public reverseInPlace(): void { this._polygon.reverseInPlace(); }\r\n  /** saturate the pole in place, using knot intervals from `spanIndex` of the `knotVector` */\r\n  public saturateInPlace(knotVector: KnotVector, spanIndex: number): boolean {\r\n    const boolStat = this._polygon.saturateInPlace(knotVector, spanIndex);\r\n    if (boolStat) {\r\n      this.setInterval(\r\n        knotVector.spanFractionToFraction(spanIndex, 0.0),\r\n        knotVector.spanFractionToFraction(spanIndex, 1.0));\r\n    }\r\n    return boolStat;\r\n  }\r\n  /** (property accessor) Return the polynomial degree (one less than order) */\r\n  public get degree(): number {\r\n    return this._polygon.order - 1;\r\n  }\r\n  /** (property accessor) Return the polynomial order */\r\n  public get order(): number { return this._polygon.order; }\r\n  /** (property accessor) Return the number of poles (aka control points) */\r\n  public get numPoles(): number { return this._polygon.order; }\r\n  /** Get pole `i` as a Point3d.\r\n   * * For 3d curve, this is simple a pole access, and only fails (return `undefined`) for invalid index\r\n   * * For 4d curve, this deweights the homogeneous pole and can fail due to 0 weight.\r\n   */\r\n  public abstract getPolePoint3d(i: number, point?: Point3d): Point3d | undefined;\r\n\r\n  /** Get pole `i` as a Point4d.\r\n   * * For 3d curve, this accesses the simple pole and returns with weight 1.\r\n   * * For 4d curve, this accesses the (weighted) pole.\r\n   */\r\n  public abstract getPolePoint4d(i: number, point?: Point4d): Point4d | undefined;\r\n  /** Set mapping to parent curve (e.g. if this bezier is a span extracted from a bspline, this is the knot interval of the span) */\r\n  public setInterval(a: number, b: number) { this._polygon.setInterval(a, b); }\r\n  /** map `fraction` from this Bezier curves inherent 0..1 range to the (a,b) range of parent\r\n   * * ( The parent range should have been previously defined with `setInterval`)\r\n   */\r\n  public fractionToParentFraction(fraction: number): number { return this._polygon.fractionToParentFraction(fraction); }\r\n\r\n  /** append stroke points to a linestring, based on `strokeCount` and `fractionToPoint` from derived class*/\r\n  public emitStrokes(dest: LineString3d, options?: StrokeOptions): void {\r\n    const numPerSpan = this.computeStrokeCountForOptions(options);\r\n    const fractionStep = 1.0 / numPerSpan;\r\n    for (let i = 0; i <= numPerSpan; i++) {\r\n      const fraction = i * fractionStep;\r\n      this.fractionToPoint(fraction, this._workPoint0);\r\n      dest.appendStrokePoint(this._workPoint0);\r\n    }\r\n  }\r\n  /** announce intervals with stroke counts */\r\n  public emitStrokableParts(handler: IStrokeHandler, _options?: StrokeOptions): void {\r\n    const numPerSpan = this.computeStrokeCountForOptions(_options);\r\n    handler.announceIntervalForUniformStepStrokes(this, numPerSpan, 0.0, 1.0);\r\n  }\r\n  /** Return a simple array of arrays with the control points as `[[x,y,z],[x,y,z],..]` */\r\n  public copyPolesAsJsonArray(): any[] { return this._polygon.unpackToJsonArrays(); }\r\n\r\n  /** return true if all poles are on a plane. */\r\n  public isInPlane(plane: Plane3dByOriginAndUnitNormal): boolean {\r\n    let point: Point3d | undefined = this._workPoint0;\r\n    for (let i = 0; ; i++) {\r\n      point = this.getPolePoint3d(i, point);\r\n      if (!point)\r\n        return true;\r\n      if (!plane.isPointInPlane(point))\r\n        break;    // which gets to return false, which is otherwise unreachable . . .\r\n    }\r\n    return false;\r\n  }\r\n  /** Return the length of the control polygon. */\r\n  public polygonLength(): number {\r\n    if (!this.getPolePoint3d(0, this._workPoint0))\r\n      return 0.0;\r\n    let i = 0;\r\n    let sum = 0.0;\r\n    while (this.getPolePoint3d(++i, this._workPoint1)) {\r\n      sum += this._workPoint0.distance(this._workPoint1);\r\n      this._workPoint0.setFrom(this._workPoint1);\r\n    }\r\n    return sum;\r\n  }\r\n  /** Return the start point.  (first control point) */\r\n  public override startPoint(): Point3d {\r\n    const result = this.getPolePoint3d(0)!;   // ASSUME non-trivial pole set -- if null comes back, it bubbles out\r\n    return result;\r\n  }\r\n  /** Return the end point.  (last control point) */\r\n  public override endPoint(): Point3d {\r\n    const result = this.getPolePoint3d(this.order - 1)!;    // ASSUME non-trivial pole set\r\n    return result;\r\n  }\r\n  /** Return the control polygon length as a quick length estimate. */\r\n  public quickLength(): number { return this.polygonLength(); }\r\n  /** Concrete classes must implement extendRange . . .  */\r\n  public abstract override extendRange(rangeToExtend: Range3d, transform?: Transform): void;\r\n  /**\r\n   * 1D bezier coefficients for use in range computations.\r\n   * @internal\r\n   */\r\n  protected _workBezier?: UnivariateBezier; // available for bezier logic within a method\r\n  /** scratch array for use by derived classes, using allocateAndZeroBezierWorkData for sizing. */\r\n  protected _workCoffsA?: Float64Array;\r\n  /** scratch array for use by derived classes, using allocateAndZeroBezierWorkData for sizing. */\r\n  protected _workCoffsB?: Float64Array;\r\n\r\n  /**\r\n   * set up the _workBezier members with specific order.\r\n   * * Try to reuse existing members if their sizes match.\r\n   * * Ignore members corresponding to args that are 0 or negative.\r\n   * @param primaryBezierOrder order of expected bezier\r\n   * @param orderA length of _workCoffsA (simple array)\r\n   * @param orderB length of _workCoffsB (simple array)\r\n   */\r\n  protected allocateAndZeroBezierWorkData(primaryBezierOrder: number, orderA: number, orderB: number) {\r\n    if (primaryBezierOrder > 0) {\r\n      if (this._workBezier !== undefined && this._workBezier.order === primaryBezierOrder) {\r\n        this._workBezier.zero();\r\n      } else\r\n        this._workBezier = new UnivariateBezier(primaryBezierOrder);\r\n    }\r\n    if (orderA > 0) {\r\n      if (this._workCoffsA !== undefined && this._workCoffsA.length === orderA)\r\n        this._workCoffsA.fill(0);\r\n      else\r\n        this._workCoffsA = new Float64Array(orderA);\r\n    }\r\n    if (orderB > 0) {\r\n      if (this._workCoffsB !== undefined && this._workCoffsB.length === orderB)\r\n        this._workCoffsB.fill(0);\r\n      else\r\n        this._workCoffsB = new Float64Array(orderB);\r\n    }\r\n  }\r\n  /**\r\n   * Assess length and turn to determine a stroke count.\r\n   * * this method is used by both BSplineCurve3d and BSplineCurve3dH.\r\n   * * points are accessed via getPolePoint3d.\r\n   *   * Hence a zero-weight pole will be a problem\r\n   * @param options stroke options structure.\r\n   */\r\n  public computeStrokeCountForOptions(options?: StrokeOptions): number {\r\n\r\n    this.getPolePoint3d(0, this._workPoint0);\r\n    this.getPolePoint3d(1, this._workPoint1);\r\n    let numStrokes = 1;\r\n    if (this._workPoint0 && this._workPoint1) {\r\n      let dx0 = this._workPoint1.x - this._workPoint0.x;\r\n      let dy0 = this._workPoint1.y - this._workPoint0.y;\r\n      let dz0 = this._workPoint1.z - this._workPoint0.z;\r\n      let dx1, dy1, dz1; // first differences of leading edge\r\n      let sumRadians = 0.0;\r\n      let thisLength = Geometry.hypotenuseXYZ(dx0, dy0, dz0);\r\n      this._workPoint1.setFromPoint3d(this._workPoint0);\r\n      let sumLength = thisLength;\r\n      let maxLength = thisLength;\r\n      let maxRadians = 0.0;\r\n      let thisRadians;\r\n      for (let i = 2; this.getPolePoint3d(i, this._workPoint1); i++) {\r\n        dx1 = this._workPoint1.x - this._workPoint0.x;\r\n        dy1 = this._workPoint1.y - this._workPoint0.y;\r\n        dz1 = this._workPoint1.z - this._workPoint0.z;\r\n        thisRadians = Angle.radiansBetweenVectorsXYZ(dx0, dy0, dz0, dx1, dy1, dz1);\r\n        sumRadians += thisRadians;\r\n        maxRadians = Geometry.maxAbsXY(thisRadians, maxRadians);\r\n        thisLength = Geometry.hypotenuseXYZ(dx1, dy1, dz1);\r\n        sumLength += thisLength;\r\n        maxLength = Geometry.maxXY(maxLength, thisLength);\r\n        dx0 = dx1;\r\n        dy0 = dy1;\r\n        dz0 = dz1;\r\n        this._workPoint0.setFrom(this._workPoint1);\r\n      }\r\n      const length1 = maxLength * this.degree;    // This may be larger than sumLength\r\n      const length2 = Math.sqrt(length1 * sumLength);  // This is in between\r\n      let radians1 = maxRadians * (this.degree - 1);  // As if worst case keeps happening.\r\n      if (this.degree < 3)\r\n        radians1 *= 3;  // so quadratics aren't under-stroked\r\n      const radians2 = Math.sqrt(radians1 * sumRadians);\r\n      const minCount = this.degree; // NOTE: this means 1) a small, nontrivial, straight Bezier is over-stroked, and 2) options.minStrokesPerPrimitive is ignored\r\n      numStrokes = StrokeOptions.applyAngleTol(options,\r\n        StrokeOptions.applyMaxEdgeLength(options, minCount, length2), radians2, 0.1);\r\n      if (options) {\r\n        numStrokes = options.applyChordTolToLengthAndRadians(numStrokes, sumLength, radians1);\r\n      }\r\n    }\r\n    return numStrokes;\r\n  }\r\n\r\n  /** Return a deep clone. */\r\n  public abstract override clone(): BezierCurveBase;\r\n\r\n  /** Return a transformed deep clone. */\r\n  public override cloneTransformed(transform: Transform): BezierCurveBase {\r\n    const curve1 = this.clone();\r\n    curve1.tryTransformInPlace(transform);\r\n    return curve1;\r\n  }\r\n\r\n  /**\r\n   * Construct an offset of the instance curve as viewed in the xy-plane (ignoring z).\r\n   * * No attempt is made to join the offsets of smaller constituent primitives. To construct a fully joined offset\r\n   *   for an aggregate instance (e.g., LineString3d, CurveChainWithDistanceIndex), use RegionOps.constructCurveXYOffset() instead.\r\n   * @param offsetDistanceOrOptions offset distance (positive to left of the instance curve), or options object\r\n   */\r\n  public override constructOffsetXY(offsetDistanceOrOptions: number | OffsetOptions): CurvePrimitive | CurvePrimitive[] | undefined {\r\n    const options = OffsetOptions.create(offsetDistanceOrOptions);\r\n    const handler = new CurveOffsetXYHandler(this, options.leftOffsetDistance);\r\n    this.emitStrokableParts(handler, options.strokeOptions);\r\n    return handler.claimResult();\r\n  }\r\n\r\n  /** Return a curve primitive which is a portion of this curve.\r\n   * @param fractionA [in] start fraction\r\n   * @param fractionB [in] end fraction\r\n   */\r\n   public override clonePartialCurve(fractionA: number, fractionB: number): BezierCurveBase {\r\n    const partialCurve = this.clone();\r\n    partialCurve._polygon.subdivideToIntervalInPlace(fractionA, fractionB);\r\n    return partialCurve;\r\n  }\r\n}\r\n"]}

package/lib/cjs/bspline/InterpolationCurve3d.d.ts

@@ -148,14 +148,8 @@ export declare class InterpolationCurve3d extends ProxyCurve {
      * Transform this [[InterpolationCurve3d]] and its defining data in place
      */
     tryTransformInPlace(transform: Transform): boolean;
-    /**
-     * Return a transformed clone.
-     */
-    cloneTransformed(transform: Transform): GeometryQuery | undefined;
-    /**
-     * Return a clone.
-     */
-    clone(): GeometryQuery | undefined;
+    /** Return a deep clone */
+    clone(): InterpolationCurve3d;
     isAlmostEqual(other: GeometryQuery): boolean;
     /** Test if `other` is also an [[InterpolationCurve3d]] */
     isSameGeometryClass(other: GeometryQuery): boolean;

package/lib/cjs/bspline/InterpolationCurve3d.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"InterpolationCurve3d.d.ts","sourceRoot":"","sources":["../../../src/bspline/InterpolationCurve3d.ts"],"names":[],"mappings":"AAIA;;GAEG;AAEH,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAGlE,OAAO,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAC;AAIjD,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AACvD,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACpD,OAAO,EAAE,eAAe,EAAE,MAAM,+BAA+B,CAAC;AAChE,OAAO,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AAElD;;;;GAIG;AACH,MAAM,WAAW,yBAAyB;IACxC,2DAA2D;IAC3D,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,2DAA2D;IAC3D,MAAM,CAAC,EAAE,OAAO,CAAC;IACjB,qHAAqH;IACrH,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB,iJAAiJ;IACjJ,kBAAkB,CAAC,EAAE,MAAM,CAAC;IAC5B,qLAAqL;IACrL,kBAAkB,CAAC,EAAE,MAAM,CAAC;IAC5B,sIAAsI;IACtI,iBAAiB,CAAC,EAAE,MAAM,CAAC;IAC3B,yEAAyE;IACzE,YAAY,CAAC,EAAE,QAAQ,CAAC;IACxB,uEAAuE;IACvE,UAAU,CAAC,EAAE,QAAQ,CAAC;IACtB,8CAA8C;IAC9C,SAAS,EAAE,QAAQ,EAAE,CAAC;IACtB,sDAAsD;IACtD,KAAK,CAAC,EAAE,MAAM,EAAE,CAAC;CAClB;AAED;;;;;GAKG;AACH,qBAAa,2BAA2B;IACtC;;;;OAIG;gBACgB,SAAS,CAAC,EAAE,OAAO,EAAE,EAAE,KAAK,CAAC,EAAE,MAAM,EAAE;IAK1D,OAAO,CAAC,MAAM,CAAC,CAAS;IACxB,OAAO,CAAC,OAAO,CAAC,CAAU;IAC1B,OAAO,CAAC,gBAAgB,CAAC,CAAS;IAClC,OAAO,CAAC,mBAAmB,CAAC,CAAS;IACrC,OAAO,CAAC,mBAAmB,CAAC,CAAS;IACrC,OAAO,CAAC,kBAAkB,CAAC,CAAS;IACpC,OAAO,CAAC,aAAa,CAAC,CAAW;IACjC,OAAO,CAAC,WAAW,CAAC,CAAW;IAC/B,OAAO,CAAC,UAAU,CAAY;IAC9B,OAAO,CAAC,MAAM,CAAC,CAAW;IAE1B,0BAA0B;IAC1B,IAAW,KAAK,IAAI,MAAM,CAAmD;IAC7E,IAAW,KAAK,CAAC,GAAG,EAAE,MAAM,EAAwB;IACpD,2BAA2B;IAC3B,IAAW,MAAM,IAAI,OAAO,CAAuD;IACnF,IAAW,MAAM,CAAC,GAAG,EAAE,OAAO,EAAyB;IACvD,oCAAoC;IACpC,IAAW,eAAe,IAAI,MAAM,CAA6D;IACjG,IAAW,eAAe,CAAC,GAAG,EAAE,MAAM,EAAkC;IACxE,uCAAuC;IACvC,IAAW,kBAAkB,IAAI,MAAM,CAAgE;IACvG,IAAW,kBAAkB,CAAC,GAAG,EAAE,MAAM,EAAqC;IAC9E,uCAAuC;IACvC,IAAW,kBAAkB,IAAI,MAAM,CAAgE;IACvG,IAAW,kBAAkB,CAAC,GAAG,EAAE,MAAM,EAAqC;IAC9E,sCAAsC;IACtC,IAAW,iBAAiB,IAAI,MAAM,CAA+D;IACrG,IAAW,iBAAiB,CAAC,GAAG,EAAE,MAAM,EAAoC;IAC5E,gEAAgE;IAChE,IAAW,YAAY,IAAI,QAAQ,GAAG,SAAS,CAA+B;IAC9E,IAAW,YAAY,CAAC,GAAG,EAAE,QAAQ,GAAG,SAAS,EAA+B;IAChF,8DAA8D;IAC9D,IAAW,UAAU,IAAI,QAAQ,GAAG,SAAS,CAA6B;IAC1E,IAAW,UAAU,CAAC,GAAG,EAAE,QAAQ,GAAG,SAAS,EAA6B;IAC5E,qDAAqD;IACrD,IAAW,SAAS,IAAI,OAAO,EAAE,CAA4B;IAC7D,IAAW,SAAS,CAAC,GAAG,EAAE,OAAO,EAAE,EAA4B;IAC/D,8DAA8D;IAC9D,IAAW,KAAK,IAAI,MAAM,EAAE,GAAG,SAAS,CAAwB;IAChE,IAAW,KAAK,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,SAAS,EAAwB;IAElE;;;OAGG;IACI,oBAAoB,CACzB,KAAK,EAAE,MAAM,GAAG,SAAS,EACzB,MAAM,EAAE,OAAO,GAAG,SAAS,EAC3B,eAAe,EAAE,MAAM,GAAG,SAAS,EACnC,kBAAkB,EAAE,MAAM,GAAG,SAAS,EACtC,iBAAiB,EAAE,MAAM,GAAG,SAAS,EACrC,iBAAiB,EAAE,MAAM,GAAG,SAAS,EACrC,YAAY,EAAE,QAAQ,GAAG,SAAS,EAClC,UAAU,EAAE,QAAQ,GAAG,SAAS;IAYlC,iGAAiG;IAC1F,gCAAgC,IAAI,yBAAyB;IAuBpE,gEAAgE;IACzD,KAAK,IAAI,2BAA2B;IAa3C,gEAAgE;WAClD,MAAM,CAAC,MAAM,EAAE,yBAAyB,GAAG,2BAA2B;IAcpF,OAAO,CAAC,MAAM,CAAC,iCAAiC;WASlC,cAAc,CAAC,KAAK,EAAE,2BAA2B,GAAG,SAAS,EAAE,KAAK,EAAE,2BAA2B,GAAG,SAAS,GAAG,OAAO;IA6BrI,yEAAyE;IAClE,cAAc;CAStB;AAED;;;;;;GAMG;AACH,qBAAa,oBAAqB,SAAQ,UAAU;IAClD,SAAgB,kBAAkB,wBAAwB;IAC1D,OAAO,CAAC,QAAQ,CAA8B;IAC9C;;OAEG;IACH,OAAO;IAIS,yBAAyB,CAAC,OAAO,EAAE,eAAe;IAGlE;;;;OAIG;WACW,MAAM,CAAC,OAAO,EAAE,2BAA2B,GAAG,yBAAyB,GAAG,oBAAoB,GAAG,SAAS;IASxH;;OAEG;WACW,aAAa,CAAC,OAAO,EAAE,2BAA2B,GAAG,oBAAoB,GAAG,SAAS;IAMnG,uEAAuE;IAChE,yBAAyB,IAAI,YAAY;IAIhD;;;OAGG;IACI,MAAM,IAAI,GAAG;IAGpB,sFAAsF;IAC/E,UAAU,IAAI,yBAAyB;IAI9C,iCAAiC;IACjC,IAAW,OAAO,IAAI,2BAA2B,CAA0B;IAE3E;;;OAGG;IACI,cAAc,IAAI,IAAI;IAI7B;;OAEG;IACI,mBAAmB,CAAC,SAAS,EAAE,SAAS,GAAG,OAAO;IAWzD;;OAEG;IACI,gBAAgB,CAAC,SAAS,EAAE,SAAS,GAAG,aAAa,GAAG,SAAS;IAMxE;;OAEG;IACI,KAAK,IAAI,aAAa,GAAG,SAAS;IAOzB,aAAa,CAAC,KAAK,EAAE,aAAa,GAAG,OAAO;IAM5D,0DAA0D;IACnD,mBAAmB,CAAC,KAAK,EAAE,aAAa,GAAG,OAAO;CAE1D"}
+{"version":3,"file":"InterpolationCurve3d.d.ts","sourceRoot":"","sources":["../../../src/bspline/InterpolationCurve3d.ts"],"names":[],"mappings":"AAIA;;GAEG;AAEH,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAGlE,OAAO,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAC;AAIjD,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AACvD,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACpD,OAAO,EAAE,eAAe,EAAE,MAAM,+BAA+B,CAAC;AAChE,OAAO,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AAElD;;;;GAIG;AACH,MAAM,WAAW,yBAAyB;IACxC,2DAA2D;IAC3D,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,2DAA2D;IAC3D,MAAM,CAAC,EAAE,OAAO,CAAC;IACjB,qHAAqH;IACrH,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB,iJAAiJ;IACjJ,kBAAkB,CAAC,EAAE,MAAM,CAAC;IAC5B,qLAAqL;IACrL,kBAAkB,CAAC,EAAE,MAAM,CAAC;IAC5B,sIAAsI;IACtI,iBAAiB,CAAC,EAAE,MAAM,CAAC;IAC3B,yEAAyE;IACzE,YAAY,CAAC,EAAE,QAAQ,CAAC;IACxB,uEAAuE;IACvE,UAAU,CAAC,EAAE,QAAQ,CAAC;IACtB,8CAA8C;IAC9C,SAAS,EAAE,QAAQ,EAAE,CAAC;IACtB,sDAAsD;IACtD,KAAK,CAAC,EAAE,MAAM,EAAE,CAAC;CAClB;AAED;;;;;GAKG;AACH,qBAAa,2BAA2B;IACtC;;;;OAIG;gBACgB,SAAS,CAAC,EAAE,OAAO,EAAE,EAAE,KAAK,CAAC,EAAE,MAAM,EAAE;IAK1D,OAAO,CAAC,MAAM,CAAC,CAAS;IACxB,OAAO,CAAC,OAAO,CAAC,CAAU;IAC1B,OAAO,CAAC,gBAAgB,CAAC,CAAS;IAClC,OAAO,CAAC,mBAAmB,CAAC,CAAS;IACrC,OAAO,CAAC,mBAAmB,CAAC,CAAS;IACrC,OAAO,CAAC,kBAAkB,CAAC,CAAS;IACpC,OAAO,CAAC,aAAa,CAAC,CAAW;IACjC,OAAO,CAAC,WAAW,CAAC,CAAW;IAC/B,OAAO,CAAC,UAAU,CAAY;IAC9B,OAAO,CAAC,MAAM,CAAC,CAAW;IAE1B,0BAA0B;IAC1B,IAAW,KAAK,IAAI,MAAM,CAAmD;IAC7E,IAAW,KAAK,CAAC,GAAG,EAAE,MAAM,EAAwB;IACpD,2BAA2B;IAC3B,IAAW,MAAM,IAAI,OAAO,CAAuD;IACnF,IAAW,MAAM,CAAC,GAAG,EAAE,OAAO,EAAyB;IACvD,oCAAoC;IACpC,IAAW,eAAe,IAAI,MAAM,CAA6D;IACjG,IAAW,eAAe,CAAC,GAAG,EAAE,MAAM,EAAkC;IACxE,uCAAuC;IACvC,IAAW,kBAAkB,IAAI,MAAM,CAAgE;IACvG,IAAW,kBAAkB,CAAC,GAAG,EAAE,MAAM,EAAqC;IAC9E,uCAAuC;IACvC,IAAW,kBAAkB,IAAI,MAAM,CAAgE;IACvG,IAAW,kBAAkB,CAAC,GAAG,EAAE,MAAM,EAAqC;IAC9E,sCAAsC;IACtC,IAAW,iBAAiB,IAAI,MAAM,CAA+D;IACrG,IAAW,iBAAiB,CAAC,GAAG,EAAE,MAAM,EAAoC;IAC5E,gEAAgE;IAChE,IAAW,YAAY,IAAI,QAAQ,GAAG,SAAS,CAA+B;IAC9E,IAAW,YAAY,CAAC,GAAG,EAAE,QAAQ,GAAG,SAAS,EAA+B;IAChF,8DAA8D;IAC9D,IAAW,UAAU,IAAI,QAAQ,GAAG,SAAS,CAA6B;IAC1E,IAAW,UAAU,CAAC,GAAG,EAAE,QAAQ,GAAG,SAAS,EAA6B;IAC5E,qDAAqD;IACrD,IAAW,SAAS,IAAI,OAAO,EAAE,CAA4B;IAC7D,IAAW,SAAS,CAAC,GAAG,EAAE,OAAO,EAAE,EAA4B;IAC/D,8DAA8D;IAC9D,IAAW,KAAK,IAAI,MAAM,EAAE,GAAG,SAAS,CAAwB;IAChE,IAAW,KAAK,CAAC,GAAG,EAAE,MAAM,EAAE,GAAG,SAAS,EAAwB;IAElE;;;OAGG;IACI,oBAAoB,CACzB,KAAK,EAAE,MAAM,GAAG,SAAS,EACzB,MAAM,EAAE,OAAO,GAAG,SAAS,EAC3B,eAAe,EAAE,MAAM,GAAG,SAAS,EACnC,kBAAkB,EAAE,MAAM,GAAG,SAAS,EACtC,iBAAiB,EAAE,MAAM,GAAG,SAAS,EACrC,iBAAiB,EAAE,MAAM,GAAG,SAAS,EACrC,YAAY,EAAE,QAAQ,GAAG,SAAS,EAClC,UAAU,EAAE,QAAQ,GAAG,SAAS;IAYlC,iGAAiG;IAC1F,gCAAgC,IAAI,yBAAyB;IAuBpE,gEAAgE;IACzD,KAAK,IAAI,2BAA2B;IAa3C,gEAAgE;WAClD,MAAM,CAAC,MAAM,EAAE,yBAAyB,GAAG,2BAA2B;IAcpF,OAAO,CAAC,MAAM,CAAC,iCAAiC;WASlC,cAAc,CAAC,KAAK,EAAE,2BAA2B,GAAG,SAAS,EAAE,KAAK,EAAE,2BAA2B,GAAG,SAAS,GAAG,OAAO;IA6BrI,yEAAyE;IAClE,cAAc;CAStB;AAED;;;;;;GAMG;AACH,qBAAa,oBAAqB,SAAQ,UAAU;IAClD,SAAgB,kBAAkB,wBAAwB;IAC1D,OAAO,CAAC,QAAQ,CAA8B;IAC9C;;OAEG;IACH,OAAO;IAIS,yBAAyB,CAAC,OAAO,EAAE,eAAe;IAGlE;;;;OAIG;WACW,MAAM,CAAC,OAAO,EAAE,2BAA2B,GAAG,yBAAyB,GAAG,oBAAoB,GAAG,SAAS;IASxH;;OAEG;WACW,aAAa,CAAC,OAAO,EAAE,2BAA2B,GAAG,oBAAoB,GAAG,SAAS;IAMnG,uEAAuE;IAChE,yBAAyB,IAAI,YAAY;IAIhD;;;OAGG;IACI,MAAM,IAAI,GAAG;IAGpB,sFAAsF;IAC/E,UAAU,IAAI,yBAAyB;IAI9C,iCAAiC;IACjC,IAAW,OAAO,IAAI,2BAA2B,CAA0B;IAE3E;;;OAGG;IACI,cAAc,IAAI,IAAI;IAI7B;;OAEG;IACI,mBAAmB,CAAC,SAAS,EAAE,SAAS,GAAG,OAAO;IAYzD,0BAA0B;IACV,KAAK,IAAI,oBAAoB;IAI7B,aAAa,CAAC,KAAK,EAAE,aAAa,GAAG,OAAO;IAO5D,0DAA0D;IACnD,mBAAmB,CAAC,KAAK,EAAE,aAAa,GAAG,OAAO;CAE1D"}

package/lib/cjs/bspline/InterpolationCurve3d.js

@@ -261,24 +261,9 @@ class InterpolationCurve3d extends ProxyCurve_1.ProxyCurve {
         }
         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.
-     */
+    /** Return a deep clone */
     clone() {
-        const proxyClone = this._proxyCurve.clone();
-        if (proxyClone) {
-            return new InterpolationCurve3d(this._options.clone(), proxyClone);
-        }
-        return undefined;
+        return new InterpolationCurve3d(this._options.clone(), this._proxyCurve.clone());
     }
     isAlmostEqual(other) {
         if (other instanceof InterpolationCurve3d) {

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

@@ -1 +1 @@
-{"version":3,"file":"InterpolationCurve3d.js","sourceRoot":"","sources":["../../../src/bspline/InterpolationCurve3d.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,mEAAkE;AAClE,0CAAuC;AACvC,6DAA0D;AAC1D,oDAAiD;AAEjD,gEAA6D;AAC7D,iDAAgD;AAkChD;;;;;GAKG;AACH,MAAa,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,mBAAQ,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,mBAAQ,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,mBAAQ,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,mBAAQ,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,mBAAQ,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,mBAAQ,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,mBAAQ,CAAC,kBAAkB,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QACpD,IAAI,CAAC,OAAO,GAAG,mBAAQ,CAAC,kBAAkB,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QAC1D,IAAI,CAAC,gBAAgB,GAAG,mBAAQ,CAAC,kBAAkB,CAAC,eAAe,EAAE,CAAC,CAAC,CAAC;QACxE,IAAI,CAAC,mBAAmB,GAAG,mBAAQ,CAAC,kBAAkB,CAAC,kBAAkB,EAAE,CAAC,CAAC,CAAC;QAC9E,IAAI,CAAC,mBAAmB,GAAG,mBAAQ,CAAC,kBAAkB,CAAC,iBAAiB,EAAE,CAAC,CAAC,CAAC;QAC7E,IAAI,CAAC,kBAAkB,GAAG,mBAAQ,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,2BAAY,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,2BAAY,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,2BAAY,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,0BAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QAChG,MAAM,CAAC,WAAW,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,0BAAQ,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,mBAAQ,CAAC,sBAAsB,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC;mBACxD,mBAAQ,CAAC,sBAAsB,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC;mBAC3D,mBAAQ,CAAC,sBAAsB,CAAC,KAAK,CAAC,eAAe,EAAE,KAAK,CAAC,eAAe,CAAC;mBAC7E,mBAAQ,CAAC,sBAAsB,CAAC,KAAK,CAAC,kBAAkB,EAAE,KAAK,CAAC,kBAAkB,CAAC;mBACnF,mBAAQ,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,mBAAQ,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,mBAAQ,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,IAAI,MAAM,GAAG,KAAK,CAAC,KAAK,EAAE,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC;gBAC/C,IAAI,KAAK,CAAC,KAAK,KAAK,SAAS,EAAG,6DAA6D;oBAC3F,MAAM,GAAG,iCAAe,CAAC,UAAU,CAAC,gCAAgC,CAAC,KAAK,CAAC,SAAS,EAAE,KAAK,CAAC,eAAe,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;qBACxH,IAAI,KAAK,CAAC,KAAK,KAAK,SAAS;oBAChC,MAAM,GAAG,iCAAe,CAAC,UAAU,CAAC,gCAAgC,CAAC,KAAK,CAAC,SAAS,EAAE,KAAK,CAAC,eAAe,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;gBAC7H,MAAM,GAAG,iCAAe,CAAC,UAAU,CAAC,iCAAiC,CAAC,MAAM,EAAE,KAAK,CAAC,SAAS,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;gBAC7G,MAAM,GAAG,iCAAe,CAAC,UAAU,CAAC,iCAAiC,CAAC,MAAM,EAAE,KAAK,CAAC,SAAS,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;gBAC7G,OAAO,mBAAQ,CAAC,uBAAuB,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE,CAAC,mBAAQ,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,8FAA8F;QAC9F,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;AAlLD,kEAkLC;AAED;;;;;;GAMG;AACH,MAAa,oBAAqB,SAAQ,uBAAU;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,6BAAc,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,2BAAY,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,IAAI,IAAI,CAAC,QAAQ,CAAC,YAAY;gBAC5B,SAAS,CAAC,qBAAqB,CAAC,IAAI,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC;YAC9D,IAAI,IAAI,CAAC,QAAQ,CAAC,UAAU;gBAC1B,SAAS,CAAC,qBAAqB,CAAC,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;SAC7D;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;AA1GD,oDA0GC","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        let knotsA = dataA.knots, knotsB = dataB.knots;\r\n        if (dataA.knots === undefined)  // construct undefined knots to compare against defined knots\r\n          knotsA = BSplineCurveOps.C2CubicFit.constructFitParametersFromPoints(dataA.fitPoints, dataA.isChordLenKnots, dataA.closed);\r\n        else if (dataB.knots === undefined)\r\n          knotsB = BSplineCurveOps.C2CubicFit.constructFitParametersFromPoints(dataB.fitPoints, dataB.isChordLenKnots, dataB.closed);\r\n        knotsA = BSplineCurveOps.C2CubicFit.convertCubicKnotVectorToFitParams(knotsA, dataA.fitPoints.length, false);\r\n        knotsB = BSplineCurveOps.C2CubicFit.convertCubicKnotVectorToFitParams(knotsB, 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. They don't need to be negated because they point into the curve.\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      if (this._options.startTangent)\r\n        transform.multiplyVectorInPlace(this._options.startTangent);\r\n      if (this._options.endTangent)\r\n        transform.multiplyVectorInPlace(this._options.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"]}
+{"version":3,"file":"InterpolationCurve3d.js","sourceRoot":"","sources":["../../../src/bspline/InterpolationCurve3d.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,mEAAkE;AAClE,0CAAuC;AACvC,6DAA0D;AAC1D,oDAAiD;AAEjD,gEAA6D;AAC7D,iDAAgD;AAkChD;;;;;GAKG;AACH,MAAa,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,mBAAQ,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,mBAAQ,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,mBAAQ,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,mBAAQ,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,mBAAQ,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,mBAAQ,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,mBAAQ,CAAC,kBAAkB,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QACpD,IAAI,CAAC,OAAO,GAAG,mBAAQ,CAAC,kBAAkB,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QAC1D,IAAI,CAAC,gBAAgB,GAAG,mBAAQ,CAAC,kBAAkB,CAAC,eAAe,EAAE,CAAC,CAAC,CAAC;QACxE,IAAI,CAAC,mBAAmB,GAAG,mBAAQ,CAAC,kBAAkB,CAAC,kBAAkB,EAAE,CAAC,CAAC,CAAC;QAC9E,IAAI,CAAC,mBAAmB,GAAG,mBAAQ,CAAC,kBAAkB,CAAC,iBAAiB,EAAE,CAAC,CAAC,CAAC;QAC7E,IAAI,CAAC,kBAAkB,GAAG,mBAAQ,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,2BAAY,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,2BAAY,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,2BAAY,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,0BAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QAChG,MAAM,CAAC,WAAW,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,0BAAQ,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,mBAAQ,CAAC,sBAAsB,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC;mBACxD,mBAAQ,CAAC,sBAAsB,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,MAAM,CAAC;mBAC3D,mBAAQ,CAAC,sBAAsB,CAAC,KAAK,CAAC,eAAe,EAAE,KAAK,CAAC,eAAe,CAAC;mBAC7E,mBAAQ,CAAC,sBAAsB,CAAC,KAAK,CAAC,kBAAkB,EAAE,KAAK,CAAC,kBAAkB,CAAC;mBACnF,mBAAQ,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,mBAAQ,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,mBAAQ,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,IAAI,MAAM,GAAG,KAAK,CAAC,KAAK,EAAE,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC;gBAC/C,IAAI,KAAK,CAAC,KAAK,KAAK,SAAS,EAAG,6DAA6D;oBAC3F,MAAM,GAAG,iCAAe,CAAC,UAAU,CAAC,gCAAgC,CAAC,KAAK,CAAC,SAAS,EAAE,KAAK,CAAC,eAAe,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;qBACxH,IAAI,KAAK,CAAC,KAAK,KAAK,SAAS;oBAChC,MAAM,GAAG,iCAAe,CAAC,UAAU,CAAC,gCAAgC,CAAC,KAAK,CAAC,SAAS,EAAE,KAAK,CAAC,eAAe,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;gBAC7H,MAAM,GAAG,iCAAe,CAAC,UAAU,CAAC,iCAAiC,CAAC,MAAM,EAAE,KAAK,CAAC,SAAS,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;gBAC7G,MAAM,GAAG,iCAAe,CAAC,UAAU,CAAC,iCAAiC,CAAC,MAAM,EAAE,KAAK,CAAC,SAAS,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;gBAC7G,OAAO,mBAAQ,CAAC,uBAAuB,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE,CAAC,mBAAQ,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,8FAA8F;QAC9F,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;AAlLD,kEAkLC;AAED;;;;;;GAMG;AACH,MAAa,oBAAqB,SAAQ,uBAAU;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,6BAAc,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,2BAAY,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,IAAI,IAAI,CAAC,QAAQ,CAAC,YAAY;gBAC5B,SAAS,CAAC,qBAAqB,CAAC,IAAI,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC;YAC9D,IAAI,IAAI,CAAC,QAAQ,CAAC,UAAU;gBAC1B,SAAS,CAAC,qBAAqB,CAAC,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;SAC7D;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,0BAA0B;IACV,KAAK;QACnB,OAAO,IAAI,oBAAoB,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,EAAE,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC,CAAC;IACnF,CAAC;IAEe,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;IAED,0DAA0D;IACnD,mBAAmB,CAAC,KAAoB,IAAa,OAAO,KAAK,YAAY,oBAAoB,CAAC,CAAC,CAAC;CAE5G;AA9FD,oDA8FC","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        let knotsA = dataA.knots, knotsB = dataB.knots;\r\n        if (dataA.knots === undefined)  // construct undefined knots to compare against defined knots\r\n          knotsA = BSplineCurveOps.C2CubicFit.constructFitParametersFromPoints(dataA.fitPoints, dataA.isChordLenKnots, dataA.closed);\r\n        else if (dataB.knots === undefined)\r\n          knotsB = BSplineCurveOps.C2CubicFit.constructFitParametersFromPoints(dataB.fitPoints, dataB.isChordLenKnots, dataB.closed);\r\n        knotsA = BSplineCurveOps.C2CubicFit.convertCubicKnotVectorToFitParams(knotsA, dataA.fitPoints.length, false);\r\n        knotsB = BSplineCurveOps.C2CubicFit.convertCubicKnotVectorToFitParams(knotsB, 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. They don't need to be negated because they point into the curve.\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      if (this._options.startTangent)\r\n        transform.multiplyVectorInPlace(this._options.startTangent);\r\n      if (this._options.endTangent)\r\n        transform.multiplyVectorInPlace(this._options.endTangent);\r\n    }\r\n    return proxyOk;\r\n  }\r\n\r\n  /** Return a deep clone */\r\n  public override clone(): InterpolationCurve3d {\r\n    return new InterpolationCurve3d(this._options.clone(), this._proxyCurve.clone());\r\n  }\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\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/cjs/bspline/KnotVector.d.ts

@@ -25,7 +25,7 @@ export declare enum BSplineWrapMode {
 /**
  * Array of non-decreasing numbers acting as a knot array for bsplines.
  *
- * * Essential identity: numKnots = numPoles + order = numPoles + degree - 1
+ * * Essential identity: numKnots = numPoles + order - 2 = 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.
@@ -33,7 +33,7 @@ export declare enum BSplineWrapMode {
  * * 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
+ * * core computations (evaluateBasisFunctions) have leftKnotIndex and global knot value as inputs.  Callers need to
  * know their primary values (global knot, spanFraction).
  * @public
  */
@@ -80,9 +80,19 @@ export declare class KnotVector {
     testClosable(mode?: BSplineWrapMode): boolean;
     /** Test matching degree and knot values */
     isAlmostEqual(other: KnotVector): boolean;
+    /** Compute the multiplicity of the input knot, or zero if not a knot. */
+    getKnotMultiplicity(knot: number): number;
+    /** Compute the multiplicity of the knot at the given index. */
+    getKnotMultiplicityAtIndex(knotIndex: number): number;
+    /** Transform knots to span [0,1].
+     * @returns false if and only if this.knotLength01 is trivial
+     */
+    normalize(): boolean;
     /** install knot values from an array, optionally ignoring first and last.
      */
     setKnots(knots: number[] | Float64Array, skipFirstAndLast?: boolean): void;
+    /** install knot values from an array, optionally ignoring first and last. */
+    setKnotsCapture(knots: Float64Array): void;
     /**
      * Create knot vector with {degree-1} replicated knots at start and end, and uniform knots between.
      * @param numPoles Number of poles
@@ -103,13 +113,13 @@ export declare class 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.
+     * @param skipFirstAndLast true to skip copying the first and last knot values.
      */
     static create(knotArray: number[] | Float64Array, degree: number, skipFirstAndLast?: boolean): KnotVector;
     /**
-     * Return the average of degree consecutive knots beginning at spanIndex.
+     * Return the average of degree consecutive knots beginning at knotIndex.
      */
-    grevilleKnot(spanIndex: number): number;
+    grevilleKnot(knotIndex: 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. */
@@ -124,17 +134,22 @@ export declare class KnotVector {
      * Evaluate basis functions f[] at knot value u.
      *
      * @param u knot value for evaluation
-     * @param f array of basis values.  ASSUMED PROPER LENGTH
+     * @param f array of order basis function values
      */
     evaluateBasisFunctions(knotIndex0: number, u: number, f: Float64Array): void;
     /**
-     * Evaluate basis fucntions f[] at knot value u.
+     * Evaluate basis functions f[], derivatives df[], and optional second derivatives ddf[] at knot value u.
      *
      * @param u knot value for evaluation
-     * @param f array of basis values.  ASSUMED PROPER LENGTH
+     * @param f array of order basis function values
+     * @param df array of order basis derivative values
+     * @param ddf array of order basis second derivative values
      */
     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 */
+    /** Find the knot span bracketing knots[i] <= u < knots[i+1] and return i.
+     * * If u has no such bracket, return the smaller index of the closest nontrivial bracket.
+     * @param u value to bracket
+     */
     knotToLeftKnotIndex(u: number): number;
     /**
      * Given a span index, return the index of the knot at its left.

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

@@ -1 +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,iHAAiH;IACjH,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"}
+{"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,iHAAiH;IACjH,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;IAKhD,yEAAyE;IAClE,mBAAmB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM;IAWhD,+DAA+D;IACxD,0BAA0B,CAAC,SAAS,EAAE,MAAM,GAAG,MAAM;IAuB5D;;OAEG;IACI,SAAS,IAAI,OAAO;IAe3B;OACG;IACI,QAAQ,CAAC,KAAK,EAAE,MAAM,EAAE,GAAG,YAAY,EAAE,gBAAgB,CAAC,EAAE,OAAO;IAe1E,6EAA6E;IACtE,eAAe,CAAC,KAAK,EAAE,YAAY;IAK1C;;;;;;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;;;;;;;OAOG;IACI,uBAAuB,CAAC,UAAU,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,YAAY,EAAE,EAAE,EAAE,YAAY,EAAE,GAAG,CAAC,EAAE,YAAY;IA0DnH;;;OAGG;IACI,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"}

package/lib/cjs/bspline/KnotVector.js

@@ -37,7 +37,7 @@ var BSplineWrapMode;
 /**
  * Array of non-decreasing numbers acting as a knot array for bsplines.
  *
- * * Essential identity: numKnots = numPoles + order = numPoles + degree - 1
+ * * Essential identity: numKnots = numPoles + order - 2 = 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.
@@ -45,7 +45,7 @@ var BSplineWrapMode;
  * * 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
+ * * core computations (evaluateBasisFunctions) have leftKnotIndex and global knot value as inputs.  Callers need to
  * know their primary values (global knot, spanFraction).
  * @public
  */
@@ -142,6 +142,59 @@ class KnotVector {
             return false;
         return PointHelpers_1.NumberArray.isAlmostEqual(this.knots, other.knots, KnotVector.knotTolerance);
     }
+    /** Compute the multiplicity of the input knot, or zero if not a knot. */
+    getKnotMultiplicity(knot) {
+        let m = 0;
+        for (const k of this.knots) {
+            if (Math.abs(k - knot) < KnotVector.knotTolerance)
+                ++m;
+            else if (knot < k)
+                break;
+        }
+        return m;
+    }
+    /** Compute the multiplicity of the knot at the given index. */
+    getKnotMultiplicityAtIndex(knotIndex) {
+        let m = 0;
+        if (knotIndex >= 0 && knotIndex < this.knots.length) {
+            const knot = this.knots[knotIndex];
+            ++m; // count this knot
+            for (let i = knotIndex - 1; i >= 0; --i) {
+                const k = this.knots[i];
+                if (Math.abs(k - knot) < KnotVector.knotTolerance)
+                    ++m; // found multiple to left of knot
+                else if (knot > k)
+                    break;
+            }
+            for (let i = knotIndex + 1; i < this.knots.length; ++i) {
+                const k = this.knots[i];
+                if (Math.abs(k - knot) < KnotVector.knotTolerance)
+                    ++m; // found multiple to right of knot
+                else if (knot < k)
+                    break;
+            }
+        }
+        return m;
+    }
+    /** Transform knots to span [0,1].
+     * @returns false if and only if this.knotLength01 is trivial
+     */
+    normalize() {
+        if (this.knotLength01 < KnotVector.knotTolerance)
+            return false;
+        const divisor = 1.0 / this.knotLength01;
+        const leftKnot = this.leftKnot;
+        for (let i = 0; i < this.knots.length; ++i)
+            this.knots[i] = (this.knots[i] - leftKnot) * divisor;
+        // explicitly set rightKnot and its multiples to 1.0 to avoid round-off
+        for (let i = this.rightKnotIndex - 1; i > this.leftKnotIndex && (this.knots[i] === this.knots[this.rightKnotIndex]); --i)
+            this.knots[i] = 1.0;
+        for (let i = this.rightKnotIndex + 1; i < this.knots.length && (this.knots[i] === this.knots[this.rightKnotIndex]); ++i)
+            this.knots[i] = 1.0;
+        this.knots[this.rightKnotIndex] = 1.0;
+        this.setupFixedValues();
+        return true;
+    }
     /** install knot values from an array, optionally ignoring first and last.
      */
     setKnots(knots, skipFirstAndLast) {
@@ -158,6 +211,11 @@ class KnotVector {
         }
         this.setupFixedValues();
     }
+    /** install knot values from an array, optionally ignoring first and last. */
+    setKnotsCapture(knots) {
+        this.knots = knots;
+        this.setupFixedValues();
+    }
     /**
      * Create knot vector with {degree-1} replicated knots at start and end, and uniform knots between.
      * @param numPoles Number of poles
@@ -198,7 +256,7 @@ class 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.
+     * @param skipFirstAndLast true to skip copying the first and last knot values.
      */
     static create(knotArray, degree, skipFirstAndLast) {
         const numAllocate = skipFirstAndLast ? knotArray.length - 2 : knotArray.length;
@@ -207,15 +265,15 @@ class KnotVector {
         return knots;
     }
     /**
-     * Return the average of degree consecutive knots beginning at spanIndex.
+     * Return the average of degree consecutive knots beginning at knotIndex.
      */
-    grevilleKnot(spanIndex) {
-        if (spanIndex < 0)
+    grevilleKnot(knotIndex) {
+        if (knotIndex < 0)
             return this.leftKnot;
-        if (spanIndex > this.rightKnotIndex)
+        if (knotIndex > this.rightKnotIndex)
             return this.rightKnot;
         let sum = 0.0;
-        for (let i = spanIndex; i < spanIndex + this.degree; i++)
+        for (let i = knotIndex; i < knotIndex + this.degree; i++)
             sum += this.knots[i];
         return sum / this.degree;
     }
@@ -244,7 +302,7 @@ class KnotVector {
      * Evaluate basis functions f[] at knot value u.
      *
      * @param u knot value for evaluation
-     * @param f array of basis values.  ASSUMED PROPER LENGTH
+     * @param f array of order basis function values
      */
     evaluateBasisFunctions(knotIndex0, u, f) {
         f[0] = 1.0;
@@ -274,10 +332,12 @@ class KnotVector {
         }
     }
     /**
-     * Evaluate basis fucntions f[] at knot value u.
+     * Evaluate basis functions f[], derivatives df[], and optional second derivatives ddf[] at knot value u.
      *
      * @param u knot value for evaluation
-     * @param f array of basis values.  ASSUMED PROPER LENGTH
+     * @param f array of order basis function values
+     * @param df array of order basis derivative values
+     * @param ddf array of order basis second derivative values
      */
     evaluateBasisFunctions1(knotIndex0, u, f, df, ddf) {
         f[0] = 1.0;
@@ -342,21 +402,21 @@ class KnotVector {
                 ddf[depth + 1] = ddgCarry;
         }
     }
-    /** Return the (highest) index of the knot less than or equal to u */
+    /** Find the knot span bracketing knots[i] <= u < knots[i+1] and return i.
+     * * If u has no such bracket, return the smaller index of the closest nontrivial bracket.
+     * @param u value to bracket
+     */
     knotToLeftKnotIndex(u) {
-        // Anything to left is in the first span . .
-        const firstLeftKnot = this.degree - 1;
-        if (u < this.knots[firstLeftKnot + 1])
-            return firstLeftKnot;
-        // Anything to right is in the last span ...
-        const lastLeftKnot = this.knots.length - this.degree - 1;
-        if (u >= this.knots.length - this.degree)
-            return this.knots[lastLeftKnot];
-        // ugh ... linear search ...
-        for (let i = firstLeftKnot + 1; i < lastLeftKnot; i++)
+        for (let i = this.leftKnotIndex; i < this.rightKnotIndex; ++i) {
             if (u < this.knots[i + 1])
-                return i; // testing against right side skips over multiple knot cases???
-        return lastLeftKnot;
+                return i;
+        }
+        // for u >= rightKnot, return left index of last nontrivial span
+        for (let i = this.rightKnotIndex; i > this.leftKnotIndex; --i) {
+            if (this.knots[i] - this.knots[i - 1] >= KnotVector.knotTolerance)
+                return i - 1;
+        }
+        return this.rightKnotIndex - 1; // shouldn't get here
     }
     /**
      * Given a span index, return the index of the knot at its left.
@@ -366,7 +426,7 @@ class KnotVector {
         const d = this.degree;
         if (spanIndex <= 0.0)
             return d - 1;
-        return Math.min(spanIndex + d - 1, this.knots.length - d);
+        return Math.min(spanIndex + d - 1, this.knots.length - d - 1);
     }
     /** Return the knot interval length of indexed bezier span. */
     spanIndexToSpanLength(spanIndex) {
@@ -379,7 +439,7 @@ class KnotVector {
      * @param spanIndex index of span to test.
      */
     isIndexOfRealSpan(spanIndex) {
-        if (spanIndex >= 0 && spanIndex < this.knots.length - this.degree)
+        if (spanIndex >= 0 && spanIndex < this.numSpans)
             return !Geometry_1.Geometry.isSmallMetricDistance(this.spanIndexToSpanLength(spanIndex));
         return false;
     }