@itwin/core-geometry 5.3.0-dev.1 → 5.3.0-dev.10

package/lib/cjs/curve/Query/PlanarSubdivision.d.ts

@@ -8,20 +8,28 @@ import { ParityRegion } from "../ParityRegion";
  */
 export declare class PlanarSubdivision {
     /**
-     * Create a graph from an array of curves, and an array of the curves' precomputed intersections.
-     * Z-coordinates are ignored.
+     * Create a graph from curves and precomputed intersections.
+     * * Z-coordinates are ignored.
+     * @param primitives input curves
+     * @param allPairs array of curve-curve xy-intersections
+     * @param mergeTolerance optional distance tolerance for clustering vertices. Default value is [[Geometry.smallMetricDistance]].
      */
     static assembleHalfEdgeGraph(primitives: CurvePrimitive[], allPairs: CurveLocationDetailPair[], mergeTolerance?: number): HalfEdgeGraph;
     /**
-     * Create a pair of mated half edges referencing an interval of a primitive.
-     * * no action if start and end points are identical.
+     * Filter for trivial curve fragment: fast computation if line segment; otherwise clip, flatten, and measure.
+     * * Different metrics are employed for expedience.
+    */
+    private static isCurveTrivialXY;
+    /**
+     * Create a pair of mated half edges referencing a non-trivial interval of a primitive.
      * @param graph containing graph
      * @param p the curve
      * @param point0 start point
      * @param fraction0 starting fraction
      * @param point1 end point
      * @param fraction1 end fraction
-     * @returns end point and fraction, or start point and fraction if no action
+     * @param mergeTolerance optional maximum xy-length of a trivial edge
+     * @returns end point and fraction
      */
     private static addHalfEdge;
     /**
@@ -39,27 +47,54 @@ export declare class PlanarSubdivision {
     /**
      * Create a [[Loop]] for the given face or super face.
      * @param face a node in the face loop, or an array of HalfEdges that comprise a loop (e.g., a super face).
-     * @param announce optional callback invoked on each edge/curve of the face/Loop.
-     * @param compress whether to consolidate adjacent curves in the output Loop (default `false`).
-     * If `announce` is provided, no compression is performed, as edges and curves would no longer be in 1-1 correspondence.
-     * @param closureTol absolute xy-distance for confirming the returned Loop is closed (default [[Geometry.smallMetricDistance]]).
+     * @param options bundle of options.
      * @returns the Loop, or `undefined` if it is not closed within xy-tolerance.
      */
-    static createLoopInFace(face: HalfEdge | HalfEdge[], announce?: (he: HalfEdge, curve: CurvePrimitive, loop: Loop) => void, compress?: boolean, closureTol?: number): Loop | undefined;
+    static createLoopInFace(face: HalfEdge | HalfEdge[], options?: PlanarSubdivision.CreateRegionInFaceOptions): Loop | undefined;
     /**
      * Create a [[Loop]] or [[ParityRegion]] for the given face.
      * * A ParityRegion is created for a split-washer type face by removing bridge edges.
      * @param face a node in the face loop.
-     * @param bridgeMask mask preset on bridge edges (default is `HalfEdgeMask.BRIDGE_EDGE`).
-     * @param visitMask mask to use for visiting edges in the face loop (default is `HalfEdgeMask.VISITED`).
-     * @param closureTol absolute xy-distance for confirming the returned Loop is closed (default [[Geometry.smallMetricDistance]]).
-     * @returns the Loop or ParityRegion, or `undefined` if one could not be computed
+     * @param options bundle of options.
+     * @returns the Loop or ParityRegion, or `undefined` if one could not be computed.
      */
-    static createLoopOrParityRegionInFace(face: HalfEdge, bridgeMask?: HalfEdgeMask, visitMask?: HalfEdgeMask, closureTol?: number): Loop | ParityRegion | undefined;
+    static createLoopOrParityRegionInFace(face: HalfEdge, options?: PlanarSubdivision.CreateRegionInFaceOptions): Loop | ParityRegion | undefined;
     /** Return true if there are only two edges in the face loop, and their start curvatures are the same. */
     private static isNullFace;
     /** Look across edge mates (possibly several) for a non-null mate face. */
     private static getNonNullEdgeMate;
     static collectSignedLoopSetsInHalfEdgeGraph(graph: HalfEdgeGraph, zeroAreaTolerance?: number): SignedLoops[];
 }
+/**
+ * @internal
+*/
+export declare namespace PlanarSubdivision {
+    /** Options bundle for [[PlanarSubdivision.createLoopInFace]] and [[PlanarSubdivision.createLoopOrParityRegionInFace]]. */
+    interface CreateRegionInFaceOptions {
+        /**
+         * Optional callback invoked on each `edge` before its `curve` is added to `loop`.
+         * * Note that if a [[ParityRegion]] is being constructed, `curve` and `loop` may subsequently be reversed.
+         */
+        announceEdge?: (edge: HalfEdge, curve: CurvePrimitive, loop: Loop) => void;
+        /**
+         * Whether to consolidate adjacent curves in an output [[Loop]]. Default value is `false`.
+         * * If `announce` is defined, no compression is performed, as edges and curves would no longer be in 1-1 correspondence.
+         */
+        compress?: boolean;
+        /** Absolute xy-distance for confirming a returned Loop is closed. Default value is [[Geometry.smallMetricDistance]]. */
+        closureTol?: number;
+        /**
+         * Mask preset on bridge edges. Default value is `HalfEdgeMask.BRIDGE_EDGE`.
+         * * This mask is used to distinguish a split-washer type face, which can result in a [[ParityRegion]].
+         */
+        bridgeMask?: HalfEdgeMask;
+        /** Mask to use for visiting edges when creating a [[ParityRegion]] from a split-washer type face. Default value is `HalfEdgeMask.VISITED`. */
+        visitMask?: HalfEdgeMask;
+        /**
+         * Optional z-coordinate for the result region.
+         * * If undefined, graph z-coordinates are used, but this may result in a non-planar region if the graph is not planar!
+         */
+        z?: number;
+    }
+}
 //# sourceMappingURL=PlanarSubdivision.d.ts.map

package/lib/cjs/curve/Query/PlanarSubdivision.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"PlanarSubdivision.d.ts","sourceRoot":"","sources":["../../../../src/curve/Query/PlanarSubdivision.ts"],"names":[],"mappings":"AAOA,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,sBAAsB,CAAC;AAI7E,OAAO,EAAuB,uBAAuB,EAAE,MAAM,wBAAwB,CAAC;AACtF,OAAO,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AAInD,OAAO,EAAE,IAAI,EAAsB,WAAW,EAAE,MAAM,SAAS,CAAC;AAChE,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAyE/C;;GAEG;AACH,qBAAa,iBAAiB;IAC5B;;;OAGG;WACW,qBAAqB,CACjC,UAAU,EAAE,cAAc,EAAE,EAC5B,QAAQ,EAAE,uBAAuB,EAAE,EACnC,cAAc,GAAE,MAAqC,GACpD,aAAa;IA2ChB;;;;;;;;;;OAUG;IACH,OAAO,CAAC,MAAM,CAAC,WAAW;IAwB1B;;;;;;OAMG;WACW,iBAAiB,CAC7B,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,WAAW,EAAE,iBAAiB,GAAE,MAAgB,EAAE,YAAY,CAAC,EAAE,OAAO,GAC7F,MAAM;IAeT,sDAAsD;IACtD,OAAO,CAAC,MAAM,CAAC,uBAAuB;IAUtC,kDAAkD;IAClD,OAAO,CAAC,MAAM,CAAC,iBAAiB;IAShC;;;;;;;;OAQG;WACW,gBAAgB,CAC5B,IAAI,EAAE,QAAQ,GAAG,QAAQ,EAAE,EAC3B,QAAQ,CAAC,EAAE,CAAC,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,cAAc,EAAE,IAAI,EAAE,IAAI,KAAK,IAAI,EACpE,QAAQ,GAAE,OAAe,EACzB,UAAU,GAAE,MAAqC,GAChD,IAAI,GAAG,SAAS;IAyBnB;;;;;;;;OAQG;WACW,8BAA8B,CAC1C,IAAI,EAAE,QAAQ,EACd,UAAU,GAAE,YAAuC,EACnD,SAAS,GAAE,YAAmC,EAC9C,UAAU,GAAE,MAAqC,GAChD,IAAI,GAAG,YAAY,GAAG,SAAS;IAiClC,yGAAyG;IACzG,OAAO,CAAC,MAAM,CAAC,UAAU;IAWzB,0EAA0E;IAC1E,OAAO,CAAC,MAAM,CAAC,kBAAkB;WAWnB,oCAAoC,CAAC,KAAK,EAAE,aAAa,EAAE,iBAAiB,GAAE,MAAgB,GAAG,WAAW,EAAE;CAmC7H"}
+{"version":3,"file":"PlanarSubdivision.d.ts","sourceRoot":"","sources":["../../../../src/curve/Query/PlanarSubdivision.ts"],"names":[],"mappings":"AAQA,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,sBAAsB,CAAC;AAI7E,OAAO,EAAuB,uBAAuB,EAAE,MAAM,wBAAwB,CAAC;AACtF,OAAO,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AAInD,OAAO,EAAE,IAAI,EAAsB,WAAW,EAAE,MAAM,SAAS,CAAC;AAChE,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AA6F/C;;GAEG;AACH,qBAAa,iBAAiB;IAC5B;;;;;;OAMG;WACW,qBAAqB,CACjC,UAAU,EAAE,cAAc,EAAE,EAC5B,QAAQ,EAAE,uBAAuB,EAAE,EACnC,cAAc,GAAE,MAAqC,GACpD,aAAa;IA4ChB;;;MAGE;IACF,OAAO,CAAC,MAAM,CAAC,gBAAgB;IAW/B;;;;;;;;;;OAUG;IACH,OAAO,CAAC,MAAM,CAAC,WAAW;IAwB1B;;;;;;OAMG;WACW,iBAAiB,CAC7B,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,WAAW,EAAE,iBAAiB,GAAE,MAAgB,EAAE,YAAY,CAAC,EAAE,OAAO,GAC7F,MAAM;IAeT,sDAAsD;IACtD,OAAO,CAAC,MAAM,CAAC,uBAAuB;IAUtC,kDAAkD;IAClD,OAAO,CAAC,MAAM,CAAC,iBAAiB;IAYhC;;;;;OAKG;WACW,gBAAgB,CAAC,IAAI,EAAE,QAAQ,GAAG,QAAQ,EAAE,EAAE,OAAO,CAAC,EAAE,iBAAiB,CAAC,yBAAyB,GAAG,IAAI,GAAG,SAAS;IAwBpI;;;;;;OAMG;WACW,8BAA8B,CAAC,IAAI,EAAE,QAAQ,EAAE,OAAO,CAAC,EAAE,iBAAiB,CAAC,yBAAyB,GAAG,IAAI,GAAG,YAAY,GAAG,SAAS;IAqCpJ,yGAAyG;IACzG,OAAO,CAAC,MAAM,CAAC,UAAU;IAWzB,0EAA0E;IAC1E,OAAO,CAAC,MAAM,CAAC,kBAAkB;WAWnB,oCAAoC,CAAC,KAAK,EAAE,aAAa,EAAE,iBAAiB,GAAE,MAAgB,GAAG,WAAW,EAAE;CAkC7H;AAED;;EAEE;AACF,yBAAiB,iBAAiB,CAAC;IACjC,0HAA0H;IAC1H,UAAiB,yBAAyB;QACxC;;;WAGG;QACH,YAAY,CAAC,EAAE,CAAC,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,cAAc,EAAE,IAAI,EAAE,IAAI,KAAK,IAAI,CAAC;QAC3E;;;WAGG;QACH,QAAQ,CAAC,EAAE,OAAO,CAAC;QACnB,wHAAwH;QACxH,UAAU,CAAC,EAAE,MAAM,CAAC;QACpB;;;WAGG;QACH,UAAU,CAAC,EAAE,YAAY,CAAC;QAC1B,8IAA8I;QAC9I,SAAS,CAAC,EAAE,YAAY,CAAC;QACzB;;;WAGG;QACH,CAAC,CAAC,EAAE,MAAM,CAAC;KACZ;CACF"}

package/lib/cjs/curve/Query/PlanarSubdivision.js

@@ -7,6 +7,7 @@ exports.PlanarSubdivision = void 0;
 *--------------------------------------------------------------------------------------------*/
 const core_bentley_1 = require("@itwin/core-bentley");
 const Geometry_1 = require("../../Geometry");
+const Transform_1 = require("../../geometry3d/Transform");
 const Graph_1 = require("../../topology/Graph");
 const HalfEdgeGraphSearch_1 = require("../../topology/HalfEdgeGraphSearch");
 const Merging_1 = require("../../topology/Merging");
