@itwin/ecschema-rpcinterface-tests 4.0.0-dev.100 → 4.0.0-dev.102

package/lib/dist/bundled-tests.js

@@ -149497,7 +149497,8 @@ class MapTile extends _internal__WEBPACK_IMPORTED_MODULE_7__.RealityTile {
     }
     /** @internal */
     minimumVisibleFactor() {
-        return 0.25;
+        // if minimumVisibleFactor is more than 0, it stops parents from loading when children are not ready, to fill in gaps
+        return 0.0;
     }
     /** @internal */
     getDrapeTextures() {
@@ -166781,17 +166782,20 @@ class Geometry {
         if (a2b2 > 0.0) {
             const a2b2r = 1.0 / a2b2; // 1/(a^2+b^2)
             const d2a2b2 = d2 * a2b2r; // d^2/(a^2+b^2)
-            const criteria = 1.0 - d2a2b2; // 1 - d^2/(a^2+b^2); the criteria to specify how many solutions we got
-            if (criteria < -Geometry.smallMetricDistanceSquared) // nSolution = 0
+            const criterion = 1.0 - d2a2b2; // 1 - d^2/(a^2+b^2);
+            if (criterion < -Geometry.smallMetricDistanceSquared) // nSolution = 0
                 return result;
             const da2b2 = -constCoff * a2b2r; // -d/(a^2+b^2)
+            // (c0,s0) is the closest approach of the line to the circle center (origin)
             const c0 = da2b2 * cosCoff; // -ad/(a^2+b^2)
             const s0 = da2b2 * sinCoff; // -bd/(a^2+b^2)
-            if (criteria <= 0.0) { // nSolution = 1 (observed criteria = -2.22e-16 in rotated system)
+            if (criterion <= 0.0) { // nSolution = 1
+                // We observed criterion = -2.22e-16 in a rotated tangent system, therefore for negative criteria near
+                // zero, return the near-tangency; for tiny positive criteria, fall through to return both solutions.
                 result = [_geometry3d_Point2dVector2d__WEBPACK_IMPORTED_MODULE_1__.Vector2d.create(c0, s0)];
             }
-            else if (criteria > 0.0) { // nSolution = 2
-                const s = Math.sqrt(criteria * a2b2r); // sqrt(a^2+b^2-d^2)) / (a^2+b^2)
+            else { // nSolution = 2
+                const s = Math.sqrt(criterion * a2b2r); // sqrt(a^2+b^2-d^2)) / (a^2+b^2)
                 result = [
                     _geometry3d_Point2dVector2d__WEBPACK_IMPORTED_MODULE_1__.Vector2d.create(c0 - s * sinCoff, s0 + s * cosCoff),
                     _geometry3d_Point2dVector2d__WEBPACK_IMPORTED_MODULE_1__.Vector2d.create(c0 + s * sinCoff, s0 - s * cosCoff),
@@ -181735,12 +181739,12 @@ class CurveCurveIntersectXY extends _geometry3d_GeometryHandler__WEBPACK_IMPORTE
     extendB, reversed) {
         const inverseA = matrixA.inverse();
         if (inverseA) {
-            const localB = inverseA.multiplyMatrixMatrix(matrixB);
+            const localB = inverseA.multiplyMatrixMatrix(matrixB); // localB->localA transform
             const ellipseRadians = [];
             const circleRadians = [];
             _numerics_Polynomials__WEBPACK_IMPORTED_MODULE_6__.TrigPolynomial.solveUnitCircleHomogeneousEllipseIntersection(localB.coffs[2], localB.coffs[5], localB.coffs[8], // center xyw
-            localB.coffs[0], localB.coffs[3], localB.coffs[6], // center xyw
-            localB.coffs[1], localB.coffs[4], localB.coffs[7], // center xyw
+            localB.coffs[0], localB.coffs[3], localB.coffs[6], // vector0 xyw
+            localB.coffs[1], localB.coffs[4], localB.coffs[7], // vector90 xyw
             ellipseRadians, circleRadians);
             for (let i = 0; i < ellipseRadians.length; i++) {
                 const fractionA = cpA.sweep.radiansToSignedPeriodicFraction(circleRadians[i]);
@@ -183687,7 +183691,7 @@ function optionalVectorUpdate(source, result) {
     return undefined;
 }
 /**
- * CurveLocationDetail carries point and paramter data about a point evaluated on a curve.
+ * CurveLocationDetail carries point and parameter data about a point evaluated on a curve.
  * * These are returned by a variety of queries.
  * * Particular contents can vary among the queries.
  * @public
@@ -187931,13 +187935,16 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */ __webpack_require__.d(__webpack_exports__, {
 /* harmony export */   "PlanarSubdivision": () => (/* binding */ PlanarSubdivision)
 /* harmony export */ });
-/* harmony import */ var _Geometry__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ../../Geometry */ "../../core/geometry/lib/esm/Geometry.js");
-/* harmony import */ var _topology_Graph__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../../topology/Graph */ "../../core/geometry/lib/esm/topology/Graph.js");
-/* harmony import */ var _topology_HalfEdgeGraphSearch__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ../../topology/HalfEdgeGraphSearch */ "../../core/geometry/lib/esm/topology/HalfEdgeGraphSearch.js");
-/* harmony import */ var _topology_Merging__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../../topology/Merging */ "../../core/geometry/lib/esm/topology/Merging.js");
-/* harmony import */ var _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ../CurveLocationDetail */ "../../core/geometry/lib/esm/curve/CurveLocationDetail.js");
-/* harmony import */ var _Loop__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ../Loop */ "../../core/geometry/lib/esm/curve/Loop.js");
-/* harmony import */ var _RegionOps__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ../RegionOps */ "../../core/geometry/lib/esm/curve/RegionOps.js");
+/* harmony import */ var _Geometry__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../../Geometry */ "../../core/geometry/lib/esm/Geometry.js");
+/* harmony import */ var _topology_Graph__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ../../topology/Graph */ "../../core/geometry/lib/esm/topology/Graph.js");
+/* harmony import */ var _topology_HalfEdgeGraphSearch__WEBPACK_IMPORTED_MODULE_9__ = __webpack_require__(/*! ../../topology/HalfEdgeGraphSearch */ "../../core/geometry/lib/esm/topology/HalfEdgeGraphSearch.js");
+/* harmony import */ var _topology_Merging__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! ../../topology/Merging */ "../../core/geometry/lib/esm/topology/Merging.js");
+/* harmony import */ var _Arc3d__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../Arc3d */ "../../core/geometry/lib/esm/curve/Arc3d.js");
+/* harmony import */ var _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ../CurveLocationDetail */ "../../core/geometry/lib/esm/curve/CurveLocationDetail.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 _Loop__WEBPACK_IMPORTED_MODULE_8__ = __webpack_require__(/*! ../Loop */ "../../core/geometry/lib/esm/curve/Loop.js");
+/* harmony import */ var _RegionOps__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! ../RegionOps */ "../../core/geometry/lib/esm/curve/RegionOps.js");
 /*---------------------------------------------------------------------------------------------
 * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
 * See LICENSE.md in the project root for license terms and full copyright notice.
@@ -187949,13 +187956,16 @@ __webpack_require__.r(__webpack_exports__);
 
 
 
+
+
+
 /** @packageDocumentation
  * @module Curve
  */
 class MapCurvePrimitiveToCurveLocationDetailPairArray {
     constructor() {
         this.primitiveToPair = new Map();
-        // index assigned to this primitive for this calculation.
+        // index assigned to this primitive (for debugging)
         this.primitiveToIndex = new Map();
         this._numIndexedPrimitives = 0;
     }
@@ -187987,54 +187997,63 @@ class MapCurvePrimitiveToCurveLocationDetailPairArray {
         if (primitiveB)
             this.insertPrimitiveToPair(primitiveB, pair);
     }
+    /** Split closed missing primitives in half and add new intersection pairs */
+    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))
+                closedCurveSplitCandidate = p.startPoint().isAlmostEqualXY(p.endPoint(), tolerance);
+            if (closedCurveSplitCandidate && !this.primitiveToPair.has(p)) {
+                const p0 = p.clonePartialCurve(0.0, 0.5);
+                const p1 = p.clonePartialCurve(0.5, 1.0);
+                if (p0 && p1) {
+                    this.insertPair(_CurveLocationDetail__WEBPACK_IMPORTED_MODULE_4__.CurveLocationDetailPair.createCapture(_CurveLocationDetail__WEBPACK_IMPORTED_MODULE_4__.CurveLocationDetail.createCurveEvaluatedFraction(p0, 0.0), _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_4__.CurveLocationDetail.createCurveEvaluatedFraction(p1, 1.0)));
+                    this.insertPair(_CurveLocationDetail__WEBPACK_IMPORTED_MODULE_4__.CurveLocationDetailPair.createCapture(_CurveLocationDetail__WEBPACK_IMPORTED_MODULE_4__.CurveLocationDetail.createCurveEvaluatedFraction(p0, 1.0), _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_4__.CurveLocationDetail.createCurveEvaluatedFraction(p1, 0.0)));
+                }
+            }
+        }
+    }
 }
