@itwin/core-geometry 5.1.0-dev.17 → 5.1.0-dev.18

package/lib/cjs/solid/LinearSweep.d.ts

@@ -12,10 +12,9 @@ import { XAndY } from "../geometry3d/XYZProps";
 import { SolidPrimitive } from "./SolidPrimitive";
 import { SweepContour } from "./SweepContour";
 /**
- * A LinearSweep is a `SolidPrimitive` defined by
- * * A set of curves (any Loop, Path, or parityRegion)
+ * A LinearSweep is a `SolidPrimitive` defined by:
+ * * A set of curves (any Loop, Path, or parityRegion). If the object is "capped", the curves must be planar.
  * * A sweep vector
- * If the object is "capped", the curves must be planar.
  * @public
  */
 export declare class LinearSweep extends SolidPrimitive {

package/lib/cjs/solid/LinearSweep.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"LinearSweep.d.ts","sourceRoot":"","sources":["../../../src/solid/LinearSweep.ts"],"names":[],"mappings":"AAKA;;GAEG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,qBAAqB,CAAC;AAC/C,OAAO,EAAE,eAAe,EAAE,MAAM,0BAA0B,CAAC;AAC3D,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AAIvD,OAAO,EAAE,eAAe,EAAE,MAAM,+BAA+B,CAAC;AAChE,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAEzD,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AAC9C,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACpD,OAAO,EAAE,KAAK,EAAE,MAAM,wBAAwB,CAAC;AAC/C,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAClD,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAE9C;;;;;;GAMG;AACH,qBAAa,WAAY,SAAQ,cAAc;IAC7C,wCAAwC;IACxC,SAAgB,kBAAkB,iBAAiB;IAEnD,OAAO,CAAC,QAAQ,CAAe;IAC/B,OAAO,CAAC,UAAU,CAAW;IAE7B,OAAO;IAKP;;;;;OAKG;WACW,MAAM,CAAC,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,QAAQ,EAAE,MAAM,EAAE,OAAO,GAAG,WAAW,GAAG,SAAS;IAMtG;;;;;;;;;;OAUG;WACW,YAAY,CAAC,QAAQ,EAAE,KAAK,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,GAAG,WAAW,GAAG,SAAS;IAWlH,0CAA0C;IACnC,YAAY,IAAI,eAAe;IACtC,6EAA6E;IACtE,kBAAkB,IAAI,YAAY;IACzC,yCAAyC;IAClC,gBAAgB,IAAI,QAAQ;IACnC,2DAA2D;IACpD,mBAAmB,CAAC,KAAK,EAAE,GAAG,GAAG,OAAO;IAC/C,0BAA0B;IACnB,KAAK,IAAI,WAAW;IAG3B;;;OAGG;IACI,mBAAmB,CAAC,SAAS,EAAE,SAAS,GAAG,OAAO;IAUzD;;;;OAIG;IACI,oBAAoB,IAAI,SAAS,GAAG,SAAS;IAGpD;;;OAGG;IACI,gBAAgB,CAAC,SAAS,EAAE,SAAS,GAAG,WAAW,GAAG,SAAS;IAItE,uDAAuD;IACvC,aAAa,CAAC,KAAK,EAAE,aAAa,GAAG,OAAO;IAQ5D,8DAA8D;IACvD,yBAAyB,CAAC,OAAO,EAAE,eAAe,GAAG,GAAG;IAG/D;;;OAGG;IACI,gBAAgB,CAAC,SAAS,EAAE,MAAM,GAAG,eAAe,GAAG,SAAS;IAMvE,uDAAuD;IAChD,WAAW,CAAC,aAAa,EAAE,OAAO,EAAE,SAAS,CAAC,EAAE,SAAS;IAahE;;OAEG;IACH,IAAW,cAAc,IAAI,OAAO,CAEnC;CACF"}
+{"version":3,"file":"LinearSweep.d.ts","sourceRoot":"","sources":["../../../src/solid/LinearSweep.ts"],"names":[],"mappings":"AAKA;;GAEG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,qBAAqB,CAAC;AAC/C,OAAO,EAAE,eAAe,EAAE,MAAM,0BAA0B,CAAC;AAC3D,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AAIvD,OAAO,EAAE,eAAe,EAAE,MAAM,+BAA+B,CAAC;AAChE,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAEzD,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AAC9C,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACpD,OAAO,EAAE,KAAK,EAAE,MAAM,wBAAwB,CAAC;AAC/C,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAClD,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAE9C;;;;;GAKG;AACH,qBAAa,WAAY,SAAQ,cAAc;IAC7C,wCAAwC;IACxC,SAAgB,kBAAkB,iBAAiB;IAEnD,OAAO,CAAC,QAAQ,CAAe;IAC/B,OAAO,CAAC,UAAU,CAAW;IAE7B,OAAO;IAKP;;;;;OAKG;WACW,MAAM,CAAC,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,QAAQ,EAAE,MAAM,EAAE,OAAO,GAAG,WAAW,GAAG,SAAS;IAMtG;;;;;;;;;;OAUG;WACW,YAAY,CAAC,QAAQ,EAAE,KAAK,EAAE,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,GAAG,WAAW,GAAG,SAAS;IAWlH,0CAA0C;IACnC,YAAY,IAAI,eAAe;IACtC,6EAA6E;IACtE,kBAAkB,IAAI,YAAY;IACzC,yCAAyC;IAClC,gBAAgB,IAAI,QAAQ;IACnC,2DAA2D;IACpD,mBAAmB,CAAC,KAAK,EAAE,GAAG,GAAG,OAAO;IAC/C,0BAA0B;IACnB,KAAK,IAAI,WAAW;IAG3B;;;OAGG;IACI,mBAAmB,CAAC,SAAS,EAAE,SAAS,GAAG,OAAO;IAUzD;;;;OAIG;IACI,oBAAoB,IAAI,SAAS,GAAG,SAAS;IAGpD;;;OAGG;IACI,gBAAgB,CAAC,SAAS,EAAE,SAAS,GAAG,WAAW,GAAG,SAAS;IAItE,uDAAuD;IACvC,aAAa,CAAC,KAAK,EAAE,aAAa,GAAG,OAAO;IAQ5D,8DAA8D;IACvD,yBAAyB,CAAC,OAAO,EAAE,eAAe,GAAG,GAAG;IAG/D;;;OAGG;IACI,gBAAgB,CAAC,SAAS,EAAE,MAAM,GAAG,eAAe,GAAG,SAAS;IAMvE,uDAAuD;IAChD,WAAW,CAAC,aAAa,EAAE,OAAO,EAAE,SAAS,CAAC,EAAE,SAAS;IAahE;;OAEG;IACH,IAAW,cAAc,IAAI,OAAO,CAEnC;CACF"}

package/lib/cjs/solid/LinearSweep.js

