@itwin/ecschema-rpcinterface-tests 4.0.0-dev.37 → 4.0.0-dev.39

package/lib/dist/bundled-tests.js

@@ -172639,8 +172639,8 @@ __webpack_require__.r(__webpack_exports__);
 
 
 /* eslint-disable @typescript-eslint/naming-convention, no-empty */
-/** Enumeration of the 6 possible orderings of XYZ axis order
- *
+/**
+ * Enumeration of the 6 possible orderings of XYZ axis order
  * * **Note:** There are 3 axis order with right hand system (XYZ = 0, YZX = 1, ZXY = 2) and 3 axis order with
  * left hand system (XZY = 4, YXZ = 5, ZYX = 6). Note that AxisOrder is encoding the handedness as well. Cross
  * product of the i_th axis in an ordering (i=0,1,2), with the i+1_th in that ordering, will produce the i+2_th
@@ -172662,7 +172662,8 @@ var AxisOrder;
     /** Left handed system, Z then Y then X */
     AxisOrder[AxisOrder["ZYX"] = 6] = "ZYX";
 })(AxisOrder || (AxisOrder = {}));
-/** Enumeration of numeric indices of 3 axes AxisIndex.X, AxisIndex.Y, AxisIndex.Z
+/**
+ * Enumeration of numeric indices of 3 axes AxisIndex.X, AxisIndex.Y, AxisIndex.Z
  * @public
  */
 var AxisIndex;
