@itwin/ecschema-rpcinterface-tests 5.0.0-dev.113 → 5.0.0-dev.114

package/lib/dist/bundled-tests.js

@@ -174902,25 +174902,48 @@ class InteractiveTool extends Tool {
             return foundProperty;
         throw new Error(`property not found: ${propertyName}`);
     }
-    /** Override to return the property that is disabled/enabled if the supplied property is a lock property.
+    /** Override to return the property that is locked by the supplied property if it is a lock property.
+     * Used to enable/disable the returned property according to the current lock state.
+     * @note Only applicable when [[getToolSettingLockProperty]] is not being used automatically enable the lock on a change of value.
      * @see [[changeToolSettingPropertyValue]]
      * @public
      */
     getToolSettingPropertyLocked(_property) {
         return undefined;
     }
+    /** Override to return the lock property associated with the supplied non-lock property.
+     * Used to enable the lock property after the value of the supplied property is changed.
+     * @see [[changeToolSettingPropertyValue]]
+     * @beta
+     */
+    getToolSettingLockProperty(_property) {
+        return undefined;
+    }
     /** Helper method for responding to a tool setting property value change by updating saved settings.
      * @see [[applyToolSettingPropertyChange]]
      * @see [[getToolSettingPropertyLocked]] to return the corresponding locked property, if any.
+     * @see [[getToolSettingLockProperty]] to return the corresponding property's lock property, if any.
      * @public
      */
     changeToolSettingPropertyValue(syncItem) {
         const property = this.getToolSettingPropertyByName(syncItem.propertyName);
         if (!this.saveToolSettingPropertyValue(property, syncItem.value))
             return false;
-        const lockedProperty = this.getToolSettingPropertyLocked(property);
-        if (undefined !== lockedProperty)
-            this.syncToolSettingPropertyValue(lockedProperty, !property.value);
+        // Either enable lock when corresponding property value changes, or enable/disable property according to value of lock...
+        const lockProperty = this.getToolSettingLockProperty(property);
+        if (undefined !== lockProperty) {
+            if (!lockProperty.value) {
+                this.saveToolSettingPropertyValue(lockProperty, { value: true });
+                this.syncToolSettingPropertyValue(lockProperty);
+            }
+        }
+        else {
+            const propertyToLock = this.getToolSettingPropertyLocked(property);
+            if (undefined !== propertyToLock) {
+                if (undefined === this.getToolSettingLockProperty(propertyToLock))
+                    this.syncToolSettingPropertyValue(propertyToLock, !property.value);
+            }
+        }
         return true;
     }
     /** Helper method to establish initial values for tool setting properties from saved settings.
@@ -180994,7 +181017,7 @@ class SetupCameraTool extends _PrimitiveTool__WEBPACK_IMPORTED_MODULE_17__.Primi
     _cameraHeightProperty;
     get cameraHeightProperty() {
         if (!this._cameraHeightProperty)
-            this._cameraHeightProperty = new _itwin_appui_abstract__WEBPACK_IMPORTED_MODULE_3__.DialogProperty(new _properties_LengthDescription__WEBPACK_IMPORTED_MODULE_8__.LengthDescription("cameraHeight", ViewTool.translate("SetupCamera.Labels.CameraHeight")), 0.0, undefined, !this.useCameraHeight);
+            this._cameraHeightProperty = new _itwin_appui_abstract__WEBPACK_IMPORTED_MODULE_3__.DialogProperty(new _properties_LengthDescription__WEBPACK_IMPORTED_MODULE_8__.LengthDescription("cameraHeight", ViewTool.translate("SetupCamera.Labels.CameraHeight")), 0.0);
         return this._cameraHeightProperty;
     }
     get cameraHeight() { return this.cameraHeightProperty.value; }
@@ -181010,62 +181033,23 @@ class SetupCameraTool extends _PrimitiveTool__WEBPACK_IMPORTED_MODULE_17__.Primi
     _targetHeightProperty;
     get targetHeightProperty() {
         if (!this._targetHeightProperty)
-            this._targetHeightProperty = new _itwin_appui_abstract__WEBPACK_IMPORTED_MODULE_3__.DialogProperty(new _properties_LengthDescription__WEBPACK_IMPORTED_MODULE_8__.LengthDescription("targetHeight", ViewTool.translate("SetupCamera.Labels.TargetHeight")), 0.0, undefined, !this.useTargetHeight);
+            this._targetHeightProperty = new _itwin_appui_abstract__WEBPACK_IMPORTED_MODULE_3__.DialogProperty(new _properties_LengthDescription__WEBPACK_IMPORTED_MODULE_8__.LengthDescription("targetHeight", ViewTool.translate("SetupCamera.Labels.TargetHeight")), 0.0);
         return this._targetHeightProperty;
     }
     get targetHeight() { return this.targetHeightProperty.value; }
     set targetHeight(value) { this.targetHeightProperty.value = value; }
-    syncCameraHeightState() {
-        const specs = _IModelApp__WEBPACK_IMPORTED_MODULE_7__.IModelApp.quantityFormatter.getSpecsByName(this.cameraHeightProperty.description.kindOfQuantityName ?? "AecUnits.LENGTH");
-        this.cameraHeightProperty.displayValue = specs ? specs.formatterSpec.applyFormatting(this.cameraHeight) : this.cameraHeight.toFixed(2);
-        this.cameraHeightProperty.isDisabled = !this.useCameraHeight;
-        this.syncToolSettingsProperties([this.cameraHeightProperty.syncItem]);
-    }
-    syncTargetHeightState() {
-        const specs = _IModelApp__WEBPACK_IMPORTED_MODULE_7__.IModelApp.quantityFormatter.getSpecsByName(this.targetHeightProperty.description.kindOfQuantityName ?? "AecUnits.LENGTH");
-        this.targetHeightProperty.displayValue = specs ? specs.formatterSpec.applyFormatting(this.targetHeight) : this.targetHeight.toFixed(2);
-        this.targetHeightProperty.isDisabled = !this.useTargetHeight;
-        this.syncToolSettingsProperties([this.targetHeightProperty.syncItem]);
+    getToolSettingLockProperty(property) {
+        if (property === this.cameraHeightProperty)
+            return this.useCameraHeightProperty;
+        else if (property === this.targetHeightProperty)
+            return this.useTargetHeightProperty;
+        return undefined;
     }
     async applyToolSettingPropertyChange(updatedValue) {
-        if (updatedValue.propertyName === this.useCameraHeightProperty.name) {
-            this.useCameraHeight = updatedValue.value.value;
-            _IModelApp__WEBPACK_IMPORTED_MODULE_7__.IModelApp.toolAdmin.toolSettingsState.saveToolSettingProperty(this.toolId, this.useCameraHeightProperty.item);
-            this.syncCameraHeightState();
-        }
-        else if (updatedValue.propertyName === this.useTargetHeightProperty.name) {
-            this.useTargetHeight = updatedValue.value.value;
-            _IModelApp__WEBPACK_IMPORTED_MODULE_7__.IModelApp.toolAdmin.toolSettingsState.saveToolSettingProperty(this.toolId, this.useTargetHeightProperty.item);
-            this.syncTargetHeightState();
-        }
-        else if (updatedValue.propertyName === this.cameraHeightProperty.name) {
-            this.cameraHeight = updatedValue.value.value;
-            _IModelApp__WEBPACK_IMPORTED_MODULE_7__.IModelApp.toolAdmin.toolSettingsState.saveToolSettingProperty(this.toolId, this.cameraHeightProperty.item);
-        }
-        else if (updatedValue.propertyName === this.targetHeightProperty.name) {
-            this.targetHeight = updatedValue.value.value;
-            _IModelApp__WEBPACK_IMPORTED_MODULE_7__.IModelApp.toolAdmin.toolSettingsState.saveToolSettingProperty(this.toolId, this.targetHeightProperty.item);
-        }
-        return true;
+        return this.changeToolSettingPropertyValue(updatedValue);
     }
     supplyToolSettingsProperties() {
-        // load latest values from session
-        _IModelApp__WEBPACK_IMPORTED_MODULE_7__.IModelApp.toolAdmin.toolSettingsState.getInitialToolSettingValues(this.toolId, [
-            this.useCameraHeightProperty.name, this.useTargetHeightProperty.name, this.cameraHeightProperty.name, this.targetHeightProperty.name,
-        ])
-            ?.forEach((value) => {
-            if (value.propertyName === this.useCameraHeightProperty.name)
-                this.useCameraHeightProperty.dialogItemValue = value.value;
-            else if (value.propertyName === this.cameraHeightProperty.name)
-                this.cameraHeightProperty.dialogItemValue = value.value;
-            else if (value.propertyName === this.useTargetHeightProperty.name)
-                this.useTargetHeightProperty.dialogItemValue = value.value;
-            else if (value.propertyName === this.targetHeightProperty.name)
-                this.targetHeightProperty.dialogItemValue = value.value;
-        });
-        // ensure controls are enabled/disabled base on current lock property state
-        this.targetHeightProperty.isDisabled = !this.useTargetHeight;
-        this.cameraHeightProperty.isDisabled = !this.useCameraHeight;
+        this.initializeToolSettingPropertyValues([this.useCameraHeightProperty, this.useTargetHeightProperty, this.cameraHeightProperty, this.targetHeightProperty]);
         const cameraHeightLock = this.useCameraHeightProperty.toDialogItem({ rowPriority: 1, columnIndex: 0 });
         const targetHeightLock = this.useTargetHeightProperty.toDialogItem({ rowPriority: 2, columnIndex: 0 });
         const toolSettings = new Array();
@@ -189656,11 +189640,11 @@ class ClipPlane extends _geometry3d_Plane3d__WEBPACK_IMPORTED_MODULE_0__.Plane3d
     get inwardNormalRef() {
         return this._inwardNormal;
     }
-    /**  Return the "interior" property bit */
+    /**  Return the "interior" property flag. Interpretation of this flag is algorithm-specific. */
     get interior() {
         return this._interior;
     }
-    /**  Return the "invisible" property bit. */
+    /**  Return the "invisible" property flag. Interpretation of this flag is algorithm-specific. */
     get invisible() {
         return this._invisible;
     }
@@ -189879,7 +189863,7 @@ class ClipPlane extends _geometry3d_Plane3d__WEBPACK_IMPORTED_MODULE_0__.Plane3d
         this._distanceFromOrigin = this._inwardNormal.dotProduct(plane.getOriginRef());
         return true;
     }
-    /** Set the invisible flag. Interpretation of this is up to the use code algorithms. */
+    /** Set the invisible flag. Interpretation of this flag is algorithm-specific. */
     setInvisible(invisible) {
         this._invisible = invisible;
     }
@@ -190023,8 +190007,12 @@ class ClipPlane extends _geometry3d_Plane3d__WEBPACK_IMPORTED_MODULE_0__.Plane3d
     }
     /** Project a point in space to the plane. */
     projectPointToPlane(spacePoint, result) {
-        const d = -this.altitude(spacePoint);
-        return spacePoint.plusXYZ(d * this._inwardNormal.x, d * this._inwardNormal.y, d * this._inwardNormal.z, result);
+        return this.projectXYZToPlane(spacePoint.x, spacePoint.y, spacePoint.z, result);
+    }
+    /** Return the projection of (x,y,z) onto the plane. */
+    projectXYZToPlane(x, y, z, result) {
+        const scale = -this.altitudeXYZ(x, y, z);
+        return _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Point3d.create(x + scale * this._inwardNormal.x, y + scale * this._inwardNormal.y, z + scale * this._inwardNormal.z, result);
     }
 }
 
@@ -192323,8 +192311,8 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony import */ var _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ../geometry3d/Point3dVector3d */ "../../core/geometry/lib/esm/geometry3d/Point3dVector3d.js");
 /* harmony import */ var _geometry3d_PolygonOps__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! ../geometry3d/PolygonOps */ "../../core/geometry/lib/esm/geometry3d/PolygonOps.js");
 /* harmony import */ var _geometry3d_Range__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ../geometry3d/Range */ "../../core/geometry/lib/esm/geometry3d/Range.js");
-/* harmony import */ var _polyface_Polyface__WEBPACK_IMPORTED_MODULE_10__ = __webpack_require__(/*! ../polyface/Polyface */ "../../core/geometry/lib/esm/polyface/Polyface.js");
-/* harmony import */ var _polyface_PolyfaceQuery__WEBPACK_IMPORTED_MODULE_11__ = __webpack_require__(/*! ../polyface/PolyfaceQuery */ "../../core/geometry/lib/esm/polyface/PolyfaceQuery.js");
+/* harmony import */ var _polyface_Polyface__WEBPACK_IMPORTED_MODULE_11__ = __webpack_require__(/*! ../polyface/Polyface */ "../../core/geometry/lib/esm/polyface/Polyface.js");
+/* harmony import */ var _polyface_PolyfaceQuery__WEBPACK_IMPORTED_MODULE_10__ = __webpack_require__(/*! ../polyface/PolyfaceQuery */ "../../core/geometry/lib/esm/polyface/PolyfaceQuery.js");
 /* harmony import */ var _ClipPlane__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./ClipPlane */ "../../core/geometry/lib/esm/clipping/ClipPlane.js");
 /* harmony import */ var _ClipUtils__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ./ClipUtils */ "../../core/geometry/lib/esm/clipping/ClipUtils.js");
 /*---------------------------------------------------------------------------------------------
@@ -193064,29 +193052,18 @@ class ConvexClipPlaneSet {
     static createConvexPolyface(convexMesh, result) {
         result = this.createEmpty(result);
         let vol = 0;
-        let myMesh;
-        let myVisitor;
-        if (convexMesh instanceof _polyface_Polyface__WEBPACK_IMPORTED_MODULE_10__.Polyface) {
-            myMesh = convexMesh;
-            myVisitor = convexMesh.createVisitor(0);
-        }
-        else {
-            myMesh = convexMesh.clientPolyface();
-            myVisitor = convexMesh;
-        }
-        if (myMesh && myVisitor) {
-            if (_polyface_PolyfaceQuery__WEBPACK_IMPORTED_MODULE_11__.PolyfaceQuery.isPolyfaceClosedByEdgePairing(myMesh))
-                vol = _polyface_PolyfaceQuery__WEBPACK_IMPORTED_MODULE_11__.PolyfaceQuery.sumTetrahedralVolumes(myVisitor);
-            const scale = vol > 0.0 ? -1.0 : 1.0; // point clipper normals inward if mesh normals point outward
-            const normal = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Vector3d.create();
-            const plane = _geometry3d_Plane3dByOriginAndUnitNormal__WEBPACK_IMPORTED_MODULE_1__.Plane3dByOriginAndUnitNormal.createXYPlane();
-            myVisitor.reset();
-            while (myVisitor.moveToNextFacet()) {
-                if (undefined !== _geometry3d_PolygonOps__WEBPACK_IMPORTED_MODULE_7__.PolygonOps.areaNormalGo(myVisitor.point, normal)) {
-                    normal.scaleInPlace(scale);
-                    if (undefined !== _geometry3d_Plane3dByOriginAndUnitNormal__WEBPACK_IMPORTED_MODULE_1__.Plane3dByOriginAndUnitNormal.create(myVisitor.point.front(), normal, plane))
-                        result.addPlaneToConvexSet(plane);
-                }
+        if (_polyface_PolyfaceQuery__WEBPACK_IMPORTED_MODULE_10__.PolyfaceQuery.isPolyfaceClosedByEdgePairing(convexMesh))
+            vol = _polyface_PolyfaceQuery__WEBPACK_IMPORTED_MODULE_10__.PolyfaceQuery.sumTetrahedralVolumes(convexMesh);
+        const scale = vol > 0.0 ? -1.0 : 1.0; // point clipper normals inward if mesh normals point outward
+        const normal = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Vector3d.create();
+        const plane = _geometry3d_Plane3dByOriginAndUnitNormal__WEBPACK_IMPORTED_MODULE_1__.Plane3dByOriginAndUnitNormal.createXYPlane();
+        const visitor = convexMesh instanceof _polyface_Polyface__WEBPACK_IMPORTED_MODULE_11__.Polyface ? convexMesh.createVisitor(0) : convexMesh;
+        visitor.setNumWrap(0);
+        for (visitor.reset(); visitor.moveToNextFacet();) {
+            if (undefined !== _geometry3d_PolygonOps__WEBPACK_IMPORTED_MODULE_7__.PolygonOps.areaNormalGo(visitor.point, normal)) {
+                normal.scaleInPlace(scale);
+                if (undefined !== _geometry3d_Plane3dByOriginAndUnitNormal__WEBPACK_IMPORTED_MODULE_1__.Plane3dByOriginAndUnitNormal.create(visitor.point.front(), normal, plane))
+                    result.addPlaneToConvexSet(plane);
             }
         }
         return { clipper: result, volume: vol };
@@ -193681,7 +193658,7 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */   BSplineWrapMode: () => (/* reexport safe */ _bspline_KnotVector__WEBPACK_IMPORTED_MODULE_108__.BSplineWrapMode),
 /* harmony export */   BagOfCurves: () => (/* reexport safe */ _curve_CurveCollection__WEBPACK_IMPORTED_MODULE_64__.BagOfCurves),
 /* harmony export */   BarycentricTriangle: () => (/* reexport safe */ _geometry3d_BarycentricTriangle__WEBPACK_IMPORTED_MODULE_3__.BarycentricTriangle),
-/* harmony export */   BentleyGeometryFlatBuffer: () => (/* reexport safe */ _serialization_BentleyGeometryFlatBuffer__WEBPACK_IMPORTED_MODULE_131__.BentleyGeometryFlatBuffer),
+/* harmony export */   BentleyGeometryFlatBuffer: () => (/* reexport safe */ _serialization_BentleyGeometryFlatBuffer__WEBPACK_IMPORTED_MODULE_132__.BentleyGeometryFlatBuffer),
 /* harmony export */   Bezier1dNd: () => (/* reexport safe */ _bspline_Bezier1dNd__WEBPACK_IMPORTED_MODULE_98__.Bezier1dNd),
 /* harmony export */   BezierCoffs: () => (/* reexport safe */ _numerics_BezierPolynomials__WEBPACK_IMPORTED_MODULE_51__.BezierCoffs),
 /* harmony export */   BezierCurve3d: () => (/* reexport safe */ _bspline_BezierCurve3d__WEBPACK_IMPORTED_MODULE_100__.BezierCurve3d),
@@ -193701,7 +193678,7 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */   ClipStepAction: () => (/* reexport safe */ _clipping_ClipUtils__WEBPACK_IMPORTED_MODULE_44__.ClipStepAction),
 /* harmony export */   ClipUtilities: () => (/* reexport safe */ _clipping_ClipUtils__WEBPACK_IMPORTED_MODULE_44__.ClipUtilities),
 /* harmony export */   ClipVector: () => (/* reexport safe */ _clipping_ClipVector__WEBPACK_IMPORTED_MODULE_43__.ClipVector),
-/* harmony export */   ClippedPolyfaceBuilders: () => (/* reexport safe */ _polyface_PolyfaceClip__WEBPACK_IMPORTED_MODULE_121__.ClippedPolyfaceBuilders),
+/* harmony export */   ClippedPolyfaceBuilders: () => (/* reexport safe */ _polyface_PolyfaceClip__WEBPACK_IMPORTED_MODULE_122__.ClippedPolyfaceBuilders),
 /* harmony export */   ClusterableArray: () => (/* reexport safe */ _numerics_ClusterableArray__WEBPACK_IMPORTED_MODULE_52__.ClusterableArray),
 /* harmony export */   Complex: () => (/* reexport safe */ _numerics_Complex__WEBPACK_IMPORTED_MODULE_53__.Complex),
 /* harmony export */   Cone: () => (/* reexport safe */ _solid_Cone__WEBPACK_IMPORTED_MODULE_89__.Cone),
@@ -193729,9 +193706,9 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */   CurveSearchStatus: () => (/* reexport safe */ _curve_CurveLocationDetail__WEBPACK_IMPORTED_MODULE_66__.CurveSearchStatus),
 /* harmony export */   CutLoop: () => (/* reexport safe */ _geometry3d_PolygonOps__WEBPACK_IMPORTED_MODULE_27__.CutLoop),
 /* harmony export */   CutLoopMergeContext: () => (/* reexport safe */ _geometry3d_PolygonOps__WEBPACK_IMPORTED_MODULE_27__.CutLoopMergeContext),
-/* harmony export */   DeepCompare: () => (/* reexport safe */ _serialization_DeepCompare__WEBPACK_IMPORTED_MODULE_128__.DeepCompare),
+/* harmony export */   DeepCompare: () => (/* reexport safe */ _serialization_DeepCompare__WEBPACK_IMPORTED_MODULE_129__.DeepCompare),
 /* harmony export */   DirectSpiral3d: () => (/* reexport safe */ _curve_spiral_DirectSpiral3d__WEBPACK_IMPORTED_MODULE_85__.DirectSpiral3d),
-/* harmony export */   DuplicateFacetClusterSelector: () => (/* reexport safe */ _polyface_PolyfaceQuery__WEBPACK_IMPORTED_MODULE_120__.DuplicateFacetClusterSelector),
+/* harmony export */   DuplicateFacetClusterSelector: () => (/* reexport safe */ _polyface_PolyfaceQuery__WEBPACK_IMPORTED_MODULE_121__.DuplicateFacetClusterSelector),
 /* harmony export */   Ellipsoid: () => (/* reexport safe */ _geometry3d_Ellipsoid__WEBPACK_IMPORTED_MODULE_5__.Ellipsoid),
 /* harmony export */   EllipsoidPatch: () => (/* reexport safe */ _geometry3d_Ellipsoid__WEBPACK_IMPORTED_MODULE_5__.EllipsoidPatch),
 /* harmony export */   EllipticalArcApproximationOptions: () => (/* reexport safe */ _curve_Arc3d__WEBPACK_IMPORTED_MODULE_59__.EllipticalArcApproximationOptions),
@@ -193746,18 +193723,19 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */   Geometry: () => (/* reexport safe */ _Geometry__WEBPACK_IMPORTED_MODULE_36__.Geometry),
 /* harmony export */   GeometryHandler: () => (/* reexport safe */ _geometry3d_GeometryHandler__WEBPACK_IMPORTED_MODULE_8__.GeometryHandler),
 /* harmony export */   GeometryQuery: () => (/* reexport safe */ _curve_GeometryQuery__WEBPACK_IMPORTED_MODULE_71__.GeometryQuery),
-/* harmony export */   GriddedRaggedRange2dSet: () => (/* reexport safe */ _polyface_multiclip_GriddedRaggedRange2dSet__WEBPACK_IMPORTED_MODULE_116__.GriddedRaggedRange2dSet),
-/* harmony export */   GriddedRaggedRange2dSetWithOverflow: () => (/* reexport safe */ _polyface_multiclip_GriddedRaggedRange2dSetWithOverflow__WEBPACK_IMPORTED_MODULE_117__.GriddedRaggedRange2dSetWithOverflow),
+/* harmony export */   GriddedRaggedRange2dSet: () => (/* reexport safe */ _polyface_multiclip_GriddedRaggedRange2dSet__WEBPACK_IMPORTED_MODULE_117__.GriddedRaggedRange2dSet),
+/* harmony export */   GriddedRaggedRange2dSetWithOverflow: () => (/* reexport safe */ _polyface_multiclip_GriddedRaggedRange2dSetWithOverflow__WEBPACK_IMPORTED_MODULE_118__.GriddedRaggedRange2dSetWithOverflow),
 /* harmony export */   GrowableBlockedArray: () => (/* reexport safe */ _geometry3d_GrowableBlockedArray__WEBPACK_IMPORTED_MODULE_9__.GrowableBlockedArray),
 /* harmony export */   GrowableFloat64Array: () => (/* reexport safe */ _geometry3d_GrowableFloat64Array__WEBPACK_IMPORTED_MODULE_10__.GrowableFloat64Array),
 /* harmony export */   GrowableXYArray: () => (/* reexport safe */ _geometry3d_GrowableXYArray__WEBPACK_IMPORTED_MODULE_11__.GrowableXYArray),
 /* harmony export */   GrowableXYZArray: () => (/* reexport safe */ _geometry3d_GrowableXYZArray__WEBPACK_IMPORTED_MODULE_12__.GrowableXYZArray),
-/* harmony export */   IModelJson: () => (/* reexport safe */ _serialization_IModelJsonSchema__WEBPACK_IMPORTED_MODULE_127__.IModelJson),
+/* harmony export */   IModelJson: () => (/* reexport safe */ _serialization_IModelJsonSchema__WEBPACK_IMPORTED_MODULE_128__.IModelJson),
 /* harmony export */   IndexedCollectionInterval: () => (/* reexport safe */ _geometry3d_IndexedCollectionInterval__WEBPACK_IMPORTED_MODULE_13__.IndexedCollectionInterval),
+/* harmony export */   IndexedEdgeMatcher: () => (/* reexport safe */ _polyface_IndexedEdgeMatcher__WEBPACK_IMPORTED_MODULE_114__.IndexedEdgeMatcher),
 /* harmony export */   IndexedPolyface: () => (/* reexport safe */ _polyface_Polyface__WEBPACK_IMPORTED_MODULE_112__.IndexedPolyface),
-/* harmony export */   IndexedPolyfaceSubsetVisitor: () => (/* reexport safe */ _polyface_IndexedPolyfaceVisitor__WEBPACK_IMPORTED_MODULE_114__.IndexedPolyfaceSubsetVisitor),
-/* harmony export */   IndexedPolyfaceVisitor: () => (/* reexport safe */ _polyface_IndexedPolyfaceVisitor__WEBPACK_IMPORTED_MODULE_114__.IndexedPolyfaceVisitor),
-/* harmony export */   IndexedPolyfaceWalker: () => (/* reexport safe */ _polyface_IndexedPolyfaceWalker__WEBPACK_IMPORTED_MODULE_115__.IndexedPolyfaceWalker),
+/* harmony export */   IndexedPolyfaceSubsetVisitor: () => (/* reexport safe */ _polyface_IndexedPolyfaceVisitor__WEBPACK_IMPORTED_MODULE_115__.IndexedPolyfaceSubsetVisitor),
+/* harmony export */   IndexedPolyfaceVisitor: () => (/* reexport safe */ _polyface_IndexedPolyfaceVisitor__WEBPACK_IMPORTED_MODULE_115__.IndexedPolyfaceVisitor),
+/* harmony export */   IndexedPolyfaceWalker: () => (/* reexport safe */ _polyface_IndexedPolyfaceWalker__WEBPACK_IMPORTED_MODULE_116__.IndexedPolyfaceWalker),
 /* harmony export */   IndexedReadWriteXYZCollection: () => (/* reexport safe */ _geometry3d_IndexedXYZCollection__WEBPACK_IMPORTED_MODULE_15__.IndexedReadWriteXYZCollection),
 /* harmony export */   IndexedXYCollection: () => (/* reexport safe */ _geometry3d_IndexedXYCollection__WEBPACK_IMPORTED_MODULE_14__.IndexedXYCollection),
 /* harmony export */   IndexedXYZCollection: () => (/* reexport safe */ _geometry3d_IndexedXYZCollection__WEBPACK_IMPORTED_MODULE_15__.IndexedXYZCollection),
@@ -193771,7 +193749,7 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */   KnotVector: () => (/* reexport safe */ _bspline_KnotVector__WEBPACK_IMPORTED_MODULE_108__.KnotVector),
 /* harmony export */   LineSegment3d: () => (/* reexport safe */ _curve_LineSegment3d__WEBPACK_IMPORTED_MODULE_72__.LineSegment3d),
 /* harmony export */   LineString3d: () => (/* reexport safe */ _curve_LineString3d__WEBPACK_IMPORTED_MODULE_73__.LineString3d),
-/* harmony export */   LineString3dRangeTreeContext: () => (/* reexport safe */ _polyface_RangeTree_LineString3dRangeTreeContext__WEBPACK_IMPORTED_MODULE_123__.LineString3dRangeTreeContext),
+/* harmony export */   LineString3dRangeTreeContext: () => (/* reexport safe */ _polyface_RangeTree_LineString3dRangeTreeContext__WEBPACK_IMPORTED_MODULE_124__.LineString3dRangeTreeContext),
 /* harmony export */   LinearSweep: () => (/* reexport safe */ _solid_LinearSweep__WEBPACK_IMPORTED_MODULE_90__.LinearSweep),
 /* harmony export */   LongitudeLatitudeNumber: () => (/* reexport safe */ _geometry3d_LongitudeLatitudeAltitude__WEBPACK_IMPORTED_MODULE_2__.LongitudeLatitudeNumber),
 /* harmony export */   Loop: () => (/* reexport safe */ _curve_Loop__WEBPACK_IMPORTED_MODULE_74__.Loop),
@@ -193784,7 +193762,7 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */   NonConvexFacetLocationDetail: () => (/* reexport safe */ _polyface_FacetLocationDetail__WEBPACK_IMPORTED_MODULE_113__.NonConvexFacetLocationDetail),
 /* harmony export */   NullGeometryHandler: () => (/* reexport safe */ _geometry3d_GeometryHandler__WEBPACK_IMPORTED_MODULE_8__.NullGeometryHandler),
 /* harmony export */   NumberArray: () => (/* reexport safe */ _geometry3d_PointHelpers__WEBPACK_IMPORTED_MODULE_24__.NumberArray),
-/* harmony export */   OffsetMeshOptions: () => (/* reexport safe */ _polyface_PolyfaceQuery__WEBPACK_IMPORTED_MODULE_120__.OffsetMeshOptions),
+/* harmony export */   OffsetMeshOptions: () => (/* reexport safe */ _polyface_PolyfaceQuery__WEBPACK_IMPORTED_MODULE_121__.OffsetMeshOptions),
 /* harmony export */   OffsetOptions: () => (/* reexport safe */ _curve_OffsetOptions__WEBPACK_IMPORTED_MODULE_75__.OffsetOptions),
 /* harmony export */   Order2Bezier: () => (/* reexport safe */ _numerics_BezierPolynomials__WEBPACK_IMPORTED_MODULE_51__.Order2Bezier),
 /* harmony export */   Order3Bezier: () => (/* reexport safe */ _numerics_BezierPolynomials__WEBPACK_IMPORTED_MODULE_51__.Order3Bezier),
@@ -193807,17 +193785,17 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */   Point3dArray: () => (/* reexport safe */ _geometry3d_PointHelpers__WEBPACK_IMPORTED_MODULE_24__.Point3dArray),
 /* harmony export */   Point3dArrayCarrier: () => (/* reexport safe */ _geometry3d_Point3dArrayCarrier__WEBPACK_IMPORTED_MODULE_25__.Point3dArrayCarrier),
 /* harmony export */   Point3dArrayPolygonOps: () => (/* reexport safe */ _geometry3d_PolygonOps__WEBPACK_IMPORTED_MODULE_27__.Point3dArrayPolygonOps),
-/* harmony export */   Point3dArrayRangeTreeContext: () => (/* reexport safe */ _polyface_RangeTree_Point3dArrayRangeTreeContext__WEBPACK_IMPORTED_MODULE_122__.Point3dArrayRangeTreeContext),
+/* harmony export */   Point3dArrayRangeTreeContext: () => (/* reexport safe */ _polyface_RangeTree_Point3dArrayRangeTreeContext__WEBPACK_IMPORTED_MODULE_123__.Point3dArrayRangeTreeContext),
 /* harmony export */   Point4d: () => (/* reexport safe */ _geometry4d_Point4d__WEBPACK_IMPORTED_MODULE_47__.Point4d),
 /* harmony export */   Point4dArray: () => (/* reexport safe */ _geometry3d_PointHelpers__WEBPACK_IMPORTED_MODULE_24__.Point4dArray),
 /* harmony export */   PointString3d: () => (/* reexport safe */ _curve_PointString3d__WEBPACK_IMPORTED_MODULE_80__.PointString3d),
 /* harmony export */   Polyface: () => (/* reexport safe */ _polyface_Polyface__WEBPACK_IMPORTED_MODULE_112__.Polyface),
 /* harmony export */   PolyfaceAuxData: () => (/* reexport safe */ _polyface_AuxData__WEBPACK_IMPORTED_MODULE_109__.PolyfaceAuxData),
-/* harmony export */   PolyfaceBuilder: () => (/* reexport safe */ _polyface_PolyfaceBuilder__WEBPACK_IMPORTED_MODULE_118__.PolyfaceBuilder),
-/* harmony export */   PolyfaceClip: () => (/* reexport safe */ _polyface_PolyfaceClip__WEBPACK_IMPORTED_MODULE_121__.PolyfaceClip),
-/* harmony export */   PolyfaceData: () => (/* reexport safe */ _polyface_PolyfaceData__WEBPACK_IMPORTED_MODULE_119__.PolyfaceData),
-/* harmony export */   PolyfaceQuery: () => (/* reexport safe */ _polyface_PolyfaceQuery__WEBPACK_IMPORTED_MODULE_120__.PolyfaceQuery),
-/* harmony export */   PolyfaceRangeTreeContext: () => (/* reexport safe */ _polyface_RangeTree_PolyfaceRangeTreeContext__WEBPACK_IMPORTED_MODULE_124__.PolyfaceRangeTreeContext),
+/* harmony export */   PolyfaceBuilder: () => (/* reexport safe */ _polyface_PolyfaceBuilder__WEBPACK_IMPORTED_MODULE_119__.PolyfaceBuilder),
+/* harmony export */   PolyfaceClip: () => (/* reexport safe */ _polyface_PolyfaceClip__WEBPACK_IMPORTED_MODULE_122__.PolyfaceClip),
+/* harmony export */   PolyfaceData: () => (/* reexport safe */ _polyface_PolyfaceData__WEBPACK_IMPORTED_MODULE_120__.PolyfaceData),
+/* harmony export */   PolyfaceQuery: () => (/* reexport safe */ _polyface_PolyfaceQuery__WEBPACK_IMPORTED_MODULE_121__.PolyfaceQuery),
+/* harmony export */   PolyfaceRangeTreeContext: () => (/* reexport safe */ _polyface_RangeTree_PolyfaceRangeTreeContext__WEBPACK_IMPORTED_MODULE_125__.PolyfaceRangeTreeContext),
 /* harmony export */   PolygonLocation: () => (/* reexport safe */ _Geometry__WEBPACK_IMPORTED_MODULE_36__.PolygonLocation),
 /* harmony export */   PolygonLocationDetail: () => (/* reexport safe */ _geometry3d_PolygonOps__WEBPACK_IMPORTED_MODULE_27__.PolygonLocationDetail),
 /* harmony export */   PolygonLocationDetailPair: () => (/* reexport safe */ _geometry3d_PolygonOps__WEBPACK_IMPORTED_MODULE_27__.PolygonLocationDetailPair),