@@ -14,10 +14,9 @@ const Transform_1 = require("../geometry3d/Transform");
 const SolidPrimitive_1 = require("./SolidPrimitive");
 const SweepContour_1 = require("./SweepContour");
 /**
- * A LinearSweep is a `SolidPrimitive` defined by
- * * A set of curves (any Loop, Path, or parityRegion)
+ * A LinearSweep is a `SolidPrimitive` defined by:
+ * * A set of curves (any Loop, Path, or parityRegion). If the object is "capped", the curves must be planar.
  * * A sweep vector
- * If the object is "capped", the curves must be planar.
  * @public
  */
 class LinearSweep extends SolidPrimitive_1.SolidPrimitive {

package/lib/cjs/solid/LinearSweep.js.map

@@ -1 +1 @@
-{"version":3,"file":"LinearSweep.js","sourceRoot":"","sources":["../../../src/solid/LinearSweep.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAS/F,wDAAqD;AACrD,wCAAqC;AACrC,wCAAqC;AAErC,mEAAyD;AACzD,yDAAsD;AAEtD,uDAAoD;AAEpD,qDAAkD;AAClD,iDAA8C;AAE9C;;;;;;GAMG;AACH,MAAa,WAAY,SAAQ,+BAAc;IAC7C,wCAAwC;IACxB,kBAAkB,GAAG,aAAa,CAAC;IAE3C,QAAQ,CAAe;IACvB,UAAU,CAAW;IAE7B,YAAoB,OAAqB,EAAE,SAAmB,EAAE,MAAe;QAC7E,KAAK,CAAC,MAAM,CAAC,CAAC;QACd,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;QACxB,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;IAC9B,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,MAAM,CAAC,OAAiB,EAAE,SAAmB,EAAE,MAAe;QAC1E,MAAM,SAAS,GAAG,2BAAY,CAAC,oBAAoB,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;QACxE,IAAI,CAAC,SAAS;YACZ,OAAO,SAAS,CAAC;QACnB,OAAO,IAAI,WAAW,CAAC,SAAS,EAAE,SAAS,EAAE,MAAM,CAAC,CAAC;IACvD,CAAC;IACD;;;;;;;;;;OAUG;IACI,MAAM,CAAC,YAAY,CAAC,QAAiB,EAAE,CAAS,EAAE,MAAc,EAAE,MAAe;QACtF,MAAM,GAAG,GAAG,2BAAY,CAAC,QAAQ,CAAC,QAAQ,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC;QACvD,IAAI,MAAM,EAAE,CAAC;YACX,GAAG,CAAC,eAAe,EAAE,CAAC;YACtB,MAAM,IAAI,GAAG,uBAAU,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAC3C,IAAI,IAAI,GAAG,MAAM,GAAG,GAAG;gBACrB,GAAG,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;QACzB,CAAC;QACD,MAAM,OAAO,GAAoB,MAAM,CAAC,CAAC,CAAC,WAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,WAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAC9E,OAAO,WAAW,CAAC,MAAM,CAAC,OAAO,EAAE,0BAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,EAAE,MAAM,CAAC,CAAC;IAC5E,CAAC;IACD,0CAA0C;IACnC,YAAY,KAAsB,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC;IACvE,6EAA6E;IACtE,kBAAkB,KAAmB,OAAO,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;IACnE,yCAAyC;IAClC,gBAAgB,KAAe,OAAO,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IACvE,2DAA2D;IACpD,mBAAmB,CAAC,KAAU,IAAa,OAAO,KAAK,YAAY,WAAW,CAAC,CAAC,CAAC;IACxF,0BAA0B;IACnB,KAAK;QACV,OAAO,IAAI,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,EAAE,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;IACtF,CAAC;IACD;;;OAGG;IACI,mBAAmB,CAAC,SAAoB;QAC7C,IAAI,SAAS,CAAC,MAAM,CAAC,UAAU,EAAE;YAC/B,OAAO,KAAK,CAAC;QACf,IAAI,IAAI,CAAC,QAAQ,CAAC,mBAAmB,CAAC,SAAS,CAAC,EAAE,CAAC;YACjD,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;YAC3D,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;OAIG;IACI,oBAAoB;QACzB,OAAO,IAAI,CAAC,QAAQ,CAAC,YAAY,CAAC,UAAU,EAAE,CAAC;IACjD,CAAC;IACD;;;OAGG;IACI,gBAAgB,CAAC,SAAoB;QAC1C,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;QAC5B,OAAO,MAAM,CAAC,mBAAmB,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC;IACpE,CAAC;IACD,uDAAuD;IACvC,aAAa,CAAC,KAAoB;QAChD,IAAI,KAAK,YAAY,WAAW,EAAE,CAAC;YACjC,OAAO,IAAI,CAAC,QAAQ,CAAC,aAAa,CAAC,KAAK,CAAC,QAAQ,CAAC;mBAC7C,IAAI,CAAC,UAAU,CAAC,aAAa,CAAC,KAAK,CAAC,UAAU,CAAC;mBAC/C,IAAI,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM,CAAC;QACpC,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,8DAA8D;IACvD,yBAAyB,CAAC,OAAwB;QACvD,OAAO,OAAO,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;IACzC,CAAC;IACD;;;OAGG;IACI,gBAAgB,CAAC,SAAiB;QACvC,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;QAC7C,IAAI,OAAO,IAAI,SAAS,KAAK,GAAG;YAC9B,OAAO,CAAC,mBAAmB,CAAC,qBAAS,CAAC,iBAAiB,CAAC,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QAC7F,OAAO,OAAO,CAAC;IACjB,CAAC;IACD,uDAAuD;IAChD,WAAW,CAAC,aAAsB,EAAE,SAAqB;QAC9D,MAAM,YAAY,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;QAC3D,aAAa,CAAC,WAAW,CAAC,YAAY,CAAC,CAAC;QACxC,IAAI,SAAS,EAAE,CAAC;YACd,MAAM,oBAAoB,GAAG,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YACvE,YAAY,CAAC,GAAG,CAAC,UAAU,CAAC,oBAAoB,CAAC,CAAC;YAClD,YAAY,CAAC,IAAI,CAAC,UAAU,CAAC,oBAAoB,CAAC,CAAC;QACrD,CAAC;aAAM,CAAC;YACN,YAAY,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YAC7C,YAAY,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAChD,CAAC;QACD,aAAa,CAAC,WAAW,CAAC,YAAY,CAAC,CAAC;IAC1C,CAAC;IACD;;OAEG;IACH,IAAW,cAAc;QACvB,OAAO,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,eAAe,CAAC;IAC7D,CAAC;CACF;AAnID,kCAmIC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n\n/** @packageDocumentation\n * @module Solid\n */\n\nimport { AnyCurve } from \"../curve/CurveTypes\";\nimport { CurveCollection } from \"../curve/CurveCollection\";\nimport { GeometryQuery } from \"../curve/GeometryQuery\";\nimport { LineString3d } from \"../curve/LineString3d\";\nimport { Loop } from \"../curve/Loop\";\nimport { Path } from \"../curve/Path\";\nimport { GeometryHandler } from \"../geometry3d/GeometryHandler\";\nimport { Vector3d } from \"../geometry3d/Point3dVector3d\";\nimport { PolygonOps } from \"../geometry3d/PolygonOps\";\nimport { Range3d } from \"../geometry3d/Range\";\nimport { Transform } from \"../geometry3d/Transform\";\nimport { XAndY } from \"../geometry3d/XYZProps\";\nimport { SolidPrimitive } from \"./SolidPrimitive\";\nimport { SweepContour } from \"./SweepContour\";\n\n/**\n * A LinearSweep is a `SolidPrimitive` defined by\n * * A set of curves (any Loop, Path, or parityRegion)\n * * A sweep vector\n * If the object is \"capped\", the curves must be planar.\n * @public\n */\nexport class LinearSweep extends SolidPrimitive {\n  /** String name for schema properties */\n  public readonly solidPrimitiveType = \"linearSweep\";\n\n  private _contour: SweepContour;\n  private _direction: Vector3d;\n\n  private constructor(contour: SweepContour, direction: Vector3d, capped: boolean) {\n    super(capped);\n    this._contour = contour;\n    this._direction = direction;\n  }\n  /**\n   * Create a sweep of a starting contour.\n   * @param contour contour to be swept, CAPTURED\n   * @param direction sweep vector.  The contour is swept the full length of the vector.\n   * @param capped true to include end caps\n   */\n  public static create(contour: AnyCurve, direction: Vector3d, capped: boolean): LinearSweep | undefined {\n    const sweepable = SweepContour.createForLinearSweep(contour, direction);\n    if (!sweepable)\n      return undefined;\n    return new LinearSweep(sweepable, direction, capped);\n  }\n  /** Create a z-direction sweep of the polyline or polygon given as xy linestring values.\n   * * If not capped, the xyPoints array is always used unchanged.\n   * * If capped but the xyPoints array does not close, exact closure will be enforced by one of these:\n   * * * If the final point is almost equal to the first, it is replaced by the exact first point.\n   * * * if the final point is not close to the first an extra point is added.\n   * * If capped, the point order will be reversed if necessary to produce positive volume.\n   * @param xyPoints array of xy coordinates\n   * @param z z value to be used for all coordinates\n   * @param zSweep the sweep distance in the z direction.\n   * @param capped true if caps are to be added.\n   */\n  public static createZSweep(xyPoints: XAndY[], z: number, zSweep: number, capped: boolean): LinearSweep | undefined {\n    const xyz = LineString3d.createXY(xyPoints, z, capped);\n    if (capped) {\n      xyz.addClosurePoint();\n      const area = PolygonOps.areaXY(xyz.points);\n      if (area * zSweep < 0.0)\n        xyz.points.reverse();\n    }\n    const contour: CurveCollection = capped ? Loop.create(xyz) : Path.create(xyz);\n    return LinearSweep.create(contour, Vector3d.create(0, 0, zSweep), capped);\n  }\n  /** get a reference to the swept curves */\n  public getCurvesRef(): CurveCollection { return this._contour.curves; }\n  /** Get a reference to the `SweepContour` carrying the plane of the curves */\n  public getSweepContourRef(): SweepContour { return this._contour; }\n  /** return a clone of the sweep vector */\n  public cloneSweepVector(): Vector3d { return this._direction.clone(); }\n  /** Test if `other` is also an instance of `LinearSweep` */\n  public isSameGeometryClass(other: any): boolean { return other instanceof LinearSweep; }\n  /** Return a deep clone */\n  public clone(): LinearSweep {\n    return new LinearSweep(this._contour.clone(), this._direction.clone(), this.capped);\n  }\n  /**\n   * Apply a transform to the curves and sweep vector\n   * * This fails if the transformation is singular.\n   */\n  public tryTransformInPlace(transform: Transform): boolean {\n    if (transform.matrix.isSingular())\n      return false;\n    if (this._contour.tryTransformInPlace(transform)) {\n      transform.multiplyVector(this._direction, this._direction);\n      return true;\n    }\n    return false;\n  }\n\n  /** Return a coordinate frame (right handed unit vectors)\n   * * origin on base contour\n   * * x, y directions from base contour.\n   * * z direction perpendicular\n   */\n  public getConstructiveFrame(): Transform | undefined {\n    return this._contour.localToWorld.cloneRigid();\n  }\n  /**\n   * Return a transformed clone.\n   * * This fails if the transformation is singular.\n   */\n  public cloneTransformed(transform: Transform): LinearSweep | undefined {\n    const result = this.clone();\n    return result.tryTransformInPlace(transform) ? result : undefined;\n  }\n  /** Test for near-equality of coordinates in `other` */\n  public override isAlmostEqual(other: GeometryQuery): boolean {\n    if (other instanceof LinearSweep) {\n      return this._contour.isAlmostEqual(other._contour)\n        && this._direction.isAlmostEqual(other._direction)\n        && this.capped === other.capped;\n    }\n    return false;\n  }\n  /** Invoke strongly typed `handler.handleLinearSweep(this)` */\n  public dispatchToGeometryHandler(handler: GeometryHandler): any {\n    return handler.handleLinearSweep(this);\n  }\n  /**\n   * Return the curves at a fraction along the sweep direction.\n   * @param vFraction fractional position along the sweep direction\n   */\n  public constantVSection(vFraction: number): CurveCollection | undefined {\n    const section = this._contour.curves.clone();\n    if (section && vFraction !== 0.0)\n      section.tryTransformInPlace(Transform.createTranslation(this._direction.scale(vFraction)));\n    return section;\n  }\n  /** Extend `rangeToExtend` to include this geometry. */\n  public extendRange(rangeToExtend: Range3d, transform?: Transform) {\n    const contourRange = this._contour.curves.range(transform);\n    rangeToExtend.extendRange(contourRange);\n    if (transform) {\n      const transformedDirection = transform.multiplyVector(this._direction);\n      contourRange.low.addInPlace(transformedDirection);\n      contourRange.high.addInPlace(transformedDirection);\n    } else {\n      contourRange.low.addInPlace(this._direction);\n      contourRange.high.addInPlace(this._direction);\n    }\n    rangeToExtend.extendRange(contourRange);\n  }\n  /**\n   * @return true if this is a closed volume.\n   */\n  public get isClosedVolume(): boolean {\n    return this.capped && this._contour.curves.isAnyRegionType;\n  }\n}\n"]}
+{"version":3,"file":"LinearSweep.js","sourceRoot":"","sources":["../../../src/solid/LinearSweep.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAS/F,wDAAqD;AACrD,wCAAqC;AACrC,wCAAqC;AAErC,mEAAyD;AACzD,yDAAsD;AAEtD,uDAAoD;AAEpD,qDAAkD;AAClD,iDAA8C;AAE9C;;;;;GAKG;AACH,MAAa,WAAY,SAAQ,+BAAc;IAC7C,wCAAwC;IACxB,kBAAkB,GAAG,aAAa,CAAC;IAE3C,QAAQ,CAAe;IACvB,UAAU,CAAW;IAE7B,YAAoB,OAAqB,EAAE,SAAmB,EAAE,MAAe;QAC7E,KAAK,CAAC,MAAM,CAAC,CAAC;QACd,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;QACxB,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;IAC9B,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,MAAM,CAAC,OAAiB,EAAE,SAAmB,EAAE,MAAe;QAC1E,MAAM,SAAS,GAAG,2BAAY,CAAC,oBAAoB,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;QACxE,IAAI,CAAC,SAAS;YACZ,OAAO,SAAS,CAAC;QACnB,OAAO,IAAI,WAAW,CAAC,SAAS,EAAE,SAAS,EAAE,MAAM,CAAC,CAAC;IACvD,CAAC;IACD;;;;;;;;;;OAUG;IACI,MAAM,CAAC,YAAY,CAAC,QAAiB,EAAE,CAAS,EAAE,MAAc,EAAE,MAAe;QACtF,MAAM,GAAG,GAAG,2BAAY,CAAC,QAAQ,CAAC,QAAQ,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC;QACvD,IAAI,MAAM,EAAE,CAAC;YACX,GAAG,CAAC,eAAe,EAAE,CAAC;YACtB,MAAM,IAAI,GAAG,uBAAU,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAC3C,IAAI,IAAI,GAAG,MAAM,GAAG,GAAG;gBACrB,GAAG,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;QACzB,CAAC;QACD,MAAM,OAAO,GAAoB,MAAM,CAAC,CAAC,CAAC,WAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,WAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAC9E,OAAO,WAAW,CAAC,MAAM,CAAC,OAAO,EAAE,0BAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,EAAE,MAAM,CAAC,CAAC;IAC5E,CAAC;IACD,0CAA0C;IACnC,YAAY,KAAsB,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC;IACvE,6EAA6E;IACtE,kBAAkB,KAAmB,OAAO,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;IACnE,yCAAyC;IAClC,gBAAgB,KAAe,OAAO,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IACvE,2DAA2D;IACpD,mBAAmB,CAAC,KAAU,IAAa,OAAO,KAAK,YAAY,WAAW,CAAC,CAAC,CAAC;IACxF,0BAA0B;IACnB,KAAK;QACV,OAAO,IAAI,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,EAAE,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;IACtF,CAAC;IACD;;;OAGG;IACI,mBAAmB,CAAC,SAAoB;QAC7C,IAAI,SAAS,CAAC,MAAM,CAAC,UAAU,EAAE;YAC/B,OAAO,KAAK,CAAC;QACf,IAAI,IAAI,CAAC,QAAQ,CAAC,mBAAmB,CAAC,SAAS,CAAC,EAAE,CAAC;YACjD,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;YAC3D,OAAO,IAAI,CAAC;QACd,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;OAIG;IACI,oBAAoB;QACzB,OAAO,IAAI,CAAC,QAAQ,CAAC,YAAY,CAAC,UAAU,EAAE,CAAC;IACjD,CAAC;IACD;;;OAGG;IACI,gBAAgB,CAAC,SAAoB;QAC1C,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;QAC5B,OAAO,MAAM,CAAC,mBAAmB,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC;IACpE,CAAC;IACD,uDAAuD;IACvC,aAAa,CAAC,KAAoB;QAChD,IAAI,KAAK,YAAY,WAAW,EAAE,CAAC;YACjC,OAAO,IAAI,CAAC,QAAQ,CAAC,aAAa,CAAC,KAAK,CAAC,QAAQ,CAAC;mBAC7C,IAAI,CAAC,UAAU,CAAC,aAAa,CAAC,KAAK,CAAC,UAAU,CAAC;mBAC/C,IAAI,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM,CAAC;QACpC,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,8DAA8D;IACvD,yBAAyB,CAAC,OAAwB;QACvD,OAAO,OAAO,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;IACzC,CAAC;IACD;;;OAGG;IACI,gBAAgB,CAAC,SAAiB;QACvC,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;QAC7C,IAAI,OAAO,IAAI,SAAS,KAAK,GAAG;YAC9B,OAAO,CAAC,mBAAmB,CAAC,qBAAS,CAAC,iBAAiB,CAAC,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;QAC7F,OAAO,OAAO,CAAC;IACjB,CAAC;IACD,uDAAuD;IAChD,WAAW,CAAC,aAAsB,EAAE,SAAqB;QAC9D,MAAM,YAAY,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC;QAC3D,aAAa,CAAC,WAAW,CAAC,YAAY,CAAC,CAAC;QACxC,IAAI,SAAS,EAAE,CAAC;YACd,MAAM,oBAAoB,GAAG,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YACvE,YAAY,CAAC,GAAG,CAAC,UAAU,CAAC,oBAAoB,CAAC,CAAC;YAClD,YAAY,CAAC,IAAI,CAAC,UAAU,CAAC,oBAAoB,CAAC,CAAC;QACrD,CAAC;aAAM,CAAC;YACN,YAAY,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YAC7C,YAAY,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAChD,CAAC;QACD,aAAa,CAAC,WAAW,CAAC,YAAY,CAAC,CAAC;IAC1C,CAAC;IACD;;OAEG;IACH,IAAW,cAAc;QACvB,OAAO,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,eAAe,CAAC;IAC7D,CAAC;CACF;AAnID,kCAmIC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n\n/** @packageDocumentation\n * @module Solid\n */\n\nimport { AnyCurve } from \"../curve/CurveTypes\";\nimport { CurveCollection } from \"../curve/CurveCollection\";\nimport { GeometryQuery } from \"../curve/GeometryQuery\";\nimport { LineString3d } from \"../curve/LineString3d\";\nimport { Loop } from \"../curve/Loop\";\nimport { Path } from \"../curve/Path\";\nimport { GeometryHandler } from \"../geometry3d/GeometryHandler\";\nimport { Vector3d } from \"../geometry3d/Point3dVector3d\";\nimport { PolygonOps } from \"../geometry3d/PolygonOps\";\nimport { Range3d } from \"../geometry3d/Range\";\nimport { Transform } from \"../geometry3d/Transform\";\nimport { XAndY } from \"../geometry3d/XYZProps\";\nimport { SolidPrimitive } from \"./SolidPrimitive\";\nimport { SweepContour } from \"./SweepContour\";\n\n/**\n * A LinearSweep is a `SolidPrimitive` defined by:\n * * A set of curves (any Loop, Path, or parityRegion). If the object is \"capped\", the curves must be planar.\n * * A sweep vector\n * @public\n */\nexport class LinearSweep extends SolidPrimitive {\n  /** String name for schema properties */\n  public readonly solidPrimitiveType = \"linearSweep\";\n\n  private _contour: SweepContour;\n  private _direction: Vector3d;\n\n  private constructor(contour: SweepContour, direction: Vector3d, capped: boolean) {\n    super(capped);\n    this._contour = contour;\n    this._direction = direction;\n  }\n  /**\n   * Create a sweep of a starting contour.\n   * @param contour contour to be swept, CAPTURED\n   * @param direction sweep vector.  The contour is swept the full length of the vector.\n   * @param capped true to include end caps\n   */\n  public static create(contour: AnyCurve, direction: Vector3d, capped: boolean): LinearSweep | undefined {\n    const sweepable = SweepContour.createForLinearSweep(contour, direction);\n    if (!sweepable)\n      return undefined;\n    return new LinearSweep(sweepable, direction, capped);\n  }\n  /** Create a z-direction sweep of the polyline or polygon given as xy linestring values.\n   * * If not capped, the xyPoints array is always used unchanged.\n   * * If capped but the xyPoints array does not close, exact closure will be enforced by one of these:\n   * * * If the final point is almost equal to the first, it is replaced by the exact first point.\n   * * * if the final point is not close to the first an extra point is added.\n   * * If capped, the point order will be reversed if necessary to produce positive volume.\n   * @param xyPoints array of xy coordinates\n   * @param z z value to be used for all coordinates\n   * @param zSweep the sweep distance in the z direction.\n   * @param capped true if caps are to be added.\n   */\n  public static createZSweep(xyPoints: XAndY[], z: number, zSweep: number, capped: boolean): LinearSweep | undefined {\n    const xyz = LineString3d.createXY(xyPoints, z, capped);\n    if (capped) {\n      xyz.addClosurePoint();\n      const area = PolygonOps.areaXY(xyz.points);\n      if (area * zSweep < 0.0)\n        xyz.points.reverse();\n    }\n    const contour: CurveCollection = capped ? Loop.create(xyz) : Path.create(xyz);\n    return LinearSweep.create(contour, Vector3d.create(0, 0, zSweep), capped);\n  }\n  /** get a reference to the swept curves */\n  public getCurvesRef(): CurveCollection { return this._contour.curves; }\n  /** Get a reference to the `SweepContour` carrying the plane of the curves */\n  public getSweepContourRef(): SweepContour { return this._contour; }\n  /** return a clone of the sweep vector */\n  public cloneSweepVector(): Vector3d { return this._direction.clone(); }\n  /** Test if `other` is also an instance of `LinearSweep` */\n  public isSameGeometryClass(other: any): boolean { return other instanceof LinearSweep; }\n  /** Return a deep clone */\n  public clone(): LinearSweep {\n    return new LinearSweep(this._contour.clone(), this._direction.clone(), this.capped);\n  }\n  /**\n   * Apply a transform to the curves and sweep vector\n   * * This fails if the transformation is singular.\n   */\n  public tryTransformInPlace(transform: Transform): boolean {\n    if (transform.matrix.isSingular())\n      return false;\n    if (this._contour.tryTransformInPlace(transform)) {\n      transform.multiplyVector(this._direction, this._direction);\n      return true;\n    }\n    return false;\n  }\n\n  /** Return a coordinate frame (right handed unit vectors)\n   * * origin on base contour\n   * * x, y directions from base contour.\n   * * z direction perpendicular\n   */\n  public getConstructiveFrame(): Transform | undefined {\n    return this._contour.localToWorld.cloneRigid();\n  }\n  /**\n   * Return a transformed clone.\n   * * This fails if the transformation is singular.\n   */\n  public cloneTransformed(transform: Transform): LinearSweep | undefined {\n    const result = this.clone();\n    return result.tryTransformInPlace(transform) ? result : undefined;\n  }\n  /** Test for near-equality of coordinates in `other` */\n  public override isAlmostEqual(other: GeometryQuery): boolean {\n    if (other instanceof LinearSweep) {\n      return this._contour.isAlmostEqual(other._contour)\n        && this._direction.isAlmostEqual(other._direction)\n        && this.capped === other.capped;\n    }\n    return false;\n  }\n  /** Invoke strongly typed `handler.handleLinearSweep(this)` */\n  public dispatchToGeometryHandler(handler: GeometryHandler): any {\n    return handler.handleLinearSweep(this);\n  }\n  /**\n   * Return the curves at a fraction along the sweep direction.\n   * @param vFraction fractional position along the sweep direction\n   */\n  public constantVSection(vFraction: number): CurveCollection | undefined {\n    const section = this._contour.curves.clone();\n    if (section && vFraction !== 0.0)\n      section.tryTransformInPlace(Transform.createTranslation(this._direction.scale(vFraction)));\n    return section;\n  }\n  /** Extend `rangeToExtend` to include this geometry. */\n  public extendRange(rangeToExtend: Range3d, transform?: Transform) {\n    const contourRange = this._contour.curves.range(transform);\n    rangeToExtend.extendRange(contourRange);\n    if (transform) {\n      const transformedDirection = transform.multiplyVector(this._direction);\n      contourRange.low.addInPlace(transformedDirection);\n      contourRange.high.addInPlace(transformedDirection);\n    } else {\n      contourRange.low.addInPlace(this._direction);\n      contourRange.high.addInPlace(this._direction);\n    }\n    rangeToExtend.extendRange(contourRange);\n  }\n  /**\n   * @return true if this is a closed volume.\n   */\n  public get isClosedVolume(): boolean {\n    return this.capped && this._contour.curves.isAnyRegionType;\n  }\n}\n"]}

package/lib/cjs/solid/RotationalSweep.d.ts

@@ -12,8 +12,8 @@ import { Transform } from "../geometry3d/Transform";
 import { SolidPrimitive } from "./SolidPrimitive";
 import { SweepContour } from "./SweepContour";
 /**
- * A RotationalSweep is
- * * A planar contour (any Loop, Path, or parityRegion).
+ * A RotationalSweep is:
+ * * A planar contour (any Loop, Path, or parityRegion)
  * * An axis vector.
  *   * The planar contour is expected to be in the plane of the axis vector.
  *   * The contour may have points and/or lines that are on the axis, but otherwise is entirely on one side of the axis.

package/lib/cjs/solid/RotationalSweep.js

@@ -13,8 +13,8 @@ const Transform_1 = require("../geometry3d/Transform");
 const SolidPrimitive_1 = require("./SolidPrimitive");
 const SweepContour_1 = require("./SweepContour");
 /**
- * A RotationalSweep is
- * * A planar contour (any Loop, Path, or parityRegion).
+ * A RotationalSweep is:
+ * * A planar contour (any Loop, Path, or parityRegion)
  * * An axis vector.
  *   * The planar contour is expected to be in the plane of the axis vector.
  *   * The contour may have points and/or lines that are on the axis, but otherwise is entirely on one side of the axis.

package/lib/cjs/solid/RotationalSweep.js.map

@@ -1 +1 @@
-{"version":3,"file":"RotationalSweep.js","sourceRoot":"","sources":["../../../src/solid/RotationalSweep.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAS/F,0DAAuD;AACvD,0CAAkD;AAClD,+CAA4C;AAE5C,qDAAkD;AAGlD,uDAAoD;AACpD,qDAAkD;AAClD,iDAA8C;AAE9C;;;;;;;;GAQG;AACH,MAAa,eAAgB,SAAQ,+BAAc;IACjD,wCAAwC;IACxB,kBAAkB,GAAG,iBAAiB,CAAC;IAE/C,QAAQ,CAAe;IACvB,eAAe,CAAQ;IACvB,WAAW,CAAQ;IAC3B,YAAoB,OAAqB,EAAE,cAAqB,EAAE,UAAiB,EAAE,MAAe;QAClG,KAAK,CAAC,MAAM,CAAC,CAAC;QACd,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;QACxB,IAAI,CAAC,eAAe,GAAG,cAAc,CAAC;QACtC,IAAI,CAAC,WAAW,GAAG,UAAU,CAAC;IAChC,CAAC;IACD;;;;;;OAMG;IACI,MAAM,CAAC,MAAM,CAAC,OAAiB,EAAE,IAAW,EAAE,UAAiB,EAAE,MAAe;QACrF,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,gBAAgB,EAAE;YACpC,OAAO,SAAS,CAAC;QACnB,MAAM,SAAS,GAAG,2BAAY,CAAC,iBAAiB,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;QAChE,IAAI,CAAC,SAAS;YACZ,OAAO,SAAS,CAAC;QACnB,OAAO,IAAI,eAAe,CAAC,SAAS,EAAE,IAAI,EAAE,UAAU,CAAC,KAAK,EAAE,EAAE,MAAM,CAAC,CAAC;IAC1E,CAAC;IACD;;;;;OAKG;IACI,oBAAoB;QACzB,MAAM,oBAAoB,GAAG,IAAI,CAAC,QAAQ,CAAC,YAAY,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;QACzE,MAAM,IAAI,GAAG,mBAAQ,CAAC,sBAAsB,CAAC,oBAAoB,EAAE,IAAI,CAAC,eAAe,CAAC,SAAS,EAAE,oBAAS,CAAC,GAAG,CAAC,CAAC;QAClH,IAAI,IAAI,EAAE,CAAC;YACT,OAAO,qBAAS,CAAC,qBAAqB,CAAC,IAAI,CAAC,eAAe,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QAC5E,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,0DAA0D;IACnD,YAAY;QACjB,OAAO,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE,CAAC;IACtC,CAAC;IACD,8CAA8C;IACvC,SAAS;QACd,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;IAC9B,CAAC;IACD,2EAA2E;IACpE,kBAAkB;QACvB,OAAO,IAAI,CAAC,QAAQ,CAAC;IACvB,CAAC;IACD,8BAA8B;IACvB,QAAQ;QACb,OAAO,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC;IAClC,CAAC;IACD,6CAA6C;IACtC,mBAAmB,CAAC,KAAU;QACnC,OAAO,KAAK,YAAY,eAAe,CAAC;IAC1C,CAAC;IACD,uDAAuD;IACvC,aAAa,CAAC,KAAoB;QAChD,IAAI,KAAK,YAAY,eAAe,EAAE,CAAC;YACrC,OAAO,IAAI,CAAC,QAAQ,CAAC,aAAa,CAAC,KAAK,CAAC,QAAQ,CAAC;mBAC7C,IAAI,CAAC,eAAe,CAAC,aAAa,CAAC,KAAK,CAAC,eAAe,CAAC;mBACzD,IAAI,CAAC,WAAW,CAAC,aAAa,CAAC,KAAK,CAAC,WAAW,CAAC;mBACjD,IAAI,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM,CAAC;QACpC,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,0BAA0B;IACnB,KAAK;QACV,OAAO,IAAI,eAAe,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,EAAE,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE,EAAE,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;IACzH,CAAC;IACD;;;OAGG;IACI,mBAAmB,CAAC,SAAoB;QAC7C,IAAI,SAAS,CAAC,MAAM,CAAC,UAAU,EAAE;YAC/B,OAAO,KAAK,CAAC;QACf,IAAI,IAAI,CAAC,QAAQ,CAAC,mBAAmB,CAAC,SAAS,CAAC,EAAE,CAAC;YACjD,IAAI,CAAC,eAAe,CAAC,gBAAgB,CAAC,SAAS,CAAC,CAAC;YACjD,IAAI,SAAS,CAAC,MAAM,CAAC,WAAW,EAAE,GAAG,GAAG;gBACtC,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;YACzD,OAAO,IAAI,CAAC,eAAe,CAAC,SAAS,CAAC,gBAAgB,EAAE,CAAC;QAC3D,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;OAGG;IACI,gBAAgB,CAAC,SAAoB;QAC1C,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;QAC5B,OAAO,MAAM,CAAC,mBAAmB,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC;IACpE,CAAC;IACD,gFAAgF;IACzE,yBAAyB,CAAC,OAAwB;QACvD,OAAO,OAAO,CAAC,qBAAqB,CAAC,IAAI,CAAC,CAAC;IAC7C,CAAC;IACD,mGAAmG;IAC5F,8BAA8B,CAAC,SAAiB,EAAE,MAAkB;QACzE,MAAM,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC,OAAO,GAAG,SAAS,CAAC;QACrD,MAAM,QAAQ,GAAG,qBAAS,CAAC,yBAAyB,CAAC,IAAI,CAAC,eAAe,CAAC,MAAM,EAC9E,mBAAQ,CAAC,0BAA0B,CAAC,IAAI,CAAC,eAAe,CAAC,SAAS,EAAE,aAAK,CAAC,aAAa,CAAC,OAAO,CAAC,EAC9F,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAa,CAAC,CAAC;QACrD,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD;;;OAGG;IACI,gBAAgB,CAAC,SAAiB;QACvC,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;QAC7C,IAAI,OAAO,EAAE,CAAC;YACZ,OAAO,CAAC,mBAAmB,CAAC,IAAI,CAAC,8BAA8B,CAAC,SAAS,CAAC,CAAC,CAAC;QAC9E,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IACD,wDAAwD;IACjD,WAAW,CAAC,KAAc,EAAE,SAAqB;QACtD,MAAM,UAAU,GAAG,GAAG,GAAG,EAAE,CAAC;QAC5B,MAAM,OAAO,GAAG,6BAAa,CAAC,eAAe,EAAE,CAAC;QAChD,OAAO,CAAC,QAAQ,GAAG,aAAK,CAAC,aAAa,CAAC,UAAU,CAAC,CAAC;QACnD,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC;QAC3D,MAAM,OAAO,GAAG,mBAAQ,CAAC,SAAS,CAAC,UAAU,EAAE,IAAI,CAAC,WAAW,CAAC,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;QAChF,MAAM,aAAa,GAAG,qBAAS,CAAC,cAAc,EAAE,CAAC;QACjD,IAAI,SAAS,EAAE,CAAC;YACd,MAAM,kBAAkB,GAAG,qBAAS,CAAC,cAAc,EAAE,CAAC;YACtD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;gBAClC,SAAS,CAAC,0BAA0B,CAClC,IAAI,CAAC,8BAA8B,CAAC,CAAC,GAAG,OAAO,EAAE,aAAa,CAAC,EAAE,kBAAkB,CACpF,CAAC;gBACF,OAAO,CAAC,WAAW,CAAC,KAAK,EAAE,kBAAkB,CAAC,CAAC;YACjD,CAAC;QACH,CAAC;aAAM,CAAC;YACN,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,OAAO,EAAE,CAAC,EAAE;gBAC/B,OAAO,CAAC,WAAW,CAAC,KAAK,EAAE,IAAI,CAAC,8BAA8B,CAAC,CAAC,GAAG,OAAO,EAAE,aAAa,CAAC,CAAC,CAAC;QAChG,CAAC;IACH,CAAC;IACD,kDAAkD;IAClD,IAAW,cAAc;QACvB,OAAO,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,WAAW,CAAC,YAAY,CAAC;IACtD,CAAC;CACF;AAnJD,0CAmJC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n\n/** @packageDocumentation\n * @module Solid\n */\n\nimport { AnyCurve } from \"../curve/CurveTypes\";\nimport { CurveCollection } from \"../curve/CurveCollection\";\nimport { GeometryQuery } from \"../curve/GeometryQuery\";\nimport { StrokeOptions } from \"../curve/StrokeOptions\";\nimport { AxisOrder, Geometry } from \"../Geometry\";\nimport { Angle } from \"../geometry3d/Angle\";\nimport { GeometryHandler } from \"../geometry3d/GeometryHandler\";\nimport { Matrix3d } from \"../geometry3d/Matrix3d\";\nimport { Range3d } from \"../geometry3d/Range\";\nimport { Ray3d } from \"../geometry3d/Ray3d\";\nimport { Transform } from \"../geometry3d/Transform\";\nimport { SolidPrimitive } from \"./SolidPrimitive\";\nimport { SweepContour } from \"./SweepContour\";\n\n/**\n * A RotationalSweep is\n * * A planar contour (any Loop, Path, or parityRegion).\n * * An axis vector.\n *   * The planar contour is expected to be in the plane of the axis vector.\n *   * The contour may have points and/or lines that are on the axis, but otherwise is entirely on one side of the axis.\n * * A sweep angle.\n * @public\n */\nexport class RotationalSweep extends SolidPrimitive {\n  /** String name for schema properties */\n  public readonly solidPrimitiveType = \"rotationalSweep\";\n\n  private _contour: SweepContour;\n  private _normalizedAxis: Ray3d;\n  private _sweepAngle: Angle;\n  private constructor(contour: SweepContour, normalizedAxis: Ray3d, sweepAngle: Angle, capped: boolean) {\n    super(capped);\n    this._contour = contour;\n    this._normalizedAxis = normalizedAxis;\n    this._sweepAngle = sweepAngle;\n  }\n  /**\n   * Create a rotational sweep.\n   * @param contour profile to sweep, coplanar with axis (CAPTURED).\n   * @param axis rotation axis.\n   * @param sweepAngle signed angular sweep.\n   * @param capped whether to cap the surface to make a solid.\n   */\n  public static create(contour: AnyCurve, axis: Ray3d, sweepAngle: Angle, capped: boolean): RotationalSweep | undefined {\n    if (!axis.direction.normalizeInPlace())\n      return undefined;\n    const sweepable = SweepContour.createForRotation(contour, axis);\n    if (!sweepable)\n      return undefined;\n    return new RotationalSweep(sweepable, axis, sweepAngle.clone(), capped);\n  }\n  /**\n   * Return a coordinate frame (right handed unit vectors).\n   * * origin at origin of rotation ray.\n   * * z direction along the rotation ray.\n   * * y direction perpendicular to the base contour plane.\n   */\n  public getConstructiveFrame(): Transform | undefined {\n    const contourPerpendicular = this._contour.localToWorld.matrix.columnZ();\n    const axes = Matrix3d.createRigidFromColumns(contourPerpendicular, this._normalizedAxis.direction, AxisOrder.YZX);\n    if (axes) {\n      return Transform.createOriginAndMatrix(this._normalizedAxis.origin, axes);\n    }\n    return undefined;\n  }\n  /** Return clone of (not reference to) the axis vector. */\n  public cloneAxisRay(): Ray3d {\n    return this._normalizedAxis.clone();\n  }\n  /** Return (REFERENCE TO) the swept curves. */\n  public getCurves(): CurveCollection {\n    return this._contour.curves;\n  }\n  /** Return (REFERENCE TO) the swept curves with containing plane markup. */\n  public getSweepContourRef(): SweepContour {\n    return this._contour;\n  }\n  /** Return the sweep angle. */\n  public getSweep(): Angle {\n    return this._sweepAngle.clone();\n  }\n  /** Test if `other` is a `RotationalSweep` */\n  public isSameGeometryClass(other: any): boolean {\n    return other instanceof RotationalSweep;\n  }\n  /** Test for same axis, capping, and swept geometry. */\n  public override isAlmostEqual(other: GeometryQuery): boolean {\n    if (other instanceof RotationalSweep) {\n      return this._contour.isAlmostEqual(other._contour)\n        && this._normalizedAxis.isAlmostEqual(other._normalizedAxis)\n        && this._sweepAngle.isAlmostEqual(other._sweepAngle)\n        && this.capped === other.capped;\n    }\n    return false;\n  }\n  /** Return a deep clone */\n  public clone(): RotationalSweep {\n    return new RotationalSweep(this._contour.clone(), this._normalizedAxis.clone(), this._sweepAngle.clone(), this.capped);\n  }\n  /**\n   * Transform the contour and axis.\n   * * This fails if the transformation is singular.\n   */\n  public tryTransformInPlace(transform: Transform): boolean {\n    if (transform.matrix.isSingular())\n      return false;\n    if (this._contour.tryTransformInPlace(transform)) {\n      this._normalizedAxis.transformInPlace(transform);\n      if (transform.matrix.determinant() < 0.0)\n        this._sweepAngle.setRadians(-this._sweepAngle.radians);\n      return this._normalizedAxis.direction.normalizeInPlace();\n    }\n    return false;\n  }\n  /**\n   * Return a transformed clone.\n   * * This fails if the transformation is singular.\n   */\n  public cloneTransformed(transform: Transform): RotationalSweep | undefined {\n    const result = this.clone();\n    return result.tryTransformInPlace(transform) ? result : undefined;\n  }\n  /** Dispatch to strongly typed handler `handler.handleRotationalSweep(this)`. */\n  public dispatchToGeometryHandler(handler: GeometryHandler): any {\n    return handler.handleRotationalSweep(this);\n  }\n  /** Return a transform that rotates around the rotational axis by a fraction of the total sweep. */\n  public getFractionalRotationTransform(vFraction: number, result?: Transform): Transform {\n    const radians = this._sweepAngle.radians * vFraction;\n    const rotation = Transform.createFixedPointAndMatrix(this._normalizedAxis.origin,\n      Matrix3d.createRotationAroundVector(this._normalizedAxis.direction, Angle.createRadians(radians),\n        result ? result.matrix : undefined) as Matrix3d);\n    return rotation;\n  }\n  /**\n   * Return the curves of a constant-v section of the solid.\n   * @param vFraction fractional position along the sweep direction\n   */\n  public constantVSection(vFraction: number): CurveCollection | undefined {\n    const section = this._contour.curves.clone();\n    if (section) {\n      section.tryTransformInPlace(this.getFractionalRotationTransform(vFraction));\n    }\n    return section;\n  }\n  /** Extend range using sampled points on the surface. */\n  public extendRange(range: Range3d, transform?: Transform) {\n    const degreeStep = 360 / 32;\n    const options = StrokeOptions.createForCurves();\n    options.angleTol = Angle.createDegrees(degreeStep);\n    const strokes = this._contour.curves.cloneStroked(options);\n    const numStep = Geometry.stepCount(degreeStep, this._sweepAngle.degrees, 4, 32);\n    const stepTransform = Transform.createIdentity();\n    if (transform) {\n      const compositeTransform = Transform.createIdentity();\n      for (let i = 0; i <= numStep; i++) {\n        transform.multiplyTransformTransform(\n          this.getFractionalRotationTransform(i / numStep, stepTransform), compositeTransform,\n        );\n        strokes.extendRange(range, compositeTransform);\n      }\n    } else {\n      for (let i = 0; i <= numStep; i++)\n        strokes.extendRange(range, this.getFractionalRotationTransform(i / numStep, stepTransform));\n    }\n  }\n  /** Specify if the sweep forms a closed volume. */\n  public get isClosedVolume(): boolean {\n    return this.capped || this._sweepAngle.isFullCircle;\n  }\n}\n"]}
+{"version":3,"file":"RotationalSweep.js","sourceRoot":"","sources":["../../../src/solid/RotationalSweep.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAS/F,0DAAuD;AACvD,0CAAkD;AAClD,+CAA4C;AAE5C,qDAAkD;AAGlD,uDAAoD;AACpD,qDAAkD;AAClD,iDAA8C;AAE9C;;;;;;;;GAQG;AACH,MAAa,eAAgB,SAAQ,+BAAc;IACjD,wCAAwC;IACxB,kBAAkB,GAAG,iBAAiB,CAAC;IAE/C,QAAQ,CAAe;IACvB,eAAe,CAAQ;IACvB,WAAW,CAAQ;IAC3B,YAAoB,OAAqB,EAAE,cAAqB,EAAE,UAAiB,EAAE,MAAe;QAClG,KAAK,CAAC,MAAM,CAAC,CAAC;QACd,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;QACxB,IAAI,CAAC,eAAe,GAAG,cAAc,CAAC;QACtC,IAAI,CAAC,WAAW,GAAG,UAAU,CAAC;IAChC,CAAC;IACD;;;;;;OAMG;IACI,MAAM,CAAC,MAAM,CAAC,OAAiB,EAAE,IAAW,EAAE,UAAiB,EAAE,MAAe;QACrF,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,gBAAgB,EAAE;YACpC,OAAO,SAAS,CAAC;QACnB,MAAM,SAAS,GAAG,2BAAY,CAAC,iBAAiB,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;QAChE,IAAI,CAAC,SAAS;YACZ,OAAO,SAAS,CAAC;QACnB,OAAO,IAAI,eAAe,CAAC,SAAS,EAAE,IAAI,EAAE,UAAU,CAAC,KAAK,EAAE,EAAE,MAAM,CAAC,CAAC;IAC1E,CAAC;IACD;;;;;OAKG;IACI,oBAAoB;QACzB,MAAM,oBAAoB,GAAG,IAAI,CAAC,QAAQ,CAAC,YAAY,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;QACzE,MAAM,IAAI,GAAG,mBAAQ,CAAC,sBAAsB,CAAC,oBAAoB,EAAE,IAAI,CAAC,eAAe,CAAC,SAAS,EAAE,oBAAS,CAAC,GAAG,CAAC,CAAC;QAClH,IAAI,IAAI,EAAE,CAAC;YACT,OAAO,qBAAS,CAAC,qBAAqB,CAAC,IAAI,CAAC,eAAe,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QAC5E,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,0DAA0D;IACnD,YAAY;QACjB,OAAO,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE,CAAC;IACtC,CAAC;IACD,8CAA8C;IACvC,SAAS;QACd,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;IAC9B,CAAC;IACD,2EAA2E;IACpE,kBAAkB;QACvB,OAAO,IAAI,CAAC,QAAQ,CAAC;IACvB,CAAC;IACD,8BAA8B;IACvB,QAAQ;QACb,OAAO,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC;IAClC,CAAC;IACD,6CAA6C;IACtC,mBAAmB,CAAC,KAAU;QACnC,OAAO,KAAK,YAAY,eAAe,CAAC;IAC1C,CAAC;IACD,uDAAuD;IACvC,aAAa,CAAC,KAAoB;QAChD,IAAI,KAAK,YAAY,eAAe,EAAE,CAAC;YACrC,OAAO,IAAI,CAAC,QAAQ,CAAC,aAAa,CAAC,KAAK,CAAC,QAAQ,CAAC;mBAC7C,IAAI,CAAC,eAAe,CAAC,aAAa,CAAC,KAAK,CAAC,eAAe,CAAC;mBACzD,IAAI,CAAC,WAAW,CAAC,aAAa,CAAC,KAAK,CAAC,WAAW,CAAC;mBACjD,IAAI,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM,CAAC;QACpC,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,0BAA0B;IACnB,KAAK;QACV,OAAO,IAAI,eAAe,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,EAAE,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE,EAAE,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;IACzH,CAAC;IACD;;;OAGG;IACI,mBAAmB,CAAC,SAAoB;QAC7C,IAAI,SAAS,CAAC,MAAM,CAAC,UAAU,EAAE;YAC/B,OAAO,KAAK,CAAC;QACf,IAAI,IAAI,CAAC,QAAQ,CAAC,mBAAmB,CAAC,SAAS,CAAC,EAAE,CAAC;YACjD,IAAI,CAAC,eAAe,CAAC,gBAAgB,CAAC,SAAS,CAAC,CAAC;YACjD,IAAI,SAAS,CAAC,MAAM,CAAC,WAAW,EAAE,GAAG,GAAG;gBACtC,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;YACzD,OAAO,IAAI,CAAC,eAAe,CAAC,SAAS,CAAC,gBAAgB,EAAE,CAAC;QAC3D,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;OAGG;IACI,gBAAgB,CAAC,SAAoB;QAC1C,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;QAC5B,OAAO,MAAM,CAAC,mBAAmB,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC;IACpE,CAAC;IACD,gFAAgF;IACzE,yBAAyB,CAAC,OAAwB;QACvD,OAAO,OAAO,CAAC,qBAAqB,CAAC,IAAI,CAAC,CAAC;IAC7C,CAAC;IACD,mGAAmG;IAC5F,8BAA8B,CAAC,SAAiB,EAAE,MAAkB;QACzE,MAAM,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC,OAAO,GAAG,SAAS,CAAC;QACrD,MAAM,QAAQ,GAAG,qBAAS,CAAC,yBAAyB,CAAC,IAAI,CAAC,eAAe,CAAC,MAAM,EAC9E,mBAAQ,CAAC,0BAA0B,CAAC,IAAI,CAAC,eAAe,CAAC,SAAS,EAAE,aAAK,CAAC,aAAa,CAAC,OAAO,CAAC,EAC9F,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAa,CAAC,CAAC;QACrD,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD;;;OAGG;IACI,gBAAgB,CAAC,SAAiB;QACvC,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;QAC7C,IAAI,OAAO,EAAE,CAAC;YACZ,OAAO,CAAC,mBAAmB,CAAC,IAAI,CAAC,8BAA8B,CAAC,SAAS,CAAC,CAAC,CAAC;QAC9E,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IACD,wDAAwD;IACjD,WAAW,CAAC,KAAc,EAAE,SAAqB;QACtD,MAAM,UAAU,GAAG,GAAG,GAAG,EAAE,CAAC;QAC5B,MAAM,OAAO,GAAG,6BAAa,CAAC,eAAe,EAAE,CAAC;QAChD,OAAO,CAAC,QAAQ,GAAG,aAAK,CAAC,aAAa,CAAC,UAAU,CAAC,CAAC;QACnD,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC;QAC3D,MAAM,OAAO,GAAG,mBAAQ,CAAC,SAAS,CAAC,UAAU,EAAE,IAAI,CAAC,WAAW,CAAC,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;QAChF,MAAM,aAAa,GAAG,qBAAS,CAAC,cAAc,EAAE,CAAC;QACjD,IAAI,SAAS,EAAE,CAAC;YACd,MAAM,kBAAkB,GAAG,qBAAS,CAAC,cAAc,EAAE,CAAC;YACtD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC;gBAClC,SAAS,CAAC,0BAA0B,CAClC,IAAI,CAAC,8BAA8B,CAAC,CAAC,GAAG,OAAO,EAAE,aAAa,CAAC,EAAE,kBAAkB,CACpF,CAAC;gBACF,OAAO,CAAC,WAAW,CAAC,KAAK,EAAE,kBAAkB,CAAC,CAAC;YACjD,CAAC;QACH,CAAC;aAAM,CAAC;YACN,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,OAAO,EAAE,CAAC,EAAE;gBAC/B,OAAO,CAAC,WAAW,CAAC,KAAK,EAAE,IAAI,CAAC,8BAA8B,CAAC,CAAC,GAAG,OAAO,EAAE,aAAa,CAAC,CAAC,CAAC;QAChG,CAAC;IACH,CAAC;IACD,kDAAkD;IAClD,IAAW,cAAc;QACvB,OAAO,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,WAAW,CAAC,YAAY,CAAC;IACtD,CAAC;CACF;AAnJD,0CAmJC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n\n/** @packageDocumentation\n * @module Solid\n */\n\nimport { AnyCurve } from \"../curve/CurveTypes\";\nimport { CurveCollection } from \"../curve/CurveCollection\";\nimport { GeometryQuery } from \"../curve/GeometryQuery\";\nimport { StrokeOptions } from \"../curve/StrokeOptions\";\nimport { AxisOrder, Geometry } from \"../Geometry\";\nimport { Angle } from \"../geometry3d/Angle\";\nimport { GeometryHandler } from \"../geometry3d/GeometryHandler\";\nimport { Matrix3d } from \"../geometry3d/Matrix3d\";\nimport { Range3d } from \"../geometry3d/Range\";\nimport { Ray3d } from \"../geometry3d/Ray3d\";\nimport { Transform } from \"../geometry3d/Transform\";\nimport { SolidPrimitive } from \"./SolidPrimitive\";\nimport { SweepContour } from \"./SweepContour\";\n\n/**\n * A RotationalSweep is:\n * * A planar contour (any Loop, Path, or parityRegion)\n * * An axis vector.\n *   * The planar contour is expected to be in the plane of the axis vector.\n *   * The contour may have points and/or lines that are on the axis, but otherwise is entirely on one side of the axis.\n * * A sweep angle.\n * @public\n */\nexport class RotationalSweep extends SolidPrimitive {\n  /** String name for schema properties */\n  public readonly solidPrimitiveType = \"rotationalSweep\";\n\n  private _contour: SweepContour;\n  private _normalizedAxis: Ray3d;\n  private _sweepAngle: Angle;\n  private constructor(contour: SweepContour, normalizedAxis: Ray3d, sweepAngle: Angle, capped: boolean) {\n    super(capped);\n    this._contour = contour;\n    this._normalizedAxis = normalizedAxis;\n    this._sweepAngle = sweepAngle;\n  }\n  /**\n   * Create a rotational sweep.\n   * @param contour profile to sweep, coplanar with axis (CAPTURED).\n   * @param axis rotation axis.\n   * @param sweepAngle signed angular sweep.\n   * @param capped whether to cap the surface to make a solid.\n   */\n  public static create(contour: AnyCurve, axis: Ray3d, sweepAngle: Angle, capped: boolean): RotationalSweep | undefined {\n    if (!axis.direction.normalizeInPlace())\n      return undefined;\n    const sweepable = SweepContour.createForRotation(contour, axis);\n    if (!sweepable)\n      return undefined;\n    return new RotationalSweep(sweepable, axis, sweepAngle.clone(), capped);\n  }\n  /**\n   * Return a coordinate frame (right handed unit vectors).\n   * * origin at origin of rotation ray.\n   * * z direction along the rotation ray.\n   * * y direction perpendicular to the base contour plane.\n   */\n  public getConstructiveFrame(): Transform | undefined {\n    const contourPerpendicular = this._contour.localToWorld.matrix.columnZ();\n    const axes = Matrix3d.createRigidFromColumns(contourPerpendicular, this._normalizedAxis.direction, AxisOrder.YZX);\n    if (axes) {\n      return Transform.createOriginAndMatrix(this._normalizedAxis.origin, axes);\n    }\n    return undefined;\n  }\n  /** Return clone of (not reference to) the axis vector. */\n  public cloneAxisRay(): Ray3d {\n    return this._normalizedAxis.clone();\n  }\n  /** Return (REFERENCE TO) the swept curves. */\n  public getCurves(): CurveCollection {\n    return this._contour.curves;\n  }\n  /** Return (REFERENCE TO) the swept curves with containing plane markup. */\n  public getSweepContourRef(): SweepContour {\n    return this._contour;\n  }\n  /** Return the sweep angle. */\n  public getSweep(): Angle {\n    return this._sweepAngle.clone();\n  }\n  /** Test if `other` is a `RotationalSweep` */\n  public isSameGeometryClass(other: any): boolean {\n    return other instanceof RotationalSweep;\n  }\n  /** Test for same axis, capping, and swept geometry. */\n  public override isAlmostEqual(other: GeometryQuery): boolean {\n    if (other instanceof RotationalSweep) {\n      return this._contour.isAlmostEqual(other._contour)\n        && this._normalizedAxis.isAlmostEqual(other._normalizedAxis)\n        && this._sweepAngle.isAlmostEqual(other._sweepAngle)\n        && this.capped === other.capped;\n    }\n    return false;\n  }\n  /** Return a deep clone */\n  public clone(): RotationalSweep {\n    return new RotationalSweep(this._contour.clone(), this._normalizedAxis.clone(), this._sweepAngle.clone(), this.capped);\n  }\n  /**\n   * Transform the contour and axis.\n   * * This fails if the transformation is singular.\n   */\n  public tryTransformInPlace(transform: Transform): boolean {\n    if (transform.matrix.isSingular())\n      return false;\n    if (this._contour.tryTransformInPlace(transform)) {\n      this._normalizedAxis.transformInPlace(transform);\n      if (transform.matrix.determinant() < 0.0)\n        this._sweepAngle.setRadians(-this._sweepAngle.radians);\n      return this._normalizedAxis.direction.normalizeInPlace();\n    }\n    return false;\n  }\n  /**\n   * Return a transformed clone.\n   * * This fails if the transformation is singular.\n   */\n  public cloneTransformed(transform: Transform): RotationalSweep | undefined {\n    const result = this.clone();\n    return result.tryTransformInPlace(transform) ? result : undefined;\n  }\n  /** Dispatch to strongly typed handler `handler.handleRotationalSweep(this)`. */\n  public dispatchToGeometryHandler(handler: GeometryHandler): any {\n    return handler.handleRotationalSweep(this);\n  }\n  /** Return a transform that rotates around the rotational axis by a fraction of the total sweep. */\n  public getFractionalRotationTransform(vFraction: number, result?: Transform): Transform {\n    const radians = this._sweepAngle.radians * vFraction;\n    const rotation = Transform.createFixedPointAndMatrix(this._normalizedAxis.origin,\n      Matrix3d.createRotationAroundVector(this._normalizedAxis.direction, Angle.createRadians(radians),\n        result ? result.matrix : undefined) as Matrix3d);\n    return rotation;\n  }\n  /**\n   * Return the curves of a constant-v section of the solid.\n   * @param vFraction fractional position along the sweep direction\n   */\n  public constantVSection(vFraction: number): CurveCollection | undefined {\n    const section = this._contour.curves.clone();\n    if (section) {\n      section.tryTransformInPlace(this.getFractionalRotationTransform(vFraction));\n    }\n    return section;\n  }\n  /** Extend range using sampled points on the surface. */\n  public extendRange(range: Range3d, transform?: Transform) {\n    const degreeStep = 360 / 32;\n    const options = StrokeOptions.createForCurves();\n    options.angleTol = Angle.createDegrees(degreeStep);\n    const strokes = this._contour.curves.cloneStroked(options);\n    const numStep = Geometry.stepCount(degreeStep, this._sweepAngle.degrees, 4, 32);\n    const stepTransform = Transform.createIdentity();\n    if (transform) {\n      const compositeTransform = Transform.createIdentity();\n      for (let i = 0; i <= numStep; i++) {\n        transform.multiplyTransformTransform(\n          this.getFractionalRotationTransform(i / numStep, stepTransform), compositeTransform,\n        );\n        strokes.extendRange(range, compositeTransform);\n      }\n    } else {\n      for (let i = 0; i <= numStep; i++)\n        strokes.extendRange(range, this.getFractionalRotationTransform(i / numStep, stepTransform));\n    }\n  }\n  /** Specify if the sweep forms a closed volume. */\n  public get isClosedVolume(): boolean {\n    return this.capped || this._sweepAngle.isFullCircle;\n  }\n}\n"]}