@@ -172773,7 +172774,10 @@ class Geometry {
     static inverseMetricDistanceSquared(a) {
         return (Math.abs(a) <= Geometry.smallMetricDistanceSquared) ? undefined : 1.0 / a;
     }
-    /** Boolean test for metric coordinate near-equality */
+    /**
+     * Boolean test for metric coordinate near-equality. If tolerance is not passed, `Geometry.smallMetricDistance`
+     * is used as tolerance.
+     */
     static isSameCoordinate(x, y, tol) {
         if (tol)
             return Math.abs(x - y) < Math.abs(tol);
@@ -173210,16 +173214,37 @@ class Geometry {
     }
     /** return 0 if the value is undefined, 1 if defined. */
     static defined01(value) { return value === undefined ? 0 : 1; }
-    /** normally, return numerator/denominator.
-     * but if the ratio would exceed Geometry.largeFractionResult, return undefined.
+    /**
+     * Return `numerator` over `denominator` or `undefined`.
+     * @param numerator the numerator
+     * @param denominator the denominator
+     * @returns return `numerator/denominator` but if the ratio would exceed `Geometry.largeFractionResult`,
+     * return `undefined`.
      */
     static conditionalDivideFraction(numerator, denominator) {
         if (Math.abs(denominator) * Geometry.largeFractionResult > Math.abs(numerator))
             return numerator / denominator;
         return undefined;
     }
-    /** normally, return numerator/denominator.
-     * but if the ratio would exceed Geometry.largestResult, return undefined.
+    /**
+     * Return `numerator` over `denominator`.
+     * @param numerator the numerator
+     * @param denominator the denominator
+     * @returns return `numerator/denominator` but if the ratio would exceed `Geometry.largeFractionResult`,
+     * return `defaultResult`.
+     */
+    static safeDivideFraction(numerator, denominator, defaultResult) {
+        const a = Geometry.conditionalDivideFraction(numerator, denominator);
+        if (a !== undefined)
+            return a;
+        return defaultResult;
+    }
+    /**
+     * Return `numerator` over `denominator` (with a given `largestResult`) or `undefined`.
+     * @param numerator the numerator
+     * @param denominator the denominator
+     * @param largestResult the ratio threshold.
+     * @returns return `numerator/denominator` but if the ratio would exceed `largestResult`, return `undefined`.
      */
     static conditionalDivideCoordinate(numerator, denominator, largestResult = Geometry.largeCoordinateResult) {
         if (Math.abs(denominator * largestResult) > Math.abs(numerator))
@@ -173258,15 +173283,6 @@ class Geometry {
             return result;
         }
     }
-    /** normally,  return the number result of conditionalDivideFraction.
-     * but if conditionalDivideFraction fails return specified default number.
-     */
-    static safeDivideFraction(numerator, denominator, defaultResult) {
-        const a = Geometry.conditionalDivideFraction(numerator, denominator);
-        if (a !== undefined)
-            return a;
-        return defaultResult;
-    }
     /** For a line f(x) whose function values at x0 and x1 are f0 and f1, return the x value at which f(x)=fTarget; */
     static inverseInterpolate(x0, f0, x1, f1, targetF = 0, defaultResult) {
         const g = Geometry.conditionalDivideFraction(targetF - f0, f1 - f0);
@@ -193181,6 +193197,12 @@ class Loop extends _CurveCollection__WEBPACK_IMPORTED_MODULE_0__.CurveChain {
         const strokes = _LineString3d__WEBPACK_IMPORTED_MODULE_1__.LineString3d.create();
         for (const curve of this.children)
             curve.emitStrokes(strokes, options);
+        // eliminate near-duplicate points between children
+        strokes.removeDuplicatePoints();
+        if (strokes.isPhysicallyClosed) {
+            strokes.popPoint();
+            strokes.addClosurePoint();
+        }
         return Loop.create(strokes);
     }
     /** Return the boundary type (2) of a corresponding  MicroStation CurveVector */
@@ -195891,15 +195913,14 @@ class RegionOps {
         curves.dispatchToGeometryHandler(context);
     }
     /**
-     * If reverse loops as necessary to make them all have CCW orientation for given outward normal.
-     * * Return an array of arrays which capture the input pointers.
-     * * In each first level array:
-     *    * The first loop is an outer loop.
-     *    * all subsequent loops are holes
-     *    * The outer loop is CCW
-     *    * The holes are CW.
-     * * Call PolygonOps.sortOuterAndHoleLoopsXY to have the result returned as an array of arrays of polygons.
-     * @param loops multiple loops to sort and reverse.
+     * Reverse and reorder loops in the xy-plane for consistency and containment.
+     * @param loops multiple loops in any order and orientation, z-coordinates ignored
+     * @returns a region that captures the input pointers. This region is a:
+     * * `Loop` if there is exactly one input loop. It is oriented counterclockwise.
+     * * `ParityRegion` if input consists of exactly one outer loop with at least one hole loop.
+     * Its first child is an outer loop oriented counterclockwise; all subsequent children are holes oriented clockwise.
+     * * `UnionRegion` if any other input configuration. Its children are individually ordered/oriented as in the above cases.
+     * @see PolygonOps.sortOuterAndHoleLoopsXY
      */
     static sortOuterAndHoleLoopsXY(loops) {
         const loopAndArea = [];
@@ -196261,6 +196282,8 @@ class RegionOpsFaceToFaceSearch {
             if (graphCheckPoint)
                 graphCheckPoint("After regularize", graph, "MR");
             const exteriorHalfEdge = _topology_HalfEdgeGraphSearch__WEBPACK_IMPORTED_MODULE_4__.HalfEdgeGraphSearch.findMinimumAreaFace(graph);
+            if (exteriorHalfEdge === undefined)
+                return undefined;
             const exteriorMask = _topology_Graph__WEBPACK_IMPORTED_MODULE_0__.HalfEdgeMask.EXTERIOR;
             const faceVisitedMask = graph.grabMask();
             const nodeVisitedMask = graph.grabMask();
@@ -208285,7 +208308,7 @@ __webpack_require__.r(__webpack_exports__);
 
 
 /* eslint-disable @itwin/prefer-get */
-// cSpell:words XXYZ YXYZ ZXYZ SaeedTorabi
+// cSpell:words XXYZ YXYZ ZXYZ SaeedTorabi arctan newcommand
 /**
  * PackedMatrix3dOps contains static methods for matrix operations where the matrix is a Float64Array.
  * * The Float64Array contains the matrix entries in row-major order
@@ -208581,7 +208604,7 @@ class Matrix3d {
             /**
              * Here we rotate this.columnX() around this.columnZ() by "angle" and expect to get other.columnX().
              * Then we rotate this.columnY() around this.columnZ() by the same "angle" and if we get other.columnY(),
-             * that means this` and `other` have X and Y columns differing only by a rotation around that Z.
+             * that means `this` and `other` have X and Y columns differing only by a rotation around column Z.
              */
             let column = _Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Vector3d.createRotateVectorAroundVector(columnX, columnZ, angle);
             if (other.isAlmostEqualColumnXYZ(0, column.x, column.y, column.z, tol)) {
@@ -209030,14 +209053,16 @@ class Matrix3d {
     static createColumnsXYW(vectorU, u, vectorV, v, vectorW, w, result) {
         return Matrix3d.createRowValues(vectorU.x, vectorV.x, vectorW.x, vectorU.y, vectorV.y, vectorW.y, u, v, w, result);
     }
-    /** Create a matrix from "as viewed" right and up vectors.
-     * * ColumnX points in the rightVector direction
-     * * ColumnY points in the upVector direction
+    /**
+     * Create a matrix from "as viewed" right and up vectors.
+     * * ColumnX points in the rightVector direction.
+     * * ColumnY points in the upVector direction.
      * * ColumnZ is a unit cross product of ColumnX and ColumnY.
      * * Optionally rotate by 45 degrees around `upVector` to bring its left or right vertical edge to center.
      * * Optionally rotate by arctan(1/sqrt(2)) ~ 35.264 degrees around `rightVector` to bring the top or bottom
      * horizontal edge of the view to the center (for isometric views).
-     * * This is expected to be used with various principal unit vectors that are perpendicular to each other.
+     *
+     * This is expected to be used with various principal unit vectors that are perpendicular to each other.
      * * STANDARD TOP VIEW: createViewedAxes(Vector3d.unitX(), Vector3d.unitY(), 0, 0)
      * * STANDARD FRONT VIEW: createViewedAxes(Vector3d.unitX(), Vector3d.unitZ(), 0, 0)
      * * STANDARD BACK VIEW: createViewedAxes(Vector3d.unitX(-1), Vector3d.unitZ(), 0, 0)
@@ -209526,6 +209551,18 @@ class Matrix3d {
             + this.coffs[3] * this.coffs[4]
             + this.coffs[6] * this.coffs[7];
     }
+    /** Return the dot product of column X with column Z */
+    columnXDotColumnZ() {
+        return this.coffs[0] * this.coffs[2]
+            + this.coffs[3] * this.coffs[5]
+            + this.coffs[6] * this.coffs[8];
+    }
+    /** Return the dot product of column Y with column Z */
+    columnYDotColumnZ() {
+        return this.coffs[1] * this.coffs[2]
+            + this.coffs[4] * this.coffs[5]
+            + this.coffs[7] * this.coffs[8];
+    }
     /**
      * Dot product of an indexed column with a vector given as x,y,z
      * @param columnIndex index of column. Must be 0,1,2.
@@ -209820,7 +209857,7 @@ class Matrix3d {
      * \text{Treating U as a row to the left of untransposed matrix\: return row}&\rowSubXYZ{V}&=&\rowSubXYZ{U}\matrixXY{A}
      * \end{matrix}
      * ```
-     * @return the vector result (optional)
+     * @param result the vector result (optional)
      */
     multiplyTransposeVector(vector, result) {
         result = result ? result : new _Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Vector3d();
@@ -209834,7 +209871,7 @@ class Matrix3d {
     }
     /**
      * Multiply the matrix * [x,y,z], i.e. the vector [x,y,z] is a column vector on the right.
-     * @return the vector result (optional)
+     * @param result the vector result (optional)
      */
     multiplyXYZ(x, y, z, result) {
         result = result ? result : new _Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Vector3d();
@@ -209859,7 +209896,7 @@ class Matrix3d {
     }
     /**
      * Multiply the matrix * [x,y,0], i.e. the vector [x,y,0] is a column vector on the right.
-     * @return the vector result (optional)
+     * @param result the vector result (optional)
      */
     multiplyXY(x, y, result) {
         result = result ? result : new _Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Vector3d();
@@ -209870,7 +209907,7 @@ class Matrix3d {
     }
     /**
      * Compute origin + the matrix * [x,y,0].
-     * @return the vector result (optional)
+     * @param result the Point3d result (optional)
      */
     originPlusMatrixTimesXY(origin, x, y, result) {
         return _Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Point3d.create(origin.x + this.coffs[0] * x + this.coffs[1] * y, origin.y + this.coffs[3] * x + this.coffs[4] * y, origin.z + this.coffs[6] * x + this.coffs[7] * y, result);
@@ -209878,7 +209915,7 @@ class Matrix3d {
     /**
      * Multiply the matrix * (x,y,z) in place, i.e. the vector (x,y,z) is a column vector on the right and
      * the multiplication updates the vector values.
-     * @param xyzData the vector data
+     * @param xyzData the vector data.
      */
     multiplyVectorInPlace(xyzData) {
         const x = xyzData.x;
@@ -209892,7 +209929,7 @@ class Matrix3d {
      * Multiply the transpose matrix times [x,y,z] in place, i.e. the vector [x,y,z] is a column vector on
      * the right and the multiplication updates the vector values.
      * * This is equivalent to `multiplyTransposeVector` but always returns the result directly in the input.
-     * @param xyzData the vector data
+     * @param vectorU the vector data
      */
     multiplyTransposeVectorInPlace(vectorU) {
         const x = vectorU.x;
@@ -209913,7 +209950,7 @@ class Matrix3d {
      * \phantom{8888}\text{and return V as a Vector3d} & & &
      * \end{matrix}
      * ````
-     * @return the vector result (optional)
+     * @param result the vector result (optional)
      */
     multiplyTransposeXYZ(x, y, z, result) {
         result = result ? result : new _Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Vector3d();
@@ -209924,8 +209961,8 @@ class Matrix3d {
     }
     /**
      * Solve `matrix * result = vector` for an unknown `result`.
-     * * This is equivalent to multiplication `result = inverse matrix * vector`.
-     * * Result is undefined if the matrix is singular (e.g. has parallel columns or a zero magnitude column)
+     * * This is equivalent to multiplication `result = matrixInverse * vector`.
+     * * Result is `undefined` if the matrix is singular (e.g. has parallel columns or a zero magnitude column)
      */
     multiplyInverse(vector, result) {
         this.computeCachedInverse(true);
@@ -209940,7 +209977,7 @@ class Matrix3d {
     /**
      * Solve `matrixTranspose * result = vector` for an unknown `result`.
      * * This is equivalent to multiplication `result = matrixInverseTranspose * vector`.
-     * * Result is undefined if the matrix is singular (e.g. has parallel columns or a zero magnitude column)
+     * * Result is `undefined` if the matrix is singular (e.g. has parallel columns or a zero magnitude column)
      */
     multiplyInverseTranspose(vector, result) {
         this.computeCachedInverse(true);
@@ -209955,7 +209992,7 @@ class Matrix3d {
     /**
      * Multiply `matrixInverse * [x,y,z]`.
      * * This is equivalent to solving `matrix * result = [x,y,z]` for an unknown `result`.
-     * * Result is undefined if the matrix is singular (e.g. has parallel columns or a zero magnitude column)
+     * * Result is `undefined` if the matrix is singular (e.g. has parallel columns or a zero magnitude column)
      * @return result as a Vector3d or undefined (if the matrix is singular).
      */
     multiplyInverseXYZAsVector3d(x, y, z, result) {
@@ -209968,7 +210005,7 @@ class Matrix3d {
     /**
      * Multiply `matrixInverse * [x,y,z]` and return result as `Point4d` with given weight.
      * * Equivalent to solving `matrix * result = [x,y,z]` for an unknown `result`.
-     * * Result is undefined if the matrix is singular (e.g. has parallel columns or a zero magnitude column)
+     * * Result is `undefined` if the matrix is singular (e.g. has parallel columns or a zero magnitude column)
      * @return result as a Point4d with the same weight.
      */
     multiplyInverseXYZW(x, y, z, w, result) {
@@ -209981,7 +210018,7 @@ class Matrix3d {
     /**
      * Multiply `matrixInverse * [x,y,z]` and return result as `Point3d`.
      * * Equivalent to solving `matrix * result = [x,y,z]` for an unknown `result`.
-     * @return result as a Point3d or undefined (if the matrix is singular).
+     * @return result as a Point3d or `undefined` (if the matrix is singular).
      */
     multiplyInverseXYZAsPoint3d(x, y, z, result) {
         this.computeCachedInverse(true);
@@ -209992,7 +210029,7 @@ class Matrix3d {
     }
     /**
      * Invoke a given matrix*matrix operation to compute the inverse matrix and set this.inverseCoffs
-     * * If either input coffA or coffB is undefined, set state to `InverseMatrixState.unknown` but
+     * * If either input coffA or coffB is `undefined`, set state to `InverseMatrixState.unknown` but
      * leave the inverseCoffs untouched.
      * @param f the given matrix*matrix operation that is called by this function to compute the inverse.
      * `f` must be a matrix*matrix operation. Otherwise, the function does not generate the inverse properly.
@@ -210214,10 +210251,12 @@ class Matrix3d {
      * * [A   B   C] ===> [A   B   AxB] ===> [A   (AxB)xA   AxB]
      *
      * This means that in the final matrix:
-     * * column A is same as original column A.
-     * * column B is linear combination of original A and B (i.e., is in the plane of original A and B).
-     * * column C is perpendicular to A and B of both the original and final.
+     * * first column is same as original column A.
+     * * second column is linear combination of original A and B (i.e., is in the plane of original A and B).
+     * * third column is perpendicular to first and second columns of both the original and final.
      * * original column C is overwritten and does not participate in the result.
+     *
+     * The final matrix will have 3 orthogonal columns.
      */
     axisOrderCrossProductsInPlace(axisOrder) {
         switch (axisOrder) {
@@ -210255,35 +210294,35 @@ class Matrix3d {
     }
     /**
      * Normalize each column in place.
-     * @param originalRowMagnitudes optional vector to store original column magnitudes.
-     * @returns Return true if all columns have non-zero lengths. Otherwise, return false.
-     * * If false is returned, the magnitudes are stored in the `originalRowMagnitudes` vector but no columns
+     * @param originalColumnMagnitudes optional vector to store original column magnitudes.
+     * @returns return true if all columns have non-zero lengths. Otherwise, return false.
+     * * If false is returned, the magnitudes are stored in the `originalColumnMagnitudes` vector but no columns
      * are altered.
      */
-    normalizeColumnsInPlace(originalRowMagnitudes) {
+    normalizeColumnsInPlace(originalColumnMagnitudes) {
         const ax = this.columnXMagnitude();
         const ay = this.columnYMagnitude();
         const az = this.columnZMagnitude();
-        if (originalRowMagnitudes)
-            originalRowMagnitudes.set(ax, ay, az);
+        if (originalColumnMagnitudes)
+            originalColumnMagnitudes.set(ax, ay, az);
         if (_Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.isSmallMetricDistance(ax) || _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.isSmallMetricDistance(ay) || _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.isSmallMetricDistance(az))
             return false;
         this.scaleColumns(1.0 / ax, 1.0 / ay, 1.0 / az, this);
         return true;
     }
     /**
-   * Normalize each row in place.
-   * @param originalColumnMagnitudes optional vector to store original row magnitudes.
-   * @returns Return true if all rows have non-zero lengths. Otherwise, return false.
-   * * If false is returned, the magnitudes are stored in the `originalColumnMagnitudes` vector but no rows
-   * are altered.
-   */
-    normalizeRowsInPlace(originalColumnMagnitudes) {
+     * Normalize each row in place.
+     * @param originalRowMagnitudes optional vector to store original row magnitudes.
+     * @returns return true if all rows have non-zero lengths. Otherwise, return false.
+     * * If false is returned, the magnitudes are stored in the `originalRowMagnitudes` vector but no rows
+     * are altered.
+     */
+    normalizeRowsInPlace(originalRowMagnitudes) {
         const ax = this.rowXMagnitude();
         const ay = this.rowYMagnitude();
         const az = this.rowZMagnitude();
-        if (originalColumnMagnitudes)
-            originalColumnMagnitudes.set(ax, ay, az);
+        if (originalRowMagnitudes)
+            originalRowMagnitudes.set(ax, ay, az);
         if (_Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.isSmallMetricDistance(ax) || _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.isSmallMetricDistance(ay) || _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.isSmallMetricDistance(az))
             return false;
         this.scaleRows(1.0 / ax, 1.0 / ay, 1.0 / az, this);
@@ -210305,7 +210344,7 @@ class Matrix3d {
      * Compute the inverse of `this` Matrix3d. The inverse is stored in `this.inverseCoffs` for later use.
      * @param useCacheIfAvailable if `true`, use the previously computed inverse if available. If `false`,
      * recompute the inverse.
-     * @returns Return `true` if the inverse is computed. Return `false` if matrix is singular.
+     * @returns return `true` if the inverse is computed. Return `false` if matrix is singular.
      */
     computeCachedInverse(useCacheIfAvailable) {
         if (useCacheIfAvailable && Matrix3d.useCachedInverse && this.inverseState !== InverseMatrixState.unknown) {
@@ -210318,10 +210357,11 @@ class Matrix3d {
         const inverseCoffs = this.inverseCoffs;
         /**
          * We calculate the inverse using cross products.
-         * Math details can be found at
-         * https://www.chilimath.com/lessons/advanced-algebra/determinant-3x3-matrix/
-         * In summary, if M = [A   B   C] then inverse of M = (1/det)[BxC   CxA   AxB] where det is the
-         * determinant of matrix M and can be calculated by "A dot BxC".
+         * Math details can be found at docs/learning/matrix/Matrix.md
+         *                    [   A   ]
+         * In summary, if M = [   B   ] then inverse of M = (1/det)[BxC   CxA   AxB] where
+         *                    [   C   ]
+         * det is the determinant of matrix M (which is equal to "A dot BxC").
          */
         Matrix3d.indexedRowCrossProduct(coffs, 3, 6, inverseCoffs, 0); // BxC
         Matrix3d.indexedRowCrossProduct(coffs, 6, 0, inverseCoffs, 1); // CxA
@@ -210363,19 +210403,30 @@ class Matrix3d {
         this.coffs[Matrix3d.flatIndexOf(row, column)] = value;
         this.inverseState = InverseMatrixState.unknown;
     }
-    /** create a Matrix3d whose columns are scaled copies of this Matrix3d.
-     * @param scaleX scale factor for column x
-     * @param scaleY scale factor for column y
-     * @param scaleZ scale factor for column z
-     * @param result optional preallocated result.
+    /**
+     * Create a Matrix3d whose values are uniformly scaled from `this` Matrix3d.
+     * @param scale scale factor to apply.
+     * @param result optional result.
+     * @returns return the scaled matrix.
+     */
+    scale(scale, result) {
+        return Matrix3d.createRowValues(this.coffs[0] * scale, this.coffs[1] * scale, this.coffs[2] * scale, this.coffs[3] * scale, this.coffs[4] * scale, this.coffs[5] * scale, this.coffs[6] * scale, this.coffs[7] * scale, this.coffs[8] * scale, result);
+    }
+    /**
+     * Create a Matrix3d whose columns are scaled copies of `this` Matrix3d.
+     * @param scaleX scale factor for column 0
+     * @param scaleY scale factor for column 1
+     * @param scaleZ scale factor for column 2
+     * @param result optional result
      */
     scaleColumns(scaleX, scaleY, scaleZ, result) {
         return Matrix3d.createRowValues(this.coffs[0] * scaleX, this.coffs[1] * scaleY, this.coffs[2] * scaleZ, this.coffs[3] * scaleX, this.coffs[4] * scaleY, this.coffs[5] * scaleZ, this.coffs[6] * scaleX, this.coffs[7] * scaleY, this.coffs[8] * scaleZ, result);
     }
-    /** Scale the columns of this Matrix3d.
-     * @param scaleX scale factor for column x
-     * @param scaleY scale factor for column y
-     * @param scaleZ scale factor for column z
+    /**
+     * Scale the columns of `this` Matrix3d in place.
+     * @param scaleX scale factor for column 0
+     * @param scaleY scale factor for column 1
+     * @param scaleZ scale factor for column 2
      */
     scaleColumnsInPlace(scaleX, scaleY, scaleZ) {
         this.coffs[0] *= scaleX;
@@ -210407,18 +210458,55 @@ class Matrix3d {
                 this.inverseState = InverseMatrixState.singular;
         }
     }
-    /** create a Matrix3d whose rows are scaled copies of this Matrix3d.
-     * @param scaleX scale factor for row x
-     * @param scaleY scale factor for row y
-     * @param scaleZ scale factor for row z
-     * @param result optional preallocated result.
+    /**
+     * Create a Matrix3d whose rows are scaled copies of `this` Matrix3d.
+     * @param scaleX scale factor for row 0
+     * @param scaleY scale factor for row 1
+     * @param scaleZ scale factor for row 2
+     * @param result optional result
      */
     scaleRows(scaleX, scaleY, scaleZ, result) {
         return Matrix3d.createRowValues(this.coffs[0] * scaleX, this.coffs[1] * scaleX, this.coffs[2] * scaleX, this.coffs[3] * scaleY, this.coffs[4] * scaleY, this.coffs[5] * scaleY, this.coffs[6] * scaleZ, this.coffs[7] * scaleZ, this.coffs[8] * scaleZ, result);
     }
     /**
-     * add scaled values from other Matrix3d to this Matrix3d
-     * @param other Matrix3d with values to be added
+     * Scale the rows of `this` Matrix3d in place.
+     * @param scaleX scale factor for row 0
+     * @param scaleY scale factor for row 1
+     * @param scaleZ scale factor for row 2
+     */
+    scaleRowsInPlace(scaleX, scaleY, scaleZ) {
+        this.coffs[0] *= scaleX;
+        this.coffs[1] *= scaleX;
+        this.coffs[2] *= scaleX;
+        this.coffs[3] *= scaleY;
+        this.coffs[4] *= scaleY;
+        this.coffs[5] *= scaleY;
+        this.coffs[6] *= scaleZ;
+        this.coffs[7] *= scaleZ;
+        this.coffs[8] *= scaleZ;
+        if (this.inverseState === InverseMatrixState.inverseStored && this.inverseCoffs !== undefined) {
+            // apply reciprocal scales to the COLUMNs of the inverse
+            const divX = _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.conditionalDivideFraction(1.0, scaleX);
+            const divY = _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.conditionalDivideFraction(1.0, scaleY);
+            const divZ = _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.conditionalDivideFraction(1.0, scaleZ);
+            if (divX !== undefined && divY !== undefined && divZ !== undefined) {
+                this.inverseCoffs[0] *= divX;
+                this.inverseCoffs[1] *= divY;
+                this.inverseCoffs[2] *= divZ;
+                this.inverseCoffs[3] *= divX;
+                this.inverseCoffs[4] *= divY;
+                this.inverseCoffs[5] *= divZ;
+                this.inverseCoffs[6] *= divX;
+                this.inverseCoffs[7] *= divY;
+                this.inverseCoffs[8] *= divZ;
+            }
+            else
+                this.inverseState = InverseMatrixState.singular;
+        }
+    }
+    /**
+     * Add scaled values from `other` Matrix3d to `this` Matrix3d.
+     * @param other Matrix3d with values to be added.
      * @param scale scale factor to apply to the added values.
      */
     addScaledInPlace(other, scale) {
@@ -210427,18 +210515,19 @@ class Matrix3d {
         this.inverseState = InverseMatrixState.unknown;
     }
     /**
-     * add scaled values from an outer product.
-     * * The scaled outer product is a "rank 1" matrix.
+     * Add scaled values from an outer product of vectors U and V.
+     * * The scaled outer product is a matrix with `rank 1` (all columns/rows are linearly dependent).
      * * This is useful in constructing mirrors and directional scales.
      * ```
      * equation
      * A += s \columnSubXYZ{U}\rowSubXYZ{V}
      * \\ \matrixXY{A} += s \begin{bmatrix}
-     * U_x * V_x & U_y * V_x & U_z * V_x \\
-     * U_x * V_y & U_y * V_y & U_z * V_y \\
-     * U_x * V_z & U_y * V_z & U_z * V_z \end{bmatrix}
+     * U_x * V_x & U_x * V_y & U_x * V_z \\
+     * U_y * V_x & U_y * V_y & U_y * V_z \\
+     * U_z * V_x & U_z * V_y & U_z * V_z \end{bmatrix}
      * ```
-     * @param other Matrix3d with values to be added
+     * @param vectorU first vector in the outer product.
+     * @param vectorV second vector in the outer product.
      * @param scale scale factor to apply to the added values.
      */
     addScaledOuterProductInPlace(vectorU, vectorV, scale) {
@@ -210453,14 +210542,6 @@ class Matrix3d {
         this.coffs[8] += scale * vectorU.z * vectorV.z;
         this.inverseState = InverseMatrixState.unknown;
     }
-    /** create a Matrix3d whose values are uniformly scaled from this.
-     * @param scale scale factor to apply.
-     * @param result optional preallocated result.
-     * @returns Return the new or repopulated matrix
-     */
-    scale(scale, result) {
-        return Matrix3d.createRowValues(this.coffs[0] * scale, this.coffs[1] * scale, this.coffs[2] * scale, this.coffs[3] * scale, this.coffs[4] * scale, this.coffs[5] * scale, this.coffs[6] * scale, this.coffs[7] * scale, this.coffs[8] * scale, result);
-    }
     /**
      * Create a rigid matrix (columns and rows are unit length and pairwise perpendicular) for
      * the given eye coordinate.
@@ -210483,7 +210564,6 @@ class Matrix3d {
                 result.scaleColumnsInPlace(1.0, -1.0, -1.0);
         }
         else {
-            // if coordinate is (x,y,0), i.e., Front or Back or Left or Right view
             /**
              * The matrix that the "else" statement creates is
              *        [-s   -s1*c    c1*c]
@@ -210513,57 +210593,56 @@ class Matrix3d {
         }
         return result;
     }
-    /** Return the determinant of this matrix. */
+    /** Return the determinant of `this` matrix. */
     determinant() {
         return this.coffs[0] * this.coffs[4] * this.coffs[8]
-            - this.coffs[0] * this.coffs[7] * this.coffs[5]
-            + this.coffs[3] * this.coffs[7] * this.coffs[2]
-            - this.coffs[3] * this.coffs[1] * this.coffs[8]
-            + this.coffs[6] * this.coffs[1] * this.coffs[5]
-            - this.coffs[6] * this.coffs[4] * this.coffs[2];
+            - this.coffs[0] * this.coffs[5] * this.coffs[7]
+            - this.coffs[1] * this.coffs[3] * this.coffs[8]
+            + this.coffs[1] * this.coffs[5] * this.coffs[6]
+            + this.coffs[2] * this.coffs[3] * this.coffs[7]
+            - this.coffs[2] * this.coffs[4] * this.coffs[6];
     }
-    /** Return an estimate of how independent the columns are.  Near zero is bad. Near 1 is good
+    /**
+     * Return an estimate of how independent the columns of `this` matrix are. Near zero is bad (i.e.,
+     * columns are almost dependent and matrix is nearly singular). Near 1 is good (i.e., columns are
+     * almost independent and matrix is invertible).
      */
     conditionNumber() {
         const determinant = this.determinant();
-        const columnMagnitudeProduct = _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.hypotenuseXYZ(this.coffs[0], this.coffs[3], this.coffs[6])
+        const columnMagnitudeSum = _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.hypotenuseXYZ(this.coffs[0], this.coffs[3], this.coffs[6])
             + _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.hypotenuseXYZ(this.coffs[1], this.coffs[4], this.coffs[7])
             + _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.hypotenuseXYZ(this.coffs[2], this.coffs[5], this.coffs[8]);
-        return _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.safeDivideFraction(determinant, columnMagnitudeProduct, 0.0);
+        return _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.safeDivideFraction(determinant, columnMagnitudeSum, 0.0);
     }
     /** Return the sum of squares of all entries */
     sumSquares() {
-        let i = 0;
         let sum = 0;
-        for (i = 0; i < 9; i++)
+        for (let i = 0; i < 9; i++)
             sum += this.coffs[i] * this.coffs[i];
         return sum;
     }
     /** Return the sum of squares of diagonal entries */
     sumDiagonalSquares() {
-        let i = 0;
         let sum = 0;
-        for (i = 0; i < 9; i += 4)
+        for (let i = 0; i < 9; i += 4)
             sum += this.coffs[i] * this.coffs[i];
         return sum;
     }
-    /** Return the sum of diagonal entries (also known as the trace) */
+    /** Return the matrix `trace` (sum of diagonal entries) */
     sumDiagonal() {
         return this.coffs[0] + this.coffs[4] + this.coffs[8];
     }
     /** Return the Maximum absolute value of any single entry */
     maxAbs() {
-        let i = 0;
         let max = 0;
-        for (i = 0; i < 9; i++)
+        for (let i = 0; i < 9; i++)
             max = Math.max(max, Math.abs(this.coffs[i]));
         return max;
     }
     /** Return the maximum absolute difference between corresponding entries of `this` and `other` */
     maxDiff(other) {
-        let i = 0;
         let max = 0;
-        for (i = 0; i < 9; i++)
+        for (let i = 0; i < 9; i++)
             max = Math.max(max, Math.abs(this.coffs[i] - other.coffs[i]));
         return max;
     }
@@ -210582,86 +210661,102 @@ class Matrix3d {
     get hasCachedInverse() {
         return this.inverseState === InverseMatrixState.inverseStored && this.inverseCoffs !== undefined;
     }
-    /** Test if the below diagonal entries are all nearly zero */
+    /** Test if the below diagonal entries (3,6,7) are all nearly zero */
     get isUpperTriangular() {
         const sumAll = this.sumSquares();
         const sumLow = _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.hypotenuseSquaredXYZ(this.coffs[3], this.coffs[6], this.coffs[7]);
         return Math.sqrt(sumLow) <= _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.smallAngleRadians * (1.0 + Math.sqrt(sumAll));
     }
-    /** If the matrix is diagonal and all diagonals are within tolerance, return the first diagonal.  Otherwise return undefined.
+    /** Test if the above diagonal entries (1,2,5) are all nearly zero */
+    get isLowerTriangular() {
+        const sumAll = this.sumSquares();
+        const sumLow = _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.hypotenuseSquaredXYZ(this.coffs[1], this.coffs[2], this.coffs[75]);
+        return Math.sqrt(sumLow) <= _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.smallAngleRadians * (1.0 + Math.sqrt(sumAll));
+    }
+    /**
+     * If the matrix is diagonal and all diagonals are almost equal, return the first diagonal (entry 0
+     * which is same as entry 4 and 8). Otherwise return `undefined`.
      */
     sameDiagonalScale() {
         const sumAll = this.sumSquares();
         const sumDiagonal = this.sumDiagonalSquares();
         const sumOff = Math.abs(sumAll - sumDiagonal);
         if (Math.sqrt(sumOff) <= _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.smallAngleRadians * (1.0 + Math.sqrt(sumAll))
-            && _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.isSameCoordinate(this.coffs[0], this.coffs[4]) && _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.isSameCoordinate(this.coffs[0], this.coffs[8]))
+            && _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.isSameCoordinate(this.coffs[0], this.coffs[4])
+            && _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.isSameCoordinate(this.coffs[0], this.coffs[8]))
             return this.coffs[0];
         return undefined;
     }
-    /** Sum of squared differences between symmetric pairs */
+    /** Sum of squared differences between symmetric pairs (entry 1 and 3 - 2 and 6 - 5 and 7) */
     sumSkewSquares() {
         return _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.hypotenuseSquaredXYZ(this.coffs[1] - this.coffs[3], this.coffs[2] - this.coffs[6], this.coffs[5] - this.coffs[7]);
     }
-    /** Test if the matrix is a pure rotation.
-     * @param allowMirror whether to widen the test to return true if the matrix is orthogonal (a pure rotation or a mirror)
+    /**
+     * Test if all rows and columns are unit length and are perpendicular to each other, i.e., the matrix is either
+     * a `pure rotation` (determinant is +1) or is a `mirror` (determinant is -1).
+     * * **Note:** such a matrix is called `orthogonal` and its inverse is its transpose.
+     */
+    testPerpendicularUnitRowsAndColumns() {
+        const product = this.multiplyMatrixMatrixTranspose(this);
+        return product.isIdentity;
+    }
+    /**
+     * Test if the matrix is a `rigid` matrix (or `pure rotation`, i.e., columns and rows are unit length and
+     * pairwise perpendicular and determinant is +1).
+     * @param allowMirror whether to widen the test to return true if the matrix is a `mirror` (determinant is -1).
     */
     isRigid(allowMirror = false) {
         return this.testPerpendicularUnitRowsAndColumns() && (allowMirror || this.determinant() > 0);
     }
-    /** Test if all rows and columns are perpendicular to each other and have equal length.
-     * If so, the length (or its negative) is the scale factor from a set of rigid axes to these axes.
-     * * result.rigidAxes is the rigid axes (with the scale factor removed)
-     * * result.scale is the scale factor
+    /**
+     * Test if all rows and columns are perpendicular to each other and have equal length.
+     * If so, the length (or its negative) is the `scale` factor from a set of `orthonormal axes` to
+     * the set of axes created by columns of `this` matrix. Otherwise, returns `undefined`.
+     * @returns returns `{ rigidAxes, scale }` where `rigidAxes` is a Matrix3d with its columns as the rigid axes
+     * (with the scale factor removed) and `scale` is the scale factor.
+     * * Note that determinant of a rigid matrix is +1.
+     * * The context for this method is to determine if the matrix is the product a `rotation` matrix and a uniform
+     * `scale` matrix (diagonal matrix with all diagonal entries the same nonzero number).
      */
     factorRigidWithSignedScale() {
         const product = this.multiplyMatrixMatrixTranspose(this);
-        const ss = product.sameDiagonalScale();
-        if (ss === undefined || ss <= 0.0)
+        const scaleSquare = product.sameDiagonalScale();
+        if (scaleSquare === undefined || scaleSquare <= 0.0)
             return undefined;
-        const s = this.determinant() > 0 ? Math.sqrt(ss) : -Math.sqrt(ss);
-        const divS = 1.0 / s;
-        const result = { rigidAxes: this.scaleColumns(divS, divS, divS), scale: s };
+        const scale = this.determinant() > 0 ? Math.sqrt(scaleSquare) : -Math.sqrt(scaleSquare);
+        const scaleInverse = 1.0 / scale;
+        const result = { rigidAxes: this.scaleColumns(scaleInverse, scaleInverse, scaleInverse), scale };
         return result;
     }
-    /** Test if the matrix is shuffles and negates columns. */
+    /** Test if `this` matrix reorders and/or negates the columns of the `identity` matrix. */
     get isSignedPermutation() {
         let count = 0;
         for (let row = 0; row < 3; row++)
             for (let col = 0; col < 3; col++) {
                 const q = this.at(row, col);
-                if (q === 0) { // This comment makes the block non-empty
+                if (q === 0) {
+                    // do nothing
                 }
                 else if (q === 1 || q === -1) {
-                    // the rest of this row and column should be 0.
-                    // "at" will apply cyclic indexing.
                     count++;
-                    if (this.at(row + 1, col) !== 0)
-                        return false;
-                    if (this.at(row + 2, col) !== 0)
-                        return false;
-                    if (this.at(row, col + 1) !== 0)
-                        return false;
-                    if (this.at(row, col + 2) !== 0)
+                    // if the rest of this row and column should be 0 ("at" will apply cyclic indexing)
+                    if ((this.at(row + 1, col) !== 0) || (this.at(row + 2, col) !== 0) ||
+                        (this.at(row, col + 1) !== 0) || (this.at(row, col + 2) !== 0))
                         return false;
                 }
-                else { // entry is not from 0,1,-1 . . .
+                else { // entry is not 0, 1, or -1
                     return false;
                 }
             }
         return count === 3;
     }
-    /** Test if all rows and columns are length 1 and are perpendicular to each other.  (I.e. the matrix is either a pure rotation with uniform scale factor of 1 or -1) */
-    testPerpendicularUnitRowsAndColumns() {
-        const product = this.multiplyMatrixMatrixTranspose(this);
-        return product.isIdentity;
-    }
-    /** Adjust the matrix in place so that:
-     * * columns are perpendicular and have unit length
-     * * transpose equals inverse
-     * * mirroring is removed
+    /**
+     * Adjust the matrix in place to make is a `rigid` matrix so that:
+     * * columns are perpendicular and have unit length.
+     * * transpose equals inverse.
+     * * mirroring is removed.
      * @param axisOrder how to reorder the matrix columns
-     * @return whether the instance is rigid on return
+     * @return whether the adjusted matrix is `rigid` on return
      */
     makeRigid(axisOrder = _Geometry__WEBPACK_IMPORTED_MODULE_0__.AxisOrder.XYZ) {
         const maxAbs = this.maxAbs();
@@ -210682,22 +210777,13 @@ class Matrix3d {
             return result;
         return undefined;
     }
-    static computeQuatTerm(numerator, denomCoff, reciprocal, diagSum) {
-        let coff;
-        const diagTol = 0.500;
-        if (diagSum > diagTol) {
-            coff = Math.sqrt(diagSum) * 0.5;
-            if (denomCoff * numerator < 0.0)
-                coff = -coff;
-        }
-        else {
-            coff = numerator * reciprocal;
-        }
-        return coff;
-    }
-    /** create a matrix from a quaternion.
-     * **WARNING:** There is frequent confusion over whether a "from quaternion" matrix is organized by rows and columns.
-     * **WARNING:** If you find that the matrix seems to rotate by the opposite angle expect it, transpose it.
+    /**
+     * Create a matrix from a quaternion.
+     * **WARNING:** There is frequent confusion over whether a "from quaternion" matrix is organized by
+     * rows or columns. If you find that the matrix seems to rotate by the opposite angle, transpose it.
+     *
+     * Some math details can be found at
+     * http://marc-b-reynolds.github.io/quaternions/2017/08/08/QuatRotMatrix.html
      */
     static createFromQuaternion(quat) {
         const qqx = quat.x * quat.x;
@@ -210710,31 +210796,57 @@ class Matrix3d {
         }
         else {
             const a = 1.0 / mag2;
-            const matrix = Matrix3d.createRowValues(a * (qqw + qqx - qqy - qqz), 2.0 * a * (quat.w * quat.z + quat.x * quat.y), 2.0 * a * (quat.x * quat.z - quat.w * quat.y), 2.0 * a * (quat.x * quat.y - quat.w * quat.z), a * (qqw - qqx + qqy - qqz), 2.0 * a * (quat.w * quat.x + quat.y * quat.z), 2.0 * a * (quat.x * quat.z + quat.w * quat.y), 2.0 * a * (quat.y * quat.z - quat.w * quat.x), a * (qqw - qqx - qqy + qqz));
+            const matrix = Matrix3d.createRowValues(
+            // first row
+            a * (qqw + qqx - qqy - qqz), 2.0 * a * (quat.w * quat.z + quat.x * quat.y), 2.0 * a * (quat.x * quat.z - quat.w * quat.y), 
+            // second row
+            2.0 * a * (quat.x * quat.y - quat.w * quat.z), a * (qqw - qqx + qqy - qqz), 2.0 * a * (quat.w * quat.x + quat.y * quat.z), 
+            // third row
+            2.0 * a * (quat.x * quat.z + quat.w * quat.y), 2.0 * a * (quat.y * quat.z - quat.w * quat.x), a * (qqw - qqx - qqy + qqz));
             return matrix;
         }
     }
-    /** convert the matrix to a quaternion.
-     * @note This calculation requires the matrix to have unit length rows and columns.
-     * **WARNING:** There is frequent confusion over whether a "from quaternion" matrix is organized by rows and columns.
-     * **WARNING:** If you find that the matrix seems to rotate by the opposite angle expect it, transpose it.
+    /** Calculate quaternion terms used to convert matrix to a quaternion */
+    static computeQuatTerm(numerator, denomCoff, reciprocal, diagSum) {
+        let coff;
+        const diagTol = 0.500;
+        if (diagSum > diagTol) {
+            coff = 0.5 * Math.sqrt(diagSum);
+            if (denomCoff * numerator < 0.0)
+                coff = -coff;
+        }
+        else {
+            coff = numerator * reciprocal;
+        }
+        return coff;
+    }
+    /**
+     * Create `this` matrix to a quaternion.
+     * **Note:** This calculation requires `this` matrix to have unit length rows and columns.
+     * **WARNING:** There is frequent confusion over whether a "from quaternion" matrix is organized by
+     * rows or columns. If you find that the matrix seems to rotate by the opposite angle, transpose it.
+     *
+     * Some math details can be found at
+     * http://marc-b-reynolds.github.io/quaternions/2017/08/08/QuatRotMatrix.html
      */
     toQuaternion() {
         const result = _geometry4d_Point4d__WEBPACK_IMPORTED_MODULE_4__.Point4d.createZero();
-        const props = [[this.coffs[0], this.coffs[3], this.coffs[6]],
+        const props = [
+            [this.coffs[0], this.coffs[3], this.coffs[6]],
             [this.coffs[1], this.coffs[4], this.coffs[7]],
-            [this.coffs[2], this.coffs[5], this.coffs[8]]];
+            [this.coffs[2], this.coffs[5], this.coffs[8]],
+        ];
         const xx = props[0][0];
         const yy = props[1][1];
         const zz = props[2][2];
         const dSum = [];
-        let denom, maxIndex, i;
         dSum[0] = 1.0 + xx - yy - zz;
         dSum[1] = 1.0 - xx + yy - zz;
         dSum[2] = 1.0 - xx - yy + zz;
         dSum[3] = 1.0 + xx + yy + zz;
-        maxIndex = 0;
-        for (i = 1; i < 4; i++) {
+        let denom;
+        let maxIndex = 0;
+        for (let i = 1; i <= 3; i++) {
             if (dSum[i] > dSum[maxIndex])
                 maxIndex = i;
         }
@@ -212684,13 +212796,10 @@ __webpack_require__.r(__webpack_exports__);
 /** @packageDocumentation
  * @module CartesianGeometry
  */
-// cspell:word CWXY
-// cspell:word arctan
-// cspell:word Rodrigues
 
 
 
-// cspell:word CCWXY
+// cspell:words CWXY CCWXY arctan Rodrigues
 /**
  *  * `XYZ` is a minimal object containing x,y,z and operations that are meaningful without change in both point and vector.
  *  * `XYZ` is not instantiable.
@@ -213429,9 +213538,9 @@ class Vector3d extends XYZ {
     }
     /**
      * Return a vector defined by start and end points (end - start).
-     * @param start start point for vector
-     * @param end end point for vector
-     * @param result optional result
+     * @param start start point for vector.
+     * @param end end point for vector.
+     * @param result optional result.
      */
     static createStartEnd(start, end, result) {
         const zStart = XYZ.accessZ(start, 0.0);
@@ -213445,22 +213554,22 @@ class Vector3d extends XYZ {
     }
     /**
      * Return a vector (optionally in preallocated result, otherwise newly created) from [x0,y0,z0] to [x1,y1,z1]
-     * @param x0 start point x coordinate
-     * @param y0 start point y coordinate
-     * @param z0 start point z coordinate
-     * @param x1 end point x coordinate
-     * @param y1 end point y coordinate
-     * @param z1 end point z coordinate
-     * @param result optional result vector
+     * @param x0 start point x coordinate.
+     * @param y0 start point y coordinate.
+     * @param z0 start point z coordinate.
+     * @param x1 end point x coordinate.
+     * @param y1 end point y coordinate.
+     * @param z1 end point z coordinate.
+     * @param result optional result vector.
      */
     static createStartEndXYZXYZ(x0, y0, z0, x1, y1, z1, result) {
         return this.create(x1 - x0, y1 - y0, z1 - z0, result);
     }
     /**
-     * Return a vector which is the input vector rotated around the axis vector.
-     * @param vector initial vector
-     * @param axis axis of rotation
-     * @param angle angle of rotation.  If undefined, 90 degrees is implied
+     * Return a vector which is the input `vector` rotated by `angle` around the `axis` vector.
+     * @param vector initial vector.
+     * @param axis axis of rotation.
+     * @param angle angle of rotation.  If undefined, 90 degrees is implied.
      * @param result optional result vector
      * @returns undefined if axis has no length.
      */
@@ -213484,7 +213593,7 @@ class Vector3d extends XYZ {
     }
     /**
      * Set (replace) xyz components so they are a vector from point0 to point1
-     * @param point0 start point of computed vector
+     * @param point0 start point of computed vector.
      * @param point1 end point of computed vector.
      */
     setStartEnd(point0, point1) {
@@ -216111,15 +216220,12 @@ class PolygonOps {
         return numReverse;
     }
     /**
-     * Reverse loops as necessary to make them all have CCW orientation for given outward normal.
-     * * Return an array of arrays which capture the input pointers.
-     * * In each first level array:
-     *    * The first loop is an outer loop.
-     *    * all subsequent loops are holes
-     *    * The outer loop is CCW
-     *    * The holes are CW.
-     * * Call RegionOps.sortOuterAndHoleLoopsXY to have the result returned as a UnionRegion
-     * @param loops multiple loops to sort and reverse.
+     * Reverse and reorder loops in the xy-plane for consistency and containment.
+     * @param loops multiple polygons in any order and orientation, z-coordinates ignored
+     * @returns array of arrays of polygons that capture the input pointers. In each first level array:
+     * * The first polygon is an outer loop, oriented counterclockwise.
+     * * Any subsequent polygons are holes of the outer loop, oriented clockwise.
+     * @see RegionOps.sortOuterAndHoleLoopsXY
      */
     static sortOuterAndHoleLoopsXY(loops) {
         const loopAndArea = [];
@@ -216132,6 +216238,7 @@ class PolygonOps {
      * Exactly like `sortOuterAndHoleLoopsXY` but allows loops in any plane.
      * @param loops multiple loops to sort and reverse.
      * @param defaultNormal optional normal for the loops, if known
+     * @see sortOuterAndHoleLoopsXY
      */
     static sortOuterAndHoleLoops(loops, defaultNormal) {
         const localToWorld = _FrameBuilder__WEBPACK_IMPORTED_MODULE_9__.FrameBuilder.createRightHandedFrame(defaultNormal, loops);
@@ -230950,43 +231057,44 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */ __webpack_require__.d(__webpack_exports__, {
 /* harmony export */   "PolyfaceBuilder": () => (/* binding */ PolyfaceBuilder)
 /* harmony export */ });
-/* harmony import */ var _curve_ConstructCurveBetweenCurves__WEBPACK_IMPORTED_MODULE_20__ = __webpack_require__(/*! ../curve/ConstructCurveBetweenCurves */ "../../core/geometry/lib/esm/curve/ConstructCurveBetweenCurves.js");
+/* harmony import */ var _curve_ConstructCurveBetweenCurves__WEBPACK_IMPORTED_MODULE_21__ = __webpack_require__(/*! ../curve/ConstructCurveBetweenCurves */ "../../core/geometry/lib/esm/curve/ConstructCurveBetweenCurves.js");
 /* harmony import */ var _curve_CurveCollection__WEBPACK_IMPORTED_MODULE_13__ = __webpack_require__(/*! ../curve/CurveCollection */ "../../core/geometry/lib/esm/curve/CurveCollection.js");
-/* harmony import */ var _curve_CurveFactory__WEBPACK_IMPORTED_MODULE_29__ = __webpack_require__(/*! ../curve/CurveFactory */ "../../core/geometry/lib/esm/curve/CurveFactory.js");
-/* harmony import */ var _curve_CurvePrimitive__WEBPACK_IMPORTED_MODULE_19__ = __webpack_require__(/*! ../curve/CurvePrimitive */ "../../core/geometry/lib/esm/curve/CurvePrimitive.js");
-/* harmony import */ var _curve_GeometryQuery__WEBPACK_IMPORTED_MODULE_32__ = __webpack_require__(/*! ../curve/GeometryQuery */ "../../core/geometry/lib/esm/curve/GeometryQuery.js");
+/* harmony import */ var _curve_CurveFactory__WEBPACK_IMPORTED_MODULE_30__ = __webpack_require__(/*! ../curve/CurveFactory */ "../../core/geometry/lib/esm/curve/CurveFactory.js");
+/* harmony import */ var _curve_CurvePrimitive__WEBPACK_IMPORTED_MODULE_20__ = __webpack_require__(/*! ../curve/CurvePrimitive */ "../../core/geometry/lib/esm/curve/CurvePrimitive.js");
+/* harmony import */ var _curve_GeometryQuery__WEBPACK_IMPORTED_MODULE_33__ = __webpack_require__(/*! ../curve/GeometryQuery */ "../../core/geometry/lib/esm/curve/GeometryQuery.js");
 /* harmony import */ var _curve_LineString3d__WEBPACK_IMPORTED_MODULE_11__ = __webpack_require__(/*! ../curve/LineString3d */ "../../core/geometry/lib/esm/curve/LineString3d.js");
 /* harmony import */ var _curve_ParityRegion__WEBPACK_IMPORTED_MODULE_12__ = __webpack_require__(/*! ../curve/ParityRegion */ "../../core/geometry/lib/esm/curve/ParityRegion.js");
 /* harmony import */ var _curve_Query_CylindricalRange__WEBPACK_IMPORTED_MODULE_17__ = __webpack_require__(/*! ../curve/Query/CylindricalRange */ "../../core/geometry/lib/esm/curve/Query/CylindricalRange.js");
 /* harmony import */ var _curve_Query_StrokeCountChain__WEBPACK_IMPORTED_MODULE_16__ = __webpack_require__(/*! ../curve/Query/StrokeCountChain */ "../../core/geometry/lib/esm/curve/Query/StrokeCountChain.js");
 /* harmony import */ var _curve_StrokeOptions__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ../curve/StrokeOptions */ "../../core/geometry/lib/esm/curve/StrokeOptions.js");
+/* harmony import */ var _curve_UnionRegion__WEBPACK_IMPORTED_MODULE_18__ = __webpack_require__(/*! ../curve/UnionRegion */ "../../core/geometry/lib/esm/curve/UnionRegion.js");
 /* harmony import */ var _Geometry__WEBPACK_IMPORTED_MODULE_8__ = __webpack_require__(/*! ../Geometry */ "../../core/geometry/lib/esm/Geometry.js");
-/* harmony import */ var _geometry3d_Angle__WEBPACK_IMPORTED_MODULE_34__ = __webpack_require__(/*! ../geometry3d/Angle */ "../../core/geometry/lib/esm/geometry3d/Angle.js");
-/* harmony import */ var _geometry3d_BilinearPatch__WEBPACK_IMPORTED_MODULE_21__ = __webpack_require__(/*! ../geometry3d/BilinearPatch */ "../../core/geometry/lib/esm/geometry3d/BilinearPatch.js");
-/* harmony import */ var _geometry3d_FrameBuilder__WEBPACK_IMPORTED_MODULE_23__ = __webpack_require__(/*! ../geometry3d/FrameBuilder */ "../../core/geometry/lib/esm/geometry3d/FrameBuilder.js");
+/* harmony import */ var _geometry3d_Angle__WEBPACK_IMPORTED_MODULE_35__ = __webpack_require__(/*! ../geometry3d/Angle */ "../../core/geometry/lib/esm/geometry3d/Angle.js");
+/* harmony import */ var _geometry3d_BilinearPatch__WEBPACK_IMPORTED_MODULE_22__ = __webpack_require__(/*! ../geometry3d/BilinearPatch */ "../../core/geometry/lib/esm/geometry3d/BilinearPatch.js");
+/* harmony import */ var _geometry3d_FrameBuilder__WEBPACK_IMPORTED_MODULE_24__ = __webpack_require__(/*! ../geometry3d/FrameBuilder */ "../../core/geometry/lib/esm/geometry3d/FrameBuilder.js");
 /* harmony import */ var _geometry3d_GeometryHandler__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ../geometry3d/GeometryHandler */ "../../core/geometry/lib/esm/geometry3d/GeometryHandler.js");
-/* harmony import */ var _geometry3d_GrowableFloat64Array__WEBPACK_IMPORTED_MODULE_26__ = __webpack_require__(/*! ../geometry3d/GrowableFloat64Array */ "../../core/geometry/lib/esm/geometry3d/GrowableFloat64Array.js");
+/* harmony import */ var _geometry3d_GrowableFloat64Array__WEBPACK_IMPORTED_MODULE_27__ = __webpack_require__(/*! ../geometry3d/GrowableFloat64Array */ "../../core/geometry/lib/esm/geometry3d/GrowableFloat64Array.js");
 /* harmony import */ var _geometry3d_GrowableXYZArray__WEBPACK_IMPORTED_MODULE_10__ = __webpack_require__(/*! ../geometry3d/GrowableXYZArray */ "../../core/geometry/lib/esm/geometry3d/GrowableXYZArray.js");
-/* harmony import */ var _geometry3d_IndexedXYZCollection__WEBPACK_IMPORTED_MODULE_31__ = __webpack_require__(/*! ../geometry3d/IndexedXYZCollection */ "../../core/geometry/lib/esm/geometry3d/IndexedXYZCollection.js");
+/* harmony import */ var _geometry3d_IndexedXYZCollection__WEBPACK_IMPORTED_MODULE_32__ = __webpack_require__(/*! ../geometry3d/IndexedXYZCollection */ "../../core/geometry/lib/esm/geometry3d/IndexedXYZCollection.js");
 /* harmony import */ var _geometry3d_Matrix3d__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! ../geometry3d/Matrix3d */ "../../core/geometry/lib/esm/geometry3d/Matrix3d.js");
-/* harmony import */ var _geometry3d_Plane3dByOriginAndVectors__WEBPACK_IMPORTED_MODULE_27__ = __webpack_require__(/*! ../geometry3d/Plane3dByOriginAndVectors */ "../../core/geometry/lib/esm/geometry3d/Plane3dByOriginAndVectors.js");
+/* harmony import */ var _geometry3d_Plane3dByOriginAndVectors__WEBPACK_IMPORTED_MODULE_28__ = __webpack_require__(/*! ../geometry3d/Plane3dByOriginAndVectors */ "../../core/geometry/lib/esm/geometry3d/Plane3dByOriginAndVectors.js");
 /* harmony import */ var _geometry3d_Point2dVector2d__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../geometry3d/Point2dVector2d */ "../../core/geometry/lib/esm/geometry3d/Point2dVector2d.js");
-/* harmony import */ var _geometry3d_Point3dArrayCarrier__WEBPACK_IMPORTED_MODULE_30__ = __webpack_require__(/*! ../geometry3d/Point3dArrayCarrier */ "../../core/geometry/lib/esm/geometry3d/Point3dArrayCarrier.js");
+/* harmony import */ var _geometry3d_Point3dArrayCarrier__WEBPACK_IMPORTED_MODULE_31__ = __webpack_require__(/*! ../geometry3d/Point3dArrayCarrier */ "../../core/geometry/lib/esm/geometry3d/Point3dArrayCarrier.js");
 /* harmony import */ var _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../geometry3d/Point3dVector3d */ "../../core/geometry/lib/esm/geometry3d/Point3dVector3d.js");
-/* harmony import */ var _geometry3d_PolygonOps__WEBPACK_IMPORTED_MODULE_24__ = __webpack_require__(/*! ../geometry3d/PolygonOps */ "../../core/geometry/lib/esm/geometry3d/PolygonOps.js");
+/* harmony import */ var _geometry3d_PolygonOps__WEBPACK_IMPORTED_MODULE_25__ = __webpack_require__(/*! ../geometry3d/PolygonOps */ "../../core/geometry/lib/esm/geometry3d/PolygonOps.js");
 /* harmony import */ var _geometry3d_Range__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ../geometry3d/Range */ "../../core/geometry/lib/esm/geometry3d/Range.js");
 /* harmony import */ var _geometry3d_Segment1d__WEBPACK_IMPORTED_MODULE_14__ = __webpack_require__(/*! ../geometry3d/Segment1d */ "../../core/geometry/lib/esm/geometry3d/Segment1d.js");
 /* harmony import */ var _geometry3d_Transform__WEBPACK_IMPORTED_MODULE_9__ = __webpack_require__(/*! ../geometry3d/Transform */ "../../core/geometry/lib/esm/geometry3d/Transform.js");
 /* harmony import */ var _geometry3d_UVSurfaceOps__WEBPACK_IMPORTED_MODULE_15__ = __webpack_require__(/*! ../geometry3d/UVSurfaceOps */ "../../core/geometry/lib/esm/geometry3d/UVSurfaceOps.js");
-/* harmony import */ var _solid_SweepContour__WEBPACK_IMPORTED_MODULE_18__ = __webpack_require__(/*! ../solid/SweepContour */ "../../core/geometry/lib/esm/solid/SweepContour.js");
-/* harmony import */ var _topology_Graph__WEBPACK_IMPORTED_MODULE_22__ = __webpack_require__(/*! ../topology/Graph */ "../../core/geometry/lib/esm/topology/Graph.js");
-/* harmony import */ var _topology_Triangulation__WEBPACK_IMPORTED_MODULE_25__ = __webpack_require__(/*! ../topology/Triangulation */ "../../core/geometry/lib/esm/topology/Triangulation.js");
+/* harmony import */ var _solid_SweepContour__WEBPACK_IMPORTED_MODULE_19__ = __webpack_require__(/*! ../solid/SweepContour */ "../../core/geometry/lib/esm/solid/SweepContour.js");
+/* harmony import */ var _topology_Graph__WEBPACK_IMPORTED_MODULE_23__ = __webpack_require__(/*! ../topology/Graph */ "../../core/geometry/lib/esm/topology/Graph.js");
+/* harmony import */ var _topology_Triangulation__WEBPACK_IMPORTED_MODULE_26__ = __webpack_require__(/*! ../topology/Triangulation */ "../../core/geometry/lib/esm/topology/Triangulation.js");
 /* harmony import */ var _BoxTopology__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ./BoxTopology */ "../../core/geometry/lib/esm/polyface/BoxTopology.js");
-/* harmony import */ var _GreedyTriangulationBetweenLineStrings__WEBPACK_IMPORTED_MODULE_28__ = __webpack_require__(/*! ./GreedyTriangulationBetweenLineStrings */ "../../core/geometry/lib/esm/polyface/GreedyTriangulationBetweenLineStrings.js");
-/* harmony import */ var _IndexedEdgeMatcher__WEBPACK_IMPORTED_MODULE_36__ = __webpack_require__(/*! ./IndexedEdgeMatcher */ "../../core/geometry/lib/esm/polyface/IndexedEdgeMatcher.js");
-/* harmony import */ var _IndexedPolyfaceVisitor__WEBPACK_IMPORTED_MODULE_35__ = __webpack_require__(/*! ./IndexedPolyfaceVisitor */ "../../core/geometry/lib/esm/polyface/IndexedPolyfaceVisitor.js");
+/* harmony import */ var _GreedyTriangulationBetweenLineStrings__WEBPACK_IMPORTED_MODULE_29__ = __webpack_require__(/*! ./GreedyTriangulationBetweenLineStrings */ "../../core/geometry/lib/esm/polyface/GreedyTriangulationBetweenLineStrings.js");
+/* harmony import */ var _IndexedEdgeMatcher__WEBPACK_IMPORTED_MODULE_37__ = __webpack_require__(/*! ./IndexedEdgeMatcher */ "../../core/geometry/lib/esm/polyface/IndexedEdgeMatcher.js");
+/* harmony import */ var _IndexedPolyfaceVisitor__WEBPACK_IMPORTED_MODULE_36__ = __webpack_require__(/*! ./IndexedPolyfaceVisitor */ "../../core/geometry/lib/esm/polyface/IndexedPolyfaceVisitor.js");
 /* harmony import */ var _Polyface__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ./Polyface */ "../../core/geometry/lib/esm/polyface/Polyface.js");
-/* harmony import */ var _PolyfaceQuery__WEBPACK_IMPORTED_MODULE_33__ = __webpack_require__(/*! ./PolyfaceQuery */ "../../core/geometry/lib/esm/polyface/PolyfaceQuery.js");
+/* harmony import */ var _PolyfaceQuery__WEBPACK_IMPORTED_MODULE_34__ = __webpack_require__(/*! ./PolyfaceQuery */ "../../core/geometry/lib/esm/polyface/PolyfaceQuery.js");
 /*---------------------------------------------------------------------------------------------
 * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
 * See LICENSE.md in the project root for license terms and full copyright notice.
@@ -231026,6 +231134,7 @@ __webpack_require__.r(__webpack_exports__);
 
 
 
+
 
 
 /* eslint-disable @typescript-eslint/naming-convention, @typescript-eslint/prefer-for-of */
@@ -232057,7 +232166,11 @@ class PolyfaceBuilder extends _geometry3d_GeometryHandler__WEBPACK_IMPORTED_MODU
      * Construct facets for any planar region
      */
     addTriangulatedRegion(region) {
-        const contour = _solid_SweepContour__WEBPACK_IMPORTED_MODULE_18__.SweepContour.createForLinearSweep(region);
+        if (region instanceof _curve_UnionRegion__WEBPACK_IMPORTED_MODULE_18__.UnionRegion) {
+            for (const child of region.children)
+                this.addTriangulatedRegion(child);
+        }
+        const contour = _solid_SweepContour__WEBPACK_IMPORTED_MODULE_19__.SweepContour.createForLinearSweep(region);
         if (contour)
             contour.emitFacets(this, this.reversedFlag, undefined);
     }
@@ -232068,7 +232181,7 @@ class PolyfaceBuilder extends _geometry3d_GeometryHandler__WEBPACK_IMPORTED_MODU
      */
     applyStrokeCountsToCurvePrimitives(data) {
         const options = this._options;
-        if (data instanceof _curve_CurvePrimitive__WEBPACK_IMPORTED_MODULE_19__.CurvePrimitive) {
+        if (data instanceof _curve_CurvePrimitive__WEBPACK_IMPORTED_MODULE_20__.CurvePrimitive) {
             data.computeStrokeCountForOptions(options);
         }
         else if (data instanceof _curve_CurveCollection__WEBPACK_IMPORTED_MODULE_13__.CurveCollection) {
@@ -232084,7 +232197,7 @@ class PolyfaceBuilder extends _geometry3d_GeometryHandler__WEBPACK_IMPORTED_MODU
         const fractions = [0.0];
         for (let vIndex = 1; vIndex < numVEdge; vIndex++) {
             const vFraction = vIndex / numVEdge;
-            const strokeA = _curve_ConstructCurveBetweenCurves__WEBPACK_IMPORTED_MODULE_20__.ConstructCurveBetweenCurves.interpolateBetween(stroke0, vIndex / numVEdge, stroke1);
+            const strokeA = _curve_ConstructCurveBetweenCurves__WEBPACK_IMPORTED_MODULE_21__.ConstructCurveBetweenCurves.interpolateBetween(stroke0, vIndex / numVEdge, stroke1);
             strokeSets.push(strokeA);
             fractions.push(vFraction);
         }
@@ -232268,23 +232381,23 @@ class PolyfaceBuilder extends _geometry3d_GeometryHandler__WEBPACK_IMPORTED_MODU
         // Wrap the 4 out-of-plane faces as a single parameters space with "distance" advancing in x then y then negative x then negative y ...
         const uParamRange = _geometry3d_Segment1d__WEBPACK_IMPORTED_MODULE_14__.Segment1d.create(0, xLength);
         const vParamRange = _geometry3d_Segment1d__WEBPACK_IMPORTED_MODULE_14__.Segment1d.create(0, zLength);
-        this.addUVGridBody(_geometry3d_BilinearPatch__WEBPACK_IMPORTED_MODULE_21__.BilinearPatch.create(corners[0], corners[1], corners[4], corners[5]), numX, numZ, uParamRange, vParamRange);
+        this.addUVGridBody(_geometry3d_BilinearPatch__WEBPACK_IMPORTED_MODULE_22__.BilinearPatch.create(corners[0], corners[1], corners[4], corners[5]), numX, numZ, uParamRange, vParamRange);
         uParamRange.shift(xLength);
-        this.addUVGridBody(_geometry3d_BilinearPatch__WEBPACK_IMPORTED_MODULE_21__.BilinearPatch.create(corners[1], corners[3], corners[5], corners[7]), numY, numZ, uParamRange, vParamRange);
+        this.addUVGridBody(_geometry3d_BilinearPatch__WEBPACK_IMPORTED_MODULE_22__.BilinearPatch.create(corners[1], corners[3], corners[5], corners[7]), numY, numZ, uParamRange, vParamRange);
         uParamRange.shift(yLength);
-        this.addUVGridBody(_geometry3d_BilinearPatch__WEBPACK_IMPORTED_MODULE_21__.BilinearPatch.create(corners[3], corners[2], corners[7], corners[6]), numX, numZ, uParamRange, vParamRange);
+        this.addUVGridBody(_geometry3d_BilinearPatch__WEBPACK_IMPORTED_MODULE_22__.BilinearPatch.create(corners[3], corners[2], corners[7], corners[6]), numX, numZ, uParamRange, vParamRange);
         uParamRange.shift(xLength);
-        this.addUVGridBody(_geometry3d_BilinearPatch__WEBPACK_IMPORTED_MODULE_21__.BilinearPatch.create(corners[2], corners[0], corners[6], corners[4]), numY, numZ, uParamRange, vParamRange);
+        this.addUVGridBody(_geometry3d_BilinearPatch__WEBPACK_IMPORTED_MODULE_22__.BilinearPatch.create(corners[2], corners[0], corners[6], corners[4]), numY, numZ, uParamRange, vParamRange);
         // finally end that wraparound face !!
         this.endFace();
         if (box.capped) {
             uParamRange.set(0.0, xLength);
             vParamRange.set(0.0, yLength);
-            this.addUVGridBody(_geometry3d_BilinearPatch__WEBPACK_IMPORTED_MODULE_21__.BilinearPatch.create(corners[4], corners[5], corners[6], corners[7]), numX, numY, uParamRange, vParamRange);
+            this.addUVGridBody(_geometry3d_BilinearPatch__WEBPACK_IMPORTED_MODULE_22__.BilinearPatch.create(corners[4], corners[5], corners[6], corners[7]), numX, numY, uParamRange, vParamRange);
             this.endFace();
             uParamRange.set(0.0, xLength);
             vParamRange.set(0.0, yLength);
-            this.addUVGridBody(_geometry3d_BilinearPatch__WEBPACK_IMPORTED_MODULE_21__.BilinearPatch.create(corners[2], corners[3], corners[0], corners[1]), numX, numY, uParamRange, vParamRange);
+            this.addUVGridBody(_geometry3d_BilinearPatch__WEBPACK_IMPORTED_MODULE_22__.BilinearPatch.create(corners[2], corners[3], corners[0], corners[1]), numX, numY, uParamRange, vParamRange);
             this.endFace();
         }
     }
@@ -232453,6 +232566,8 @@ class PolyfaceBuilder extends _geometry3d_GeometryHandler__WEBPACK_IMPORTED_MODU
     handleLoop(g) { return this.addTriangulatedRegion(g); }
     /** Double dispatch handler for ParityRegion */
     handleParityRegion(g) { return this.addTriangulatedRegion(g); }
+    /** Double dispatch handler for UnionRegion */
+    handleUnionRegion(g) { return this.addTriangulatedRegion(g); }
     /** add facets for a GeometryQuery object.   This is double dispatch through `dispatchToGeometryHandler(this)` */
     addGeometryQuery(g) { g.dispatchToGeometryHandler(this); }
     /**
@@ -232463,7 +232578,7 @@ class PolyfaceBuilder extends _geometry3d_GeometryHandler__WEBPACK_IMPORTED_MODU
      * * Rely on the builder's compress step to find common vertex coordinates
      * @internal
      */
-    addGraph(graph, needParams, acceptFaceFunction = _topology_Graph__WEBPACK_IMPORTED_MODULE_22__.HalfEdge.testNodeMaskNotExterior, isEdgeVisibleFunction = _topology_Graph__WEBPACK_IMPORTED_MODULE_22__.HalfEdge.testMateMaskExterior) {
+    addGraph(graph, needParams, acceptFaceFunction = _topology_Graph__WEBPACK_IMPORTED_MODULE_23__.HalfEdge.testNodeMaskNotExterior, isEdgeVisibleFunction = _topology_Graph__WEBPACK_IMPORTED_MODULE_23__.HalfEdge.testMateMaskExterior) {
         let index = 0;
         const needNormals = this._options.needNormals;
         let normalIndex = 0;
@@ -232513,7 +232628,7 @@ class PolyfaceBuilder extends _geometry3d_GeometryHandler__WEBPACK_IMPORTED_MODU
     /** Create a polyface containing the faces of a HalfEdgeGraph, with test function to filter faces.
      * @internal
      */
-    static graphToPolyface(graph, options, acceptFaceFunction = _topology_Graph__WEBPACK_IMPORTED_MODULE_22__.HalfEdge.testNodeMaskNotExterior) {
+    static graphToPolyface(graph, options, acceptFaceFunction = _topology_Graph__WEBPACK_IMPORTED_MODULE_23__.HalfEdge.testNodeMaskNotExterior) {
         const builder = PolyfaceBuilder.create(options);
         builder.addGraph(graph, builder.options.needParams, acceptFaceFunction);
         builder.endFace();
@@ -232533,13 +232648,13 @@ class PolyfaceBuilder extends _geometry3d_GeometryHandler__WEBPACK_IMPORTED_MODU
      */
     static polygonToTriangulatedPolyface(points, localToWorld) {
         if (!localToWorld)
-            localToWorld = _geometry3d_FrameBuilder__WEBPACK_IMPORTED_MODULE_23__.FrameBuilder.createFrameWithCCWPolygon(points);
+            localToWorld = _geometry3d_FrameBuilder__WEBPACK_IMPORTED_MODULE_24__.FrameBuilder.createFrameWithCCWPolygon(points);
         if (localToWorld) {
             const localPoints = localToWorld.multiplyInversePoint3dArray(points);
-            const areaXY = _geometry3d_PolygonOps__WEBPACK_IMPORTED_MODULE_24__.PolygonOps.areaXY(localPoints);
+            const areaXY = _geometry3d_PolygonOps__WEBPACK_IMPORTED_MODULE_25__.PolygonOps.areaXY(localPoints);
             if (areaXY < 0.0)
                 localPoints.reverse();
-            const graph = _topology_Triangulation__WEBPACK_IMPORTED_MODULE_25__.Triangulator.createTriangulatedGraphFromSingleLoop(localPoints);
+            const graph = _topology_Triangulation__WEBPACK_IMPORTED_MODULE_26__.Triangulator.createTriangulatedGraphFromSingleLoop(localPoints);
             if (graph) {
                 const polyface = this.graphToPolyface(graph);
                 polyface.tryTransformInPlace(localToWorld);
@@ -232582,8 +232697,8 @@ class PolyfaceBuilder extends _geometry3d_GeometryHandler__WEBPACK_IMPORTED_MODU
      * @param vMap optional mapping from v fraction to parameter space (such as texture)
      */
     addUVGridBody(surface, numU, numV, uMap, vMap) {
-        let xyzIndex0 = new _geometry3d_GrowableFloat64Array__WEBPACK_IMPORTED_MODULE_26__.GrowableFloat64Array(numU);
-        let xyzIndex1 = new _geometry3d_GrowableFloat64Array__WEBPACK_IMPORTED_MODULE_26__.GrowableFloat64Array(numU);
+        let xyzIndex0 = new _geometry3d_GrowableFloat64Array__WEBPACK_IMPORTED_MODULE_27__.GrowableFloat64Array(numU);
+        let xyzIndex1 = new _geometry3d_GrowableFloat64Array__WEBPACK_IMPORTED_MODULE_27__.GrowableFloat64Array(numU);
         let paramIndex0;
         let paramIndex1;
         let normalIndex0;
@@ -232591,13 +232706,13 @@ class PolyfaceBuilder extends _geometry3d_GeometryHandler__WEBPACK_IMPORTED_MODU
         const reverse = this._reversed;
         const needNormals = this.options.needNormals;
         if (needNormals) {
-            normalIndex0 = new _geometry3d_GrowableFloat64Array__WEBPACK_IMPORTED_MODULE_26__.GrowableFloat64Array(numU);
-            normalIndex1 = new _geometry3d_GrowableFloat64Array__WEBPACK_IMPORTED_MODULE_26__.GrowableFloat64Array(numU);
+            normalIndex0 = new _geometry3d_GrowableFloat64Array__WEBPACK_IMPORTED_MODULE_27__.GrowableFloat64Array(numU);
+            normalIndex1 = new _geometry3d_GrowableFloat64Array__WEBPACK_IMPORTED_MODULE_27__.GrowableFloat64Array(numU);
         }
         const needParams = this.options.needParams;
         if (needParams) {
-            paramIndex0 = new _geometry3d_GrowableFloat64Array__WEBPACK_IMPORTED_MODULE_26__.GrowableFloat64Array(numU);
-            paramIndex1 = new _geometry3d_GrowableFloat64Array__WEBPACK_IMPORTED_MODULE_26__.GrowableFloat64Array(numU);
+            paramIndex0 = new _geometry3d_GrowableFloat64Array__WEBPACK_IMPORTED_MODULE_27__.GrowableFloat64Array(numU);
+            paramIndex1 = new _geometry3d_GrowableFloat64Array__WEBPACK_IMPORTED_MODULE_27__.GrowableFloat64Array(numU);
         }
         let indexSwap;
         xyzIndex0.ensureCapacity(numU);
@@ -232606,7 +232721,7 @@ class PolyfaceBuilder extends _geometry3d_GeometryHandler__WEBPACK_IMPORTED_MODU
         const normal = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_0__.Vector3d.create();
         const du = 1.0 / numU;
         const dv = 1.0 / numV;
-        const plane = _geometry3d_Plane3dByOriginAndVectors__WEBPACK_IMPORTED_MODULE_27__.Plane3dByOriginAndVectors.createXYPlane();
+        const plane = _geometry3d_Plane3dByOriginAndVectors__WEBPACK_IMPORTED_MODULE_28__.Plane3dByOriginAndVectors.createXYPlane();
         for (let v = 0; v <= numV; v++) {
             // evaluate new points ....
             xyzIndex1.clear();
@@ -232677,7 +232792,7 @@ class PolyfaceBuilder extends _geometry3d_GeometryHandler__WEBPACK_IMPORTED_MODU
      * @param points
      */
     static pointsToTriangulatedPolyface(points) {
-        const graph = _topology_Triangulation__WEBPACK_IMPORTED_MODULE_25__.Triangulator.createTriangulatedGraphFromPoints(points);
+        const graph = _topology_Triangulation__WEBPACK_IMPORTED_MODULE_26__.Triangulator.createTriangulatedGraphFromPoints(points);
         if (graph)
             return PolyfaceBuilder.graphToPolyface(graph);
         return undefined;
@@ -232693,13 +232808,13 @@ class PolyfaceBuilder extends _geometry3d_GeometryHandler__WEBPACK_IMPORTED_MODU
      * @param pointsB points of second linestring.
      */
     addGreedyTriangulationBetweenLineStrings(pointsA, pointsB) {
-        const context = _GreedyTriangulationBetweenLineStrings__WEBPACK_IMPORTED_MODULE_28__.GreedyTriangulationBetweenLineStrings.createContext();
+        const context = _GreedyTriangulationBetweenLineStrings__WEBPACK_IMPORTED_MODULE_29__.GreedyTriangulationBetweenLineStrings.createContext();
         context.emitTriangles(resolveToIndexedXYZCollectionOrCarrier(pointsA), resolveToIndexedXYZCollectionOrCarrier(pointsB), (triangle) => {
             this.addTriangleFacet(triangle.points);
         });
     }
     addMiteredPipesFromPoints(centerline, sectionData, numFacetAround = 12) {
-        const sections = _curve_CurveFactory__WEBPACK_IMPORTED_MODULE_29__.CurveFactory.createMiteredPipeSections(centerline, sectionData);
+        const sections = _curve_CurveFactory__WEBPACK_IMPORTED_MODULE_30__.CurveFactory.createMiteredPipeSections(centerline, sectionData);
         const pointA0 = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_0__.Point3d.create();
         const pointA1 = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_0__.Point3d.create();
         const pointB0 = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_0__.Point3d.create();
@@ -232731,18 +232846,18 @@ class PolyfaceBuilder extends _geometry3d_GeometryHandler__WEBPACK_IMPORTED_MODU
      */
     addMiteredPipes(centerline, sectionData, numFacetAround = 12) {
         if (Array.isArray(centerline)) {
-            this.addMiteredPipesFromPoints(new _geometry3d_Point3dArrayCarrier__WEBPACK_IMPORTED_MODULE_30__.Point3dArrayCarrier(centerline), sectionData, numFacetAround);
+            this.addMiteredPipesFromPoints(new _geometry3d_Point3dArrayCarrier__WEBPACK_IMPORTED_MODULE_31__.Point3dArrayCarrier(centerline), sectionData, numFacetAround);
         }
         else if (centerline instanceof _geometry3d_GrowableXYZArray__WEBPACK_IMPORTED_MODULE_10__.GrowableXYZArray) {
             this.addMiteredPipesFromPoints(centerline, sectionData, numFacetAround);
         }
-        else if (centerline instanceof _geometry3d_IndexedXYZCollection__WEBPACK_IMPORTED_MODULE_31__.IndexedXYZCollection) {
+        else if (centerline instanceof _geometry3d_IndexedXYZCollection__WEBPACK_IMPORTED_MODULE_32__.IndexedXYZCollection) {
             this.addMiteredPipesFromPoints(centerline, sectionData, numFacetAround);
         }
         else if (centerline instanceof _curve_LineString3d__WEBPACK_IMPORTED_MODULE_11__.LineString3d) {
             this.addMiteredPipesFromPoints(centerline.packedPoints, sectionData, numFacetAround);
         }
-        else if (centerline instanceof _curve_GeometryQuery__WEBPACK_IMPORTED_MODULE_32__.GeometryQuery) {
+        else if (centerline instanceof _curve_GeometryQuery__WEBPACK_IMPORTED_MODULE_33__.GeometryQuery) {
             const linestring = _curve_LineString3d__WEBPACK_IMPORTED_MODULE_11__.LineString3d.create();
             centerline.emitStrokes(linestring, this._options);
             this.addMiteredPipesFromPoints(linestring.packedPoints, sectionData, numFacetAround);
@@ -232809,10 +232924,10 @@ class PolyfaceBuilder extends _geometry3d_GeometryHandler__WEBPACK_IMPORTED_MODU
      */
     addSweptIndexedPolyface(source, sweepVector, triangulateSides = false) {
         let isSimpleSweep = true;
-        const totalProjectedArea = _PolyfaceQuery__WEBPACK_IMPORTED_MODULE_33__.PolyfaceQuery.sumFacetAreas(source, sweepVector);
+        const totalProjectedArea = _PolyfaceQuery__WEBPACK_IMPORTED_MODULE_34__.PolyfaceQuery.sumFacetAreas(source, sweepVector);
         if (_Geometry__WEBPACK_IMPORTED_MODULE_8__.Geometry.isAlmostEqualNumber(0.0, totalProjectedArea))
             isSimpleSweep = false;
-        const partitionedIndices = _PolyfaceQuery__WEBPACK_IMPORTED_MODULE_33__.PolyfaceQuery.partitionFacetIndicesByVisibilityVector(source, sweepVector, _geometry3d_Angle__WEBPACK_IMPORTED_MODULE_34__.Angle.createDegrees(1.0e-3));
+        const partitionedIndices = _PolyfaceQuery__WEBPACK_IMPORTED_MODULE_34__.PolyfaceQuery.partitionFacetIndicesByVisibilityVector(source, sweepVector, _geometry3d_Angle__WEBPACK_IMPORTED_MODULE_35__.Angle.createDegrees(1.0e-3));
         const numForwardFacets = partitionedIndices[0].length;
         const numBackwardFacets = partitionedIndices[1].length;
         const numSideFacets = partitionedIndices[2].length;
@@ -232829,15 +232944,15 @@ class PolyfaceBuilder extends _geometry3d_GeometryHandler__WEBPACK_IMPORTED_MODU
         // collect base edges added to the builder, and extract boundary
         const numBaseFacets = firstSweptFacet - firstBaseFacet;
         const baseFacetIndices = Array.from({ length: numBaseFacets }, (_, i) => firstBaseFacet + i);
-        const baseFacetVisitor = _IndexedPolyfaceVisitor__WEBPACK_IMPORTED_MODULE_35__.IndexedPolyfaceSubsetVisitor.createSubsetVisitor(this._polyface, baseFacetIndices, 1);
-        const baseEdges = _PolyfaceQuery__WEBPACK_IMPORTED_MODULE_33__.PolyfaceQuery.createIndexedEdges(baseFacetVisitor);
+        const baseFacetVisitor = _IndexedPolyfaceVisitor__WEBPACK_IMPORTED_MODULE_36__.IndexedPolyfaceSubsetVisitor.createSubsetVisitor(this._polyface, baseFacetIndices, 1);
+        const baseEdges = _PolyfaceQuery__WEBPACK_IMPORTED_MODULE_34__.PolyfaceQuery.createIndexedEdges(baseFacetVisitor);
         const baseBoundaryEdges = [];
         baseEdges.sortAndCollectClusters(undefined, baseBoundaryEdges, undefined, undefined);
         // add a side face per boundary edge
         const oldShouldTriangulate = this._options.shouldTriangulate;
         this._options.shouldTriangulate = triangulateSides;
         for (const edgeOrCluster of baseBoundaryEdges) {
-            if (edgeOrCluster instanceof _IndexedEdgeMatcher__WEBPACK_IMPORTED_MODULE_36__.SortableEdge)
+            if (edgeOrCluster instanceof _IndexedEdgeMatcher__WEBPACK_IMPORTED_MODULE_37__.SortableEdge)
                 this.addSweptFace(edgeOrCluster, numBaseFacets);
             else if (Array.isArray(edgeOrCluster))
                 for (const edge of edgeOrCluster)
@@ -232852,7 +232967,7 @@ PolyfaceBuilder._workVectorFindOrAdd = _geometry3d_Point3dVector3d__WEBPACK_IMPO
 PolyfaceBuilder._workUVFindOrAdd = _geometry3d_Point2dVector2d__WEBPACK_IMPORTED_MODULE_1__.Point2d.create();
 function resolveToIndexedXYZCollectionOrCarrier(points) {
     if (Array.isArray(points))
-        return new _geometry3d_Point3dArrayCarrier__WEBPACK_IMPORTED_MODULE_30__.Point3dArrayCarrier(points);
+        return new _geometry3d_Point3dArrayCarrier__WEBPACK_IMPORTED_MODULE_31__.Point3dArrayCarrier(points);
     if (points instanceof _curve_LineString3d__WEBPACK_IMPORTED_MODULE_11__.LineString3d)
         return points.packedPoints;
     return points;
@@ -244968,6 +245083,7 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony import */ var _bspline_BSplineCurve__WEBPACK_IMPORTED_MODULE_9__ = __webpack_require__(/*! ../bspline/BSplineCurve */ "../../core/geometry/lib/esm/bspline/BSplineCurve.js");
 /* harmony import */ var _bspline_BSplineCurve3dH__WEBPACK_IMPORTED_MODULE_11__ = __webpack_require__(/*! ../bspline/BSplineCurve3dH */ "../../core/geometry/lib/esm/bspline/BSplineCurve3dH.js");
 /* harmony import */ var _bspline_BSplineSurface__WEBPACK_IMPORTED_MODULE_28__ = __webpack_require__(/*! ../bspline/BSplineSurface */ "../../core/geometry/lib/esm/bspline/BSplineSurface.js");
+/* harmony import */ var _bspline_InterpolationCurve3d__WEBPACK_IMPORTED_MODULE_45__ = __webpack_require__(/*! ../bspline/InterpolationCurve3d */ "../../core/geometry/lib/esm/bspline/InterpolationCurve3d.js");
 /* harmony import */ var _bspline_KnotVector__WEBPACK_IMPORTED_MODULE_29__ = __webpack_require__(/*! ../bspline/KnotVector */ "../../core/geometry/lib/esm/bspline/KnotVector.js");
 /* harmony import */ var _clipping_ClipPlane__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ../clipping/ClipPlane */ "../../core/geometry/lib/esm/clipping/ClipPlane.js");
 /* harmony import */ var _clipping_ConvexClipPlaneSet__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! ../clipping/ConvexClipPlaneSet */ "../../core/geometry/lib/esm/clipping/ConvexClipPlaneSet.js");
@@ -244982,6 +245098,8 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony import */ var _curve_ParityRegion__WEBPACK_IMPORTED_MODULE_24__ = __webpack_require__(/*! ../curve/ParityRegion */ "../../core/geometry/lib/esm/curve/ParityRegion.js");
 /* harmony import */ var _curve_Path__WEBPACK_IMPORTED_MODULE_21__ = __webpack_require__(/*! ../curve/Path */ "../../core/geometry/lib/esm/curve/Path.js");
 /* harmony import */ var _curve_PointString3d__WEBPACK_IMPORTED_MODULE_22__ = __webpack_require__(/*! ../curve/PointString3d */ "../../core/geometry/lib/esm/curve/PointString3d.js");
+/* harmony import */ var _curve_spiral_DirectSpiral3d__WEBPACK_IMPORTED_MODULE_41__ = __webpack_require__(/*! ../curve/spiral/DirectSpiral3d */ "../../core/geometry/lib/esm/curve/spiral/DirectSpiral3d.js");
+/* harmony import */ var _curve_spiral_IntegratedSpiral3d__WEBPACK_IMPORTED_MODULE_39__ = __webpack_require__(/*! ../curve/spiral/IntegratedSpiral3d */ "../../core/geometry/lib/esm/curve/spiral/IntegratedSpiral3d.js");
 /* harmony import */ var _curve_UnionRegion__WEBPACK_IMPORTED_MODULE_25__ = __webpack_require__(/*! ../curve/UnionRegion */ "../../core/geometry/lib/esm/curve/UnionRegion.js");
 /* harmony import */ var _Geometry__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ../Geometry */ "../../core/geometry/lib/esm/Geometry.js");
 /* harmony import */ var _geometry3d_Angle__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ../geometry3d/Angle */ "../../core/geometry/lib/esm/geometry3d/Angle.js");
@@ -244999,7 +245117,9 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony import */ var _geometry4d_Map4d__WEBPACK_IMPORTED_MODULE_18__ = __webpack_require__(/*! ../geometry4d/Map4d */ "../../core/geometry/lib/esm/geometry4d/Map4d.js");
 /* harmony import */ var _geometry4d_Matrix4d__WEBPACK_IMPORTED_MODULE_17__ = __webpack_require__(/*! ../geometry4d/Matrix4d */ "../../core/geometry/lib/esm/geometry4d/Matrix4d.js");
 /* harmony import */ var _geometry4d_Point4d__WEBPACK_IMPORTED_MODULE_10__ = __webpack_require__(/*! ../geometry4d/Point4d */ "../../core/geometry/lib/esm/geometry4d/Point4d.js");
+/* harmony import */ var _polyface_AuxData__WEBPACK_IMPORTED_MODULE_47__ = __webpack_require__(/*! ../polyface/AuxData */ "../../core/geometry/lib/esm/polyface/AuxData.js");
 /* harmony import */ var _polyface_Polyface__WEBPACK_IMPORTED_MODULE_27__ = __webpack_require__(/*! ../polyface/Polyface */ "../../core/geometry/lib/esm/polyface/Polyface.js");
+/* harmony import */ var _polyface_PolyfaceBuilder__WEBPACK_IMPORTED_MODULE_48__ = __webpack_require__(/*! ../polyface/PolyfaceBuilder */ "../../core/geometry/lib/esm/polyface/PolyfaceBuilder.js");
 /* harmony import */ var _solid_Box__WEBPACK_IMPORTED_MODULE_35__ = __webpack_require__(/*! ../solid/Box */ "../../core/geometry/lib/esm/solid/Box.js");
 /* harmony import */ var _solid_Cone__WEBPACK_IMPORTED_MODULE_33__ = __webpack_require__(/*! ../solid/Cone */ "../../core/geometry/lib/esm/solid/Cone.js");
 /* harmony import */ var _solid_LinearSweep__WEBPACK_IMPORTED_MODULE_30__ = __webpack_require__(/*! ../solid/LinearSweep */ "../../core/geometry/lib/esm/solid/LinearSweep.js");
@@ -245007,11 +245127,6 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony import */ var _solid_RuledSweep__WEBPACK_IMPORTED_MODULE_36__ = __webpack_require__(/*! ../solid/RuledSweep */ "../../core/geometry/lib/esm/solid/RuledSweep.js");
 /* harmony import */ var _solid_Sphere__WEBPACK_IMPORTED_MODULE_32__ = __webpack_require__(/*! ../solid/Sphere */ "../../core/geometry/lib/esm/solid/Sphere.js");
 /* harmony import */ var _solid_TorusPipe__WEBPACK_IMPORTED_MODULE_34__ = __webpack_require__(/*! ../solid/TorusPipe */ "../../core/geometry/lib/esm/solid/TorusPipe.js");
-/* harmony import */ var _curve_spiral_IntegratedSpiral3d__WEBPACK_IMPORTED_MODULE_39__ = __webpack_require__(/*! ../curve/spiral/IntegratedSpiral3d */ "../../core/geometry/lib/esm/curve/spiral/IntegratedSpiral3d.js");
-/* harmony import */ var _curve_spiral_DirectSpiral3d__WEBPACK_IMPORTED_MODULE_41__ = __webpack_require__(/*! ../curve/spiral/DirectSpiral3d */ "../../core/geometry/lib/esm/curve/spiral/DirectSpiral3d.js");
-/* harmony import */ var _polyface_AuxData__WEBPACK_IMPORTED_MODULE_47__ = __webpack_require__(/*! ../polyface/AuxData */ "../../core/geometry/lib/esm/polyface/AuxData.js");
-/* harmony import */ var _polyface_PolyfaceBuilder__WEBPACK_IMPORTED_MODULE_48__ = __webpack_require__(/*! ../polyface/PolyfaceBuilder */ "../../core/geometry/lib/esm/polyface/PolyfaceBuilder.js");
-/* harmony import */ var _bspline_InterpolationCurve3d__WEBPACK_IMPORTED_MODULE_45__ = __webpack_require__(/*! ../bspline/InterpolationCurve3d */ "../../core/geometry/lib/esm/bspline/InterpolationCurve3d.js");
 /*---------------------------------------------------------------------------------------------
 * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
 * See LICENSE.md in the project root for license terms and full copyright notice.
@@ -245136,7 +245251,7 @@ class Sample {
             _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d.createSpherical(1.0, _geometry3d_Angle__WEBPACK_IMPORTED_MODULE_3__.Angle.createDegrees(20), _geometry3d_Angle__WEBPACK_IMPORTED_MODULE_3__.Angle.createDegrees(10)),
             _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d.createPolar(2.0, _geometry3d_Angle__WEBPACK_IMPORTED_MODULE_3__.Angle.createDegrees(20)),
             _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d.createSpherical(2.0, _geometry3d_Angle__WEBPACK_IMPORTED_MODULE_3__.Angle.createDegrees(20), _geometry3d_Angle__WEBPACK_IMPORTED_MODULE_3__.Angle.createDegrees(10)),
-            _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d.create(2, 3, 0)
+            _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d.create(2, 3, 0),
         ];
     }
     /** Return an array with assorted Range3d samples */
@@ -245144,7 +245259,7 @@ class Sample {
         return [
             _geometry3d_Range__WEBPACK_IMPORTED_MODULE_4__.Range3d.createXYZXYZ(0, 0, 0, 1, 1, 1),
             _geometry3d_Range__WEBPACK_IMPORTED_MODULE_4__.Range3d.createXYZ(1, 2, 3),
-            _geometry3d_Range__WEBPACK_IMPORTED_MODULE_4__.Range3d.createXYZXYZ(-2, -3, 1, 200, 301, 8)
+            _geometry3d_Range__WEBPACK_IMPORTED_MODULE_4__.Range3d.createXYZXYZ(-2, -3, 1, 200, 301, 8),
         ];
     }
     /** Create 5 points of a (axis aligned) rectangle with corners (x0,y0) and (x0+ax, y0 + ay) */
@@ -245424,10 +245539,10 @@ class Sample {
             _geometry3d_Matrix3d__WEBPACK_IMPORTED_MODULE_12__.Matrix3d.createIdentity(),
             _geometry3d_Matrix3d__WEBPACK_IMPORTED_MODULE_12__.Matrix3d.createRotationAroundVector(_geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d.create(1, 0, 0), _geometry3d_Angle__WEBPACK_IMPORTED_MODULE_3__.Angle.createDegrees(10)),
             _geometry3d_Matrix3d__WEBPACK_IMPORTED_MODULE_12__.Matrix3d.createRotationAroundVector(_geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d.create(1, -2, 5), _geometry3d_Angle__WEBPACK_IMPORTED_MODULE_3__.Angle.createDegrees(-6.0)),
-            _geometry3d_Matrix3d__WEBPACK_IMPORTED_MODULE_12__.Matrix3d.createUniformScale(2.0),
             _geometry3d_Matrix3d__WEBPACK_IMPORTED_MODULE_12__.Matrix3d.createRotationAroundVector(_geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d.create(1, 2, 3), _geometry3d_Angle__WEBPACK_IMPORTED_MODULE_3__.Angle.createDegrees(49.0)),
+            _geometry3d_Matrix3d__WEBPACK_IMPORTED_MODULE_12__.Matrix3d.createUniformScale(2.0),
             _geometry3d_Matrix3d__WEBPACK_IMPORTED_MODULE_12__.Matrix3d.createScale(1, 1, -1),
-            _geometry3d_Matrix3d__WEBPACK_IMPORTED_MODULE_12__.Matrix3d.createScale(2, 3, 4)
+            _geometry3d_Matrix3d__WEBPACK_IMPORTED_MODULE_12__.Matrix3d.createScale(2, 3, 4),
         ];
     }
     /** Assorted invertible transforms. */
@@ -245443,8 +245558,7 @@ class Sample {
     /** Return an array of Matrix3d with various skew and scale.  This includes at least:
      * * identity
      * * 3 distinct diagonals.
-     * * The distinct diagonal base with smaller value added to
-     *    other 6 spots in succession.
+     * * The distinct diagonal base with smaller value added to other 6 spots in succession.
      * * the distinct diagonals with all others also smaller non-zeros.
      */
     static createScaleSkewMatrix3d() {
@@ -245457,7 +245571,7 @@ class Sample {
             _geometry3d_Matrix3d__WEBPACK_IMPORTED_MODULE_12__.Matrix3d.createRowValues(5, 0, 0, 0, 6, 1, 0, 0, 7),
             _geometry3d_Matrix3d__WEBPACK_IMPORTED_MODULE_12__.Matrix3d.createRowValues(5, 0, 0, 0, 6, 0, 1, 0, 7),
             _geometry3d_Matrix3d__WEBPACK_IMPORTED_MODULE_12__.Matrix3d.createRowValues(5, 0, 0, 0, 6, 0, 0, 1, 7),
-            _geometry3d_Matrix3d__WEBPACK_IMPORTED_MODULE_12__.Matrix3d.createRowValues(5, 2, 3, 2, 6, 1, -1, 2, 7)
+            _geometry3d_Matrix3d__WEBPACK_IMPORTED_MODULE_12__.Matrix3d.createRowValues(5, 2, 3, 2, 6, 1, -1, 2, 7),
         ];
     }
     /** Return an array of singular Matrix3d.  This includes at least:
@@ -247162,7 +247276,7 @@ Sample.vector2d = [
     _geometry3d_Point2dVector2d__WEBPACK_IMPORTED_MODULE_2__.Vector2d.create(0, 0),
     _geometry3d_Point2dVector2d__WEBPACK_IMPORTED_MODULE_2__.Vector2d.createPolar(1.0, _geometry3d_Angle__WEBPACK_IMPORTED_MODULE_3__.Angle.createDegrees(20)),
     _geometry3d_Point2dVector2d__WEBPACK_IMPORTED_MODULE_2__.Vector2d.createPolar(2.0, _geometry3d_Angle__WEBPACK_IMPORTED_MODULE_3__.Angle.createDegrees(20)),
-    _geometry3d_Point2dVector2d__WEBPACK_IMPORTED_MODULE_2__.Vector2d.create(2, 3)
+    _geometry3d_Point2dVector2d__WEBPACK_IMPORTED_MODULE_2__.Vector2d.create(2, 3),
 ];
 /** Assorted Plane3dBYOriginAndUnitNormal */
 Sample.plane3dByOriginAndUnitNormal = [
@@ -250280,12 +250394,12 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony import */ var _curve_LineString3d__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../curve/LineString3d */ "../../core/geometry/lib/esm/curve/LineString3d.js");
 /* harmony import */ var _curve_Loop__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ../curve/Loop */ "../../core/geometry/lib/esm/curve/Loop.js");
 /* harmony import */ var _curve_ParityRegion__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ../curve/ParityRegion */ "../../core/geometry/lib/esm/curve/ParityRegion.js");
-/* harmony import */ var _curve_RegionOps__WEBPACK_IMPORTED_MODULE_8__ = __webpack_require__(/*! ../curve/RegionOps */ "../../core/geometry/lib/esm/curve/RegionOps.js");
+/* harmony import */ var _curve_RegionOps__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! ../curve/RegionOps */ "../../core/geometry/lib/esm/curve/RegionOps.js");
 /* harmony import */ var _geometry3d_FrameBuilder__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../geometry3d/FrameBuilder */ "../../core/geometry/lib/esm/geometry3d/FrameBuilder.js");
 /* harmony import */ var _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_9__ = __webpack_require__(/*! ../geometry3d/Point3dVector3d */ "../../core/geometry/lib/esm/geometry3d/Point3dVector3d.js");
 /* harmony import */ var _geometry3d_PolygonOps__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ../geometry3d/PolygonOps */ "../../core/geometry/lib/esm/geometry3d/PolygonOps.js");
 /* harmony import */ var _polyface_PolyfaceBuilder__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ../polyface/PolyfaceBuilder */ "../../core/geometry/lib/esm/polyface/PolyfaceBuilder.js");
-/* harmony import */ var _topology_HalfEdgeGraphSearch__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! ../topology/HalfEdgeGraphSearch */ "../../core/geometry/lib/esm/topology/HalfEdgeGraphSearch.js");
+/* harmony import */ var _topology_HalfEdgeGraphSearch__WEBPACK_IMPORTED_MODULE_8__ = __webpack_require__(/*! ../topology/HalfEdgeGraphSearch */ "../../core/geometry/lib/esm/topology/HalfEdgeGraphSearch.js");
 /* harmony import */ var _topology_Triangulation__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ../topology/Triangulation */ "../../core/geometry/lib/esm/topology/Triangulation.js");
 /*---------------------------------------------------------------------------------------------
 * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
@@ -250427,6 +250541,13 @@ class SweepContour {
                         this._facets = unflippedPoly;
                         this._facets.tryTransformInPlace(this.localToWorld);
                     }
+                    else { // earcut failed (e.g., on a split washer polygon, where the bridge edge is traversed twice)
+                        const polyface = _curve_RegionOps__WEBPACK_IMPORTED_MODULE_7__.RegionOps.polygonXYAreaUnionLoopsToPolyface(points, [], true);
+                        if (polyface) {
+                            this._facets = polyface;
+                            this._facets.tryTransformInPlace(this.localToWorld);
+                        }
+                    }
                 }
             }
             else if (this.curves instanceof _curve_ParityRegion__WEBPACK_IMPORTED_MODULE_3__.ParityRegion) {
@@ -250446,7 +250567,7 @@ class SweepContour {
                     const numLoops = strokes.length;
                     /** Try the earcut algorithm first -- lots less machinery, but can't handle any form of overlap */
                     const graph = _topology_Triangulation__WEBPACK_IMPORTED_MODULE_5__.Triangulator.createTriangulatedGraphFromLoops(strokes);
-                    if (graph && _topology_HalfEdgeGraphSearch__WEBPACK_IMPORTED_MODULE_7__.HalfEdgeGraphSearch.isTriangulatedCCW(graph, true, numLoops - 1)) {
+                    if (graph && _topology_HalfEdgeGraphSearch__WEBPACK_IMPORTED_MODULE_8__.HalfEdgeGraphSearch.isTriangulatedCCW(graph, true, numLoops - 1)) {
                         _topology_Triangulation__WEBPACK_IMPORTED_MODULE_5__.Triangulator.flipTriangles(graph);
                         const unflippedPoly = _polyface_PolyfaceBuilder__WEBPACK_IMPORTED_MODULE_6__.PolyfaceBuilder.graphToPolyface(graph, options);
                         this._facets = unflippedPoly;
@@ -250454,7 +250575,7 @@ class SweepContour {
                     }
                     else {
                         // earcut failed. Restart with full merge and parity analysis.
-                        const polyface = _curve_RegionOps__WEBPACK_IMPORTED_MODULE_8__.RegionOps.polygonXYAreaUnionLoopsToPolyface(strokes, [], true);
+                        const polyface = _curve_RegionOps__WEBPACK_IMPORTED_MODULE_7__.RegionOps.polygonXYAreaUnionLoopsToPolyface(strokes, [], true);
                         if (polyface) {
                             this._facets = polyface;
                             this._facets.tryTransformInPlace(this.localToWorld);
@@ -252777,6 +252898,7 @@ class HalfEdgeGraphSearch {
     /**
      * Search an array of faceSeed nodes for the face with the most negative area.
      * @param oneCandidateNodePerFace array containing one node from each face to be considered.
+     * @returns node on the minimum area face, or undefined if no such face (e.g., all faces have zero area).
      */
     static findMinimumAreaFace(oneCandidateNodePerFace, faceAreaFunction) {
         const summary = HalfEdgeGraphSearch.collectFaceAreaSummary(oneCandidateNodePerFace, false, faceAreaFunction);
@@ -287636,7 +287758,7 @@ module.exports = JSON.parse('{"name":"axios","version":"0.21.4","description":"P
 /***/ ((module) => {
 
 "use strict";
-module.exports = JSON.parse('{"name":"@itwin/core-frontend","version":"4.0.0-dev.37","description":"iTwin.js frontend components","main":"lib/cjs/core-frontend.js","module":"lib/esm/core-frontend.js","typings":"lib/cjs/core-frontend","license":"MIT","scripts":{"build":"npm run -s copy:public && npm run -s build:cjs","build:ci":"npm run -s build && npm run -s build:esm","build:cjs":"npm run -s copy:js:cjs && tsc 1>&2 --outDir lib/cjs","build:esm":"npm run -s copy:js:esm && tsc 1>&2 --module ES2020 --outDir lib/esm","clean":"rimraf lib .rush/temp/package-deps*.json","copy:public":"cpx \\"./src/public/**/*\\" ./lib/public","copy:js:cjs":"cpx \\"./src/**/*.js\\" ./lib/cjs","copy:js:esm":"cpx \\"./src/**/*.js\\" ./lib/esm","docs":"betools docs --includes=../../generated-docs/extract --json=../../generated-docs/core/core-frontend/file.json --tsIndexFile=./core-frontend.ts --onlyJson --excludes=webgl/**/*,**/primitives,**/map/*.d.ts,**/tile/*.d.ts,**/*-css.ts","extract-api":"betools extract-api --entry=core-frontend && npm run extract-extension-api","extract-extension-api":"eslint --no-eslintrc -c \\"../../tools/eslint-plugin/dist/configs/extension-exports-config.js\\" \\"./src/**/*.ts\\" 1>&2","lint":"eslint -f visualstudio \\"./src/**/*.ts\\" 1>&2","pseudolocalize":"betools pseudolocalize --englishDir ./src/public/locales/en --out ./public/locales/en-PSEUDO","test":"npm run -s webpackTests && certa -r chrome","cover":"npm -s test","test:debug":"certa -r chrome --debug","webpackTests":"webpack --config ./src/test/utils/webpack.config.js 1>&2"},"repository":{"type":"git","url":"https://github.com/iTwin/itwinjs-core/tree/master/core/frontend"},"keywords":["Bentley","BIM","iModel","digital-twin","iTwin"],"author":{"name":"Bentley Systems, Inc.","url":"http://www.bentley.com"},"peerDependencies":{"@itwin/appui-abstract":"workspace:^4.0.0-dev.37","@itwin/core-bentley":"workspace:^4.0.0-dev.37","@itwin/core-common":"workspace:^4.0.0-dev.37","@itwin/core-geometry":"workspace:^4.0.0-dev.37","@itwin/core-orbitgt":"workspace:^4.0.0-dev.37","@itwin/core-quantity":"workspace:^4.0.0-dev.37"},"//devDependencies":["NOTE: All peerDependencies should also be listed as devDependencies since peerDependencies are not considered by npm install","NOTE: All tools used by scripts in this package must be listed as devDependencies"],"devDependencies":{"@itwin/appui-abstract":"workspace:*","@itwin/build-tools":"workspace:*","@itwin/core-bentley":"workspace:*","@itwin/core-common":"workspace:*","@itwin/core-geometry":"workspace:*","@itwin/core-orbitgt":"workspace:*","@itwin/core-quantity":"workspace:*","@itwin/certa":"workspace:*","@itwin/eslint-plugin":"workspace:*","@itwin/webgl-compatibility":"workspace:*","@types/chai":"4.3.1","@types/chai-as-promised":"^7","@types/deep-assign":"^0.1.0","@types/mocha":"^8.2.2","@types/node":"^18.11.5","@types/qs":"^6.5.0","@types/semver":"7.3.10","@types/superagent":"^4.1.14","@types/sinon":"^9.0.0","babel-loader":"~8.2.5","babel-plugin-istanbul":"~6.1.1","chai":"^4.1.2","chai-as-promised":"^7","cpx2":"^3.0.0","eslint":"^7.11.0","glob":"^7.1.2","mocha":"^10.0.0","nyc":"^15.1.0","rimraf":"^3.0.2","sinon":"^9.0.2","source-map-loader":"^4.0.0","typescript":"~4.4.0","webpack":"^5.64.4"},"//dependencies":["NOTE: these dependencies should be only for things that DO NOT APPEAR IN THE API","NOTE: core-frontend should remain UI technology agnostic, so no react/angular dependencies are allowed"],"dependencies":{"@itwin/object-storage-azure":"^1.5.0","@itwin/cloud-agnostic-core":"^1.5.0","@itwin/object-storage-core":"^1.5.0","@itwin/core-i18n":"workspace:*","@itwin/core-telemetry":"workspace:*","@itwin/webgl-compatibility":"workspace:*","@loaders.gl/core":"^3.1.6","@loaders.gl/draco":"^3.1.6","deep-assign":"^2.0.0","fuse.js":"^3.3.0","qs":"^6.5.3","semver":"^7.3.5","superagent":"^7.1.5","wms-capabilities":"0.4.0","reflect-metadata":"0.1.13"},"nyc":{"extends":"./node_modules/@itwin/build-tools/.nycrc"},"eslintConfig":{"plugins":["@itwin"],"extends":"plugin:@itwin/itwinjs-recommended","rules":{"@itwin/no-internal-barrel-imports":["error",{"required-barrel-modules":["./src/tile/internal.ts"]}],"@itwin/public-extension-exports":["error",{"releaseTags":["public","preview"],"outputApiFile":false}]},"overrides":[{"files":["*.test.ts","*.test.tsx","**/test/**/*.ts"],"rules":{"@itwin/no-internal-barrel-imports":"off"}}]}}');
+module.exports = JSON.parse('{"name":"@itwin/core-frontend","version":"4.0.0-dev.39","description":"iTwin.js frontend components","main":"lib/cjs/core-frontend.js","module":"lib/esm/core-frontend.js","typings":"lib/cjs/core-frontend","license":"MIT","scripts":{"build":"npm run -s copy:public && npm run -s build:cjs","build:ci":"npm run -s build && npm run -s build:esm","build:cjs":"npm run -s copy:js:cjs && tsc 1>&2 --outDir lib/cjs","build:esm":"npm run -s copy:js:esm && tsc 1>&2 --module ES2020 --outDir lib/esm","clean":"rimraf lib .rush/temp/package-deps*.json","copy:public":"cpx \\"./src/public/**/*\\" ./lib/public","copy:js:cjs":"cpx \\"./src/**/*.js\\" ./lib/cjs","copy:js:esm":"cpx \\"./src/**/*.js\\" ./lib/esm","docs":"betools docs --includes=../../generated-docs/extract --json=../../generated-docs/core/core-frontend/file.json --tsIndexFile=./core-frontend.ts --onlyJson --excludes=webgl/**/*,**/primitives,**/map/*.d.ts,**/tile/*.d.ts,**/*-css.ts","extract-api":"betools extract-api --entry=core-frontend && npm run extract-extension-api","extract-extension-api":"eslint --no-eslintrc -c \\"../../tools/eslint-plugin/dist/configs/extension-exports-config.js\\" \\"./src/**/*.ts\\" 1>&2","lint":"eslint -f visualstudio \\"./src/**/*.ts\\" 1>&2","pseudolocalize":"betools pseudolocalize --englishDir ./src/public/locales/en --out ./public/locales/en-PSEUDO","test":"npm run -s webpackTests && certa -r chrome","cover":"npm -s test","test:debug":"certa -r chrome --debug","webpackTests":"webpack --config ./src/test/utils/webpack.config.js 1>&2"},"repository":{"type":"git","url":"https://github.com/iTwin/itwinjs-core/tree/master/core/frontend"},"keywords":["Bentley","BIM","iModel","digital-twin","iTwin"],"author":{"name":"Bentley Systems, Inc.","url":"http://www.bentley.com"},"peerDependencies":{"@itwin/appui-abstract":"workspace:^4.0.0-dev.39","@itwin/core-bentley":"workspace:^4.0.0-dev.39","@itwin/core-common":"workspace:^4.0.0-dev.39","@itwin/core-geometry":"workspace:^4.0.0-dev.39","@itwin/core-orbitgt":"workspace:^4.0.0-dev.39","@itwin/core-quantity":"workspace:^4.0.0-dev.39"},"//devDependencies":["NOTE: All peerDependencies should also be listed as devDependencies since peerDependencies are not considered by npm install","NOTE: All tools used by scripts in this package must be listed as devDependencies"],"devDependencies":{"@itwin/appui-abstract":"workspace:*","@itwin/build-tools":"workspace:*","@itwin/core-bentley":"workspace:*","@itwin/core-common":"workspace:*","@itwin/core-geometry":"workspace:*","@itwin/core-orbitgt":"workspace:*","@itwin/core-quantity":"workspace:*","@itwin/certa":"workspace:*","@itwin/eslint-plugin":"workspace:*","@itwin/webgl-compatibility":"workspace:*","@types/chai":"4.3.1","@types/chai-as-promised":"^7","@types/deep-assign":"^0.1.0","@types/mocha":"^8.2.2","@types/node":"^18.11.5","@types/qs":"^6.5.0","@types/semver":"7.3.10","@types/superagent":"^4.1.14","@types/sinon":"^9.0.0","babel-loader":"~8.2.5","babel-plugin-istanbul":"~6.1.1","chai":"^4.1.2","chai-as-promised":"^7","cpx2":"^3.0.0","eslint":"^7.11.0","glob":"^7.1.2","mocha":"^10.0.0","nyc":"^15.1.0","rimraf":"^3.0.2","sinon":"^9.0.2","source-map-loader":"^4.0.0","typescript":"~4.4.0","webpack":"^5.64.4"},"//dependencies":["NOTE: these dependencies should be only for things that DO NOT APPEAR IN THE API","NOTE: core-frontend should remain UI technology agnostic, so no react/angular dependencies are allowed"],"dependencies":{"@itwin/object-storage-azure":"^1.5.0","@itwin/cloud-agnostic-core":"^1.5.0","@itwin/object-storage-core":"^1.5.0","@itwin/core-i18n":"workspace:*","@itwin/core-telemetry":"workspace:*","@itwin/webgl-compatibility":"workspace:*","@loaders.gl/core":"^3.1.6","@loaders.gl/draco":"^3.1.6","deep-assign":"^2.0.0","fuse.js":"^3.3.0","qs":"^6.5.3","semver":"^7.3.5","superagent":"^7.1.5","wms-capabilities":"0.4.0","reflect-metadata":"0.1.13"},"nyc":{"extends":"./node_modules/@itwin/build-tools/.nycrc"},"eslintConfig":{"plugins":["@itwin"],"extends":"plugin:@itwin/itwinjs-recommended","rules":{"@itwin/no-internal-barrel-imports":["error",{"required-barrel-modules":["./src/tile/internal.ts"]}],"@itwin/public-extension-exports":["error",{"releaseTags":["public","preview"],"outputApiFile":false}]},"overrides":[{"files":["*.test.ts","*.test.tsx","**/test/**/*.ts"],"rules":{"@itwin/no-internal-barrel-imports":"off"}}]}}');
 
 /***/ })