@@ -193840,23 +193818,24 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */   RegionOps: () => (/* reexport safe */ _curve_RegionOps__WEBPACK_IMPORTED_MODULE_79__.RegionOps),
 /* harmony export */   RotationalSweep: () => (/* reexport safe */ _solid_RotationalSweep__WEBPACK_IMPORTED_MODULE_91__.RotationalSweep),
 /* harmony export */   RuledSweep: () => (/* reexport safe */ _solid_RuledSweep__WEBPACK_IMPORTED_MODULE_92__.RuledSweep),
-/* harmony export */   Sample: () => (/* reexport safe */ _serialization_GeometrySamples__WEBPACK_IMPORTED_MODULE_129__.Sample),
+/* harmony export */   Sample: () => (/* reexport safe */ _serialization_GeometrySamples__WEBPACK_IMPORTED_MODULE_130__.Sample),
 /* harmony export */   Segment1d: () => (/* reexport safe */ _geometry3d_Segment1d__WEBPACK_IMPORTED_MODULE_31__.Segment1d),
-/* harmony export */   SerializationHelpers: () => (/* reexport safe */ _serialization_SerializationHelpers__WEBPACK_IMPORTED_MODULE_130__.SerializationHelpers),
+/* harmony export */   SerializationHelpers: () => (/* reexport safe */ _serialization_SerializationHelpers__WEBPACK_IMPORTED_MODULE_131__.SerializationHelpers),
 /* harmony export */   SmallSystem: () => (/* reexport safe */ _numerics_SmallSystem__WEBPACK_IMPORTED_MODULE_57__.SmallSystem),
 /* harmony export */   SmoothTransformBetweenFrusta: () => (/* reexport safe */ _geometry3d_FrustumAnimation__WEBPACK_IMPORTED_MODULE_7__.SmoothTransformBetweenFrusta),
 /* harmony export */   SolidPrimitive: () => (/* reexport safe */ _solid_SolidPrimitive__WEBPACK_IMPORTED_MODULE_93__.SolidPrimitive),
-/* harmony export */   SpacePolygonTriangulation: () => (/* reexport safe */ _topology_SpaceTriangulation__WEBPACK_IMPORTED_MODULE_126__.SpacePolygonTriangulation),
+/* harmony export */   SortableEdge: () => (/* reexport safe */ _polyface_IndexedEdgeMatcher__WEBPACK_IMPORTED_MODULE_114__.SortableEdge),
+/* harmony export */   SpacePolygonTriangulation: () => (/* reexport safe */ _topology_SpaceTriangulation__WEBPACK_IMPORTED_MODULE_127__.SpacePolygonTriangulation),
 /* harmony export */   Sphere: () => (/* reexport safe */ _solid_Sphere__WEBPACK_IMPORTED_MODULE_94__.Sphere),
 /* harmony export */   StandardViewIndex: () => (/* reexport safe */ _Geometry__WEBPACK_IMPORTED_MODULE_36__.StandardViewIndex),
-/* harmony export */   SteppedIndexFunctionFactory: () => (/* reexport safe */ _serialization_GeometrySamples__WEBPACK_IMPORTED_MODULE_129__.SteppedIndexFunctionFactory),
+/* harmony export */   SteppedIndexFunctionFactory: () => (/* reexport safe */ _serialization_GeometrySamples__WEBPACK_IMPORTED_MODULE_130__.SteppedIndexFunctionFactory),
 /* harmony export */   StringifiedClipVector: () => (/* reexport safe */ _clipping_ClipVector__WEBPACK_IMPORTED_MODULE_43__.StringifiedClipVector),
 /* harmony export */   StrokeCountMap: () => (/* reexport safe */ _curve_Query_StrokeCountMap__WEBPACK_IMPORTED_MODULE_87__.StrokeCountMap),
 /* harmony export */   StrokeOptions: () => (/* reexport safe */ _curve_StrokeOptions__WEBPACK_IMPORTED_MODULE_82__.StrokeOptions),
 /* harmony export */   SweepContour: () => (/* reexport safe */ _solid_SweepContour__WEBPACK_IMPORTED_MODULE_95__.SweepContour),
-/* harmony export */   SweepLineStringToFacetsOptions: () => (/* reexport safe */ _polyface_PolyfaceQuery__WEBPACK_IMPORTED_MODULE_120__.SweepLineStringToFacetsOptions),
-/* harmony export */   TaggedNumericConstants: () => (/* reexport safe */ _polyface_TaggedNumericData__WEBPACK_IMPORTED_MODULE_125__.TaggedNumericConstants),
-/* harmony export */   TaggedNumericData: () => (/* reexport safe */ _polyface_TaggedNumericData__WEBPACK_IMPORTED_MODULE_125__.TaggedNumericData),
+/* harmony export */   SweepLineStringToFacetsOptions: () => (/* reexport safe */ _polyface_PolyfaceQuery__WEBPACK_IMPORTED_MODULE_121__.SweepLineStringToFacetsOptions),
+/* harmony export */   TaggedNumericConstants: () => (/* reexport safe */ _polyface_TaggedNumericData__WEBPACK_IMPORTED_MODULE_126__.TaggedNumericConstants),
+/* harmony export */   TaggedNumericData: () => (/* reexport safe */ _polyface_TaggedNumericData__WEBPACK_IMPORTED_MODULE_126__.TaggedNumericData),
 /* harmony export */   TorusPipe: () => (/* reexport safe */ _solid_TorusPipe__WEBPACK_IMPORTED_MODULE_96__.TorusPipe),
 /* harmony export */   Transform: () => (/* reexport safe */ _geometry3d_Transform__WEBPACK_IMPORTED_MODULE_32__.Transform),
 /* harmony export */   TransitionSpiral3d: () => (/* reexport safe */ _curve_spiral_TransitionSpiral3d__WEBPACK_IMPORTED_MODULE_83__.TransitionSpiral3d),
@@ -193992,24 +193971,25 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony import */ var _polyface_FacetFaceData__WEBPACK_IMPORTED_MODULE_111__ = __webpack_require__(/*! ./polyface/FacetFaceData */ "../../core/geometry/lib/esm/polyface/FacetFaceData.js");
 /* harmony import */ var _polyface_Polyface__WEBPACK_IMPORTED_MODULE_112__ = __webpack_require__(/*! ./polyface/Polyface */ "../../core/geometry/lib/esm/polyface/Polyface.js");
 /* harmony import */ var _polyface_FacetLocationDetail__WEBPACK_IMPORTED_MODULE_113__ = __webpack_require__(/*! ./polyface/FacetLocationDetail */ "../../core/geometry/lib/esm/polyface/FacetLocationDetail.js");
-/* harmony import */ var _polyface_IndexedPolyfaceVisitor__WEBPACK_IMPORTED_MODULE_114__ = __webpack_require__(/*! ./polyface/IndexedPolyfaceVisitor */ "../../core/geometry/lib/esm/polyface/IndexedPolyfaceVisitor.js");
-/* harmony import */ var _polyface_IndexedPolyfaceWalker__WEBPACK_IMPORTED_MODULE_115__ = __webpack_require__(/*! ./polyface/IndexedPolyfaceWalker */ "../../core/geometry/lib/esm/polyface/IndexedPolyfaceWalker.js");
-/* harmony import */ var _polyface_multiclip_GriddedRaggedRange2dSet__WEBPACK_IMPORTED_MODULE_116__ = __webpack_require__(/*! ./polyface/multiclip/GriddedRaggedRange2dSet */ "../../core/geometry/lib/esm/polyface/multiclip/GriddedRaggedRange2dSet.js");
-/* harmony import */ var _polyface_multiclip_GriddedRaggedRange2dSetWithOverflow__WEBPACK_IMPORTED_MODULE_117__ = __webpack_require__(/*! ./polyface/multiclip/GriddedRaggedRange2dSetWithOverflow */ "../../core/geometry/lib/esm/polyface/multiclip/GriddedRaggedRange2dSetWithOverflow.js");
-/* harmony import */ var _polyface_PolyfaceBuilder__WEBPACK_IMPORTED_MODULE_118__ = __webpack_require__(/*! ./polyface/PolyfaceBuilder */ "../../core/geometry/lib/esm/polyface/PolyfaceBuilder.js");
-/* harmony import */ var _polyface_PolyfaceData__WEBPACK_IMPORTED_MODULE_119__ = __webpack_require__(/*! ./polyface/PolyfaceData */ "../../core/geometry/lib/esm/polyface/PolyfaceData.js");
-/* harmony import */ var _polyface_PolyfaceQuery__WEBPACK_IMPORTED_MODULE_120__ = __webpack_require__(/*! ./polyface/PolyfaceQuery */ "../../core/geometry/lib/esm/polyface/PolyfaceQuery.js");
-/* harmony import */ var _polyface_PolyfaceClip__WEBPACK_IMPORTED_MODULE_121__ = __webpack_require__(/*! ./polyface/PolyfaceClip */ "../../core/geometry/lib/esm/polyface/PolyfaceClip.js");
-/* harmony import */ var _polyface_RangeTree_Point3dArrayRangeTreeContext__WEBPACK_IMPORTED_MODULE_122__ = __webpack_require__(/*! ./polyface/RangeTree/Point3dArrayRangeTreeContext */ "../../core/geometry/lib/esm/polyface/RangeTree/Point3dArrayRangeTreeContext.js");
-/* harmony import */ var _polyface_RangeTree_LineString3dRangeTreeContext__WEBPACK_IMPORTED_MODULE_123__ = __webpack_require__(/*! ./polyface/RangeTree/LineString3dRangeTreeContext */ "../../core/geometry/lib/esm/polyface/RangeTree/LineString3dRangeTreeContext.js");
-/* harmony import */ var _polyface_RangeTree_PolyfaceRangeTreeContext__WEBPACK_IMPORTED_MODULE_124__ = __webpack_require__(/*! ./polyface/RangeTree/PolyfaceRangeTreeContext */ "../../core/geometry/lib/esm/polyface/RangeTree/PolyfaceRangeTreeContext.js");
-/* harmony import */ var _polyface_TaggedNumericData__WEBPACK_IMPORTED_MODULE_125__ = __webpack_require__(/*! ./polyface/TaggedNumericData */ "../../core/geometry/lib/esm/polyface/TaggedNumericData.js");
-/* harmony import */ var _topology_SpaceTriangulation__WEBPACK_IMPORTED_MODULE_126__ = __webpack_require__(/*! ./topology/SpaceTriangulation */ "../../core/geometry/lib/esm/topology/SpaceTriangulation.js");
-/* harmony import */ var _serialization_IModelJsonSchema__WEBPACK_IMPORTED_MODULE_127__ = __webpack_require__(/*! ./serialization/IModelJsonSchema */ "../../core/geometry/lib/esm/serialization/IModelJsonSchema.js");
-/* harmony import */ var _serialization_DeepCompare__WEBPACK_IMPORTED_MODULE_128__ = __webpack_require__(/*! ./serialization/DeepCompare */ "../../core/geometry/lib/esm/serialization/DeepCompare.js");
-/* harmony import */ var _serialization_GeometrySamples__WEBPACK_IMPORTED_MODULE_129__ = __webpack_require__(/*! ./serialization/GeometrySamples */ "../../core/geometry/lib/esm/serialization/GeometrySamples.js");
-/* harmony import */ var _serialization_SerializationHelpers__WEBPACK_IMPORTED_MODULE_130__ = __webpack_require__(/*! ./serialization/SerializationHelpers */ "../../core/geometry/lib/esm/serialization/SerializationHelpers.js");
-/* harmony import */ var _serialization_BentleyGeometryFlatBuffer__WEBPACK_IMPORTED_MODULE_131__ = __webpack_require__(/*! ./serialization/BentleyGeometryFlatBuffer */ "../../core/geometry/lib/esm/serialization/BentleyGeometryFlatBuffer.js");
+/* harmony import */ var _polyface_IndexedEdgeMatcher__WEBPACK_IMPORTED_MODULE_114__ = __webpack_require__(/*! ./polyface/IndexedEdgeMatcher */ "../../core/geometry/lib/esm/polyface/IndexedEdgeMatcher.js");
+/* harmony import */ var _polyface_IndexedPolyfaceVisitor__WEBPACK_IMPORTED_MODULE_115__ = __webpack_require__(/*! ./polyface/IndexedPolyfaceVisitor */ "../../core/geometry/lib/esm/polyface/IndexedPolyfaceVisitor.js");
+/* harmony import */ var _polyface_IndexedPolyfaceWalker__WEBPACK_IMPORTED_MODULE_116__ = __webpack_require__(/*! ./polyface/IndexedPolyfaceWalker */ "../../core/geometry/lib/esm/polyface/IndexedPolyfaceWalker.js");
+/* harmony import */ var _polyface_multiclip_GriddedRaggedRange2dSet__WEBPACK_IMPORTED_MODULE_117__ = __webpack_require__(/*! ./polyface/multiclip/GriddedRaggedRange2dSet */ "../../core/geometry/lib/esm/polyface/multiclip/GriddedRaggedRange2dSet.js");
+/* harmony import */ var _polyface_multiclip_GriddedRaggedRange2dSetWithOverflow__WEBPACK_IMPORTED_MODULE_118__ = __webpack_require__(/*! ./polyface/multiclip/GriddedRaggedRange2dSetWithOverflow */ "../../core/geometry/lib/esm/polyface/multiclip/GriddedRaggedRange2dSetWithOverflow.js");
+/* harmony import */ var _polyface_PolyfaceBuilder__WEBPACK_IMPORTED_MODULE_119__ = __webpack_require__(/*! ./polyface/PolyfaceBuilder */ "../../core/geometry/lib/esm/polyface/PolyfaceBuilder.js");
+/* harmony import */ var _polyface_PolyfaceData__WEBPACK_IMPORTED_MODULE_120__ = __webpack_require__(/*! ./polyface/PolyfaceData */ "../../core/geometry/lib/esm/polyface/PolyfaceData.js");
+/* harmony import */ var _polyface_PolyfaceQuery__WEBPACK_IMPORTED_MODULE_121__ = __webpack_require__(/*! ./polyface/PolyfaceQuery */ "../../core/geometry/lib/esm/polyface/PolyfaceQuery.js");
+/* harmony import */ var _polyface_PolyfaceClip__WEBPACK_IMPORTED_MODULE_122__ = __webpack_require__(/*! ./polyface/PolyfaceClip */ "../../core/geometry/lib/esm/polyface/PolyfaceClip.js");
+/* harmony import */ var _polyface_RangeTree_Point3dArrayRangeTreeContext__WEBPACK_IMPORTED_MODULE_123__ = __webpack_require__(/*! ./polyface/RangeTree/Point3dArrayRangeTreeContext */ "../../core/geometry/lib/esm/polyface/RangeTree/Point3dArrayRangeTreeContext.js");
+/* harmony import */ var _polyface_RangeTree_LineString3dRangeTreeContext__WEBPACK_IMPORTED_MODULE_124__ = __webpack_require__(/*! ./polyface/RangeTree/LineString3dRangeTreeContext */ "../../core/geometry/lib/esm/polyface/RangeTree/LineString3dRangeTreeContext.js");
+/* harmony import */ var _polyface_RangeTree_PolyfaceRangeTreeContext__WEBPACK_IMPORTED_MODULE_125__ = __webpack_require__(/*! ./polyface/RangeTree/PolyfaceRangeTreeContext */ "../../core/geometry/lib/esm/polyface/RangeTree/PolyfaceRangeTreeContext.js");
+/* harmony import */ var _polyface_TaggedNumericData__WEBPACK_IMPORTED_MODULE_126__ = __webpack_require__(/*! ./polyface/TaggedNumericData */ "../../core/geometry/lib/esm/polyface/TaggedNumericData.js");
+/* harmony import */ var _topology_SpaceTriangulation__WEBPACK_IMPORTED_MODULE_127__ = __webpack_require__(/*! ./topology/SpaceTriangulation */ "../../core/geometry/lib/esm/topology/SpaceTriangulation.js");
+/* harmony import */ var _serialization_IModelJsonSchema__WEBPACK_IMPORTED_MODULE_128__ = __webpack_require__(/*! ./serialization/IModelJsonSchema */ "../../core/geometry/lib/esm/serialization/IModelJsonSchema.js");
+/* harmony import */ var _serialization_DeepCompare__WEBPACK_IMPORTED_MODULE_129__ = __webpack_require__(/*! ./serialization/DeepCompare */ "../../core/geometry/lib/esm/serialization/DeepCompare.js");
+/* harmony import */ var _serialization_GeometrySamples__WEBPACK_IMPORTED_MODULE_130__ = __webpack_require__(/*! ./serialization/GeometrySamples */ "../../core/geometry/lib/esm/serialization/GeometrySamples.js");
+/* harmony import */ var _serialization_SerializationHelpers__WEBPACK_IMPORTED_MODULE_131__ = __webpack_require__(/*! ./serialization/SerializationHelpers */ "../../core/geometry/lib/esm/serialization/SerializationHelpers.js");
+/* harmony import */ var _serialization_BentleyGeometryFlatBuffer__WEBPACK_IMPORTED_MODULE_132__ = __webpack_require__(/*! ./serialization/BentleyGeometryFlatBuffer */ "../../core/geometry/lib/esm/serialization/BentleyGeometryFlatBuffer.js");
 /*---------------------------------------------------------------------------------------------
 * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
 * See LICENSE.md in the project root for license terms and full copyright notice.
@@ -194263,6 +194243,7 @@ __webpack_require__.r(__webpack_exports__);
 
 
 
+
 
 
 /***/ }),
@@ -194446,15 +194427,26 @@ class EllipticalArcApproximationOptions {
  * Circular or elliptic arc.
  * * The angle to point equation is:
  *   * `X = center + cos(theta) * vector0 + sin(theta) * vector90`
- * * When the two vectors are perpendicular and have equal length, it is a true circle.
- * * Non-perpendicular vectors are always elliptic.
- * * Vectors of unequal length are always elliptic.
- * * To create an ellipse in the common "major and minor axis" form of an ellipse:
- *   * vector0 is the vector from the center to the major axis extreme.
- *   * vector90 is the vector from the center to the minor axis extreme.
+ * * The arc's `sweep` determines the range of theta values (angles). In particular:
+ *   * The point at `theta = n*360` degrees is `center + vector0` for any integer n.
+ *   * The point at `theta = 90 + n*360` degrees is `center + vector90` for any integer n.
+ * * The arc's `sweep` _together with_ `vector0` and `vector90` determine the arc's orientation:
+ *   * If `sweep.startDegrees < sweep.endDegrees`, the arc's orientation is counterclockwise with respect to its
+ * `perpendicularVector` (i.e., looking at the arc from the head of this vector).
+ *   * Similarly, if `sweep.startDegrees > sweep.endDegrees`, the arc's orientation is clockwise with respect to
+ * its `perpendicularVector`.
+ *   * The arc's orientation is _always_ counterclockwise with respect to its `binormalVector`.
+ * * When `vector0` and `vector90` are perpendicular and have equal length, the arc is circular.
+ *   * When they are non-perpendicular, the arc is always elliptic.
+ *   * When they have unequal length, the arc is always elliptic.
+ * * To create an ellipse in standard major-minor axis form:
+ *   * `vector0` is the vector from the center to the major axis extreme.
+ *   * `vector90` is the vector from the center to the minor axis extreme.
  *   * Note that constructing these vectors to the extreme points makes them perpendicular.
- * * The method toScaledMatrix3d() can be called to convert the unrestricted vector0, vector90 to perpendicular form.
- * * The unrestricted form is much easier to work with for common calculations: stroking, projection to 2d, intersection with plane.
+ * * The method [[Arc3d.toScaledMatrix3d]] can be called to convert an arc with unrestricted `vector0` and `vector90`
+ * to an arc in standard major-minor axis form.
+ * * The unrestricted form is much easier to work with for common calculations: stroking, projection to 2d,
+ * intersection with plane.
  * @public
  */
 class Arc3d extends _CurvePrimitive__WEBPACK_IMPORTED_MODULE_1__.CurvePrimitive {
@@ -194465,7 +194457,7 @@ class Arc3d extends _CurvePrimitive__WEBPACK_IMPORTED_MODULE_1__.CurvePrimitive
         return other instanceof Arc3d;
     }
     _center;
-    _matrix; // columns are [vector0, vector90, unitNormal]
+    _matrix; // columns are [vector0, vector90, unit normal]
     _sweep; // sweep limits
     static _workPointA = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Point3d.create();
     static _workPointB = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Point3d.create();
@@ -194480,21 +194472,27 @@ class Arc3d extends _CurvePrimitive__WEBPACK_IMPORTED_MODULE_1__.CurvePrimitive
     set center(center) {
         this._center.setFrom(center);
     }
-    /** Read property for (reference to) center. */
+    /** Read property for (reference to) the arc center. */
     get centerRef() {
         return this._center;
     }
-    /** Read property for (clone of) vector0. */
+    /**
+     * Read property for (clone of) the x-column of the arc matrix.
+     * * This vector determines the point on the arc corresponding to angles n*360 degrees.
+     */
     get vector0() {
         return this._matrix.columnX();
     }
-    /** Read property for (clone of) vector90. */
+    /**
+     * Read property for (clone of) the y-column of the arc matrix.
+     * * This vector determines the point on the arc corresponding to angles 90 + n*360 degrees.
+     */
     get vector90() {
         return this._matrix.columnY();
     }
     /**
      * Compute an arc binormal vector with arbitrary length.
-     * * The arc parameterization is counter-clockwise with respect to this vector.
+     * * The arc parameterization is counterclockwise with respect to this vector.
      * * This vector is parallel to [[perpendicularVector]] and possibly opposite.
      */
     binormalVector(result) {
@@ -194502,17 +194500,18 @@ class Arc3d extends _CurvePrimitive__WEBPACK_IMPORTED_MODULE_1__.CurvePrimitive
         return plane.vectorU.crossProduct(plane.vectorV, result);
     }
     /**
-     * Read property for (clone of) plane normal, with arbitrary length.
-     * * Does not take arc sweep direction into account. See also [[binormalVector]].
+     * Read property for (clone of) the z-column of the arc matrix.
+     * * This vector is nominally the normalized cross product: `vector0 x vector90`.
+     * * To compute a vector with respect to which the arc sweep is counterclockwise, use [[binormalVector]].
      */
     get perpendicularVector() {
         return this._matrix.columnZ();
     }
-    /** Read property for (clone of) matrix of vector0, vector90, unit normal. */
+    /** Return a clone of the arc matrix. */
     matrixClone() {
         return this._matrix.clone();
     }
-    /** Read property for (reference to) matrix of vector0, vector90, unit normal. */
+    /** Read property for (reference to) the arc matrix. */
     get matrixRef() {
         return this._matrix;
     }
@@ -194527,17 +194526,14 @@ class Arc3d extends _CurvePrimitive__WEBPACK_IMPORTED_MODULE_1__.CurvePrimitive
     get isExtensibleFractionSpace() {
         return true;
     }
-    // constructor copies the pointers
+    /** Constructor. Captures the inputs. */
     constructor(center, matrix, sweep) {
         super();
         this._center = center;
         this._matrix = matrix;
         this._sweep = sweep.clampToFullCircle(sweep);
     }
-    /**
-     * Return a clone of the arc, with transform applied.
-     * @param transform
-     */
+    /** Return a clone of the arc, with transform applied. */
     cloneTransformed(transform) {
         const c = this.clone();
         c.tryTransformInPlace(transform);
@@ -194546,7 +194542,7 @@ class Arc3d extends _CurvePrimitive__WEBPACK_IMPORTED_MODULE_1__.CurvePrimitive
     /**
      * Redefine the arc with (captured references to) given data.
      * @param center arc center.
-     * @param matrix matrix with columns vector0, vector 90, and their unit cross product.
+     * @param matrix matrix with columns vector0, vector90, and their unit cross product.
      * @param sweep angle sweep.
      */
     setRefs(center, matrix, sweep) {
@@ -194557,7 +194553,7 @@ class Arc3d extends _CurvePrimitive__WEBPACK_IMPORTED_MODULE_1__.CurvePrimitive
     /**
      * Redefine the arc with (clones of) given data.
      * @param center arc center.
-     * @param matrix matrix with columns vector0, vector 90, and their unit cross product.
+     * @param matrix matrix with columns vector0, vector90, and their unit cross product.
      * @param sweep angle sweep.
      */
     set(center, matrix, sweep) {
@@ -194576,7 +194572,7 @@ class Arc3d extends _CurvePrimitive__WEBPACK_IMPORTED_MODULE_1__.CurvePrimitive
     /**
      * Create an arc, capturing references to center, matrix and sweep.
      * @param center center point.
-     * @param matrix matrix with columns vector0, vector90, and unit cross product.
+     * @param matrix matrix with columns vector0, vector90, and their unit cross product.
      * @param sweep sweep limits.
      * @param result optional preallocated result.
      */
@@ -194590,9 +194586,10 @@ class Arc3d extends _CurvePrimitive__WEBPACK_IMPORTED_MODULE_1__.CurvePrimitive
     /**
      * Create an arc from center, x column to be scaled, and y column to be scaled.
      * @param center center of ellipse.
-     * @param matrix matrix whose x and y columns are scaled by radius0 and radius90.
-     * @param radius0 radius in x direction.
-     * @param radius90 radius in y direction.
+     * @param matrix the x-column and y-column of this matrix are scaled by `radius0` and `radius90` to define the
+     * arc's `vector0` and `vector90`.
+     * @param radius0 radius along `vector0`.
+     * @param radius90 radius along `vector90`.
      * @param sweep sweep limits.
      * @param result optional preallocated result.
      */
@@ -194602,10 +194599,10 @@ class Arc3d extends _CurvePrimitive__WEBPACK_IMPORTED_MODULE_1__.CurvePrimitive
         return Arc3d.create(center, vector0.scale(radius0, vector0), vector90.scale(radius90, vector90), sweep, result);
     }
     /**
-     * Create a (full circular) arc from center, normal and radius.
-     * @param center center of ellipse. If undefined, center at 000.
+     * Create a full circle from center, normal and radius.
+     * @param center center of circle. If undefined, use 000.
      * @param normal normal vector.
-     * @param radius radius in x direction.
+     * @param radius radius of the circle.
      * @param result optional preallocated result.
      */
     static createCenterNormalRadius(center, normal, radius, result) {
@@ -194613,7 +194610,7 @@ class Arc3d extends _CurvePrimitive__WEBPACK_IMPORTED_MODULE_1__.CurvePrimitive
         return Arc3d.createScaledXYColumns(center, frame, radius, radius, undefined, result);
     }
     /**
-     * Create an arc by center with vectors to points at 0 and 90 degrees in parameter space.
+     * Create an elliptical arc by center with vectors to points at 0 and 90 degrees in parameter space.
      * @param center arc center.
      * @param vector0 vector to 0 degrees (commonly major axis).
      * @param vector90 vector to 90 degree point (commonly minor axis).
@@ -194930,10 +194927,13 @@ class Arc3d extends _CurvePrimitive__WEBPACK_IMPORTED_MODULE_1__.CurvePrimitive
     curveLength() {
         return this.curveLengthBetweenFractions(0, 1);
     }
-    // !! misspelled Gauss in the published static !! Declare it ok.
-    // cspell::word Guass
-    /** Gauss point quadrature count for evaluating curve length. (The number of intervals is adjusted to the arc sweep). */
+    /**
+     * Gauss point quadrature count for evaluating curve length. (The number of intervals is adjusted to the arc sweep).
+     * @deprecated in 5.0. Use correct spelling quadratureGaussCount.
+     */
     static quadratureGuassCount = 5;
+    /** Gauss point quadrature count for evaluating curve length. (The number of intervals is adjusted to the arc sweep). */
+    static quadratureGaussCount = 5;
     /** In quadrature for arc length, use this interval (divided by quickEccentricity). */
     static quadratureIntervalAngleDegrees = 10.0;
     /**
@@ -194960,7 +194960,7 @@ class Arc3d extends _CurvePrimitive__WEBPACK_IMPORTED_MODULE_1__.CurvePrimitive
             numInterval = 400;
         if (numInterval < 1)
             numInterval = 1;
-        return super.curveLengthWithFixedIntervalCountQuadrature(f0, f1, numInterval, Arc3d.quadratureGuassCount);
+        return super.curveLengthWithFixedIntervalCountQuadrature(f0, f1, numInterval, Arc3d.quadratureGaussCount);
     }
     /**
      * Return an approximate (but easy to compute) arc length.
@@ -196938,6 +196938,20 @@ class CurveCollection extends _GeometryQuery__WEBPACK_IMPORTED_MODULE_0__.Geomet
     projectedParameterRange(ray, lowHigh) {
         return _internalContexts_PlaneAltitudeRangeContext__WEBPACK_IMPORTED_MODULE_9__.PlaneAltitudeRangeContext.findExtremeFractionsAlongDirection(this, ray, lowHigh);
     }
+    /** Return the immediate parent of the input curve in the instance, or undefined if it is not a descendant. */
+    findParentOfDescendant(descendant) {
+        for (const child of this.children) {
+            if (child === descendant)
+                return this;
+            if (child instanceof CurveCollection) {
+                const parent = child.findParentOfDescendant(descendant);
+                if (parent)
+                    return parent;
+            }
+        }
+        return undefined;
+    }
+    ;
 }
 /**
  * Shared base class for use by both open and closed paths.
@@ -199942,6 +199956,7 @@ __webpack_require__.r(__webpack_exports__);
 
 
 
+// cspell:words CCWXY
 /**
  * A LineSegment3d is:
  * * A 3d line segment represented by its start and end coordinates
@@ -202915,11 +202930,12 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */ __webpack_require__.d(__webpack_exports__, {
 /* harmony export */   ConsolidateAdjacentCurvePrimitivesContext: () => (/* binding */ ConsolidateAdjacentCurvePrimitivesContext)
 /* harmony export */ });
+/* harmony import */ var _Geometry__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ../../Geometry */ "../../core/geometry/lib/esm/Geometry.js");
 /* harmony import */ var _geometry3d_GeometryHandler__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../../geometry3d/GeometryHandler */ "../../core/geometry/lib/esm/geometry3d/GeometryHandler.js");
-/* harmony import */ var _geometry3d_PolylineCompressionByEdgeOffset__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ../../geometry3d/PolylineCompressionByEdgeOffset */ "../../core/geometry/lib/esm/geometry3d/PolylineCompressionByEdgeOffset.js");
+/* harmony import */ var _geometry3d_PolylineCompressionByEdgeOffset__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ../../geometry3d/PolylineCompressionByEdgeOffset */ "../../core/geometry/lib/esm/geometry3d/PolylineCompressionByEdgeOffset.js");
 /* harmony import */ var _geometry3d_PolylineOps__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ../../geometry3d/PolylineOps */ "../../core/geometry/lib/esm/geometry3d/PolylineOps.js");
-/* harmony import */ var _Arc3d__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ../Arc3d */ "../../core/geometry/lib/esm/curve/Arc3d.js");
-/* harmony import */ var _CurveFactory__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! ../CurveFactory */ "../../core/geometry/lib/esm/curve/CurveFactory.js");
+/* harmony import */ var _Arc3d__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! ../Arc3d */ "../../core/geometry/lib/esm/curve/Arc3d.js");
+/* harmony import */ var _CurveFactory__WEBPACK_IMPORTED_MODULE_8__ = __webpack_require__(/*! ../CurveFactory */ "../../core/geometry/lib/esm/curve/CurveFactory.js");
 /* harmony import */ var _LineSegment3d__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ../LineSegment3d */ "../../core/geometry/lib/esm/curve/LineSegment3d.js");
 /* harmony import */ var _LineString3d__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ../LineString3d */ "../../core/geometry/lib/esm/curve/LineString3d.js");
 /* harmony import */ var _RegionOps__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../RegionOps */ "../../core/geometry/lib/esm/curve/RegionOps.js");
@@ -202938,6 +202954,7 @@ __webpack_require__.r(__webpack_exports__);
 
 
 