package/lib/cjs/topology/ChainMerge.d.ts

@@ -110,7 +110,7 @@ export declare class ChainMergeContext {
      * * Return the number of excisions.
      */
     private exciseAndMarkSlingEdges;
-    /** Collect chains which have maximum edge count, broken at an vertex with other than 2 edges.
+    /** Collect chains which have maximum edge count, broken at vertices with more than 2 edges.
      * * This is assumed to be preceded by a call to a vertex-cluster step such as `clusterAndMergeVerticesYXZ`
      */
     collectMaximalChains(): LineString3d[];

package/lib/cjs/topology/ChainMerge.js

@@ -250,7 +250,7 @@ class ChainMergeContext {
         }
         return n;
     }
-    /** Collect chains which have maximum edge count, broken at an vertex with other than 2 edges.
+    /** Collect chains which have maximum edge count, broken at vertices with more than 2 edges.
      * * This is assumed to be preceded by a call to a vertex-cluster step such as `clusterAndMergeVerticesYXZ`
      */
     collectMaximalChains() {

package/lib/cjs/topology/ChainMerge.js.map

@@ -1 +1 @@
-{"version":3,"file":"ChainMerge.js","sourceRoot":"","sources":["../../../src/topology/ChainMerge.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAQ/F,wDAAqD;AACrD,0CAA+D;AAC/D,qEAAkE;AAClE,mEAAkE;AAClE,mCAAgE;AAChE,uCAA6C;AAoB7C,oGAAoG;AACpG,MAAM,iCAAiC;IACrC;;OAEG;IACI,SAAS,CAAS;IACzB;;OAEG;IACK,MAAM,CAAU,4BAA4B,GAAG,0BAAQ,CAAC,MAAM,CAAC,WAAW,EAAE,UAAU,EAAE,aAAa,CAAC,CAAC;IAC/G;;OAEG;IACI,oBAAoB,CAAW;IACtC;;OAEG;IACI,MAAM,CAAC,uBAAuB,CAAC,MAAiB;QACrD,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACzB,MAAM,GAAG,IAAI,CAAC,4BAA4B,CAAC,KAAK,EAAE,CAAC;QACrD,CAAC;QACD,OAAO,MAAM,CAAC,oBAAoB,CAChC,iCAAiC,CAAC,4BAA4B,CAAC,CAAC,EAChE,iCAAiC,CAAC,4BAA4B,CAAC,CAAC,EAChE,iCAAiC,CAAC,4BAA4B,CAAC,CAAC,CAAC,CAAC;IACtE,CAAC;IACD;;;;OAIG;IACH,YAAoB,SAAiB,EAAE,wBAAkC;QACvE,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,oBAAoB,GAAG,wBAAwB,CAAC;IACvD,CAAC;IACD,qCAAqC;IAC9B,MAAM,CAAC,qBAAqB,CAAC,OAAkC;QACpE,MAAM,MAAM,GAAG,IAAI,iCAAiC,CAAC,mBAAQ,CAAC,mBAAmB,EAAE,iCAAiC,CAAC,uBAAuB,EAAE,CAAC,CAAC;QAChJ,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;YAC1B,IAAI,OAAO,CAAC,SAAS,KAAK,SAAS;gBACjC,MAAM,CAAC,SAAS,GAAG,OAAO,CAAC,SAAS,CAAC;YACvC,IAAI,OAAO,CAAC,oBAAoB,KAAK,SAAS;gBAC5C,MAAM,CAAC,oBAAoB,GAAG,iCAAiC,CAAC,uBAAuB,EAAE,CAAC;QAC9F,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,0BAA0B;IACnB,KAAK;QACV,OAAO,IAAI,iCAAiC,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,oBAAoB,CAAC,CAAC;IAC1F,CAAC;;AAEH;;;;;;;;;;;;;;GAcG;AACH,MAAa,iBAAiB;IAEpB,MAAM,CAAgB;IACtB,QAAQ,CAAoC;IAC5C,MAAM,CAA0B;IAChC,cAAc,CAAsB;IAC5C,YAAoB,OAA0C;QAC5D,IAAI,CAAC,MAAM,GAAG,IAAI,qBAAa,EAAE,CAAC;QAClC,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;IAC1B,CAAC;IACD,uEAAuE;IACvE,IAAW,KAAK,CAAC,KAAyC,IAAI,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC;IACpF,+CAA+C;IAC/C,IAAW,KAAK,KAAyC,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IAE9E,uEAAuE;IACvE,IAAW,aAAa,CAAC,KAAqC,IAAI,IAAI,CAAC,cAAc,GAAG,KAAK,CAAC,CAAC,CAAC;IAChG,+CAA+C;IAC/C,IAAW,aAAa,KAAqC,OAAO,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC;IAE1F;;;;;;;;OAQG;IACI,MAAM,CAAC,MAAM,CAAC,OAAkC;QACrD,MAAM,gBAAgB,GAAG,iCAAiC,CAAC,qBAAqB,CAAC,OAAO,CAAC,CAAC;QAC1F,OAAO,IAAI,iBAAiB,CAAC,gBAAgB,CAAC,CAAC;IACjD,CAAC;IACD,2CAA2C;IACpC,UAAU,CAAC,MAAe,EAAE,MAAe;QAChD,IAAI,CAAC,MAAM,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACjG,CAAC;IACD,mDAAmD;IAC5C,qBAAqB,CAAC,IAAqB;QAChD,KAAK,MAAM,OAAO,IAAI,IAAI,EAAE,CAAC;YAC3B,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,SAAS,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC;QACxD,CAAC;IACH,CAAC;IACD;;OAEG;IACI,kBAAkB,CAAC,MAAwB,EAAE,aAAsB,KAAK;QAC7E,IAAI,CAAC,IAAI,CAAC,MAAM;YACd,OAAO;QACT,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QAC1B,IAAI,EAAE,GAAG,UAAU,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5C,IAAI,EAAE,GAAG,MAAM,CAAC,mCAAmC,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QAC/D,IAAI,EAAE,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAI,EAAE,CAAC;QACP,OAAO,EAAE,GAAG,MAAM,CAAC,MAAM,EAAE,EAAE,GAAG,EAAE,EAAE,EAAG,EAAE,GAAG,EAAE,EAAE,CAAC;YAC/C,EAAE,GAAG,MAAM,CAAC,mCAAmC,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;YAC3D,IAAI,mBAAQ,CAAC,qBAAqB,CAAC,EAAE,CAAC,IAAI,mBAAQ,CAAC,qBAAqB,CAAC,EAAE,CAAC;gBAC1E,IAAI,CAAC,MAAM,CAAC,gBAAgB,CAC1B,MAAM,CAAC,yBAAyB,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,yBAAyB,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,yBAAyB,CAAC,EAAE,CAAC,EAAE,CAAC,EACnH,MAAM,CAAC,yBAAyB,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,yBAAyB,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,yBAAyB,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC3H,CAAC;IACH,CAAC;IACD;;;;;OAKG;IACK,cAAc,CAAC,IAAc;QACnC,OAAO,IAAI,CAAC,QAAQ,CAAC,oBAAoB,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;IAClF,CAAC;IACD,+DAA+D;IACvD,MAAM,CAAC,mBAAmB,CAAC,KAAe,EAAE,KAAe;QACjE,OAAO,KAAK,CAAC,QAAS,GAAG,KAAK,CAAC,QAAS,CAAC;IAC3C,CAAC;IACD,gIAAgI;IACxH,MAAM,CAAC,aAAa,CAAC,KAAe;QAC1C,OAAO,KAAK,CAAC,eAAe,KAAK,KAAK,CAAC;IACzC,CAAC;IAED,6IAA6I;IACrI,MAAM,CAAC,qBAAqB,CAAC,KAAe;QAClD,MAAM,KAAK,GAAG,KAAK,CAAC,eAAe,CAAC;QACpC,OAAO,KAAK,KAAK,KAAK,IAAI,KAAK,CAAC,eAAe,KAAK,KAAK,CAAC;IAC5D,CAAC;IAED;;;;OAIG;IACI,0BAA0B;QAC/B,0BAAgB,CAAC,eAAe,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC9C,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,YAAY,EAAE,CAAC;YACzC,CAAC,CAAC,QAAQ,GAAG,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;QACtC,CAAC;QACD,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC;QACnD,SAAS,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,CAAC,iBAAiB,CAAC,mBAAmB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;QACtF,MAAM,YAAY,GAAG,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC;QAC7C,4DAA4D;QAC5D,kEAAkE;QAClE,MAAM,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC;QAC3B,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC;YAC9B,MAAM,KAAK,GAAG,SAAS,CAAC,EAAE,CAAC,CAAC;YAC5B,MAAM,IAAI,GAAG,KAAK,CAAC,QAAS,CAAC;YAC7B,MAAM,IAAI,GAAG,IAAI,GAAG,YAAY,CAAC;YACjC,IAAI,iBAAiB,CAAC,aAAa,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC3C,KAAK,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC;oBACnC,MAAM,KAAK,GAAG,SAAS,CAAC,EAAE,CAAC,CAAC;oBAC5B,IAAI,iBAAiB,CAAC,aAAa,CAAC,KAAK,CAAC,EAAE,CAAC;wBAC3C,IAAI,KAAK,CAAC,QAAS,GAAG,IAAI;4BACxB,MAAM;wBACR,IAAI,KAAK,CAAC,WAAW,CAAC,KAAK,CAAC,IAAI,YAAY,EAAE,CAAC;4BAC7C,gBAAQ,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;4BAC7B,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAI,gCAAgC;wBAC9D,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IACD;;;;OAIG;IACK,uCAAuC,CAAC,MAAsB,EAAE,KAAe,EAAE,SAAuB;QAC9G,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,SAAS,CAAC,EAAE,CAAC;YAChC,MAAM,EAAE,GAAG,2BAAY,CAAC,MAAM,EAAE,CAAC;YACjC,EAAE,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;YAC1C,SAAU,CAAC;gBACT,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;gBACzB,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;gBAClC,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;gBAC5B,EAAE,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;gBAC1C,IAAI,KAAK,CAAC,SAAS,CAAC,SAAS,CAAC,IAAI,CAAC,iBAAiB,CAAC,qBAAqB,CAAC,KAAK,CAAC;oBAC/E,MAAM;YACV,CAAC;YACD,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAClB,CAAC;IACH,CAAC;IACD;;;;OAIG;IACK,2CAA2C,CAAC,MAA0B,EAAE,KAAe,EAAE,SAAuB;QACtH,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,SAAS,CAAC,EAAE,CAAC;YAChC,MAAM,MAAM,GAAG,IAAI,mCAAgB,EAAE,CAAC;YACtC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;YAC1C,SAAU,CAAC;gBACT,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;gBACzB,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;gBAClC,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;gBAC5B,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;gBAC1C,IAAI,KAAK,CAAC,SAAS,CAAC,SAAS,CAAC,IAAI,CAAC,iBAAiB,CAAC,qBAAqB,CAAC,KAAK,CAAC;oBAC/E,MAAM;YACV,CAAC;YACD,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;gBACnB,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACxB,CAAC;IACH,CAAC;IAED;;;;;OAKG;IACK,uBAAuB,CAAC,IAAkB;QAChD,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,YAAY,EAAE,CAAC;YACzC,IAAI,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,SAAS;mBAClD,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC;gBACxB,MAAM,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC;gBACrB,gBAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,iBAAiB,CAAC,CAAC;gBACvC,gBAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,iBAAiB,CAAC,CAAC;gBACvC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;gBAChB,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;gBAChB,CAAC,EAAE,CAAC;YACN,CAAC;QACH,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IACD;;OAEG;IACI,oBAAoB;QACzB,MAAM,MAAM,GAAmB,EAAE,CAAC;QAClC,MAAM,SAAS,GAAG,oBAAY,CAAC,OAAO,CAAC;QACvC,6CAA6C;QAC7C,IAAI,CAAC,uBAAuB,CAAC,SAAS,CAAC,CAAC;QACxC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;QACjC,2FAA2F;QAC3F,yDAAyD;QACzD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,YAAY,EAAE,CAAC;YAC7C,IAAI,CAAC,iBAAiB,CAAC,qBAAqB,CAAC,KAAK,CAAC,EAAE,CAAC;gBACpD,IAAI,CAAC,uCAAuC,CAAC,MAAM,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;YACzE,CAAC;QACH,CAAC;QACD,+CAA+C;QAC/C,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,YAAY,EAAE,CAAC;YAC7C,IAAI,CAAC,uCAAuC,CAAC,MAAM,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;QACzE,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACM,+BAA+B;QACpC,MAAM,MAAM,GAAuB,EAAE,CAAC;QACtC,MAAM,SAAS,GAAG,oBAAY,CAAC,OAAO,CAAC;QACvC,6CAA6C;QAC7C,IAAI,CAAC,uBAAuB,CAAC,SAAS,CAAC,CAAC;QACxC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;QACjC,2FAA2F;QAC3F,yDAAyD;QACzD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,YAAY,EAAE,CAAC;YAC7C,IAAI,CAAC,iBAAiB,CAAC,qBAAqB,CAAC,KAAK,CAAC,EAAE,CAAC;gBACpD,IAAI,CAAC,2CAA2C,CAAC,MAAM,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;YAC7E,CAAC;QACH,CAAC;QACD,+CAA+C;QAC/C,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,YAAY,EAAE,CAAC;YAC7C,IAAI,CAAC,2CAA2C,CAAC,MAAM,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;QAC7E,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;CACF;AAjOD,8CAiOC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n\n/** @packageDocumentation\n * @module Topology\n */\n\nimport { ConvexClipPlaneSet } from \"../clipping/ConvexClipPlaneSet\";\nimport { LineSegment3d } from \"../curve/LineSegment3d\";\nimport { LineString3d } from \"../curve/LineString3d\";\nimport { Geometry, PlaneAltitudeEvaluator } from \"../Geometry\";\nimport { GrowableXYZArray } from \"../geometry3d/GrowableXYZArray\";\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\nimport { HalfEdge, HalfEdgeGraph, HalfEdgeMask } from \"./Graph\";\nimport { HalfEdgeGraphOps } from \"./Merging\";\n\n/**\n * interface containing various options appropriate to merging lines segments into chains.\n * @internal\n */\nexport interface ChainMergeContextOptions {\n  /**\n   * Tolerance for declaring points equal\n   * * Default is `Geometry.smallMetricDistance`\n   */\n  tolerance?: number;\n  /**\n   * Direction for primary sort.\n   * * Default is `Vector3d.create(0.294234298, 0.72391399, 0.45234328798)`\n   * * this vector should NOT be along a principal x,y,z direction.\n   * * The internal form will be normalized.\n   */\n  primarySortDirection?: Vector3d;\n}\n/** Internal form of ChainMergeContextOptions -- same field names, but required to have contents. */\nclass ChainMergeContextValidatedOptions {\n  /**\n   * Tolerance for declaring points equal.\n   */\n  public tolerance: number;\n  /** UNNORMALIZED base vector for sorting.\n   * * Actual vector hoisted into an instance is normalized.\n   */\n  private static readonly _defaultPrimarySortDirection = Vector3d.create(0.294234298, 0.72391399, 0.45234328798);\n  /**\n   * Direction for primary sort.  This is normalized !!!\n   */\n  public primarySortDirection: Vector3d;\n  /** return a unit vector aligned with optional direction.\n   * * Default return is into the first quadrant at a quirky angle so any perpendicular plane is unlikely to hit many points\n   */\n  public static createPrimarySortVector(vector?: Vector3d): Vector3d {\n    if (vector === undefined) {\n      vector = this._defaultPrimarySortDirection.clone();\n    }\n    return vector.normalizeWithDefault(\n      ChainMergeContextValidatedOptions._defaultPrimarySortDirection.x,\n      ChainMergeContextValidatedOptions._defaultPrimarySortDirection.y,\n      ChainMergeContextValidatedOptions._defaultPrimarySortDirection.z);\n  }\n  /**\n   * PRIVATE constructor -- assumes all inputs are validated in public create method !!!!\n   * @param tolerance\n   * @param unitVectorForPrimarySort\n   */\n  private constructor(tolerance: number, unitVectorForPrimarySort: Vector3d) {\n    this.tolerance = tolerance;\n    this.primarySortDirection = unitVectorForPrimarySort;\n  }\n  /** return the default option set. */\n  public static createFromUnValidated(options?: ChainMergeContextOptions): ChainMergeContextValidatedOptions {\n    const result = new ChainMergeContextValidatedOptions(Geometry.smallMetricDistance, ChainMergeContextValidatedOptions.createPrimarySortVector());\n    if (options !== undefined) {\n      if (options.tolerance !== undefined)\n        result.tolerance = options.tolerance;\n      if (options.primarySortDirection !== undefined)\n        result.primarySortDirection = ChainMergeContextValidatedOptions.createPrimarySortVector();\n    }\n    return result;\n  }\n  /** Clone this context. */\n  public clone(): ChainMergeContextValidatedOptions {\n    return new ChainMergeContextValidatedOptions(this.tolerance, this.primarySortDirection);\n  }\n}\n/**\n * * Context for assembling line segments into chains.\n * * Use the context in phases:\n *   * Create the context:   `context = ChainMergeContext.create ()`\n *   * Add line with any combination of:\n *      * `context.addSegment(pointA, pointB)`\n *      * `context.addLineSegment3dArray (segments)`\n *   * Scan all coordinate data for common coordinates.  Twist nodes together to form chains:\n *      * `context.clusterAndMergeVerticesXYZ ()`\n *   * Collect the chains:\n *      * myLinestringArray = context.collectMaximalChains();\n * * The context carries an optional plane which is used by addSegmentsOnPlane\n *\n * @internal\n */\nexport class ChainMergeContext {\n\n  private _graph: HalfEdgeGraph;\n  private _options: ChainMergeContextValidatedOptions;\n  private _plane?: PlaneAltitudeEvaluator;\n  private _convexClipper?: ConvexClipPlaneSet;\n  private constructor(options: ChainMergeContextValidatedOptions) {\n    this._graph = new HalfEdgeGraph();\n    this._options = options;\n  }\n  /** Save a reference plane for later use, e.g. in addSegmentsOnPlane */\n  public set plane(value: PlaneAltitudeEvaluator | undefined) { this._plane = value; }\n  /** Property access for the reference plane. */\n  public get plane(): PlaneAltitudeEvaluator | undefined { return this._plane; }\n\n  /** Save a reference plane for later use, e.g. in addSegmentsOnPlane */\n  public set convexClipper(value: ConvexClipPlaneSet | undefined) { this._convexClipper = value; }\n  /** Property access for the reference plane. */\n  public get convexClipper(): ConvexClipPlaneSet | undefined { return this._convexClipper; }\n\n  /**\n   * * Construct an empty chain merge graph.\n   * * The options parameter may contain any combination of the options values.\n   *   * tolerance = absolute tolerance for declaring points equal.\n   *     * Default is `Geometry.smallMetricDistance`\n   *   * primarySortDirection = direction for first sort.\n   *     * To minimize clash among points on primary sort, this should NOT be perpendicular to any principal plane.\n   *     * The default points into the first octant with non-obvious components.\n   */\n  public static create(options?: ChainMergeContextOptions): ChainMergeContext {\n    const validatedOptions = ChainMergeContextValidatedOptions.createFromUnValidated(options);\n    return new ChainMergeContext(validatedOptions);\n  }\n  /** Add a segment to the evolving graph. */\n  public addSegment(pointA: Point3d, pointB: Point3d) {\n    this._graph.createEdgeXYZXYZ(pointA.x, pointA.y, pointA.z, 0, pointB.x, pointB.y, pointB.z, 0);\n  }\n  /** Add all segments from an array to the graph. */\n  public addLineSegment3dArray(data: LineSegment3d[]) {\n    for (const segment of data) {\n      this.addSegment(segment.point0Ref, segment.point1Ref);\n    }\n  }\n  /** Add edges for all segments that are \"on\" the plane.\n   * * No action if `this.plane` is undefined.\n   */\n  public addSegmentsOnPlane(points: GrowableXYZArray, addClosure: boolean = false) {\n    if (!this._plane)\n      return;\n    const plane = this._plane;\n    let i0 = addClosure ? points.length - 1 : 0;\n    let a0 = points.evaluateUncheckedIndexPlaneAltitude(i0, plane);\n    let i1 = addClosure ? 0 : 1;\n    let a1;\n    for (; i1 < points.length; i0 = i1++ , a0 = a1) {\n      a1 = points.evaluateUncheckedIndexPlaneAltitude(i1, plane);\n      if (Geometry.isSmallMetricDistance(a0) && Geometry.isSmallMetricDistance(a1))\n        this._graph.createEdgeXYZXYZ(\n          points.getXAtUncheckedPointIndex(i0), points.getYAtUncheckedPointIndex(i0), points.getZAtUncheckedPointIndex(i0), 0,\n          points.getXAtUncheckedPointIndex(i1), points.getYAtUncheckedPointIndex(i1), points.getZAtUncheckedPointIndex(i1), 0);\n    }\n  }\n  /**\n   * Return a numeric value to be used for sorting, with little chance widely separated nodes will have identical key.\n   * * Any single x,y,z component is a poor choice because horizontal and vertical alignment is common.\n   * * Hence take dot product of x,y,z with non-trivial fraction values.\n   * @param node node with x,y,z coordinates\n   */\n  private primarySortKey(node: HalfEdge): number {\n    return this._options.primarySortDirection.dotProductXYZ(node.x, node.y, node.z);\n  }\n  /** Return difference of sortData members as sort comparison */\n  private static nodeCompareSortData(nodeA: HalfEdge, nodeB: HalfEdge): number {\n    return nodeA.sortData! - nodeB.sortData!;\n  }\n  /** test if nodeA is a dangling edge end (i.e. edges around vertex equal 1, but detect it without walking all the way around. */\n  private static isIsolatedEnd(nodeA: HalfEdge): boolean {\n    return nodeA.vertexSuccessor === nodeA;\n  }\n\n  /** test if nodeA is at a vertex with exactly 2 edges (i.e. edges around vertex equal w, but detect it without walking all the way around. */\n  private static isChainInteriorVertex(nodeA: HalfEdge): boolean {\n    const nodeB = nodeA.vertexSuccessor;\n    return nodeB !== nodeA && nodeB.vertexSuccessor === nodeA;\n  }\n\n  /**\n   * * isolate all edge ends.\n   * * perform cluster analysis to determine nearly coincident points.\n   * * pinch all edges together at each vertex.\n   */\n  public clusterAndMergeVerticesXYZ() {\n    HalfEdgeGraphOps.isolateAllEdges(this._graph);\n    for (const p of this._graph.allHalfEdges) {\n      p.sortData = this.primarySortKey(p);\n    }\n    const sortArray = this._graph.allHalfEdges.slice();\n    sortArray.sort((nodeA, nodeB) => ChainMergeContext.nodeCompareSortData(nodeA, nodeB));\n    const xyzTolerance = this._options.tolerance;\n    // A node is unvisited if it is its own vertex successor !!!\n    // otherwise the node has already been twisted into a base vertex.\n    const n = sortArray.length;\n    for (let i0 = 0; i0 < n; i0++) {\n      const node0 = sortArray[i0];\n      const qMin = node0.sortData!;\n      const qMax = qMin + xyzTolerance;\n      if (ChainMergeContext.isIsolatedEnd(node0)) {\n        for (let i1 = i0 + 1; i1 < n; i1++) {\n          const node1 = sortArray[i1];\n          if (ChainMergeContext.isIsolatedEnd(node1)) {\n            if (node1.sortData! > qMax)\n              break;\n            if (node0.distanceXYZ(node1) <= xyzTolerance) {\n              HalfEdge.pinch(node0, node1);\n              node1.setXYZFrom(node0);    // force true equal coordinates.\n            }\n          }\n        }\n      }\n    }\n  }\n  /**\n   * If node0 is not visited, creating a linestring with that starting edge and all successive edges along a chain.\n   * @param chains growing array of chains.\n   * @param node0 start node for search.\n   */\n  private collectMaximalLineString3dFromStartNode(chains: LineString3d[], node0: HalfEdge, visitMask: HalfEdgeMask) {\n    if (!node0.isMaskSet(visitMask)) {\n      const ls = LineString3d.create();\n      ls.addPointXYZ(node0.x, node0.y, node0.z);\n      for (; ;) {\n        node0.setMask(visitMask);\n        node0.edgeMate.setMask(visitMask);\n        node0 = node0.faceSuccessor;\n        ls.addPointXYZ(node0.x, node0.y, node0.z);\n        if (node0.isMaskSet(visitMask) || !ChainMergeContext.isChainInteriorVertex(node0))\n          break;\n      }\n      chains.push(ls);\n    }\n  }\n  /**\n   * If node0 is not visited, creating a linestring with that starting edge and all successive edges along a chain.\n   * @param chains growing array of chains.\n   * @param node0 start node for search.\n   */\n  private collectMaximalGrowableXYXArrayFromStartNode(result: GrowableXYZArray[], node0: HalfEdge, visitMask: HalfEdgeMask) {\n    if (!node0.isMaskSet(visitMask)) {\n      const points = new GrowableXYZArray();\n      points.pushXYZ(node0.x, node0.y, node0.z);\n      for (; ;) {\n        node0.setMask(visitMask);\n        node0.edgeMate.setMask(visitMask);\n        node0 = node0.faceSuccessor;\n        points.pushXYZ(node0.x, node0.y, node0.z);\n        if (node0.isMaskSet(visitMask) || !ChainMergeContext.isChainInteriorVertex(node0))\n          break;\n      }\n      if (points.length > 0)\n        result.push(points);\n    }\n  }\n\n  /**\n   * * find edges with start, end in same vertex loop.\n   * * pinch them away from the loop\n   * * set mask on both sides.\n   * * Return the number of excisions.\n   */\n  private exciseAndMarkSlingEdges(mask: HalfEdgeMask): number {\n    let n = 0;\n    for (const p of this._graph.allHalfEdges) {\n      if (p.distanceXYZ(p.edgeMate) < this._options.tolerance\n        && !p.isMaskSet(mask)) {\n        const q = p.edgeMate;\n        HalfEdge.pinch(p, p.vertexPredecessor);\n        HalfEdge.pinch(q, q.vertexPredecessor);\n        p.setMask(mask);\n        q.setMask(mask);\n        n++;\n      }\n    }\n    return n;\n  }\n  /** Collect chains which have maximum edge count, broken at an vertex with other than 2 edges.\n   * * This is assumed to be preceded by a call to a vertex-cluster step such as `clusterAndMergeVerticesYXZ`\n   */\n  public collectMaximalChains(): LineString3d[] {\n    const result: LineString3d[] = [];\n    const visitMask = HalfEdgeMask.VISITED;\n    // Pass 0: excise and mark zero-length edges.\n    this.exciseAndMarkSlingEdges(visitMask);\n    this._graph.clearMask(visitMask);\n    // Pass 1: only start at non-interior edges -- vertices with one edge or more than 2 edges.\n    // (Note that collectMaximalChain checks the visit mask.)\n    for (const node0 of this._graph.allHalfEdges) {\n      if (!ChainMergeContext.isChainInteriorVertex(node0)) {\n        this.collectMaximalLineString3dFromStartNode(result, node0, visitMask);\n      }\n    }\n    // Pass 2: start anywhere in an unvisited loop.\n    for (const node0 of this._graph.allHalfEdges) {\n      this.collectMaximalLineString3dFromStartNode(result, node0, visitMask);\n    }\n    return result;\n  }\n  public collectMaximalGrowableXYZArrays(): GrowableXYZArray[] {\n    const result: GrowableXYZArray[] = [];\n    const visitMask = HalfEdgeMask.VISITED;\n    // Pass 0: excise and mark zero-length edges.\n    this.exciseAndMarkSlingEdges(visitMask);\n    this._graph.clearMask(visitMask);\n    // Pass 1: only start at non-interior edges -- vertices with one edge or more than 2 edges.\n    // (Note that collectMaximalChain checks the visit mask.)\n    for (const node0 of this._graph.allHalfEdges) {\n      if (!ChainMergeContext.isChainInteriorVertex(node0)) {\n        this.collectMaximalGrowableXYXArrayFromStartNode(result, node0, visitMask);\n      }\n    }\n    // Pass 2: start anywhere in an unvisited loop.\n    for (const node0 of this._graph.allHalfEdges) {\n      this.collectMaximalGrowableXYXArrayFromStartNode(result, node0, visitMask);\n    }\n    return result;\n  }\n}\n"]}
+{"version":3,"file":"ChainMerge.js","sourceRoot":"","sources":["../../../src/topology/ChainMerge.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAQ/F,wDAAqD;AACrD,0CAA+D;AAC/D,qEAAkE;AAClE,mEAAkE;AAClE,mCAAgE;AAChE,uCAA6C;AAoB7C,oGAAoG;AACpG,MAAM,iCAAiC;IACrC;;OAEG;IACI,SAAS,CAAS;IACzB;;OAEG;IACK,MAAM,CAAU,4BAA4B,GAAG,0BAAQ,CAAC,MAAM,CAAC,WAAW,EAAE,UAAU,EAAE,aAAa,CAAC,CAAC;IAC/G;;OAEG;IACI,oBAAoB,CAAW;IACtC;;OAEG;IACI,MAAM,CAAC,uBAAuB,CAAC,MAAiB;QACrD,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACzB,MAAM,GAAG,IAAI,CAAC,4BAA4B,CAAC,KAAK,EAAE,CAAC;QACrD,CAAC;QACD,OAAO,MAAM,CAAC,oBAAoB,CAChC,iCAAiC,CAAC,4BAA4B,CAAC,CAAC,EAChE,iCAAiC,CAAC,4BAA4B,CAAC,CAAC,EAChE,iCAAiC,CAAC,4BAA4B,CAAC,CAAC,CAAC,CAAC;IACtE,CAAC;IACD;;;;OAIG;IACH,YAAoB,SAAiB,EAAE,wBAAkC;QACvE,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,oBAAoB,GAAG,wBAAwB,CAAC;IACvD,CAAC;IACD,qCAAqC;IAC9B,MAAM,CAAC,qBAAqB,CAAC,OAAkC;QACpE,MAAM,MAAM,GAAG,IAAI,iCAAiC,CAAC,mBAAQ,CAAC,mBAAmB,EAAE,iCAAiC,CAAC,uBAAuB,EAAE,CAAC,CAAC;QAChJ,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;YAC1B,IAAI,OAAO,CAAC,SAAS,KAAK,SAAS;gBACjC,MAAM,CAAC,SAAS,GAAG,OAAO,CAAC,SAAS,CAAC;YACvC,IAAI,OAAO,CAAC,oBAAoB,KAAK,SAAS;gBAC5C,MAAM,CAAC,oBAAoB,GAAG,iCAAiC,CAAC,uBAAuB,EAAE,CAAC;QAC9F,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,0BAA0B;IACnB,KAAK;QACV,OAAO,IAAI,iCAAiC,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,oBAAoB,CAAC,CAAC;IAC1F,CAAC;;AAEH;;;;;;;;;;;;;;GAcG;AACH,MAAa,iBAAiB;IAEpB,MAAM,CAAgB;IACtB,QAAQ,CAAoC;IAC5C,MAAM,CAA0B;IAChC,cAAc,CAAsB;IAC5C,YAAoB,OAA0C;QAC5D,IAAI,CAAC,MAAM,GAAG,IAAI,qBAAa,EAAE,CAAC;QAClC,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;IAC1B,CAAC;IACD,uEAAuE;IACvE,IAAW,KAAK,CAAC,KAAyC,IAAI,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC,CAAC,CAAC;IACpF,+CAA+C;IAC/C,IAAW,KAAK,KAAyC,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IAE9E,uEAAuE;IACvE,IAAW,aAAa,CAAC,KAAqC,IAAI,IAAI,CAAC,cAAc,GAAG,KAAK,CAAC,CAAC,CAAC;IAChG,+CAA+C;IAC/C,IAAW,aAAa,KAAqC,OAAO,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC;IAE1F;;;;;;;;OAQG;IACI,MAAM,CAAC,MAAM,CAAC,OAAkC;QACrD,MAAM,gBAAgB,GAAG,iCAAiC,CAAC,qBAAqB,CAAC,OAAO,CAAC,CAAC;QAC1F,OAAO,IAAI,iBAAiB,CAAC,gBAAgB,CAAC,CAAC;IACjD,CAAC;IACD,2CAA2C;IACpC,UAAU,CAAC,MAAe,EAAE,MAAe;QAChD,IAAI,CAAC,MAAM,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACjG,CAAC;IACD,mDAAmD;IAC5C,qBAAqB,CAAC,IAAqB;QAChD,KAAK,MAAM,OAAO,IAAI,IAAI,EAAE,CAAC;YAC3B,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,SAAS,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC;QACxD,CAAC;IACH,CAAC;IACD;;OAEG;IACI,kBAAkB,CAAC,MAAwB,EAAE,aAAsB,KAAK;QAC7E,IAAI,CAAC,IAAI,CAAC,MAAM;YACd,OAAO;QACT,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;QAC1B,IAAI,EAAE,GAAG,UAAU,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5C,IAAI,EAAE,GAAG,MAAM,CAAC,mCAAmC,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QAC/D,IAAI,EAAE,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAI,EAAE,CAAC;QACP,OAAO,EAAE,GAAG,MAAM,CAAC,MAAM,EAAE,EAAE,GAAG,EAAE,EAAE,EAAG,EAAE,GAAG,EAAE,EAAE,CAAC;YAC/C,EAAE,GAAG,MAAM,CAAC,mCAAmC,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;YAC3D,IAAI,mBAAQ,CAAC,qBAAqB,CAAC,EAAE,CAAC,IAAI,mBAAQ,CAAC,qBAAqB,CAAC,EAAE,CAAC;gBAC1E,IAAI,CAAC,MAAM,CAAC,gBAAgB,CAC1B,MAAM,CAAC,yBAAyB,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,yBAAyB,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,yBAAyB,CAAC,EAAE,CAAC,EAAE,CAAC,EACnH,MAAM,CAAC,yBAAyB,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,yBAAyB,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,yBAAyB,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC3H,CAAC;IACH,CAAC;IACD;;;;;OAKG;IACK,cAAc,CAAC,IAAc;QACnC,OAAO,IAAI,CAAC,QAAQ,CAAC,oBAAoB,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;IAClF,CAAC;IACD,+DAA+D;IACvD,MAAM,CAAC,mBAAmB,CAAC,KAAe,EAAE,KAAe;QACjE,OAAO,KAAK,CAAC,QAAS,GAAG,KAAK,CAAC,QAAS,CAAC;IAC3C,CAAC;IACD,gIAAgI;IACxH,MAAM,CAAC,aAAa,CAAC,KAAe;QAC1C,OAAO,KAAK,CAAC,eAAe,KAAK,KAAK,CAAC;IACzC,CAAC;IAED,6IAA6I;IACrI,MAAM,CAAC,qBAAqB,CAAC,KAAe;QAClD,MAAM,KAAK,GAAG,KAAK,CAAC,eAAe,CAAC;QACpC,OAAO,KAAK,KAAK,KAAK,IAAI,KAAK,CAAC,eAAe,KAAK,KAAK,CAAC;IAC5D,CAAC;IAED;;;;OAIG;IACI,0BAA0B;QAC/B,0BAAgB,CAAC,eAAe,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC9C,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,YAAY,EAAE,CAAC;YACzC,CAAC,CAAC,QAAQ,GAAG,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;QACtC,CAAC;QACD,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC;QACnD,SAAS,CAAC,IAAI,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,CAAC,iBAAiB,CAAC,mBAAmB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC;QACtF,MAAM,YAAY,GAAG,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC;QAC7C,4DAA4D;QAC5D,kEAAkE;QAClE,MAAM,CAAC,GAAG,SAAS,CAAC,MAAM,CAAC;QAC3B,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC;YAC9B,MAAM,KAAK,GAAG,SAAS,CAAC,EAAE,CAAC,CAAC;YAC5B,MAAM,IAAI,GAAG,KAAK,CAAC,QAAS,CAAC;YAC7B,MAAM,IAAI,GAAG,IAAI,GAAG,YAAY,CAAC;YACjC,IAAI,iBAAiB,CAAC,aAAa,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC3C,KAAK,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC;oBACnC,MAAM,KAAK,GAAG,SAAS,CAAC,EAAE,CAAC,CAAC;oBAC5B,IAAI,iBAAiB,CAAC,aAAa,CAAC,KAAK,CAAC,EAAE,CAAC;wBAC3C,IAAI,KAAK,CAAC,QAAS,GAAG,IAAI;4BACxB,MAAM;wBACR,IAAI,KAAK,CAAC,WAAW,CAAC,KAAK,CAAC,IAAI,YAAY,EAAE,CAAC;4BAC7C,gBAAQ,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;4BAC7B,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC,CAAI,gCAAgC;wBAC9D,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IACD;;;;OAIG;IACK,uCAAuC,CAAC,MAAsB,EAAE,KAAe,EAAE,SAAuB;QAC9G,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,SAAS,CAAC,EAAE,CAAC;YAChC,MAAM,EAAE,GAAG,2BAAY,CAAC,MAAM,EAAE,CAAC;YACjC,EAAE,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;YAC1C,SAAU,CAAC;gBACT,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;gBACzB,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;gBAClC,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;gBAC5B,EAAE,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;gBAC1C,IAAI,KAAK,CAAC,SAAS,CAAC,SAAS,CAAC,IAAI,CAAC,iBAAiB,CAAC,qBAAqB,CAAC,KAAK,CAAC;oBAC/E,MAAM;YACV,CAAC;YACD,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAClB,CAAC;IACH,CAAC;IACD;;;;OAIG;IACK,2CAA2C,CAAC,MAA0B,EAAE,KAAe,EAAE,SAAuB;QACtH,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,SAAS,CAAC,EAAE,CAAC;YAChC,MAAM,MAAM,GAAG,IAAI,mCAAgB,EAAE,CAAC;YACtC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;YAC1C,SAAU,CAAC;gBACT,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;gBACzB,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;gBAClC,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;gBAC5B,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;gBAC1C,IAAI,KAAK,CAAC,SAAS,CAAC,SAAS,CAAC,IAAI,CAAC,iBAAiB,CAAC,qBAAqB,CAAC,KAAK,CAAC;oBAC/E,MAAM;YACV,CAAC;YACD,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;gBACnB,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACxB,CAAC;IACH,CAAC;IAED;;;;;OAKG;IACK,uBAAuB,CAAC,IAAkB;QAChD,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,YAAY,EAAE,CAAC;YACzC,IAAI,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,SAAS;mBAClD,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC;gBACxB,MAAM,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC;gBACrB,gBAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,iBAAiB,CAAC,CAAC;gBACvC,gBAAQ,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,iBAAiB,CAAC,CAAC;gBACvC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;gBAChB,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;gBAChB,CAAC,EAAE,CAAC;YACN,CAAC;QACH,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IACD;;OAEG;IACI,oBAAoB;QACzB,MAAM,MAAM,GAAmB,EAAE,CAAC;QAClC,MAAM,SAAS,GAAG,oBAAY,CAAC,OAAO,CAAC;QACvC,6CAA6C;QAC7C,IAAI,CAAC,uBAAuB,CAAC,SAAS,CAAC,CAAC;QACxC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;QACjC,2FAA2F;QAC3F,yDAAyD;QACzD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,YAAY,EAAE,CAAC;YAC7C,IAAI,CAAC,iBAAiB,CAAC,qBAAqB,CAAC,KAAK,CAAC,EAAE,CAAC;gBACpD,IAAI,CAAC,uCAAuC,CAAC,MAAM,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;YACzE,CAAC;QACH,CAAC;QACD,+CAA+C;QAC/C,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,YAAY,EAAE,CAAC;YAC7C,IAAI,CAAC,uCAAuC,CAAC,MAAM,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;QACzE,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACM,+BAA+B;QACpC,MAAM,MAAM,GAAuB,EAAE,CAAC;QACtC,MAAM,SAAS,GAAG,oBAAY,CAAC,OAAO,CAAC;QACvC,6CAA6C;QAC7C,IAAI,CAAC,uBAAuB,CAAC,SAAS,CAAC,CAAC;QACxC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,SAAS,CAAC,CAAC;QACjC,2FAA2F;QAC3F,yDAAyD;QACzD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,YAAY,EAAE,CAAC;YAC7C,IAAI,CAAC,iBAAiB,CAAC,qBAAqB,CAAC,KAAK,CAAC,EAAE,CAAC;gBACpD,IAAI,CAAC,2CAA2C,CAAC,MAAM,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;YAC7E,CAAC;QACH,CAAC;QACD,+CAA+C;QAC/C,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,YAAY,EAAE,CAAC;YAC7C,IAAI,CAAC,2CAA2C,CAAC,MAAM,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;QAC7E,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;CACF;AAjOD,8CAiOC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n\n/** @packageDocumentation\n * @module Topology\n */\n\nimport { ConvexClipPlaneSet } from \"../clipping/ConvexClipPlaneSet\";\nimport { LineSegment3d } from \"../curve/LineSegment3d\";\nimport { LineString3d } from \"../curve/LineString3d\";\nimport { Geometry, PlaneAltitudeEvaluator } from \"../Geometry\";\nimport { GrowableXYZArray } from \"../geometry3d/GrowableXYZArray\";\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\nimport { HalfEdge, HalfEdgeGraph, HalfEdgeMask } from \"./Graph\";\nimport { HalfEdgeGraphOps } from \"./Merging\";\n\n/**\n * interface containing various options appropriate to merging lines segments into chains.\n * @internal\n */\nexport interface ChainMergeContextOptions {\n  /**\n   * Tolerance for declaring points equal\n   * * Default is `Geometry.smallMetricDistance`\n   */\n  tolerance?: number;\n  /**\n   * Direction for primary sort.\n   * * Default is `Vector3d.create(0.294234298, 0.72391399, 0.45234328798)`\n   * * this vector should NOT be along a principal x,y,z direction.\n   * * The internal form will be normalized.\n   */\n  primarySortDirection?: Vector3d;\n}\n/** Internal form of ChainMergeContextOptions -- same field names, but required to have contents. */\nclass ChainMergeContextValidatedOptions {\n  /**\n   * Tolerance for declaring points equal.\n   */\n  public tolerance: number;\n  /** UNNORMALIZED base vector for sorting.\n   * * Actual vector hoisted into an instance is normalized.\n   */\n  private static readonly _defaultPrimarySortDirection = Vector3d.create(0.294234298, 0.72391399, 0.45234328798);\n  /**\n   * Direction for primary sort.  This is normalized !!!\n   */\n  public primarySortDirection: Vector3d;\n  /** return a unit vector aligned with optional direction.\n   * * Default return is into the first quadrant at a quirky angle so any perpendicular plane is unlikely to hit many points\n   */\n  public static createPrimarySortVector(vector?: Vector3d): Vector3d {\n    if (vector === undefined) {\n      vector = this._defaultPrimarySortDirection.clone();\n    }\n    return vector.normalizeWithDefault(\n      ChainMergeContextValidatedOptions._defaultPrimarySortDirection.x,\n      ChainMergeContextValidatedOptions._defaultPrimarySortDirection.y,\n      ChainMergeContextValidatedOptions._defaultPrimarySortDirection.z);\n  }\n  /**\n   * PRIVATE constructor -- assumes all inputs are validated in public create method !!!!\n   * @param tolerance\n   * @param unitVectorForPrimarySort\n   */\n  private constructor(tolerance: number, unitVectorForPrimarySort: Vector3d) {\n    this.tolerance = tolerance;\n    this.primarySortDirection = unitVectorForPrimarySort;\n  }\n  /** return the default option set. */\n  public static createFromUnValidated(options?: ChainMergeContextOptions): ChainMergeContextValidatedOptions {\n    const result = new ChainMergeContextValidatedOptions(Geometry.smallMetricDistance, ChainMergeContextValidatedOptions.createPrimarySortVector());\n    if (options !== undefined) {\n      if (options.tolerance !== undefined)\n        result.tolerance = options.tolerance;\n      if (options.primarySortDirection !== undefined)\n        result.primarySortDirection = ChainMergeContextValidatedOptions.createPrimarySortVector();\n    }\n    return result;\n  }\n  /** Clone this context. */\n  public clone(): ChainMergeContextValidatedOptions {\n    return new ChainMergeContextValidatedOptions(this.tolerance, this.primarySortDirection);\n  }\n}\n/**\n * * Context for assembling line segments into chains.\n * * Use the context in phases:\n *   * Create the context:   `context = ChainMergeContext.create ()`\n *   * Add line with any combination of:\n *      * `context.addSegment(pointA, pointB)`\n *      * `context.addLineSegment3dArray (segments)`\n *   * Scan all coordinate data for common coordinates.  Twist nodes together to form chains:\n *      * `context.clusterAndMergeVerticesXYZ ()`\n *   * Collect the chains:\n *      * myLinestringArray = context.collectMaximalChains();\n * * The context carries an optional plane which is used by addSegmentsOnPlane\n *\n * @internal\n */\nexport class ChainMergeContext {\n\n  private _graph: HalfEdgeGraph;\n  private _options: ChainMergeContextValidatedOptions;\n  private _plane?: PlaneAltitudeEvaluator;\n  private _convexClipper?: ConvexClipPlaneSet;\n  private constructor(options: ChainMergeContextValidatedOptions) {\n    this._graph = new HalfEdgeGraph();\n    this._options = options;\n  }\n  /** Save a reference plane for later use, e.g. in addSegmentsOnPlane */\n  public set plane(value: PlaneAltitudeEvaluator | undefined) { this._plane = value; }\n  /** Property access for the reference plane. */\n  public get plane(): PlaneAltitudeEvaluator | undefined { return this._plane; }\n\n  /** Save a reference plane for later use, e.g. in addSegmentsOnPlane */\n  public set convexClipper(value: ConvexClipPlaneSet | undefined) { this._convexClipper = value; }\n  /** Property access for the reference plane. */\n  public get convexClipper(): ConvexClipPlaneSet | undefined { return this._convexClipper; }\n\n  /**\n   * * Construct an empty chain merge graph.\n   * * The options parameter may contain any combination of the options values.\n   *   * tolerance = absolute tolerance for declaring points equal.\n   *     * Default is `Geometry.smallMetricDistance`\n   *   * primarySortDirection = direction for first sort.\n   *     * To minimize clash among points on primary sort, this should NOT be perpendicular to any principal plane.\n   *     * The default points into the first octant with non-obvious components.\n   */\n  public static create(options?: ChainMergeContextOptions): ChainMergeContext {\n    const validatedOptions = ChainMergeContextValidatedOptions.createFromUnValidated(options);\n    return new ChainMergeContext(validatedOptions);\n  }\n  /** Add a segment to the evolving graph. */\n  public addSegment(pointA: Point3d, pointB: Point3d) {\n    this._graph.createEdgeXYZXYZ(pointA.x, pointA.y, pointA.z, 0, pointB.x, pointB.y, pointB.z, 0);\n  }\n  /** Add all segments from an array to the graph. */\n  public addLineSegment3dArray(data: LineSegment3d[]) {\n    for (const segment of data) {\n      this.addSegment(segment.point0Ref, segment.point1Ref);\n    }\n  }\n  /** Add edges for all segments that are \"on\" the plane.\n   * * No action if `this.plane` is undefined.\n   */\n  public addSegmentsOnPlane(points: GrowableXYZArray, addClosure: boolean = false) {\n    if (!this._plane)\n      return;\n    const plane = this._plane;\n    let i0 = addClosure ? points.length - 1 : 0;\n    let a0 = points.evaluateUncheckedIndexPlaneAltitude(i0, plane);\n    let i1 = addClosure ? 0 : 1;\n    let a1;\n    for (; i1 < points.length; i0 = i1++ , a0 = a1) {\n      a1 = points.evaluateUncheckedIndexPlaneAltitude(i1, plane);\n      if (Geometry.isSmallMetricDistance(a0) && Geometry.isSmallMetricDistance(a1))\n        this._graph.createEdgeXYZXYZ(\n          points.getXAtUncheckedPointIndex(i0), points.getYAtUncheckedPointIndex(i0), points.getZAtUncheckedPointIndex(i0), 0,\n          points.getXAtUncheckedPointIndex(i1), points.getYAtUncheckedPointIndex(i1), points.getZAtUncheckedPointIndex(i1), 0);\n    }\n  }\n  /**\n   * Return a numeric value to be used for sorting, with little chance widely separated nodes will have identical key.\n   * * Any single x,y,z component is a poor choice because horizontal and vertical alignment is common.\n   * * Hence take dot product of x,y,z with non-trivial fraction values.\n   * @param node node with x,y,z coordinates\n   */\n  private primarySortKey(node: HalfEdge): number {\n    return this._options.primarySortDirection.dotProductXYZ(node.x, node.y, node.z);\n  }\n  /** Return difference of sortData members as sort comparison */\n  private static nodeCompareSortData(nodeA: HalfEdge, nodeB: HalfEdge): number {\n    return nodeA.sortData! - nodeB.sortData!;\n  }\n  /** test if nodeA is a dangling edge end (i.e. edges around vertex equal 1, but detect it without walking all the way around. */\n  private static isIsolatedEnd(nodeA: HalfEdge): boolean {\n    return nodeA.vertexSuccessor === nodeA;\n  }\n\n  /** test if nodeA is at a vertex with exactly 2 edges (i.e. edges around vertex equal w, but detect it without walking all the way around. */\n  private static isChainInteriorVertex(nodeA: HalfEdge): boolean {\n    const nodeB = nodeA.vertexSuccessor;\n    return nodeB !== nodeA && nodeB.vertexSuccessor === nodeA;\n  }\n\n  /**\n   * * isolate all edge ends.\n   * * perform cluster analysis to determine nearly coincident points.\n   * * pinch all edges together at each vertex.\n   */\n  public clusterAndMergeVerticesXYZ() {\n    HalfEdgeGraphOps.isolateAllEdges(this._graph);\n    for (const p of this._graph.allHalfEdges) {\n      p.sortData = this.primarySortKey(p);\n    }\n    const sortArray = this._graph.allHalfEdges.slice();\n    sortArray.sort((nodeA, nodeB) => ChainMergeContext.nodeCompareSortData(nodeA, nodeB));\n    const xyzTolerance = this._options.tolerance;\n    // A node is unvisited if it is its own vertex successor !!!\n    // otherwise the node has already been twisted into a base vertex.\n    const n = sortArray.length;\n    for (let i0 = 0; i0 < n; i0++) {\n      const node0 = sortArray[i0];\n      const qMin = node0.sortData!;\n      const qMax = qMin + xyzTolerance;\n      if (ChainMergeContext.isIsolatedEnd(node0)) {\n        for (let i1 = i0 + 1; i1 < n; i1++) {\n          const node1 = sortArray[i1];\n          if (ChainMergeContext.isIsolatedEnd(node1)) {\n            if (node1.sortData! > qMax)\n              break;\n            if (node0.distanceXYZ(node1) <= xyzTolerance) {\n              HalfEdge.pinch(node0, node1);\n              node1.setXYZFrom(node0);    // force true equal coordinates.\n            }\n          }\n        }\n      }\n    }\n  }\n  /**\n   * If node0 is not visited, creating a linestring with that starting edge and all successive edges along a chain.\n   * @param chains growing array of chains.\n   * @param node0 start node for search.\n   */\n  private collectMaximalLineString3dFromStartNode(chains: LineString3d[], node0: HalfEdge, visitMask: HalfEdgeMask) {\n    if (!node0.isMaskSet(visitMask)) {\n      const ls = LineString3d.create();\n      ls.addPointXYZ(node0.x, node0.y, node0.z);\n      for (; ;) {\n        node0.setMask(visitMask);\n        node0.edgeMate.setMask(visitMask);\n        node0 = node0.faceSuccessor;\n        ls.addPointXYZ(node0.x, node0.y, node0.z);\n        if (node0.isMaskSet(visitMask) || !ChainMergeContext.isChainInteriorVertex(node0))\n          break;\n      }\n      chains.push(ls);\n    }\n  }\n  /**\n   * If node0 is not visited, creating a linestring with that starting edge and all successive edges along a chain.\n   * @param chains growing array of chains.\n   * @param node0 start node for search.\n   */\n  private collectMaximalGrowableXYXArrayFromStartNode(result: GrowableXYZArray[], node0: HalfEdge, visitMask: HalfEdgeMask) {\n    if (!node0.isMaskSet(visitMask)) {\n      const points = new GrowableXYZArray();\n      points.pushXYZ(node0.x, node0.y, node0.z);\n      for (; ;) {\n        node0.setMask(visitMask);\n        node0.edgeMate.setMask(visitMask);\n        node0 = node0.faceSuccessor;\n        points.pushXYZ(node0.x, node0.y, node0.z);\n        if (node0.isMaskSet(visitMask) || !ChainMergeContext.isChainInteriorVertex(node0))\n          break;\n      }\n      if (points.length > 0)\n        result.push(points);\n    }\n  }\n\n  /**\n   * * find edges with start, end in same vertex loop.\n   * * pinch them away from the loop\n   * * set mask on both sides.\n   * * Return the number of excisions.\n   */\n  private exciseAndMarkSlingEdges(mask: HalfEdgeMask): number {\n    let n = 0;\n    for (const p of this._graph.allHalfEdges) {\n      if (p.distanceXYZ(p.edgeMate) < this._options.tolerance\n        && !p.isMaskSet(mask)) {\n        const q = p.edgeMate;\n        HalfEdge.pinch(p, p.vertexPredecessor);\n        HalfEdge.pinch(q, q.vertexPredecessor);\n        p.setMask(mask);\n        q.setMask(mask);\n        n++;\n      }\n    }\n    return n;\n  }\n  /** Collect chains which have maximum edge count, broken at vertices with more than 2 edges.\n   * * This is assumed to be preceded by a call to a vertex-cluster step such as `clusterAndMergeVerticesYXZ`\n   */\n  public collectMaximalChains(): LineString3d[] {\n    const result: LineString3d[] = [];\n    const visitMask = HalfEdgeMask.VISITED;\n    // Pass 0: excise and mark zero-length edges.\n    this.exciseAndMarkSlingEdges(visitMask);\n    this._graph.clearMask(visitMask);\n    // Pass 1: only start at non-interior edges -- vertices with one edge or more than 2 edges.\n    // (Note that collectMaximalChain checks the visit mask.)\n    for (const node0 of this._graph.allHalfEdges) {\n      if (!ChainMergeContext.isChainInteriorVertex(node0)) {\n        this.collectMaximalLineString3dFromStartNode(result, node0, visitMask);\n      }\n    }\n    // Pass 2: start anywhere in an unvisited loop.\n    for (const node0 of this._graph.allHalfEdges) {\n      this.collectMaximalLineString3dFromStartNode(result, node0, visitMask);\n    }\n    return result;\n  }\n  public collectMaximalGrowableXYZArrays(): GrowableXYZArray[] {\n    const result: GrowableXYZArray[] = [];\n    const visitMask = HalfEdgeMask.VISITED;\n    // Pass 0: excise and mark zero-length edges.\n    this.exciseAndMarkSlingEdges(visitMask);\n    this._graph.clearMask(visitMask);\n    // Pass 1: only start at non-interior edges -- vertices with one edge or more than 2 edges.\n    // (Note that collectMaximalChain checks the visit mask.)\n    for (const node0 of this._graph.allHalfEdges) {\n      if (!ChainMergeContext.isChainInteriorVertex(node0)) {\n        this.collectMaximalGrowableXYXArrayFromStartNode(result, node0, visitMask);\n      }\n    }\n    // Pass 2: start anywhere in an unvisited loop.\n    for (const node0 of this._graph.allHalfEdges) {\n      this.collectMaximalGrowableXYXArrayFromStartNode(result, node0, visitMask);\n    }\n    return result;\n  }\n}\n"]}

package/lib/esm/clipping/ClipPlane.d.ts

@@ -27,9 +27,9 @@ export interface ClipPlaneProps {
     normal?: XYZProps;
     /** The plane's signed distance from the origin. */
     dist?: number;
-    /** Defaults to `false`. */
+    /** Defaults to `false`. Interpretation of this flag is algorithm-specific. */
     invisible?: boolean;
-    /** Defaults to `false`. */
+    /** Defaults to `false`. Interpretation of this flag is algorithm-specific. */
     interior?: boolean;
 }
 /**
@@ -113,9 +113,9 @@ export declare class ClipPlane extends Plane3d implements Clipper, PolygonClippe
     get distance(): number;
     /** * Return the stored inward normal property. */
     get inwardNormalRef(): Vector3d;
-    /**  Return the "interior" property bit */
+    /**  Return the "interior" property flag. Interpretation of this flag is algorithm-specific. */
     get interior(): boolean;
-    /**  Return the "invisible" property bit. */
+    /**  Return the "invisible" property flag. Interpretation of this flag is algorithm-specific. */
     get invisible(): boolean;
     /**
      * Create a plane defined by two points, an up vector, and a tilt angle relative to the up vector.
@@ -222,7 +222,7 @@ export declare class ClipPlane extends Plane3d implements Clipper, PolygonClippe
     getBoundedSegmentSimpleIntersection(pointA: Point3d, pointB: Point3d): number | undefined;
     /** Apply transform to the origin. Apply inverse transpose of the matrix part to th normal vector. */
     transformInPlace(transform: Transform): boolean;
-    /** Set the invisible flag. Interpretation of this is up to the use code algorithms. */
+    /** Set the invisible flag. Interpretation of this flag is algorithm-specific. */
     setInvisible(invisible: boolean): void;
     /** Reverse the sign of all coefficients, so outside and inside reverse */
     negateInPlace(): void;
@@ -280,5 +280,7 @@ export declare class ClipPlane extends Plane3d implements Clipper, PolygonClippe
     appendPolygonClip(xyz: IndexedXYZCollection, insideFragments: GrowableXYZArray[], outsideFragments: GrowableXYZArray[], arrayCache: GrowableXYZArrayCache): void;
     /** Project a point in space to the plane. */
     projectPointToPlane(spacePoint: Point3d, result?: Point3d): Point3d;
+    /** Return the projection of (x,y,z) onto the plane. */
+    projectXYZToPlane(x: number, y: number, z: number, result?: Point3d): Point3d;
 }
 //# sourceMappingURL=ClipPlane.d.ts.map