@@ -21,6 +22,25 @@ const RegionOpsClassificationSweeps_1 = require("../RegionOpsClassificationSweep
 /** @packageDocumentation
  * @module Curve
  */
+function computeSortAngle(curve, fraction, reverse) {
+    const ray = curve.fractionToPointAndDerivative(fraction);
+    const s = reverse ? -1.0 : 1.0;
+    return Math.atan2(s * ray.direction.y, s * ray.direction.x);
+}
+function getFractionOnCurve(pair, curve) {
+    if (pair.detailA.curve === curve)
+        return pair.detailA.fraction;
+    if (pair.detailB.curve === curve)
+        return pair.detailB.fraction;
+    return undefined;
+}
+function getDetailOnCurve(pair, curve) {
+    if (pair.detailA.curve === curve)
+        return pair.detailA;
+    if (pair.detailB.curve === curve)
+        return pair.detailB;
+    return undefined;
+}
 class MapCurvePrimitiveToCurveLocationDetailPairArray {
     primitiveToPair = new Map();
     // index assigned to this primitive (for debugging)
@@ -83,8 +103,11 @@ class MapCurvePrimitiveToCurveLocationDetailPairArray {
  */
 class PlanarSubdivision {
     /**
-     * Create a graph from an array of curves, and an array of the curves' precomputed intersections.
-     * Z-coordinates are ignored.
+     * Create a graph from curves and precomputed intersections.
+     * * Z-coordinates are ignored.
+     * @param primitives input curves
+     * @param allPairs array of curve-curve xy-intersections
+     * @param mergeTolerance optional distance tolerance for clustering vertices. Default value is [[Geometry.smallMetricDistance]].
      */
     static assembleHalfEdgeGraph(primitives, allPairs, mergeTolerance = Geometry_1.Geometry.smallMetricDistance) {
         // map from key CurvePrimitive to CurveLocationDetailPair
@@ -130,31 +153,45 @@ class PlanarSubdivision {
         return graph;
     }
     /**
-     * Create a pair of mated half edges referencing an interval of a primitive.
-     * * no action if start and end points are identical.
+     * Filter for trivial curve fragment: fast computation if line segment; otherwise clip, flatten, and measure.
+     * * Different metrics are employed for expedience.
+    */
+    static isCurveTrivialXY(p, point0, fraction0, point1, fraction1, mergeTolerance) {
+        if (Geometry_1.Geometry.isSmallRelative(fraction0 - fraction1))
+            return true;
+        if (!(p instanceof LineSegment3d_1.LineSegment3d)) {
+            const p0 = p.clonePartialCurve(fraction0, fraction1);
+            if (p0?.tryTransformInPlace(Transform_1.Transform.createRowValues(1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0))) // flatten
+                return p0.curveLength() <= mergeTolerance; // Euclidean
+        }
+        return point0.isAlmostEqualXY(point1, mergeTolerance); // Manhattan
+    }
+    /**
+     * Create a pair of mated half edges referencing a non-trivial interval of a primitive.
      * @param graph containing graph
      * @param p the curve
      * @param point0 start point
      * @param fraction0 starting fraction
      * @param point1 end point
      * @param fraction1 end fraction
-     * @returns end point and fraction, or start point and fraction if no action
+     * @param mergeTolerance optional maximum xy-length of a trivial edge
+     * @returns end point and fraction
      */
     static addHalfEdge(graph, p, point0, fraction0, point1, fraction1, mergeTolerance = Geometry_1.Geometry.smallMetricDistance) {
-        if (point0.isAlmostEqualXY(point1, mergeTolerance))
-            return { point: point0, fraction: fraction0 };
-        const halfEdge = graph.createEdgeXYAndZ(point0, 0, point1, 0);
-        if (p.parent && p.parent instanceof RegionOpsClassificationSweeps_1.RegionGroupMember && p.parent.parentGroup.groupOpType === RegionOpsClassificationSweeps_1.RegionGroupOpType.NonBounding)
-            halfEdge.setMaskAroundEdge(Graph_1.HalfEdgeMask.BRIDGE_EDGE);
-        const detail01 = CurveLocationDetail_1.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 };
+        if (!this.isCurveTrivialXY(p, point0, fraction0, point1, fraction1, mergeTolerance)) {
+            const halfEdge = graph.createEdgeXYAndZ(point0, 0, point1, 0);
+            if (p.parent && p.parent instanceof RegionOpsClassificationSweeps_1.RegionGroupMember && p.parent.parentGroup.groupOpType === RegionOpsClassificationSweeps_1.RegionGroupOpType.NonBounding)
+                halfEdge.setMaskAroundEdge(Graph_1.HalfEdgeMask.BRIDGE_EDGE);
+            const detail01 = CurveLocationDetail_1.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 = computeSortAngle(p, fraction0, false);
+            mate.sortAngle = computeSortAngle(p, fraction1, true);
+        }
+        return { point: point1, fraction: fraction1 }; // where the next curve fragment starts
     }
     /**
      * Based on computed (and toleranced) area, push the loop (pointer) onto the appropriate array of positive, negative,
@@ -190,32 +227,31 @@ class PlanarSubdivision {
         return undefined;
     }
     /** Create the geometry for a topological edge. */
-    static createCurveInEdge(edge) {
+    static createCurveInEdge(edge, z) {
+        let result;
         const info = this.extractGeometryFromEdge(edge);
-        if (info) {
-            if (info.reversed)
-                return info.detail.curve.clonePartialCurve(info.detail.fraction1, info.detail.fraction);
-            return info.detail.curve.clonePartialCurve(info.detail.fraction, info.detail.fraction1);
+        if (info && info.detail.curve && info.detail.fraction1) {
+            const f0 = info.reversed ? info.detail.fraction1 : info.detail.fraction;
+            const f1 = info.reversed ? info.detail.fraction : info.detail.fraction1;
+            result = info.detail.curve.clonePartialCurve(f0, f1);
+            if (result && z !== undefined)
+                result.tryTransformInPlace(Transform_1.Transform.createRowValues(1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, z));
         }
-        return undefined;
+        return result;
     }
     /**
      * Create a [[Loop]] for the given face or super face.
      * @param face a node in the face loop, or an array of HalfEdges that comprise a loop (e.g., a super face).
-     * @param announce optional callback invoked on each edge/curve of the face/Loop.
-     * @param compress whether to consolidate adjacent curves in the output Loop (default `false`).
-     * If `announce` is provided, no compression is performed, as edges and curves would no longer be in 1-1 correspondence.
-     * @param closureTol absolute xy-distance for confirming the returned Loop is closed (default [[Geometry.smallMetricDistance]]).
+     * @param options bundle of options.
      * @returns the Loop, or `undefined` if it is not closed within xy-tolerance.
      */
-    static createLoopInFace(face, announce, compress = false, closureTol = Geometry_1.Geometry.smallMetricDistance) {
-        if (announce)
-            compress = false;
+    static createLoopInFace(face, options) {
+        const consolidate = options?.announceEdge ? false : options?.compress ?? false; // can't compress if announcing
         const loop = Loop_1.Loop.create();
-        const addEdgeCurve = (he) => {
-            const curve = this.createCurveInEdge(he);
+        const addEdgeCurve = (edge) => {
+            const curve = this.createCurveInEdge(edge, options?.z);
             if (curve) {
-                announce?.(he, curve, loop);
+                options?.announceEdge?.(edge, curve, loop);
                 loop.tryAddChild(curve);
             }
         };
@@ -223,12 +259,12 @@ class PlanarSubdivision {
             face.forEach(addEdgeCurve);
         else
             face.announceEdgesInFace(addEdgeCurve);
-        if (compress) {
-            const options = new RegionOps_1.ConsolidateAdjacentCurvePrimitivesOptions();
-            options.consolidateLoopSeam = true;
-            RegionOps_1.RegionOps.consolidateAdjacentPrimitives(loop, options);
+        if (consolidate) {
+            const consolidateOptions = new RegionOps_1.ConsolidateAdjacentCurvePrimitivesOptions();
+            consolidateOptions.consolidateLoopSeam = true;
+            RegionOps_1.RegionOps.consolidateAdjacentPrimitives(loop, consolidateOptions);
         }
-        if (loop.isPhysicallyClosedCurve(closureTol, true))
+        if (loop.isPhysicallyClosedCurve(options?.closureTol, true))
             return loop;
         (0, core_bentley_1.assert)(() => false, "face is not physically closed");
         return undefined;
@@ -237,17 +273,19 @@ class PlanarSubdivision {
      * Create a [[Loop]] or [[ParityRegion]] for the given face.
      * * A ParityRegion is created for a split-washer type face by removing bridge edges.
      * @param face a node in the face loop.
-     * @param bridgeMask mask preset on bridge edges (default is `HalfEdgeMask.BRIDGE_EDGE`).
-     * @param visitMask mask to use for visiting edges in the face loop (default is `HalfEdgeMask.VISITED`).
-     * @param closureTol absolute xy-distance for confirming the returned Loop is closed (default [[Geometry.smallMetricDistance]]).
-     * @returns the Loop or ParityRegion, or `undefined` if one could not be computed
+     * @param options bundle of options.
+     * @returns the Loop or ParityRegion, or `undefined` if one could not be computed.
      */
-    static createLoopOrParityRegionInFace(face, bridgeMask = Graph_1.HalfEdgeMask.BRIDGE_EDGE, visitMask = Graph_1.HalfEdgeMask.VISITED, closureTol = Geometry_1.Geometry.smallMetricDistance) {
+    static createLoopOrParityRegionInFace(face, options) {
         let region;
-        if (face.isSplitWasherFace(bridgeMask)) {
+        const visitMask = options?.visitMask ?? Graph_1.HalfEdgeMask.VISITED;
+        const bridgeMask = options?.bridgeMask ?? Graph_1.HalfEdgeMask.BRIDGE_EDGE;
+        let startBridgeEdge;
+        // is it a split-washer face?
+        if (face.isSplitWasherFace(bridgeMask) && (startBridgeEdge = face.findMaskAroundFace(bridgeMask, true))) {
             const loops = [];
             const loopEdges = [];
-            const bridgeStack = [face.findMaskAroundFace(bridgeMask, true)];
+            const bridgeStack = [startBridgeEdge];
             const announceEdge = (he) => { he.setMask(visitMask); loopEdges.push(he); };
             const announceBridge = (he) => { if (!he.isMaskSet(visitMask))
                 bridgeStack.push(he); };
@@ -261,7 +299,7 @@ class PlanarSubdivision {
                         continue;
                     loopEdges.length = 0;
                     if (loopSeed.announceEdgesInSuperFace(bridgeMask, announceEdge, announceBridge)) {
-                        const loop = this.createLoopInFace(loopEdges, undefined, true, closureTol);
+                        const loop = this.createLoopInFace(loopEdges, options);
                         if (loop) {
                             loops.push(loop);
                             continue;
@@ -273,7 +311,7 @@ class PlanarSubdivision {
             region = RegionOps_1.RegionOps.simplifyRegion(region);
         }
         else {
-            region = this.createLoopInFace(face, undefined, true, closureTol);
+            region = this.createLoopInFace(face, options);
         }
         return (region && (region instanceof Loop_1.Loop || region instanceof ParityRegion_1.ParityRegion)) ? region : undefined;
     }
@@ -310,24 +348,23 @@ class PlanarSubdivision {
             const edges = [];
             for (const faceSeed of faceSeeds) {
                 const isNullFace = this.isNullFace(faceSeed);
-                const loop = this.createLoopInFace(faceSeed, (he, curveC, loopC) => {
-                    if (!isNullFace) {
-                        const mate = this.getNonNullEdgeMate(graph, he);
-                        if (mate !== undefined) {
-                            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_1.LoopCurveLoopCurve(loopC, curveC, undefined, undefined);
-                                edgeMap.set(he, e1);
-                            }
-                            else if (e instanceof Loop_1.LoopCurveLoopCurve) {
-                                e.setB(loopC, curveC);
-                                edges.push(e);
-                                edgeMap.delete(mate);
-                            }
+                const announceEdge = isNullFace ? undefined : (he, curveC, loopC) => {
+                    const mate = this.getNonNullEdgeMate(graph, he);
+                    if (mate !== undefined) {
+                        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_1.LoopCurveLoopCurve(loopC, curveC, undefined, undefined);
+                            edgeMap.set(he, e1);
+                        }
+                        else if (e instanceof Loop_1.LoopCurveLoopCurve) {
+                            e.setB(loopC, curveC);
+                            edges.push(e);
+                            edgeMap.delete(mate);
                         }
                     }
-                });
+                };
+                const loop = this.createLoopInFace(faceSeed, { announceEdge });
                 if (loop)
                     this.collectSignedLoop(loop, componentAreas, zeroAreaTolerance, isNullFace);
             }
@@ -339,23 +376,4 @@ class PlanarSubdivision {
     }
 }
 exports.PlanarSubdivision = PlanarSubdivision;
-function sortAngle(curve, fraction, reverse) {
-    const ray = curve.fractionToPointAndDerivative(fraction);
-    const s = reverse ? -1.0 : 1.0;
-    return Math.atan2(s * ray.direction.y, s * ray.direction.x);
-}
-function getFractionOnCurve(pair, curve) {
-    if (pair.detailA.curve === curve)
-        return pair.detailA.fraction;
-    if (pair.detailB.curve === curve)
-        return pair.detailB.fraction;
-    return undefined;
-}
-function getDetailOnCurve(pair, curve) {
-    if (pair.detailA.curve === curve)
-        return pair.detailA;
-    if (pair.detailB.curve === curve)
-        return pair.detailB;
-    return undefined;
-}
 //# sourceMappingURL=PlanarSubdivision.js.map

package/lib/cjs/curve/Query/PlanarSubdivision.js.map

@@ -1 +1 @@
-{"version":3,"file":"PlanarSubdivision.js","sourceRoot":"","sources":["../../../../src/curve/Query/PlanarSubdivision.ts"],"names":[],"mappings":";;;AAAA;;;+FAG+F;AAC/F,sDAA6C;AAC7C,6CAA0C;AAE1C,gDAA6E;AAC7E,4EAAyE;AACzE,oDAA4D;AAC5D,oCAAiC;AACjC,gEAAsF;AAGtF,oDAAiD;AACjD,kDAA+C;AAC/C,kCAAgE;AAChE,kDAA+C;AAC/C,4CAAoF;AACpF,oFAAwF;AAExF;;GAEG;AAEH,MAAM,+CAA+C;IAC5C,eAAe,GAAG,IAAI,GAAG,EAA6C,CAAC;IAC9E,mDAAmD;IAC5C,gBAAgB,GAAG,IAAI,GAAG,EAA0B,CAAC;IACpD,qBAAqB,GAAW,CAAC,CAAC;IACnC,oBAAoB,CAAC,SAAqC;QAC/D,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;YAC5B,MAAM,KAAK,GAAG,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YACnD,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;gBACxB,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,SAAS,EAAE,IAAI,CAAC,qBAAqB,EAAE,CAAC,CAAC;YACrE,CAAC;QACH,CAAC;IACH,CAAC;IACM,qBAAqB,CAAC,SAAqC,EAAE,IAA6B;QAC/F,IAAI,SAAS,EAAE,CAAC;YACd,MAAM,UAAU,GAAG,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YACvD,IAAI,CAAC,oBAAoB,CAAC,SAAS,CAAC,CAAC;YACrC,IAAI,CAAC,UAAU,EAAE,CAAC;gBAChB,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;YAC9C,CAAC;iBAAM,CAAC;gBACN,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACxB,CAAC;QACH,CAAC;IACH,CAAC;IACM,UAAU,CAAC,IAA6B;QAC7C,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC;QACtC,IAAI,UAAU;YACZ,IAAI,CAAC,qBAAqB,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;QAC/C,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC;QACtC,IAAI,UAAU;YACZ,IAAI,CAAC,qBAAqB,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;IACjD,CAAC;IACD;;;;;OAKG;IACI,qCAAqC,CAC1C,UAA4B,EAAE,YAAoB,mBAAQ,CAAC,mBAAmB;QAE9E,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;YAC3B,IAAI,yBAAyB,GAAG,KAAK,CAAC;YACtC,IAAI,CAAC,YAAY,aAAK;gBACpB,yBAAyB,GAAG,CAAC,CAAC,KAAK,CAAC,YAAY,CAAC;iBAC9C,IAAI,CAAC,CAAC,CAAC,YAAY,6BAAa,CAAC,IAAI,CAAC,CAAC,CAAC,YAAY,2BAAY,CAAC,EAAE,6FAA6F;gBACnK,yBAAyB,GAAG,CAAC,CAAC,UAAU,EAAE,CAAC,eAAe,CAAC,CAAC,CAAC,QAAQ,EAAE,EAAE,SAAS,CAAC,CAAC;YACtF,IAAI,yBAAyB,IAAI,CAAC,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC9D,MAAM,EAAE,GAAG,CAAC,CAAC,iBAAiB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;gBACzC,MAAM,EAAE,GAAG,CAAC,CAAC,iBAAiB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;gBACzC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC;oBACb,IAAI,CAAC,UAAU,CAAC,6CAAuB,CAAC,aAAa,CACnD,yCAAmB,CAAC,4BAA4B,CAAC,EAAE,EAAE,GAAG,CAAC,EACzD,yCAAmB,CAAC,4BAA4B,CAAC,EAAE,EAAE,GAAG,CAAC,CAC1D,CAAC,CAAC;oBACH,IAAI,CAAC,UAAU,CAAC,6CAAuB,CAAC,aAAa,CACnD,yCAAmB,CAAC,4BAA4B,CAAC,EAAE,EAAE,GAAG,CAAC,EACzD,yCAAmB,CAAC,4BAA4B,CAAC,EAAE,EAAE,GAAG,CAAC,CAC1D,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;CACF;AAED;;GAEG;AACH,MAAa,iBAAiB;IAC5B;;;OAGG;IACI,MAAM,CAAC,qBAAqB,CACjC,UAA4B,EAC5B,QAAmC,EACnC,iBAAyB,mBAAQ,CAAC,mBAAmB;QAErD,yDAAyD;QACzD,MAAM,iBAAiB,GAAG,IAAI,+CAA+C,EAAE,CAAC;QAChF,KAAK,MAAM,IAAI,IAAI,QAAQ;YACzB,iBAAiB,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QACrC,IAAI,UAAU,CAAC,MAAM,GAAG,iBAAiB,CAAC,eAAe,CAAC,IAAI,EAAE,CAAC;YAC/D,qEAAqE;YACrE,iBAAiB,CAAC,qCAAqC,CAAC,UAAU,EAAE,cAAc,CAAC,CAAC;QACtF,CAAC;QACD,MAAM,KAAK,GAAG,IAAI,qBAAa,EAAE,CAAC;QAClC,KAAK,MAAM,KAAK,IAAI,iBAAiB,CAAC,eAAe,CAAC,OAAO,EAAE,EAAE,CAAC;YAChE,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACnB,qEAAqE;YACrE,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,WAAsC,EAAE,UAAU,EAAE,EAAE;gBACrF,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,YAAY;oBAClC,OAAO,CAAC,GAAG,WAAW,EAAE,UAAU,CAAC,CAAC;gBACtC,MAAM,MAAM,GAAG,gBAAgB,CAAC,UAAU,EAAE,CAAC,CAAE,CAAC;gBAChD,MAAM,OAAO,GAAG,yCAAmB,CAAC,wBAAwB,CAAC,CAAC,EAAE,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC;gBAC/F,MAAM,OAAO,GAAG,yCAAmB,CAAC,wBAAwB,CAAC,CAAC,EAAE,MAAM,CAAC,SAAU,EAAE,MAAM,CAAC,MAAO,CAAC,CAAC;gBACnG,OAAO;oBACL,GAAG,WAAW;oBACd,6CAAuB,CAAC,aAAa,CAAC,OAAO,EAAE,OAAO,CAAC;oBACvD,6CAAuB,CAAC,aAAa,CAAC,OAAO,EAAE,OAAO,CAAC;iBACxD,CAAC;YACJ,CAAC,EAAE,EAAE,CAAC,CAAC;YACP,0CAA0C;YAC1C,OAAO,CAAC,IAAI,CAAC,CAAC,KAA8B,EAAE,KAA8B,EAAE,EAAE;gBAC9E,MAAM,SAAS,GAAG,kBAAkB,CAAC,KAAK,EAAE,CAAC,CAAE,CAAC;gBAChD,MAAM,SAAS,GAAG,kBAAkB,CAAC,KAAK,EAAE,CAAC,CAAE,CAAC;gBAChD,OAAO,SAAS,GAAG,SAAS,CAAC;YAC/B,CAAC,CAAC,CAAC;YACH,IAAI,IAAI,GAAG,EAAE,KAAK,EAAE,CAAC,CAAC,UAAU,EAAE,EAAE,QAAQ,EAAE,GAAG,EAAE,CAAC;YACpD,KAAK,MAAM,UAAU,IAAI,OAAO,EAAE,CAAC;gBACjC,MAAM,MAAM,GAAG,gBAAgB,CAAC,UAAU,EAAE,CAAC,CAAE,CAAC;gBAChD,MAAM,cAAc,GAAG,mBAAQ,CAAC,kBAAkB,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,oEAAoE;gBAC/I,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,QAAQ,EAAE,MAAM,CAAC,KAAK,EAAE,cAAc,EAAE,cAAc,CAAC,CAAC;YAC7G,CAAC;YACD,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,EAAE,GAAG,EAAE,cAAc,CAAC,CAAC;QAC3F,CAAC;QACD,sDAAsD;QACtD,4BAAkB,CAAC,sBAAsB,CAAC,KAAK,EAAE,CAAC,EAAY,EAAE,EAAE,CAAC,EAAE,CAAC,SAAS,IAAI,CAAC,EAAE,cAAc,CAAC,CAAC;QACtG,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;;;;;OAUG;IACK,MAAM,CAAC,WAAW,CACxB,KAAoB,EACpB,CAAiB,EACjB,MAAe,EACf,SAAiB,EACjB,MAAe,EACf,SAAiB,EACjB,iBAAyB,mBAAQ,CAAC,mBAAmB;QAErD,IAAI,MAAM,CAAC,eAAe,CAAC,MAAM,EAAE,cAAc,CAAC;YAChD,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC;QAChD,MAAM,QAAQ,GAAG,KAAK,CAAC,gBAAgB,CAAC,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC;QAC9D,IAAI,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,MAAM,YAAY,iDAAiB,IAAI,CAAC,CAAC,MAAM,CAAC,WAAW,CAAC,WAAW,KAAK,iDAAiB,CAAC,WAAW;YACzH,QAAQ,CAAC,iBAAiB,CAAC,oBAAY,CAAC,WAAW,CAAC,CAAC;QACvD,MAAM,QAAQ,GAAG,yCAAmB,CAAC,oCAAoC,CAAC,CAAC,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;QACnG,MAAM,IAAI,GAAG,QAAQ,CAAC,QAAQ,CAAC;QAC/B,QAAQ,CAAC,OAAO,GAAG,QAAQ,CAAC;QAC5B,QAAQ,CAAC,QAAQ,GAAG,GAAG,CAAC;QACxB,IAAI,CAAC,OAAO,GAAG,QAAQ,CAAC;QACxB,IAAI,CAAC,QAAQ,GAAG,CAAC,GAAG,CAAC;QACrB,QAAQ,CAAC,SAAS,GAAG,SAAS,CAAC,CAAC,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC;QACpD,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC,CAAC,EAAE,SAAS,EAAE,IAAI,CAAC,CAAC;QAC/C,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC;IAChD,CAAC;IACD;;;;;;OAMG;IACI,MAAM,CAAC,iBAAiB,CAC7B,IAAU,EAAE,QAAqB,EAAE,oBAA4B,OAAO,EAAE,YAAsB;QAE9F,IAAI,IAAI,GAAG,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,qBAAS,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;QAC9D,IAAI,IAAI,KAAK,SAAS;YACpB,IAAI,GAAG,CAAC,CAAC;QACX,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,iBAAiB;YACpC,IAAI,GAAG,GAAG,CAAC;QACZ,IAAY,CAAC,+BAA+B,GAAG,IAAI,CAAC;QACrD,IAAI,IAAI,GAAG,CAAC;YACV,QAAQ,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;aACnC,IAAI,IAAI,GAAG,CAAC;YACf,QAAQ,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;;YAEtC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9B,OAAO,IAAI,CAAC;IACd,CAAC;IACD,sDAAsD;IAC9C,MAAM,CAAC,uBAAuB,CAAC,IAAc;QACnD,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS,IAAI,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,OAAO,YAAY,yCAAmB,EAAE,CAAC;YAC/F,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC;YAC5B,IAAI,MAAM,CAAC,KAAK,IAAI,MAAM,CAAC,SAAS,KAAK,SAAS,EAAE,CAAC;gBACnD,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC;gBACnC,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC;YAC9B,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,kDAAkD;IAC1C,MAAM,CAAC,iBAAiB,CAAC,IAAc;QAC7C,MAAM,IAAI,GAAG,IAAI,CAAC,uBAAuB,CAAC,IAAI,CAAC,CAAC;QAChD,IAAI,IAAI,EAAE,CAAC;YACT,IAAI,IAAI,CAAC,QAAQ;gBACf,OAAO,IAAI,CAAC,MAAM,CAAC,KAAM,CAAC,iBAAiB,CAAC,IAAI,CAAC,MAAM,CAAC,SAAU,EAAE,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;YAC5F,OAAO,IAAI,CAAC,MAAM,CAAC,KAAM,CAAC,iBAAiB,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,EAAE,IAAI,CAAC,MAAM,CAAC,SAAU,CAAC,CAAC;QAC5F,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,gBAAgB,CAC5B,IAA2B,EAC3B,QAAoE,EACpE,WAAoB,KAAK,EACzB,aAAqB,mBAAQ,CAAC,mBAAmB;QAEjD,IAAI,QAAQ;YACV,QAAQ,GAAG,KAAK,CAAC;QACnB,MAAM,IAAI,GAAG,WAAI,CAAC,MAAM,EAAE,CAAC;QAC3B,MAAM,YAAY,GAAG,CAAC,EAAY,EAAQ,EAAE;YAC1C,MAAM,KAAK,GAAG,IAAI,CAAC,iBAAiB,CAAC,EAAE,CAAC,CAAC;YACzC,IAAI,KAAK,EAAE,CAAC;gBACV,QAAQ,EAAE,CAAC,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;gBAC5B,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;YAC1B,CAAC;QACH,CAAC,CAAC;QACF,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC;YACrB,IAAI,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC;;YAE3B,IAAI,CAAC,mBAAmB,CAAC,YAAY,CAAC,CAAC;QACzC,IAAI,QAAQ,EAAE,CAAC;YACb,MAAM,OAAO,GAAG,IAAI,qDAAyC,EAAE,CAAC;YAChE,OAAO,CAAC,mBAAmB,GAAG,IAAI,CAAC;YACnC,qBAAS,CAAC,6BAA6B,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QACzD,CAAC;QACD,IAAI,IAAI,CAAC,uBAAuB,CAAC,UAAU,EAAE,IAAI,CAAC;YAChD,OAAO,IAAI,CAAC;QACd,IAAA,qBAAM,EAAC,GAAG,EAAE,CAAC,KAAK,EAAE,+BAA+B,CAAC,CAAC;QACrD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,8BAA8B,CAC1C,IAAc,EACd,aAA2B,oBAAY,CAAC,WAAW,EACnD,YAA0B,oBAAY,CAAC,OAAO,EAC9C,aAAqB,mBAAQ,CAAC,mBAAmB;QAEjD,IAAI,MAA6B,CAAC;QAClC,IAAI,IAAI,CAAC,iBAAiB,CAAC,UAAU,CAAC,EAAE,CAAC;YACvC,MAAM,KAAK,GAAW,EAAE,CAAC;YACzB,MAAM,SAAS,GAAe,EAAE,CAAC;YACjC,MAAM,WAAW,GAAe,CAAC,IAAI,CAAC,kBAAkB,CAAC,UAAU,EAAE,IAAI,CAAE,CAAC,CAAC;YAC7E,MAAM,YAAY,GAAG,CAAC,EAAY,EAAE,EAAE,GAAG,EAAE,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YACtF,MAAM,cAAc,GAAG,CAAC,EAAY,EAAE,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC,SAAS,CAAC,SAAS,CAAC;gBAAE,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YACjG,IAAI,CAAC,mBAAmB,CAAC,SAAS,CAAC,CAAC;YACpC,IAAI,MAA4B,CAAC;YACjC,OAAO,SAAS,KAAK,CAAC,MAAM,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC;gBAClD,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;gBAC1B,MAAM,QAAQ,GAAG,MAAM,CAAC,kBAAkB,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC,CAAC,uBAAuB;gBACtF,IAAI,QAAQ,EAAE,CAAC;oBACb,IAAI,QAAQ,CAAC,SAAS,CAAC,SAAS,CAAC;wBAC/B,SAAS;oBACX,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;oBACrB,IAAI,QAAQ,CAAC,wBAAwB,CAAC,UAAU,EAAE,YAAY,EAAE,cAAc,CAAC,EAAE,CAAC;wBAChF,MAAM,IAAI,GAAG,IAAI,CAAC,gBAAgB,CAAC,SAAS,EAAE,SAAS,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC;wBAC3E,IAAI,IAAI,EAAE,CAAC;4BACT,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;4BACjB,SAAS;wBACX,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;YACD,MAAM,GAAG,qBAAS,CAAC,uBAAuB,CAAC,KAAK,CAAC,CAAC;YAClD,MAAM,GAAG,qBAAS,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;QAC5C,CAAC;aAAM,CAAC;YACN,MAAM,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,EAAE,SAAS,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC;QACpE,CAAC;QACD,OAAO,CAAC,MAAM,IAAI,CAAC,MAAM,YAAY,WAAI,IAAI,MAAM,YAAY,2BAAY,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC;IACrG,CAAC;IACD,yGAAyG;IACjG,MAAM,CAAC,UAAU,CAAC,EAAY;QACpC,MAAM,eAAe,GAAG,CAAC,EAAE,CAAC,aAAa,CAAC,aAAa,KAAK,EAAE,CAAC,CAAC;QAChE,IAAI,YAAY,GAAG,KAAK,CAAC;QACzB,IAAI,eAAe,EAAE,CAAC;YACpB,MAAM,EAAE,GAAG,4BAAkB,CAAC,gBAAgB,CAAC,EAAE,CAAC,CAAC;YACnD,MAAM,EAAE,GAAG,4BAAkB,CAAC,gBAAgB,CAAC,EAAE,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC;YAC1E,IAAI,CAAC,mBAAQ,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,eAAe;gBACrD,YAAY,GAAG,IAAI,CAAC,CAAE,8EAA8E;QACxG,CAAC;QACD,OAAO,eAAe,IAAI,CAAC,YAAY,CAAC;IAC1C,CAAC;IACD,0EAA0E;IAClE,MAAM,CAAC,kBAAkB,CAAC,MAAqB,EAAE,CAAW;QAClE,IAAI,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;YACpB,OAAO,SAAS,CAAC;QACnB,IAAI,EAAE,GAAG,CAAC,CAAC,QAAQ,CAAC;QACpB,OAAO,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,EAAE,CAAC;YAC3B,EAAE,GAAG,EAAE,CAAC,aAAa,CAAC,QAAQ,CAAC;YAC/B,IAAI,EAAE,KAAK,CAAC;gBACV,OAAO,SAAS,CAAC;QACrB,CAAC;QACD,OAAO,EAAE,CAAC;IACZ,CAAC;IACM,MAAM,CAAC,oCAAoC,CAAC,KAAoB,EAAE,oBAA4B,OAAO;QAC1G,MAAM,CAAC,GAAG,yCAAmB,CAAC,iDAAiD,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;QAClG,MAAM,MAAM,GAAkB,EAAE,CAAC;QACjC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAgC,CAAC;QACxD,KAAK,MAAM,SAAS,IAAI,CAAC,EAAE,CAAC;YAC1B,MAAM,cAAc,GAAgB,EAAE,iBAAiB,EAAE,EAAE,EAAE,iBAAiB,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;YAClG,MAAM,KAAK,GAAyB,EAAE,CAAC;YACvC,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;gBACjC,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;gBAC7C,MAAM,IAAI,GAAG,IAAI,CAAC,gBAAgB,CAAC,QAAQ,EAAE,CAAC,EAAY,EAAE,MAAsB,EAAE,KAAW,EAAE,EAAE;oBACjG,IAAI,CAAC,UAAU,EAAE,CAAC;wBAChB,MAAM,IAAI,GAAG,IAAI,CAAC,kBAAkB,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;wBAChD,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;4BACvB,MAAM,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;4BAC5B,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;gCACpB,oGAAoG;gCACpG,MAAM,EAAE,GAAG,IAAI,yBAAkB,CAAC,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;gCACvE,OAAO,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;4BACtB,CAAC;iCAAM,IAAI,CAAC,YAAY,yBAAkB,EAAE,CAAC;gCAC3C,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;gCACtB,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gCACd,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;4BACvB,CAAC;wBACH,CAAC;oBACH,CAAC;gBACH,CAAC,CAAC,CAAC;gBACH,IAAI,IAAI;oBACN,IAAI,CAAC,iBAAiB,CAAC,IAAI,EAAE,cAAc,EAAE,iBAAiB,EAAE,UAAU,CAAC,CAAC;YAChF,CAAC;YACD,cAAc,CAAC,KAAK,GAAG,KAAK,CAAC;YAC7B,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;YAC5B,OAAO,CAAC,KAAK,EAAE,CAAC;QAClB,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;CACF;AArRD,8CAqRC;AAED,SAAS,SAAS,CAAC,KAAqB,EAAE,QAAgB,EAAE,OAAgB;IAC1E,MAAM,GAAG,GAAG,KAAK,CAAC,4BAA4B,CAAC,QAAQ,CAAC,CAAC;IACzD,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;IAC/B,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,GAAG,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;AAC9D,CAAC;AAED,SAAS,kBAAkB,CAAC,IAA6B,EAAE,KAAqB;IAC9E,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,KAAK,KAAK;QAC9B,OAAO,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC;IAC/B,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,KAAK,KAAK;QAC9B,OAAO,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC;IAC/B,OAAO,SAAS,CAAC;AACnB,CAAC;AACD,SAAS,gBAAgB,CAAC,IAA6B,EAAE,KAAqB;IAC5E,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,KAAK,KAAK;QAC9B,OAAO,IAAI,CAAC,OAAO,CAAC;IACtB,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,KAAK,KAAK;QAC9B,OAAO,IAAI,CAAC,OAAO,CAAC;IACtB,OAAO,SAAS,CAAC;AACnB,CAAC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\nimport { assert } from \"@itwin/core-bentley\";\nimport { Geometry } from \"../../Geometry\";\nimport { Point3d } from \"../../geometry3d/Point3dVector3d\";\nimport { HalfEdge, HalfEdgeGraph, HalfEdgeMask } from \"../../topology/Graph\";\nimport { HalfEdgeGraphSearch } from \"../../topology/HalfEdgeGraphSearch\";\nimport { HalfEdgeGraphMerge } from \"../../topology/Merging\";\nimport { Arc3d } from \"../Arc3d\";\nimport { CurveLocationDetail, CurveLocationDetailPair } from \"../CurveLocationDetail\";\nimport { CurvePrimitive } from \"../CurvePrimitive\";\nimport { AnyRegion } from \"../CurveTypes\";\nimport { LineSegment3d } from \"../LineSegment3d\";\nimport { LineString3d } from \"../LineString3d\";\nimport { Loop, LoopCurveLoopCurve, SignedLoops } from \"../Loop\";\nimport { ParityRegion } from \"../ParityRegion\";\nimport { ConsolidateAdjacentCurvePrimitivesOptions, RegionOps } from \"../RegionOps\";\nimport { RegionGroupMember, RegionGroupOpType } from \"../RegionOpsClassificationSweeps\";\n\n/** @packageDocumentation\n * @module Curve\n */\n\nclass MapCurvePrimitiveToCurveLocationDetailPairArray {\n  public primitiveToPair = new Map<CurvePrimitive, CurveLocationDetailPair[]>();\n  // index assigned to this primitive (for debugging)\n  public primitiveToIndex = new Map<CurvePrimitive, number>();\n  private _numIndexedPrimitives: number = 0;\n  public assignPrimitiveIndex(primitive: CurvePrimitive | undefined) {\n    if (primitive !== undefined) {\n      const index = this.primitiveToIndex.get(primitive);\n      if (index === undefined) {\n        this.primitiveToIndex.set(primitive, this._numIndexedPrimitives++);\n      }\n    }\n  }\n  public insertPrimitiveToPair(primitive: CurvePrimitive | undefined, pair: CurveLocationDetailPair) {\n    if (primitive) {\n      const priorPairs = this.primitiveToPair.get(primitive);\n      this.assignPrimitiveIndex(primitive);\n      if (!priorPairs) {\n        this.primitiveToPair.set(primitive, [pair]);\n      } else {\n        priorPairs.push(pair);\n      }\n    }\n  }\n  public insertPair(pair: CurveLocationDetailPair) {\n    const primitiveA = pair.detailA.curve;\n    if (primitiveA)\n      this.insertPrimitiveToPair(primitiveA, pair);\n    const primitiveB = pair.detailB.curve;\n    if (primitiveB)\n      this.insertPrimitiveToPair(primitiveB, pair);\n  }\n  /**\n   * Split closed missing primitives in half and add new intersection pairs.\n   * * When bridge edges aren't included in the primitives array, a closed primitive with no intersections will not be\n   * added to the graph because it isn't in the `primitiveToPair` map. By splitting such a missing primitive in two, we\n   * introduce two intersections for each half, which allows the primitive to be represented in the map.\n   */\n  public splitAndAppendMissingClosedPrimitives(\n    primitives: CurvePrimitive[], tolerance: number = Geometry.smallMetricDistance,\n  ): void {\n    for (const p of primitives) {\n      let closedCurveSplitCandidate = false;\n      if (p instanceof Arc3d)\n        closedCurveSplitCandidate = p.sweep.isFullCircle;\n      else if (!(p instanceof LineSegment3d) && !(p instanceof LineString3d)) // TODO: probably should do this for all types. Lots of spline-type primitives can be closed.\n        closedCurveSplitCandidate = p.startPoint().isAlmostEqualXY(p.endPoint(), tolerance);\n      if (closedCurveSplitCandidate && !this.primitiveToPair.has(p)) {\n        const p0 = p.clonePartialCurve(0.0, 0.5);\n        const p1 = p.clonePartialCurve(0.5, 1.0);\n        if (p0 && p1) {\n          this.insertPair(CurveLocationDetailPair.createCapture(\n            CurveLocationDetail.createCurveEvaluatedFraction(p0, 0.0),\n            CurveLocationDetail.createCurveEvaluatedFraction(p1, 1.0),\n          ));\n          this.insertPair(CurveLocationDetailPair.createCapture(\n            CurveLocationDetail.createCurveEvaluatedFraction(p0, 1.0),\n            CurveLocationDetail.createCurveEvaluatedFraction(p1, 0.0),\n          ));\n        }\n      }\n    }\n  }\n}\n\n/**\n * @internal\n */\nexport class PlanarSubdivision {\n  /**\n   * Create a graph from an array of curves, and an array of the curves' precomputed intersections.\n   * Z-coordinates are ignored.\n   */\n  public static assembleHalfEdgeGraph(\n    primitives: CurvePrimitive[],\n    allPairs: CurveLocationDetailPair[],\n    mergeTolerance: number = Geometry.smallMetricDistance,\n  ): HalfEdgeGraph {\n    // map from key CurvePrimitive to CurveLocationDetailPair\n    const detailByPrimitive = new MapCurvePrimitiveToCurveLocationDetailPairArray();\n    for (const pair of allPairs)\n      detailByPrimitive.insertPair(pair);\n    if (primitives.length > detailByPrimitive.primitiveToPair.size) {\n      // otherwise, these single-primitive loops are missing from the graph\n      detailByPrimitive.splitAndAppendMissingClosedPrimitives(primitives, mergeTolerance);\n    }\n    const graph = new HalfEdgeGraph();\n    for (const entry of detailByPrimitive.primitiveToPair.entries()) {\n      const p = entry[0];\n      // convert each interval intersection into two isolated intersections\n      const details = entry[1].reduce((accumulator: CurveLocationDetailPair[], detailPair) => {\n        if (!detailPair.detailA.hasFraction1)\n          return [...accumulator, detailPair];\n        const detail = getDetailOnCurve(detailPair, p)!;\n        const detail0 = CurveLocationDetail.createCurveFractionPoint(p, detail.fraction, detail.point);\n        const detail1 = CurveLocationDetail.createCurveFractionPoint(p, detail.fraction1!, detail.point1!);\n        return [\n          ...accumulator,\n          CurveLocationDetailPair.createCapture(detail0, detail0),\n          CurveLocationDetailPair.createCapture(detail1, detail1),\n        ];\n      }, []);\n      // lexical sort on p intersection fraction\n      details.sort((pairA: CurveLocationDetailPair, pairB: CurveLocationDetailPair) => {\n        const fractionA = getFractionOnCurve(pairA, p)!;\n        const fractionB = getFractionOnCurve(pairB, p)!;\n        return fractionA - fractionB;\n      });\n      let last = { point: p.startPoint(), fraction: 0.0 };\n      for (const detailPair of details) {\n        const detail = getDetailOnCurve(detailPair, p)!;\n        const detailFraction = Geometry.restrictToInterval(detail.fraction, 0, 1); // truncate fraction, but don't snap point; clustering happens later\n        last = this.addHalfEdge(graph, p, last.point, last.fraction, detail.point, detailFraction, mergeTolerance);\n      }\n      this.addHalfEdge(graph, p, last.point, last.fraction, p.endPoint(), 1.0, mergeTolerance);\n    }\n    // every edge got its sortAngle defined by addHalfEdge\n    HalfEdgeGraphMerge.clusterAndMergeXYTheta(graph, (he: HalfEdge) => he.sortAngle ?? 0, mergeTolerance);\n    return graph;\n  }\n  /**\n   * Create a pair of mated half edges referencing an interval of a primitive.\n   * * no action if start and end points are identical.\n   * @param graph containing graph\n   * @param p the curve\n   * @param point0 start point\n   * @param fraction0 starting fraction\n   * @param point1 end point\n   * @param fraction1 end fraction\n   * @returns end point and fraction, or start point and fraction if no action\n   */\n  private static addHalfEdge(\n    graph: HalfEdgeGraph,\n    p: CurvePrimitive,\n    point0: Point3d,\n    fraction0: number,\n    point1: Point3d,\n    fraction1: number,\n    mergeTolerance: number = Geometry.smallMetricDistance,\n  ): { point: Point3d, fraction: number } {\n    if (point0.isAlmostEqualXY(point1, mergeTolerance))\n      return { point: point0, fraction: fraction0 };\n    const halfEdge = graph.createEdgeXYAndZ(point0, 0, point1, 0);\n    if (p.parent && p.parent instanceof RegionGroupMember && p.parent.parentGroup.groupOpType === RegionGroupOpType.NonBounding)\n      halfEdge.setMaskAroundEdge(HalfEdgeMask.BRIDGE_EDGE);\n    const detail01 = CurveLocationDetail.createCurveEvaluatedFractionFraction(p, fraction0, fraction1);\n    const mate = halfEdge.edgeMate;\n    halfEdge.edgeTag = detail01;\n    halfEdge.sortData = 1.0;\n    mate.edgeTag = detail01;\n    mate.sortData = -1.0;\n    halfEdge.sortAngle = sortAngle(p, fraction0, false);\n    mate.sortAngle = sortAngle(p, fraction1, true);\n    return { point: point1, fraction: fraction1 };\n  }\n  /**\n   * Based on computed (and toleranced) area, push the loop (pointer) onto the appropriate array of positive, negative,\n   * or sliver loops.\n   * @param zeroAreaTolerance absolute area tolerance for sliver face detection\n   * @param isSliverFace whether the loop is known a priori (e.g., via topology) to have zero area\n   * @returns the area (forced to zero if within tolerance)\n   */\n  public static collectSignedLoop(\n    loop: Loop, outLoops: SignedLoops, zeroAreaTolerance: number = 1.0e-10, isSliverFace?: boolean,\n  ): number {\n    let area = isSliverFace ? 0.0 : RegionOps.computeXYArea(loop);\n    if (area === undefined)\n      area = 0;\n    if (Math.abs(area) < zeroAreaTolerance)\n      area = 0.0;\n    (loop as any).computedAreaInPlanarSubdivision = area;\n    if (area > 0)\n      outLoops.positiveAreaLoops.push(loop);\n    else if (area < 0)\n      outLoops.negativeAreaLoops.push(loop);\n    else\n      outLoops.slivers.push(loop);\n    return area;\n  }\n  /** Extract geometric info from a topological edge. */\n  private static extractGeometryFromEdge(edge: HalfEdge): { detail: CurveLocationDetail, reversed: boolean } | undefined {\n    if (edge.sortData !== undefined && edge.edgeTag && edge.edgeTag instanceof CurveLocationDetail) {\n      const detail = edge.edgeTag;\n      if (detail.curve && detail.fraction1 !== undefined) {\n        const reversed = edge.sortData < 0;\n        return { detail, reversed };\n      }\n    }\n    return undefined;\n  }\n  /** Create the geometry for a topological edge. */\n  private static createCurveInEdge(edge: HalfEdge): CurvePrimitive | undefined {\n    const info = this.extractGeometryFromEdge(edge);\n    if (info) {\n      if (info.reversed)\n        return info.detail.curve!.clonePartialCurve(info.detail.fraction1!, info.detail.fraction);\n      return info.detail.curve!.clonePartialCurve(info.detail.fraction, info.detail.fraction1!);\n    }\n    return undefined;\n  }\n  /**\n   * Create a [[Loop]] for the given face or super face.\n   * @param face a node in the face loop, or an array of HalfEdges that comprise a loop (e.g., a super face).\n   * @param announce optional callback invoked on each edge/curve of the face/Loop.\n   * @param compress whether to consolidate adjacent curves in the output Loop (default `false`).\n   * If `announce` is provided, no compression is performed, as edges and curves would no longer be in 1-1 correspondence.\n   * @param closureTol absolute xy-distance for confirming the returned Loop is closed (default [[Geometry.smallMetricDistance]]).\n   * @returns the Loop, or `undefined` if it is not closed within xy-tolerance.\n   */\n  public static createLoopInFace(\n    face: HalfEdge | HalfEdge[],\n    announce?: (he: HalfEdge, curve: CurvePrimitive, loop: Loop) => void,\n    compress: boolean = false,\n    closureTol: number = Geometry.smallMetricDistance,\n  ): Loop | undefined {\n    if (announce)\n      compress = false;\n    const loop = Loop.create();\n    const addEdgeCurve = (he: HalfEdge): void => {\n      const curve = this.createCurveInEdge(he);\n      if (curve) {\n        announce?.(he, curve, loop);\n        loop.tryAddChild(curve);\n      }\n    };\n    if (Array.isArray(face))\n      face.forEach(addEdgeCurve);\n    else\n      face.announceEdgesInFace(addEdgeCurve);\n    if (compress) {\n      const options = new ConsolidateAdjacentCurvePrimitivesOptions();\n      options.consolidateLoopSeam = true;\n      RegionOps.consolidateAdjacentPrimitives(loop, options);\n    }\n    if (loop.isPhysicallyClosedCurve(closureTol, true))\n      return loop;\n    assert(() => false, \"face is not physically closed\");\n    return undefined;\n  }\n  /**\n   * Create a [[Loop]] or [[ParityRegion]] for the given face.\n   * * A ParityRegion is created for a split-washer type face by removing bridge edges.\n   * @param face a node in the face loop.\n   * @param bridgeMask mask preset on bridge edges (default is `HalfEdgeMask.BRIDGE_EDGE`).\n   * @param visitMask mask to use for visiting edges in the face loop (default is `HalfEdgeMask.VISITED`).\n   * @param closureTol absolute xy-distance for confirming the returned Loop is closed (default [[Geometry.smallMetricDistance]]).\n   * @returns the Loop or ParityRegion, or `undefined` if one could not be computed\n   */\n  public static createLoopOrParityRegionInFace(\n    face: HalfEdge,\n    bridgeMask: HalfEdgeMask = HalfEdgeMask.BRIDGE_EDGE,\n    visitMask: HalfEdgeMask = HalfEdgeMask.VISITED,\n    closureTol: number = Geometry.smallMetricDistance,\n  ): Loop | ParityRegion | undefined {\n    let region: AnyRegion | undefined;\n    if (face.isSplitWasherFace(bridgeMask)) {\n      const loops: Loop[] = [];\n      const loopEdges: HalfEdge[] = [];\n      const bridgeStack: HalfEdge[] = [face.findMaskAroundFace(bridgeMask, true)!];\n      const announceEdge = (he: HalfEdge) => { he.setMask(visitMask); loopEdges.push(he); };\n      const announceBridge = (he: HalfEdge) => { if (!he.isMaskSet(visitMask)) bridgeStack.push(he); };\n      face.clearMaskAroundFace(visitMask);\n      let bridge: HalfEdge | undefined;\n      while (undefined !== (bridge = bridgeStack.pop())) {\n        bridge.setMask(visitMask);\n        const loopSeed = bridge.findMaskAroundFace(bridgeMask, false); // advance to next loop\n        if (loopSeed) {\n          if (loopSeed.isMaskSet(visitMask))\n            continue;\n          loopEdges.length = 0;\n          if (loopSeed.announceEdgesInSuperFace(bridgeMask, announceEdge, announceBridge)) {\n            const loop = this.createLoopInFace(loopEdges, undefined, true, closureTol);\n            if (loop) {\n              loops.push(loop);\n              continue;\n            }\n          }\n        }\n      }\n      region = RegionOps.sortOuterAndHoleLoopsXY(loops);\n      region = RegionOps.simplifyRegion(region);\n    } else {\n      region = this.createLoopInFace(face, undefined, true, closureTol);\n    }\n    return (region && (region instanceof Loop || region instanceof ParityRegion)) ? region : undefined;\n  }\n  /** Return true if there are only two edges in the face loop, and their start curvatures are the same. */\n  private static isNullFace(he: HalfEdge): boolean {\n    const faceHasTwoEdges = (he.faceSuccessor.faceSuccessor === he);\n    let faceIsBanana = false;\n    if (faceHasTwoEdges) {\n      const c0 = HalfEdgeGraphMerge.curvatureSortKey(he);\n      const c1 = HalfEdgeGraphMerge.curvatureSortKey(he.faceSuccessor.edgeMate);\n      if (!Geometry.isSameCoordinate(c0, c1)) // default tol!\n        faceIsBanana = true;  // heuristic: we could also check end curvatures, and/or higher derivatives...\n    }\n    return faceHasTwoEdges && !faceIsBanana;\n  }\n  /** Look across edge mates (possibly several) for a non-null mate face. */\n  private static getNonNullEdgeMate(_graph: HalfEdgeGraph, e: HalfEdge): HalfEdge | undefined {\n    if (this.isNullFace(e))\n      return undefined;\n    let e1 = e.edgeMate;\n    while (this.isNullFace(e1)) {\n      e1 = e1.faceSuccessor.edgeMate;\n      if (e1 === e)\n        return undefined;\n    }\n    return e1;\n  }\n  public static collectSignedLoopSetsInHalfEdgeGraph(graph: HalfEdgeGraph, zeroAreaTolerance: number = 1.0e-10): SignedLoops[] {\n    const q = HalfEdgeGraphSearch.collectConnectedComponentsWithExteriorParityMasks(graph, undefined);\n    const result: SignedLoops[] = [];\n    const edgeMap = new Map<HalfEdge, LoopCurveLoopCurve>();\n    for (const faceSeeds of q) {\n      const componentAreas: SignedLoops = { positiveAreaLoops: [], negativeAreaLoops: [], slivers: [] };\n      const edges: LoopCurveLoopCurve[] = [];\n      for (const faceSeed of faceSeeds) {\n        const isNullFace = this.isNullFace(faceSeed);\n        const loop = this.createLoopInFace(faceSeed, (he: HalfEdge, curveC: CurvePrimitive, loopC: Loop) => {\n          if (!isNullFace) {\n            const mate = this.getNonNullEdgeMate(graph, he);\n            if (mate !== undefined) {\n              const e = edgeMap.get(mate);\n              if (e === undefined) {\n                // Record this as loopA,edgeA of a shared edge to be completed later from the other side of the edge\n                const e1 = new LoopCurveLoopCurve(loopC, curveC, undefined, undefined);\n                edgeMap.set(he, e1);\n              } else if (e instanceof LoopCurveLoopCurve) {\n                e.setB(loopC, curveC);\n                edges.push(e);\n                edgeMap.delete(mate);\n              }\n            }\n          }\n        });\n        if (loop)\n          this.collectSignedLoop(loop, componentAreas, zeroAreaTolerance, isNullFace);\n      }\n      componentAreas.edges = edges;\n      result.push(componentAreas);\n      edgeMap.clear();\n    }\n    return result;\n  }\n}\n\nfunction sortAngle(curve: CurvePrimitive, fraction: number, reverse: boolean): number {\n  const ray = curve.fractionToPointAndDerivative(fraction);\n  const s = reverse ? -1.0 : 1.0;\n  return Math.atan2(s * ray.direction.y, s * ray.direction.x);\n}\n\nfunction getFractionOnCurve(pair: CurveLocationDetailPair, curve: CurvePrimitive): number | undefined {\n  if (pair.detailA.curve === curve)\n    return pair.detailA.fraction;\n  if (pair.detailB.curve === curve)\n    return pair.detailB.fraction;\n  return undefined;\n}\nfunction getDetailOnCurve(pair: CurveLocationDetailPair, curve: CurvePrimitive): CurveLocationDetail | undefined {\n  if (pair.detailA.curve === curve)\n    return pair.detailA;\n  if (pair.detailB.curve === curve)\n    return pair.detailB;\n  return undefined;\n}\n"]}
+{"version":3,"file":"PlanarSubdivision.js","sourceRoot":"","sources":["../../../../src/curve/Query/PlanarSubdivision.ts"],"names":[],"mappings":";;;AAAA;;;+FAG+F;AAC/F,sDAA6C;AAC7C,6CAA0C;AAE1C,0DAAuD;AACvD,gDAA6E;AAC7E,4EAAyE;AACzE,oDAA4D;AAC5D,oCAAiC;AACjC,gEAAsF;AAGtF,oDAAiD;AACjD,kDAA+C;AAC/C,kCAAgE;AAChE,kDAA+C;AAC/C,4CAAoF;AACpF,oFAAwF;AAExF;;GAEG;AAEH,SAAS,gBAAgB,CAAC,KAAqB,EAAE,QAAgB,EAAE,OAAgB;IACjF,MAAM,GAAG,GAAG,KAAK,CAAC,4BAA4B,CAAC,QAAQ,CAAC,CAAC;IACzD,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;IAC/B,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,GAAG,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;AAC9D,CAAC;AACD,SAAS,kBAAkB,CAAC,IAA6B,EAAE,KAAqB;IAC9E,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,KAAK,KAAK;QAC9B,OAAO,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC;IAC/B,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,KAAK,KAAK;QAC9B,OAAO,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC;IAC/B,OAAO,SAAS,CAAC;AACnB,CAAC;AACD,SAAS,gBAAgB,CAAC,IAA6B,EAAE,KAAqB;IAC5E,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,KAAK,KAAK;QAC9B,OAAO,IAAI,CAAC,OAAO,CAAC;IACtB,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,KAAK,KAAK;QAC9B,OAAO,IAAI,CAAC,OAAO,CAAC;IACtB,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,MAAM,+CAA+C;IAC5C,eAAe,GAAG,IAAI,GAAG,EAA6C,CAAC;IAC9E,mDAAmD;IAC5C,gBAAgB,GAAG,IAAI,GAAG,EAA0B,CAAC;IACpD,qBAAqB,GAAW,CAAC,CAAC;IACnC,oBAAoB,CAAC,SAAqC;QAC/D,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;YAC5B,MAAM,KAAK,GAAG,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YACnD,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;gBACxB,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,SAAS,EAAE,IAAI,CAAC,qBAAqB,EAAE,CAAC,CAAC;YACrE,CAAC;QACH,CAAC;IACH,CAAC;IACM,qBAAqB,CAAC,SAAqC,EAAE,IAA6B;QAC/F,IAAI,SAAS,EAAE,CAAC;YACd,MAAM,UAAU,GAAG,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YACvD,IAAI,CAAC,oBAAoB,CAAC,SAAS,CAAC,CAAC;YACrC,IAAI,CAAC,UAAU,EAAE,CAAC;gBAChB,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;YAC9C,CAAC;iBAAM,CAAC;gBACN,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACxB,CAAC;QACH,CAAC;IACH,CAAC;IACM,UAAU,CAAC,IAA6B;QAC7C,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC;QACtC,IAAI,UAAU;YACZ,IAAI,CAAC,qBAAqB,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;QAC/C,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC;QACtC,IAAI,UAAU;YACZ,IAAI,CAAC,qBAAqB,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;IACjD,CAAC;IACD;;;;;OAKG;IACI,qCAAqC,CAC1C,UAA4B,EAAE,YAAoB,mBAAQ,CAAC,mBAAmB;QAE9E,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;YAC3B,IAAI,yBAAyB,GAAG,KAAK,CAAC;YACtC,IAAI,CAAC,YAAY,aAAK;gBACpB,yBAAyB,GAAG,CAAC,CAAC,KAAK,CAAC,YAAY,CAAC;iBAC9C,IAAI,CAAC,CAAC,CAAC,YAAY,6BAAa,CAAC,IAAI,CAAC,CAAC,CAAC,YAAY,2BAAY,CAAC,EAAE,6FAA6F;gBACnK,yBAAyB,GAAG,CAAC,CAAC,UAAU,EAAE,CAAC,eAAe,CAAC,CAAC,CAAC,QAAQ,EAAE,EAAE,SAAS,CAAC,CAAC;YACtF,IAAI,yBAAyB,IAAI,CAAC,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC9D,MAAM,EAAE,GAAG,CAAC,CAAC,iBAAiB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;gBACzC,MAAM,EAAE,GAAG,CAAC,CAAC,iBAAiB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;gBACzC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC;oBACb,IAAI,CAAC,UAAU,CAAC,6CAAuB,CAAC,aAAa,CACnD,yCAAmB,CAAC,4BAA4B,CAAC,EAAE,EAAE,GAAG,CAAC,EACzD,yCAAmB,CAAC,4BAA4B,CAAC,EAAE,EAAE,GAAG,CAAC,CAC1D,CAAC,CAAC;oBACH,IAAI,CAAC,UAAU,CAAC,6CAAuB,CAAC,aAAa,CACnD,yCAAmB,CAAC,4BAA4B,CAAC,EAAE,EAAE,GAAG,CAAC,EACzD,yCAAmB,CAAC,4BAA4B,CAAC,EAAE,EAAE,GAAG,CAAC,CAC1D,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;CACF;AAED;;GAEG;AACH,MAAa,iBAAiB;IAC5B;;;;;;OAMG;IACI,MAAM,CAAC,qBAAqB,CACjC,UAA4B,EAC5B,QAAmC,EACnC,iBAAyB,mBAAQ,CAAC,mBAAmB;QAErD,yDAAyD;QACzD,MAAM,iBAAiB,GAAG,IAAI,+CAA+C,EAAE,CAAC;QAChF,KAAK,MAAM,IAAI,IAAI,QAAQ;YACzB,iBAAiB,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QACrC,IAAI,UAAU,CAAC,MAAM,GAAG,iBAAiB,CAAC,eAAe,CAAC,IAAI,EAAE,CAAC;YAC/D,qEAAqE;YACrE,iBAAiB,CAAC,qCAAqC,CAAC,UAAU,EAAE,cAAc,CAAC,CAAC;QACtF,CAAC;QACD,MAAM,KAAK,GAAG,IAAI,qBAAa,EAAE,CAAC;QAClC,KAAK,MAAM,KAAK,IAAI,iBAAiB,CAAC,eAAe,CAAC,OAAO,EAAE,EAAE,CAAC;YAChE,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACnB,qEAAqE;YACrE,MAAM,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,WAAsC,EAAE,UAAU,EAAE,EAAE;gBACrF,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,YAAY;oBAClC,OAAO,CAAC,GAAG,WAAW,EAAE,UAAU,CAAC,CAAC;gBACtC,MAAM,MAAM,GAAG,gBAAgB,CAAC,UAAU,EAAE,CAAC,CAAE,CAAC;gBAChD,MAAM,OAAO,GAAG,yCAAmB,CAAC,wBAAwB,CAAC,CAAC,EAAE,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC;gBAC/F,MAAM,OAAO,GAAG,yCAAmB,CAAC,wBAAwB,CAAC,CAAC,EAAE,MAAM,CAAC,SAAU,EAAE,MAAM,CAAC,MAAO,CAAC,CAAC;gBACnG,OAAO;oBACL,GAAG,WAAW;oBACd,6CAAuB,CAAC,aAAa,CAAC,OAAO,EAAE,OAAO,CAAC;oBACvD,6CAAuB,CAAC,aAAa,CAAC,OAAO,EAAE,OAAO,CAAC;iBACxD,CAAC;YACJ,CAAC,EAAE,EAAE,CAAC,CAAC;YACP,0CAA0C;YAC1C,OAAO,CAAC,IAAI,CAAC,CAAC,KAA8B,EAAE,KAA8B,EAAE,EAAE;gBAC9E,MAAM,SAAS,GAAG,kBAAkB,CAAC,KAAK,EAAE,CAAC,CAAE,CAAC;gBAChD,MAAM,SAAS,GAAG,kBAAkB,CAAC,KAAK,EAAE,CAAC,CAAE,CAAC;gBAChD,OAAO,SAAS,GAAG,SAAS,CAAC;YAC/B,CAAC,CAAC,CAAC;YACH,IAAI,IAAI,GAAG,EAAE,KAAK,EAAE,CAAC,CAAC,UAAU,EAAE,EAAE,QAAQ,EAAE,GAAG,EAAE,CAAC;YACpD,KAAK,MAAM,UAAU,IAAI,OAAO,EAAE,CAAC;gBACjC,MAAM,MAAM,GAAG,gBAAgB,CAAC,UAAU,EAAE,CAAC,CAAE,CAAC;gBAChD,MAAM,cAAc,GAAG,mBAAQ,CAAC,kBAAkB,CAAC,MAAM,CAAC,QAAQ,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,oEAAoE;gBAC/I,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,QAAQ,EAAE,MAAM,CAAC,KAAK,EAAE,cAAc,EAAE,cAAc,CAAC,CAAC;YAC7G,CAAC;YACD,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,EAAE,GAAG,EAAE,cAAc,CAAC,CAAC;QAC3F,CAAC;QACD,sDAAsD;QACtD,4BAAkB,CAAC,sBAAsB,CAAC,KAAK,EAAE,CAAC,EAAY,EAAE,EAAE,CAAC,EAAE,CAAC,SAAS,IAAI,CAAC,EAAE,cAAc,CAAC,CAAC;QACtG,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;MAGE;IACM,MAAM,CAAC,gBAAgB,CAAC,CAAiB,EAAE,MAAe,EAAE,SAAiB,EAAE,MAAe,EAAE,SAAiB,EAAE,cAAsB;QAC/I,IAAI,mBAAQ,CAAC,eAAe,CAAC,SAAS,GAAG,SAAS,CAAC;YACjD,OAAO,IAAI,CAAC;QACd,IAAI,CAAC,CAAC,CAAC,YAAY,6BAAa,CAAC,EAAE,CAAC;YAClC,MAAM,EAAE,GAAG,CAAC,CAAC,iBAAiB,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;YACrD,IAAI,EAAE,EAAE,mBAAmB,CAAC,qBAAS,CAAC,eAAe,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,UAAU;gBACpG,OAAO,EAAE,CAAC,WAAW,EAAE,IAAI,cAAc,CAAC,CAAC,YAAY;QAC3D,CAAC;QACD,OAAO,MAAM,CAAC,eAAe,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC,CAAC,YAAY;IACrE,CAAC;IAED;;;;;;;;;;OAUG;IACK,MAAM,CAAC,WAAW,CACxB,KAAoB,EACpB,CAAiB,EACjB,MAAe,EACf,SAAiB,EACjB,MAAe,EACf,SAAiB,EACjB,iBAAyB,mBAAQ,CAAC,mBAAmB;QAErD,IAAI,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,cAAc,CAAC,EAAE,CAAC;YACpF,MAAM,QAAQ,GAAG,KAAK,CAAC,gBAAgB,CAAC,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC;YAC9D,IAAI,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,MAAM,YAAY,iDAAiB,IAAI,CAAC,CAAC,MAAM,CAAC,WAAW,CAAC,WAAW,KAAK,iDAAiB,CAAC,WAAW;gBACzH,QAAQ,CAAC,iBAAiB,CAAC,oBAAY,CAAC,WAAW,CAAC,CAAC;YACvD,MAAM,QAAQ,GAAG,yCAAmB,CAAC,oCAAoC,CAAC,CAAC,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;YACnG,MAAM,IAAI,GAAG,QAAQ,CAAC,QAAQ,CAAC;YAC/B,QAAQ,CAAC,OAAO,GAAG,QAAQ,CAAC;YAC5B,QAAQ,CAAC,QAAQ,GAAG,GAAG,CAAC;YACxB,IAAI,CAAC,OAAO,GAAG,QAAQ,CAAC;YACxB,IAAI,CAAC,QAAQ,GAAG,CAAC,GAAG,CAAC;YACrB,QAAQ,CAAC,SAAS,GAAG,gBAAgB,CAAC,CAAC,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC;YAC3D,IAAI,CAAC,SAAS,GAAG,gBAAgB,CAAC,CAAC,EAAE,SAAS,EAAE,IAAI,CAAC,CAAC;QACxD,CAAC;QACD,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC,CAAC,uCAAuC;IACxF,CAAC;IACD;;;;;;OAMG;IACI,MAAM,CAAC,iBAAiB,CAC7B,IAAU,EAAE,QAAqB,EAAE,oBAA4B,OAAO,EAAE,YAAsB;QAE9F,IAAI,IAAI,GAAG,YAAY,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,qBAAS,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;QAC9D,IAAI,IAAI,KAAK,SAAS;YACpB,IAAI,GAAG,CAAC,CAAC;QACX,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,iBAAiB;YACpC,IAAI,GAAG,GAAG,CAAC;QACZ,IAAY,CAAC,+BAA+B,GAAG,IAAI,CAAC;QACrD,IAAI,IAAI,GAAG,CAAC;YACV,QAAQ,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;aACnC,IAAI,IAAI,GAAG,CAAC;YACf,QAAQ,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;;YAEtC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9B,OAAO,IAAI,CAAC;IACd,CAAC;IACD,sDAAsD;IAC9C,MAAM,CAAC,uBAAuB,CAAC,IAAc;QACnD,IAAI,IAAI,CAAC,QAAQ,KAAK,SAAS,IAAI,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,OAAO,YAAY,yCAAmB,EAAE,CAAC;YAC/F,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC;YAC5B,IAAI,MAAM,CAAC,KAAK,IAAI,MAAM,CAAC,SAAS,KAAK,SAAS,EAAE,CAAC;gBACnD,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC;gBACnC,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC;YAC9B,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,kDAAkD;IAC1C,MAAM,CAAC,iBAAiB,CAAC,IAAc,EAAE,CAAU;QACzD,IAAI,MAAkC,CAAC;QACvC,MAAM,IAAI,GAAG,IAAI,CAAC,uBAAuB,CAAC,IAAI,CAAC,CAAC;QAChD,IAAI,IAAI,IAAI,IAAI,CAAC,MAAM,CAAC,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC;YACvD,MAAM,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC;YACxE,MAAM,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC;YACxE,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,iBAAiB,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YACrD,IAAI,MAAM,IAAI,CAAC,KAAK,SAAS;gBAC3B,MAAM,CAAC,mBAAmB,CAAC,qBAAS,CAAC,eAAe,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAC9F,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,gBAAgB,CAAC,IAA2B,EAAE,OAAqD;QAC/G,MAAM,WAAW,GAAG,OAAO,EAAE,YAAY,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,EAAE,QAAQ,IAAI,KAAK,CAAC,CAAC,+BAA+B;QAC/G,MAAM,IAAI,GAAG,WAAI,CAAC,MAAM,EAAE,CAAC;QAC3B,MAAM,YAAY,GAAG,CAAC,IAAc,EAAQ,EAAE;YAC5C,MAAM,KAAK,GAAG,IAAI,CAAC,iBAAiB,CAAC,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC;YACvD,IAAI,KAAK,EAAE,CAAC;gBACV,OAAO,EAAE,YAAY,EAAE,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;gBAC3C,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;YAC1B,CAAC;QACH,CAAC,CAAC;QACF,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC;YACrB,IAAI,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC;;YAE3B,IAAI,CAAC,mBAAmB,CAAC,YAAY,CAAC,CAAC;QACzC,IAAI,WAAW,EAAE,CAAC;YAChB,MAAM,kBAAkB,GAAG,IAAI,qDAAyC,EAAE,CAAC;YAC3E,kBAAkB,CAAC,mBAAmB,GAAG,IAAI,CAAC;YAC9C,qBAAS,CAAC,6BAA6B,CAAC,IAAI,EAAE,kBAAkB,CAAC,CAAC;QACpE,CAAC;QACD,IAAI,IAAI,CAAC,uBAAuB,CAAC,OAAO,EAAE,UAAU,EAAE,IAAI,CAAC;YACzD,OAAO,IAAI,CAAC;QACd,IAAA,qBAAM,EAAC,GAAG,EAAE,CAAC,KAAK,EAAE,+BAA+B,CAAC,CAAC;QACrD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;OAMG;IACI,MAAM,CAAC,8BAA8B,CAAC,IAAc,EAAE,OAAqD;QAChH,IAAI,MAA6B,CAAC;QAClC,MAAM,SAAS,GAAG,OAAO,EAAE,SAAS,IAAI,oBAAY,CAAC,OAAO,CAAC;QAC7D,MAAM,UAAU,GAAG,OAAO,EAAE,UAAU,IAAI,oBAAY,CAAC,WAAW,CAAC;QACnE,IAAI,eAAqC,CAAC;QAC1C,6BAA6B;QAC7B,IAAI,IAAI,CAAC,iBAAiB,CAAC,UAAU,CAAC,IAAI,CAAC,eAAe,GAAG,IAAI,CAAC,kBAAkB,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC,EAAE,CAAC;YACxG,MAAM,KAAK,GAAW,EAAE,CAAC;YACzB,MAAM,SAAS,GAAe,EAAE,CAAC;YACjC,MAAM,WAAW,GAAe,CAAC,eAAe,CAAC,CAAC;YAClD,MAAM,YAAY,GAAG,CAAC,EAAY,EAAE,EAAE,GAAG,EAAE,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YACtF,MAAM,cAAc,GAAG,CAAC,EAAY,EAAE,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC,SAAS,CAAC,SAAS,CAAC;gBAAE,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YACjG,IAAI,CAAC,mBAAmB,CAAC,SAAS,CAAC,CAAC;YACpC,IAAI,MAA4B,CAAC;YACjC,OAAO,SAAS,KAAK,CAAC,MAAM,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC;gBAClD,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;gBAC1B,MAAM,QAAQ,GAAG,MAAM,CAAC,kBAAkB,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC,CAAC,uBAAuB;gBACtF,IAAI,QAAQ,EAAE,CAAC;oBACb,IAAI,QAAQ,CAAC,SAAS,CAAC,SAAS,CAAC;wBAC/B,SAAS;oBACX,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;oBACrB,IAAI,QAAQ,CAAC,wBAAwB,CAAC,UAAU,EAAE,YAAY,EAAE,cAAc,CAAC,EAAE,CAAC;wBAChF,MAAM,IAAI,GAAG,IAAI,CAAC,gBAAgB,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;wBACvD,IAAI,IAAI,EAAE,CAAC;4BACT,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;4BACjB,SAAS;wBACX,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;YACD,MAAM,GAAG,qBAAS,CAAC,uBAAuB,CAAC,KAAK,CAAC,CAAC;YAClD,MAAM,GAAG,qBAAS,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC;QAC5C,CAAC;aAAM,CAAC;YACN,MAAM,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QAChD,CAAC;QACD,OAAO,CAAC,MAAM,IAAI,CAAC,MAAM,YAAY,WAAI,IAAI,MAAM,YAAY,2BAAY,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC;IACrG,CAAC;IACD,yGAAyG;IACjG,MAAM,CAAC,UAAU,CAAC,EAAY;QACpC,MAAM,eAAe,GAAG,CAAC,EAAE,CAAC,aAAa,CAAC,aAAa,KAAK,EAAE,CAAC,CAAC;QAChE,IAAI,YAAY,GAAG,KAAK,CAAC;QACzB,IAAI,eAAe,EAAE,CAAC;YACpB,MAAM,EAAE,GAAG,4BAAkB,CAAC,gBAAgB,CAAC,EAAE,CAAC,CAAC;YACnD,MAAM,EAAE,GAAG,4BAAkB,CAAC,gBAAgB,CAAC,EAAE,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC;YAC1E,IAAI,CAAC,mBAAQ,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,eAAe;gBACrD,YAAY,GAAG,IAAI,CAAC,CAAE,8EAA8E;QACxG,CAAC;QACD,OAAO,eAAe,IAAI,CAAC,YAAY,CAAC;IAC1C,CAAC;IACD,0EAA0E;IAClE,MAAM,CAAC,kBAAkB,CAAC,MAAqB,EAAE,CAAW;QAClE,IAAI,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;YACpB,OAAO,SAAS,CAAC;QACnB,IAAI,EAAE,GAAG,CAAC,CAAC,QAAQ,CAAC;QACpB,OAAO,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,EAAE,CAAC;YAC3B,EAAE,GAAG,EAAE,CAAC,aAAa,CAAC,QAAQ,CAAC;YAC/B,IAAI,EAAE,KAAK,CAAC;gBACV,OAAO,SAAS,CAAC;QACrB,CAAC;QACD,OAAO,EAAE,CAAC;IACZ,CAAC;IACM,MAAM,CAAC,oCAAoC,CAAC,KAAoB,EAAE,oBAA4B,OAAO;QAC1G,MAAM,CAAC,GAAG,yCAAmB,CAAC,iDAAiD,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;QAClG,MAAM,MAAM,GAAkB,EAAE,CAAC;QACjC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAgC,CAAC;QACxD,KAAK,MAAM,SAAS,IAAI,CAAC,EAAE,CAAC;YAC1B,MAAM,cAAc,GAAgB,EAAE,iBAAiB,EAAE,EAAE,EAAE,iBAAiB,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;YAClG,MAAM,KAAK,GAAyB,EAAE,CAAC;YACvC,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;gBACjC,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;gBAC7C,MAAM,YAAY,GAAG,UAAU,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,EAAY,EAAE,MAAsB,EAAE,KAAW,EAAE,EAAE;oBAClG,MAAM,IAAI,GAAG,IAAI,CAAC,kBAAkB,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;oBAChD,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;wBACvB,MAAM,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;wBAC5B,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;4BACpB,oGAAoG;4BACpG,MAAM,EAAE,GAAG,IAAI,yBAAkB,CAAC,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;4BACvE,OAAO,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;wBACtB,CAAC;6BAAM,IAAI,CAAC,YAAY,yBAAkB,EAAE,CAAC;4BAC3C,CAAC,CAAC,IAAI,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;4BACtB,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;4BACd,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;wBACvB,CAAC;oBACH,CAAC;gBACH,CAAC,CAAC;gBACF,MAAM,IAAI,GAAG,IAAI,CAAC,gBAAgB,CAAC,QAAQ,EAAE,EAAE,YAAY,EAAE,CAAC,CAAC;gBAC/D,IAAI,IAAI;oBACN,IAAI,CAAC,iBAAiB,CAAC,IAAI,EAAE,cAAc,EAAE,iBAAiB,EAAE,UAAU,CAAC,CAAC;YAChF,CAAC;YACD,cAAc,CAAC,KAAK,GAAG,KAAK,CAAC;YAC7B,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;YAC5B,OAAO,CAAC,KAAK,EAAE,CAAC;QAClB,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;CACF;AA9RD,8CA8RC","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\nimport { assert } from \"@itwin/core-bentley\";\r\nimport { Geometry } from \"../../Geometry\";\r\nimport { Point3d } from \"../../geometry3d/Point3dVector3d\";\r\nimport { Transform } from \"../../geometry3d/Transform\";\r\nimport { HalfEdge, HalfEdgeGraph, HalfEdgeMask } from \"../../topology/Graph\";\r\nimport { HalfEdgeGraphSearch } from \"../../topology/HalfEdgeGraphSearch\";\r\nimport { HalfEdgeGraphMerge } from \"../../topology/Merging\";\r\nimport { Arc3d } from \"../Arc3d\";\r\nimport { CurveLocationDetail, CurveLocationDetailPair } from \"../CurveLocationDetail\";\r\nimport { CurvePrimitive } from \"../CurvePrimitive\";\r\nimport { AnyRegion } from \"../CurveTypes\";\r\nimport { LineSegment3d } from \"../LineSegment3d\";\r\nimport { LineString3d } from \"../LineString3d\";\r\nimport { Loop, LoopCurveLoopCurve, SignedLoops } from \"../Loop\";\r\nimport { ParityRegion } from \"../ParityRegion\";\r\nimport { ConsolidateAdjacentCurvePrimitivesOptions, RegionOps } from \"../RegionOps\";\r\nimport { RegionGroupMember, RegionGroupOpType } from \"../RegionOpsClassificationSweeps\";\r\n\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\n\r\nfunction computeSortAngle(curve: CurvePrimitive, fraction: number, reverse: boolean): number {\r\n  const ray = curve.fractionToPointAndDerivative(fraction);\r\n  const s = reverse ? -1.0 : 1.0;\r\n  return Math.atan2(s * ray.direction.y, s * ray.direction.x);\r\n}\r\nfunction getFractionOnCurve(pair: CurveLocationDetailPair, curve: CurvePrimitive): number | undefined {\r\n  if (pair.detailA.curve === curve)\r\n    return pair.detailA.fraction;\r\n  if (pair.detailB.curve === curve)\r\n    return pair.detailB.fraction;\r\n  return undefined;\r\n}\r\nfunction getDetailOnCurve(pair: CurveLocationDetailPair, curve: CurvePrimitive): CurveLocationDetail | undefined {\r\n  if (pair.detailA.curve === curve)\r\n    return pair.detailA;\r\n  if (pair.detailB.curve === curve)\r\n    return pair.detailB;\r\n  return undefined;\r\n}\r\n\r\nclass MapCurvePrimitiveToCurveLocationDetailPairArray {\r\n  public primitiveToPair = new Map<CurvePrimitive, CurveLocationDetailPair[]>();\r\n  // index assigned to this primitive (for debugging)\r\n  public primitiveToIndex = new Map<CurvePrimitive, number>();\r\n  private _numIndexedPrimitives: number = 0;\r\n  public assignPrimitiveIndex(primitive: CurvePrimitive | undefined) {\r\n    if (primitive !== undefined) {\r\n      const index = this.primitiveToIndex.get(primitive);\r\n      if (index === undefined) {\r\n        this.primitiveToIndex.set(primitive, this._numIndexedPrimitives++);\r\n      }\r\n    }\r\n  }\r\n  public insertPrimitiveToPair(primitive: CurvePrimitive | undefined, pair: CurveLocationDetailPair) {\r\n    if (primitive) {\r\n      const priorPairs = this.primitiveToPair.get(primitive);\r\n      this.assignPrimitiveIndex(primitive);\r\n      if (!priorPairs) {\r\n        this.primitiveToPair.set(primitive, [pair]);\r\n      } else {\r\n        priorPairs.push(pair);\r\n      }\r\n    }\r\n  }\r\n  public insertPair(pair: CurveLocationDetailPair) {\r\n    const primitiveA = pair.detailA.curve;\r\n    if (primitiveA)\r\n      this.insertPrimitiveToPair(primitiveA, pair);\r\n    const primitiveB = pair.detailB.curve;\r\n    if (primitiveB)\r\n      this.insertPrimitiveToPair(primitiveB, pair);\r\n  }\r\n  /**\r\n   * Split closed missing primitives in half and add new intersection pairs.\r\n   * * When bridge edges aren't included in the primitives array, a closed primitive with no intersections will not be\r\n   * added to the graph because it isn't in the `primitiveToPair` map. By splitting such a missing primitive in two, we\r\n   * introduce two intersections for each half, which allows the primitive to be represented in the map.\r\n   */\r\n  public splitAndAppendMissingClosedPrimitives(\r\n    primitives: CurvePrimitive[], tolerance: number = Geometry.smallMetricDistance,\r\n  ): void {\r\n    for (const p of primitives) {\r\n      let closedCurveSplitCandidate = false;\r\n      if (p instanceof Arc3d)\r\n        closedCurveSplitCandidate = p.sweep.isFullCircle;\r\n      else if (!(p instanceof LineSegment3d) && !(p instanceof LineString3d)) // TODO: probably should do this for all types. Lots of spline-type primitives can be closed.\r\n        closedCurveSplitCandidate = p.startPoint().isAlmostEqualXY(p.endPoint(), tolerance);\r\n      if (closedCurveSplitCandidate && !this.primitiveToPair.has(p)) {\r\n        const p0 = p.clonePartialCurve(0.0, 0.5);\r\n        const p1 = p.clonePartialCurve(0.5, 1.0);\r\n        if (p0 && p1) {\r\n          this.insertPair(CurveLocationDetailPair.createCapture(\r\n            CurveLocationDetail.createCurveEvaluatedFraction(p0, 0.0),\r\n            CurveLocationDetail.createCurveEvaluatedFraction(p1, 1.0),\r\n          ));\r\n          this.insertPair(CurveLocationDetailPair.createCapture(\r\n            CurveLocationDetail.createCurveEvaluatedFraction(p0, 1.0),\r\n            CurveLocationDetail.createCurveEvaluatedFraction(p1, 0.0),\r\n          ));\r\n        }\r\n      }\r\n    }\r\n  }\r\n}\r\n\r\n/**\r\n * @internal\r\n */\r\nexport class PlanarSubdivision {\r\n  /**\r\n   * Create a graph from curves and precomputed intersections.\r\n   * * Z-coordinates are ignored.\r\n   * @param primitives input curves\r\n   * @param allPairs array of curve-curve xy-intersections\r\n   * @param mergeTolerance optional distance tolerance for clustering vertices. Default value is [[Geometry.smallMetricDistance]].\r\n   */\r\n  public static assembleHalfEdgeGraph(\r\n    primitives: CurvePrimitive[],\r\n    allPairs: CurveLocationDetailPair[],\r\n    mergeTolerance: number = Geometry.smallMetricDistance,\r\n  ): HalfEdgeGraph {\r\n    // map from key CurvePrimitive to CurveLocationDetailPair\r\n    const detailByPrimitive = new MapCurvePrimitiveToCurveLocationDetailPairArray();\r\n    for (const pair of allPairs)\r\n      detailByPrimitive.insertPair(pair);\r\n    if (primitives.length > detailByPrimitive.primitiveToPair.size) {\r\n      // otherwise, these single-primitive loops are missing from the graph\r\n      detailByPrimitive.splitAndAppendMissingClosedPrimitives(primitives, mergeTolerance);\r\n    }\r\n    const graph = new HalfEdgeGraph();\r\n    for (const entry of detailByPrimitive.primitiveToPair.entries()) {\r\n      const p = entry[0];\r\n      // convert each interval intersection into two isolated intersections\r\n      const details = entry[1].reduce((accumulator: CurveLocationDetailPair[], detailPair) => {\r\n        if (!detailPair.detailA.hasFraction1)\r\n          return [...accumulator, detailPair];\r\n        const detail = getDetailOnCurve(detailPair, p)!;\r\n        const detail0 = CurveLocationDetail.createCurveFractionPoint(p, detail.fraction, detail.point);\r\n        const detail1 = CurveLocationDetail.createCurveFractionPoint(p, detail.fraction1!, detail.point1!);\r\n        return [\r\n          ...accumulator,\r\n          CurveLocationDetailPair.createCapture(detail0, detail0),\r\n          CurveLocationDetailPair.createCapture(detail1, detail1),\r\n        ];\r\n      }, []);\r\n      // lexical sort on p intersection fraction\r\n      details.sort((pairA: CurveLocationDetailPair, pairB: CurveLocationDetailPair) => {\r\n        const fractionA = getFractionOnCurve(pairA, p)!;\r\n        const fractionB = getFractionOnCurve(pairB, p)!;\r\n        return fractionA - fractionB;\r\n      });\r\n      let last = { point: p.startPoint(), fraction: 0.0 };\r\n      for (const detailPair of details) {\r\n        const detail = getDetailOnCurve(detailPair, p)!;\r\n        const detailFraction = Geometry.restrictToInterval(detail.fraction, 0, 1); // truncate fraction, but don't snap point; clustering happens later\r\n        last = this.addHalfEdge(graph, p, last.point, last.fraction, detail.point, detailFraction, mergeTolerance);\r\n      }\r\n      this.addHalfEdge(graph, p, last.point, last.fraction, p.endPoint(), 1.0, mergeTolerance);\r\n    }\r\n    // every edge got its sortAngle defined by addHalfEdge\r\n    HalfEdgeGraphMerge.clusterAndMergeXYTheta(graph, (he: HalfEdge) => he.sortAngle ?? 0, mergeTolerance);\r\n    return graph;\r\n  }\r\n\r\n  /**\r\n   * Filter for trivial curve fragment: fast computation if line segment; otherwise clip, flatten, and measure.\r\n   * * Different metrics are employed for expedience.\r\n  */\r\n  private static isCurveTrivialXY(p: CurvePrimitive, point0: Point3d, fraction0: number, point1: Point3d, fraction1: number, mergeTolerance: number): boolean {\r\n    if (Geometry.isSmallRelative(fraction0 - fraction1))\r\n      return true;\r\n    if (!(p instanceof LineSegment3d)) {\r\n      const p0 = p.clonePartialCurve(fraction0, fraction1);\r\n      if (p0?.tryTransformInPlace(Transform.createRowValues(1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0))) // flatten\r\n        return p0.curveLength() <= mergeTolerance; // Euclidean\r\n    }\r\n    return point0.isAlmostEqualXY(point1, mergeTolerance); // Manhattan\r\n  }\r\n\r\n  /**\r\n   * Create a pair of mated half edges referencing a non-trivial interval of a primitive.\r\n   * @param graph containing graph\r\n   * @param p the curve\r\n   * @param point0 start point\r\n   * @param fraction0 starting fraction\r\n   * @param point1 end point\r\n   * @param fraction1 end fraction\r\n   * @param mergeTolerance optional maximum xy-length of a trivial edge\r\n   * @returns end point and fraction\r\n   */\r\n  private static addHalfEdge(\r\n    graph: HalfEdgeGraph,\r\n    p: CurvePrimitive,\r\n    point0: Point3d,\r\n    fraction0: number,\r\n    point1: Point3d,\r\n    fraction1: number,\r\n    mergeTolerance: number = Geometry.smallMetricDistance,\r\n  ): { point: Point3d, fraction: number } {\r\n    if (!this.isCurveTrivialXY(p, point0, fraction0, point1, fraction1, mergeTolerance)) {\r\n      const halfEdge = graph.createEdgeXYAndZ(point0, 0, point1, 0);\r\n      if (p.parent && p.parent instanceof RegionGroupMember && p.parent.parentGroup.groupOpType === RegionGroupOpType.NonBounding)\r\n        halfEdge.setMaskAroundEdge(HalfEdgeMask.BRIDGE_EDGE);\r\n      const detail01 = CurveLocationDetail.createCurveEvaluatedFractionFraction(p, fraction0, fraction1);\r\n      const mate = halfEdge.edgeMate;\r\n      halfEdge.edgeTag = detail01;\r\n      halfEdge.sortData = 1.0;\r\n      mate.edgeTag = detail01;\r\n      mate.sortData = -1.0;\r\n      halfEdge.sortAngle = computeSortAngle(p, fraction0, false);\r\n      mate.sortAngle = computeSortAngle(p, fraction1, true);\r\n    }\r\n    return { point: point1, fraction: fraction1 }; // where the next curve fragment starts\r\n  }\r\n  /**\r\n   * Based on computed (and toleranced) area, push the loop (pointer) onto the appropriate array of positive, negative,\r\n   * or sliver loops.\r\n   * @param zeroAreaTolerance absolute area tolerance for sliver face detection\r\n   * @param isSliverFace whether the loop is known a priori (e.g., via topology) to have zero area\r\n   * @returns the area (forced to zero if within tolerance)\r\n   */\r\n  public static collectSignedLoop(\r\n    loop: Loop, outLoops: SignedLoops, zeroAreaTolerance: number = 1.0e-10, isSliverFace?: boolean,\r\n  ): number {\r\n    let area = isSliverFace ? 0.0 : RegionOps.computeXYArea(loop);\r\n    if (area === undefined)\r\n      area = 0;\r\n    if (Math.abs(area) < zeroAreaTolerance)\r\n      area = 0.0;\r\n    (loop as any).computedAreaInPlanarSubdivision = area;\r\n    if (area > 0)\r\n      outLoops.positiveAreaLoops.push(loop);\r\n    else if (area < 0)\r\n      outLoops.negativeAreaLoops.push(loop);\r\n    else\r\n      outLoops.slivers.push(loop);\r\n    return area;\r\n  }\r\n  /** Extract geometric info from a topological edge. */\r\n  private static extractGeometryFromEdge(edge: HalfEdge): { detail: CurveLocationDetail, reversed: boolean } | undefined {\r\n    if (edge.sortData !== undefined && edge.edgeTag && edge.edgeTag instanceof CurveLocationDetail) {\r\n      const detail = edge.edgeTag;\r\n      if (detail.curve && detail.fraction1 !== undefined) {\r\n        const reversed = edge.sortData < 0;\r\n        return { detail, reversed };\r\n      }\r\n    }\r\n    return undefined;\r\n  }\r\n  /** Create the geometry for a topological edge. */\r\n  private static createCurveInEdge(edge: HalfEdge, z?: number): CurvePrimitive | undefined {\r\n    let result: CurvePrimitive | undefined;\r\n    const info = this.extractGeometryFromEdge(edge);\r\n    if (info && info.detail.curve && info.detail.fraction1) {\r\n      const f0 = info.reversed ? info.detail.fraction1 : info.detail.fraction;\r\n      const f1 = info.reversed ? info.detail.fraction : info.detail.fraction1;\r\n      result = info.detail.curve.clonePartialCurve(f0, f1);\r\n      if (result && z !== undefined)\r\n        result.tryTransformInPlace(Transform.createRowValues(1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, z));\r\n    }\r\n    return result;\r\n  }\r\n  /**\r\n   * Create a [[Loop]] for the given face or super face.\r\n   * @param face a node in the face loop, or an array of HalfEdges that comprise a loop (e.g., a super face).\r\n   * @param options bundle of options.\r\n   * @returns the Loop, or `undefined` if it is not closed within xy-tolerance.\r\n   */\r\n  public static createLoopInFace(face: HalfEdge | HalfEdge[], options?: PlanarSubdivision.CreateRegionInFaceOptions): Loop | undefined {\r\n    const consolidate = options?.announceEdge ? false : options?.compress ?? false; // can't compress if announcing\r\n    const loop = Loop.create();\r\n    const addEdgeCurve = (edge: HalfEdge): void => {\r\n      const curve = this.createCurveInEdge(edge, options?.z);\r\n      if (curve) {\r\n        options?.announceEdge?.(edge, curve, loop);\r\n        loop.tryAddChild(curve);\r\n      }\r\n    };\r\n    if (Array.isArray(face))\r\n      face.forEach(addEdgeCurve);\r\n    else\r\n      face.announceEdgesInFace(addEdgeCurve);\r\n    if (consolidate) {\r\n      const consolidateOptions = new ConsolidateAdjacentCurvePrimitivesOptions();\r\n      consolidateOptions.consolidateLoopSeam = true;\r\n      RegionOps.consolidateAdjacentPrimitives(loop, consolidateOptions);\r\n    }\r\n    if (loop.isPhysicallyClosedCurve(options?.closureTol, true))\r\n      return loop;\r\n    assert(() => false, \"face is not physically closed\");\r\n    return undefined;\r\n  }\r\n  /**\r\n   * Create a [[Loop]] or [[ParityRegion]] for the given face.\r\n   * * A ParityRegion is created for a split-washer type face by removing bridge edges.\r\n   * @param face a node in the face loop.\r\n   * @param options bundle of options.\r\n   * @returns the Loop or ParityRegion, or `undefined` if one could not be computed.\r\n   */\r\n  public static createLoopOrParityRegionInFace(face: HalfEdge, options?: PlanarSubdivision.CreateRegionInFaceOptions): Loop | ParityRegion | undefined {\r\n    let region: AnyRegion | undefined;\r\n    const visitMask = options?.visitMask ?? HalfEdgeMask.VISITED;\r\n    const bridgeMask = options?.bridgeMask ?? HalfEdgeMask.BRIDGE_EDGE;\r\n    let startBridgeEdge: HalfEdge | undefined;\r\n    // is it a split-washer face?\r\n    if (face.isSplitWasherFace(bridgeMask) && (startBridgeEdge = face.findMaskAroundFace(bridgeMask, true))) {\r\n      const loops: Loop[] = [];\r\n      const loopEdges: HalfEdge[] = [];\r\n      const bridgeStack: HalfEdge[] = [startBridgeEdge];\r\n      const announceEdge = (he: HalfEdge) => { he.setMask(visitMask); loopEdges.push(he); };\r\n      const announceBridge = (he: HalfEdge) => { if (!he.isMaskSet(visitMask)) bridgeStack.push(he); };\r\n      face.clearMaskAroundFace(visitMask);\r\n      let bridge: HalfEdge | undefined;\r\n      while (undefined !== (bridge = bridgeStack.pop())) {\r\n        bridge.setMask(visitMask);\r\n        const loopSeed = bridge.findMaskAroundFace(bridgeMask, false); // advance to next loop\r\n        if (loopSeed) {\r\n          if (loopSeed.isMaskSet(visitMask))\r\n            continue;\r\n          loopEdges.length = 0;\r\n          if (loopSeed.announceEdgesInSuperFace(bridgeMask, announceEdge, announceBridge)) {\r\n            const loop = this.createLoopInFace(loopEdges, options);\r\n            if (loop) {\r\n              loops.push(loop);\r\n              continue;\r\n            }\r\n          }\r\n        }\r\n      }\r\n      region = RegionOps.sortOuterAndHoleLoopsXY(loops);\r\n      region = RegionOps.simplifyRegion(region);\r\n    } else {\r\n      region = this.createLoopInFace(face, options);\r\n    }\r\n    return (region && (region instanceof Loop || region instanceof ParityRegion)) ? region : undefined;\r\n  }\r\n  /** Return true if there are only two edges in the face loop, and their start curvatures are the same. */\r\n  private static isNullFace(he: HalfEdge): boolean {\r\n    const faceHasTwoEdges = (he.faceSuccessor.faceSuccessor === he);\r\n    let faceIsBanana = false;\r\n    if (faceHasTwoEdges) {\r\n      const c0 = HalfEdgeGraphMerge.curvatureSortKey(he);\r\n      const c1 = HalfEdgeGraphMerge.curvatureSortKey(he.faceSuccessor.edgeMate);\r\n      if (!Geometry.isSameCoordinate(c0, c1)) // default tol!\r\n        faceIsBanana = true;  // heuristic: we could also check end curvatures, and/or higher derivatives...\r\n    }\r\n    return faceHasTwoEdges && !faceIsBanana;\r\n  }\r\n  /** Look across edge mates (possibly several) for a non-null mate face. */\r\n  private static getNonNullEdgeMate(_graph: HalfEdgeGraph, e: HalfEdge): HalfEdge | undefined {\r\n    if (this.isNullFace(e))\r\n      return undefined;\r\n    let e1 = e.edgeMate;\r\n    while (this.isNullFace(e1)) {\r\n      e1 = e1.faceSuccessor.edgeMate;\r\n      if (e1 === e)\r\n        return undefined;\r\n    }\r\n    return e1;\r\n  }\r\n  public static collectSignedLoopSetsInHalfEdgeGraph(graph: HalfEdgeGraph, zeroAreaTolerance: number = 1.0e-10): SignedLoops[] {\r\n    const q = HalfEdgeGraphSearch.collectConnectedComponentsWithExteriorParityMasks(graph, undefined);\r\n    const result: SignedLoops[] = [];\r\n    const edgeMap = new Map<HalfEdge, LoopCurveLoopCurve>();\r\n    for (const faceSeeds of q) {\r\n      const componentAreas: SignedLoops = { positiveAreaLoops: [], negativeAreaLoops: [], slivers: [] };\r\n      const edges: LoopCurveLoopCurve[] = [];\r\n      for (const faceSeed of faceSeeds) {\r\n        const isNullFace = this.isNullFace(faceSeed);\r\n        const announceEdge = isNullFace ? undefined : (he: HalfEdge, curveC: CurvePrimitive, loopC: Loop) => {\r\n          const mate = this.getNonNullEdgeMate(graph, he);\r\n          if (mate !== undefined) {\r\n            const e = edgeMap.get(mate);\r\n            if (e === undefined) {\r\n              // Record this as loopA,edgeA of a shared edge to be completed later from the other side of the edge\r\n              const e1 = new LoopCurveLoopCurve(loopC, curveC, undefined, undefined);\r\n              edgeMap.set(he, e1);\r\n            } else if (e instanceof LoopCurveLoopCurve) {\r\n              e.setB(loopC, curveC);\r\n              edges.push(e);\r\n              edgeMap.delete(mate);\r\n            }\r\n          }\r\n        };\r\n        const loop = this.createLoopInFace(faceSeed, { announceEdge });\r\n        if (loop)\r\n          this.collectSignedLoop(loop, componentAreas, zeroAreaTolerance, isNullFace);\r\n      }\r\n      componentAreas.edges = edges;\r\n      result.push(componentAreas);\r\n      edgeMap.clear();\r\n    }\r\n    return result;\r\n  }\r\n}\r\n\r\n/**\r\n * @internal\r\n*/\r\nexport namespace PlanarSubdivision {\r\n  /** Options bundle for [[PlanarSubdivision.createLoopInFace]] and [[PlanarSubdivision.createLoopOrParityRegionInFace]]. */\r\n  export interface CreateRegionInFaceOptions {\r\n    /**\r\n     * Optional callback invoked on each `edge` before its `curve` is added to `loop`.\r\n     * * Note that if a [[ParityRegion]] is being constructed, `curve` and `loop` may subsequently be reversed.\r\n     */\r\n    announceEdge?: (edge: HalfEdge, curve: CurvePrimitive, loop: Loop) => void;\r\n    /**\r\n     * Whether to consolidate adjacent curves in an output [[Loop]]. Default value is `false`.\r\n     * * If `announce` is defined, no compression is performed, as edges and curves would no longer be in 1-1 correspondence.\r\n     */\r\n    compress?: boolean;\r\n    /** Absolute xy-distance for confirming a returned Loop is closed. Default value is [[Geometry.smallMetricDistance]]. */\r\n    closureTol?: number;\r\n    /**\r\n     * Mask preset on bridge edges. Default value is `HalfEdgeMask.BRIDGE_EDGE`.\r\n     * * This mask is used to distinguish a split-washer type face, which can result in a [[ParityRegion]].\r\n     */\r\n    bridgeMask?: HalfEdgeMask;\r\n    /** Mask to use for visiting edges when creating a [[ParityRegion]] from a split-washer type face. Default value is `HalfEdgeMask.VISITED`. */\r\n    visitMask?: HalfEdgeMask;\r\n    /**\r\n     * Optional z-coordinate for the result region.\r\n     * * If undefined, graph z-coordinates are used, but this may result in a non-planar region if the graph is not planar!\r\n     */\r\n    z?: number;\r\n  }\r\n}"]}