+
 /**
  * * Implementation class for ConsolidateAdjacentCurvePrimitives.
  *
@@ -202979,12 +202996,19 @@ class ConsolidateAdjacentCurvePrimitivesContext extends _geometry3d_GeometryHand
                         break;
                     }
                 }
-                if (points.length > 1) {
+                if (points.length <= 1) {
+                    g.children[numAccept++] = basePrimitive;
+                }
+                else if (this._options.disableLinearCompression) {
+                    const pointsDeduped = _geometry3d_PolylineOps__WEBPACK_IMPORTED_MODULE_4__.PolylineOps.compressShortEdges(points, _Geometry__WEBPACK_IMPORTED_MODULE_5__.Geometry.smallFloatingPoint); // remove only exact duplicate interior points
+                    g.children[numAccept++] = _LineString3d__WEBPACK_IMPORTED_MODULE_3__.LineString3d.createPoints(pointsDeduped);
+                }
+                else { // compress points
                     const compressedPointsA = _geometry3d_PolylineOps__WEBPACK_IMPORTED_MODULE_4__.PolylineOps.compressShortEdges(points, this._options.duplicatePointTolerance);
                     const compressedPointsB = _geometry3d_PolylineOps__WEBPACK_IMPORTED_MODULE_4__.PolylineOps.compressByPerpendicularDistance(compressedPointsA, this._options.colinearPointTolerance);
                     if (i0 === 0 && i1 === numOriginal) {
                         // points is the entire curve, and the curve is closed.   Maybe the first and last segments are colinear.
-                        _geometry3d_PolylineCompressionByEdgeOffset__WEBPACK_IMPORTED_MODULE_5__.PolylineCompressionContext.compressColinearWrapInPlace(compressedPointsB, this._options.duplicatePointTolerance, this._options.colinearPointTolerance);
+                        _geometry3d_PolylineCompressionByEdgeOffset__WEBPACK_IMPORTED_MODULE_6__.PolylineCompressionContext.compressColinearWrapInPlace(compressedPointsB, this._options.duplicatePointTolerance, this._options.colinearPointTolerance);
                     }
                     if (compressedPointsB.length < 2) {
                         // Collapsed to a point?  Make a single point linestring
@@ -202997,19 +203021,16 @@ class ConsolidateAdjacentCurvePrimitivesContext extends _geometry3d_GeometryHand
                         g.children[numAccept++] = _LineString3d__WEBPACK_IMPORTED_MODULE_3__.LineString3d.createPoints(compressedPointsB);
                     }
                 }
-                else {
-                    g.children[numAccept++] = basePrimitive;
-                }
                 i0 = i1;
             }
-            else if (this._options.consolidateCompatibleArcs && basePrimitive instanceof _Arc3d__WEBPACK_IMPORTED_MODULE_6__.Arc3d) {
+            else if (this._options.consolidateCompatibleArcs && basePrimitive instanceof _Arc3d__WEBPACK_IMPORTED_MODULE_7__.Arc3d) {
                 // subsume subsequent arcs into basePrimitive.
                 // always accept base primitive.
                 for (; ++i0 < g.children.length;) {
                     const nextPrimitive = g.children[i0];
-                    if (!(nextPrimitive instanceof _Arc3d__WEBPACK_IMPORTED_MODULE_6__.Arc3d))
+                    if (!(nextPrimitive instanceof _Arc3d__WEBPACK_IMPORTED_MODULE_7__.Arc3d))
                         break;
-                    if (!_CurveFactory__WEBPACK_IMPORTED_MODULE_7__.CurveFactory.appendToArcInPlace(basePrimitive, nextPrimitive))
+                    if (!_CurveFactory__WEBPACK_IMPORTED_MODULE_8__.CurveFactory.appendToArcInPlace(basePrimitive, nextPrimitive)) // TODO: use this._options.duplicatePointTolerance
                         break;
                 }
                 // i0 has already advanced
@@ -203512,13 +203533,18 @@ class MapCurvePrimitiveToCurveLocationDetailPairArray {
         if (primitiveB)
             this.insertPrimitiveToPair(primitiveB, pair);
     }
-    /** Split closed missing primitives in half and add new intersection pairs */
+    /**
+     * Split closed missing primitives in half and add new intersection pairs.
+     * * When bridge edges aren't included in the primitives array, a closed primitive with no intersections will not be
+     * added to the graph because it isn't in the `primitiveToPair` map. By splitting such a missing primitive in two, we
+     * introduce two intersections for each half, which allows the primitive to be represented in the map.
+     */
     splitAndAppendMissingClosedPrimitives(primitives, tolerance = _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.smallMetricDistance) {
         for (const p of primitives) {
             let closedCurveSplitCandidate = false;
             if (p instanceof _Arc3d__WEBPACK_IMPORTED_MODULE_1__.Arc3d)
                 closedCurveSplitCandidate = p.sweep.isFullCircle;
-            else if (!(p instanceof _LineSegment3d__WEBPACK_IMPORTED_MODULE_2__.LineSegment3d) && !(p instanceof _LineString3d__WEBPACK_IMPORTED_MODULE_3__.LineString3d))
+            else if (!(p instanceof _LineSegment3d__WEBPACK_IMPORTED_MODULE_2__.LineSegment3d) && !(p instanceof _LineString3d__WEBPACK_IMPORTED_MODULE_3__.LineString3d)) // TODO: probably should do this for all types. Lots of spline-type primitives can be closed.
                 closedCurveSplitCandidate = p.startPoint().isAlmostEqualXY(p.endPoint(), tolerance);
             if (closedCurveSplitCandidate && !this.primitiveToPair.has(p)) {
                 const p0 = p.clonePartialCurve(0.0, 0.5);
@@ -204637,13 +204663,14 @@ var RegionBinaryOpType;
 })(RegionBinaryOpType || (RegionBinaryOpType = {}));
 /**
  * Class `RegionOps` has static members for calculations on regions (areas).
- * * Regions are represented by these `CurveCollection` subclasses:
- *   * `Loop` -- a single loop
- *   * `ParityRegion` -- a collection of loops, interpreted by parity rules.
- * The common "One outer loop and many Inner loops" is a parity region.
- *   * `UnionRegion` -- a collection of `Loop` and `ParityRegion` objects understood as a (probably disjoint) union.
- * * **NOTE:** Most of the methods in this class ignore z-coordinates, so callers should ensure that input geometry has
- * been rotated parallel to the xy-plane.
+ * * Regions are represented by these [[CurveCollection]] subclasses:
+ *   * [[Loop]] -- a single loop
+ *   * [[ParityRegion]] -- a collection of loops, interpreted by parity rules.
+ * The common "One outer loop and many inner loops" is a parity region.
+ *   * [[UnionRegion]] -- a collection of `Loop` and `ParityRegion` objects understood as a (probably disjoint) union.
+ * * Most of the methods in this class:
+ *   * Ignore z-coordinates, so callers should ensure that input geometry has been rotated parallel to the xy-plane.
+ *   * Assume consistent Loop orientation: "solid" Loops are counterclockwise; "hole" Loops are clockwise.
  * @public
  */
 class RegionOps {
@@ -204674,8 +204701,15 @@ class RegionOps {
     }
     /**
      * Return a (signed) xy area for a region.
+  <<<<<<< HEAD
      * * The area is negative if and only if the region is oriented clockwise with respect to the positive z-axis.
      * @param root any Loop, ParityRegion, or UnionRegion.
+  =======
+     * * The input region should lie in a plane parallel to the xy-plane, as z-coords will be ignored.
+     * * For a non-self-intersecting Loop, the returned area is negative if and only if the Loop is oriented clockwise
+     * with respect to the positive z-axis.
+     * @param region any [[Loop]], [[ParityRegion]], or [[UnionRegion]].
+  >>>>>>> 168574b454 (Utilize `PolyfaceData.edgeMateIndex` to speed up some `Polyface` methods (#8095))
      */
     static computeXYArea(root) {
         const handler = new _RegionMomentsXY__WEBPACK_IMPORTED_MODULE_0__.RegionMomentsXY();
@@ -204817,10 +204851,11 @@ class RegionOps {
     }
     /**
      * Return areas defined by a boolean operation.
-     * * If there are multiple regions in loopsA, they are treated as a union.
-     * * If there are multiple regions in loopsB, they are treated as a union.
-     * @param loopsA first set of loops
-     * @param loopsB second set of loops
+     * @note For best results, input regions should have correctly oriented loops. See [[sortOuterAndHoleLoopsXY]].
+     * @note A common use case of this method is to convert a region with overlapping children into one with
+     * non-overlapping children: `regionOut = RegionOps.regionBooleanXY(regionIn, undefined, RegionBinaryOpType.Union)`.
+     * @param loopsA first set of loops (treated as a union)
+     * @param loopsB second set of loops (treated as a union)
      * @param operation indicates Union, Intersection, Parity, AMinusB, or BMinusA
      * @param mergeTolerance absolute distance tolerance for merging loops
      * @returns a region resulting from merging input loops and the boolean operation. May contain bridge edges added
@@ -205138,14 +205173,15 @@ class RegionOps {
         curves.dispatchToGeometryHandler(context);
     }
     /**
-     * Reverse and reorder loops in the xy-plane for consistency and containment.
-     * @param loops multiple loops in any order and orientation, z-coordinates ignored
+     * Reverse and reorder loops in the xy-plane for consistent orientation and containment.
+     * @param loops multiple loops in any order and orientation, z-coordinates ignored.
+     * * For best results, all overlaps should be containments, i.e., loop boundaries can touch, but should not cross.
      * @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.
+     * * [[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
+     * * [[UnionRegion]] if any other input configuration. Its children are individually ordered/oriented as in
      * the above cases.
      * @see [[PolygonOps.sortOuterAndHoleLoopsXY]]
      */
@@ -205165,14 +205201,14 @@ class RegionOps {
      * Find all xy-areas bounded by the unstructured, possibly intersecting curves.
      * * For best results, input curves should be parallel to the xy-plane, as z-coordinates are ignored.
      * * A common use case of this method is to assemble the bounding "exterior" loop (or loops) containing the
-     * input curves.
+     * input curves. Note that "holes" implied by inputs are _not_ preserved in output.
      * * This method does not add bridge edges to connect outer loops to inner loops. Each disconnected loop,
      * regardless of its containment, is returned as its own SignedLoops object. Pre-process with [[regionBooleanXY]]
      * to add bridge edges so that [[constructAllXYRegionLoops]] will return outer and inner loops in the same
      * SignedLoops object.
      * @param curvesAndRegions Any collection of curves. Each Loop/ParityRegion/UnionRegion contributes its curve
-     * primitives.
-     * @param tolerance optional distance tolerance for coincidence
+     * primitives, stripped of parity context. This means holes are _not_ preserved in output.
+     * @param tolerance optional distance tolerance for coincidence.
      * @returns array of [[SignedLoops]], each entry of which describes the faces in a single connected component:
      *    * `positiveAreaLoops` contains "interior" loops, _including holes in ParityRegion input_. These loops have
      * positive area and counterclockwise orientation.
@@ -205335,12 +205371,10 @@ class RegionOps {
     }
     /**
      * Facet the region according to stroke options.
+     * @note For best results, [[UnionRegion]] input should consist of non-overlapping children. See [[regionBooleanXY]].
+     * @note For best results, [[ParityRegion]] input should be correctly oriented. See [[sortOuterAndHoleLoopsXY]].
      * @param region a closed xy-planar region, possibly with holes.
      * * The z-coordinates of the region are ignored. Caller is responsible for rotating the region into plane local coordinates beforehand, and reversing the rotation afterwards.
-     * * For best results, `UnionRegion` input should consist of non-overlapping children.
-     * Caller can ensure this by passing in `region = RegionOps.regionBooleanXY(unionRegion, undefined, RegionBinaryOpType.Union)`.
-     * * For best results, `ParityRegion` input should be correctly oriented (holes have opposite orientation to their containing loop).
-     * Caller can ensure this for non-intersecting loops by passing in `region = RegionOps.sortOuterAndHoleLoopsXY(loops)`.
      * @param options primarily how to stroke the region boundary, but also how to facet the region interior.
      * * By default, a triangulation is returned, but if `options.maximizeConvexFacets === true`, edges between coplanar triangles are removed to return maximally convex facets.
      * @returns facets for the region, or undefined if facetting failed
@@ -205403,17 +205437,19 @@ function pushToInOnOutArrays(curve, select, arrayNegative, array0, arrayPositive
         array0.push(curve);
 }
 /**
- * * Options to control method `RegionOps.consolidateAdjacentPrimitives`
+ * * Options to control method `RegionOps.consolidateAdjacentPrimitives`.
  * @public
  */
 class ConsolidateAdjacentCurvePrimitivesOptions {
-    /** True to consolidate adjacent linear geometry into a single LineString3d */
+    /** True to consolidate adjacent linear geometry into a single LineString3d. */
     consolidateLinearGeometry = true;
-    /** True to consolidate contiguous compatible arcs into a single Arc3d */
+    /** True to consolidate contiguous compatible arcs into a single Arc3d. */
     consolidateCompatibleArcs = true;
-    /** Tolerance for collapsing identical points */
+    /** Disable LineSegment3d and LineString3d point compression. */
+    disableLinearCompression = false;
+    /** Tolerance for collapsing identical points (if `!disableLinearCompression`). */
     duplicatePointTolerance = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.smallMetricDistance;
-    /** Tolerance for removing interior colinear points. */
+    /** Tolerance for removing interior colinear points (if `!disableLinearCompression`). */
     colinearPointTolerance = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.smallMetricDistance;
 }
 
@@ -216039,17 +216075,20 @@ __webpack_require__.r(__webpack_exports__);
 /**
  * An `AngleSweep` is a pair of angles at start and end of an interval.
  *
- * *  For stroking purposes, the "included interval" is all angles numerically reached
- * by theta = start + f*(end-start), where f is between 0 and 1.
- * *  This stroking formula is simple numbers -- 2PI shifts are not involved.
- * *  2PI shifts do become important in the reverse mapping of an angle to a fraction.
- * *  If "start < end" the angle proceeds CCW around the unit circle.
- * *  If "end < start" the angle proceeds CW around the unit circle.
- * *  Angles beyond 360 are fine as endpoints.
- * *  (350,370) covers the same unit angles as (-10,10).
- * *  (370,350) covers the same unit angles as (10,-10).
- * *  math details related fraction API can be found at docs/learning/geometry/Angle.md
- *  * Visualization can be found at https://www.itwinjs.org/sandbox/SaeedTorabi/AngleSweep
+ * * For stroking purposes, the "included interval" is all angles numerically reached
+ * by `theta = start + f * (end - start)`, where `0 <= f <= 1`.
+ * * This stroking formula is simple numbers -- 2PI shifts are not involved.
+ * * 2PI shifts do become important in the reverse mapping of an angle to a fraction.
+ * * Angles greater than 360 and less than 0 are fine as endpoints.
+ * * An AngleSweep determines orientation only _in concert with a reference vector_, e.g., a plane normal like (0,0,1).
+ *   * Be careful reading orientation from an AngleSweep without a reference vector!
+ *   * If "start < end" the angles in the sweep proceed counterclockwise around the reference vector.
+ *   * If "start > end" the angles in the sweep proceed clockwise around the reference vector.
+ *   * (350,370) covers the same angles as (-10,10), and both sweeps are counterclockwise around the reference vector.
+ *   * (370,350) covers the same angles as (10,-10), and both sweeps are clockwise around the reference vector.
+ *   * (370,350) covers the same angles as (-10,10), but the sweeps have opposite orientation.
+ * * Math details can be found at docs/learning/geometry/Angle.md .
+ * * Visualization can be found at https://www.itwinjs.org/sandbox/SaeedTorabi/AngleSweep .
  * @public
  */
 class AngleSweep {
@@ -221675,8 +221714,12 @@ class GrowableXYZArray extends _IndexedXYZCollection__WEBPACK_IMPORTED_MODULE_0_
         }
     }
     /** get range of points. */
-    getRange(transform) {
-        const range = _Range__WEBPACK_IMPORTED_MODULE_5__.Range3d.createNull();
+    getRange(transform, result) {
+        let range = result;
+        if (range)
+            range.setNull();
+        else
+            range = _Range__WEBPACK_IMPORTED_MODULE_5__.Range3d.createNull();
         this.extendRange(range, transform);
         return range;
     }
@@ -222029,6 +222072,20 @@ class GrowableXYZArray extends _IndexedXYZCollection__WEBPACK_IMPORTED_MODULE_0_
             this._data[i + componentIndex] = q;
         }
     }
+    /**
+     * Pass the (x,y,z) of each point to a function which returns a replacement for the point.
+     * * @param func function to be called as `func(x,y,z)`, returning a replacement point.
+     */
+    mapPoint(func) {
+        const n = this._data.length;
+        let q;
+        for (let i = 0; i + 2 < n; i += 3) {
+            q = func(this._data[i], this._data[i + 1], this._data[i + 2]);
+            this._data[i] = q.x;
+            this._data[i + 1] = q.y;
+            this._data[i + 2] = q.z;
+        }
+    }
 }
 
 
@@ -222364,13 +222421,17 @@ class IndexedXYZCollection {
         return (i % this.length);
     }
     /** Return the range of the points. */
-    getRange() {
-        const range = _Range__WEBPACK_IMPORTED_MODULE_2__.Range3d.createNull();
+    getRange(transform, result) {
+        let range = result;
+        if (range)
+            range.setNull();
+        else
+            range = _Range__WEBPACK_IMPORTED_MODULE_2__.Range3d.createNull();
         const n = this.length;
         const point = _Point3dVector3d__WEBPACK_IMPORTED_MODULE_0__.Point3d.create();
         for (let i = 0; i < n; i++) {
             this.getPoint3dAtUncheckedPointIndex(i, point);
-            range.extendPoint(point);
+            range.extendPoint(point, transform);
         }
         return range;
     }
@@ -225845,7 +225906,12 @@ class Plane3d {
      * * Classes with a purely implicit equation of their plane can accept the default implementation
      */
     getAnyPointOnPlane(result) {
-        return this.projectPointToPlane(_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Point3d.create(0, 0, 0), result);
+        return this.projectXYZToPlane(0, 0, 0, result);
+    }
+    /** Return the projection of (x,y,z) onto the plane. */
+    projectXYZToPlane(x, y, z, result) {
+        const point = _Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Point3d.create(x, y, z, result);
+        return this.projectPointToPlane(point, point);
     }
 }
 
@@ -226190,7 +226256,12 @@ class Plane3dByOriginAndUnitNormal extends _Plane3d__WEBPACK_IMPORTED_MODULE_0__
     }
     /** Return the projection of spacePoint onto the plane. */
     projectPointToPlane(spacePoint, result) {
-        return spacePoint.plusScaled(this._normal, -this._normal.dotProductStartEnd(this._origin, spacePoint), result);
+        return this.projectXYZToPlane(spacePoint.x, spacePoint.y, spacePoint.z, result);
+    }
+    /** Return the projection of (x,y,z) onto the plane. */
+    projectXYZToPlane(x, y, z, result) {
+        const scale = -this._normal.dotProductStartEndXYZ(this._origin, x, y, z);
+        return _Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Point3d.create(x + scale * this._normal.x, y + scale * this._normal.y, z + scale * this._normal.z, result);
     }
     /**
      * Returns true if spacePoint is within distance tolerance of the plane.
@@ -226573,30 +226644,38 @@ class Plane3dByOriginAndVectors extends _Plane3d__WEBPACK_IMPORTED_MODULE_0__.Pl
     }
     /**
      * Return the projection of spacePoint onto the plane.
-     * If the plane is degenerate to a ray, project to the ray.
-     * If the plane is degenerate to its origin, return the point
+     * * If the plane is degenerate to a ray, project to the ray.
+     * * If the plane is degenerate to its origin, return the point.
      */
     projectPointToPlane(spacePoint, result) {
+        return this.projectXYZToPlane(spacePoint.x, spacePoint.y, spacePoint.z, result);
+    }
+    /**
+     * Return the projection of (x,y,z) onto the plane.
+     * * If the plane is degenerate to a ray, project to the ray.
+     * * If the plane is degenerate to its origin, return the point.
+     */
+    projectXYZToPlane(x, y, z, result) {
         const unitNormal = this.vectorU.unitCrossProduct(this.vectorV);
         if (unitNormal !== undefined) {
-            const w = unitNormal.dotProductStartEnd(this.origin, spacePoint);
-            return spacePoint.plusScaled(unitNormal, -w, result);
+            const scale = -unitNormal.dotProductStartEndXYZ(this.origin, x, y, z);
+            return _Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Point3d.create(x + scale * unitNormal.x, y + scale * unitNormal.y, z + scale * unitNormal.z, result);
         }
-        // uh oh.   vectorU and vectorV are colinear or zero.
-        // project to ray defined by the longer one, or just to origin.
+        // vectorU and vectorV are colinear or zero.
+        // Project to ray defined by the longer one, or just to origin.
         const dotUU = this.vectorU.magnitudeSquared();
         const dotVV = this.vectorV.magnitudeSquared();
         if (dotUU >= dotVV) {
-            const dotUW = this.vectorU.dotProductStartEnd(this.origin, spacePoint);
+            const dotUW = this.vectorU.dotProductStartEndXYZ(this.origin, x, y, z);
             const f = _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.conditionalDivideCoordinate(dotUW, dotUU, 0.0);
             if (f !== undefined)
-                return spacePoint.plusScaled(this.vectorU, f, result);
+                return _Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Point3d.create(x + f * this.vectorU.x, y + f * this.vectorU.y, z + f * this.vectorU.z, result);
         }
         else {
-            const dotVW = this.vectorV.dotProductStartEnd(this.origin, spacePoint);
+            const dotVW = this.vectorV.dotProductStartEndXYZ(this.origin, x, y, z);
             const f = _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.conditionalDivideCoordinate(dotVW, dotVV, 0.0);
             if (f !== undefined)
-                return spacePoint.plusScaled(this.vectorV, f, result);
+                return _Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Point3d.create(x + f * this.vectorV.x, y + f * this.vectorV.y, z + f * this.vectorV.z, result);
         }
         return this.origin.clone(result);
     }
@@ -229048,7 +229127,7 @@ class Vector3d extends XYZ {
     /**
      * Return the (strongly-typed) angle from this vector to vectorB, using only the xy parts.
      * * The returned angle is between -180 and 180 degrees.
-     * * Use `planarAngleTo` and `signedAngleTo` to return an angle measured in a specific plane.
+     * * Use [[planarAngleTo]] and [[signedAngleTo]] to return an angle measured in a specific plane.
      * @param vectorB target vector.
      */
     angleToXY(vectorB) {
@@ -229061,7 +229140,7 @@ class Vector3d extends XYZ {
      * * If the cross product of `this` vector and `vectorB` lies on the same side of the plane as `vectorW`,
      * this function returns `radiansTo(vectorB)`; otherwise, it returns `-radiansTo(vectorB)`.
      * * `vectorW` does not have to be perpendicular to the plane.
-     * * Use `planarRadiansTo` to measure the angle between vectors that are projected to another plane.
+     * * Use [[planarRadiansTo]] to measure the angle between vectors that are projected to another plane.
      * @param vectorB target vector.
      * @param vectorW determines the side of the plane in which the returned angle is measured
      */
@@ -229081,7 +229160,7 @@ class Vector3d extends XYZ {
      * * If the cross product of this vector and vectorB lies on the same side of the plane as vectorW,
      * this function returns `angleTo(vectorB)`; otherwise, it returns `-angleTo(vectorB)`.
      * * `vectorW` does not have to be perpendicular to the plane.
-     * * Use `planarAngleTo` to measure the angle between vectors that are projected to another plane.
+     * * Use [[planarAngleTo]] to measure the angle between vectors that are projected to another plane.
      * @param vectorB target vector.
      * @param vectorW determines the side of the plane in which the returned angle is measured
      */
@@ -229344,9 +229423,9 @@ class NumberArray {
         return a;
     }
     /**
-     * Return an array with indicated start and end points, maximum step size internally
-     * @param low low value
-     * @param high high value
+     * Return an array with indicated start and end points, and maximum step size.
+     * @param low first value in returned array
+     * @param high last value in returned array
      * @param step max permitted step
      */
     static createArrayWithMaxStepSize(low, high, step) {
@@ -229537,13 +229616,32 @@ class NumberArray {
  */
 class Point2dArray {
     /** Return true if arrays have same length and matching coordinates. */
-    static isAlmostEqual(dataA, dataB) {
+    static isAlmostEqual(dataA, dataB, tolerance = _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.smallMetricDistance) {
         if (dataA && dataB) {
-            if (dataA.length !== dataB.length)
-                return false;
-            for (let i = 0; i < dataA.length; i++) {
-                if (!dataA[i].isAlmostEqual(dataB[i]))
+            if (dataA instanceof Float64Array && dataB instanceof Float64Array) {
+                if (dataA.length !== dataB.length)
+                    return false;
+                for (let i = 0; i < dataA.length; i++)
+                    if (!_Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.isSameCoordinate(dataA[i], dataB[i], tolerance))
+                        return false;
+            }
+            else if (Array.isArray(dataA) && Array.isArray(dataB)) {
+                if (dataA.length !== dataB.length)
                     return false;
+                for (let i = 0; i < dataA.length; i++)
+                    if (!dataA[i].isAlmostEqual(dataB[i], tolerance))
+                        return false;
+            }
+            else { // different types
+                const points = dataA instanceof Float64Array ? dataB : dataA;
+                const numbers = dataA instanceof Float64Array ? dataA : dataB;
+                if (numbers.length !== points.length * 2)
+                    return false;
+                for (let iPoint = 0; iPoint < points.length; ++iPoint) {
+                    if (!_Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.isSameCoordinate(points[iPoint].x, numbers[2 * iPoint], tolerance) ||
+                        !_Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.isSameCoordinate(points[iPoint].y, numbers[2 * iPoint + 1], tolerance))
+                        return false;
+                }
             }
             return true;
         }
@@ -229580,13 +229678,34 @@ class Point2dArray {
  */
 class Vector3dArray {
     /** Return true if arrays have same length and matching coordinates. */
-    static isAlmostEqual(dataA, dataB) {
+    static isAlmostEqual(dataA, dataB, tolerance = _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.smallMetricDistance) {
         if (dataA && dataB) {
-            if (dataA.length !== dataB.length)
-                return false;
-            for (let i = 0; i < dataA.length; i++)
-                if (!dataA[i].isAlmostEqual(dataB[i]))
+            if (dataA instanceof Float64Array && dataB instanceof Float64Array) {
+                if (dataA.length !== dataB.length)
+                    return false;
+                for (let i = 0; i < dataA.length; i++)
+                    if (!_Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.isSameCoordinate(dataA[i], dataB[i], tolerance))
+                        return false;
+            }
+            else if (Array.isArray(dataA) && Array.isArray(dataB)) {
+                if (dataA.length !== dataB.length)
+                    return false;
+                for (let i = 0; i < dataA.length; i++)
+                    if (!dataA[i].isAlmostEqual(dataB[i], tolerance))
+                        return false;
+            }
+            else { // different types
+                const points = dataA instanceof Float64Array ? dataB : dataA;
+                const numbers = dataA instanceof Float64Array ? dataA : dataB;
+                if (numbers.length !== points.length * 3)
                     return false;
+                for (let iPoint = 0; iPoint < points.length; ++iPoint) {
+                    if (!_Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.isSameCoordinate(points[iPoint].x, numbers[3 * iPoint], tolerance) ||
+                        !_Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.isSameCoordinate(points[iPoint].y, numbers[3 * iPoint + 1], tolerance) ||
+                        !_Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.isSameCoordinate(points[iPoint].z, numbers[3 * iPoint + 2], tolerance))
+                        return false;
+                }
+            }
             return true;
         }
         return (dataA === undefined && dataB === undefined);
@@ -229705,20 +229824,20 @@ class Point4dArray {
         }
     }
     /** Test arrays for near equality of all corresponding numeric values, treated as coordinates. */
-    static isAlmostEqual(dataA, dataB) {
+    static isAlmostEqual(dataA, dataB, tolerance = _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.smallMetricDistance) {
         if (dataA && dataB) {
             if (dataA instanceof Float64Array && dataB instanceof Float64Array) {
                 if (dataA.length !== dataB.length)
                     return false;
                 for (let i = 0; i < dataA.length; i++)
-                    if (!_Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.isSameCoordinate(dataA[i], dataB[i]))
+                    if (!_Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.isSameCoordinate(dataA[i], dataB[i], tolerance))
                         return false;
             }
             else if (Array.isArray(dataA) && Array.isArray(dataB)) {
                 if (dataA.length !== dataB.length)
                     return false;
                 for (let i = 0; i < dataA.length; i++)
-                    if (!dataA[i].isAlmostEqual(dataB[i]))
+                    if (!dataA[i].isAlmostEqual(dataB[i], tolerance))
                         return false;
             }
             else { // different types
@@ -229727,10 +229846,10 @@ class Point4dArray {
                 if (numbers.length !== points.length * 4)
                     return false;
                 for (let iPoint = 0; iPoint < points.length; ++iPoint) {
-                    if (!_Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.isSameCoordinate(points[iPoint].x, numbers[4 * iPoint]) ||
-                        !_Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.isSameCoordinate(points[iPoint].y, numbers[4 * iPoint + 1]) ||
-                        !_Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.isSameCoordinate(points[iPoint].z, numbers[4 * iPoint + 2]) ||
-                        !_Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.isSameCoordinate(points[iPoint].w, numbers[4 * iPoint + 3]))
+                    if (!_Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.isSameCoordinate(points[iPoint].x, numbers[4 * iPoint], tolerance) ||
+                        !_Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.isSameCoordinate(points[iPoint].y, numbers[4 * iPoint + 1], tolerance) ||
+                        !_Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.isSameCoordinate(points[iPoint].z, numbers[4 * iPoint + 2], tolerance) ||
+                        !_Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.isSameCoordinate(points[iPoint].w, numbers[4 * iPoint + 3], tolerance))
                         return false;
                 }
             }
@@ -229970,20 +230089,20 @@ class Point3dArray {
         }
     }
     /** Test arrays for near equality of all corresponding numeric values, treated as coordinates. */
-    static isAlmostEqual(dataA, dataB) {
+    static isAlmostEqual(dataA, dataB, tolerance = _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.smallMetricDistance) {
         if (dataA && dataB) {
             if (dataA instanceof Float64Array && dataB instanceof Float64Array) {
                 if (dataA.length !== dataB.length)
                     return false;
                 for (let i = 0; i < dataA.length; i++)
-                    if (!_Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.isSameCoordinate(dataA[i], dataB[i]))
+                    if (!_Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.isSameCoordinate(dataA[i], dataB[i], tolerance))
                         return false;
             }
             else if (Array.isArray(dataA) && Array.isArray(dataB)) {
                 if (dataA.length !== dataB.length)
                     return false;
                 for (let i = 0; i < dataA.length; i++)
-                    if (!dataA[i].isAlmostEqual(dataB[i]))
+                    if (!dataA[i].isAlmostEqual(dataB[i], tolerance))
                         return false;
             }
             else { // different types
@@ -229992,9 +230111,9 @@ class Point3dArray {
                 if (numbers.length !== points.length * 3)
                     return false;
                 for (let iPoint = 0; iPoint < points.length; ++iPoint) {
-                    if (!_Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.isSameCoordinate(points[iPoint].x, numbers[3 * iPoint]) ||
-                        !_Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.isSameCoordinate(points[iPoint].y, numbers[3 * iPoint + 1]) ||
-                        !_Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.isSameCoordinate(points[iPoint].z, numbers[3 * iPoint + 2]))
+                    if (!_Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.isSameCoordinate(points[iPoint].x, numbers[3 * iPoint], tolerance) ||
+                        !_Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.isSameCoordinate(points[iPoint].y, numbers[3 * iPoint + 1], tolerance) ||
+                        !_Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.isSameCoordinate(points[iPoint].z, numbers[3 * iPoint + 2], tolerance))
                         return false;
                 }
             }
@@ -231292,6 +231411,41 @@ class PolygonOps {
             }
         }
     }
+    /**
+     * Compute the signed volume of the truncated prism between a facet and a plane.
+     * * Useful for parallel algorithms.
+     * @param facetPoints input 3D polygon; on return the points are projected onto the plane. Wraparound point is optional.
+     * @param plane infinite plane bounding volume between the facet and (virtual) side facets perpendicular to the plane (unmodified).
+     * @param options optional flags and pre-allocated temporary storage.
+     * @returns computed data for this facet:
+     * * `volume6`: six times the signed volume of the truncated prism between the facet and the plane.
+     * * `area2`: two times the signed area of the facet's projection onto the plane.
+     * * `origin`: origin of the facet used to accumulate area moments.
+     * * `products`: raw accumulated second moment area products of the facet's projection onto the plane.
+     * @see [[PolyfaceQuery.sumVolumeBetweenFacetsAndPlane]]
+     */
+    static volumeBetweenPolygonAndPlane(facetPoints, plane, options) {
+        let origin;
+        let products;
+        let singleProjectedFacetAreaTimes2 = 0.0;
+        let signedTruncatedPrismVolumeTimes6 = 0.0;
+        const h0 = facetPoints.evaluateUncheckedIndexPlaneAltitude(0, plane);
+        for (let i = 1; i + 1 < facetPoints.length; i++) {
+            const triangleNormal = facetPoints.crossProductIndexIndexIndex(0, i, i + 1, options?.workVector);
+            const hA = facetPoints.evaluateUncheckedIndexPlaneAltitude(i, plane);
+            const hB = facetPoints.evaluateUncheckedIndexPlaneAltitude(i + 1, plane);
+            const signedProjectedTriangleAreaTimes2 = triangleNormal.dotProductXYZ(plane.normalX(), plane.normalY(), plane.normalZ());
+            singleProjectedFacetAreaTimes2 += signedProjectedTriangleAreaTimes2;
+            signedTruncatedPrismVolumeTimes6 += signedProjectedTriangleAreaTimes2 * (h0 + hA + hB);
+        }
+        if (!options?.skipMoments) {
+            origin = facetPoints.getPoint3dAtUncheckedPointIndex(0, options?.workPoint0);
+            products = _geometry4d_Matrix4d__WEBPACK_IMPORTED_MODULE_4__.Matrix4d.createZero(options?.workMatrix);
+            facetPoints.mapPoint((x, y, z) => plane.projectXYZToPlane(x, y, z, options?.workPoint1));
+            PolygonOps.addSecondMomentAreaProducts(facetPoints, origin, products);
+        }
+        return { volume6: signedTruncatedPrismVolumeTimes6, area2: singleProjectedFacetAreaTimes2, origin, products };
+    }
     /** Test the direction of turn at the vertices of the polygon, ignoring z-coordinates.
      * * For a polygon without self-intersections and successive colinear edges, this is a convexity and orientation test: all positive is convex and counterclockwise, all negative is convex and clockwise.
      * * Beware that a polygon which turns through more than a full turn can cross itself and close, but is not convex.
@@ -231445,8 +231599,9 @@ class PolygonOps {
         return numReverse;
     }
     /**
-     * Reverse and reorder loops in the xy-plane for consistency and containment.
-     * @param loops multiple polygons in any order and orientation, z-coordinates ignored
+     * Reverse and reorder loops in the xy-plane for consistent orientation and containment.
+     * @param loops multiple polygons in any order and orientation, z-coordinates ignored.
+     * * For best results, all overlaps should be containments, i.e., loop boundaries can touch, but should not cross.
      * @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.
@@ -232489,17 +232644,21 @@ class PolylineCompressionContext {
         context.acceptPointByIndex(indexA);
         context.recursiveCompressByChordErrorGo(indexA, indexB);
     }
-    /** Copy points from source to dest, omitting those too close to predecessor.
-     * * First and last points are always preserved.
+    /**
+     * Return a simplified subset of given points, omitting a point if very close to its predecessor.
+     * * This is a local search, with a single pass over the data.
+     * * First and last points are always retained.
+     * @param data input points
+     * @param maxEdgeLength length of largest edge to be compressed out
      */
-    static compressInPlaceByShortEdgeLength(data, edgeLength) {
+    static compressInPlaceByShortEdgeLength(data, maxEdgeLength) {
         const n = data.length;
         if (n < 2)
             return;
         let lastAcceptedIndex = 0;
         // back up from final point ..
         let indexB = n - 1;
-        while (indexB > 0 && data.distanceIndexIndex(indexB - 1, n - 1) < edgeLength)
+        while (indexB > 0 && data.distanceIndexIndex(indexB - 1, n - 1) <= maxEdgeLength)
             indexB--;
         if (indexB === 0) {
             // Theres only one point there.
@@ -232512,7 +232671,7 @@ class PolylineCompressionContext {
         let candidateIndex = lastAcceptedIndex + 1;
         while (candidateIndex <= indexB) {
             const d = data.distanceIndexIndex(lastAcceptedIndex, candidateIndex);
-            if (d >= edgeLength) {
+            if (d > maxEdgeLength) {
                 data.moveIndexToIndex(candidateIndex, lastAcceptedIndex + 1);
                 lastAcceptedIndex++;
             }
@@ -232520,10 +232679,13 @@ class PolylineCompressionContext {
         }
         data.length = lastAcceptedIndex + 1;
     }
-    /** Copy points from source to dest, omitting those too close to predecessor.
-     * * First and last points are always preserved.
+    /**
+     * Return a simplified subset of given points, omitting the middle of three successive points if the triangle they form is small.
+     * * This is a local search, with a single pass over the data.
+     * @param data input points
+     * @param maxTriangleArea area of largest triangle to compress
      */
-    static compressInPlaceBySmallTriangleArea(data, triangleArea) {
+    static compressInPlaceBySmallTriangleArea(data, maxTriangleArea) {
         const n = data.length;
         if (n < 3)
             return;
@@ -232531,7 +232693,7 @@ class PolylineCompressionContext {
         const cross = _Point3dVector3d__WEBPACK_IMPORTED_MODULE_0__.Vector3d.create();
         for (let i1 = 1; i1 + 1 < n; i1++) {
             data.crossProductIndexIndexIndex(lastAcceptedIndex, i1, i1 + 1, cross);
-            if (0.5 * cross.magnitude() > triangleArea) {
+            if (0.5 * cross.magnitude() > maxTriangleArea) {
                 data.moveIndexToIndex(i1, ++lastAcceptedIndex);
             }
         }
@@ -232672,10 +232834,11 @@ class PolylineOps {
         return _PolylineCompressionByEdgeOffset__WEBPACK_IMPORTED_MODULE_1__.PolylineCompressionContext.compressPoint3dArrayByChordError(source, chordTolerance);
     }
     /**
-     * Return a simplified subset of given points, omitting points if very close to their neighbors.
+     * Return a simplified subset of given points, omitting a point if very close to its predecessor.
      * * This is a local search, with a single pass over the data.
+     * * First and last points are always retained.
      * @param source input points
-     * @param maxEdgeLength
+     * @param maxEdgeLength length of largest edge to be compressed out
      * @see [[GrowableXYZArray.cloneCompressed]]
      */
     static compressShortEdges(source, maxEdgeLength) {
@@ -232684,10 +232847,10 @@ class PolylineOps {
         return dest.getPoint3dArray();
     }
     /**
-     * Return a simplified subset of given points, omitting points of the triangle with adjacent points is small.
+     * Return a simplified subset of given points, omitting the middle of three successive points if the triangle they form is small.
      * * This is a local search, with a single pass over the data.
      * @param source input points
-     * @param maxEdgeLength
+     * @param maxTriangleArea area of largest triangle to compress
      */
     static compressSmallTriangles(source, maxTriangleArea) {
         const dest = _GrowableXYZArray__WEBPACK_IMPORTED_MODULE_2__.GrowableXYZArray.create(source);
@@ -235186,41 +235349,29 @@ class Ray3d {
     */
     intersectionWithTriangle(vertex0, vertex1, vertex2, distanceTol, parameterTol, result) {
         /**
-         * Suppose ray is shown by "rayOrigin + t*rayVector" and barycentric coordinate of point
+         * Let (w,u,v) be the barycentric coordinates of point P wrt the triangle (v0,v1,v2), such that
          * P = w*v0 + u*v1 + v*v2 = (1-u-v)*v0 + u*v1 + v*v2 = v0 + u*(v1-v0) + v*(v2-v0)
          *
-         * Then if ray intersects triangle at a point we have
+         * Then if the ray given by rayOrigin + t*rayVector intersects the triangle at P, we have
          * v0 + u*(v1-v0) + v*(v2-v0) = rayOrigin + t*rayVector
-         * or
-         * -t*rayVector + u*(v1-v0) + v*(v2-v0) = rayOrigin - v0
          *
          * This equation can be reformulated as the following linear system:
          *
          * [    |          |      |  ] [t]   [      |       ]
          * [-rayVector  v1-v0   v2-v0] [u] = [rayOrigin - v0]
-         * [   |          |      |   ] [v]   [      |       ]
-         *
-         * Then to find t, u, and v use Cramer's Rule and also the fact that if matrix A = [c1,c2,c3], then
-         * det(A) = c1.(c2 x c3) which leads to
-         *
-         * t = [(rayOrigin - v0).((v1-v0) x (v2-v0))] / [-rayVector.((v1-v0) x (v2-v0))]
-         * u = [-rayVector.((rayOrigin - v0) x (v2-v0))] / [-rayVector.((v1-v0) x (v2-v0))]
-         * v = [-rayVector.((v1-v0) x (rayOrigin - v0))] / [-rayVector.((v1-v0) x (v2-v0))]
+         * [    |          |      |  ] [v]   [      |       ]
          *
-         * Now note that swapping any 2 vectors c_i and c_j in formula c1.(c2 x c3) negates it. For example:
-         * c1.(c2 x c3) = -c3.(c2 x c1) = c2.(c3 x c1)
+         * Then to find t, u, and v, use Cramer's Rule, the formulation of matrix determinant as column triple product,
+         * and the fact that swapping any 2 vectors in the triple product negates it:
          *
-         * This leads to the final formulas used in the following code:
-         * t = [(v2-v0).((rayOrigin - v0) x (v1-v0))] / [(v1-v0).(rayVector x (v2-v0))]
-         * u = [(rayOrigin - v0).(rayVector x (v2-v0))] / [(v1-v0).(rayVector x (v2-v0))]
-         * v = [-rayVector.((rayOrigin - v0) x (v1-v0))] / [(v1-v0).(rayVector x (v2-v0))]
+         * t = (v2-v0).(rayOrigin - v0) x (v1-v0) / (v1-v0).rayVector x (v2-v0)
+         * u = (rayOrigin - v0).rayVector x (v2-v0) / (v1-v0).rayVector x (v2-v0)
+         * v = -rayVector.(rayOrigin - v0) x (v1-v0) / (v1-v0).rayVector x (v2-v0)
          *
-         * Note that we should verify 0 <= u,v,w <= 1. To do so we only need to check 0 <= u <= 1, 0 <= v, and u+v <= 1.
-         * That's because w = 1-(u+v) and if we have those 4 checks, it's guaranteed that v <= 1 and 0 <= u+v and so
-         * 0 <= w <= 1.
+         * Note that we verify 0 <= u,v,w <= 1. To do so we only need to check 0 <= u <= 1, 0 <= v, and u+v <= 1:
+         * these 4 checks guarantee that v <= 1 and 0 <= u+v, and so with w = 1-(u+v), we have 0 <= w <= 1.
          *
-         * More info be found at
-         * https://en.wikipedia.org/wiki/M%C3%B6ller%E2%80%93Trumbore_intersection_algorithm
+         * More info be found at https://en.wikipedia.org/wiki/Moller-Trumbore_intersection_algorithm.
          */
         if (distanceTol === undefined || distanceTol < 0) // we explicitly allow zero tolerance
             distanceTol = _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.smallMetricDistance;
@@ -236263,27 +236414,46 @@ class Transform {
         return result;
     }
     /**
-     * Create a Transform such that its `matrix` part is rigid.
-     * @see [[Matrix3d.createRigidFromColumns]] for details of how the matrix is created to be rigid.
+     * Create a Transform with given origin and a rigid matrix constructed from two column vectors.
+     * @param origin origin of the local coordinate system. Default is the global origin (zero).
+     * @param vectorX first axis passed into `Matrix3d.createRigidFromColumns`.
+     * @param vectorY second axis passed into `Matrix3d.createRigidFromColumns`.
+     * @param axisOrder order of axis construction in `Matrix3d.createRigidFromColumns(vectorX, vectorY, axisOrder)`.
+     * @param result optional pre-allocated result to populate and return.
+     * @returns localToWorld transform for a local coordinate system with given origin and ordered axes, or `undefined`
+     * if the rigid matrix could not be created.
+     * @see [[Matrix3d.createRigidFromColumns]]
      */
     static createRigidFromOriginAndColumns(origin, vectorX, vectorY, axisOrder, result) {
-        const matrix = _Matrix3d__WEBPACK_IMPORTED_MODULE_2__.Matrix3d.createRigidFromColumns(vectorX, vectorY, axisOrder, result ? result._matrix : undefined);
+        const matrix = _Matrix3d__WEBPACK_IMPORTED_MODULE_2__.Matrix3d.createRigidFromColumns(vectorX, vectorY, axisOrder, result?._matrix);
         if (!matrix)
             return undefined;
         if (result) {
-            // result._matrix was already modified to become rigid via createRigidFromColumns
             result._origin.setFrom(origin);
             return result;
         }
-        /**
-         * We don't want to pass "origin" to createRefs because createRefs does not clone "origin". That means if "origin"
-         * is changed via Transform at any point, the initial "origin" passed by the user is also changed. To avoid that,
-         * we pass "undefined" to createRefs so that it allocates a new point which then we set it to the "origin" which
-         * is passed by user in the next line.
-         */
-        result = Transform.createRefs(undefined, matrix);
-        result._origin.setFromPoint3d(origin);
-        return result;
+        return Transform.createRefs(origin?.cloneAsPoint3d(), matrix);
+    }
+    /**
+     * Create a Transform with given origin and a rigid matrix constructed from one column vector.
+     * @param origin origin of the local coordinate system. Default is the global origin (zero).
+     * @param vector direction of the axis of the local coordinate system indicated by the first letter of `axisOrder`.
+     * @param axisOrder order of axis construction in `Matrix3d.createRigidHeadsUp(vector, axisOrder)`. Default value
+     * is `AxisOrder.ZXY`, which means the z-column of the returned Transform is in the direction of `vector`.
+     * @param result optional pre-allocated result to populate and return.
+     * @returns localToWorld transform for a local coordinate system with given origin and axis, or `undefined`
+     * if the rigid matrix could not be created.
+     * @see [[Matrix3d.createRigidHeadsUp]]
+     */
+    static createRigidFromOriginAndVector(origin, vector, axisOrder = _Geometry__WEBPACK_IMPORTED_MODULE_0__.AxisOrder.ZXY, result) {
+        const matrix = _Matrix3d__WEBPACK_IMPORTED_MODULE_2__.Matrix3d.createRigidHeadsUp(vector, axisOrder, result?._matrix);
+        if (!matrix)
+            return undefined;
+        if (result) {
+            result._origin.setFrom(origin);
+            return result;
+        }
+        return Transform.createRefs(origin?.cloneAsPoint3d(), matrix);
     }
     /**
      * Create a Transform with the specified `matrix`. Compute an `origin` (different from the given `fixedPoint`)
@@ -238840,11 +239010,11 @@ class Point4d extends _geometry3d_Plane3d__WEBPACK_IMPORTED_MODULE_0__.Plane3d {
         return result;
     }
     /** Near-equality test, using `Geometry.isSameCoordinate` on all 4 x,y,z,w */
-    isAlmostEqual(other) {
-        return _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.isSameCoordinate(this.x, other.x)
-            && _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.isSameCoordinate(this.y, other.y)
-            && _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.isSameCoordinate(this.z, other.z)
-            && _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.isSameCoordinate(this.w, other.w);
+    isAlmostEqual(other, tolerance = _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.smallMetricDistance) {
+        return _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.isSameCoordinate(this.x, other.x, tolerance)
+            && _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.isSameCoordinate(this.y, other.y, tolerance)
+            && _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.isSameCoordinate(this.z, other.z, tolerance)
+            && _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.isSameCoordinate(this.w, other.w, tolerance);
     }
     /**
      * Test for same coordinate by direct x,y,z,w args
@@ -238853,11 +239023,11 @@ class Point4d extends _geometry3d_Plane3d__WEBPACK_IMPORTED_MODULE_0__.Plane3d {
      * @param z z to test
      * @param w w to test
      */
-    isAlmostEqualXYZW(x, y, z, w) {
-        return _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.isSameCoordinate(this.x, x)
-            && _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.isSameCoordinate(this.y, y)
-            && _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.isSameCoordinate(this.z, z)
-            && _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.isSameCoordinate(this.w, w);
+    isAlmostEqualXYZW(x, y, z, w, tolerance = _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.smallMetricDistance) {
+        return _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.isSameCoordinate(this.x, x, tolerance)
+            && _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.isSameCoordinate(this.y, y, tolerance)
+            && _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.isSameCoordinate(this.z, z, tolerance)
+            && _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.isSameCoordinate(this.w, w, tolerance);
     }
     /**
      * Convert an Angle to a JSON object.
@@ -239092,13 +239262,17 @@ class Point4d extends _geometry3d_Plane3d__WEBPACK_IMPORTED_MODULE_0__.Plane3d {
      * * If the xyz part of `this` are all zero, (a clone of) `spacePoint` is returned.
      */
     projectPointToPlane(spacePoint, result) {
-        const h = this.altitude(spacePoint);
+        return this.projectXYZToPlane(spacePoint.x, spacePoint.y, spacePoint.z, result);
+    }
+    /** Return the projection of (x,y,z) onto the plane. */
+    projectXYZToPlane(x, y, z, result) {
+        const h = this.altitudeXYZ(x, y, z);
         const nn = this.magnitudeSquaredXYZ();
         // this unusual tol is needed so that toPlane3dByOriginAndUnitNormal agrees with its original implementation
         const alpha = _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.conditionalDivideCoordinate(-h, nn, _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.largeFractionResult * _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.largeFractionResult);
         if (alpha === undefined)
-            return spacePoint.clone(result);
-        return spacePoint.plusXYZ(alpha * this.x, alpha * this.y, alpha * this.z, result);
+            return _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Point3d.create(x, y, z, result);
+        return _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Point3d.create(x + alpha * this.x, y + alpha * this.y, z + alpha * this.z, result);
     }
     /** scale all components (including w!!) */
     scale(scale, result) {
@@ -246348,7 +246522,7 @@ class FacetOrientationFixup {
         return this._facetOrientation[facetIndex];
     }
     /**
-     * RETURN FALSE IF ANY EDGE HAS 3 ORE MORE FACETS
+     * RETURN FALSE IF ANY EDGE HAS 3 OR MORE FACETS
      */
     setupUnoriented() {
         this._edges.sort();
@@ -246806,97 +246980,107 @@ __webpack_require__.r(__webpack_exports__);
  * @module Polyface
  */
 /**
- * * For boundary sorting, an edge is a (packed!) Float64Array.
- * * Fixed entry positions are:
- *   * [0] is start vertex index (in CCW order around its facet)
- *   * [1] is end vertex index (in CCW order around its facet)
- *   * [2] is facet index (or another number to associate with this edge).
+ * Represent an [[IndexedPolyface]] edge as:
+ * * vertex start index and vertex end index (CCW order around its facet)
+ * * an additional number to associate with the edge (e.g., facet index)
+ * @public
  */
-class SortableEdge extends Float64Array {
+class SortableEdge {
+    _v;
+    _a;
+    /** Constructor. */
+    constructor(startVertex, endVertex, facetIndex) {
+        this._v = [startVertex, endVertex];
+        this._a = facetIndex;
+    }
+    /** Clone the edge. */
+    clone() {
+        return new SortableEdge(this._v[0], this._v[1], this._a);
+    }
     /** Return the vertex index that appears first in the order stored.  */
-    get vertexIndexA() {
-        return this[0];
+    get startVertex() {
+        return this._v[0];
     }
     /** Return the vertex index that appears second in the order stored.  */
-    get vertexIndexB() {
-        return this[1];
+    get endVertex() {
+        return this._v[1];
     }
     /**
      * Return the facet index.
      * * This value is carried along during matching. Typically it is a facet index, but it does not have to be.
      */
     get facetIndex() {
-        return this[2];
+        return this._a;
     }
-    /** return true if vertexIndexA is less than vertexIndexB. */
+    /** return true if `startVertex` is less than `endVertex`. */
     get isLowHigh() {
-        return this[0] < this[1];
+        return this._v[0] < this._v[1];
     }
     /** Return the vertex index with lower numeric value. */
-    get lowVertexIndex() {
-        return this[0] < this[1] ? this[0] : this[1];
+    get lowVertex() {
+        return this.isLowHigh ? this._v[0] : this._v[1];
     }
     /** Return the vertex index with higher numeric value. */
-    get highVertexIndex() {
-        return this[0] > this[1] ? this[0] : this[1];
+    get highVertex() {
+        return this.isLowHigh ? this._v[1] : this._v[0];
     }
-    /** Return true if the vertices edgeA and edgeB are the same vertex indices in opposite order. */
+    /** Return true if edgeA and edgeB traverse the same edge in the same direction. */
+    static areSameEdge(edgeA, edgeB) {
+        return edgeA._v[0] === edgeB._v[0] && edgeA._v[1] === edgeB._v[1];
+    }
+    /** Return true if edgeA and edgeB traverse the same edge in opposite directions. */
     static areDirectedPartners(edgeA, edgeB) {
-        return edgeA[0] === edgeB[1] && edgeA[1] === edgeB[0];
+        return edgeA._v[0] === edgeB._v[1] && edgeA._v[1] === edgeB._v[0];
     }
-    /** Return true if the vertices edgeA and edgeB are the same vertex indices with no consideration of order. */
+    /** Return true if edgeA and edgeB traverse the same edge in the same or opposite directions. */
     static areUndirectedPartners(edgeA, edgeB) {
-        return (edgeA[0] === edgeB[0] && edgeA[1] === edgeB[1]) || ((edgeA[0] === edgeB[1] && edgeA[1] === edgeB[0]));
+        return this.areSameEdge(edgeA, edgeB) || this.areDirectedPartners(edgeA, edgeB);
     }
     /**
-     * Return numeric relationship of edgeA and edgeB:
-     * * 1 if they share start and end in the same order.
-     * * -1 if they share start and end in reversed order.
+     * Return numeric identifier for the relationship between edgeA and edgeB:
+     * * 1 if they share start and end vertex indices in the same order.
+     * * -1 if they share start and end vertex indices in reversed order.
      * * 0 otherwise.
      */
     static relativeOrientation(edgeA, edgeB) {
-        if (edgeA[0] === edgeB[0] && edgeA[1] === edgeB[1])
+        if (this.areSameEdge(edgeA, edgeB))
             return 1;
-        if (edgeA[0] === edgeB[1] && edgeA[1] === edgeB[0])
+        if (this.areDirectedPartners(edgeA, edgeB))
             return -1;
         return 0;
     }
+    /** Whether the start and end vertex indices are equal. */
     get isNullEdge() {
-        return this[0] === this[1];
+        return this._v[0] === this._v[1];
     }
     /**
      * Lexical comparison of two edges.
-     * * If the edges have the same vertex pair (in same or opposite order) they will end up adjacent in a sort.
-     * * If the edges have 0 or 1 shared vertex indices, the one with lowest low comes first.
+     * * If the edges have the same vertex index pair (in same or opposite order) they will end up adjacent in a sort.
      * @param edgeA first edge
      * @param edgeB second edge
      */
     static lessThan(edgeA, edgeB) {
         // primary compare is based on indirect indices
-        const lowA = edgeA.lowVertexIndex;
-        const lowB = edgeB.lowVertexIndex;
+        const lowA = edgeA.lowVertex;
+        const lowB = edgeB.lowVertex;
         if (lowA < lowB)
             return -1;
         if (lowB < lowA)
             return 1;
-        const highA = edgeA.highVertexIndex;
-        const highB = edgeB.highVertexIndex;
+        const highA = edgeA.highVertex;
+        const highB = edgeB.highVertex;
         if (highA < highB)
             return -1;
         if (highB < highA)
             return 1;
         // undirected indices match ... use directed vertexIndexA
-        return edgeA.vertexIndexA - edgeB.vertexIndexA;
-    }
-    constructor(vertexA, vertexB, facetIndex) {
-        super(3);
-        this[0] = vertexA;
-        this[1] = vertexB;
-        this[2] = facetIndex;
+        return edgeA.startVertex - edgeB.startVertex;
     }
+    /** Return the edge data as a JSON array. */
     toJSON() {
-        return [this[0], this[1], this[2]];
+        return [this._v[0], this._v[1], this._a];
     }
+    /** Return the edge cluster in JSON format.  */
     static clusterToJSON(data) {
         if (data instanceof SortableEdge)
             return data.toJSON();
@@ -246904,6 +247088,7 @@ class SortableEdge extends Float64Array {
         for (const edge of data)
             result.push(edge.toJSON());
     }
+    /** Return the edge cluster array in JSON format. */
     static clusterArrayToJSON(data) {
         const result = [];
         for (const cluster of data)
@@ -246912,11 +247097,14 @@ class SortableEdge extends Float64Array {
     }
 }
 /**
- * An IndexedEdgeMatcher carries an array of edge start & end indices for sorting and subsequent analyses
- * (such as testing for closed mesh).
+ * An IndexedEdgeMatcher carries an array of edge start and end indices for sorting and subsequent analyses,
+ * such as testing for closed mesh.
+ * @public
  */
 class IndexedEdgeMatcher {
+    /** The array of edges to be sorted. */
     edges;
+    /** Constructor. Call [[addEdge]] or [[addPath]] to populate `edges`. */
     constructor() {
         this.edges = [];
     }
@@ -246933,22 +247121,22 @@ class IndexedEdgeMatcher {
         return edge;
     }
     /**
-     * Push edges all around a facet, returning to vertexArray[0].
-     * @param vertexArray array of vertex indices around facet
-     * @param facetIndex value to carry along during matching
+     * Push edges along a path.
+     * * Typically used to add edges around a facet.
+     * @param vertexIndices array of vertex indices along an open or closed path.
+     * @param facetIndex value to set on each edge pushed.
      * @param closeLoop true to add an edge from last to first vertex.
      */
-    addPath(vertexArray, facetIndex, closeLoop = true) {
-        if (vertexArray.length === 0)
+    addPath(vertexIndices, facetIndex, closeLoop) {
+        if (vertexIndices.length === 0)
             return;
-        const m = vertexArray.length - 1;
-        for (let i = 0; i < m; i++) {
-            this.addEdge(vertexArray[i], vertexArray[i + 1], facetIndex);
-        }
+        const m = vertexIndices.length - 1;
+        for (let i = 0; i < m; i++)
+            this.addEdge(vertexIndices[i], vertexIndices[i + 1], facetIndex);
         if (closeLoop)
-            this.addEdge(vertexArray[m], vertexArray[0], facetIndex);
+            this.addEdge(vertexIndices[m], vertexIndices[0], facetIndex);
     }
-    /** Sort the edge index array. */
+    /** Sort the edges. */
     sort() {
         this.edges.sort((edgeA, edgeB) => SortableEdge.lessThan(edgeA, edgeB));
     }
@@ -246967,20 +247155,18 @@ class IndexedEdgeMatcher {
         }
     }
     /**
-     * Sort the edges, and look for three categories of paired edges:
-     * * caller must allocate all result arrays of interest.
-     * * Any combination of the result arrays may be `undefined`, indicating that category is to be ignored.
-     * * Any combination of the result arrays may be aliased as the same target, in which case those to categories are
+     * Sort the edges, and collect up to four categories of edges: manifold pairs, singletons, null edges,
+     * and everything else.
+     * * Caller should allocate arrays of interest.
+     * * Any combination of the arrays may be `undefined`, indicating that category is to be ignored.
+     * * Any combination of the arrays may be aliased as the same target, in which case the aliased categories are
      * merged into the target.
-     * * For instance, to ignore manifold pairs and collect all others (singleton, null, and other) as a single array
-     * `allOther`, create `const allOther = []` as an empty array and call
-     * `sortAndCollectClusters (undefined, allOther, allOther, allOther);`
-     * @param manifoldPairs optional array to receive pairs of properly mated SortableEdgePairs, i.e. simple interior
-     * edges adjacent to two facets in opposing directions.
-     * @param singletons optional array to receive edges that are simple boundary edges.
-     * @param nullEdges optional array to receive arrays of null edges (same start and end vertex)
-     * @param allOtherClusters optional array to receive arrays in which all the edges are partners in an undirected sense
-     * but not a simple directed pair.
+     * * For instance, to ignore manifold pairs and collect all other edges in a single array:
+     * `const foo = []; matcher.sortAndCollectClusters(undefined, foo, foo, foo);`
+     * @param manifoldPairs array to receive pairs of properly mated edges, i.e. mesh interior edges.
+     * @param singletons array to receive edges that have no partner, i.e., mesh boundary edges.
+     * @param nullEdges array to receive arrays of matched null edges, for which start === end vertex index.
+     * @param allOtherClusters array to receive arrays of edges that are partners in an undirected, non-manifold sense.
      */
     sortAndCollectClusters(manifoldPairs, singletons, nullEdges, allOtherClusters) {
         this.sort();
@@ -247001,18 +247187,14 @@ class IndexedEdgeMatcher {
                 SortableEdge.areUndirectedPartners(baseEdge, this.edges[index1]); index1++) {
                 clusterLength++;
             }
-            if (this.edges[index0].isNullEdge) {
+            if (this.edges[index0].isNullEdge)
                 this.collectSortableEdgeCluster(index0, index0 + clusterLength, nullEdges);
-            }
-            else if (clusterLength === 2 && SortableEdge.areDirectedPartners(baseEdge, this.edges[index0 + 1])) {
+            else if (clusterLength === 2 && SortableEdge.areDirectedPartners(baseEdge, this.edges[index0 + 1]))
                 this.collectSortableEdgeCluster(index0, index0 + clusterLength, manifoldPairs);
-            }
-            else if (clusterLength === 1) {
+            else if (clusterLength === 1)
                 this.collectSortableEdgeCluster(index0, index0 + 1, singletons);
-            }
-            else {
+            else
                 this.collectSortableEdgeCluster(index0, index0 + clusterLength, allOtherClusters);
-            }
         }
     }
 }
@@ -247071,10 +247253,10 @@ class IndexedPolyfaceVisitor extends _PolyfaceData__WEBPACK_IMPORTED_MODULE_0__.
             this.auxData = polyface.data.auxData.createForVisitor();
         if (polyface.data.edgeMateIndex)
             this.edgeMateIndex = [];
-        this.reset();
         this._numEdges = 0;
         this._nextFacetIndex = 0;
         this._currentFacetIndex = -1;
+        this.reset();
     }
     /** Return the client polyface object. */
     clientPolyface() {
@@ -247111,11 +247293,14 @@ class IndexedPolyfaceVisitor extends _PolyfaceData__WEBPACK_IMPORTED_MODULE_0__.
     moveToReadIndex(facetIndex) {
         if (!this._polyface.isValidFacetIndex(facetIndex))
             return false;
-        this._currentFacetIndex = facetIndex;
+        const numEdges = this._polyface.numEdgeInFacet(facetIndex);
+        if (this._currentFacetIndex !== facetIndex || numEdges + this._numWrap !== this.pointCount) {
+            this._currentFacetIndex = facetIndex;
+            this._numEdges = numEdges;
+            this.resizeAllArrays(this._numEdges + this._numWrap);
+            this.gatherIndexedData(this._polyface.data, this._polyface.facetIndex0(this._currentFacetIndex), this._polyface.facetIndex1(this._currentFacetIndex), this._numWrap);
+        }
         this._nextFacetIndex = facetIndex + 1;
-        this._numEdges = this._polyface.numEdgeInFacet(facetIndex);
-        this.resizeAllArrays(this._numEdges + this._numWrap);
-        this.gatherIndexedData(this._polyface.data, this._polyface.facetIndex0(this._currentFacetIndex), this._polyface.facetIndex1(this._currentFacetIndex), this._numWrap);
         return true;
     }
     /** Advance the iterator to a the 'next' facet in the client polyface. */
@@ -247125,7 +247310,7 @@ class IndexedPolyfaceVisitor extends _PolyfaceData__WEBPACK_IMPORTED_MODULE_0__.
         this._nextFacetIndex++;
         return true;
     }
-    /** Reset the iterator to start at the first facet of the polyface. */
+    /** Restart the visitor at the first facet. */
     reset() {
         this.moveToReadIndex(0);
         this._nextFacetIndex = 0; // so immediate moveToNextFacet stays here.
@@ -247224,6 +247409,10 @@ class IndexedPolyfaceVisitor extends _PolyfaceData__WEBPACK_IMPORTED_MODULE_0__.
             this.color.push(_Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.interpolateColor(other.color[index0], fraction, other.color[index1]));
         // TODO: auxData? taggedNumericData?
     }
+    /** Create a visitor for a subset of the facets visitable by the instance. */
+    createSubsetVisitor(facetIndices, numWrap = 0) {
+        return IndexedPolyfaceSubsetVisitor.createSubsetVisitor(this._polyface, facetIndices, numWrap);
+    }
 }
 /**
  * An `IndexedPolyfaceSubsetVisitor` is an `IndexedPolyfaceVisitor` which only visits a subset of facets in the polyface.
@@ -247232,38 +247421,38 @@ class IndexedPolyfaceVisitor extends _PolyfaceData__WEBPACK_IMPORTED_MODULE_0__.
  * @public
  */
 class IndexedPolyfaceSubsetVisitor extends IndexedPolyfaceVisitor {
-    _parentFacetIndices; // only undefined during super constructor!
-    _currentActiveIndex; // index within _parentFacetIndices, or -1 after construction
-    _nextActiveIndex; // index within _parentFacetIndices
-    constructor(polyface, activeFacetIndices, numWrap) {
+    _facetIndices;
+    _currentSubsetIndex; // index within _facetIndices, or -1 after construction
+    _nextSubsetIndex; // index within _facetIndices
+    constructor(polyface, facetIndices, numWrap) {
         super(polyface, numWrap);
-        this._parentFacetIndices = activeFacetIndices.slice();
-        this._currentActiveIndex = -1;
-        this._nextActiveIndex = 0;
+        this._facetIndices = facetIndices.slice();
+        this._currentSubsetIndex = -1;
+        this._nextSubsetIndex = 0;
+        this.reset();
     }
     isValidSubsetIndex(index) {
-        return (undefined !== this._parentFacetIndices) && index >= 0 && index < this._parentFacetIndices.length;
+        return index >= 0 && index < this._facetIndices.length;
     }
     /**
      * Create a visitor for iterating a subset of the facets of `polyface`.
      * @param polyface reference to the client polyface, supplying facets
-     * @param activeFacetIndices array of indices of facets in the client polyface to visit. This array is cloned.
+     * @param facetIndices array of indices of facets in the client polyface to visit. This array is cloned.
      * @param numWrap number of vertices replicated in the visitor arrays to facilitate simpler caller code. Default is zero.
      */
-    static createSubsetVisitor(polyface, activeFacetIndices, numWrap = 0) {
-        return new IndexedPolyfaceSubsetVisitor(polyface, activeFacetIndices, numWrap);
+    static createSubsetVisitor(polyface, facetIndices, numWrap = 0) {
+        return new IndexedPolyfaceSubsetVisitor(polyface, facetIndices, numWrap);
     }
     /**
      * Advance the iterator to a particular facet in the subset of client polyface facets.
-     * @param activeIndex the index of the facet within the subset, not to be confused with the index of the facet within
-     * the client polyface.
+     * @param subsetIndex index into the subset array, not to be confused with the client facet index.
      * @return whether the iterator was successfully moved.
      */
-    moveToReadIndex(activeIndex) {
-        if (this.isValidSubsetIndex(activeIndex)) {
-            this._currentActiveIndex = activeIndex;
-            this._nextActiveIndex = activeIndex + 1;
-            return super.moveToReadIndex(this._parentFacetIndices[activeIndex]);
+    moveToReadIndex(subsetIndex) {
+        if (this.isValidSubsetIndex(subsetIndex)) {
+            this._currentSubsetIndex = subsetIndex;
+            this._nextSubsetIndex = subsetIndex + 1;
+            return super.moveToReadIndex(this._facetIndices[subsetIndex]);
         }
         return false;
     }
@@ -247272,29 +247461,31 @@ class IndexedPolyfaceSubsetVisitor extends IndexedPolyfaceVisitor {
      * @return whether the iterator was successfully moved.
      */
     moveToNextFacet() {
-        if (this._nextActiveIndex !== this._currentActiveIndex)
-            return this.moveToReadIndex(this._nextActiveIndex);
-        this._nextActiveIndex++;
+        if (this._nextSubsetIndex !== this._currentSubsetIndex)
+            return this.moveToReadIndex(this._nextSubsetIndex);
+        this._nextSubsetIndex++;
         return true;
     }
-    /** Reset the iterator to start at the first active facet in the subset of client polyface facets. */
+    /** Restart the visitor at the first facet. */
     reset() {
-        this.moveToReadIndex(0);
-        this._nextActiveIndex = 0; // so immediate moveToNextFacet stays here.
+        if (this._facetIndices) { // avoid crash during super ctor when we aren't yet initialized
+            this.moveToReadIndex(0);
+            this._nextSubsetIndex = 0; // so immediate moveToNextFacet stays here.
+        }
     }
     /**
-     * Return the parent facet index of the indicated index within the subset of client polyface facets.
-     * @param activeIndex index of the facet within the subset. Default is the active facet.
-     * @return valid client polyface facet index, or `undefined` if invalid input index.
+     * Return the client polyface facet index (aka "readIndex") for the given subset index.
+     * @param subsetIndex index into the subset array. Default is the subset index of the currently visited facet.
+     * @return valid client polyface facet index, or `undefined` if invalid subset index.
      */
-    parentFacetIndex(activeIndex) {
-        if (undefined === activeIndex)
-            activeIndex = this._currentActiveIndex;
-        return this.isValidSubsetIndex(activeIndex) ? this._parentFacetIndices[activeIndex] : undefined;
+    parentFacetIndex(subsetIndex) {
+        if (undefined === subsetIndex)
+            subsetIndex = this._currentSubsetIndex;
+        return this.isValidSubsetIndex(subsetIndex) ? this._facetIndices[subsetIndex] : undefined;
     }
     /** Return the number of facets this visitor is able to visit. */
     getVisitableFacetCount() {
-        return this._parentFacetIndices ? this._parentFacetIndices.length : 0;
+        return this._facetIndices.length;
     }
     /**
      * Create a visitor for those mesh facets with normal in the same half-space as the given vector.
@@ -247394,7 +247585,7 @@ __webpack_require__.r(__webpack_exports__);
  *   * The [[previousAroundVertex]] step is clockwise around the vertex.
  * * The `nextAroundFacet` steps for a walker and its [[edgeMate]] are in opposite directions along their shared edge,
  * when that edge is interior. Thus the `edgeMate` step can be seen to iterate an "edge loop" of two locations for an
- * interior edges.
+ * interior edge.
  * * Invalid Walkers:
  *   * An invalid walker has undefined [[edgeIndex]]. For these walkers, [[isUndefined]] returns true, and [[isValid]]
  * returns false. Traversal operations on an invalid walker return an invalid walker.
@@ -247408,6 +247599,7 @@ __webpack_require__.r(__webpack_exports__);
  *   * Invalid walkers can also occur while traversing a non-manifold mesh. Such meshes feature edge(s) with more than
  * two adjacent facets, or with two adjacent facets that have opposite orientations. These meshes are uncommon, and
  * usually indicate a construction problem.
+ *   * Note that a null edge, for which the start and end vertex is the same, does not yield an invalid walker.
  * * See [[buildEdgeMateIndices]] for further description of the topological relations.
  * @public
  */
@@ -247450,6 +247642,10 @@ class IndexedPolyfaceWalker {
     get isUndefined() {
         return this._edgeIndex === undefined;
     }
+    /** Whether the walker is at a null edge, i.e. an edge with no length. */
+    get isNull() {
+        return this.isValid && this._polyface.data.edgeIndexToEdgeMateIndex(this._edgeIndex) === this._edgeIndex;
+    }
     /**
      * Create a walker for a given polyface at an optional edge.
      * @param polyface reference to the client polyface. This reference is captured (the polyface is not copied).
@@ -247492,17 +247688,16 @@ class IndexedPolyfaceWalker {
     }
     /**
      * Create a new IndexedPolyfaceWalker from the instance.
-     * * The returned walker refers to the same polyface.
-     * * If `edgeIndex` is undefined, the returned walker refers to the same edge as the instance.
-     * * If `edgeIndex` is defined and valid, the returned walker refers to this edge.
-     * * If `edgeIndex` is defined but invalid, return undefined.
-     */
-    clone(edgeIndex) {
-        if (edgeIndex === undefined)
-            edgeIndex = this._edgeIndex;
-        if (this._polyface.data.isValidEdgeIndex(edgeIndex))
-            return new IndexedPolyfaceWalker(this._polyface, edgeIndex);
-        return undefined;
+     * * The returned walker refers to the same polyface and edge as the instance.
+     * @param result optional receiver to modify and return.
+     */
+    clone(result) {
+        if (result) {
+            result._polyface = this._polyface;
+            result._edgeIndex = this._edgeIndex;
+            return result;
+        }
+        return new IndexedPolyfaceWalker(this._polyface, this._edgeIndex);
     }
     /**
      * Load the walker's facet into the given visitor.
@@ -247631,29 +247826,35 @@ class IndexedPolyfaceWalker {
      * Build the edgeMate index array into the polyface's [[PolyfaceData]].
      * After this method:
      * * The array `polyface.data.edgeMateIndex` is defined with the same length as the other PolyfaceData index arrays.
-     * * For each interior edge, `polyface.data.edgeIndexToEdgeMateIndex` returns the edgeIndex on the other side of the
+     * * For each interior edge, `polyface.data.edgeIndexToEdgeMateIndex` returns the edge index on the other side of the
      * edge in the adjacent facet.
      * * The conditions for edgeMate matching are:
      *   * Given facetIndex f, let `k0 = polyface.facetIndex0(f)` and `k1 = polyface.facetIndex1(f)`.
-     *   * Every edgeIndex k in the face loop of facet f satisfies `k0 <= k < k1`.
-     *   * The edge with edgeIndex k starts at the point with index `polyface.data.pointIndex[k]`.
-     *   * Let kA be an edgeIndex in this range [k0,k1), and let kB be its in-range successor with cyclic wrap, i.e.,
+     *   * Every edge index k in the face loop of facet f satisfies `k0 <= k < k1`.
+     *   * The edge with edge index k starts at the point with index `polyface.data.pointIndex[k]`.
+     *   * Let kA be an edge index in this range [k0,k1), and let kB be its in-range successor with cyclic wrap, i.e.,
      * `kB === (kA + 1 === k1) ? k0 : kA + 1`.
      *   * Then `polyface.data.pointIndex[kA]` and `polyface.data.pointIndex[kB]` are the indices of the points at the
      * start and end of an edge of that facet.
-     *   * We call kA the _edgeIndex_ for that edge, and kB the _edgeIndex_ for the next edge around the facet.
-     *   * If kA is an interior edge in a 2-manifold mesh with properly oriented facets, then there is an adjacent facet
-     * whose face loop contains edgeIndices kC and kD referencing the same edge vertices in reverse order, i.e.,
+     *   * We call kA the _edge index_ for that edge, and kB the _edge index_ for the next edge around the facet.
+     *   * If kA is a positive-length interior edge in a 2-manifold mesh with properly oriented facets, then there is
+     * an adjacent facet whose face loop contains edge indices kC and kD referencing the same edge vertices in reverse
+     * order, i.e.,
      *     * `polyface.data.pointIndex[kA] === polyface.data.pointIndex[kD]`
      *     * `polyface.data.pointIndex[kB] === polyface.data.pointIndex[kC]`
-     *   * Given this relationship, we say that edgeIndices kA and kC are _edge mates_.
-     *   * A non-interior edge either lies on the boundary of the mesh or is non-manifold (having more than two adjacent
-     * facets, or one with the wrong orientation). These edges have no edge mate.
+     *   * We call the edge indices kA and kC _edge mates_, denoted in the `edgeMateIndex` array by:
+     *     * `polyface.data.edgeMateIndex[kA] === kC`
+     *     * `polyface.data.edgeMateIndex[kC] === kA`
+     *   * If kA is zero-length interior edge, i.e, it has the same start and end point indices, then we call it a _null
+     * edge_, and its edge mate is itself.
+     * * A non-interior edge either lies on the boundary of the mesh, or is non-manifold (having more than 2 adjacent
+     * facets, or 1 with the wrong orientation). These edges have no edge mate, represented as `undefined` in
+     * the `edgeMateIndex` array.
      * * These conditions define a conventional manifold mesh where each edge of a facet has at most one partner edge with
      * opposite orientation in an adjacent facet.
      * * After calling this method, the caller can construct `IndexedPolyfaceWalker` objects to traverse the mesh by
-     * walking across edges, around faces, and around vertices. Let walkerA have edgeIndex value kA. Then with the
-     * aforementioned edgeIndices:
+     * walking across edges, around faces, and around vertices. Let walkerA have edge index value kA. Then with the
+     * aforementioned edge indices:
      *   * `walkerC = walkerA.edgeMate()` moves across the edge to its other end, at kC.
      *   * `walkerB = walkerA.nextAroundFacet()` moves around the facet to the next edge, at kB.
      *   * `walkerB.previousAroundFacet()` moves from kB back to kA.
@@ -247668,25 +247869,30 @@ class IndexedPolyfaceWalker {
             const kStart = polyface.facetIndex0(facetIndex);
             const kEnd = polyface.facetIndex1(facetIndex);
             let k0 = kEnd - 1;
-            // sneaky: addEdge 3rd arg is edgeIndex k0 instead of facetIndex; it gets carried around during matching
+            // sneaky: addEdge 3rd arg is edge index k0 instead of facetIndex; it gets carried around during matching
             for (let k1 = kStart; k1 < kEnd; k0 = k1, k1++)
                 matcher.addEdge(polyface.data.pointIndex[k0], polyface.data.pointIndex[k1], k0);
         }
         const matchedPairs = [];
-        const singletons = [];
         const nullEdges = [];
-        const allOtherClusters = [];
-        matcher.sortAndCollectClusters(matchedPairs, singletons, nullEdges, allOtherClusters);
+        matcher.sortAndCollectClusters(matchedPairs, undefined, nullEdges, undefined);
         const numIndex = polyface.data.pointIndex.length;
         polyface.data.edgeMateIndex = new Array(numIndex);
         for (let i = 0; i < numIndex; i++)
-            polyface.data.edgeMateIndex[i] = undefined;
+            polyface.data.edgeMateIndex[i] = undefined; // boundary and non-manifold edges have no mate
         for (const pair of matchedPairs) {
             if (Array.isArray(pair) && pair.length === 2) {
-                const k0 = pair[0].facetIndex;
-                const k1 = pair[1].facetIndex;
-                polyface.data.edgeMateIndex[k0] = k1;
-                polyface.data.edgeMateIndex[k1] = k0;
+                const edgeIndex0 = pair[0].facetIndex;
+                const edgeIndex1 = pair[1].facetIndex;
+                polyface.data.edgeMateIndex[edgeIndex0] = edgeIndex1; // paired edges point to each other
+                polyface.data.edgeMateIndex[edgeIndex1] = edgeIndex0;
+            }
+        }
+        for (const nullEdgeOrCluster of nullEdges) {
+            const nullCluster = Array.isArray(nullEdgeOrCluster) ? nullEdgeOrCluster : [nullEdgeOrCluster];
+            for (const nullEdge of nullCluster) {
+                const edgeIndex = nullEdge.facetIndex;
+                polyface.data.edgeMateIndex[edgeIndex] = edgeIndex; // a null edge points to itself
             }
         }
     }
@@ -248373,6 +248579,22 @@ class IndexedPolyface extends Polyface {
     dispatchToGeometryHandler(handler) {
         return handler.handleIndexedPolyface(this);
     }
+    /** If the input accesses an edgeMateIndex array, return it along with the owning IndexedPolyface. */
+    static hasEdgeMateIndex(polyface) {
+        let parent;
+        if (polyface instanceof Polyface) {
+            if (polyface instanceof IndexedPolyface)
+                parent = polyface;
+        }
+        else if (polyface.clientPolyface() && polyface.clientPolyface() instanceof IndexedPolyface)
+            parent = polyface.clientPolyface();
+        if (parent) {
+            const edgeMateIndex = parent.data.edgeMateIndex;
+            if (edgeMateIndex && edgeMateIndex.length > 0 && edgeMateIndex.length === parent.data.indexCount)
+                return { parent, edgeMateIndex };
+        }
+        return undefined;
+    }
 }
 
 
@@ -250283,9 +250505,9 @@ class PolyfaceBuilder extends _geometry3d_GeometryHandler__WEBPACK_IMPORTED_MODU
         let indexA = -1;
         let indexB = -1;
         for (let i = this._polyface.facetIndex0(edge.facetIndex); i < this._polyface.facetIndex1(edge.facetIndex); ++i) {
-            if (edge.vertexIndexA === this._polyface.data.pointIndex[i])
+            if (edge.startVertex === this._polyface.data.pointIndex[i])
                 indexA = i;
-            else if (edge.vertexIndexB === this._polyface.data.pointIndex[i])
+            else if (edge.endVertex === this._polyface.data.pointIndex[i])
                 indexB = i;
         }
         return (indexA < 0 || indexB < 0) ? undefined : { edgeIndexA: indexA, edgeIndexB: indexB };
@@ -250423,7 +250645,7 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony import */ var _curve_UnionRegion__WEBPACK_IMPORTED_MODULE_10__ = __webpack_require__(/*! ../curve/UnionRegion */ "../../core/geometry/lib/esm/curve/UnionRegion.js");
 /* harmony import */ var _Geometry__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ../Geometry */ "../../core/geometry/lib/esm/Geometry.js");
 /* harmony import */ var _geometry3d_FrameBuilder__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! ../geometry3d/FrameBuilder */ "../../core/geometry/lib/esm/geometry3d/FrameBuilder.js");
-/* harmony import */ var _geometry3d_GrowableXYZArray__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ../geometry3d/GrowableXYZArray */ "../../core/geometry/lib/esm/geometry3d/GrowableXYZArray.js");
+/* harmony import */ var _geometry3d_GrowableXYZArray__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ../geometry3d/GrowableXYZArray */ "../../core/geometry/lib/esm/geometry3d/GrowableXYZArray.js");
 /* harmony import */ var _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_15__ = __webpack_require__(/*! ../geometry3d/Point3dVector3d */ "../../core/geometry/lib/esm/geometry3d/Point3dVector3d.js");
 /* harmony import */ var _geometry3d_PolygonOps__WEBPACK_IMPORTED_MODULE_14__ = __webpack_require__(/*! ../geometry3d/PolygonOps */ "../../core/geometry/lib/esm/geometry3d/PolygonOps.js");
 /* harmony import */ var _geometry3d_Range__WEBPACK_IMPORTED_MODULE_17__ = __webpack_require__(/*! ../geometry3d/Range */ "../../core/geometry/lib/esm/geometry3d/Range.js");
@@ -250431,7 +250653,7 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony import */ var _solid_SweepContour__WEBPACK_IMPORTED_MODULE_16__ = __webpack_require__(/*! ../solid/SweepContour */ "../../core/geometry/lib/esm/solid/SweepContour.js");
 /* harmony import */ var _topology_ChainMerge__WEBPACK_IMPORTED_MODULE_13__ = __webpack_require__(/*! ../topology/ChainMerge */ "../../core/geometry/lib/esm/topology/ChainMerge.js");
 /* harmony import */ var _multiclip_RangeSearch__WEBPACK_IMPORTED_MODULE_21__ = __webpack_require__(/*! ./multiclip/RangeSearch */ "../../core/geometry/lib/esm/polyface/multiclip/RangeSearch.js");
-/* harmony import */ var _Polyface__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ./Polyface */ "../../core/geometry/lib/esm/polyface/Polyface.js");
+/* harmony import */ var _Polyface__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ./Polyface */ "../../core/geometry/lib/esm/polyface/Polyface.js");
 /* harmony import */ var _PolyfaceBuilder__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./PolyfaceBuilder */ "../../core/geometry/lib/esm/polyface/PolyfaceBuilder.js");
 /* harmony import */ var _PolyfaceQuery__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ./PolyfaceQuery */ "../../core/geometry/lib/esm/polyface/PolyfaceQuery.js");
 /*---------------------------------------------------------------------------------------------
@@ -250527,26 +250749,28 @@ class PolyfaceClip {
      * * Return all surviving clip as a new mesh.
      * * WARNING: The new mesh is "points only" -- parameters, normals, etc are not interpolated
      */
-    static clipPolyfaceClipPlaneWithClosureFace(polyface, clipper, insideClip = true, buildClosureFaces = true) {
-        return this.clipPolyfaceClipPlane(polyface, clipper, insideClip, buildClosureFaces);
+    static clipPolyfaceClipPlaneWithClosureFace(source, clipper, insideClip = true, buildClosureFaces = true) {
+        return this.clipPolyfaceClipPlane(source, clipper, insideClip, buildClosureFaces);
     }
     /** Clip each facet of polyface to the ClipPlane.
      * * Return all surviving clip as a new mesh.
      * * WARNING: The new mesh is "points only" -- parameters, normals, etc are not interpolated
      */
-    static clipPolyfaceClipPlane(polyface, clipper, insideClip = true, buildClosureFaces = false) {
+    static clipPolyfaceClipPlane(source, clipper, insideClip = true, buildClosureFaces = false) {
         const builders = ClippedPolyfaceBuilders.create(insideClip, !insideClip, buildClosureFaces);
-        this.clipPolyfaceInsideOutside(polyface, clipper, builders);
+        this.clipPolyfaceInsideOutside(source, clipper, builders);
         return builders.claimPolyface(insideClip ? 0 : 1, true);
     }
-    /** Clip each facet of polyface to the ClipPlane.
-     * * Return surviving clip as a new mesh.
+    /**
+     * Clip each facet to the clipper.
+     * * Return surviving facets as a new mesh.
      * * WARNING: The new mesh is "points only".
      */
-    static clipPolyfaceConvexClipPlaneSet(polyface, clipper) {
-        const visitor = polyface.createVisitor(0);
+    static clipPolyfaceConvexClipPlaneSet(source, clipper) {
+        const visitor = source instanceof _Polyface__WEBPACK_IMPORTED_MODULE_4__.Polyface ? source.createVisitor(0) : source;
+        visitor.setNumWrap(0);
         const builder = _PolyfaceBuilder__WEBPACK_IMPORTED_MODULE_1__.PolyfaceBuilder.create();
-        const work = new _geometry3d_GrowableXYZArray__WEBPACK_IMPORTED_MODULE_4__.GrowableXYZArray(10);
+        const work = new _geometry3d_GrowableXYZArray__WEBPACK_IMPORTED_MODULE_5__.GrowableXYZArray(10);
         for (visitor.reset(); visitor.moveToNextFacet();) {
             clipper.clipConvexPolygonInPlace(visitor.point, work);
             if (visitor.point.length > 2)
@@ -250554,21 +250778,18 @@ class PolyfaceClip {
         }
         return builder.claimPolyface(true);
     }
-    /** Clip each facet of polyface to the the clippers.
+    /** Clip each facet to the clippers.
      * * Add inside, outside fragments to builderA, builderB
      * * This does not consider params, normals, colors.  Just points.
      * * outputSelect determines how the clip output is structured
      *   * 0 outputs all shards -- this may have many interior edges.
      *   * 1 stitches shards together to get cleaner facets.
      */
-    static clipPolyfaceUnionOfConvexClipPlaneSetsToBuilders(polyface, allClippers, destination, outputSelector = 1) {
-        if (polyface instanceof _Polyface__WEBPACK_IMPORTED_MODULE_5__.Polyface) {
-            this.clipPolyfaceUnionOfConvexClipPlaneSetsToBuilders(polyface.createVisitor(0), allClippers, destination, outputSelector);
-            return;
-        }
+    static clipPolyfaceUnionOfConvexClipPlaneSetsToBuilders(source, allClippers, destination, outputSelector = 1) {
         const builderA = destination.builderA;
         const builderB = destination.builderB;
-        const visitor = polyface; // alias; we have a visitor now
+        const visitor = source instanceof _Polyface__WEBPACK_IMPORTED_MODULE_4__.Polyface ? source.createVisitor(0) : source;
+        visitor.setNumWrap(0);
         const cache = new _geometry3d_ReusableObjectCache__WEBPACK_IMPORTED_MODULE_6__.GrowableXYZArrayCache();
         const insideShards = [];
         const outsideShards = [];
@@ -250655,7 +250876,7 @@ class PolyfaceClip {
     static cleanupAndAddRegion(builder, shards, worldToLocal, localToWorld) {
         if (builder !== undefined && shards.length > 0) {
             if (worldToLocal)
-                _geometry3d_GrowableXYZArray__WEBPACK_IMPORTED_MODULE_4__.GrowableXYZArray.multiplyTransformInPlace(worldToLocal, shards);
+                _geometry3d_GrowableXYZArray__WEBPACK_IMPORTED_MODULE_5__.GrowableXYZArray.multiplyTransformInPlace(worldToLocal, shards);
             const outsidePieces = _curve_RegionOps__WEBPACK_IMPORTED_MODULE_11__.RegionOps.polygonBooleanXYToLoops(shards, _curve_RegionOps__WEBPACK_IMPORTED_MODULE_11__.RegionBinaryOpType.Union, []);
             if (outsidePieces && outsidePieces.children.length > 0) {
                 _curve_RegionOps__WEBPACK_IMPORTED_MODULE_11__.RegionOps.consolidateAdjacentPrimitives(outsidePieces); // source of the T-vertices removed in claimPolyface
@@ -250699,24 +250920,23 @@ class PolyfaceClip {
         }
         return chainContexts;
     }
-    /** Clip each facet of polyface to the the clippers.
+    /** Clip each facet to the clippers.
    * * Add inside, outside fragments to builderA, builderB
    * * This does not consider params, normals, colors.  Just points.
    * @internal
    */
-    static clipPolyfaceConvexClipPlaneSetToBuilders(polyface, clipper, destination) {
+    static clipPolyfaceConvexClipPlaneSetToBuilders(source, clipper, destination) {
         const builderA = destination.builderA;
         const builderB = destination.builderB;
-        const visitor = polyface.createVisitor(0);
+        const visitor = source instanceof _Polyface__WEBPACK_IMPORTED_MODULE_4__.Polyface ? source.createVisitor(0) : source;
+        visitor.setNumWrap(0);
         const cache = new _geometry3d_ReusableObjectCache__WEBPACK_IMPORTED_MODULE_6__.GrowableXYZArrayCache();
         const outsideParts = [];
         for (visitor.reset(); visitor.moveToNextFacet();) {
-            // !!! currentCandidates and next candidates are empty at this point !!!
             const insidePart = clipper.clipInsidePushOutside(visitor.point, outsideParts, cache);
             if (insidePart === undefined) {
                 // everything is out ... outsideParts might be fragmented.  Save only the original polygon
                 builderB?.addPolygonGrowableXYZArray(visitor.point);
-                cache.dropToCache(insidePart);
                 cache.dropAllToCache(outsideParts);
             }
             this.addPolygonToBuilderAndDropToCache(insidePart, builderA, cache);
@@ -250852,15 +251072,16 @@ class PolyfaceClip {
             }
         }
     }
-    /** Clip each facet of polyface to the the clippers.
+    /** Clip each facet to the clippers.
      * * Add inside, outside fragments to builderA, builderB
      * * This does not consider params, normals, colors.  Just points.
      * @internal
      */
-    static clipPolyfaceClipPlaneToBuilders(polyface, clipper, destination) {
+    static clipPolyfaceClipPlaneToBuilders(source, clipper, destination) {
         const builderA = destination.builderA;
         const builderB = destination.builderB;
-        const visitor = polyface.createVisitor(0);
+        const visitor = source instanceof _Polyface__WEBPACK_IMPORTED_MODULE_4__.Polyface ? source.createVisitor(0) : source;
+        visitor.setNumWrap(0);
         const cache = new _geometry3d_ReusableObjectCache__WEBPACK_IMPORTED_MODULE_6__.GrowableXYZArrayCache();
         const inside = cache.grabFromCache();
         const outside = cache.grabFromCache();
@@ -250877,34 +251098,31 @@ class PolyfaceClip {
         cache.dropToCache(inside);
         cache.dropToCache(outside);
     }
-    /** Clip each facet of polyface to the ClipPlane or ConvexClipPlaneSet
+    /** Clip each facet to the clipper.
      * * accumulate inside and outside facets -- to destination.builderA and destination.builderB
-     * * if `destination.buildClosureFaces` is set, and also build closure facets
-     * * This method parses  the variant input types and calls a more specific method.
+     * * if `destination.buildClosureFaces` is set, also build closure facets.
+     * * This method parses the variant input types and calls a more specific method.
      * * WARNING: The new mesh is "points only".
      * * outputSelect applies only for UnionOfConvexClipPlaneSets -- see [[PolyfaceClip.clipPolyfaceUnionOfConvexClipPlaneSetsToBuilders]]
      */
-    static clipPolyfaceInsideOutside(polyface, clipper, destination, outputSelect = 0) {
-        if (clipper instanceof _clipping_ClipPlane__WEBPACK_IMPORTED_MODULE_18__.ClipPlane) {
-            this.clipPolyfaceClipPlaneToBuilders(polyface, clipper, destination);
-        }
-        else if (clipper instanceof _clipping_ConvexClipPlaneSet__WEBPACK_IMPORTED_MODULE_19__.ConvexClipPlaneSet) {
-            this.clipPolyfaceConvexClipPlaneSetToBuilders(polyface, clipper, destination);
-        }
-        else if (clipper instanceof _clipping_UnionOfConvexClipPlaneSets__WEBPACK_IMPORTED_MODULE_20__.UnionOfConvexClipPlaneSets) {
-            this.clipPolyfaceUnionOfConvexClipPlaneSetsToBuilders(polyface, clipper, destination, outputSelect);
-        }
+    static clipPolyfaceInsideOutside(source, clipper, destination, outputSelect = 0) {
+        if (clipper instanceof _clipping_ClipPlane__WEBPACK_IMPORTED_MODULE_18__.ClipPlane)
+            this.clipPolyfaceClipPlaneToBuilders(source, clipper, destination);
+        else if (clipper instanceof _clipping_ConvexClipPlaneSet__WEBPACK_IMPORTED_MODULE_19__.ConvexClipPlaneSet)
+            this.clipPolyfaceConvexClipPlaneSetToBuilders(source, clipper, destination);
+        else if (clipper instanceof _clipping_UnionOfConvexClipPlaneSets__WEBPACK_IMPORTED_MODULE_20__.UnionOfConvexClipPlaneSets)
+            this.clipPolyfaceUnionOfConvexClipPlaneSetsToBuilders(source, clipper, destination, outputSelect);
     }
-    /** Clip each facet of polyface to the ClipPlane or ConvexClipPlaneSet
+    /** Clip each facet to the clipper.
       * * This method parses the variant input types and calls a more specific method.
       * * To get both inside and outside parts, use clipPolyfaceInsideOutside
       * * WARNING: The new mesh is "points only".
       */
-    static clipPolyface(polyface, clipper) {
+    static clipPolyface(source, clipper) {
         if (clipper instanceof _clipping_ClipPlane__WEBPACK_IMPORTED_MODULE_18__.ClipPlane)
-            return this.clipPolyfaceClipPlane(polyface, clipper);
+            return this.clipPolyfaceClipPlane(source, clipper);
         if (clipper instanceof _clipping_ConvexClipPlaneSet__WEBPACK_IMPORTED_MODULE_19__.ConvexClipPlaneSet)
-            return this.clipPolyfaceConvexClipPlaneSet(polyface, clipper);
+            return this.clipPolyfaceConvexClipPlaneSet(source, clipper);
         // (The if tests exhaust the type space -- this line is unreachable.)
         return undefined;
     }
@@ -250918,7 +251136,7 @@ class PolyfaceClip {
      * @returns clipped facets. No other mesh data but vertices appear in output.
      */
     static drapeRegion(mesh, region, sweepVector, options) {
-        if (mesh instanceof _Polyface__WEBPACK_IMPORTED_MODULE_5__.Polyface)
+        if (mesh instanceof _Polyface__WEBPACK_IMPORTED_MODULE_4__.Polyface)
             return this.drapeRegion(mesh.createVisitor(0), region, sweepVector, options);
         const contour = _solid_SweepContour__WEBPACK_IMPORTED_MODULE_16__.SweepContour.createForLinearSweep(region);
         if (!contour)
@@ -250954,10 +251172,11 @@ class PolyfaceClip {
     /** Intersect each facet with the clip plane. (Producing intersection edges.)
      * * Return all edges  chained as array of LineString3d.
      */
-    static sectionPolyfaceClipPlane(polyface, clipper) {
+    static sectionPolyfaceClipPlane(source, clipper) {
         const chainContext = _topology_ChainMerge__WEBPACK_IMPORTED_MODULE_13__.ChainMergeContext.create();
-        const visitor = polyface.createVisitor(0);
-        const work = new _geometry3d_GrowableXYZArray__WEBPACK_IMPORTED_MODULE_4__.GrowableXYZArray(10);
+        const visitor = source instanceof _Polyface__WEBPACK_IMPORTED_MODULE_4__.Polyface ? source.createVisitor(0) : source;
+        visitor.setNumWrap(0);
+        const work = new _geometry3d_GrowableXYZArray__WEBPACK_IMPORTED_MODULE_5__.GrowableXYZArray(10);
         const point0 = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_15__.Point3d.create();
         const point1 = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_15__.Point3d.create();
         for (visitor.reset(); visitor.moveToNextFacet();) {
@@ -250992,11 +251211,11 @@ class PolyfaceClip {
             visitorA.point.setRange(range);
             searchA.addRange(range, visitorA.currentReadIndex());
         }
-        const xyClip = new _geometry3d_GrowableXYZArray__WEBPACK_IMPORTED_MODULE_4__.GrowableXYZArray(10);
-        const workArray = new _geometry3d_GrowableXYZArray__WEBPACK_IMPORTED_MODULE_4__.GrowableXYZArray(10);
+        const xyClip = new _geometry3d_GrowableXYZArray__WEBPACK_IMPORTED_MODULE_5__.GrowableXYZArray(10);
+        const workArray = new _geometry3d_GrowableXYZArray__WEBPACK_IMPORTED_MODULE_5__.GrowableXYZArray(10);
         const xyFrustum = _clipping_ConvexClipPlaneSet__WEBPACK_IMPORTED_MODULE_19__.ConvexClipPlaneSet.createEmpty();
-        const below = new _geometry3d_GrowableXYZArray__WEBPACK_IMPORTED_MODULE_4__.GrowableXYZArray(10);
-        const above = new _geometry3d_GrowableXYZArray__WEBPACK_IMPORTED_MODULE_4__.GrowableXYZArray(10);
+        const below = new _geometry3d_GrowableXYZArray__WEBPACK_IMPORTED_MODULE_5__.GrowableXYZArray(10);
+        const above = new _geometry3d_GrowableXYZArray__WEBPACK_IMPORTED_MODULE_5__.GrowableXYZArray(10);
         const planeOfFacet = _clipping_ClipPlane__WEBPACK_IMPORTED_MODULE_18__.ClipPlane.createNormalAndPointXYZXYZ(0, 0, 1, 0, 0, 0);
         const altitudeRange = _geometry3d_Range__WEBPACK_IMPORTED_MODULE_17__.Range1d.createNull();
         for (visitorB.reset(); visitorB.moveToNextFacet();) {
@@ -251872,42 +252091,41 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */ });
 /* harmony import */ var _itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! @itwin/core-bentley */ "../../core/bentley/lib/esm/core-bentley.js");
 /* harmony import */ var _curve_CurveCollection__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ../curve/CurveCollection */ "../../core/geometry/lib/esm/curve/CurveCollection.js");
-/* harmony import */ var _curve_CurveOps__WEBPACK_IMPORTED_MODULE_20__ = __webpack_require__(/*! ../curve/CurveOps */ "../../core/geometry/lib/esm/curve/CurveOps.js");
+/* harmony import */ var _curve_CurveOps__WEBPACK_IMPORTED_MODULE_19__ = __webpack_require__(/*! ../curve/CurveOps */ "../../core/geometry/lib/esm/curve/CurveOps.js");
 /* harmony import */ var _curve_internalContexts_MultiChainCollector__WEBPACK_IMPORTED_MODULE_13__ = __webpack_require__(/*! ../curve/internalContexts/MultiChainCollector */ "../../core/geometry/lib/esm/curve/internalContexts/MultiChainCollector.js");
 /* harmony import */ var _curve_LineSegment3d__WEBPACK_IMPORTED_MODULE_12__ = __webpack_require__(/*! ../curve/LineSegment3d */ "../../core/geometry/lib/esm/curve/LineSegment3d.js");
 /* harmony import */ var _curve_LineString3d__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ../curve/LineString3d */ "../../core/geometry/lib/esm/curve/LineString3d.js");
 /* harmony import */ var _curve_Loop__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ../curve/Loop */ "../../core/geometry/lib/esm/curve/Loop.js");
-/* harmony import */ var _curve_StrokeOptions__WEBPACK_IMPORTED_MODULE_26__ = __webpack_require__(/*! ../curve/StrokeOptions */ "../../core/geometry/lib/esm/curve/StrokeOptions.js");
+/* harmony import */ var _curve_StrokeOptions__WEBPACK_IMPORTED_MODULE_25__ = __webpack_require__(/*! ../curve/StrokeOptions */ "../../core/geometry/lib/esm/curve/StrokeOptions.js");
 /* harmony import */ var _Geometry__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ../Geometry */ "../../core/geometry/lib/esm/Geometry.js");
 /* harmony import */ var _geometry3d_Angle__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ../geometry3d/Angle */ "../../core/geometry/lib/esm/geometry3d/Angle.js");
-/* harmony import */ var _geometry3d_BarycentricTriangle__WEBPACK_IMPORTED_MODULE_36__ = __webpack_require__(/*! ../geometry3d/BarycentricTriangle */ "../../core/geometry/lib/esm/geometry3d/BarycentricTriangle.js");
-/* harmony import */ var _geometry3d_Point3dArrayCarrier__WEBPACK_IMPORTED_MODULE_29__ = __webpack_require__(/*! ../geometry3d/Point3dArrayCarrier */ "../../core/geometry/lib/esm/geometry3d/Point3dArrayCarrier.js");
+/* harmony import */ var _geometry3d_BarycentricTriangle__WEBPACK_IMPORTED_MODULE_35__ = __webpack_require__(/*! ../geometry3d/BarycentricTriangle */ "../../core/geometry/lib/esm/geometry3d/BarycentricTriangle.js");
+/* harmony import */ var _geometry3d_Point3dArrayCarrier__WEBPACK_IMPORTED_MODULE_28__ = __webpack_require__(/*! ../geometry3d/Point3dArrayCarrier */ "../../core/geometry/lib/esm/geometry3d/Point3dArrayCarrier.js");
 /* harmony import */ var _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../geometry3d/Point3dVector3d */ "../../core/geometry/lib/esm/geometry3d/Point3dVector3d.js");
-/* harmony import */ var _geometry3d_PointHelpers__WEBPACK_IMPORTED_MODULE_24__ = __webpack_require__(/*! ../geometry3d/PointHelpers */ "../../core/geometry/lib/esm/geometry3d/PointHelpers.js");
+/* harmony import */ var _geometry3d_PointHelpers__WEBPACK_IMPORTED_MODULE_23__ = __webpack_require__(/*! ../geometry3d/PointHelpers */ "../../core/geometry/lib/esm/geometry3d/PointHelpers.js");
 /* harmony import */ var _geometry3d_PolygonOps__WEBPACK_IMPORTED_MODULE_8__ = __webpack_require__(/*! ../geometry3d/PolygonOps */ "../../core/geometry/lib/esm/geometry3d/PolygonOps.js");
-/* harmony import */ var _geometry3d_Range__WEBPACK_IMPORTED_MODULE_28__ = __webpack_require__(/*! ../geometry3d/Range */ "../../core/geometry/lib/esm/geometry3d/Range.js");
-/* harmony import */ var _geometry3d_Ray3d__WEBPACK_IMPORTED_MODULE_18__ = __webpack_require__(/*! ../geometry3d/Ray3d */ "../../core/geometry/lib/esm/geometry3d/Ray3d.js");
-/* harmony import */ var _geometry3d_Transform__WEBPACK_IMPORTED_MODULE_19__ = __webpack_require__(/*! ../geometry3d/Transform */ "../../core/geometry/lib/esm/geometry3d/Transform.js");
-/* harmony import */ var _geometry4d_Matrix4d__WEBPACK_IMPORTED_MODULE_10__ = __webpack_require__(/*! ../geometry4d/Matrix4d */ "../../core/geometry/lib/esm/geometry4d/Matrix4d.js");
-/* harmony import */ var _geometry4d_MomentData__WEBPACK_IMPORTED_MODULE_9__ = __webpack_require__(/*! ../geometry4d/MomentData */ "../../core/geometry/lib/esm/geometry4d/MomentData.js");
+/* harmony import */ var _geometry3d_Range__WEBPACK_IMPORTED_MODULE_27__ = __webpack_require__(/*! ../geometry3d/Range */ "../../core/geometry/lib/esm/geometry3d/Range.js");
+/* harmony import */ var _geometry3d_Ray3d__WEBPACK_IMPORTED_MODULE_17__ = __webpack_require__(/*! ../geometry3d/Ray3d */ "../../core/geometry/lib/esm/geometry3d/Ray3d.js");
+/* harmony import */ var _geometry3d_Transform__WEBPACK_IMPORTED_MODULE_18__ = __webpack_require__(/*! ../geometry3d/Transform */ "../../core/geometry/lib/esm/geometry3d/Transform.js");
+/* harmony import */ var _geometry4d_Matrix4d__WEBPACK_IMPORTED_MODULE_9__ = __webpack_require__(/*! ../geometry4d/Matrix4d */ "../../core/geometry/lib/esm/geometry4d/Matrix4d.js");
+/* harmony import */ var _geometry4d_MomentData__WEBPACK_IMPORTED_MODULE_10__ = __webpack_require__(/*! ../geometry4d/MomentData */ "../../core/geometry/lib/esm/geometry4d/MomentData.js");
 /* harmony import */ var _numerics_UnionFind__WEBPACK_IMPORTED_MODULE_15__ = __webpack_require__(/*! ../numerics/UnionFind */ "../../core/geometry/lib/esm/numerics/UnionFind.js");
-/* harmony import */ var _topology_ChainMerge__WEBPACK_IMPORTED_MODULE_27__ = __webpack_require__(/*! ../topology/ChainMerge */ "../../core/geometry/lib/esm/topology/ChainMerge.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_HalfEdgeGraphFromIndexedLoopsContext__WEBPACK_IMPORTED_MODULE_32__ = __webpack_require__(/*! ../topology/HalfEdgeGraphFromIndexedLoopsContext */ "../../core/geometry/lib/esm/topology/HalfEdgeGraphFromIndexedLoopsContext.js");
-/* harmony import */ var _topology_HalfEdgeGraphSearch__WEBPACK_IMPORTED_MODULE_23__ = __webpack_require__(/*! ../topology/HalfEdgeGraphSearch */ "../../core/geometry/lib/esm/topology/HalfEdgeGraphSearch.js");
-/* harmony import */ var _topology_Merging__WEBPACK_IMPORTED_MODULE_21__ = __webpack_require__(/*! ../topology/Merging */ "../../core/geometry/lib/esm/topology/Merging.js");
-/* harmony import */ var _topology_SpaceTriangulation__WEBPACK_IMPORTED_MODULE_25__ = __webpack_require__(/*! ../topology/SpaceTriangulation */ "../../core/geometry/lib/esm/topology/SpaceTriangulation.js");
-/* harmony import */ var _FacetLocationDetail__WEBPACK_IMPORTED_MODULE_37__ = __webpack_require__(/*! ./FacetLocationDetail */ "../../core/geometry/lib/esm/polyface/FacetLocationDetail.js");
-/* harmony import */ var _FacetOrientation__WEBPACK_IMPORTED_MODULE_33__ = __webpack_require__(/*! ./FacetOrientation */ "../../core/geometry/lib/esm/polyface/FacetOrientation.js");
+/* harmony import */ var _topology_ChainMerge__WEBPACK_IMPORTED_MODULE_26__ = __webpack_require__(/*! ../topology/ChainMerge */ "../../core/geometry/lib/esm/topology/ChainMerge.js");
+/* harmony import */ var _topology_Graph__WEBPACK_IMPORTED_MODULE_21__ = __webpack_require__(/*! ../topology/Graph */ "../../core/geometry/lib/esm/topology/Graph.js");
+/* harmony import */ var _topology_HalfEdgeGraphFromIndexedLoopsContext__WEBPACK_IMPORTED_MODULE_31__ = __webpack_require__(/*! ../topology/HalfEdgeGraphFromIndexedLoopsContext */ "../../core/geometry/lib/esm/topology/HalfEdgeGraphFromIndexedLoopsContext.js");
+/* harmony import */ var _topology_HalfEdgeGraphSearch__WEBPACK_IMPORTED_MODULE_22__ = __webpack_require__(/*! ../topology/HalfEdgeGraphSearch */ "../../core/geometry/lib/esm/topology/HalfEdgeGraphSearch.js");
+/* harmony import */ var _topology_Merging__WEBPACK_IMPORTED_MODULE_20__ = __webpack_require__(/*! ../topology/Merging */ "../../core/geometry/lib/esm/topology/Merging.js");
+/* harmony import */ var _topology_SpaceTriangulation__WEBPACK_IMPORTED_MODULE_24__ = __webpack_require__(/*! ../topology/SpaceTriangulation */ "../../core/geometry/lib/esm/topology/SpaceTriangulation.js");
+/* harmony import */ var _FacetLocationDetail__WEBPACK_IMPORTED_MODULE_36__ = __webpack_require__(/*! ./FacetLocationDetail */ "../../core/geometry/lib/esm/polyface/FacetLocationDetail.js");
+/* harmony import */ var _FacetOrientation__WEBPACK_IMPORTED_MODULE_32__ = __webpack_require__(/*! ./FacetOrientation */ "../../core/geometry/lib/esm/polyface/FacetOrientation.js");
 /* harmony import */ var _IndexedEdgeMatcher__WEBPACK_IMPORTED_MODULE_11__ = __webpack_require__(/*! ./IndexedEdgeMatcher */ "../../core/geometry/lib/esm/polyface/IndexedEdgeMatcher.js");
-/* harmony import */ var _IndexedPolyfaceVisitor__WEBPACK_IMPORTED_MODULE_16__ = __webpack_require__(/*! ./IndexedPolyfaceVisitor */ "../../core/geometry/lib/esm/polyface/IndexedPolyfaceVisitor.js");
-/* harmony import */ var _multiclip_BuildAverageNormalsContext__WEBPACK_IMPORTED_MODULE_34__ = __webpack_require__(/*! ./multiclip/BuildAverageNormalsContext */ "../../core/geometry/lib/esm/polyface/multiclip/BuildAverageNormalsContext.js");
-/* harmony import */ var _multiclip_OffsetMeshContext__WEBPACK_IMPORTED_MODULE_35__ = __webpack_require__(/*! ./multiclip/OffsetMeshContext */ "../../core/geometry/lib/esm/polyface/multiclip/OffsetMeshContext.js");
+/* harmony import */ var _multiclip_BuildAverageNormalsContext__WEBPACK_IMPORTED_MODULE_33__ = __webpack_require__(/*! ./multiclip/BuildAverageNormalsContext */ "../../core/geometry/lib/esm/polyface/multiclip/BuildAverageNormalsContext.js");
+/* harmony import */ var _multiclip_OffsetMeshContext__WEBPACK_IMPORTED_MODULE_34__ = __webpack_require__(/*! ./multiclip/OffsetMeshContext */ "../../core/geometry/lib/esm/polyface/multiclip/OffsetMeshContext.js");
 /* harmony import */ var _multiclip_SweepLineStringToFacetContext__WEBPACK_IMPORTED_MODULE_14__ = __webpack_require__(/*! ./multiclip/SweepLineStringToFacetContext */ "../../core/geometry/lib/esm/polyface/multiclip/SweepLineStringToFacetContext.js");
-/* harmony import */ var _multiclip_XYPointBuckets__WEBPACK_IMPORTED_MODULE_31__ = __webpack_require__(/*! ./multiclip/XYPointBuckets */ "../../core/geometry/lib/esm/polyface/multiclip/XYPointBuckets.js");
+/* harmony import */ var _multiclip_XYPointBuckets__WEBPACK_IMPORTED_MODULE_30__ = __webpack_require__(/*! ./multiclip/XYPointBuckets */ "../../core/geometry/lib/esm/polyface/multiclip/XYPointBuckets.js");
 /* harmony import */ var _Polyface__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! ./Polyface */ "../../core/geometry/lib/esm/polyface/Polyface.js");
-/* harmony import */ var _PolyfaceBuilder__WEBPACK_IMPORTED_MODULE_17__ = __webpack_require__(/*! ./PolyfaceBuilder */ "../../core/geometry/lib/esm/polyface/PolyfaceBuilder.js");
-/* harmony import */ var _RangeLengthData__WEBPACK_IMPORTED_MODULE_30__ = __webpack_require__(/*! ./RangeLengthData */ "../../core/geometry/lib/esm/polyface/RangeLengthData.js");
+/* harmony import */ var _PolyfaceBuilder__WEBPACK_IMPORTED_MODULE_16__ = __webpack_require__(/*! ./PolyfaceBuilder */ "../../core/geometry/lib/esm/polyface/PolyfaceBuilder.js");
+/* harmony import */ var _RangeLengthData__WEBPACK_IMPORTED_MODULE_29__ = __webpack_require__(/*! ./RangeLengthData */ "../../core/geometry/lib/esm/polyface/RangeLengthData.js");
 /*---------------------------------------------------------------------------------------------
 * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
 * See LICENSE.md in the project root for license terms and full copyright notice.
@@ -251951,7 +252169,6 @@ __webpack_require__.r(__webpack_exports__);
 
 
 
-
 
 
 /**
@@ -251979,14 +252196,27 @@ class SweepLineStringToFacetsOptions {
     sideAngle;
     /** Option to assemble lines into chains. */
     assembleChains;
+    /**
+     * Optional searcher object for vertical sweep speedup. If provided, `vectorToEye` must be the positive Z vector.
+     * @example To construct a 5x5 indexed search grid:
+     * ````
+     * const xyRange = Range2d.createFrom(myPolyface.range());
+     * const searcher = GriddedRaggedRange2dSetWithOverflow.create<number>(xyRange, 5, 5)!;
+     * for (const visitor = myPolyface.createVisitor(0); visitor.moveToNextFacet();) {
+     *   searcher.addRange(visitor.point.getRange(), visitor.currentReadIndex());
+     * }
+     * ````
+     */
+    searcher;
     /** Constructor. Captures fully-checked parameters from static create method. */
-    constructor(vectorToEye, sideAngle, assembleChains, collectOnForwardFacets, collectOnSideFacets, collectOnRearFacets) {
+    constructor(vectorToEye, sideAngle, assembleChains, collectOnForwardFacets, collectOnSideFacets, collectOnRearFacets, searcher) {
         this.vectorToEye = vectorToEye;
         this.sideAngle = sideAngle;
         this.assembleChains = assembleChains;
         this.collectOnForwardFacets = collectOnForwardFacets;
         this.collectOnSideFacets = collectOnSideFacets;
         this.collectOnRearFacets = collectOnRearFacets;
+        this.searcher = searcher;
     }
     /**
      * Create an options structure.
@@ -251995,14 +252225,12 @@ class SweepLineStringToFacetsOptions {
      * * Default `assembleChains` is `true`.
      * * Default `collectOnForwardFacets`, `collectOnSideFacets`, `collectOnRearFacets` are all `true`.
      */
-    static create(vectorToEye, sideAngle, assembleChains, collectOnForwardFacets, collectOnSideFacets, collectOnRearFacets) {
-        return new SweepLineStringToFacetsOptions(vectorToEye === undefined ? _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d.unitZ() : vectorToEye.clone(), sideAngle === undefined ? _geometry3d_Angle__WEBPACK_IMPORTED_MODULE_2__.Angle.createRadians(_Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.smallAngleRadians) : sideAngle.clone(), _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.resolveValue(assembleChains, true), _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.resolveValue(collectOnForwardFacets, true), _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.resolveValue(collectOnSideFacets, true), _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.resolveValue(collectOnRearFacets, true));
+    static create(vectorToEye, sideAngle, assembleChains, collectOnForwardFacets, collectOnSideFacets, collectOnRearFacets, searcher) {
+        return new SweepLineStringToFacetsOptions((!vectorToEye || searcher) ? _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d.unitZ() : vectorToEye.clone(), sideAngle?.clone() ?? _geometry3d_Angle__WEBPACK_IMPORTED_MODULE_2__.Angle.createRadians(_Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.smallAngleRadians), assembleChains ?? true, collectOnForwardFacets ?? true, collectOnSideFacets ?? true, collectOnRearFacets ?? true, searcher);
     }
     /** Return `true` if all outputs are requested. */
     get collectAll() {
-        return this.collectOnForwardFacets === true &&
-            this.collectOnSideFacets === true &&
-            this.collectOnRearFacets === true;
+        return this.collectOnForwardFacets && this.collectOnSideFacets && this.collectOnRearFacets;
     }
     /**
      * Decide if the instance collector flags accept a facet with the given normal.
@@ -252113,21 +252341,21 @@ class PolyfaceQuery {
      * @param source polyface or visitor.
      * @param vectorToEye compute sum of (signed) facet areas projected to a view plane perpendicular to `vectorToEye`.
      * If `vectorToEye` is not provided, actual facet areas are calculated (without any projection).
-     * @returns the sum of all facet areas. Return 0 if `source` is `undefined`.
+     * @returns the sum of all facet areas.
      */
     static sumFacetAreas(source, vectorToEye) {
         let sum = 0;
-        if (source !== undefined) {
-            if (source instanceof _Polyface__WEBPACK_IMPORTED_MODULE_7__.Polyface)
-                return PolyfaceQuery.sumFacetAreas(source.createVisitor(1), vectorToEye);
-            let unitVectorToEye;
-            if (vectorToEye !== undefined)
-                unitVectorToEye = vectorToEye.normalize();
-            source.reset();
-            while (source.moveToNextFacet()) {
-                const areaNormal = _geometry3d_PolygonOps__WEBPACK_IMPORTED_MODULE_8__.PolygonOps.areaNormal(source.point.getPoint3dArray());
-                sum += unitVectorToEye ? areaNormal.dotProduct(unitVectorToEye) : areaNormal.magnitude();
-            }
+        if (source instanceof _Polyface__WEBPACK_IMPORTED_MODULE_7__.Polyface)
+            source = source.createVisitor(1);
+        else
+            source.setNumWrap(1);
+        let unitVectorToEye;
+        if (vectorToEye !== undefined)
+            unitVectorToEye = vectorToEye.normalize();
+        source.reset();
+        while (source.moveToNextFacet()) {
+            const areaNormal = _geometry3d_PolygonOps__WEBPACK_IMPORTED_MODULE_8__.PolygonOps.areaNormal(source.point.getPoint3dArray());
+            sum += unitVectorToEye ? areaNormal.dotProduct(unitVectorToEye) : areaNormal.magnitude();
         }
         return sum;
     }
@@ -252161,75 +252389,53 @@ class PolyfaceQuery {
     }
     /**
      * Sum (signed) volumes between facets and a plane.
-     * Return a structure with multiple sums:
-     * * volume = the sum of (signed) volumes between facets and the plane.
-     * * positiveProjectedFacetAreaMoments, negativeProjectedFacetAreaMoments = moment data with centroid, area, and second
-     * moments with respect to the centroid.
-     */
-    static sumVolumeBetweenFacetsAndPlane(source, plane) {
-        if (source instanceof _Polyface__WEBPACK_IMPORTED_MODULE_7__.Polyface)
-            return PolyfaceQuery.sumVolumeBetweenFacetsAndPlane(source.createVisitor(0), plane);
-        const facetOrigin = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Point3d.create();
-        const targetA = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Point3d.create();
-        const targetB = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Point3d.create();
-        const triangleNormal = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d.create();
-        const planeNormal = plane.getNormalRef();
-        let h0, hA, hB;
-        let signedVolumeSum = 0.0;
-        let signedTriangleArea;
-        let singleFacetArea;
-        const positiveAreaMomentSums = _geometry4d_MomentData__WEBPACK_IMPORTED_MODULE_9__.MomentData.create(undefined, true);
-        const negativeAreaMomentSums = _geometry4d_MomentData__WEBPACK_IMPORTED_MODULE_9__.MomentData.create(undefined, true);
-        const singleFacetProducts = _geometry4d_Matrix4d__WEBPACK_IMPORTED_MODULE_10__.Matrix4d.createZero();
-        const projectToPlane = plane.getProjectionToPlane();
-        source.reset();
+     * @param source facet set
+     * @param plane infinite plane bounding volume between the input facets and (virtual) side facets perpendicular to the plane.
+     * @param skipMoments whether to skip computation of the area moments. Set to `true` if only volume is needed. Default is `false`.
+     * @returns a structure with multiple sums:
+     * * volume: the sum of (signed) volumes between facets and the plane.
+     * * positiveProjectedFacetAreaMoments, negativeProjectedFacetAreaMoments: area moment data (centroid, signed area,
+     * and second moments with respect to the centroid), separately computed for the input facets that project with
+     * positive/negative area onto the plane.
+     */
+    static sumVolumeBetweenFacetsAndPlane(source, plane, skipMoments) {
+        const visitor = source instanceof _Polyface__WEBPACK_IMPORTED_MODULE_7__.Polyface ? source.createVisitor(0) : source;
+        visitor.setNumWrap(0);
+        const workPoint0 = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Point3d.create();
+        const workPoint1 = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Point3d.create();
+        const workVector = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d.create();
+        const workMatrix = _geometry4d_Matrix4d__WEBPACK_IMPORTED_MODULE_9__.Matrix4d.createZero();
+        let signedVolumeTimes6 = 0.0;
+        const posSums = skipMoments ? undefined : _geometry4d_MomentData__WEBPACK_IMPORTED_MODULE_10__.MomentData.create(undefined, true);
+        const negSums = skipMoments ? undefined : _geometry4d_MomentData__WEBPACK_IMPORTED_MODULE_10__.MomentData.create(undefined, true);
         // For each facet:
         // - form triangles from facet origin to each far edge.
-        // - sum signed area and volume contributions.
-        // each projected area contribution is twice the area of a triangle.
-        // each volume contribution is 3 times the actual volume -- (1/3) of the altitude sums was the centroid altitude.
-        while (source.moveToNextFacet()) {
-            source.point.getPoint3dAtUncheckedPointIndex(0, facetOrigin);
-            h0 = plane.altitude(facetOrigin);
-            singleFacetArea = 0;
-            // within a single facets, the singleFacetArea sum is accumulated with signs of individual triangles.
-            // for a non-convex facet, this can be a mixture of positive and negative areas.
-            // the absoluteProjectedAreaSum contribution is forced positive after the sum for the facet.
-            for (let i = 1; i + 1 < source.point.length; i++) {
-                source.point.getPoint3dAtUncheckedPointIndex(i, targetA);
-                source.point.getPoint3dAtUncheckedPointIndex(i + 1, targetB);
-                facetOrigin.crossProductToPoints(targetA, targetB, triangleNormal);
-                hA = plane.altitude(targetA);
-                hB = plane.altitude(targetB);
-                signedTriangleArea = planeNormal.dotProduct(triangleNormal);
-                singleFacetArea += signedTriangleArea;
-                signedVolumeSum += signedTriangleArea * (h0 + hA + hB);
-            }
-            singleFacetProducts.setZero();
-            source.point.multiplyTransformInPlace(projectToPlane);
-            _geometry3d_PolygonOps__WEBPACK_IMPORTED_MODULE_8__.PolygonOps.addSecondMomentAreaProducts(source.point, facetOrigin, singleFacetProducts);
-            if (singleFacetArea > 0) {
-                positiveAreaMomentSums.accumulateProductsFromOrigin(facetOrigin, singleFacetProducts, 1.0);
-            }
-            else {
-                negativeAreaMomentSums.accumulateProductsFromOrigin(facetOrigin, singleFacetProducts, 1.0);
+        // - sum signed area and volume contributions (for non-convex facet, signs can be mixed).
+        // - each projected area contribution is twice the area of a triangle.
+        // - each volume contribution is 3 times the actual volume -- a third of the altitude sum is the centroid altitude.
+        const options = { skipMoments, p0: workPoint0, p1: workPoint1, v0: workVector, m0: workMatrix };
+        for (visitor.reset(); visitor.moveToNextFacet();) {
+            const facetData = _geometry3d_PolygonOps__WEBPACK_IMPORTED_MODULE_8__.PolygonOps.volumeBetweenPolygonAndPlane(visitor.point, plane, options);
+            signedVolumeTimes6 += facetData.volume6;
+            if (!skipMoments) {
+                (0,_itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__.assert)(posSums !== undefined && negSums !== undefined && facetData.origin !== undefined && facetData.products !== undefined);
+                if (facetData.area2 > 0)
+                    posSums.accumulateProductsFromOrigin(facetData.origin, facetData.products, 1.0);
+                else
+                    negSums.accumulateProductsFromOrigin(facetData.origin, facetData.products, 1.0);
             }
         }
-        positiveAreaMomentSums.shiftOriginAndSumsToCentroidOfSums();
-        negativeAreaMomentSums.shiftOriginAndSumsToCentroidOfSums();
-        const positiveAreaMoments = _geometry4d_MomentData__WEBPACK_IMPORTED_MODULE_9__.MomentData.inertiaProductsToPrincipalAxes(positiveAreaMomentSums.origin, positiveAreaMomentSums.sums);
-        const negativeAreaMoments = _geometry4d_MomentData__WEBPACK_IMPORTED_MODULE_9__.MomentData.inertiaProductsToPrincipalAxes(negativeAreaMomentSums.origin, negativeAreaMomentSums.sums);
         return {
-            volume: signedVolumeSum / 6.0,
-            positiveProjectedFacetAreaMoments: positiveAreaMoments,
-            negativeProjectedFacetAreaMoments: negativeAreaMoments,
+            volume: signedVolumeTimes6 / 6.0,
+            positiveProjectedFacetAreaMoments: posSums ? _geometry4d_MomentData__WEBPACK_IMPORTED_MODULE_10__.MomentData.inertiaProductsToPrincipalAxes(posSums.origin, posSums.sums) : undefined,
+            negativeProjectedFacetAreaMoments: negSums ? _geometry4d_MomentData__WEBPACK_IMPORTED_MODULE_10__.MomentData.inertiaProductsToPrincipalAxes(negSums.origin, negSums.sums) : undefined,
         };
     }
     /** Return the inertia products [xx,xy,xz,xw,yw, etc] integrated over all all facets as viewed from origin. */
     static sumFacetSecondAreaMomentProducts(source, origin) {
         if (source instanceof _Polyface__WEBPACK_IMPORTED_MODULE_7__.Polyface)
             return PolyfaceQuery.sumFacetSecondAreaMomentProducts(source.createVisitor(0), origin);
-        const products = _geometry4d_Matrix4d__WEBPACK_IMPORTED_MODULE_10__.Matrix4d.createZero();
+        const products = _geometry4d_Matrix4d__WEBPACK_IMPORTED_MODULE_9__.Matrix4d.createZero();
         source.reset();
         while (source.moveToNextFacet()) {
             _geometry3d_PolygonOps__WEBPACK_IMPORTED_MODULE_8__.PolygonOps.addSecondMomentAreaProducts(source.point, origin, products);
@@ -252240,7 +252446,7 @@ class PolyfaceQuery {
     static sumFacetSecondVolumeMomentProducts(source, origin) {
         if (source instanceof _Polyface__WEBPACK_IMPORTED_MODULE_7__.Polyface)
             return PolyfaceQuery.sumFacetSecondVolumeMomentProducts(source.createVisitor(0), origin);
-        const products = _geometry4d_Matrix4d__WEBPACK_IMPORTED_MODULE_10__.Matrix4d.createZero();
+        const products = _geometry4d_Matrix4d__WEBPACK_IMPORTED_MODULE_9__.Matrix4d.createZero();
         source.reset();
         while (source.moveToNextFacet()) {
             _geometry3d_PolygonOps__WEBPACK_IMPORTED_MODULE_8__.PolygonOps.addSecondMomentVolumeProducts(source.point, origin, products);
@@ -252258,7 +252464,7 @@ class PolyfaceQuery {
         if (!origin)
             return undefined;
         const inertiaProducts = PolyfaceQuery.sumFacetSecondAreaMomentProducts(source, origin);
-        return _geometry4d_MomentData__WEBPACK_IMPORTED_MODULE_9__.MomentData.inertiaProductsToPrincipalAxes(origin, inertiaProducts);
+        return _geometry4d_MomentData__WEBPACK_IMPORTED_MODULE_10__.MomentData.inertiaProductsToPrincipalAxes(origin, inertiaProducts);
     }
     /**
      * Compute area moments for the mesh. In the returned MomentData:
@@ -252273,7 +252479,7 @@ class PolyfaceQuery {
         if (!origin)
             return undefined;
         const inertiaProducts = PolyfaceQuery.sumFacetSecondVolumeMomentProducts(source, origin);
-        return _geometry4d_MomentData__WEBPACK_IMPORTED_MODULE_9__.MomentData.inertiaProductsToPrincipalAxes(origin, inertiaProducts);
+        return _geometry4d_MomentData__WEBPACK_IMPORTED_MODULE_10__.MomentData.inertiaProductsToPrincipalAxes(origin, inertiaProducts);
     }
     /**
      * Determine whether all facets are convex.
@@ -252297,7 +252503,7 @@ class PolyfaceQuery {
      * Compute a number summarizing the dihedral angles in the mesh.
      * * A dihedral angle is the signed angle between adjacent facets' normals. This angle is positive when the cross
      * product `normalA x normalB` has the same direction as facetA's traversal of the facets' shared edge.
-     * @param source mesh.
+     * @param source facets.
      * @param ignoreBoundaries if `true` ignore simple boundary edges, i.e., allow unclosed meshes. Default is `false`.
      * See [[isConvexByDihedralAngleCount]] for comments about passing true when there are multiple
      * connected components.
@@ -252313,19 +252519,21 @@ class PolyfaceQuery {
     static dihedralAngleSummary(source, ignoreBoundaries = false) {
         // more info can be found at geometry/internaldocs/Polyface.md
         const edges = new _IndexedEdgeMatcher__WEBPACK_IMPORTED_MODULE_11__.IndexedEdgeMatcher();
-        const visitor = source.createVisitor(1);
-        visitor.reset();
-        // find centroid normals of all facets
+        const vertices = source instanceof _Polyface__WEBPACK_IMPORTED_MODULE_7__.Polyface ? source.data.point : undefined;
+        const visitor = source instanceof _Polyface__WEBPACK_IMPORTED_MODULE_7__.Polyface ? source.createVisitor(1) : source;
+        visitor.setNumWrap(1);
         const centroidNormal = [];
         let normalCounter = 0;
-        while (visitor.moveToNextFacet()) {
+        for (visitor.reset(); visitor.moveToNextFacet();) {
             const numEdges = visitor.pointCount - 1;
             const normal = _geometry3d_PolygonOps__WEBPACK_IMPORTED_MODULE_8__.PolygonOps.centroidAreaNormal(visitor.point);
             if (normal === undefined)
                 return -2;
             centroidNormal.push(normal);
             for (let i = 0; i < numEdges; i++) {
-                edges.addEdge(visitor.clientPointIndex(i), visitor.clientPointIndex(i + 1), normalCounter);
+                const edge = edges.addEdge(visitor.clientPointIndex(i), visitor.clientPointIndex(i + 1), normalCounter);
+                if (!vertices) // decorate if we don't have vertices to query later
+                    edge.edgeVector = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d.createStartEnd(visitor.point.getPoint3dAtUncheckedPointIndex(i), visitor.point.getPoint3dAtUncheckedPointIndex(i + 1));
             }
             normalCounter++;
         }
@@ -252343,11 +252551,16 @@ class PolyfaceQuery {
         let numNegative = 0;
         const edgeVector = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d.create();
         for (const cluster of manifoldClusters) {
-            const sideA = cluster[0];
-            const sideB = cluster[1];
-            if (sideA instanceof _IndexedEdgeMatcher__WEBPACK_IMPORTED_MODULE_11__.SortableEdge && sideB instanceof _IndexedEdgeMatcher__WEBPACK_IMPORTED_MODULE_11__.SortableEdge
-                && source.data.point.vectorIndexIndex(sideA.vertexIndexA, sideA.vertexIndexB, edgeVector)) {
-                const dihedralAngle = centroidNormal[sideA.facetIndex].direction.signedAngleTo(centroidNormal[sideB.facetIndex].direction, edgeVector);
+            if (Array.isArray(cluster) && cluster.length === 2) {
+                const sideA = cluster[0];
+                const sideB = cluster[1];
+                if (vertices)
+                    vertices.vectorIndexIndex(sideA.startVertex, sideA.endVertex, edgeVector);
+                else
+                    edgeVector.setFrom(sideA.edgeVector);
+                const facetNormalA = centroidNormal[sideA.facetIndex].direction;
+                const facetNormalB = centroidNormal[sideB.facetIndex].direction;
+                const dihedralAngle = facetNormalA.signedAngleTo(facetNormalB, edgeVector);
                 if (dihedralAngle.isAlmostZero)
                     numPlanar++;
                 else if (dihedralAngle.radians > 0.0)
@@ -252383,26 +252596,50 @@ class PolyfaceQuery {
     static isConvexByDihedralAngleCount(source, ignoreBoundaries = false) {
         return this.dihedralAngleSummary(source, ignoreBoundaries) > 0;
     }
+    /** Helper function to detect a subset visitor. */
+    static isSubsetVisitor(visitor) {
+        if (visitor instanceof _Polyface__WEBPACK_IMPORTED_MODULE_7__.Polyface)
+            return false;
+        const parentFacetCount = visitor.clientPolyface()?.facetCount;
+        const visitableFacetCount = visitor.getVisitableFacetCount?.();
+        if (parentFacetCount === undefined || visitableFacetCount === undefined)
+            return false;
+        return parentFacetCount > visitableFacetCount;
+    }
     /**
-     * Test edges pairing in `source` mesh.
-     * * For `allowSimpleBoundaries === false`, a return value of `true` means this is a closed 2-manifold surface.
-     * * For `allowSimpleBoundaries === true`, a return value of `true` means this is a 2-manifold surface which may have
-     * a boundary, but is still properly matched internally.
+     * Faster version of isPolyfaceManifold for specific input.
+     * @returns whether the mesh is manifold, or undefined if unsuccessful.
+     */
+    static isPolyfaceManifoldFast(source, allowSimpleBoundaries) {
+        if (allowSimpleBoundaries)
+            return undefined; // edgeMateIndex does not distinguish boundary edges from non-manifold edges so we can only speed things up if we search for both
+        if (this.isSubsetVisitor(source))
+            return false; // edgeMateIndex doesn't capture the facet subset boundary
+        const parentData = _Polyface__WEBPACK_IMPORTED_MODULE_7__.IndexedPolyface.hasEdgeMateIndex(source);
+        if (!parentData)
+            return undefined;
+        for (const edgeMate of parentData.edgeMateIndex) {
+            if (edgeMate === undefined)
+                return false; // found a boundary or non-manifold edge
+        }
+        return true; // this is a 2-manifold closed surface
+    }
+    /**
+     * Test edge pairing in `source` mesh.
      * * Any edge with 3 or more adjacent facets triggers `false` return.
-     * * Any edge with 2 adjacent facets in the same direction triggers a `false` return.
+     * * Any edge with 2 adjacent facets in the same direction triggers `false` return.
+     * * Null edges are ignored.
+     * @param source facet set to examine
+     * @param allowSimpleBoundaries if `false` (default), a return value of `true` means the facets form a closed
+     * 2-manifold surface; if `true`, a return value of `true` means the facets form a 2-manifold surface which may
+     * have a boundary, but is still properly matched internally.
     */
     static isPolyfaceManifold(source, allowSimpleBoundaries = false) {
-        const edges = new _IndexedEdgeMatcher__WEBPACK_IMPORTED_MODULE_11__.IndexedEdgeMatcher();
-        const visitor = source.createVisitor(1);
-        visitor.reset();
-        while (visitor.moveToNextFacet()) {
-            const numEdges = visitor.pointCount - 1;
-            for (let i = 0; i < numEdges; i++) {
-                edges.addEdge(visitor.clientPointIndex(i), visitor.clientPointIndex(i + 1), visitor.currentReadIndex());
-            }
-        }
+        const isManifold = this.isPolyfaceManifoldFast(source, allowSimpleBoundaries);
+        if (isManifold !== undefined)
+            return isManifold;
         const badClusters = [];
-        edges.sortAndCollectClusters(undefined, allowSimpleBoundaries ? undefined : badClusters, undefined, badClusters);
+        this.createIndexedEdges(source).sortAndCollectClusters(undefined, allowSimpleBoundaries ? undefined : badClusters, undefined, badClusters);
         return badClusters.length === 0;
     }
     /** Test if the facets in `source` occur in perfectly mated pairs, as is required for a closed manifold volume. */
@@ -252410,50 +252647,107 @@ class PolyfaceQuery {
         return this.isPolyfaceManifold(source, false);
     }
     /**
-     * Test if the facets in `source` occur in perfectly mated pairs, as is required for a closed manifold volume.
-     * If not, extract the boundary edges as lines.
+     * Faster version of announceBoundaryEdges for specific input.
+     * @returns true if successfully announced boundary edges.
+     */
+    static announceBoundaryEdgesFast(source, announceEdge, includeTypical, includeMismatch, includeNull) {
+        if (includeTypical !== includeMismatch)
+            return false; // edgeMateIndex does not distinguish boundary edges from non-manifold edges
+        if (!includeTypical && !includeNull)
+            return true;
+        if (this.isSubsetVisitor(source))
+            return false; // edgeMateIndex doesn't capture the facet subset boundary
+        const parentData = _Polyface__WEBPACK_IMPORTED_MODULE_7__.IndexedPolyface.hasEdgeMateIndex(source);
+        if (!parentData)
+            return false;
+        const pointA = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Point3d.create();
+        const pointB = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Point3d.create();
+        for (let edgeIndex = 0; edgeIndex < parentData.edgeMateIndex.length; edgeIndex++) {
+            const edgeMate = parentData.edgeMateIndex[edgeIndex];
+            const announceBoundaryOrNonManifoldEdge = includeTypical && edgeMate === undefined;
+            const announceNullEdge = includeNull && edgeMate === edgeIndex;
+            if (announceBoundaryOrNonManifoldEdge || announceNullEdge) {
+                const facetIndex = parentData.parent.edgeIndexToFacetIndex(edgeIndex);
+                if (facetIndex !== undefined) { // should always be defined
+                    const pointIndexA = parentData.parent.data.pointIndex[edgeIndex];
+                    let nextEdgeIndex = edgeIndex + 1;
+                    if (nextEdgeIndex >= parentData.parent.facetIndex1(facetIndex))
+                        nextEdgeIndex = parentData.parent.facetIndex0(facetIndex);
+                    const pointIndexB = parentData.parent.data.pointIndex[nextEdgeIndex];
+                    parentData.parent.data.getPoint(pointIndexA, pointA);
+                    parentData.parent.data.getPoint(pointIndexB, pointB);
+                    announceEdge(pointA, pointB, pointIndexA, pointIndexB, facetIndex);
+                }
+            }
+        }
+        return true;
+    }
+    /**
+     * Announce boundary edges of the facet set as line segments.
      * @param source polyface or visitor.
      * @param announceEdge function to be called with each boundary edge. The announcement is start and end points,
-     * start and end indices, and facet index.
-     * @param includeTypical true to announce typical boundary edges with a single adjacent facet.
-     * @param includeMismatch true to announce edges with more than 2 adjacent facets.
-     * @param includeNull true to announce edges with identical start and end vertex indices.
+     * start and end vertex indices, and facet index.
+     * @param includeTypical true to announce typical boundary edges with a single adjacent facet. Default is true.
+     * @param includeMismatch true to announce non-manifold edges (more than 2 adjacent facets, or mismatched
+     * orientations). Default is true.
+     * @param includeNull true to announce edges with identical start and end vertex indices. Default is true.
+     * @see [[announceBoundaryChainsAsLineString3d]] for boundary linestring announcement
+     * @see [[collectBoundaryEdges]] for boundary chain collection
+     * @see [[boundaryEdges]] for boundary edge collection
      */
     static announceBoundaryEdges(source, announceEdge, includeTypical = true, includeMismatch = true, includeNull = true) {
-        if (source === undefined || (!includeTypical && !includeMismatch && !includeNull))
+        if (this.announceBoundaryEdgesFast(source, announceEdge, includeTypical, includeMismatch, includeNull))
             return;
-        const edges = new _IndexedEdgeMatcher__WEBPACK_IMPORTED_MODULE_11__.IndexedEdgeMatcher();
+        if (!includeTypical && !includeMismatch && !includeNull)
+            return;
+        const vertices = source instanceof _Polyface__WEBPACK_IMPORTED_MODULE_7__.Polyface ? source.data.point : undefined;
         const visitor = source instanceof _Polyface__WEBPACK_IMPORTED_MODULE_7__.Polyface ? source.createVisitor(1) : source;
         visitor.setNumWrap(1);
-        visitor.reset();
-        while (visitor.moveToNextFacet()) {
+        const edges = new _IndexedEdgeMatcher__WEBPACK_IMPORTED_MODULE_11__.IndexedEdgeMatcher();
+        for (visitor.reset(); visitor.moveToNextFacet();) {
             const numEdges = visitor.pointCount - 1;
             for (let i = 0; i < numEdges; i++) {
-                edges.addEdge(visitor.clientPointIndex(i), visitor.clientPointIndex(i + 1), visitor.currentReadIndex());
+                const edge = edges.addEdge(visitor.clientPointIndex(i), visitor.clientPointIndex(i + 1), visitor.currentReadIndex());
+                if (!vertices) { // decorate if we don't have vertices to query later
+                    edge.pointA = visitor.point.getPoint3dAtUncheckedPointIndex(i);
+                    edge.pointB = visitor.point.getPoint3dAtUncheckedPointIndex(i + 1);
+                }
             }
         }
         const boundaryEdges = [];
-        edges.sortAndCollectClusters(undefined, includeTypical ? boundaryEdges : undefined, includeNull ? boundaryEdges : undefined, includeMismatch ? boundaryEdges : undefined);
+        const typicalEdges = includeTypical ? boundaryEdges : undefined;
+        const nullEdges = includeNull ? boundaryEdges : undefined;
+        const mismatchEdges = includeMismatch ? boundaryEdges : undefined;
+        edges.sortAndCollectClusters(undefined, typicalEdges, nullEdges, mismatchEdges);
         if (boundaryEdges.length === 0)
             return;
-        const sourcePolyface = visitor.clientPolyface();
         const pointA = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Point3d.create();
         const pointB = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Point3d.create();
         for (const e of boundaryEdges) {
-            const e1 = e instanceof _IndexedEdgeMatcher__WEBPACK_IMPORTED_MODULE_11__.SortableEdge ? e : e[0];
-            const indexA = e1.vertexIndexA;
-            const indexB = e1.vertexIndexB;
-            if (sourcePolyface.data.getPoint(indexA, pointA) && sourcePolyface.data.getPoint(indexB, pointB))
-                announceEdge(pointA, pointB, indexA, indexB, e1.facetIndex);
+            const e1 = e instanceof _IndexedEdgeMatcher__WEBPACK_IMPORTED_MODULE_11__.SortableEdge ? e : e[0]; // only report the first edge in a cluster!
+            const indexA = e1.startVertex;
+            const indexB = e1.endVertex;
+            if (vertices) {
+                vertices.getPoint3dAtUncheckedPointIndex(indexA, pointA);
+                vertices.getPoint3dAtUncheckedPointIndex(indexB, pointB);
+            }
+            else {
+                pointA.setFrom(e1.pointA);
+                pointB.setFrom(e1.pointB);
+            }
+            announceEdge(pointA, pointB, indexA, indexB, e1.facetIndex);
         }
     }
     /**
-     * Construct a CurveCollection containing boundary edges.
-     * * Each edge is a LineSegment3d.
+     * Collect boundary edges of the facet set as an unordered collection of line segments.
      * @param source polyface or visitor.
-     * @param includeTypical true to in include typical boundary edges with a single adjacent facet.
-     * @param includeMismatch true to include edges with more than 2 adjacent facets.
-     * @param includeNull true to include edges with identical start and end vertex indices.
+     * @param includeTypical true to include typical boundary edges with a single adjacent facet. Default is true.
+     * @param includeMismatch true to include non-manifold edges (more than 2 adjacent facets, or mismatched
+     * orientations). Default is true.
+     * @param includeNull true to include edges with identical start and end vertex indices. Default is true.
+     * @see [[announceBoundaryChainsAsLineString3d]] for boundary linestring announcement
+     * @see [[collectBoundaryEdges]] for boundary chain collection
+     * @see [[announceBoundaryEdges]] for boundary edge announcement
      */
     static boundaryEdges(source, includeTypical = true, includeMismatch = true, includeNull = true) {
         const result = new _curve_CurveCollection__WEBPACK_IMPORTED_MODULE_6__.BagOfCurves();
@@ -252466,33 +252760,32 @@ class PolyfaceQuery {
         return result;
     }
     /**
-     * Collect boundary edges.
-     * * Return the edges as the simplest collection of chains of line segments.
+     * Collect boundary edges of the facet set as the simplest collection of chains of line segments.
      * @param source polyface or visitor.
-     * @param includeTypical true to include typical boundary edges with a single adjacent facet.
-     * @param includeMismatch true to include edges with more than 2 adjacent facets.
-     * @param includeNull true to include edges with identical start and end vertex indices.
+     * @param includeTypical true to include typical boundary edges with a single adjacent facet. Default is true.
+     * @param includeMismatch true to include non-manifold edges (more than 2 adjacent facets, or mismatched
+     * orientations). Default is true.
+     * @param includeNull true to include edges with identical start and end vertex indices. Default is true.
+     * @see [[announceBoundaryChainsAsLineString3d]] for boundary linestring announcement
+     * @see [[announceBoundaryEdges]] for boundary edge announcement
+     * @see [[boundaryEdges]] for boundary edge collection
      */
     static collectBoundaryEdges(source, includeTypical = true, includeMismatch = true, includeNull = true) {
         const collector = new _curve_internalContexts_MultiChainCollector__WEBPACK_IMPORTED_MODULE_13__.MultiChainCollector(_Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.smallMetricDistance, _Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.smallMetricDistance);
-        PolyfaceQuery.announceBoundaryEdges(source, (ptA, ptB) => collector.captureCurve(_curve_LineSegment3d__WEBPACK_IMPORTED_MODULE_12__.LineSegment3d.create(ptA, ptB)), includeTypical, includeMismatch, includeNull);
+        const announceEdge = (ptA, ptB) => collector.captureCurve(_curve_LineSegment3d__WEBPACK_IMPORTED_MODULE_12__.LineSegment3d.create(ptA, ptB));
+        PolyfaceQuery.announceBoundaryEdges(source, announceEdge, includeTypical, includeMismatch, includeNull);
         return collector.grabResult(true);
     }
     /**
-     * Load all half edges from a mesh to an IndexedEdgeMatcher.
-     * @param polyface a mesh or a visitor assumed to have numWrap === 1.
-    */
+     * Load an IndexedEdgeMatcher from the edges of a mesh.
+     * @param polyface a mesh or visitor
+     */
     static createIndexedEdges(polyface) {
-        if (polyface instanceof _Polyface__WEBPACK_IMPORTED_MODULE_7__.Polyface)
-            return this.createIndexedEdges(polyface.createVisitor(1));
         const edges = new _IndexedEdgeMatcher__WEBPACK_IMPORTED_MODULE_11__.IndexedEdgeMatcher();
-        polyface.reset();
-        while (polyface.moveToNextFacet()) {
-            const numEdges = polyface.pointCount - 1;
-            for (let i = 0; i < numEdges; i++) {
-                edges.addEdge(polyface.clientPointIndex(i), polyface.clientPointIndex(i + 1), polyface.currentReadIndex());
-            }
-        }
+        const visitor = polyface instanceof _Polyface__WEBPACK_IMPORTED_MODULE_7__.Polyface ? polyface.createVisitor(1) : polyface;
+        visitor.setNumWrap(1);
+        for (visitor.reset(); visitor.moveToNextFacet();)
+            edges.addPath(visitor.pointIndex, visitor.currentReadIndex(), false);
         return edges;
     }
     /**
@@ -252528,8 +252821,8 @@ class PolyfaceQuery {
         for (const pair of manifoldEdges) {
             if (!Array.isArray(pair) || pair.length !== 2)
                 continue;
-            const indexA = pair[0].vertexIndexA;
-            const indexB = pair[0].vertexIndexB;
+            const indexA = pair[0].startVertex;
+            const indexB = pair[0].endVertex;
             if (!mesh.data.getPoint(indexA, pointA) || !mesh.data.getPoint(indexB, pointB))
                 continue;
             const face0 = analyzeFace(pair[0].facetIndex);
@@ -252704,7 +252997,7 @@ class PolyfaceQuery {
     }
     /**
      * Return the boundary of facets that are facing the eye.
-     * @param polyface the indexed polyface
+     * @param source polyface or visitor. Must be capable of constructing a subset visitor.
      * @param visibilitySubset selector among the visible facet sets extracted by partitionFacetIndicesByVisibilityVector
      *   * 0 ==> forward facing
      *   * 1 ==> rear facing
@@ -252712,21 +253005,29 @@ class PolyfaceQuery {
      * @param vectorToEye the vector to eye
      * @param sideAngleTolerance the tolerance of side angle
      */
-    static boundaryOfVisibleSubset(polyface, visibilitySelect, vectorToEye, sideAngleTolerance = _geometry3d_Angle__WEBPACK_IMPORTED_MODULE_2__.Angle.createDegrees(1.0e-3)) {
-        const partitionedIndices = this.partitionFacetIndicesByVisibilityVector(polyface, vectorToEye, sideAngleTolerance);
+    static boundaryOfVisibleSubset(source, visibilitySelect, vectorToEye, sideAngleTolerance = _geometry3d_Angle__WEBPACK_IMPORTED_MODULE_2__.Angle.createDegrees(1.0e-3)) {
+        const visitor = source instanceof _Polyface__WEBPACK_IMPORTED_MODULE_7__.Polyface ? source.createVisitor(0) : source;
+        if (!visitor.createSubsetVisitor)
+            return undefined;
+        const partitionedIndices = this.partitionFacetIndicesByVisibilityVector(source, vectorToEye, sideAngleTolerance);
         if (partitionedIndices[visibilitySelect].length === 0)
             return undefined;
-        const visitor = _IndexedPolyfaceVisitor__WEBPACK_IMPORTED_MODULE_16__.IndexedPolyfaceSubsetVisitor.createSubsetVisitor(polyface, partitionedIndices[visibilitySelect], 1);
-        return this.boundaryEdges(visitor, true, false, false);
+        const subsetVisitor = visitor.createSubsetVisitor(partitionedIndices[visibilitySelect], 1);
+        return this.boundaryEdges(subsetVisitor, true, false, false);
     }
     /**
-     * Search for edges with only 1 adjacent facet.
-     * * Accumulate them into chains.
-     * * Emit the chains to the `announceChain` callback.
+     * Announce boundary edges of the facet set as linestrings.
+     * * Ignores non-manifold interior edges and null edges.
+     * @param source polyface or visitor.
+     * @param announceChain function to be called with each chain of boundary edges.
+     * @see [[collectBoundaryEdges]] for boundary chain collection
+     * @see [[announceBoundaryEdges]] for boundary edge announcement
+     * @see [[boundaryEdges]] for boundary edge collection
      */
-    static announceBoundaryChainsAsLineString3d(mesh, announceChain) {
+    static announceBoundaryChainsAsLineString3d(source, announceChain) {
         const collector = new _curve_internalContexts_MultiChainCollector__WEBPACK_IMPORTED_MODULE_13__.MultiChainCollector(_Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.smallMetricDistance); // no planarity tolerance needed
-        PolyfaceQuery.announceBoundaryEdges(mesh, (pointA, pointB, _indexA, _indexB) => collector.captureCurve(_curve_LineSegment3d__WEBPACK_IMPORTED_MODULE_12__.LineSegment3d.create(pointA, pointB)), true, false, false);
+        const announceEdge = (ptA, ptB) => collector.captureCurve(_curve_LineSegment3d__WEBPACK_IMPORTED_MODULE_12__.LineSegment3d.create(ptA, ptB));
+        PolyfaceQuery.announceBoundaryEdges(source, announceEdge, true, false, false);
         collector.announceChainsAsLineString3d(announceChain);
     }
     /**
@@ -252743,7 +253044,7 @@ class PolyfaceQuery {
         const numFacets = PolyfaceQuery.visitorClientFacetCount(mesh);
         const smoothEdges = PolyfaceQuery.collectEdgesByDihedralAngle(mesh, maxSmoothEdgeAngle);
         const partitions = PolyfaceQuery.partitionFacetIndicesBySortableEdgeClusters(smoothEdges, numFacets);
-        const builder = _PolyfaceBuilder__WEBPACK_IMPORTED_MODULE_17__.PolyfaceBuilder.create();
+        const builder = _PolyfaceBuilder__WEBPACK_IMPORTED_MODULE_16__.PolyfaceBuilder.create();
         const visitor = mesh;
         const planarPartitions = [];
         const partitionNormals = []; // average normal in each nontrivial partition
@@ -252763,7 +253064,7 @@ class PolyfaceQuery {
                         if (_geometry3d_PolygonOps__WEBPACK_IMPORTED_MODULE_8__.PolygonOps.areaNormalGo(visitor.point, normal))
                             averageNormal.addInPlace(normal);
                 }
-                partitionNormals.push(_geometry3d_Ray3d__WEBPACK_IMPORTED_MODULE_18__.Ray3d.createCapture(point0, averageNormal));
+                partitionNormals.push(_geometry3d_Ray3d__WEBPACK_IMPORTED_MODULE_17__.Ray3d.createCapture(point0, averageNormal));
                 planarPartitions.push(partition);
             }
         }
@@ -252772,8 +253073,8 @@ class PolyfaceQuery {
         (0,_itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__.assert)(planarPartitions.length === fragmentPolyfaces.length);
         const gapTolerance = 1.0e-4;
         const planarityTolerance = 1.0e-4;
-        const localToWorld = _geometry3d_Transform__WEBPACK_IMPORTED_MODULE_19__.Transform.createIdentity();
-        const worldToLocal = _geometry3d_Transform__WEBPACK_IMPORTED_MODULE_19__.Transform.createIdentity();
+        const localToWorld = _geometry3d_Transform__WEBPACK_IMPORTED_MODULE_18__.Transform.createIdentity();
+        const worldToLocal = _geometry3d_Transform__WEBPACK_IMPORTED_MODULE_18__.Transform.createIdentity();
         for (let i = 0; i < fragmentPolyfaces.length; ++i) {
             const fragment = fragmentPolyfaces[i];
             const edges = [];
@@ -252782,7 +253083,7 @@ class PolyfaceQuery {
                 edges.push(_curve_LineSegment3d__WEBPACK_IMPORTED_MODULE_12__.LineSegment3d.create(pointA, pointB));
                 edgeStrings.push([pointA.clone(), pointB.clone()]);
             }, true, false, false);
-            const chains = _curve_CurveOps__WEBPACK_IMPORTED_MODULE_20__.CurveOps.collectChains(edges, gapTolerance, planarityTolerance);
+            const chains = _curve_CurveOps__WEBPACK_IMPORTED_MODULE_19__.CurveOps.collectChains(edges, gapTolerance, planarityTolerance);
             if (chains) {
                 // avoid FrameBuilder: it can flip the normal of a nonconvex facet!
                 partitionNormals[i].toRigidZFrame(localToWorld);
@@ -252792,11 +253093,11 @@ class PolyfaceQuery {
                     // But we aren't triangulating here. So if we don't have holes, we can skip regularization
                     // to avoid splitting the loop.
                     const regularize = !(chains instanceof _curve_Loop__WEBPACK_IMPORTED_MODULE_5__.Loop);
-                    const graph = _topology_Merging__WEBPACK_IMPORTED_MODULE_21__.HalfEdgeGraphMerge.formGraphFromChains(edgeStrings, regularize, _topology_Graph__WEBPACK_IMPORTED_MODULE_22__.HalfEdgeMask.BOUNDARY_EDGE);
+                    const graph = _topology_Merging__WEBPACK_IMPORTED_MODULE_20__.HalfEdgeGraphMerge.formGraphFromChains(edgeStrings, regularize, _topology_Graph__WEBPACK_IMPORTED_MODULE_21__.HalfEdgeMask.BOUNDARY_EDGE);
                     if (graph) {
-                        _topology_HalfEdgeGraphSearch__WEBPACK_IMPORTED_MODULE_23__.HalfEdgeGraphSearch.collectConnectedComponentsWithExteriorParityMasks(graph, new _topology_HalfEdgeGraphSearch__WEBPACK_IMPORTED_MODULE_23__.HalfEdgeMaskTester(_topology_Graph__WEBPACK_IMPORTED_MODULE_22__.HalfEdgeMask.BOUNDARY_EDGE), _topology_Graph__WEBPACK_IMPORTED_MODULE_22__.HalfEdgeMask.EXTERIOR);
+                        _topology_HalfEdgeGraphSearch__WEBPACK_IMPORTED_MODULE_22__.HalfEdgeGraphSearch.collectConnectedComponentsWithExteriorParityMasks(graph, new _topology_HalfEdgeGraphSearch__WEBPACK_IMPORTED_MODULE_22__.HalfEdgeMaskTester(_topology_Graph__WEBPACK_IMPORTED_MODULE_21__.HalfEdgeMask.BOUNDARY_EDGE), _topology_Graph__WEBPACK_IMPORTED_MODULE_21__.HalfEdgeMask.EXTERIOR);
                         // this.purgeNullFaces(HalfEdgeMask.EXTERIOR);
-                        const polyface1 = _PolyfaceBuilder__WEBPACK_IMPORTED_MODULE_17__.PolyfaceBuilder.graphToPolyface(graph);
+                        const polyface1 = _PolyfaceBuilder__WEBPACK_IMPORTED_MODULE_16__.PolyfaceBuilder.graphToPolyface(graph);
                         builder.addIndexedPolyface(polyface1, false, localToWorld);
                     }
                 }
@@ -252822,7 +253123,7 @@ class PolyfaceQuery {
     static fillSimpleHoles(mesh, options, unfilledChains) {
         if (mesh instanceof _Polyface__WEBPACK_IMPORTED_MODULE_7__.Polyface)
             return this.fillSimpleHoles(mesh.createVisitor(0), options, unfilledChains);
-        const builder = _PolyfaceBuilder__WEBPACK_IMPORTED_MODULE_17__.PolyfaceBuilder.create();
+        const builder = _PolyfaceBuilder__WEBPACK_IMPORTED_MODULE_16__.PolyfaceBuilder.create();
         const chains = [];
         PolyfaceQuery.announceBoundaryChainsAsLineString3d(mesh, (ls) => { ls.reverseInPlace(); chains.push(ls); });
         for (const c of chains) {
@@ -252832,11 +253133,11 @@ class PolyfaceQuery {
                 rejected = true;
             else if (options.maxEdgesAroundHole !== undefined && points.length > options.maxEdgesAroundHole)
                 rejected = true;
-            else if (options.maxPerimeter !== undefined && _geometry3d_PointHelpers__WEBPACK_IMPORTED_MODULE_24__.Point3dArray.sumEdgeLengths(points, false) > options.maxPerimeter)
+            else if (options.maxPerimeter !== undefined && _geometry3d_PointHelpers__WEBPACK_IMPORTED_MODULE_23__.Point3dArray.sumEdgeLengths(points, false) > options.maxPerimeter)
                 rejected = true;
             else if (options.upVector !== undefined && _geometry3d_PolygonOps__WEBPACK_IMPORTED_MODULE_8__.PolygonOps.sumTriangleAreasPerpendicularToUpVector(points, options.upVector) <= 0.0)
                 rejected = true;
-            if (!rejected && _topology_SpaceTriangulation__WEBPACK_IMPORTED_MODULE_25__.SpacePolygonTriangulation.triangulateSimplestSpaceLoop(points, (_loop, triangles) => {
+            if (!rejected && _topology_SpaceTriangulation__WEBPACK_IMPORTED_MODULE_24__.SpacePolygonTriangulation.triangulateSimplestSpaceLoop(points, (_loop, triangles) => {
                 for (const t of triangles)
                     builder.addPolygon(t);
             })) {
@@ -252860,13 +253161,13 @@ class PolyfaceQuery {
         }
         polyface.setNumWrap(0);
         const polyfaces = [];
-        const options = _curve_StrokeOptions__WEBPACK_IMPORTED_MODULE_26__.StrokeOptions.createForFacets();
+        const options = _curve_StrokeOptions__WEBPACK_IMPORTED_MODULE_25__.StrokeOptions.createForFacets();
         options.needNormals = polyface.normal !== undefined;
         options.needParams = polyface.param !== undefined;
         options.needColors = polyface.color !== undefined;
         options.needTwoSided = polyface.twoSided;
         for (const partition of partitions) {
-            const builder = _PolyfaceBuilder__WEBPACK_IMPORTED_MODULE_17__.PolyfaceBuilder.create(options);
+            const builder = _PolyfaceBuilder__WEBPACK_IMPORTED_MODULE_16__.PolyfaceBuilder.create(options);
             polyface.reset();
             for (const facetIndex of partition) {
                 polyface.moveToReadIndex(facetIndex);
@@ -252882,12 +253183,12 @@ class PolyfaceQuery {
             return this.cloneFiltered(source.createVisitor(0), filter);
         }
         source.setNumWrap(0);
-        const options = _curve_StrokeOptions__WEBPACK_IMPORTED_MODULE_26__.StrokeOptions.createForFacets();
+        const options = _curve_StrokeOptions__WEBPACK_IMPORTED_MODULE_25__.StrokeOptions.createForFacets();
         options.needNormals = source.normal !== undefined;
         options.needParams = source.param !== undefined;
         options.needColors = source.color !== undefined;
         options.needTwoSided = source.twoSided;
-        const builder = _PolyfaceBuilder__WEBPACK_IMPORTED_MODULE_17__.PolyfaceBuilder.create(options);
+        const builder = _PolyfaceBuilder__WEBPACK_IMPORTED_MODULE_16__.PolyfaceBuilder.create(options);
         source.reset();
         for (; source.moveToNextFacet();) {
             if (filter(source))
@@ -252899,12 +253200,12 @@ class PolyfaceQuery {
     static cloneWithDanglingEdgesRemoved(source) {
         if (source instanceof _Polyface__WEBPACK_IMPORTED_MODULE_7__.Polyface)
             return this.cloneWithDanglingEdgesRemoved(source.createVisitor(0));
-        const options = _curve_StrokeOptions__WEBPACK_IMPORTED_MODULE_26__.StrokeOptions.createForFacets();
+        const options = _curve_StrokeOptions__WEBPACK_IMPORTED_MODULE_25__.StrokeOptions.createForFacets();
         options.needNormals = source.normal !== undefined;
         options.needParams = source.param !== undefined;
         options.needColors = source.color !== undefined;
         options.needTwoSided = source.twoSided;
-        const builder = _PolyfaceBuilder__WEBPACK_IMPORTED_MODULE_17__.PolyfaceBuilder.create(options);
+        const builder = _PolyfaceBuilder__WEBPACK_IMPORTED_MODULE_16__.PolyfaceBuilder.create(options);
         // Finds an odd palindrome in data as indexed by indices.
         // An odd palindrome in a face loop corresponds to dangling edges in the face.
         // If one is found, indices is mutated to excise the palindrome (data is untouched).
@@ -253062,7 +253363,7 @@ class PolyfaceQuery {
      * * Input facets are ASSUMED to be convex and planar, and not overlap in the z direction.
      */
     static sweepLineStringToFacetsXYReturnSweptFacets(lineStringPoints, polyface) {
-        const builder = _PolyfaceBuilder__WEBPACK_IMPORTED_MODULE_17__.PolyfaceBuilder.create();
+        const builder = _PolyfaceBuilder__WEBPACK_IMPORTED_MODULE_16__.PolyfaceBuilder.create();
         this.announceSweepLinestringToConvexPolyfaceXY(lineStringPoints, polyface, (_linestring, _segmentIndex, _polyface, _facetIndex, points) => {
             if (points.length === 4)
                 builder.addQuadFacet(points);
@@ -253076,89 +253377,94 @@ class PolyfaceQuery {
         return this.sweepLineStringToFacetsXYReturnSweptFacets(linestringPoints, polyface);
     }
     /**
-     * Sweep the line string to intersections with a mesh.
-     * * Return collected line segments.
-     * * If no options are given, the default sweep direction is the z-axis, and chains are assembled and returned.
-     * * See [[SweepLineStringToFacetsOptions]] for input and output options, including filtering by forward/side/rear facets.
+     * Sweep the line string to intersections with a mesh and return collected line segments.
      * * Facets are ASSUMED to be convex and planar, and not overlap in the sweep direction.
-     */
-    static sweepLineStringToFacets(linestringPoints, polyfaceOrVisitor, options) {
+     * @param points the linestring to drape onto the mesh.
+     * @param source target facet set. For best results, facets should be convex and planar.
+     * @param options input, filtering, search, and output options.
+     * * If `undefined`, the default sweep direction is the positive z-axis, and chains are assembled and returned.
+     * * For faster _vertical_ sweep, a pre-computed range tree can be supplied in `options.searcher`.
+     * * For faster _non-vertical_ sweep, first transform inputs with the inverse of the transform
+     * `T = Transform.createRigidFromOriginAndVector(undefined, options.vectorToEye)`, construct the searcher on these
+     * local facets, call `sweepLineStringToFacets/XY` with these local inputs (and default sweep direction), and lastly,
+     * transform the returned draped linework back to world coordinates with `T`.
+     */
+    static sweepLineStringToFacets(points, source, options) {
         let result = [];
-        // setup default options
         if (options === undefined)
-            options = SweepLineStringToFacetsOptions.create(_geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d.unitZ(), _geometry3d_Angle__WEBPACK_IMPORTED_MODULE_2__.Angle.createRadians(_Geometry__WEBPACK_IMPORTED_MODULE_3__.Geometry.smallAngleRadians), // tight geometry tolerance for vertical side facets
-            true, true, true, true);
+            options = SweepLineStringToFacetsOptions.create();
         let chainContext;
         if (options.assembleChains)
-            chainContext = _topology_ChainMerge__WEBPACK_IMPORTED_MODULE_27__.ChainMergeContext.create();
-        const context = _multiclip_SweepLineStringToFacetContext__WEBPACK_IMPORTED_MODULE_14__.ClipSweptLineStringContext.create(linestringPoints, options.vectorToEye);
-        if (context) {
-            let visitor;
-            if (polyfaceOrVisitor instanceof _Polyface__WEBPACK_IMPORTED_MODULE_7__.Polyface)
-                visitor = polyfaceOrVisitor.createVisitor(0);
-            else
-                visitor = polyfaceOrVisitor;
-            const workNormal = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d.createZero();
-            for (visitor.reset(); visitor.moveToNextFacet();) {
-                if (options.collectFromThisFacetNormal(_geometry3d_PolygonOps__WEBPACK_IMPORTED_MODULE_8__.PolygonOps.areaNormalGo(visitor.point, workNormal))) {
-                    context.processPolygon(visitor.point.getArray(), (pointA, pointB) => {
-                        if (chainContext !== undefined)
-                            chainContext.addSegment(pointA, pointB);
-                        else
-                            result.push(_curve_LineSegment3d__WEBPACK_IMPORTED_MODULE_12__.LineSegment3d.create(pointA, pointB));
-                    });
+            chainContext = _topology_ChainMerge__WEBPACK_IMPORTED_MODULE_26__.ChainMergeContext.create();
+        const addSegment = chainContext ? (ptA, ptB) => chainContext.addSegment(ptA, ptB) : (ptA, ptB) => result.push(_curve_LineSegment3d__WEBPACK_IMPORTED_MODULE_12__.LineSegment3d.create(ptA, ptB));
+        const workNormal = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d.createZero();
+        const visitor = source instanceof _Polyface__WEBPACK_IMPORTED_MODULE_7__.Polyface ? source.createVisitor(0) : source;
+        visitor.setNumWrap(0);
+        if (options.searcher && options.vectorToEye.isParallelTo(_geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d.unitZ())) {
+            const searchRange = _geometry3d_Range__WEBPACK_IMPORTED_MODULE_27__.Range3d.createNull();
+            const workPoint0 = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Point3d.createZero();
+            const workPoint1 = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Point3d.createZero();
+            let edgeClipper;
+            const clipEdgeToConvexPolygon = (_facetRange, readIndex) => {
+                if (visitor.moveToReadIndex(readIndex) && (options.collectAll || options.collectFromThisFacetNormal(_geometry3d_PolygonOps__WEBPACK_IMPORTED_MODULE_8__.PolygonOps.areaNormalGo(visitor.point, workNormal))))
+                    edgeClipper?.processPolygon(visitor.point, (ptA, ptB) => addSegment(ptA, ptB));
+                return true;
+            };
+            for (let i = 1; i < points.length; i++) {
+                points.getPoint3dAtUncheckedPointIndex(i - 1, workPoint0);
+                points.getPoint3dAtUncheckedPointIndex(i, workPoint1);
+                if (edgeClipper = _multiclip_SweepLineStringToFacetContext__WEBPACK_IMPORTED_MODULE_14__.EdgeClipData.createPointPointSweep(workPoint0, workPoint1, options.vectorToEye)) {
+                    searchRange.setNull();
+                    searchRange.extend(workPoint0, workPoint1);
+                    options.searcher.searchRange2d(searchRange, clipEdgeToConvexPolygon);
                 }
             }
-            if (chainContext !== undefined) {
-                chainContext.clusterAndMergeVerticesXYZ();
-                result = chainContext.collectMaximalChains();
+        }
+        else {
+            const context = _multiclip_SweepLineStringToFacetContext__WEBPACK_IMPORTED_MODULE_14__.ClipSweptLineStringContext.create(points, options.vectorToEye);
+            if (context) {
+                for (visitor.reset(); visitor.moveToNextFacet();) {
+                    if (options.collectAll || options.collectFromThisFacetNormal(_geometry3d_PolygonOps__WEBPACK_IMPORTED_MODULE_8__.PolygonOps.areaNormalGo(visitor.point, workNormal)))
+                        context.processPolygon(visitor.point.getArray(), addSegment);
+                }
             }
         }
+        if (chainContext) {
+            chainContext.clusterAndMergeVerticesXYZ();
+            result = chainContext.collectMaximalChains();
+        }
         return result;
     }
     /**
      * Sweep the line string in the z-direction to intersections with a mesh, using a search object for speedup.
-     * @param lineStringPoints input line string to drape on the mesh.
-     * @param polyfaceOrVisitor mesh, or mesh visitor to traverse only part of a mesh.
-     * @param searchByReadIndex object for searching facet 2D ranges tagged by mesh read index.
-     * @example Using a 5x5 indexed search grid:
-     * ```
-     * const xyRange = Range2d.createFrom(myPolyface.range());
-     * const searcher = GriddedRaggedRange2dSetWithOverflow.create<number>(xyRange, 5, 5)!;
-     * for (const visitor = myPolyface.createVisitor(0); visitor.moveToNextFacet();) {
-     *   searcher.addRange(visitor.point.getRange(), visitor.currentReadIndex());
-     * }
-     * const drapedLineStrings = PolyfaceQuery.sweepLineStringToFacetsXY(lineString, myPolyface, searcher);
-     * ```
+     * @param points the linestring to drape onto the mesh.
+     * @param source target facet set. For best results, facets should be convex and planar.
+     * @param searcher object for searching facet 2D ranges tagged by mesh read index.
      * @returns the collected line strings.
-     */
-    static sweepLineStringToFacetsXY(lineStringPoints, polyfaceOrVisitor, searchByReadIndex) {
-        const chainContext = _topology_ChainMerge__WEBPACK_IMPORTED_MODULE_27__.ChainMergeContext.create();
-        const sweepVector = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d.create(0, 0, 1);
-        const searchRange = _geometry3d_Range__WEBPACK_IMPORTED_MODULE_28__.Range3d.create();
-        let visitor;
-        if (polyfaceOrVisitor instanceof _Polyface__WEBPACK_IMPORTED_MODULE_7__.Polyface)
-            visitor = polyfaceOrVisitor.createVisitor(0);
-        else
-            visitor = polyfaceOrVisitor;
-        let lineStringSource;
-        if (Array.isArray(lineStringPoints))
-            lineStringSource = new _geometry3d_Point3dArrayCarrier__WEBPACK_IMPORTED_MODULE_29__.Point3dArrayCarrier(lineStringPoints);
-        else
-            lineStringSource = lineStringPoints;
+     * @see [[sweepLineStringToFacets]] for further options.
+     */
+    static sweepLineStringToFacetsXY(points, source, searcher) {
+        const chainContext = _topology_ChainMerge__WEBPACK_IMPORTED_MODULE_26__.ChainMergeContext.create();
+        const vectorToEye = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d.unitZ();
+        const searchRange = _geometry3d_Range__WEBPACK_IMPORTED_MODULE_27__.Range3d.create();
+        const workPoint0 = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Point3d.createZero();
+        const workPoint1 = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Point3d.createZero();
+        const visitor = source instanceof _Polyface__WEBPACK_IMPORTED_MODULE_7__.Polyface ? source.createVisitor(0) : source;
+        visitor.setNumWrap(0);
+        let edgeClipper;
+        const clipEdgeToConvexPolygon = (_facetRange, readIndex) => {
+            if (visitor.moveToReadIndex(readIndex))
+                edgeClipper?.processPolygon(visitor.point, (ptA, ptB) => chainContext.addSegment(ptA, ptB));
+            return true;
+        };
+        const lineStringSource = Array.isArray(points) ? new _geometry3d_Point3dArrayCarrier__WEBPACK_IMPORTED_MODULE_28__.Point3dArrayCarrier(points) : points;
         for (let i = 1; i < lineStringSource.length; i++) {
-            const point0 = lineStringSource.getPoint3dAtUncheckedPointIndex(i - 1);
-            const point1 = lineStringSource.getPoint3dAtUncheckedPointIndex(i);
-            const edgeClipper = _multiclip_SweepLineStringToFacetContext__WEBPACK_IMPORTED_MODULE_14__.EdgeClipData.createPointPointSweep(point0, point1, sweepVector);
-            if (edgeClipper !== undefined) {
-                _geometry3d_Range__WEBPACK_IMPORTED_MODULE_28__.Range3d.createNull(searchRange);
-                searchRange.extendPoint(point0);
-                searchRange.extendPoint(point1);
-                searchByReadIndex.searchRange2d(searchRange, (_facetRange, readIndex) => {
-                    if (visitor.moveToReadIndex(readIndex))
-                        edgeClipper.processPolygon(visitor.point, (pointA, pointB) => chainContext.addSegment(pointA, pointB));
-                    return true;
-                });
+            lineStringSource.getPoint3dAtUncheckedPointIndex(i - 1, workPoint0);
+            lineStringSource.getPoint3dAtUncheckedPointIndex(i, workPoint1);
+            if (edgeClipper = _multiclip_SweepLineStringToFacetContext__WEBPACK_IMPORTED_MODULE_14__.EdgeClipData.createPointPointSweep(workPoint0, workPoint1, vectorToEye)) {
+                searchRange.setNull();
+                searchRange.extend(workPoint0, workPoint1);
+                searcher.searchRange2d(searchRange, clipEdgeToConvexPolygon);
             }
         }
         chainContext.clusterAndMergeVerticesXYZ();
@@ -253173,20 +253479,16 @@ class PolyfaceQuery {
       */
     static sweepLinestringToFacetsXYReturnLines(linestringPoints, polyface) {
         const options = SweepLineStringToFacetsOptions.create(_geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d.unitZ(), _geometry3d_Angle__WEBPACK_IMPORTED_MODULE_2__.Angle.createSmallAngle(), false, true, true, true);
-        const result = PolyfaceQuery.sweepLineStringToFacets(linestringPoints, polyface, options);
-        return result;
+        return PolyfaceQuery.sweepLineStringToFacets(linestringPoints, polyface, options);
     }
     /**
      * Find segments (within the linestring) which project to facets.
      * * Return chains.
-     * * This calls [[sweepLineStringToFacets]] with options created by
-     *   `const options = SweepLineStringToFacetsOptions.create(Vector3d.unitZ(), Angle.createSmallAngle(),true, true, true, true);`
+     * * This calls [[sweepLineStringToFacets]] with default options.
      * @deprecated in 4.x. Use [[PolyfaceQuery.sweepLineStringToFacets]] to get further options.
      */
     static sweepLinestringToFacetsXYReturnChains(linestringPoints, polyface) {
-        const options = SweepLineStringToFacetsOptions.create(_geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d.unitZ(), _geometry3d_Angle__WEBPACK_IMPORTED_MODULE_2__.Angle.createSmallAngle(), true, true, true, true);
-        const result = PolyfaceQuery.sweepLineStringToFacets(linestringPoints, polyface, options);
-        return result;
+        return PolyfaceQuery.sweepLineStringToFacets(linestringPoints, polyface);
     }
     /**
      * Find segments (within the linestring) which project to facets.
@@ -253198,7 +253500,7 @@ class PolyfaceQuery {
      * * Facets are ASSUMED to be convex and planar, and not overlap in the z direction.
      */
     static async asyncSweepLinestringToFacetsXYReturnChains(linestringPoints, polyface) {
-        const chainContext = _topology_ChainMerge__WEBPACK_IMPORTED_MODULE_27__.ChainMergeContext.create();
+        const chainContext = _topology_ChainMerge__WEBPACK_IMPORTED_MODULE_26__.ChainMergeContext.create();
         await Promise.resolve(this.asyncAnnounceSweepLinestringToConvexPolyfaceXY(linestringPoints, polyface, (_linestring, _segmentIndex, _polyface, _facetIndex, points, indexA, indexB) => {
             chainContext.addSegment(points[indexA], points[indexB]);
         }));
@@ -253214,7 +253516,7 @@ class PolyfaceQuery {
         if (polyface instanceof _Polyface__WEBPACK_IMPORTED_MODULE_7__.Polyface) {
             return this.collectRangeLengthData(polyface.createVisitor(0));
         }
-        const rangeData = new _RangeLengthData__WEBPACK_IMPORTED_MODULE_30__.RangeLengthData();
+        const rangeData = new _RangeLengthData__WEBPACK_IMPORTED_MODULE_29__.RangeLengthData();
         // polyface is a visitor
         for (polyface.reset(); polyface.moveToNextFacet();)
             rangeData.accumulateGrowableXYZArrayRange(polyface.point);
@@ -253227,9 +253529,9 @@ class PolyfaceQuery {
     static cloneWithTVertexFixup(polyface) {
         const oldFacetVisitor = polyface.createVisitor(1); // this is to visit the existing facets
         const newFacetVisitor = polyface.createVisitor(0); // this is to build the new facets
-        const rangeSearcher = _multiclip_XYPointBuckets__WEBPACK_IMPORTED_MODULE_31__.XYPointBuckets.create(polyface.data.point, 30);
-        const builder = _PolyfaceBuilder__WEBPACK_IMPORTED_MODULE_17__.PolyfaceBuilder.create();
-        const edgeRange = _geometry3d_Range__WEBPACK_IMPORTED_MODULE_28__.Range3d.createNull();
+        const rangeSearcher = _multiclip_XYPointBuckets__WEBPACK_IMPORTED_MODULE_30__.XYPointBuckets.create(polyface.data.point, 30);
+        const builder = _PolyfaceBuilder__WEBPACK_IMPORTED_MODULE_16__.PolyfaceBuilder.create();
+        const edgeRange = _geometry3d_Range__WEBPACK_IMPORTED_MODULE_27__.Range3d.createNull();
         const point0 = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Point3d.create();
         const point1 = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Point3d.create();
         const spacePoint = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Point3d.create();
@@ -253361,7 +253663,7 @@ class PolyfaceQuery {
      * @param clusterSelector indicates whether to copy 0, 1, or all facets in each cluster of duplicate facets.
      */
     static cloneByFacetDuplication(source, includeSingletons, clusterSelector) {
-        const builder = _PolyfaceBuilder__WEBPACK_IMPORTED_MODULE_17__.PolyfaceBuilder.create();
+        const builder = _PolyfaceBuilder__WEBPACK_IMPORTED_MODULE_16__.PolyfaceBuilder.create();
         const visitor = source.createVisitor(0);
         this.announceDuplicateFacetIndices(source, (clusterFacetIndices) => {
             let numToSelect = 0;
@@ -253388,7 +253690,7 @@ class PolyfaceQuery {
     static cloneWithColinearEdgeFixup(polyface) {
         const oldFacetVisitor = polyface.createVisitor(2); // this is to visit the existing facets
         const newFacetVisitor = polyface.createVisitor(0); // this is to build the new facets
-        const builder = _PolyfaceBuilder__WEBPACK_IMPORTED_MODULE_17__.PolyfaceBuilder.create();
+        const builder = _PolyfaceBuilder__WEBPACK_IMPORTED_MODULE_16__.PolyfaceBuilder.create();
         const vector01 = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d.create();
         const vector12 = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d.create();
         const numPoint = polyface.data.point.length;
@@ -253438,11 +253740,11 @@ class PolyfaceQuery {
     static setEdgeVisibility(polyface, clusters, value) {
         for (const cluster of clusters) {
             if (cluster instanceof _IndexedEdgeMatcher__WEBPACK_IMPORTED_MODULE_11__.SortableEdge) {
-                this.setSingleEdgeVisibility(polyface, cluster.facetIndex, cluster.vertexIndexA, value);
+                this.setSingleEdgeVisibility(polyface, cluster.facetIndex, cluster.startVertex, value);
             }
             else if (Array.isArray(cluster)) {
                 for (const e1 of cluster)
-                    this.setSingleEdgeVisibility(polyface, e1.facetIndex, e1.vertexIndexA, value);
+                    this.setSingleEdgeVisibility(polyface, e1.facetIndex, e1.startVertex, value);
             }
         }
     }
@@ -253544,8 +253846,8 @@ class PolyfaceQuery {
                         && undefined !== PolyfaceQuery.computeFacetUnitNormal(visitor, e1.facetIndex, normal1)) {
                         const edgeAngle = normal0.smallerUnorientedAngleTo(normal1);
                         if (edgeAngle.radians > sharpEdgeAngle.radians) {
-                            this.setSingleEdgeVisibility(mesh, e0.facetIndex, e0.vertexIndexA, true);
-                            this.setSingleEdgeVisibility(mesh, e1.facetIndex, e1.vertexIndexA, true);
+                            this.setSingleEdgeVisibility(mesh, e0.facetIndex, e0.startVertex, true);
+                            this.setSingleEdgeVisibility(mesh, e1.facetIndex, e1.startVertex, true);
                         }
                     }
                 }
@@ -253581,7 +253883,7 @@ class PolyfaceQuery {
      * @internal
      */
     static convertToHalfEdgeGraph(mesh) {
-        const builder = new _topology_HalfEdgeGraphFromIndexedLoopsContext__WEBPACK_IMPORTED_MODULE_32__.HalfEdgeGraphFromIndexedLoopsContext();
+        const builder = new _topology_HalfEdgeGraphFromIndexedLoopsContext__WEBPACK_IMPORTED_MODULE_31__.HalfEdgeGraphFromIndexedLoopsContext();
         const visitor = mesh.createVisitor(0);
         for (visitor.reset(); visitor.moveToNextFacet();) {
             builder.insertLoop(visitor.pointIndex);
@@ -253598,11 +253900,11 @@ class PolyfaceQuery {
     }
     /** Examine adjacent facet orientations throughout the mesh. If possible, reverse a subset to achieve proper pairing. */
     static reorientVertexOrderAroundFacetsForConsistentOrientation(mesh) {
-        return _FacetOrientation__WEBPACK_IMPORTED_MODULE_33__.FacetOrientationFixup.doFixup(mesh);
+        return _FacetOrientation__WEBPACK_IMPORTED_MODULE_32__.FacetOrientationFixup.doFixup(mesh);
     }
     /** Set up indexed normals with one normal in the plane of each facet of the mesh. */
     static buildPerFaceNormals(polyface) {
-        _multiclip_BuildAverageNormalsContext__WEBPACK_IMPORTED_MODULE_34__.BuildAverageNormalsContext.buildPerFaceNormals(polyface);
+        _multiclip_BuildAverageNormalsContext__WEBPACK_IMPORTED_MODULE_33__.BuildAverageNormalsContext.buildPerFaceNormals(polyface);
     }
     /**
     * * At each vertex of the mesh:
@@ -253616,7 +253918,7 @@ class PolyfaceQuery {
     * @param toleranceAngle averaging is done between normals up to this angle.
     */
     static buildAverageNormals(polyface, toleranceAngle = _geometry3d_Angle__WEBPACK_IMPORTED_MODULE_2__.Angle.createDegrees(31.0)) {
-        _multiclip_BuildAverageNormalsContext__WEBPACK_IMPORTED_MODULE_34__.BuildAverageNormalsContext.buildFastAverageNormals(polyface, toleranceAngle);
+        _multiclip_BuildAverageNormalsContext__WEBPACK_IMPORTED_MODULE_33__.BuildAverageNormalsContext.buildFastAverageNormals(polyface, toleranceAngle);
     }
     /**
      * Offset the faces of the mesh.
@@ -253626,9 +253928,9 @@ class PolyfaceQuery {
      * @returns shifted mesh.
      */
     static cloneOffset(source, signedOffsetDistance, offsetOptions = OffsetMeshOptions.create()) {
-        const strokeOptions = _curve_StrokeOptions__WEBPACK_IMPORTED_MODULE_26__.StrokeOptions.createForFacets();
-        const offsetBuilder = _PolyfaceBuilder__WEBPACK_IMPORTED_MODULE_17__.PolyfaceBuilder.create(strokeOptions);
-        _multiclip_OffsetMeshContext__WEBPACK_IMPORTED_MODULE_35__.OffsetMeshContext.buildOffsetMeshWithEdgeChamfers(source, offsetBuilder, signedOffsetDistance, offsetOptions);
+        const strokeOptions = _curve_StrokeOptions__WEBPACK_IMPORTED_MODULE_25__.StrokeOptions.createForFacets();
+        const offsetBuilder = _PolyfaceBuilder__WEBPACK_IMPORTED_MODULE_16__.PolyfaceBuilder.create(strokeOptions);
+        _multiclip_OffsetMeshContext__WEBPACK_IMPORTED_MODULE_34__.OffsetMeshContext.buildOffsetMeshWithEdgeChamfers(source, offsetBuilder, signedOffsetDistance, offsetOptions);
         return offsetBuilder.claimPolyface();
     }
     static _workTriangle;
@@ -253665,17 +253967,17 @@ class PolyfaceQuery {
             const numEdges = visitor.pointCount; // #vertices = #edges since numWrap is zero
             const vertices = visitor.point;
             if (3 === numEdges) {
-                const tri = this._workTriangle = _geometry3d_BarycentricTriangle__WEBPACK_IMPORTED_MODULE_36__.BarycentricTriangle.create(vertices.getPoint3dAtUncheckedPointIndex(0), vertices.getPoint3dAtUncheckedPointIndex(1), vertices.getPoint3dAtUncheckedPointIndex(2), this._workTriangle);
+                const tri = this._workTriangle = _geometry3d_BarycentricTriangle__WEBPACK_IMPORTED_MODULE_35__.BarycentricTriangle.create(vertices.getPoint3dAtUncheckedPointIndex(0), vertices.getPoint3dAtUncheckedPointIndex(1), vertices.getPoint3dAtUncheckedPointIndex(2), this._workTriangle);
                 const detail3 = this._workTriDetail = tri.intersectRay3d(ray, this._workTriDetail);
                 tri.snapLocationToEdge(detail3, options?.distanceTolerance, options?.parameterTolerance);
-                detail = this._workFacetDetail3 = _FacetLocationDetail__WEBPACK_IMPORTED_MODULE_37__.TriangularFacetLocationDetail.create(visitor.currentReadIndex(), detail3, this._workFacetDetail3);
+                detail = this._workFacetDetail3 = _FacetLocationDetail__WEBPACK_IMPORTED_MODULE_36__.TriangularFacetLocationDetail.create(visitor.currentReadIndex(), detail3, this._workFacetDetail3);
             }
             else {
                 const detailN = this._workPolyDetail = _geometry3d_PolygonOps__WEBPACK_IMPORTED_MODULE_8__.PolygonOps.intersectRay3d(vertices, ray, tol, this._workPolyDetail);
                 if (_geometry3d_PolygonOps__WEBPACK_IMPORTED_MODULE_8__.PolygonOps.isConvex(vertices))
-                    detail = this._workFacetDetailC = _FacetLocationDetail__WEBPACK_IMPORTED_MODULE_37__.ConvexFacetLocationDetail.create(visitor.currentReadIndex(), numEdges, detailN, this._workFacetDetailC);
+                    detail = this._workFacetDetailC = _FacetLocationDetail__WEBPACK_IMPORTED_MODULE_36__.ConvexFacetLocationDetail.create(visitor.currentReadIndex(), numEdges, detailN, this._workFacetDetailC);
                 else
-                    detail = this._workFacetDetailNC = _FacetLocationDetail__WEBPACK_IMPORTED_MODULE_37__.NonConvexFacetLocationDetail.create(visitor.currentReadIndex(), numEdges, detailN, this._workFacetDetailNC);
+                    detail = this._workFacetDetailNC = _FacetLocationDetail__WEBPACK_IMPORTED_MODULE_36__.NonConvexFacetLocationDetail.create(visitor.currentReadIndex(), numEdges, detailN, this._workFacetDetailNC);
             }
             if (detail.isInsideOrOn) { // set optional caches, process the intersection
                 if (options?.needNormal && visitor.normal)
@@ -254315,14 +254617,14 @@ let numNodeCreated = 0;
  *     * _range = the union of ranges below in the heap
  *     * _appData = application data associated with the node.
  *       * Construction methods may place multiple _appData items in each node.
- * * In common use, only the leaves will have _appData. However, the class definitions allow _appData at all nodes, and search algorithms must include them.
+ *       * In common use, only the leaves will have _appData. However, the class definitions allow _appData at all nodes, and search algorithms must include them.
  * * CONSTRUCTION
  *   * The RangeTreeNode.createByIndexSplits method constructs the tree with simple right-left splits within an array of input items.
  *     * The appData is placed entirely in the leaves.
- *     * caller can specify:
+ *     * The caller can specify:
  *       * the number of _appData items per leaf
  *       * the number of children per node within the tree.
- *     * "deep" trees (2 children per node and one appData per leaf) may have (compared to shallow trees with many children per node and many appData per leaf)
+ *     * Compared to "shallow" trees with many children per node and many appData per leaf, "deep" trees with 2 children per node and 1 appData per leaf may have:
  *       * faster search because lower nodes have smaller ranges that will be skipped by search algorithms.
  *       * larger memory use because of more nodes
  *   * For future construction methods:
@@ -257235,15 +257537,15 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */   EdgeClipData: () => (/* binding */ EdgeClipData),
 /* harmony export */   SweepLineStringToFacetContext: () => (/* binding */ SweepLineStringToFacetContext)
 /* harmony export */ });
-/* harmony import */ var _geometry3d_Transform__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ../../geometry3d/Transform */ "../../core/geometry/lib/esm/geometry3d/Transform.js");
-/* harmony import */ var _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../../geometry3d/Point3dVector3d */ "../../core/geometry/lib/esm/geometry3d/Point3dVector3d.js");
-/* harmony import */ var _geometry3d_Segment1d__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ../../geometry3d/Segment1d */ "../../core/geometry/lib/esm/geometry3d/Segment1d.js");
-/* harmony import */ var _geometry3d_Range__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../../geometry3d/Range */ "../../core/geometry/lib/esm/geometry3d/Range.js");
-/* harmony import */ var _Geometry__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ../../Geometry */ "../../core/geometry/lib/esm/Geometry.js");
 /* harmony import */ var _clipping_ClipPlane__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ../../clipping/ClipPlane */ "../../core/geometry/lib/esm/clipping/ClipPlane.js");
 /* harmony import */ var _clipping_ConvexClipPlaneSet__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ../../clipping/ConvexClipPlaneSet */ "../../core/geometry/lib/esm/clipping/ConvexClipPlaneSet.js");
-/* harmony import */ var _geometry3d_PolygonOps__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! ../../geometry3d/PolygonOps */ "../../core/geometry/lib/esm/geometry3d/PolygonOps.js");
+/* harmony import */ var _Geometry__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ../../Geometry */ "../../core/geometry/lib/esm/Geometry.js");
 /* harmony import */ var _geometry3d_Matrix3d__WEBPACK_IMPORTED_MODULE_8__ = __webpack_require__(/*! ../../geometry3d/Matrix3d */ "../../core/geometry/lib/esm/geometry3d/Matrix3d.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_7__ = __webpack_require__(/*! ../../geometry3d/PolygonOps */ "../../core/geometry/lib/esm/geometry3d/PolygonOps.js");
+/* harmony import */ var _geometry3d_Range__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ../../geometry3d/Range */ "../../core/geometry/lib/esm/geometry3d/Range.js");
+/* harmony import */ var _geometry3d_Segment1d__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../../geometry3d/Segment1d */ "../../core/geometry/lib/esm/geometry3d/Segment1d.js");
+/* harmony import */ var _geometry3d_Transform__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ../../geometry3d/Transform */ "../../core/geometry/lib/esm/geometry3d/Transform.js");
 /*---------------------------------------------------------------------------------------------
 * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
 * See LICENSE.md in the project root for license terms and full copyright notice.
@@ -257266,24 +257568,23 @@ class SweepLineStringToFacetContext {
     _numSpacePoints;
     constructor(spacePoints) {
         this._spacePoints = spacePoints;
-        this._spacePointsRange = new _geometry3d_Range__WEBPACK_IMPORTED_MODULE_0__.Range3d();
-        spacePoints.setRange(this._spacePointsRange);
+        this._spacePointsRange = spacePoints.getRange();
         this._numSpacePoints = this._spacePoints.length;
     }
     static create(xyz) {
         if (xyz.length > 1) {
-            return new SweepLineStringToFacetContext(xyz.clone());
+            return new SweepLineStringToFacetContext(xyz);
         }
         return undefined;
     }
     // temporaries reused over multiple calls to process a single facet . ..
-    _segmentPoint0 = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Point3d.create();
-    _segmentPoint1 = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Point3d.create();
-    _localSegmentPoint0 = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Point3d.create();
-    _localSegmentPoint1 = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Point3d.create();
-    _clipFractions = _geometry3d_Segment1d__WEBPACK_IMPORTED_MODULE_2__.Segment1d.create(0, 1);
-    _localFrame = _geometry3d_Transform__WEBPACK_IMPORTED_MODULE_3__.Transform.createIdentity();
-    _polygonRange = _geometry3d_Range__WEBPACK_IMPORTED_MODULE_0__.Range3d.create();
+    _segmentPoint0 = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_0__.Point3d.create();
+    _segmentPoint1 = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_0__.Point3d.create();
+    _localSegmentPoint0 = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_0__.Point3d.create();
+    _localSegmentPoint1 = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_0__.Point3d.create();
+    _clipFractions = _geometry3d_Segment1d__WEBPACK_IMPORTED_MODULE_1__.Segment1d.create(0, 1);
+    _localFrame = _geometry3d_Transform__WEBPACK_IMPORTED_MODULE_2__.Transform.createIdentity();
+    _polygonRange = _geometry3d_Range__WEBPACK_IMPORTED_MODULE_3__.Range3d.create();
     /** process a single polygon.
      * @returns number crudely indicating how much work was done.
      */
@@ -257359,7 +257660,7 @@ class EdgeClipData {
     }
     /** create object from segment and sweep. Inputs are not captured. */
     static createPointPointSweep(pointA, pointB, sweep) {
-        const edgeVector = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d.createStartEnd(pointA, pointB);
+        const edgeVector = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_0__.Vector3d.createStartEnd(pointA, pointB);
         const fraction = edgeVector.fractionOfProjectionToVector(sweep);
         // The unbounded plane of the swept edge will intersect facets in lines that may extend beyond the swept bounded line.
         // That linework will be clipped between two facing planes with normal along the perpendicular dropped from the edge vector to the sweep vector.
@@ -257408,16 +257709,16 @@ class ClipSweptLineStringContext {
     }
     static create(xyz, sweepVector) {
         if (sweepVector === undefined)
-            sweepVector = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d.create(0, 0, 1);
+            sweepVector = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_0__.Vector3d.create(0, 0, 1);
         if (xyz.length > 1) {
-            const point = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Point3d.createZero();
-            const newPoint = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Point3d.createZero();
+            const point = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_0__.Point3d.createZero();
+            const newPoint = _geometry3d_Point3dVector3d__WEBPACK_IMPORTED_MODULE_0__.Point3d.createZero();
             const edgeData = [];
             xyz.getPoint3dAtUncheckedPointIndex(0, point);
             let localToWorldMatrix = _geometry3d_Matrix3d__WEBPACK_IMPORTED_MODULE_8__.Matrix3d.createRigidHeadsUp(sweepVector);
             if (localToWorldMatrix === undefined)
                 localToWorldMatrix = _geometry3d_Matrix3d__WEBPACK_IMPORTED_MODULE_8__.Matrix3d.createIdentity();
-            const localToWorld = _geometry3d_Transform__WEBPACK_IMPORTED_MODULE_3__.Transform.createOriginAndMatrix(point, localToWorldMatrix);
+            const localToWorld = _geometry3d_Transform__WEBPACK_IMPORTED_MODULE_2__.Transform.createOriginAndMatrix(point, localToWorldMatrix);
             const worldToLocal = localToWorld.inverse();
             const localRange = xyz.getRange(worldToLocal);
             for (let i = 1; i < xyz.length; i++) {
@@ -257438,7 +257739,7 @@ class ClipSweptLineStringContext {
      */
     processPolygon(polygon, announceEdge) {
         if (this._worldToLocal !== undefined && this._localRange !== undefined) {
-            const polygonRange = _geometry3d_Range__WEBPACK_IMPORTED_MODULE_0__.Range3d.createTransformedArray(this._worldToLocal, polygon);
+            const polygonRange = _geometry3d_Range__WEBPACK_IMPORTED_MODULE_3__.Range3d.createTransformedArray(this._worldToLocal, polygon);
             if (!polygonRange.intersectsRangeXY(this._localRange))
                 return;
         }
@@ -272086,7 +272387,7 @@ class ChainMergeContext {
         }
         return n;
     }
-    /** Collect chains which have maximum edge count, broken at an vertex with other than 2 edges.
+    /** Collect chains which have maximum edge count, broken at vertices with more than 2 edges.
      * * This is assumed to be preceded by a call to a vertex-cluster step such as `clusterAndMergeVerticesYXZ`
      */
     collectMaximalChains() {
@@ -312718,7 +313019,7 @@ var loadLanguages = instance.loadLanguages;
 /***/ ((module) => {
 
 "use strict";
-module.exports = /*#__PURE__*/JSON.parse('{"name":"@itwin/core-frontend","version":"5.0.0-dev.113","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 && npm run -s build:esm && npm run -s webpackWorkers && npm run -s copy:workers","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 ES2022 --outDir lib/esm","clean":"rimraf -g 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","copy:workers":"cpx \\"./lib/workers/webpack/parse-imdl-worker.js\\" ./lib/public/scripts","docs":"betools docs --json=../../generated-docs/core/core-frontend/file.json --tsIndexFile=./core-frontend.ts --onlyJson --excludes=webgl/**/*,**/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-inline-config -c extraction.eslint.config.js  \\"./src/**/*.ts\\" 1>&2","lint":"eslint \\"./src/**/*.ts\\" 1>&2","lint-fix":"eslint --fix -f visualstudio \\"./src/**/*.ts\\" 1>&2","pseudolocalize":"betools pseudolocalize --englishDir ./src/public/locales/en --out ./public/locales/en-PSEUDO","test":"npm run webpackTestWorker && vitest --run","cover":"npm run webpackTestWorker && vitest --run","webpackTests":"webpack --config ./src/test/utils/webpack.config.js 1>&2 && npm run -s webpackTestWorker","webpackTestWorker":"webpack --config ./src/test/worker/webpack.config.js 1>&2 && cpx \\"./lib/test/test-worker.js\\" ./lib/test","webpackWorkers":"webpack --config ./src/workers/ImdlParser/webpack.config.js 1>&2"},"repository":{"type":"git","url":"https://github.com/iTwin/itwinjs-core.git","directory":"core/frontend"},"keywords":["Bentley","BIM","iModel","digital-twin","iTwin"],"author":{"name":"Bentley Systems, Inc.","url":"http://www.bentley.com"},"peerDependencies":{"@itwin/appui-abstract":"workspace:*","@itwin/core-bentley":"workspace:*","@itwin/core-common":"workspace:*","@itwin/core-geometry":"workspace:*","@itwin/core-orbitgt":"workspace:*","@itwin/core-quantity":"workspace:*","@itwin/ecschema-metadata":"workspace:*","@itwin/ecschema-rpcinterface-common":"workspace:*"},"//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/ecschema-metadata":"workspace:*","@itwin/ecschema-rpcinterface-common":"workspace:*","@itwin/eslint-plugin":"5.0.0-dev.1","@types/chai-as-promised":"^7","@vitest/browser":"^3.0.6","@vitest/coverage-v8":"^3.0.6","cpx2":"^8.0.0","eslint":"^9.13.0","glob":"^10.3.12","playwright":"~1.47.1","rimraf":"^6.0.1","source-map-loader":"^5.0.0","typescript":"~5.6.2","typemoq":"^2.1.0","vitest":"^3.0.6","vite-multiple-assets":"^1.3.1","vite-plugin-static-copy":"2.2.0","webpack":"^5.97.1"},"//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/cloud-agnostic-core":"^2.2.4","@itwin/object-storage-core":"^2.3.0","@itwin/core-i18n":"workspace:*","@itwin/webgl-compatibility":"workspace:*","@loaders.gl/core":"^3.1.6","@loaders.gl/draco":"^3.1.6","fuse.js":"^3.3.0","wms-capabilities":"0.4.0"}}');
+module.exports = /*#__PURE__*/JSON.parse('{"name":"@itwin/core-frontend","version":"5.0.0-dev.114","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 && npm run -s build:esm && npm run -s webpackWorkers && npm run -s copy:workers","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 ES2022 --outDir lib/esm","clean":"rimraf -g 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","copy:workers":"cpx \\"./lib/workers/webpack/parse-imdl-worker.js\\" ./lib/public/scripts","docs":"betools docs --json=../../generated-docs/core/core-frontend/file.json --tsIndexFile=./core-frontend.ts --onlyJson --excludes=webgl/**/*,**/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-inline-config -c extraction.eslint.config.js  \\"./src/**/*.ts\\" 1>&2","lint":"eslint \\"./src/**/*.ts\\" 1>&2","lint-fix":"eslint --fix -f visualstudio \\"./src/**/*.ts\\" 1>&2","pseudolocalize":"betools pseudolocalize --englishDir ./src/public/locales/en --out ./public/locales/en-PSEUDO","test":"npm run webpackTestWorker && vitest --run","cover":"npm run webpackTestWorker && vitest --run","webpackTests":"webpack --config ./src/test/utils/webpack.config.js 1>&2 && npm run -s webpackTestWorker","webpackTestWorker":"webpack --config ./src/test/worker/webpack.config.js 1>&2 && cpx \\"./lib/test/test-worker.js\\" ./lib/test","webpackWorkers":"webpack --config ./src/workers/ImdlParser/webpack.config.js 1>&2"},"repository":{"type":"git","url":"https://github.com/iTwin/itwinjs-core.git","directory":"core/frontend"},"keywords":["Bentley","BIM","iModel","digital-twin","iTwin"],"author":{"name":"Bentley Systems, Inc.","url":"http://www.bentley.com"},"peerDependencies":{"@itwin/appui-abstract":"workspace:*","@itwin/core-bentley":"workspace:*","@itwin/core-common":"workspace:*","@itwin/core-geometry":"workspace:*","@itwin/core-orbitgt":"workspace:*","@itwin/core-quantity":"workspace:*","@itwin/ecschema-metadata":"workspace:*","@itwin/ecschema-rpcinterface-common":"workspace:*"},"//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/ecschema-metadata":"workspace:*","@itwin/ecschema-rpcinterface-common":"workspace:*","@itwin/eslint-plugin":"5.0.0-dev.1","@types/chai-as-promised":"^7","@vitest/browser":"^3.0.6","@vitest/coverage-v8":"^3.0.6","cpx2":"^8.0.0","eslint":"^9.13.0","glob":"^10.3.12","playwright":"~1.47.1","rimraf":"^6.0.1","source-map-loader":"^5.0.0","typescript":"~5.6.2","typemoq":"^2.1.0","vitest":"^3.0.6","vite-multiple-assets":"^1.3.1","vite-plugin-static-copy":"2.2.0","webpack":"^5.97.1"},"//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/cloud-agnostic-core":"^2.2.4","@itwin/object-storage-core":"^2.3.0","@itwin/core-i18n":"workspace:*","@itwin/webgl-compatibility":"workspace:*","@loaders.gl/core":"^3.1.6","@loaders.gl/draco":"^3.1.6","fuse.js":"^3.3.0","wms-capabilities":"0.4.0"}}');
 
 /***/ })