package/lib/esm/clipping/ClipPlane.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"ClipPlane.d.ts","sourceRoot":"","sources":["../../../src/clipping/ClipPlane.ts"],"names":[],"mappings":"AAKA;;GAEG;AAEH,OAAO,EAAE,KAAK,EAAE,MAAM,gBAAgB,CAAC;AACvC,OAAO,EAAE,kCAAkC,EAAE,MAAM,yBAAyB,CAAC;AAE7E,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAC5C,OAAO,EAAE,oBAAoB,EAAE,MAAM,oCAAoC,CAAC;AAC1E,OAAO,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAClE,OAAO,EAAE,oBAAoB,EAAE,MAAM,oCAAoC,CAAC;AAE1E,OAAO,EAAE,OAAO,EAAE,MAAM,uBAAuB,CAAC;AAChD,OAAO,EAAE,4BAA4B,EAAE,MAAM,4CAA4C,CAAC;AAC1F,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAElE,OAAO,EAAW,OAAO,EAAE,MAAM,qBAAqB,CAAC;AACvD,OAAO,EAAE,qBAAqB,EAAE,MAAM,mCAAmC,CAAC;AAC1E,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACpD,OAAO,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AAClD,OAAO,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AAClD,OAAO,EAAE,OAAO,EAAE,MAAM,uBAAuB,CAAC;AAEhD,OAAO,EAAE,OAAO,EAAiB,cAAc,EAAE,MAAM,aAAa,CAAC;AAErE;;;;GAIG;AACH,MAAM,WAAW,cAAc;IAC7B,iCAAiC;IACjC,MAAM,CAAC,EAAE,QAAQ,CAAC;IAClB,mDAAmD;IACnD,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,2BAA2B;IAC3B,SAAS,CAAC,EAAE,OAAO,CAAC;IACpB,2BAA2B;IAC3B,QAAQ,CAAC,EAAE,OAAO,CAAC;CACpB;AAED;;;;;;;;;;;;;;GAcG;AACH,qBAAa,SAAU,SAAQ,OAAQ,YAAW,OAAO,EAAE,cAAc;IACvE,OAAO,CAAC,aAAa,CAAW;IAChC;;;;OAIG;IACH,OAAO,CAAC,mBAAmB,CAAS;IACpC,OAAO,CAAC,UAAU,CAAU;IAC5B,OAAO,CAAC,SAAS,CAAU;IAE3B,OAAO;IAaP;;;OAGG;IACI,aAAa,CAAC,KAAK,EAAE,SAAS,GAAG,OAAO;IAM/C,4BAA4B;IACrB,KAAK,IAAI,SAAS;IAIzB,0DAA0D;IACnD,YAAY,IAAI,SAAS;IAKhC,4DAA4D;WAC9C,WAAW,CACvB,KAAK,EAAE,4BAA4B,EAAE,SAAS,GAAE,OAAe,EAAE,QAAQ,GAAE,OAAe,EAAE,MAAM,CAAC,EAAE,SAAS,GAC7G,SAAS;IAWZ;;;OAGG;WACW,uBAAuB,CACnC,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,EAAE,SAAS,GAAE,OAAe,EAAE,QAAQ,GAAE,OAAe,EAAE,MAAM,CAAC,EAAE,SAAS,GAC5G,SAAS,GAAG,SAAS;IAaxB;;;;;;OAMG;WACW,oBAAoB,CAChC,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,OAAO,EAAE,SAAS,GAAE,OAAe,EAAE,QAAQ,GAAE,OAAe,EAAE,MAAM,CAAC,EAAE,SAAS,GAC1G,SAAS,GAAG,SAAS;IAcxB;;;;;;;;OAQG;WACW,sBAAsB,CAClC,MAAM,EAAE,OAAO,EACf,OAAO,EAAE,QAAQ,EACjB,OAAO,EAAE,QAAQ,EACjB,SAAS,GAAE,OAAe,EAC1B,QAAQ,GAAE,OAAe,EACzB,MAAM,CAAC,EAAE,SAAS,GACjB,SAAS,GAAG,SAAS;IAIxB;;;;;;OAMG;WACW,0BAA0B,CACtC,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EACjD,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EACjD,SAAS,GAAE,OAAe,EAAE,QAAQ,GAAE,OAAe,EACrD,MAAM,CAAC,EAAE,SAAS,GACjB,SAAS,GAAG,SAAS;IAgBxB;;;OAGG;IACI,MAAM,IAAI,cAAc;IAW/B,8CAA8C;WAChC,QAAQ,CAAC,IAAI,EAAE,cAAc,EAAE,MAAM,CAAC,EAAE,SAAS,GAAG,SAAS,GAAG,SAAS;IAOvF,iDAAiD;IAC1C,QAAQ,CAAC,SAAS,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO;IAIrD,qDAAqD;IACrD,IAAW,QAAQ,WAElB;IACD,kDAAkD;IAClD,IAAW,eAAe,IAAI,QAAQ,CAErC;IACD,0CAA0C;IAC1C,IAAW,QAAQ,YAElB;IACD,4CAA4C;IAC5C,IAAW,SAAS,YAEnB;IACD;;;;;;;OAOG;WACW,qBAAqB,CACjC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,SAAS,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,EAAE,SAAS,GAC1F,SAAS,GAAG,SAAS;IAgBxB,0FAA0F;WAC5E,YAAY,CAAC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,CAAC,EAAE,SAAS,GAAG,SAAS,GAAG,SAAS;IAMvG;;;;OAIG;IACI,UAAU,IAAI,4BAA4B;IAQjD;;;;OAIG;IACI,UAAU,IAAI,OAAO;IAK5B;;;;;;OAMG;IACI,UAAU,CAAC,KAAK,EAAE,OAAO;IAQhC;;;;OAIG;IACI,gBAAgB,CAAC,KAAK,EAAE,OAAO,GAAG,MAAM;IAM/C;;;OAGG;IACI,QAAQ,CAAC,KAAK,EAAE,OAAO,GAAG,MAAM;IAMvC;;;;OAIG;IACI,WAAW,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM;IAM3D,sEAAsE;IAC/D,OAAO,IAAI,MAAM;IAGxB,sEAAsE;IAC/D,OAAO,IAAI,MAAM;IAGxB,sEAAsE;IAC/D,OAAO,IAAI,MAAM;IAGxB,6GAA6G;IACtG,QAAQ,CAAC,MAAM,EAAE,QAAQ,GAAG,MAAM;IAGzC;;;OAGG;IACI,WAAW,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM;IAG3D;;;OAGG;IACI,0BAA0B,CAAC,KAAK,EAAE,OAAO,GAAG,MAAM;IAGzD;;;;OAIG;IACI,iBAAiB,CAAC,UAAU,EAAE,OAAO,EAAE,SAAS,GAAE,MAAqC,GAAG,OAAO;IAKxG;;;;OAIG;IACI,aAAa,CAAC,KAAK,EAAE,OAAO,EAAE,SAAS,GAAE,MAAqC,GAAG,OAAO;IAK/F;;;;OAIG;IACI,SAAS,CAAC,KAAK,EAAE,OAAO,EAAE,SAAS,GAAE,MAAqC,GAAG,OAAO;IAG3F;;;;OAIG;IACI,yBAAyB,CAAC,GAAG,EAAE,KAAK,EAAE,mBAAmB,EAAE,oBAAoB;IAStF,OAAO,CAAC,MAAM,CAAC,qBAAqB,CAA8B;IAClE;;;OAGG;IACI,2BAA2B,CAAC,GAAG,EAAE,KAAK,EAAE,QAAQ,CAAC,EAAE,kCAAkC,GAAG,OAAO;IAOtG;;;;;OAKG;IACI,mCAAmC,CAAC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,GAAG,MAAM,GAAG,SAAS;IAUhG,qGAAqG;IAC9F,gBAAgB,CAAC,SAAS,EAAE,SAAS,GAAG,OAAO;IAkBtD,uFAAuF;IAChF,YAAY,CAAC,SAAS,EAAE,OAAO;IAGtC,0EAA0E;IACnE,aAAa;IAIpB;;;OAGG;IACI,cAAc,CAAC,MAAM,EAAE,MAAM;IAGpC;;;;;;;OAOG;IACI,wBAAwB,CAC7B,GAAG,EAAE,gBAAgB,EACrB,IAAI,EAAE,gBAAgB,EACtB,MAAM,GAAE,OAAc,EACtB,SAAS,GAAE,MAAqC;IAIlD;;;;;;;;;;;OAWG;IACI,uBAAuB,CAAC,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAE,OAAc,EAAE,SAAS,GAAE,OAAc,GAAG,OAAO;IAe5G,uFAAuF;IAChF,+BAA+B,CACpC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ,CAAC,EAAE,CAAC,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,KAAK,IAAI,GAClH,OAAO;IAuBV;;;;;OAKG;IACI,QAAQ,IAAI,SAAS;IAM5B;;;;OAIG;IACI,cAAc,CAAC,KAAK,EAAE,OAAO,EAAE,eAAe,GAAE,OAAe,GAAG,gBAAgB,GAAG,SAAS;IAuBrG;;;;;;;;OAQG;IACI,iBAAiB,CACtB,GAAG,EAAE,oBAAoB,EACzB,eAAe,EAAE,gBAAgB,EAAE,EACnC,gBAAgB,EAAE,gBAAgB,EAAE,EACpC,UAAU,EAAE,qBAAqB,GAChC,IAAI;IAUP,6CAA6C;IACtC,mBAAmB,CAAC,UAAU,EAAE,OAAO,EAAE,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO;CAI3E"}
+{"version":3,"file":"ClipPlane.d.ts","sourceRoot":"","sources":["../../../src/clipping/ClipPlane.ts"],"names":[],"mappings":"AAKA;;GAEG;AAEH,OAAO,EAAE,KAAK,EAAE,MAAM,gBAAgB,CAAC;AACvC,OAAO,EAAE,kCAAkC,EAAE,MAAM,yBAAyB,CAAC;AAE7E,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAC5C,OAAO,EAAE,oBAAoB,EAAE,MAAM,oCAAoC,CAAC;AAC1E,OAAO,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAClE,OAAO,EAAE,oBAAoB,EAAE,MAAM,oCAAoC,CAAC;AAE1E,OAAO,EAAE,OAAO,EAAE,MAAM,uBAAuB,CAAC;AAChD,OAAO,EAAE,4BAA4B,EAAE,MAAM,4CAA4C,CAAC;AAC1F,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAElE,OAAO,EAAW,OAAO,EAAE,MAAM,qBAAqB,CAAC;AACvD,OAAO,EAAE,qBAAqB,EAAE,MAAM,mCAAmC,CAAC;AAC1E,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACpD,OAAO,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AAClD,OAAO,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AAClD,OAAO,EAAE,OAAO,EAAE,MAAM,uBAAuB,CAAC;AAEhD,OAAO,EAAE,OAAO,EAAiB,cAAc,EAAE,MAAM,aAAa,CAAC;AAErE;;;;GAIG;AACH,MAAM,WAAW,cAAc;IAC7B,iCAAiC;IACjC,MAAM,CAAC,EAAE,QAAQ,CAAC;IAClB,mDAAmD;IACnD,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,8EAA8E;IAC9E,SAAS,CAAC,EAAE,OAAO,CAAC;IACpB,8EAA8E;IAC9E,QAAQ,CAAC,EAAE,OAAO,CAAC;CACpB;AAED;;;;;;;;;;;;;;GAcG;AACH,qBAAa,SAAU,SAAQ,OAAQ,YAAW,OAAO,EAAE,cAAc;IACvE,OAAO,CAAC,aAAa,CAAW;IAChC;;;;OAIG;IACH,OAAO,CAAC,mBAAmB,CAAS;IACpC,OAAO,CAAC,UAAU,CAAU;IAC5B,OAAO,CAAC,SAAS,CAAU;IAE3B,OAAO;IAaP;;;OAGG;IACI,aAAa,CAAC,KAAK,EAAE,SAAS,GAAG,OAAO;IAM/C,4BAA4B;IACrB,KAAK,IAAI,SAAS;IAIzB,0DAA0D;IACnD,YAAY,IAAI,SAAS;IAKhC,4DAA4D;WAC9C,WAAW,CACvB,KAAK,EAAE,4BAA4B,EAAE,SAAS,GAAE,OAAe,EAAE,QAAQ,GAAE,OAAe,EAAE,MAAM,CAAC,EAAE,SAAS,GAC7G,SAAS;IAWZ;;;OAGG;WACW,uBAAuB,CACnC,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,EAAE,SAAS,GAAE,OAAe,EAAE,QAAQ,GAAE,OAAe,EAAE,MAAM,CAAC,EAAE,SAAS,GAC5G,SAAS,GAAG,SAAS;IAaxB;;;;;;OAMG;WACW,oBAAoB,CAChC,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,OAAO,EAAE,SAAS,GAAE,OAAe,EAAE,QAAQ,GAAE,OAAe,EAAE,MAAM,CAAC,EAAE,SAAS,GAC1G,SAAS,GAAG,SAAS;IAcxB;;;;;;;;OAQG;WACW,sBAAsB,CAClC,MAAM,EAAE,OAAO,EACf,OAAO,EAAE,QAAQ,EACjB,OAAO,EAAE,QAAQ,EACjB,SAAS,GAAE,OAAe,EAC1B,QAAQ,GAAE,OAAe,EACzB,MAAM,CAAC,EAAE,SAAS,GACjB,SAAS,GAAG,SAAS;IAIxB;;;;;;OAMG;WACW,0BAA0B,CACtC,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EACjD,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EACjD,SAAS,GAAE,OAAe,EAAE,QAAQ,GAAE,OAAe,EACrD,MAAM,CAAC,EAAE,SAAS,GACjB,SAAS,GAAG,SAAS;IAgBxB;;;OAGG;IACI,MAAM,IAAI,cAAc;IAW/B,8CAA8C;WAChC,QAAQ,CAAC,IAAI,EAAE,cAAc,EAAE,MAAM,CAAC,EAAE,SAAS,GAAG,SAAS,GAAG,SAAS;IAOvF,iDAAiD;IAC1C,QAAQ,CAAC,SAAS,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO;IAIrD,qDAAqD;IACrD,IAAW,QAAQ,WAElB;IACD,kDAAkD;IAClD,IAAW,eAAe,IAAI,QAAQ,CAErC;IACD,+FAA+F;IAC/F,IAAW,QAAQ,YAElB;IACD,gGAAgG;IAChG,IAAW,SAAS,YAEnB;IACD;;;;;;;OAOG;WACW,qBAAqB,CACjC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,SAAS,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,EAAE,SAAS,GAC1F,SAAS,GAAG,SAAS;IAgBxB,0FAA0F;WAC5E,YAAY,CAAC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,CAAC,EAAE,SAAS,GAAG,SAAS,GAAG,SAAS;IAMvG;;;;OAIG;IACI,UAAU,IAAI,4BAA4B;IAQjD;;;;OAIG;IACI,UAAU,IAAI,OAAO;IAK5B;;;;;;OAMG;IACI,UAAU,CAAC,KAAK,EAAE,OAAO;IAQhC;;;;OAIG;IACI,gBAAgB,CAAC,KAAK,EAAE,OAAO,GAAG,MAAM;IAM/C;;;OAGG;IACI,QAAQ,CAAC,KAAK,EAAE,OAAO,GAAG,MAAM;IAMvC;;;;OAIG;IACI,WAAW,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM;IAM3D,sEAAsE;IAC/D,OAAO,IAAI,MAAM;IAGxB,sEAAsE;IAC/D,OAAO,IAAI,MAAM;IAGxB,sEAAsE;IAC/D,OAAO,IAAI,MAAM;IAGxB,6GAA6G;IACtG,QAAQ,CAAC,MAAM,EAAE,QAAQ,GAAG,MAAM;IAGzC;;;OAGG;IACI,WAAW,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM;IAG3D;;;OAGG;IACI,0BAA0B,CAAC,KAAK,EAAE,OAAO,GAAG,MAAM;IAGzD;;;;OAIG;IACI,iBAAiB,CAAC,UAAU,EAAE,OAAO,EAAE,SAAS,GAAE,MAAqC,GAAG,OAAO;IAKxG;;;;OAIG;IACI,aAAa,CAAC,KAAK,EAAE,OAAO,EAAE,SAAS,GAAE,MAAqC,GAAG,OAAO;IAK/F;;;;OAIG;IACI,SAAS,CAAC,KAAK,EAAE,OAAO,EAAE,SAAS,GAAE,MAAqC,GAAG,OAAO;IAG3F;;;;OAIG;IACI,yBAAyB,CAAC,GAAG,EAAE,KAAK,EAAE,mBAAmB,EAAE,oBAAoB;IAStF,OAAO,CAAC,MAAM,CAAC,qBAAqB,CAA8B;IAClE;;;OAGG;IACI,2BAA2B,CAAC,GAAG,EAAE,KAAK,EAAE,QAAQ,CAAC,EAAE,kCAAkC,GAAG,OAAO;IAOtG;;;;;OAKG;IACI,mCAAmC,CAAC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,GAAG,MAAM,GAAG,SAAS;IAUhG,qGAAqG;IAC9F,gBAAgB,CAAC,SAAS,EAAE,SAAS,GAAG,OAAO;IAkBtD,iFAAiF;IAC1E,YAAY,CAAC,SAAS,EAAE,OAAO;IAGtC,0EAA0E;IACnE,aAAa;IAIpB;;;OAGG;IACI,cAAc,CAAC,MAAM,EAAE,MAAM;IAGpC;;;;;;;OAOG;IACI,wBAAwB,CAC7B,GAAG,EAAE,gBAAgB,EACrB,IAAI,EAAE,gBAAgB,EACtB,MAAM,GAAE,OAAc,EACtB,SAAS,GAAE,MAAqC;IAIlD;;;;;;;;;;;OAWG;IACI,uBAAuB,CAAC,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAE,OAAc,EAAE,SAAS,GAAE,OAAc,GAAG,OAAO;IAe5G,uFAAuF;IAChF,+BAA+B,CACpC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,QAAQ,CAAC,EAAE,CAAC,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,KAAK,IAAI,GAClH,OAAO;IAuBV;;;;;OAKG;IACI,QAAQ,IAAI,SAAS;IAM5B;;;;OAIG;IACI,cAAc,CAAC,KAAK,EAAE,OAAO,EAAE,eAAe,GAAE,OAAe,GAAG,gBAAgB,GAAG,SAAS;IAuBrG;;;;;;;;OAQG;IACI,iBAAiB,CACtB,GAAG,EAAE,oBAAoB,EACzB,eAAe,EAAE,gBAAgB,EAAE,EACnC,gBAAgB,EAAE,gBAAgB,EAAE,EACpC,UAAU,EAAE,qBAAqB,GAChC,IAAI;IAUP,6CAA6C;IACtC,mBAAmB,CAAC,UAAU,EAAE,OAAO,EAAE,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO;IAG1E,uDAAuD;IACvC,iBAAiB,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO;CAI9F"}