-/*
-  function getDetailString(detail: CurveLocationDetail | undefined): string {
-    if (!detail)
-      return "{}";
-    else return tagString("primitive", this.primitiveToIndex.get(detail.curve!)) + tagString("f0", detail.fraction) + tagString("f1", detail.fraction1);
-  }
-}
-function tagString(name: string, value: number | undefined): string {
-  if (value !== undefined)
-    return "(" + name + " " + value + ")";
-  return "";
-}
-*/
 /**
  * @internal
  */
 class PlanarSubdivision {
-    /** Create a graph from an array of curves, and an array of the curves' precomputed intersections. */
-    static assembleHalfEdgeGraph(primitives, allPairs) {
+    /** Create a graph from an array of curves, and an array of the curves' precomputed intersections. Z-coordinates are ignored. */
+    static assembleHalfEdgeGraph(primitives, allPairs, mergeTolerance = _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.smallMetricDistance) {
         const detailByPrimitive = new MapCurvePrimitiveToCurveLocationDetailPairArray(); // map from key CurvePrimitive to CurveLocationDetailPair.
-        for (const p of primitives)
-            detailByPrimitive.assignPrimitiveIndex(p);
-        for (const pair of allPairs) {
+        for (const pair of allPairs)
             detailByPrimitive.insertPair(pair);
-        }
-        const graph = new _topology_Graph__WEBPACK_IMPORTED_MODULE_0__.HalfEdgeGraph();
+        if (primitives.length > detailByPrimitive.primitiveToPair.size)
+            detailByPrimitive.splitAndAppendMissingClosedPrimitives(primitives, mergeTolerance); // otherwise, these single-primitive loops are missing from the graph
+        const graph = new _topology_Graph__WEBPACK_IMPORTED_MODULE_5__.HalfEdgeGraph();
         for (const entry of detailByPrimitive.primitiveToPair.entries()) {
             const p = entry[0];
-            const details = entry[1];
+            // convert each interval intersection into two isolated intersections
+            const details = entry[1].reduce((accumulator, detailPair) => {
+                if (!detailPair.detailA.hasFraction1)
+                    return [...accumulator, detailPair];
+                const detail = getDetailOnCurve(detailPair, p);
+                const detail0 = _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_4__.CurveLocationDetail.createCurveFractionPoint(p, detail.fraction, detail.point);
+                const detail1 = _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_4__.CurveLocationDetail.createCurveFractionPoint(p, detail.fraction1, detail.point1);
+                return [...accumulator, _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_4__.CurveLocationDetailPair.createCapture(detail0, detail0), _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_4__.CurveLocationDetailPair.createCapture(detail1, detail1)];
+            }, []);
+            // lexical sort on p intersection fraction
             details.sort((pairA, pairB) => {
                 const fractionA = getFractionOnCurve(pairA, p);
                 const fractionB = getFractionOnCurve(pairB, p);
-                if (fractionA === undefined || fractionB === undefined)
-                    return -1000.0;
                 return fractionA - fractionB;
             });
-            let detail0 = getDetailOnCurve(details[0], p);
-            this.addHalfEdge(graph, p, p.startPoint(), 0.0, detail0.point, detail0.fraction);
-            for (let i = 1; i < details.length; i++) {
-                // create (both sides of) a graph edge . . .
-                const detail1 = getDetailOnCurve(details[i], p);
-                this.addHalfEdge(graph, p, detail0.point, detail0.fraction, detail1.point, detail1.fraction);
-                detail0 = detail1;
+            let last = { point: p.startPoint(), fraction: 0.0 };
+            for (const detailPair of details) {
+                const detail = getDetailOnCurve(detailPair, p);
+                const detailFraction = _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.restrictToInterval(detail.fraction, 0, 1); // truncate fraction, but don't snap point; clustering happens later
+                last = this.addHalfEdge(graph, p, last.point, last.fraction, detail.point, detailFraction, mergeTolerance);
             }
-            this.addHalfEdge(graph, p, detail0.point, detail0.fraction, p.endPoint(), 1.0);
+            this.addHalfEdge(graph, p, last.point, last.fraction, p.endPoint(), 1.0, mergeTolerance);
         }
-        _topology_Merging__WEBPACK_IMPORTED_MODULE_1__.HalfEdgeGraphMerge.clusterAndMergeXYTheta(graph, (he) => he.sortAngle);
+        _topology_Merging__WEBPACK_IMPORTED_MODULE_6__.HalfEdgeGraphMerge.clusterAndMergeXYTheta(graph, (he) => he.sortAngle);
         return graph;
     }
     /**
@@ -188046,19 +188065,21 @@ class PlanarSubdivision {
      * @param point0 start point
      * @param fraction1 end fraction
      * @param point1 end point
-     */
-    static addHalfEdge(graph, p, point0, fraction0, point1, fraction1) {
-        if (!point0.isAlmostEqual(point1)) {
-            const halfEdge = graph.createEdgeXYAndZ(point0, 0, point1, 0);
-            const detail01 = _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_2__.CurveLocationDetail.createCurveEvaluatedFractionFraction(p, fraction0, fraction1);
-            const mate = halfEdge.edgeMate;
-            halfEdge.edgeTag = detail01;
-            halfEdge.sortData = 1.0;
-            mate.edgeTag = detail01;
-            mate.sortData = -1.0;
-            halfEdge.sortAngle = sortAngle(detail01.curve, detail01.fraction, false);
-            mate.sortAngle = sortAngle(detail01.curve, detail01.fraction1, true);
-        }
+     * @returns end point and fraction, or start point and fraction if no action
+     */
+    static addHalfEdge(graph, p, point0, fraction0, point1, fraction1, mergeTolerance = _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.smallMetricDistance) {
+        if (point0.isAlmostEqualXY(point1, mergeTolerance))
+            return { point: point0, fraction: fraction0 };
+        const halfEdge = graph.createEdgeXYAndZ(point0, 0, point1, 0);
+        const detail01 = _CurveLocationDetail__WEBPACK_IMPORTED_MODULE_4__.CurveLocationDetail.createCurveEvaluatedFractionFraction(p, fraction0, fraction1);
+        const mate = halfEdge.edgeMate;
+        halfEdge.edgeTag = detail01;
+        halfEdge.sortData = 1.0;
+        mate.edgeTag = detail01;
+        mate.sortData = -1.0;
+        halfEdge.sortAngle = sortAngle(p, fraction0, false);
+        mate.sortAngle = sortAngle(p, fraction1, true);
+        return { point: point1, fraction: fraction1 };
     }
     /**
      * Based on computed (and toleranced) area, push the loop (pointer) onto the appropriate array of positive, negative, or sliver loops.
@@ -188067,7 +188088,7 @@ class PlanarSubdivision {
      * @returns the area (forced to zero if within tolerance)
      */
     static collectSignedLoop(loop, outLoops, zeroAreaTolerance = 1.0e-10, isSliverFace) {
-        let area = isSliverFace ? 0.0 : _RegionOps__WEBPACK_IMPORTED_MODULE_3__.RegionOps.computeXYArea(loop);
+        let area = isSliverFace ? 0.0 : _RegionOps__WEBPACK_IMPORTED_MODULE_7__.RegionOps.computeXYArea(loop);
         if (area === undefined)
             area = 0;
         if (Math.abs(area) < zeroAreaTolerance)
@@ -188083,7 +188104,7 @@ class PlanarSubdivision {
     }
     static createLoopInFace(faceSeed, announce) {
         let he = faceSeed;
-        const loop = _Loop__WEBPACK_IMPORTED_MODULE_4__.Loop.create();
+        const loop = _Loop__WEBPACK_IMPORTED_MODULE_8__.Loop.create();
         do {
             const detail = he.edgeTag;
             if (detail) {
@@ -188107,9 +188128,9 @@ class PlanarSubdivision {
         const faceHasTwoEdges = (he.faceSuccessor.faceSuccessor === he);
         let faceIsBanana = false;
         if (faceHasTwoEdges) {
-            const c0 = _topology_Merging__WEBPACK_IMPORTED_MODULE_1__.HalfEdgeGraphMerge.curvatureSortKey(he);
-            const c1 = _topology_Merging__WEBPACK_IMPORTED_MODULE_1__.HalfEdgeGraphMerge.curvatureSortKey(he.faceSuccessor.edgeMate);
-            if (!_Geometry__WEBPACK_IMPORTED_MODULE_5__.Geometry.isSameCoordinate(c0, c1)) // default tol!
+            const c0 = _topology_Merging__WEBPACK_IMPORTED_MODULE_6__.HalfEdgeGraphMerge.curvatureSortKey(he);
+            const c1 = _topology_Merging__WEBPACK_IMPORTED_MODULE_6__.HalfEdgeGraphMerge.curvatureSortKey(he.faceSuccessor.edgeMate);
+            if (!_Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.isSameCoordinate(c0, c1)) // default tol!
                 faceIsBanana = true; // heuristic: we could also check end curvatures, and/or higher derivatives...
         }
         return faceHasTwoEdges && !faceIsBanana;
@@ -188127,7 +188148,7 @@ class PlanarSubdivision {
         return e1;
     }
     static collectSignedLoopSetsInHalfEdgeGraph(graph, zeroAreaTolerance = 1.0e-10) {
-        const q = _topology_HalfEdgeGraphSearch__WEBPACK_IMPORTED_MODULE_6__.HalfEdgeGraphSearch.collectConnectedComponentsWithExteriorParityMasks(graph, undefined);
+        const q = _topology_HalfEdgeGraphSearch__WEBPACK_IMPORTED_MODULE_9__.HalfEdgeGraphSearch.collectConnectedComponentsWithExteriorParityMasks(graph, undefined);
         const result = [];
         const edgeMap = new Map();
         for (const faceSeeds of q) {
@@ -188142,10 +188163,10 @@ class PlanarSubdivision {
                             const e = edgeMap.get(mate);
                             if (e === undefined) {
                                 // Record this as loopA,edgeA of a shared edge to be completed later from the other side of the edge
-                                const e1 = new _Loop__WEBPACK_IMPORTED_MODULE_4__.LoopCurveLoopCurve(loopC, curveC, undefined, undefined);
+                                const e1 = new _Loop__WEBPACK_IMPORTED_MODULE_8__.LoopCurveLoopCurve(loopC, curveC, undefined, undefined);
                                 edgeMap.set(he, e1);
                             }
-                            else if (e instanceof _Loop__WEBPACK_IMPORTED_MODULE_4__.LoopCurveLoopCurve) {
+                            else if (e instanceof _Loop__WEBPACK_IMPORTED_MODULE_8__.LoopCurveLoopCurve) {
                                 e.setB(loopC, curveC);
                                 edges.push(e);
                                 edgeMap.delete(mate);
@@ -188993,27 +189014,27 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony import */ var _geometry4d_MomentData__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../geometry4d/MomentData */ "../../core/geometry/lib/esm/geometry4d/MomentData.js");
 /* harmony import */ var _polyface_PolyfaceBuilder__WEBPACK_IMPORTED_MODULE_9__ = __webpack_require__(/*! ../polyface/PolyfaceBuilder */ "../../core/geometry/lib/esm/polyface/PolyfaceBuilder.js");
 /* harmony import */ var _topology_Graph__WEBPACK_IMPORTED_MODULE_14__ = __webpack_require__(/*! ../topology/Graph */ "../../core/geometry/lib/esm/topology/Graph.js");
+/* harmony import */ var _topology_HalfEdgeGraphSearch__WEBPACK_IMPORTED_MODULE_13__ = __webpack_require__(/*! ../topology/HalfEdgeGraphSearch */ "../../core/geometry/lib/esm/topology/HalfEdgeGraphSearch.js");
 /* harmony import */ var _topology_Triangulation__WEBPACK_IMPORTED_MODULE_7__ = __webpack_require__(/*! ../topology/Triangulation */ "../../core/geometry/lib/esm/topology/Triangulation.js");
 /* harmony import */ var _ChainCollectorContext__WEBPACK_IMPORTED_MODULE_23__ = __webpack_require__(/*! ./ChainCollectorContext */ "../../core/geometry/lib/esm/curve/ChainCollectorContext.js");
 /* harmony import */ var _CurveCollection__WEBPACK_IMPORTED_MODULE_20__ = __webpack_require__(/*! ./CurveCollection */ "../../core/geometry/lib/esm/curve/CurveCollection.js");
 /* harmony import */ var _CurveCurve__WEBPACK_IMPORTED_MODULE_30__ = __webpack_require__(/*! ./CurveCurve */ "../../core/geometry/lib/esm/curve/CurveCurve.js");
 /* harmony import */ var _CurvePrimitive__WEBPACK_IMPORTED_MODULE_22__ = __webpack_require__(/*! ./CurvePrimitive */ "../../core/geometry/lib/esm/curve/CurvePrimitive.js");
 /* harmony import */ var _CurveWireMomentsXYZ__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ./CurveWireMomentsXYZ */ "../../core/geometry/lib/esm/curve/CurveWireMomentsXYZ.js");
+/* harmony import */ var _GeometryQuery__WEBPACK_IMPORTED_MODULE_32__ = __webpack_require__(/*! ./GeometryQuery */ "../../core/geometry/lib/esm/curve/GeometryQuery.js");
+/* harmony import */ var _internalContexts_MultiChainCollector__WEBPACK_IMPORTED_MODULE_24__ = __webpack_require__(/*! ./internalContexts/MultiChainCollector */ "../../core/geometry/lib/esm/curve/internalContexts/MultiChainCollector.js");
 /* harmony import */ var _internalContexts_PolygonOffsetContext__WEBPACK_IMPORTED_MODULE_17__ = __webpack_require__(/*! ./internalContexts/PolygonOffsetContext */ "../../core/geometry/lib/esm/curve/internalContexts/PolygonOffsetContext.js");
 /* harmony import */ var _LineString3d__WEBPACK_IMPORTED_MODULE_16__ = __webpack_require__(/*! ./LineString3d */ "../../core/geometry/lib/esm/curve/LineString3d.js");
 /* harmony import */ var _Loop__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ./Loop */ "../../core/geometry/lib/esm/curve/Loop.js");
+/* harmony import */ var _ParityRegion__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ./ParityRegion */ "../../core/geometry/lib/esm/curve/ParityRegion.js");
 /* harmony import */ var _Path__WEBPACK_IMPORTED_MODULE_19__ = __webpack_require__(/*! ./Path */ "../../core/geometry/lib/esm/curve/Path.js");
 /* harmony import */ var _Query_ConsolidateAdjacentPrimitivesContext__WEBPACK_IMPORTED_MODULE_28__ = __webpack_require__(/*! ./Query/ConsolidateAdjacentPrimitivesContext */ "../../core/geometry/lib/esm/curve/Query/ConsolidateAdjacentPrimitivesContext.js");
 /* harmony import */ var _Query_CurveSplitContext__WEBPACK_IMPORTED_MODULE_21__ = __webpack_require__(/*! ./Query/CurveSplitContext */ "../../core/geometry/lib/esm/curve/Query/CurveSplitContext.js");
 /* harmony import */ var _Query_InOutTests__WEBPACK_IMPORTED_MODULE_18__ = __webpack_require__(/*! ./Query/InOutTests */ "../../core/geometry/lib/esm/curve/Query/InOutTests.js");
 /* harmony import */ var _Query_PlanarSubdivision__WEBPACK_IMPORTED_MODULE_12__ = __webpack_require__(/*! ./Query/PlanarSubdivision */ "../../core/geometry/lib/esm/curve/Query/PlanarSubdivision.js");
 /* harmony import */ var _RegionMomentsXY__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./RegionMomentsXY */ "../../core/geometry/lib/esm/curve/RegionMomentsXY.js");
-/* harmony import */ var _internalContexts_MultiChainCollector__WEBPACK_IMPORTED_MODULE_24__ = __webpack_require__(/*! ./internalContexts/MultiChainCollector */ "../../core/geometry/lib/esm/curve/internalContexts/MultiChainCollector.js");
-/* harmony import */ var _GeometryQuery__WEBPACK_IMPORTED_MODULE_32__ = __webpack_require__(/*! ./GeometryQuery */ "../../core/geometry/lib/esm/curve/GeometryQuery.js");
 /* harmony import */ var _RegionOpsClassificationSweeps__WEBPACK_IMPORTED_MODULE_10__ = __webpack_require__(/*! ./RegionOpsClassificationSweeps */ "../../core/geometry/lib/esm/curve/RegionOpsClassificationSweeps.js");
 /* harmony import */ var _UnionRegion__WEBPACK_IMPORTED_MODULE_11__ = __webpack_require__(/*! ./UnionRegion */ "../../core/geometry/lib/esm/curve/UnionRegion.js");
-/* harmony import */ var _topology_HalfEdgeGraphSearch__WEBPACK_IMPORTED_MODULE_13__ = __webpack_require__(/*! ../topology/HalfEdgeGraphSearch */ "../../core/geometry/lib/esm/topology/HalfEdgeGraphSearch.js");
-/* harmony import */ var _ParityRegion__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ./ParityRegion */ "../../core/geometry/lib/esm/curve/ParityRegion.js");
 /*---------------------------------------------------------------------------------------------
 * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
 * See LICENSE.md in the project root for license terms and full copyright notice.
@@ -189252,7 +189273,7 @@ class RegionOps {
      * @param loopsB second set of loops
      * @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 connecting interior loops to exterior loops.
+     * @returns a region resulting from merging input loops and the boolean operation. May contain bridge edges added to connect interior loops to exterior loops.
      */
     static regionBooleanXY(loopsA, loopsB, operation, mergeTolerance = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.smallMetricDistance) {
         const result = _UnionRegion__WEBPACK_IMPORTED_MODULE_11__.UnionRegion.create();
@@ -189260,7 +189281,7 @@ class RegionOps {
         context.addMembers(loopsA, loopsB);
         context.annotateAndMergeCurvesInGraph(mergeTolerance);
         const range = context.groupA.range().union(context.groupB.range());
-        const areaTol = this.computeXYAreaTolerance(range);
+        const areaTol = this.computeXYAreaTolerance(range, mergeTolerance);
         context.runClassificationSweep(operation, (_graph, face, faceType, area) => {
             // ignore danglers and null faces, but not 2-edge "banana" faces with nonzero area
             if (face.countEdgesAroundFace() < 2)
@@ -189578,23 +189599,24 @@ class RegionOps {
     }
     /**
      * Find all areas bounded by the unstructured, possibly intersecting curves.
-     * * This method performs no merging of nearly coincident edges and vertices, which can lead to unexpected results
-     * given sufficiently imprecise input. Input geometry consisting of regions can be merged for better results by pre-processing with
-     * [[regionBooleanXY]].
+     * * A common use case of this method is to assemble the bounding "exterior" loop (or loops) containing the input curves.
+     * * 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
      * @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.
      *    * `negativeAreaLoops` contains (probably just one) "exterior" loop which is ordered clockwise.
      *    * `slivers` contains sliver loops that have zero area, such as appear between coincident curves.
      *    * `edges` contains a [[LoopCurveLoopCurve]] object for each component edge, collecting both loops adjacent to the edge and a constituent curve in each.
      */
-    static constructAllXYRegionLoops(curvesAndRegions) {
-        const primitivesA = RegionOps.collectCurvePrimitives(curvesAndRegions, undefined, true);
-        const primitivesB = this.expandLineStrings(primitivesA);
-        const range = this.curveArrayRange(primitivesB);
-        const areaTol = this.computeXYAreaTolerance(range);
-        const intersections = _CurveCurve__WEBPACK_IMPORTED_MODULE_30__.CurveCurve.allIntersectionsAmongPrimitivesXY(primitivesB);
-        const graph = _Query_PlanarSubdivision__WEBPACK_IMPORTED_MODULE_12__.PlanarSubdivision.assembleHalfEdgeGraph(primitivesB, intersections);
+    static constructAllXYRegionLoops(curvesAndRegions, tolerance = _Geometry__WEBPACK_IMPORTED_MODULE_2__.Geometry.smallMetricDistance) {
+        const primitives = RegionOps.collectCurvePrimitives(curvesAndRegions, undefined, true, true);
+        const range = this.curveArrayRange(primitives);
+        const areaTol = this.computeXYAreaTolerance(range, tolerance);
+        const intersections = _CurveCurve__WEBPACK_IMPORTED_MODULE_30__.CurveCurve.allIntersectionsAmongPrimitivesXY(primitives, tolerance);
+        const graph = _Query_PlanarSubdivision__WEBPACK_IMPORTED_MODULE_12__.PlanarSubdivision.assembleHalfEdgeGraph(primitives, intersections, tolerance);
         return _Query_PlanarSubdivision__WEBPACK_IMPORTED_MODULE_12__.PlanarSubdivision.collectSignedLoopSetsInHalfEdgeGraph(graph, areaTol);
     }
     /**
@@ -190210,7 +190232,7 @@ class RegionBooleanContext {
         }
         //    const range = RegionOps.curveArrayRange(allPrimitives);
         const intersections = _CurveCurve__WEBPACK_IMPORTED_MODULE_15__.CurveCurve.allIntersectionsAmongPrimitivesXY(allPrimitives, mergeTolerance);
-        const graph = _Query_PlanarSubdivision__WEBPACK_IMPORTED_MODULE_16__.PlanarSubdivision.assembleHalfEdgeGraph(allPrimitives, intersections);
+        const graph = _Query_PlanarSubdivision__WEBPACK_IMPORTED_MODULE_16__.PlanarSubdivision.assembleHalfEdgeGraph(allPrimitives, intersections, mergeTolerance);
         this.graph = graph;
         this.faceAreaFunction = faceAreaFromCurvedEdgeData;
     }
@@ -197309,15 +197331,20 @@ __webpack_require__.r(__webpack_exports__);
 /* harmony export */ __webpack_require__.d(__webpack_exports__, {
 /* harmony export */   "CoincidentGeometryQuery": () => (/* binding */ CoincidentGeometryQuery)
 /* harmony export */ });
-/* harmony import */ var _curve_CurveLocationDetail__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ../curve/CurveLocationDetail */ "../../core/geometry/lib/esm/curve/CurveLocationDetail.js");
-/* harmony import */ var _Geometry__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ../Geometry */ "../../core/geometry/lib/esm/Geometry.js");
-/* harmony import */ var _AngleSweep__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ./AngleSweep */ "../../core/geometry/lib/esm/geometry3d/AngleSweep.js");
-/* harmony import */ var _Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./Point3dVector3d */ "../../core/geometry/lib/esm/geometry3d/Point3dVector3d.js");
-/* harmony import */ var _Segment1d__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ./Segment1d */ "../../core/geometry/lib/esm/geometry3d/Segment1d.js");
+/* 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_CurveLocationDetail__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ../curve/CurveLocationDetail */ "../../core/geometry/lib/esm/curve/CurveLocationDetail.js");
+/* harmony import */ var _Geometry__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ../Geometry */ "../../core/geometry/lib/esm/Geometry.js");
+/* harmony import */ var _AngleSweep__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ./AngleSweep */ "../../core/geometry/lib/esm/geometry3d/AngleSweep.js");
+/* harmony import */ var _Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./Point3dVector3d */ "../../core/geometry/lib/esm/geometry3d/Point3dVector3d.js");
+/* harmony import */ var _Segment1d__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ./Segment1d */ "../../core/geometry/lib/esm/geometry3d/Segment1d.js");
 /*---------------------------------------------------------------------------------------------
 * Copyright (c) Bentley Systems, Incorporated. All rights reserved.
 * See LICENSE.md in the project root for license terms and full copyright notice.
 *--------------------------------------------------------------------------------------------*/
+/** @packageDocumentation
+ * @module CartesianGeometry
+ */
+
 
 
 
@@ -197333,10 +197360,10 @@ class CoincidentGeometryQuery {
     get tolerance() {
         return this._tolerance;
     }
-    constructor(tolerance = _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.smallMetricDistance) {
+    constructor(tolerance = _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.smallMetricDistance) {
         this._tolerance = tolerance;
     }
-    static create(tolerance = _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.smallMetricDistance) {
+    static create(tolerance = _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.smallMetricDistance) {
         return new CoincidentGeometryQuery(tolerance);
     }
     /**
@@ -197359,12 +197386,12 @@ class CoincidentGeometryQuery {
      *
      */
     projectPointToSegmentXY(spacePoint, pointA, pointB) {
-        this._vectorU = _Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d.createStartEnd(pointA, pointB, this._vectorU);
-        this._vectorV = _Point3dVector3d__WEBPACK_IMPORTED_MODULE_1__.Vector3d.createStartEnd(pointA, spacePoint, this._vectorV);
+        this._vectorU = _Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Vector3d.createStartEnd(pointA, pointB, this._vectorU);
+        this._vectorV = _Point3dVector3d__WEBPACK_IMPORTED_MODULE_2__.Vector3d.createStartEnd(pointA, spacePoint, this._vectorV);
         const uDotU = this._vectorU.dotProductXY(this._vectorU);
         const uDotV = this._vectorU.dotProductXY(this._vectorV);
-        const fraction = _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.safeDivideFraction(uDotV, uDotU, 0.0);
-        return _curve_CurveLocationDetail__WEBPACK_IMPORTED_MODULE_2__.CurveLocationDetail.createCurveFractionPoint(undefined, fraction, pointA.interpolate(fraction, pointB));
+        const fraction = _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.safeDivideFraction(uDotV, uDotU, 0.0);
+        return _curve_CurveLocationDetail__WEBPACK_IMPORTED_MODULE_3__.CurveLocationDetail.createCurveFractionPoint(undefined, fraction, pointA.interpolate(fraction, pointB));
     }
     /**
      * * project `pointA0` and `pointA1` onto the segment with `pointB0` and `pointB1`
@@ -197375,84 +197402,82 @@ class CoincidentGeometryQuery {
      * @param pointB1 end point of segment B
      */
     coincidentSegmentRangeXY(pointA0, pointA1, pointB0, pointB1, restrictToBounds = true) {
-        const detailAOnB = this.projectPointToSegmentXY(pointA0, pointB0, pointB1);
-        if (pointA0.distanceXY(detailAOnB.point) > this._tolerance)
+        const detailA0OnB = this.projectPointToSegmentXY(pointA0, pointB0, pointB1);
+        if (pointA0.distanceXY(detailA0OnB.point) > this._tolerance)
             return undefined;
         const detailA1OnB = this.projectPointToSegmentXY(pointA1, pointB0, pointB1);
         if (pointA1.distanceXY(detailA1OnB.point) > this._tolerance)
             return undefined;
-        const detailBOnA = this.projectPointToSegmentXY(pointB0, pointA0, pointA1);
-        if (pointB0.distanceXY(detailBOnA.point) > this._tolerance)
+        const detailB0OnA = this.projectPointToSegmentXY(pointB0, pointA0, pointA1);
+        if (pointB0.distanceXY(detailB0OnA.point) > this._tolerance)
             return undefined;
         const detailB1OnA = this.projectPointToSegmentXY(pointB1, pointA0, pointA1);
         if (pointB1.distanceXY(detailB1OnA.point) > this._tolerance)
             return undefined;
-        detailAOnB.fraction1 = detailA1OnB.fraction;
-        detailAOnB.point1 = detailA1OnB.point; // capture -- detailB0OnA is not reused.
-        detailBOnA.fraction1 = detailB1OnA.fraction;
-        detailBOnA.point1 = detailB1OnA.point;
+        detailA0OnB.fraction1 = detailA1OnB.fraction;
+        detailA0OnB.point1 = detailA1OnB.point; // capture -- detailA1OnB is not reused.
+        detailB0OnA.fraction1 = detailB1OnA.fraction;
+        detailB0OnA.point1 = detailB1OnA.point;
         if (!restrictToBounds)
-            return _curve_CurveLocationDetail__WEBPACK_IMPORTED_MODULE_2__.CurveLocationDetailPair.createCapture(detailBOnA, detailAOnB);
-        const segment = _Segment1d__WEBPACK_IMPORTED_MODULE_3__.Segment1d.create(detailBOnA.fraction, detailBOnA.fraction1);
+            return _curve_CurveLocationDetail__WEBPACK_IMPORTED_MODULE_3__.CurveLocationDetailPair.createCapture(detailB0OnA, detailA0OnB);
+        const segment = _Segment1d__WEBPACK_IMPORTED_MODULE_4__.Segment1d.create(detailB0OnA.fraction, detailB0OnA.fraction1);
         if (segment.clampDirectedTo01()) {
-            segment.reverseIfNeededForDeltaSign(1.0);
             const f0 = segment.x0;
             const f1 = segment.x1;
-            const h0 = detailBOnA.inverseInterpolateFraction(f0);
-            const h1 = detailBOnA.inverseInterpolateFraction(f1);
+            const h0 = detailB0OnA.inverseInterpolateFraction(f0);
+            const h1 = detailB0OnA.inverseInterpolateFraction(f1);
             // recompute fractions and points..
-            CoincidentGeometryQuery.assignDetailInterpolatedFractionsAndPoints(detailBOnA, f0, f1, pointA0, pointA1);
-            CoincidentGeometryQuery.assignDetailInterpolatedFractionsAndPoints(detailAOnB, h0, h1, pointB0, pointB1);
-            return _curve_CurveLocationDetail__WEBPACK_IMPORTED_MODULE_2__.CurveLocationDetailPair.createCapture(detailBOnA, detailAOnB);
+            CoincidentGeometryQuery.assignDetailInterpolatedFractionsAndPoints(detailB0OnA, f0, f1, pointA0, pointA1, f0 > f1);
+            CoincidentGeometryQuery.assignDetailInterpolatedFractionsAndPoints(detailA0OnB, h0, h1, pointB0, pointB1, h0 > h1);
+            return _curve_CurveLocationDetail__WEBPACK_IMPORTED_MODULE_3__.CurveLocationDetailPair.createCapture(detailB0OnA, detailA0OnB);
         }
         else {
             if (segment.signedDelta() < 0.0) {
-                if (detailBOnA.point.isAlmostEqual(pointA0)) {
-                    detailBOnA.collapseToStart();
-                    detailAOnB.collapseToStart();
-                    return _curve_CurveLocationDetail__WEBPACK_IMPORTED_MODULE_2__.CurveLocationDetailPair.createCapture(detailBOnA, detailAOnB);
+                if (detailB0OnA.point.isAlmostEqual(pointA0, this.tolerance)) {
+                    detailB0OnA.collapseToStart();
+                    detailA0OnB.collapseToStart();
+                    return _curve_CurveLocationDetail__WEBPACK_IMPORTED_MODULE_3__.CurveLocationDetailPair.createCapture(detailB0OnA, detailA0OnB);
                 }
-                if (detailBOnA.point1.isAlmostEqual(pointA1)) {
-                    detailBOnA.collapseToEnd();
-                    detailAOnB.collapseToEnd();
-                    return _curve_CurveLocationDetail__WEBPACK_IMPORTED_MODULE_2__.CurveLocationDetailPair.createCapture(detailBOnA, detailAOnB);
+                if (detailB0OnA.point1.isAlmostEqual(pointA1, this.tolerance)) {
+                    detailB0OnA.collapseToEnd();
+                    detailA0OnB.collapseToEnd();
+                    return _curve_CurveLocationDetail__WEBPACK_IMPORTED_MODULE_3__.CurveLocationDetailPair.createCapture(detailB0OnA, detailA0OnB);
                 }
             }
             else {
-                if (detailBOnA.point.isAlmostEqual(pointA1)) {
-                    detailBOnA.collapseToStart();
-                    detailAOnB.collapseToEnd();
-                    return _curve_CurveLocationDetail__WEBPACK_IMPORTED_MODULE_2__.CurveLocationDetailPair.createCapture(detailBOnA, detailAOnB);
+                if (detailB0OnA.point.isAlmostEqual(pointA1, this.tolerance)) {
+                    detailB0OnA.collapseToStart();
+                    detailA0OnB.collapseToEnd();
+                    return _curve_CurveLocationDetail__WEBPACK_IMPORTED_MODULE_3__.CurveLocationDetailPair.createCapture(detailB0OnA, detailA0OnB);
                 }
-                if (detailBOnA.point1.isAlmostEqual(pointA0)) {
-                    detailBOnA.collapseToEnd();
-                    detailAOnB.collapseToStart();
-                    return _curve_CurveLocationDetail__WEBPACK_IMPORTED_MODULE_2__.CurveLocationDetailPair.createCapture(detailBOnA, detailAOnB);
+                if (detailB0OnA.point1.isAlmostEqual(pointA0, this.tolerance)) {
+                    detailB0OnA.collapseToEnd();
+                    detailA0OnB.collapseToStart();
+                    return _curve_CurveLocationDetail__WEBPACK_IMPORTED_MODULE_3__.CurveLocationDetailPair.createCapture(detailB0OnA, detailA0OnB);
                 }
             }
         }
         return undefined;
     }
     /**
-     * Create a CurveLocationDetailPair from . . .
+     * Create a CurveLocationDetailPair for a coincident interval of two overlapping curves
      * @param cpA curveA
-     * @param cpB curve B
-     * @param fractionsOnA fractions of an active section of curveA
-     * @param fractionB0 fraction of an original containing B interval
-     * @param fractionB1 end fraction of an original containing B interval
+     * @param cpB curveB
+     * @param fractionsOnA coincident interval of curveB in fraction space of curveA
+     * @param fractionB0 curveB start in fraction space of curveA
+     * @param fractionB1 curveB end in fraction space of curveA
+     * @param reverse whether curveB and curveA have opposite direction
      */
     createDetailPair(cpA, cpB, fractionsOnA, fractionB0, fractionB1, reverse) {
         const deltaB = fractionB1 - fractionB0;
-        const g0 = _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.conditionalDivideFraction(fractionsOnA.x0 - fractionB0, deltaB);
-        const g1 = _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.conditionalDivideFraction(fractionsOnA.x1 - fractionB0, deltaB);
+        const g0 = _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.conditionalDivideFraction(fractionsOnA.x0 - fractionB0, deltaB);
+        const g1 = _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.conditionalDivideFraction(fractionsOnA.x1 - fractionB0, deltaB);
         if (g0 !== undefined && g1 !== undefined) {
-            const detailA = _curve_CurveLocationDetail__WEBPACK_IMPORTED_MODULE_2__.CurveLocationDetail.createCurveEvaluatedFractionFraction(cpA, fractionsOnA.x0, fractionsOnA.x1);
-            const detailB = _curve_CurveLocationDetail__WEBPACK_IMPORTED_MODULE_2__.CurveLocationDetail.createCurveEvaluatedFractionFraction(cpB, g0, g1);
-            if (reverse) {
+            const detailA = _curve_CurveLocationDetail__WEBPACK_IMPORTED_MODULE_3__.CurveLocationDetail.createCurveEvaluatedFractionFraction(cpA, fractionsOnA.x0, fractionsOnA.x1);
+            const detailB = _curve_CurveLocationDetail__WEBPACK_IMPORTED_MODULE_3__.CurveLocationDetail.createCurveEvaluatedFractionFraction(cpB, g0, g1);
+            if (reverse)
                 detailA.swapFractionsAndPoints();
-                detailB.swapFractionsAndPoints();
-            }
-            return _curve_CurveLocationDetail__WEBPACK_IMPORTED_MODULE_2__.CurveLocationDetailPair.createCapture(detailA, detailB);
+            return _curve_CurveLocationDetail__WEBPACK_IMPORTED_MODULE_3__.CurveLocationDetailPair.createCapture(detailA, detailB);
         }
         return undefined;
     }
@@ -197469,43 +197494,67 @@ class CoincidentGeometryQuery {
      * @param arcA
      * @param arcB
      * @param _restrictToBounds
-     * @return 0, 1, or 2 overlap intervals.
+     * @return 0, 1, or 2 overlap points/intervals
      */
     coincidentArcIntersectionXY(arcA, arcB, _restrictToBounds = true) {
         let result;
-        if (arcA.center.isAlmostEqual(arcB.center)) {
+        if (arcA.center.isAlmostEqual(arcB.center, this.tolerance)) {
             const matrixBToA = arcA.matrixRef.multiplyMatrixInverseMatrix(arcB.matrixRef);
             if (matrixBToA) {
                 const ux = matrixBToA.at(0, 0);
                 const uy = matrixBToA.at(1, 0);
                 const vx = matrixBToA.at(0, 1);
                 const vy = matrixBToA.at(1, 1);
-                const ru = _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.hypotenuseXY(ux, uy);
-                const rv = _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.hypotenuseXY(vx, vy);
-                const dot = _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.dotProductXYXY(ux, uy, vx, vy);
-                const cross = _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.crossProductXYXY(ux, uy, vx, vy);
-                if (_Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.isAlmostEqualNumber(ru, 1.0)
-                    && _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.isAlmostEqualNumber(rv, 1.0)
-                    && _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.isAlmostEqualNumber(0, dot)) {
-                    const alphaB0Radians = Math.atan2(uy, ux); // angular position of arcB 0 point in A sweep
-                    const sweepDirection = cross > 0 ? 1.0 : -1.0; // 1 if arcB's parameter space sweeps forward, -1 if reverse
-                    const betaStartRadians = alphaB0Radians + sweepDirection * arcB.sweep.startRadians;
-                    const betaEndRadians = alphaB0Radians + sweepDirection * arcB.sweep.endRadians;
+                const ru = _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.hypotenuseXY(ux, uy);
+                const rv = _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.hypotenuseXY(vx, vy);
+                const dot = _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.dotProductXYXY(ux, uy, vx, vy);
+                const cross = _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.crossProductXYXY(ux, uy, vx, vy);
+                if (_Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.isAlmostEqualNumber(ru, 1.0)
+                    && _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.isAlmostEqualNumber(rv, 1.0)
+                    && _Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.isAlmostEqualNumber(0, dot)) {
+                    const alphaB0Radians = Math.atan2(uy, ux); // angular position of arcB 0 point in arcA sweep
+                    const sweepDirection = cross > 0 ? 1.0 : -1.0; // 1 if arcB parameter space sweeps in same direction as arcA, -1 if opposite
+                    const betaStartRadians = alphaB0Radians + sweepDirection * arcB.sweep.startRadians; // arcB start in arcA parameter space
+                    const betaEndRadians = alphaB0Radians + sweepDirection * arcB.sweep.endRadians; // arcB end in arcA parameter space
                     const fractionSpacesReversed = (sweepDirection * arcA.sweep.sweepRadians * arcB.sweep.sweepRadians) < 0;
-                    const sweepB = _AngleSweep__WEBPACK_IMPORTED_MODULE_4__.AngleSweep.createStartEndRadians(betaStartRadians, betaEndRadians);
+                    const sweepB = _AngleSweep__WEBPACK_IMPORTED_MODULE_5__.AngleSweep.createStartEndRadians(betaStartRadians, betaEndRadians);
                     const sweepA = arcA.sweep;
                     const fractionPeriodA = sweepA.fractionPeriod();
-                    const fractionB0 = sweepA.radiansToPositivePeriodicFraction(sweepB.startRadians);
-                    const fractionSweep = sweepB.sweepRadians / sweepA.sweepRadians;
-                    const fractionB1 = fractionB0 + fractionSweep;
-                    const fractionSweepB = _Segment1d__WEBPACK_IMPORTED_MODULE_3__.Segment1d.create(fractionB0, fractionB1);
-                    if (fractionSweepB.clampDirectedTo01())
-                        result = this.appendDetailPair(result, this.createDetailPair(arcA, arcB, fractionSweepB, fractionB0, fractionB1, fractionSpacesReversed));
-                    if (fractionB1 > fractionPeriodA) {
-                        const fractionSweepBWrap = _Segment1d__WEBPACK_IMPORTED_MODULE_3__.Segment1d.create(fractionB0 - fractionPeriodA, fractionB1 - fractionPeriodA);
-                        if (fractionSweepBWrap.clampDirectedTo01())
-                            result = this.appendDetailPair(result, this.createDetailPair(arcA, arcB, fractionSweepBWrap, fractionB0, fractionB1, fractionSpacesReversed));
-                    }
+                    const fractionB0 = sweepA.radiansToPositivePeriodicFraction(sweepB.startRadians); // arcB start in arcA fraction space
+                    (0,_itwin_core_bentley__WEBPACK_IMPORTED_MODULE_0__.assert)(fractionB0 >= 0.0);
+                    const fractionSweep = sweepB.sweepRadians / sweepA.sweepRadians; // arcB sweep in arcA fraction space
+                    const fractionB1 = fractionB0 + fractionSweep; // arcB end in arcA fraction space
+                    const fractionSweepB = _Segment1d__WEBPACK_IMPORTED_MODULE_4__.Segment1d.create(fractionB0, fractionB1);
+                    /** lambda to add a coincident interval or isolated intersection, given inputs in arcA fraction space
+                     * @param arcBInArcAFractionSpace span of arcB in arcA fraction space. On return, clamped to [0,1] if nontrivial.
+                     * @param testStartOfArcA if no nontrivial coincident interval was found, look for an isolated intersection at the start (true) or end (false) of arcA
+                     * @returns whether a detail pair was appended to result
+                     */
+                    const appendCoincidentIntersection = (arcBInArcAFractionSpace, testStartOfArcA) => {
+                        const size = result ? result.length : 0;
+                        const arcBStart = arcBInArcAFractionSpace.x0;
+                        const arcBEnd = arcBInArcAFractionSpace.x1;
+                        if (arcBInArcAFractionSpace.clampDirectedTo01() && !_Geometry__WEBPACK_IMPORTED_MODULE_1__.Geometry.isSmallRelative(arcBInArcAFractionSpace.absoluteDelta())) {
+                            result = this.appendDetailPair(result, this.createDetailPair(arcA, arcB, arcBInArcAFractionSpace, arcBStart, arcBEnd, fractionSpacesReversed));
+                        }
+                        else { // test isolated intersection
+                            const testStartOfArcB = fractionSpacesReversed ? testStartOfArcA : !testStartOfArcA;
+                            const arcAPt = this._point0 = testStartOfArcA ? arcA.startPoint(this._point0) : arcA.endPoint(this._point0);
+                            const arcBPt = this._point1 = testStartOfArcB ? arcB.startPoint(this._point1) : arcB.endPoint(this._point1);
+                            if (arcAPt.isAlmostEqual(arcBPt, this.tolerance)) {
+                                const detailA = _curve_CurveLocationDetail__WEBPACK_IMPORTED_MODULE_3__.CurveLocationDetail.createCurveFractionPoint(arcA, testStartOfArcA ? 0 : 1, arcAPt);
+                                const detailB = _curve_CurveLocationDetail__WEBPACK_IMPORTED_MODULE_3__.CurveLocationDetail.createCurveFractionPoint(arcB, testStartOfArcB ? 0 : 1, arcBPt);
+                                result = this.appendDetailPair(result, _curve_CurveLocationDetail__WEBPACK_IMPORTED_MODULE_3__.CurveLocationDetailPair.createCapture(detailA, detailB));
+                            }
+                        }
+                        return result !== undefined && result.length > size;
+                    };
+                    appendCoincidentIntersection(fractionSweepB, false); // compute overlap in strict interior, or at end of arcA
+                    // check overlap at start of arcA with a periodic shift of fractionSweepB
+                    if (fractionB1 >= fractionPeriodA)
+                        appendCoincidentIntersection(_Segment1d__WEBPACK_IMPORTED_MODULE_4__.Segment1d.create(fractionB0 - fractionPeriodA, fractionB1 - fractionPeriodA), true);
+                    else if (fractionB0 === 0.0)
+                        appendCoincidentIntersection(_Segment1d__WEBPACK_IMPORTED_MODULE_4__.Segment1d.create(fractionB0 + fractionPeriodA, fractionB1 + fractionPeriodA), true);
                 }
             }
         }
@@ -204391,7 +204440,7 @@ class Matrix3d {
      * almost independent and matrix is invertible).
      */
     conditionNumber() {
-        const determinant = this.determinant();
+        const determinant = Math.abs(this.determinant());
         const columnMagnitudeSum = _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.hypotenuseXYZ(this.coffs[0], this.coffs[3], this.coffs[6])
             + _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.hypotenuseXYZ(this.coffs[1], this.coffs[4], this.coffs[7])
             + _Geometry__WEBPACK_IMPORTED_MODULE_0__.Geometry.hypotenuseXYZ(this.coffs[2], this.coffs[5], this.coffs[8]);
@@ -249353,6 +249402,7 @@ class HalfEdgeGraphOps {
     }
 }
 /**
+ * Note: this class uses hardcoded micrometer coordinate/cluster tolerance throughout.
  * @internal
  */
 class HalfEdgeGraphMerge {
@@ -282312,7 +282362,7 @@ module.exports = JSON.parse('{"name":"axios","version":"0.21.4","description":"P
 /***/ ((module) => {
 
 "use strict";
-module.exports = JSON.parse('{"name":"@itwin/core-frontend","version":"4.0.0-dev.100","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","build:cjs":"npm run -s copy:js:cjs && tsc 1>&2 --outDir lib/cjs","build:esm":"npm run -s copy:js:esm && tsc 1>&2 --module ES2020 --outDir lib/esm","clean":"rimraf lib .rush/temp/package-deps*.json","copy:public":"cpx \\"./src/public/**/*\\" ./lib/public","copy:js:cjs":"cpx \\"./src/**/*.js\\" ./lib/cjs","copy:js:esm":"cpx \\"./src/**/*.js\\" ./lib/esm","docs":"betools docs --includes=../../generated-docs/extract --json=../../generated-docs/core/core-frontend/file.json --tsIndexFile=./core-frontend.ts --onlyJson --excludes=webgl/**/*,**/primitives,**/map/*.d.ts,**/tile/*.d.ts,**/*-css.ts","extract-api":"betools extract-api --entry=core-frontend && npm run extract-extension-api","extract-extension-api":"eslint --no-eslintrc -c \\"./node_modules/@itwin/eslint-plugin/dist/configs/extension-exports-config.js\\" \\"./src/**/*.ts\\" 1>&2","lint":"eslint -f visualstudio \\"./src/**/*.ts\\" 1>&2","pseudolocalize":"betools pseudolocalize --englishDir ./src/public/locales/en --out ./public/locales/en-PSEUDO","test":"npm run -s webpackTests && certa -r chrome","cover":"npm -s test","test:debug":"certa -r chrome --debug","webpackTests":"webpack --config ./src/test/utils/webpack.config.js 1>&2"},"repository":{"type":"git","url":"https://github.com/iTwin/itwinjs-core.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:^4.0.0-dev.100","@itwin/core-bentley":"workspace:^4.0.0-dev.100","@itwin/core-common":"workspace:^4.0.0-dev.100","@itwin/core-geometry":"workspace:^4.0.0-dev.100","@itwin/core-orbitgt":"workspace:^4.0.0-dev.100","@itwin/core-quantity":"workspace:^4.0.0-dev.100"},"//devDependencies":["NOTE: All peerDependencies should also be listed as devDependencies since peerDependencies are not considered by npm install","NOTE: All tools used by scripts in this package must be listed as devDependencies"],"devDependencies":{"@itwin/appui-abstract":"workspace:*","@itwin/build-tools":"workspace:*","@itwin/core-bentley":"workspace:*","@itwin/core-common":"workspace:*","@itwin/core-geometry":"workspace:*","@itwin/core-orbitgt":"workspace:*","@itwin/core-quantity":"workspace:*","@itwin/certa":"workspace:*","@itwin/eslint-plugin":"^4.0.0-dev.33","@types/chai":"4.3.1","@types/chai-as-promised":"^7","@types/mocha":"^8.2.2","@types/node":"^18.11.5","@types/sinon":"^9.0.0","babel-loader":"~8.2.5","babel-plugin-istanbul":"~6.1.1","chai":"^4.1.2","chai-as-promised":"^7","cpx2":"^3.0.0","eslint":"^8.36.0","glob":"^7.1.2","mocha":"^10.0.0","nyc":"^15.1.0","rimraf":"^3.0.2","sinon":"^9.0.2","source-map-loader":"^4.0.0","typescript":"~5.0.2","webpack":"^5.76.0"},"//dependencies":["NOTE: these dependencies should be only for things that DO NOT APPEAR IN THE API","NOTE: core-frontend should remain UI technology agnostic, so no react/angular dependencies are allowed"],"dependencies":{"@itwin/object-storage-azure":"^1.5.0","@itwin/cloud-agnostic-core":"^1.5.0","@itwin/object-storage-core":"^1.5.0","@itwin/core-i18n":"workspace:*","@itwin/core-telemetry":"workspace:*","@itwin/webgl-compatibility":"workspace:*","@loaders.gl/core":"^3.1.6","@loaders.gl/draco":"^3.1.6","fuse.js":"^3.3.0","wms-capabilities":"0.4.0","reflect-metadata":"0.1.13"},"nyc":{"extends":"./node_modules/@itwin/build-tools/.nycrc"},"eslintConfig":{"plugins":["@itwin"],"extends":"plugin:@itwin/itwinjs-recommended","rules":{"@itwin/no-internal-barrel-imports":["error",{"required-barrel-modules":["./src/tile/internal.ts"]}],"@itwin/public-extension-exports":["error",{"releaseTags":["public","preview"],"outputApiFile":false}]},"overrides":[{"files":["*.test.ts","*.test.tsx","**/test/**/*.ts"],"rules":{"@itwin/no-internal-barrel-imports":"off"}}]}}');
+module.exports = JSON.parse('{"name":"@itwin/core-frontend","version":"4.0.0-dev.102","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","build:cjs":"npm run -s copy:js:cjs && tsc 1>&2 --outDir lib/cjs","build:esm":"npm run -s copy:js:esm && tsc 1>&2 --module ES2020 --outDir lib/esm","clean":"rimraf lib .rush/temp/package-deps*.json","copy:public":"cpx \\"./src/public/**/*\\" ./lib/public","copy:js:cjs":"cpx \\"./src/**/*.js\\" ./lib/cjs","copy:js:esm":"cpx \\"./src/**/*.js\\" ./lib/esm","docs":"betools docs --includes=../../generated-docs/extract --json=../../generated-docs/core/core-frontend/file.json --tsIndexFile=./core-frontend.ts --onlyJson --excludes=webgl/**/*,**/primitives,**/map/*.d.ts,**/tile/*.d.ts,**/*-css.ts","extract-api":"betools extract-api --entry=core-frontend && npm run extract-extension-api","extract-extension-api":"eslint --no-eslintrc -c \\"./node_modules/@itwin/eslint-plugin/dist/configs/extension-exports-config.js\\" \\"./src/**/*.ts\\" 1>&2","lint":"eslint -f visualstudio \\"./src/**/*.ts\\" 1>&2","pseudolocalize":"betools pseudolocalize --englishDir ./src/public/locales/en --out ./public/locales/en-PSEUDO","test":"npm run -s webpackTests && certa -r chrome","cover":"npm -s test","test:debug":"certa -r chrome --debug","webpackTests":"webpack --config ./src/test/utils/webpack.config.js 1>&2"},"repository":{"type":"git","url":"https://github.com/iTwin/itwinjs-core.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:^4.0.0-dev.102","@itwin/core-bentley":"workspace:^4.0.0-dev.102","@itwin/core-common":"workspace:^4.0.0-dev.102","@itwin/core-geometry":"workspace:^4.0.0-dev.102","@itwin/core-orbitgt":"workspace:^4.0.0-dev.102","@itwin/core-quantity":"workspace:^4.0.0-dev.102"},"//devDependencies":["NOTE: All peerDependencies should also be listed as devDependencies since peerDependencies are not considered by npm install","NOTE: All tools used by scripts in this package must be listed as devDependencies"],"devDependencies":{"@itwin/appui-abstract":"workspace:*","@itwin/build-tools":"workspace:*","@itwin/core-bentley":"workspace:*","@itwin/core-common":"workspace:*","@itwin/core-geometry":"workspace:*","@itwin/core-orbitgt":"workspace:*","@itwin/core-quantity":"workspace:*","@itwin/certa":"workspace:*","@itwin/eslint-plugin":"^4.0.0-dev.33","@types/chai":"4.3.1","@types/chai-as-promised":"^7","@types/mocha":"^8.2.2","@types/node":"^18.11.5","@types/sinon":"^9.0.0","babel-loader":"~8.2.5","babel-plugin-istanbul":"~6.1.1","chai":"^4.1.2","chai-as-promised":"^7","cpx2":"^3.0.0","eslint":"^8.36.0","glob":"^7.1.2","mocha":"^10.0.0","nyc":"^15.1.0","rimraf":"^3.0.2","sinon":"^9.0.2","source-map-loader":"^4.0.0","typescript":"~5.0.2","webpack":"^5.76.0"},"//dependencies":["NOTE: these dependencies should be only for things that DO NOT APPEAR IN THE API","NOTE: core-frontend should remain UI technology agnostic, so no react/angular dependencies are allowed"],"dependencies":{"@itwin/object-storage-azure":"^1.5.0","@itwin/cloud-agnostic-core":"^1.5.0","@itwin/object-storage-core":"^1.5.0","@itwin/core-i18n":"workspace:*","@itwin/core-telemetry":"workspace:*","@itwin/webgl-compatibility":"workspace:*","@loaders.gl/core":"^3.1.6","@loaders.gl/draco":"^3.1.6","fuse.js":"^3.3.0","wms-capabilities":"0.4.0","reflect-metadata":"0.1.13"},"nyc":{"extends":"./node_modules/@itwin/build-tools/.nycrc"},"eslintConfig":{"plugins":["@itwin"],"extends":"plugin:@itwin/itwinjs-recommended","rules":{"@itwin/no-internal-barrel-imports":["error",{"required-barrel-modules":["./src/tile/internal.ts"]}],"@itwin/public-extension-exports":["error",{"releaseTags":["public","preview"],"outputApiFile":false}]},"overrides":[{"files":["*.test.ts","*.test.tsx","**/test/**/*.ts"],"rules":{"@itwin/no-internal-barrel-imports":"off"}}]}}');
 
 /***/ })