package/lib/esm/clipping/ClipPlane.js

@@ -194,11 +194,11 @@ export class ClipPlane extends Plane3d {
     get inwardNormalRef() {
         return this._inwardNormal;
     }
-    /**  Return the "interior" property bit */
+    /**  Return the "interior" property flag. Interpretation of this flag is algorithm-specific. */
     get interior() {
         return this._interior;
     }
-    /**  Return the "invisible" property bit. */
+    /**  Return the "invisible" property flag. Interpretation of this flag is algorithm-specific. */
     get invisible() {
         return this._invisible;
     }
@@ -417,7 +417,7 @@ export class ClipPlane extends Plane3d {
         this._distanceFromOrigin = this._inwardNormal.dotProduct(plane.getOriginRef());
         return true;
     }
-    /** Set the invisible flag. Interpretation of this is up to the use code algorithms. */
+    /** Set the invisible flag. Interpretation of this flag is algorithm-specific. */
     setInvisible(invisible) {
         this._invisible = invisible;
     }
@@ -561,8 +561,12 @@ export class ClipPlane extends Plane3d {
     }
     /** Project a point in space to the plane. */
     projectPointToPlane(spacePoint, result) {
-        const d = -this.altitude(spacePoint);
-        return spacePoint.plusXYZ(d * this._inwardNormal.x, d * this._inwardNormal.y, d * this._inwardNormal.z, result);
+        return this.projectXYZToPlane(spacePoint.x, spacePoint.y, spacePoint.z, result);
+    }
+    /** Return the projection of (x,y,z) onto the plane. */
+    projectXYZToPlane(x, y, z, result) {
+        const scale = -this.altitudeXYZ(x, y, z);
+        return Point3d.create(x + scale * this._inwardNormal.x, y + scale * this._inwardNormal.y, z + scale * this._inwardNormal.z, result);
     }
 }
 //# sourceMappingURL=ClipPlane.js.map