@itwin/core-geometry 3.0.0-dev.76 → 3.0.0-dev.80

package/lib/esm/topology/Merging.js

@@ -0,0 +1,362 @@
+/*---------------------------------------------------------------------------------------------
+* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+* See LICENSE.md in the project root for license terms and full copyright notice.
+*--------------------------------------------------------------------------------------------*/
+import { Geometry } from "../Geometry";
+import { Angle } from "../geometry3d/Angle";
+import { Point2d, Vector2d } from "../geometry3d/Point2dVector2d";
+import { Range3d } from "../geometry3d/Range";
+import { ClusterableArray } from "../numerics/ClusterableArray";
+import { SmallSystem } from "../numerics/Polynomials";
+import { HalfEdge, HalfEdgeGraph, HalfEdgeMask } from "./Graph";
+import { HalfEdgePriorityQueueWithPartnerArray } from "./HalfEdgePriorityQueue";
+import { RegularizationContext } from "./RegularizeFace";
+import { Triangulator } from "./Triangulation";
+export class GraphSplitData {
+    constructor() {
+        this.numUpEdge = 0;
+        this.numIntersectionTest = 0;
+        this.numSplit = 0;
+        this.numPopOut = 0;
+        this.numA0B0 = 0;
+        this.numA0B1 = 0;
+    }
+}
+/**
+ * * Assorted methods used in algorithms on HalfEdgeGraph.
+ * @internal
+ */
+export class HalfEdgeGraphOps {
+    /** Compare function for sorting with primary y compare, secondary  x compare. */
+    static compareNodesYXUp(a, b) {
+        // Check y's
+        // if (!Geometry.isSameCoordinate(a.y, b.y))
+        if (a.y < b.y)
+            return -1;
+        else if (a.y > b.y)
+            return 1;
+        // Check x's
+        // if (!Geometry.isSameCoordinate(a.x, b.x))
+        if (a.x < b.x)
+            return -1;
+        else if (a.x > b.x)
+            return 1;
+        return 0;
+    }
+    /** Return true if nodeB (a) is lower than both its neighbors and (b) inflects as a downward peak (rather than an upward trough) */
+    static isDownPeak(nodeB) {
+        const nodeA = nodeB.facePredecessor;
+        const nodeC = nodeB.faceSuccessor;
+        return this.compareNodesYXUp(nodeB, nodeA) < 0
+            && this.compareNodesYXUp(nodeB, nodeC) < 0
+            && this.crossProductToTargets(nodeB, nodeA, nodeC) > 0;
+    }
+    /** return the cross product of vectors from base to targetA and base to targetB
+     * @param base base vertex of both vectors.
+     * @param targetA target vertex of first vector
+     * @param targetB target vertex of second vector
+     */
+    static crossProductToTargets(base, targetA, targetB) {
+        return Geometry.crossProductXYXY(targetA.x - base.x, targetA.y - base.y, targetB.x - base.x, targetB.y - base.y);
+    }
+    // ---------------------------------------------------------------------------------------------------------------------
+    // ----------------------------------------------------------------------------------------------------------------------
+    static graphRange(graph) {
+        const range = Range3d.create();
+        for (const node of graph.allHalfEdges) {
+            range.extendXYZ(node.x, node.y, node.z);
+        }
+        return range;
+    }
+    /** Returns an array of a all nodes (both ends) of edges created from segments. */
+    static segmentArrayToGraphEdges(segments, returnGraph, mask) {
+        const result = [];
+        let idxCounter = 0;
+        // Push the endpoints of each segment onto arr[] in the form {(x, y, theta), Node}
+        for (const segment of segments) {
+            const node0 = returnGraph.createEdgeXYZXYZ(segment.point0Ref.x, segment.point0Ref.y, segment.point0Ref.z, idxCounter, segment.point1Ref.x, segment.point1Ref.y, segment.point1Ref.z, idxCounter + 1);
+            const node1 = node0.edgeMate;
+            idxCounter += 2;
+            node0.setMaskAroundFace(mask); // Original given coordinates must be part of boundary
+            result.push(node0);
+            result.push(node1);
+        }
+        return result;
+    }
+    /**
+     * * For each face with positive area . . . add edges as needed so that each face has one definitely lower node and one definite upper node.
+     * * Hence tracing edges from the low node, there is a sequence of upward edges, reaching the upper,  then a sequence of downward edges reaching the low node.
+     * * This is an essential step for subsequent triangulation.
+     *
+     * @param graph
+     */
+    static formMonotoneFaces(graph) {
+        const allFaces = graph.collectFaceLoops();
+        graph.clearMask(HalfEdgeMask.VISITED);
+        // For every face, break the face down into monotone sections
+        for (const node of allFaces) {
+            if (node.isMaskSet(HalfEdgeMask.VISITED))
+                continue;
+            const area = node.signedFaceArea();
+            if (area <= 0.0) {
+                node.setMaskAroundFace(HalfEdgeMask.VISITED);
+                continue;
+            }
+        }
+    }
+    /**
+     * * Visit all nodes in `graph`.
+     * * invoke `pinch(node, vertexPredecessor)`
+     * * this leaves the graph as isolated edges.
+     * @param graph graph to modify
+     */
+    static isolateAllEdges(graph) {
+        for (const nodeA of graph.allHalfEdges) {
+            const nodeB = nodeA.vertexPredecessor;
+            HalfEdge.pinch(nodeA, nodeB);
+        }
+    }
+}
+/**
+ * @internal
+ */
+export class HalfEdgeGraphMerge {
+    /** Simplest merge algorithm:
+     * * collect array of (x,y,theta) at all nodes
+     * * lexical sort of the array.
+     * * twist all vertices together.
+     * * This effectively creates valid face loops for a planar subdivision if there are no edge crossings.
+     * * If there are edge crossings, the graph can be a (highly complicated) Klein bottle topology.
+     * * Mask.NULL_FACE is cleared throughout and applied within null faces.
+     */
+    static clusterAndMergeXYTheta(graph, outboundRadiansFunction) {
+        const allNodes = graph.allHalfEdges;
+        const numNodes = allNodes.length;
+        graph.clearMask(HalfEdgeMask.NULL_FACE);
+        const clusters = new ClusterableArray(2, 2, numNodes); // data order: x,y,theta, nodeIndex.  But theta is not set in first round.
+        for (let i = 0; i < numNodes; i++) {
+            const nodeA = allNodes[i];
+            const xA = nodeA.x;
+            const yA = nodeA.y;
+            HalfEdge.pinch(nodeA, nodeA.vertexSuccessor); // pull it out of its current vertex loop.
+            clusters.addDirect(xA, yA, 0.0, i);
+        }
+        const order = clusters.clusterIndicesLexical();
+        let k0 = 0;
+        const numK = order.length;
+        for (let k1 = 0; k1 < numK; k1++) {
+            if (order[k1] === ClusterableArray.clusterTerminator) {
+                // nodes identified in order[k0]..order[k1] are properly sorted around a vertex.
+                if (k1 > k0) {
+                    const iA = clusters.getExtraData(order[k0], 1);
+                    const nodeA0 = allNodes[iA];
+                    for (let k = k0 + 1; k < k1; k++) {
+                        const iB = clusters.getExtraData(order[k], 1);
+                        const nodeB = allNodes[iB];
+                        nodeB.x = nodeA0.x;
+                        nodeB.y = nodeA0.y;
+                    }
+                }
+                k0 = k1 + 1;
+            }
+        }
+        // NOW
+        //  1) There are identical coordinates at all nodes around each vertex loop.
+        //  2) Hence ready do sort (at each vertex) by theta.
+        // insert theta as extra data in the sort table . . .
+        for (const clusterTableIndex of order) {
+            if (clusterTableIndex !== ClusterableArray.clusterTerminator) {
+                const nodeA = allNodes[clusterTableIndex];
+                const nodeB = nodeA.faceSuccessor;
+                let radians = outboundRadiansFunction ? outboundRadiansFunction(nodeA) : Math.atan2(nodeB.y - nodeA.y, nodeB.x - nodeA.x);
+                if (Angle.isAlmostEqualRadiansAllowPeriodShift(radians, -Math.PI))
+                    radians = Math.PI;
+                clusters.setExtraData(clusterTableIndex, 0, radians);
+            }
+        }
+        clusters.sortSubsetsBySingleKey(order, 2);
+        const unmatchedNullFaceNodes = [];
+        k0 = 0;
+        let thetaA, thetaB;
+        // now pinch each neighboring pair together
+        for (let k1 = 0; k1 < numK; k1++) {
+            if (order[k1] === ClusterableArray.clusterTerminator) {
+                // nodes identified in order[k0]..order[k1] are properly sorted around a vertex.
+                if (k1 > k0) {
+                    const iA = clusters.getExtraData(order[k0], 1);
+                    thetaA = clusters.getExtraData(order[k0], 0);
+                    const nodeA0 = allNodes[iA];
+                    let nodeA = nodeA0;
+                    for (let k = k0 + 1; k < k1; k++) {
+                        const iB = clusters.getExtraData(order[k], 1);
+                        thetaB = clusters.getExtraData(order[k], 0);
+                        const nodeB = allNodes[iB];
+                        if (nodeA.isMaskSet(HalfEdgeMask.NULL_FACE)) {
+                            // nope, this edge was flagged and pinched from the other end.
+                            const j = unmatchedNullFaceNodes.findIndex((node) => nodeA === node);
+                            if (j >= 0) {
+                                unmatchedNullFaceNodes[j] = unmatchedNullFaceNodes[unmatchedNullFaceNodes.length - 1];
+                                unmatchedNullFaceNodes.pop();
+                            }
+                            nodeA = nodeB;
+                            thetaA = thetaB;
+                        }
+                        else if (nodeB.isMaskSet(HalfEdgeMask.NULL_FACE)) {
+                            const j = unmatchedNullFaceNodes.findIndex((node) => nodeA === node);
+                            if (j >= 0) {
+                                unmatchedNullFaceNodes[j] = unmatchedNullFaceNodes[unmatchedNullFaceNodes.length - 1];
+                                unmatchedNullFaceNodes.pop();
+                            }
+                            // NO leave nodeA and thetaA   ignore nodeB -- later step will get the outside of its banana.
+                        }
+                        else {
+                            HalfEdge.pinch(nodeA, nodeB);
+                            if (Angle.isAlmostEqualRadiansAllowPeriodShift(thetaA, thetaB)) {
+                                const nodeA1 = nodeA.faceSuccessor;
+                                const nodeB1 = nodeB.edgeMate;
+                                // WE TRUST -- nodeA1 and node B1 must have identical xy.
+                                // pinch them together and mark the face loop as null ..
+                                HalfEdge.pinch(nodeA1, nodeB1);
+                                nodeA.setMask(HalfEdgeMask.NULL_FACE);
+                                nodeB1.setMask(HalfEdgeMask.NULL_FACE);
+                                unmatchedNullFaceNodes.push(nodeB1);
+                            }
+                            nodeA = nodeB;
+                            thetaA = thetaB;
+                        }
+                    }
+                }
+                k0 = k1 + 1;
+            }
+        }
+    }
+    static buildVerticalSweepPriorityQueue(graph) {
+        const sweepHeap = new HalfEdgePriorityQueueWithPartnerArray();
+        for (const p of graph.allHalfEdges) {
+            if (HalfEdgeGraphOps.compareNodesYXUp(p, p.faceSuccessor) < 0) {
+                sweepHeap.priorityQueue.push(p);
+            }
+        }
+        return sweepHeap;
+    }
+    static snapFractionToNode(xy, fraction, node, nodeFraction) {
+        if (Geometry.isSameCoordinate(xy.x, node.x) && Geometry.isSameCoordinate(xy.y, node.y))
+            return nodeFraction;
+        return fraction;
+    }
+    static computeIntersectionFractionsOnEdges(nodeA0, nodeB0, fractions, pointA, pointB) {
+        const nodeA1 = nodeA0.faceSuccessor;
+        const ax0 = nodeA0.x;
+        const ay0 = nodeA0.y;
+        const ux = nodeA1.x - ax0;
+        const uy = nodeA1.y - ay0;
+        const nodeB1 = nodeB0.faceSuccessor;
+        const bx0 = nodeB0.x;
+        const by0 = nodeB0.y;
+        const vx = nodeB1.x - bx0;
+        const vy = nodeB1.y - by0;
+        if (SmallSystem.lineSegmentXYUVTransverseIntersectionUnbounded(ax0, ay0, ux, uy, bx0, by0, vx, vy, fractions)) {
+            pointA.x = ax0 + fractions.x * ux;
+            pointA.y = ay0 + fractions.x * uy;
+            pointB.x = bx0 + fractions.y * vx;
+            pointB.y = by0 + fractions.y * vy;
+            fractions.x = this.snapFractionToNode(pointA, fractions.x, nodeA0, 0.0);
+            fractions.x = this.snapFractionToNode(pointA, fractions.x, nodeA1, 1.0);
+            fractions.y = this.snapFractionToNode(pointB, fractions.y, nodeB0, 0.0);
+            fractions.y = this.snapFractionToNode(pointB, fractions.y, nodeB1, 1.0);
+            return Geometry.isIn01(fractions.x) && Geometry.isIn01(fractions.y);
+        }
+        return false;
+    }
+    /**
+     * Split edges at intersections.
+     * * This is a large operation.
+     * @param graph
+     */
+    static splitIntersectingEdges(graph) {
+        const data = new GraphSplitData();
+        const sweepHeap = this.buildVerticalSweepPriorityQueue(graph);
+        let nodeA0, nodeB1;
+        const smallFraction = 1.0e-8;
+        const largeFraction = 1.0 - smallFraction;
+        let i;
+        const fractions = Vector2d.create();
+        const pointA = Point2d.create();
+        const pointB = Point2d.create();
+        let nodeB0;
+        const popTolerance = Geometry.smallMetricDistance;
+        while (undefined !== (nodeA0 = sweepHeap.priorityQueue.pop())) {
+            data.numUpEdge++;
+            const n0 = sweepHeap.activeEdges.length;
+            sweepHeap.removeArrayMembersWithY1Below(nodeA0.y - popTolerance);
+            data.numPopOut += n0 - sweepHeap.activeEdges.length;
+            for (i = 0; i < sweepHeap.activeEdges.length; i++) {
+                nodeB0 = sweepHeap.activeEdges[i];
+                nodeB1 = nodeB0.faceSuccessor;
+                // const nodeB1 = nodeB0.faceSuccessor;
+                if (Geometry.isSameCoordinateXY(nodeA0.x, nodeA0.y, nodeB0.x, nodeB0.y)) {
+                    data.numA0B0++;
+                }
+                else if (Geometry.isSameCoordinateXY(nodeB1.x, nodeB1.y, nodeA0.x, nodeA0.y)) {
+                    data.numA0B1++;
+                }
+                else {
+                    data.numIntersectionTest++;
+                    if (this.computeIntersectionFractionsOnEdges(nodeA0, nodeB0, fractions, pointA, pointB)) {
+                        if (fractions.x > smallFraction && fractions.x < largeFraction) {
+                            const nodeC0 = graph.splitEdgeAtFraction(nodeA0, fractions.x);
+                            sweepHeap.priorityQueue.push(nodeC0); // The upper portion will be reviewed as a nodeA0 later !!!
+                            data.numSplit++;
+                        }
+                        if (fractions.y > smallFraction && fractions.y < largeFraction) {
+                            const nodeD0 = graph.splitEdgeAtFraction(nodeB0, fractions.y);
+                            sweepHeap.priorityQueue.push(nodeD0); // The upper portion will be reviewed as a nodeA0 later !!!
+                            data.numSplit++;
+                        }
+                        // existing nodeA0 and its shortened edge remain for further intersections
+                    }
+                }
+            }
+            sweepHeap.activeEdges.push(nodeA0);
+        }
+        return data;
+    }
+    /**
+     * Returns a graph structure formed from the given LineSegment array
+     *
+     * *  Find all intersections among segments, and split them if necessary
+     * *  Record endpoints of every segment in the form X, Y, Theta; This information is stored as a new node and sorted to match up
+     *      vertices.
+     * *  For vertices that match up, pinch the nodes to create vertex loops, which in closed objects, will also eventually form face
+     *      loops
+     */
+    static formGraphFromSegments(lineSegments) {
+        // Structure of an index of the array: { xyTheta: Point3d, node: Node }
+        const graph = new HalfEdgeGraph();
+        HalfEdgeGraphOps.segmentArrayToGraphEdges(lineSegments, graph, HalfEdgeMask.BOUNDARY_EDGE);
+        this.splitIntersectingEdges(graph);
+        this.clusterAndMergeXYTheta(graph);
+        return graph;
+    }
+    /**
+     * * Input is random linestrings, not necessarily loops
+     * * Graph gets full splitEdges, regularize, and triangulate.
+     * @returns triangulated graph, or undefined if bad data.
+     */
+    static formGraphFromChains(chains, regularize = true, mask = HalfEdgeMask.PRIMARY_EDGE) {
+        if (chains.length < 1)
+            return undefined;
+        const graph = new HalfEdgeGraph();
+        const chainSeeds = Triangulator.directCreateChainsFromCoordinates(graph, chains);
+        for (const seed of chainSeeds)
+            seed.setMaskAroundFace(mask);
+        this.splitIntersectingEdges(graph);
+        this.clusterAndMergeXYTheta(graph);
+        if (regularize) {
+            const context = new RegularizationContext(graph);
+            context.regularizeGraph(true, true);
+        }
+        return graph;
+    }
+}
+//# sourceMappingURL=Merging.js.map

package/lib/esm/topology/Merging.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Merging.js","sourceRoot":"","sources":["../../../src/topology/Merging.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAO/F,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AACvC,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAC5C,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAClE,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AAC9C,OAAO,EAAE,gBAAgB,EAAE,MAAM,8BAA8B,CAAC;AAChE,OAAO,EAAE,WAAW,EAAE,MAAM,yBAAyB,CAAC;AACtD,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AAChE,OAAO,EAAE,qCAAqC,EAAE,MAAM,yBAAyB,CAAC;AAChF,OAAO,EAAE,qBAAqB,EAAE,MAAM,kBAAkB,CAAC;AACzD,OAAO,EAA8B,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAE3E,MAAM,OAAO,cAAc;IAOzB;QANO,cAAS,GAAG,CAAC,CAAC;QACd,wBAAmB,GAAG,CAAC,CAAC;QACxB,aAAQ,GAAG,CAAC,CAAC;QACb,cAAS,GAAG,CAAC,CAAC;QACd,YAAO,GAAG,CAAC,CAAC;QACZ,YAAO,GAAG,CAAC,CAAC;IAEnB,CAAC;CACF;AAED;;;GAGG;AACH,MAAM,OAAO,gBAAgB;IAE3B,iFAAiF;IAC1E,MAAM,CAAC,gBAAgB,CAAC,CAAW,EAAE,CAAW;QACrD,YAAY;QACZ,4CAA4C;QAC5C,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACX,OAAO,CAAC,CAAC,CAAC;aACP,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAChB,OAAO,CAAC,CAAC;QACX,YAAY;QACZ,4CAA4C;QAC5C,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACX,OAAO,CAAC,CAAC,CAAC;aACP,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAChB,OAAO,CAAC,CAAC;QACX,OAAO,CAAC,CAAC;IACX,CAAC;IAED,mIAAmI;IAC5H,MAAM,CAAC,UAAU,CAAC,KAAe;QACtC,MAAM,KAAK,GAAG,KAAK,CAAC,eAAe,CAAC;QACpC,MAAM,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;QAClC,OAAO,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC;eACzC,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC;eACvC,IAAI,CAAC,qBAAqB,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;IAC3D,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,qBAAqB,CAAC,IAAc,EAAE,OAAiB,EAAE,OAAiB;QACtF,OAAO,QAAQ,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IACnH,CAAC;IAED,wHAAwH;IACxH,yHAAyH;IAElH,MAAM,CAAC,UAAU,CAAC,KAAoB;QAC3C,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;QAC/B,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,YAAY,EAAE;YACrC,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;SACzC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,kFAAkF;IAC3E,MAAM,CAAC,wBAAwB,CAAC,QAAyB,EAAE,WAA0B,EAAE,IAAkB;QAC9G,MAAM,MAAM,GAAG,EAAE,CAAC;QAClB,IAAI,UAAU,GAAG,CAAC,CAAC;QAEnB,kFAAkF;QAClF,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE;YAE9B,MAAM,KAAK,GAAG,WAAW,CAAC,gBAAgB,CACxC,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC,EAC7D,UAAU,EACV,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC,EAC7D,UAAU,GAAG,CAAC,CAAC,CAAC;YAElB,MAAM,KAAK,GAAG,KAAK,CAAC,QAAQ,CAAC;YAC7B,UAAU,IAAI,CAAC,CAAC;YAEhB,KAAK,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAG,sDAAsD;YACvF,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACnB,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;SACpB;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;;OAMG;IACI,MAAM,CAAC,iBAAiB,CAAC,KAAoB;QAElD,MAAM,QAAQ,GAAG,KAAK,CAAC,gBAAgB,EAAE,CAAC;QAC1C,KAAK,CAAC,SAAS,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC;QACtC,6DAA6D;QAC7D,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE;YAC3B,IAAI,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,OAAO,CAAC;gBACtC,SAAS;YACX,MAAM,IAAI,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;YACnC,IAAI,IAAI,IAAI,GAAG,EAAE;gBACf,IAAI,CAAC,iBAAiB,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC;gBAC7C,SAAS;aACV;SAEF;IACH,CAAC;IAED;;;;;OAKG;IACI,MAAM,CAAC,eAAe,CAAC,KAAoB;QAChD,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,YAAY,EAAE;YACtC,MAAM,KAAK,GAAG,KAAK,CAAC,iBAAiB,CAAC;YACtC,QAAQ,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;SAC9B;IACH,CAAC;CAEF;AACD;;GAEG;AACH,MAAM,OAAO,kBAAkB;IAC7B;;;;;;;OAOG;IACI,MAAM,CAAC,sBAAsB,CAAC,KAAoB,EAAE,uBAAkD;QAC3G,MAAM,QAAQ,GAAG,KAAK,CAAC,YAAY,CAAC;QACpC,MAAM,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC;QACjC,KAAK,CAAC,SAAS,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC;QACxC,MAAM,QAAQ,GAAG,IAAI,gBAAgB,CAAC,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAE,0EAA0E;QAClI,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE;YACjC,MAAM,KAAK,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC1B,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC;YACnB,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC;YACnB,QAAQ,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,eAAe,CAAC,CAAC,CAAE,0CAA0C;YACzF,QAAQ,CAAC,SAAS,CAAC,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;SACpC;QACD,MAAM,KAAK,GAAG,QAAQ,CAAC,qBAAqB,EAAE,CAAC;QAC/C,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,MAAM,IAAI,GAAG,KAAK,CAAC,MAAM,CAAC;QAC1B,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,IAAI,EAAE,EAAE,EAAE,EAAE;YAChC,IAAI,KAAK,CAAC,EAAE,CAAC,KAAK,gBAAgB,CAAC,iBAAiB,EAAE;gBACpD,gFAAgF;gBAChF,IAAI,EAAE,GAAG,EAAE,EAAE;oBACX,MAAM,EAAE,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;oBAC/C,MAAM,MAAM,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC;oBAC5B,KAAK,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE;wBAChC,MAAM,EAAE,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;wBAC9C,MAAM,KAAK,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC;wBAC3B,KAAK,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;wBACnB,KAAK,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;qBACpB;iBACF;gBACD,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;aACb;SACF;QACD,MAAM;QACN,4EAA4E;QAC5E,qDAAqD;QAErD,qDAAqD;QACrD,KAAK,MAAM,iBAAiB,IAAI,KAAK,EAAE;YACrC,IAAI,iBAAiB,KAAK,gBAAgB,CAAC,iBAAiB,EAAE;gBAC5D,MAAM,KAAK,GAAG,QAAQ,CAAC,iBAAiB,CAAC,CAAC;gBAC1C,MAAM,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;gBAClC,IAAI,OAAO,GAAG,uBAAuB,CAAC,CAAC,CAAC,uBAAuB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;gBAC1H,IAAI,KAAK,CAAC,oCAAoC,CAAC,OAAO,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;oBAC/D,OAAO,GAAG,IAAI,CAAC,EAAE,CAAC;gBACpB,QAAQ,CAAC,YAAY,CAAC,iBAAiB,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC;aACtD;SACF;QACD,QAAQ,CAAC,sBAAsB,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAC1C,MAAM,sBAAsB,GAAe,EAAE,CAAC;QAC9C,EAAE,GAAG,CAAC,CAAC;QACP,IAAI,MAAM,EAAE,MAAM,CAAC;QACnB,2CAA2C;QAC3C,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,IAAI,EAAE,EAAE,EAAE,EAAE;YAChC,IAAI,KAAK,CAAC,EAAE,CAAC,KAAK,gBAAgB,CAAC,iBAAiB,EAAE;gBACpD,gFAAgF;gBAChF,IAAI,EAAE,GAAG,EAAE,EAAE;oBACX,MAAM,EAAE,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;oBAC/C,MAAM,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;oBAC7C,MAAM,MAAM,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC;oBAC5B,IAAI,KAAK,GAAG,MAAM,CAAC;oBACnB,KAAK,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE;wBAChC,MAAM,EAAE,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;wBAC9C,MAAM,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;wBAC5C,MAAM,KAAK,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC;wBAC3B,IAAI,KAAK,CAAC,SAAS,CAAC,YAAY,CAAC,SAAS,CAAC,EAAE;4BAC3C,8DAA8D;4BAC9D,MAAM,CAAC,GAAG,sBAAsB,CAAC,SAAS,CAAC,CAAC,IAAc,EAAE,EAAE,CAAC,KAAK,KAAK,IAAI,CAAC,CAAC;4BAC/E,IAAI,CAAC,IAAI,CAAC,EAAE;gCACV,sBAAsB,CAAC,CAAC,CAAC,GAAG,sBAAsB,CAAC,sBAAsB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;gCACtF,sBAAsB,CAAC,GAAG,EAAE,CAAC;6BAC9B;4BACD,KAAK,GAAG,KAAK,CAAC;4BACd,MAAM,GAAG,MAAM,CAAC;yBACjB;6BAAM,IAAI,KAAK,CAAC,SAAS,CAAC,YAAY,CAAC,SAAS,CAAC,EAAE;4BAClD,MAAM,CAAC,GAAG,sBAAsB,CAAC,SAAS,CAAC,CAAC,IAAc,EAAE,EAAE,CAAC,KAAK,KAAK,IAAI,CAAC,CAAC;4BAC/E,IAAI,CAAC,IAAI,CAAC,EAAE;gCACV,sBAAsB,CAAC,CAAC,CAAC,GAAG,sBAAsB,CAAC,sBAAsB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;gCACtF,sBAAsB,CAAC,GAAG,EAAE,CAAC;6BAC9B;4BACD,6FAA6F;yBAC9F;6BAAM;4BACL,QAAQ,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;4BAC7B,IAAI,KAAK,CAAC,oCAAoC,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE;gCAC9D,MAAM,MAAM,GAAG,KAAK,CAAC,aAAa,CAAC;gCACnC,MAAM,MAAM,GAAG,KAAK,CAAC,QAAQ,CAAC;gCAC9B,yDAAyD;gCACzD,wDAAwD;gCACxD,QAAQ,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;gCAC/B,KAAK,CAAC,OAAO,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC;gCACtC,MAAM,CAAC,OAAO,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC;gCACvC,sBAAsB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;6BACrC;4BACD,KAAK,GAAG,KAAK,CAAC;4BACd,MAAM,GAAG,MAAM,CAAC;yBACjB;qBACF;iBACF;gBACD,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;aACb;SACF;IACH,CAAC;IAEO,MAAM,CAAC,+BAA+B,CAAC,KAAoB;QACjE,MAAM,SAAS,GAAG,IAAI,qCAAqC,EAAE,CAAC;QAC9D,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,YAAY,EAAE;YAElC,IAAI,gBAAgB,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,aAAa,CAAC,GAAG,CAAC,EAAE;gBAC7D,SAAS,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;aACjC;SACF;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACO,MAAM,CAAC,kBAAkB,CAAC,EAAW,EAAE,QAAgB,EAAE,IAAc,EAAE,YAAoB;QACnG,IAAI,QAAQ,CAAC,gBAAgB,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,QAAQ,CAAC,gBAAgB,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;YACpF,OAAO,YAAY,CAAC;QACtB,OAAO,QAAQ,CAAC;IACpB,CAAC;IACS,MAAM,CAAC,mCAAmC,CAAC,MAAgB,EAAE,MAAgB,EAAE,SAAmB,EAAE,MAAe,EAAE,MAAe;QAC1I,MAAM,MAAM,GAAG,MAAM,CAAC,aAAa,CAAC;QACpC,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC;QACrB,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC;QACrB,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC;QAC1B,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC;QAC1B,MAAM,MAAM,GAAG,MAAM,CAAC,aAAa,CAAC;QACpC,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC;QACrB,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC;QACrB,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC;QAC1B,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,GAAG,GAAG,CAAC;QAC1B,IAAI,WAAW,CAAC,8CAA8C,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAC7E,GAAG,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,SAAS,CAAC,EAAE;YAC9B,MAAM,CAAC,CAAC,GAAG,GAAG,GAAG,SAAS,CAAC,CAAC,GAAG,EAAE,CAAC;YAClC,MAAM,CAAC,CAAC,GAAG,GAAG,GAAG,SAAS,CAAC,CAAC,GAAG,EAAE,CAAC;YAClC,MAAM,CAAC,CAAC,GAAG,GAAG,GAAG,SAAS,CAAC,CAAC,GAAG,EAAE,CAAC;YAClC,MAAM,CAAC,CAAC,GAAG,GAAG,GAAG,SAAS,CAAC,CAAC,GAAG,EAAE,CAAC;YAClC,SAAS,CAAC,CAAC,GAAG,IAAI,CAAC,kBAAkB,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC;YACxE,SAAS,CAAC,CAAC,GAAG,IAAI,CAAC,kBAAkB,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC;YACxE,SAAS,CAAC,CAAC,GAAG,IAAI,CAAC,kBAAkB,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC;YACxE,SAAS,CAAC,CAAC,GAAG,IAAI,CAAC,kBAAkB,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC;YACxE,OAAO,QAAQ,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,QAAQ,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;SACrE;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,sBAAsB,CAAC,KAAoB;QACvD,MAAM,IAAI,GAAG,IAAI,cAAc,EAAE,CAAC;QAClC,MAAM,SAAS,GAAG,IAAI,CAAC,+BAA+B,CAAC,KAAK,CAAC,CAAC;QAC9D,IAAI,MAAM,EAAE,MAAM,CAAC;QACnB,MAAM,aAAa,GAAG,MAAM,CAAC;QAC7B,MAAM,aAAa,GAAG,GAAG,GAAG,aAAa,CAAC;QAC1C,IAAI,CAAC,CAAC;QACN,MAAM,SAAS,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC;QACpC,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;QAChC,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;QAChC,IAAI,MAAM,CAAC;QACX,MAAM,YAAY,GAAG,QAAQ,CAAC,mBAAmB,CAAC;QAClD,OAAO,SAAS,KAAK,CAAC,MAAM,GAAG,SAAS,CAAC,aAAa,CAAC,GAAG,EAAE,CAAC,EAAE;YAC7D,IAAI,CAAC,SAAS,EAAE,CAAC;YACjB,MAAM,EAAE,GAAG,SAAS,CAAC,WAAW,CAAC,MAAM,CAAC;YACxC,SAAS,CAAC,6BAA6B,CAAC,MAAM,CAAC,CAAC,GAAG,YAAY,CAAC,CAAC;YACjE,IAAI,CAAC,SAAS,IAAI,EAAE,GAAG,SAAS,CAAC,WAAW,CAAC,MAAM,CAAC;YACpD,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;gBACjD,MAAM,GAAG,SAAS,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;gBAClC,MAAM,GAAG,MAAM,CAAC,aAAa,CAAC;gBAC9B,uCAAuC;gBACvC,IAAI,QAAQ,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE;oBACvE,IAAI,CAAC,OAAO,EAAE,CAAC;iBAChB;qBAAM,IAAI,QAAQ,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE;oBAC9E,IAAI,CAAC,OAAO,EAAE,CAAC;iBAChB;qBAAM;oBACL,IAAI,CAAC,mBAAmB,EAAE,CAAC;oBAC3B,IAAI,IAAI,CAAC,mCAAmC,CAAC,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE;wBACvF,IAAI,SAAS,CAAC,CAAC,GAAG,aAAa,IAAI,SAAS,CAAC,CAAC,GAAG,aAAa,EAAE;4BAC9D,MAAM,MAAM,GAAG,KAAK,CAAC,mBAAmB,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC;4BAC9D,SAAS,CAAC,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAE,2DAA2D;4BAClG,IAAI,CAAC,QAAQ,EAAE,CAAC;yBACjB;wBACD,IAAI,SAAS,CAAC,CAAC,GAAG,aAAa,IAAI,SAAS,CAAC,CAAC,GAAG,aAAa,EAAE;4BAC9D,MAAM,MAAM,GAAG,KAAK,CAAC,mBAAmB,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC,CAAC,CAAC;4BAC9D,SAAS,CAAC,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAE,2DAA2D;4BAClG,IAAI,CAAC,QAAQ,EAAE,CAAC;yBACjB;wBACD,0EAA0E;qBAC3E;iBACF;aACF;YACD,SAAS,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;SACpC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;;;;OAQG;IACI,MAAM,CAAC,qBAAqB,CAAC,YAA6B;QAC/D,uEAAuE;QACvE,MAAM,KAAK,GAAG,IAAI,aAAa,EAAE,CAAC;QAClC,gBAAgB,CAAC,wBAAwB,CAAC,YAAY,EAAE,KAAK,EAAE,YAAY,CAAC,aAAa,CAAC,CAAC;QAC3F,IAAI,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;QACnC,IAAI,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;QAEnC,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;;;OAIG;IACI,MAAM,CAAC,mBAAmB,CAAC,MAAkC,EAAE,aAAsB,IAAI,EAAE,OAAqB,YAAY,CAAC,YAAY;QAC9I,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;YACnB,OAAO,SAAS,CAAC;QACnB,MAAM,KAAK,GAAG,IAAI,aAAa,EAAE,CAAC;QAClC,MAAM,UAAU,GAAG,YAAY,CAAC,iCAAiC,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QACjF,KAAK,MAAM,IAAI,IAAI,UAAU;YAC3B,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;QAE/B,IAAI,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;QACnC,IAAI,CAAC,sBAAsB,CAAC,KAAK,CAAC,CAAC;QACnC,IAAI,UAAU,EAAE;YACd,MAAM,OAAO,GAAG,IAAI,qBAAqB,CAAC,KAAK,CAAC,CAAC;YACjD,OAAO,CAAC,eAAe,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;SACrC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;CAEF","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n\n/** @packageDocumentation\n * @module Topology\n */\n\nimport { LineSegment3d } from \"../curve/LineSegment3d\";\nimport { Geometry } from \"../Geometry\";\nimport { Angle } from \"../geometry3d/Angle\";\nimport { Point2d, Vector2d } from \"../geometry3d/Point2dVector2d\";\nimport { Range3d } from \"../geometry3d/Range\";\nimport { ClusterableArray } from \"../numerics/ClusterableArray\";\nimport { SmallSystem } from \"../numerics/Polynomials\";\nimport { HalfEdge, HalfEdgeGraph, HalfEdgeMask } from \"./Graph\";\nimport { HalfEdgePriorityQueueWithPartnerArray } from \"./HalfEdgePriorityQueue\";\nimport { RegularizationContext } from \"./RegularizeFace\";\nimport { MultiLineStringDataVariant, Triangulator } from \"./Triangulation\";\n\nexport class GraphSplitData {\n  public numUpEdge = 0;\n  public numIntersectionTest = 0;\n  public numSplit = 0;\n  public numPopOut = 0;\n  public numA0B0 = 0;\n  public numA0B1 = 0;\n  public constructor() {\n  }\n}\n\n/**\n * * Assorted methods used in algorithms on HalfEdgeGraph.\n * @internal\n */\nexport class HalfEdgeGraphOps {\n\n  /** Compare function for sorting with primary y compare, secondary  x compare. */\n  public static compareNodesYXUp(a: HalfEdge, b: HalfEdge) {\n    // Check y's\n    // if (!Geometry.isSameCoordinate(a.y, b.y))\n    if (a.y < b.y)\n      return -1;\n    else if (a.y > b.y)\n      return 1;\n    // Check x's\n    // if (!Geometry.isSameCoordinate(a.x, b.x))\n    if (a.x < b.x)\n      return -1;\n    else if (a.x > b.x)\n      return 1;\n    return 0;\n  }\n\n  /** Return true if nodeB (a) is lower than both its neighbors and (b) inflects as a downward peak (rather than an upward trough) */\n  public static isDownPeak(nodeB: HalfEdge) {\n    const nodeA = nodeB.facePredecessor;\n    const nodeC = nodeB.faceSuccessor;\n    return this.compareNodesYXUp(nodeB, nodeA) < 0\n      && this.compareNodesYXUp(nodeB, nodeC) < 0\n      && this.crossProductToTargets(nodeB, nodeA, nodeC) > 0;\n  }\n\n  /** return the cross product of vectors from base to targetA and base to targetB\n   * @param base base vertex of both vectors.\n   * @param targetA target vertex of first vector\n   * @param targetB target vertex of second vector\n   */\n  public static crossProductToTargets(base: HalfEdge, targetA: HalfEdge, targetB: HalfEdge): number {\n    return Geometry.crossProductXYXY(targetA.x - base.x, targetA.y - base.y, targetB.x - base.x, targetB.y - base.y);\n  }\n\n  // ---------------------------------------------------------------------------------------------------------------------\n  // ----------------------------------------------------------------------------------------------------------------------\n\n  public static graphRange(graph: HalfEdgeGraph): Range3d {\n    const range = Range3d.create();\n    for (const node of graph.allHalfEdges) {\n      range.extendXYZ(node.x, node.y, node.z);\n    }\n    return range;\n  }\n  /** Returns an array of a all nodes (both ends) of edges created from segments. */\n  public static segmentArrayToGraphEdges(segments: LineSegment3d[], returnGraph: HalfEdgeGraph, mask: HalfEdgeMask): HalfEdge[] {\n    const result = [];\n    let idxCounter = 0;\n\n    // Push the endpoints of each segment onto arr[] in the form {(x, y, theta), Node}\n    for (const segment of segments) {\n\n      const node0 = returnGraph.createEdgeXYZXYZ(\n        segment.point0Ref.x, segment.point0Ref.y, segment.point0Ref.z,\n        idxCounter,\n        segment.point1Ref.x, segment.point1Ref.y, segment.point1Ref.z,\n        idxCounter + 1);\n\n      const node1 = node0.edgeMate;\n      idxCounter += 2;\n\n      node0.setMaskAroundFace(mask);   // Original given coordinates must be part of boundary\n      result.push(node0);\n      result.push(node1);\n    }\n\n    return result;\n  }\n\n  /**\n   * * For each face with positive area . . . add edges as needed so that each face has one definitely lower node and one definite upper node.\n   * * Hence tracing edges from the low node, there is a sequence of upward edges, reaching the upper,  then a sequence of downward edges reaching the low node.\n   * * This is an essential step for subsequent triangulation.\n   *\n   * @param graph\n   */\n  public static formMonotoneFaces(graph: HalfEdgeGraph) {\n\n    const allFaces = graph.collectFaceLoops();\n    graph.clearMask(HalfEdgeMask.VISITED);\n    // For every face, break the face down into monotone sections\n    for (const node of allFaces) {\n      if (node.isMaskSet(HalfEdgeMask.VISITED))\n        continue;\n      const area = node.signedFaceArea();\n      if (area <= 0.0) {\n        node.setMaskAroundFace(HalfEdgeMask.VISITED);\n        continue;\n      }\n\n    }\n  }\n\n  /**\n   * * Visit all nodes in `graph`.\n   * * invoke `pinch(node, vertexPredecessor)`\n   * * this leaves the graph as isolated edges.\n   * @param graph graph to modify\n   */\n  public static isolateAllEdges(graph: HalfEdgeGraph) {\n    for (const nodeA of graph.allHalfEdges) {\n      const nodeB = nodeA.vertexPredecessor;\n      HalfEdge.pinch(nodeA, nodeB);\n    }\n  }\n\n}\n/**\n * @internal\n */\nexport class HalfEdgeGraphMerge {\n  /** Simplest merge algorithm:\n   * * collect array of (x,y,theta) at all nodes\n   * * lexical sort of the array.\n   * * twist all vertices together.\n   * * This effectively creates valid face loops for a planar subdivision if there are no edge crossings.\n   * * If there are edge crossings, the graph can be a (highly complicated) Klein bottle topology.\n   * * Mask.NULL_FACE is cleared throughout and applied within null faces.\n   */\n  public static clusterAndMergeXYTheta(graph: HalfEdgeGraph, outboundRadiansFunction?: (he: HalfEdge) => number) {\n    const allNodes = graph.allHalfEdges;\n    const numNodes = allNodes.length;\n    graph.clearMask(HalfEdgeMask.NULL_FACE);\n    const clusters = new ClusterableArray(2, 2, numNodes);  // data order: x,y,theta, nodeIndex.  But theta is not set in first round.\n    for (let i = 0; i < numNodes; i++) {\n      const nodeA = allNodes[i];\n      const xA = nodeA.x;\n      const yA = nodeA.y;\n      HalfEdge.pinch(nodeA, nodeA.vertexSuccessor);  // pull it out of its current vertex loop.\n      clusters.addDirect(xA, yA, 0.0, i);\n    }\n    const order = clusters.clusterIndicesLexical();\n    let k0 = 0;\n    const numK = order.length;\n    for (let k1 = 0; k1 < numK; k1++) {\n      if (order[k1] === ClusterableArray.clusterTerminator) {\n        // nodes identified in order[k0]..order[k1] are properly sorted around a vertex.\n        if (k1 > k0) {\n          const iA = clusters.getExtraData(order[k0], 1);\n          const nodeA0 = allNodes[iA];\n          for (let k = k0 + 1; k < k1; k++) {\n            const iB = clusters.getExtraData(order[k], 1);\n            const nodeB = allNodes[iB];\n            nodeB.x = nodeA0.x;\n            nodeB.y = nodeA0.y;\n          }\n        }\n        k0 = k1 + 1;\n      }\n    }\n    // NOW\n    //  1) There are identical coordinates at all nodes around each vertex loop.\n    //  2) Hence ready do sort (at each vertex) by theta.\n\n    // insert theta as extra data in the sort table . . .\n    for (const clusterTableIndex of order) {\n      if (clusterTableIndex !== ClusterableArray.clusterTerminator) {\n        const nodeA = allNodes[clusterTableIndex];\n        const nodeB = nodeA.faceSuccessor;\n        let radians = outboundRadiansFunction ? outboundRadiansFunction(nodeA) : Math.atan2(nodeB.y - nodeA.y, nodeB.x - nodeA.x);\n        if (Angle.isAlmostEqualRadiansAllowPeriodShift(radians, -Math.PI))\n          radians = Math.PI;\n        clusters.setExtraData(clusterTableIndex, 0, radians);\n      }\n    }\n    clusters.sortSubsetsBySingleKey(order, 2);\n    const unmatchedNullFaceNodes: HalfEdge[] = [];\n    k0 = 0;\n    let thetaA, thetaB;\n    // now pinch each neighboring pair together\n    for (let k1 = 0; k1 < numK; k1++) {\n      if (order[k1] === ClusterableArray.clusterTerminator) {\n        // nodes identified in order[k0]..order[k1] are properly sorted around a vertex.\n        if (k1 > k0) {\n          const iA = clusters.getExtraData(order[k0], 1);\n          thetaA = clusters.getExtraData(order[k0], 0);\n          const nodeA0 = allNodes[iA];\n          let nodeA = nodeA0;\n          for (let k = k0 + 1; k < k1; k++) {\n            const iB = clusters.getExtraData(order[k], 1);\n            thetaB = clusters.getExtraData(order[k], 0);\n            const nodeB = allNodes[iB];\n            if (nodeA.isMaskSet(HalfEdgeMask.NULL_FACE)) {\n              // nope, this edge was flagged and pinched from the other end.\n              const j = unmatchedNullFaceNodes.findIndex((node: HalfEdge) => nodeA === node);\n              if (j >= 0) {\n                unmatchedNullFaceNodes[j] = unmatchedNullFaceNodes[unmatchedNullFaceNodes.length - 1];\n                unmatchedNullFaceNodes.pop();\n              }\n              nodeA = nodeB;\n              thetaA = thetaB;\n            } else if (nodeB.isMaskSet(HalfEdgeMask.NULL_FACE)) {\n              const j = unmatchedNullFaceNodes.findIndex((node: HalfEdge) => nodeA === node);\n              if (j >= 0) {\n                unmatchedNullFaceNodes[j] = unmatchedNullFaceNodes[unmatchedNullFaceNodes.length - 1];\n                unmatchedNullFaceNodes.pop();\n              }\n              // NO leave nodeA and thetaA   ignore nodeB -- later step will get the outside of its banana.\n            } else {\n              HalfEdge.pinch(nodeA, nodeB);\n              if (Angle.isAlmostEqualRadiansAllowPeriodShift(thetaA, thetaB)) {\n                const nodeA1 = nodeA.faceSuccessor;\n                const nodeB1 = nodeB.edgeMate;\n                // WE TRUST -- nodeA1 and node B1 must have identical xy.\n                // pinch them together and mark the face loop as null ..\n                HalfEdge.pinch(nodeA1, nodeB1);\n                nodeA.setMask(HalfEdgeMask.NULL_FACE);\n                nodeB1.setMask(HalfEdgeMask.NULL_FACE);\n                unmatchedNullFaceNodes.push(nodeB1);\n              }\n              nodeA = nodeB;\n              thetaA = thetaB;\n            }\n          }\n        }\n        k0 = k1 + 1;\n      }\n    }\n  }\n\n  private static buildVerticalSweepPriorityQueue(graph: HalfEdgeGraph): HalfEdgePriorityQueueWithPartnerArray {\n    const sweepHeap = new HalfEdgePriorityQueueWithPartnerArray();\n    for (const p of graph.allHalfEdges) {\n\n      if (HalfEdgeGraphOps.compareNodesYXUp(p, p.faceSuccessor) < 0) {\n        sweepHeap.priorityQueue.push(p);\n      }\n    }\n    return sweepHeap;\n  }\n  private static snapFractionToNode(xy: Point2d, fraction: number, node: HalfEdge, nodeFraction: number): number{\n    if (Geometry.isSameCoordinate(xy.x, node.x) && Geometry.isSameCoordinate(xy.y, node.y))\n      return nodeFraction;\n    return fraction;\n}\n  private static computeIntersectionFractionsOnEdges(nodeA0: HalfEdge, nodeB0: HalfEdge, fractions: Vector2d, pointA: Point2d, pointB: Point2d): boolean {\n    const nodeA1 = nodeA0.faceSuccessor;\n    const ax0 = nodeA0.x;\n    const ay0 = nodeA0.y;\n    const ux = nodeA1.x - ax0;\n    const uy = nodeA1.y - ay0;\n    const nodeB1 = nodeB0.faceSuccessor;\n    const bx0 = nodeB0.x;\n    const by0 = nodeB0.y;\n    const vx = nodeB1.x - bx0;\n    const vy = nodeB1.y - by0;\n    if (SmallSystem.lineSegmentXYUVTransverseIntersectionUnbounded(ax0, ay0, ux, uy,\n      bx0, by0, vx, vy, fractions)) {\n      pointA.x = ax0 + fractions.x * ux;\n      pointA.y = ay0 + fractions.x * uy;\n      pointB.x = bx0 + fractions.y * vx;\n      pointB.y = by0 + fractions.y * vy;\n      fractions.x = this.snapFractionToNode(pointA, fractions.x, nodeA0, 0.0);\n      fractions.x = this.snapFractionToNode(pointA, fractions.x, nodeA1, 1.0);\n      fractions.y = this.snapFractionToNode(pointB, fractions.y, nodeB0, 0.0);\n      fractions.y = this.snapFractionToNode(pointB, fractions.y, nodeB1, 1.0);\n      return Geometry.isIn01(fractions.x) && Geometry.isIn01(fractions.y);\n    }\n    return false;\n  }\n  /**\n   * Split edges at intersections.\n   * * This is a large operation.\n   * @param graph\n   */\n  public static splitIntersectingEdges(graph: HalfEdgeGraph): GraphSplitData {\n    const data = new GraphSplitData();\n    const sweepHeap = this.buildVerticalSweepPriorityQueue(graph);\n    let nodeA0, nodeB1;\n    const smallFraction = 1.0e-8;\n    const largeFraction = 1.0 - smallFraction;\n    let i;\n    const fractions = Vector2d.create();\n    const pointA = Point2d.create();\n    const pointB = Point2d.create();\n    let nodeB0;\n    const popTolerance = Geometry.smallMetricDistance;\n    while (undefined !== (nodeA0 = sweepHeap.priorityQueue.pop())) {\n      data.numUpEdge++;\n      const n0 = sweepHeap.activeEdges.length;\n      sweepHeap.removeArrayMembersWithY1Below(nodeA0.y - popTolerance);\n      data.numPopOut += n0 - sweepHeap.activeEdges.length;\n      for (i = 0; i < sweepHeap.activeEdges.length; i++) {\n        nodeB0 = sweepHeap.activeEdges[i];\n        nodeB1 = nodeB0.faceSuccessor;\n        // const nodeB1 = nodeB0.faceSuccessor;\n        if (Geometry.isSameCoordinateXY(nodeA0.x, nodeA0.y, nodeB0.x, nodeB0.y)) {\n          data.numA0B0++;\n        } else if (Geometry.isSameCoordinateXY(nodeB1.x, nodeB1.y, nodeA0.x, nodeA0.y)) {\n          data.numA0B1++;\n        } else {\n          data.numIntersectionTest++;\n          if (this.computeIntersectionFractionsOnEdges(nodeA0, nodeB0, fractions, pointA, pointB)) {\n            if (fractions.x > smallFraction && fractions.x < largeFraction) {\n              const nodeC0 = graph.splitEdgeAtFraction(nodeA0, fractions.x);\n              sweepHeap.priorityQueue.push(nodeC0);  // The upper portion will be reviewed as a nodeA0 later !!!\n              data.numSplit++;\n            }\n            if (fractions.y > smallFraction && fractions.y < largeFraction) {\n              const nodeD0 = graph.splitEdgeAtFraction(nodeB0, fractions.y);\n              sweepHeap.priorityQueue.push(nodeD0);  // The upper portion will be reviewed as a nodeA0 later !!!\n              data.numSplit++;\n            }\n            // existing nodeA0 and its shortened edge remain for further intersections\n          }\n        }\n      }\n      sweepHeap.activeEdges.push(nodeA0);\n    }\n    return data;\n  }\n\n  /**\n   * Returns a graph structure formed from the given LineSegment array\n   *\n   * *  Find all intersections among segments, and split them if necessary\n   * *  Record endpoints of every segment in the form X, Y, Theta; This information is stored as a new node and sorted to match up\n   *      vertices.\n   * *  For vertices that match up, pinch the nodes to create vertex loops, which in closed objects, will also eventually form face\n   *      loops\n   */\n  public static formGraphFromSegments(lineSegments: LineSegment3d[]): HalfEdgeGraph {\n    // Structure of an index of the array: { xyTheta: Point3d, node: Node }\n    const graph = new HalfEdgeGraph();\n    HalfEdgeGraphOps.segmentArrayToGraphEdges(lineSegments, graph, HalfEdgeMask.BOUNDARY_EDGE);\n    this.splitIntersectingEdges(graph);\n    this.clusterAndMergeXYTheta(graph);\n\n    return graph;\n  }\n\n  /**\n   * * Input is random linestrings, not necessarily loops\n   * * Graph gets full splitEdges, regularize, and triangulate.\n   * @returns triangulated graph, or undefined if bad data.\n   */\n  public static formGraphFromChains(chains: MultiLineStringDataVariant, regularize: boolean = true, mask: HalfEdgeMask = HalfEdgeMask.PRIMARY_EDGE): HalfEdgeGraph | undefined {\n    if (chains.length < 1)\n      return undefined;\n    const graph = new HalfEdgeGraph();\n    const chainSeeds = Triangulator.directCreateChainsFromCoordinates(graph, chains);\n    for (const seed of chainSeeds)\n      seed.setMaskAroundFace(mask);\n\n    this.splitIntersectingEdges(graph);\n    this.clusterAndMergeXYTheta(graph);\n    if (regularize) {\n      const context = new RegularizationContext(graph);\n      context.regularizeGraph(true, true);\n    }\n    return graph;\n  }\n\n}\n"]}

package/lib/esm/topology/RegularizeFace.d.ts

@@ -0,0 +1,106 @@
+/** @packageDocumentation
+ * @module Topology
+ */
+import { HalfEdge, HalfEdgeGraph } from "./Graph";
+/**
+ * * Context for regularizing single faces.
+ * @internal
+ */
+export declare class RegularizationContext {
+    static announceEdge?: (graph: HalfEdgeGraph, nodeA: HalfEdge, nodeB: HalfEdge, scale: number) => void;
+    constructor(graph: HalfEdgeGraph);
+    /**
+     * These are public only for testing.
+     */
+    graph: HalfEdgeGraph;
+    /** array of edges directed upward.  Turn can be left or right, but is not large enough to be a min or max */
+    upEdges: HalfEdge[];
+    /** array of edges directed downward, Turn can be left or right, but is not large enough to be a min or max */
+    downEdges: HalfEdge[];
+    /** Array of edges whose start is an upward peak (right turn, inbound up, outbound down) */
+    topPeaks: HalfEdge[];
+    /** Array of edges whose start is an downward peak (right turn, inbound down, outbound up) */
+    bottomPeaks: HalfEdge[];
+    /** Array of edges at local minima (left turn, inbound down, outbound up).  Ensuing chain is up */
+    localMin: HalfEdge[];
+    /** Array of edges at local maxima (left turn, inbound up, outbound down).  Ensuing chain is down */
+    localMax: HalfEdge[];
+    /**
+     * Collect (and classify) all the edges around a single face.
+     * * The various arrays are collected: upEdges, downEdges, topPeaks, bottomPeaks, upChains, downChains
+     * @param faceSeed face to examine
+     */
+    collectVerticalEventsAroundFace(faceSeed: HalfEdge): void;
+    /**
+     * Collect (and classify) all the edges in an array.
+     * * The various arrays are collected: upEdges, downEdges, topPeaks, bottomPeaks, upChains, downChains
+     * @param candidateEdges array of edges.
+     */
+    collectVerticalEventFromEdgesInAndArray(candidateEdges: HalfEdge[]): void;
+    private swapArrays;
+    /**
+     * Find the edge (among candidates) which is first struck by a "rightward" scan from node
+     * * comparisonFunction determines scan sense
+     *   * HalfEdge.compareNodeYXTheta is an upward scan.
+     *   * HalfEdge.compareNodeYXThetaDownward is a downward scan.
+     * @param node
+     * @param candidates Array of nodes to search
+     * @param nodeComparisonFunction function for lexical comparison.
+     */
+    private findTopVisibleEdge;
+    /**
+     *
+     * @param downPeak a "bottom" node where the interior CCW loop has a local min
+     * @param downEdgeStart (optional) node at the start (heading downwards!) of an edge that brackets downPeak on the left.
+     * @param upEdgeStart  (optional) node at the start (heading up!) of the edge that brackets downPeak on the right.
+     */
+    private highestUpPeakConnection;
+    private updateMaxNode;
+    private negateXY;
+    private downwardConnectionFromBottomPeak;
+    /** Search around the vertex of nodeA for a nodeA1 such that nodeB is visible in the sector at nodeA1 */
+    private findVisibleSector;
+    /**
+     * Create an edge from (some node around the vertex of) nodeA to (some node around the vertex of) nodeB.
+     * * looking around the vertex for alternate insertion corrects cusp insertion errors.
+     * @param nodeA
+     * @param nodeB
+     */
+    private joinNodes;
+    /**
+     * Regularize a single face.
+     * * Insert edge from any downward interior vertex to something lower
+     * * Insert an edge from each upward interior vertex to something higher.
+     * * The face is split into smaller faces
+     * * Each final face has at most one "min" and one "max", and is easy to triangulate with a bottom to top sweep.
+     * * Normal usage is to sweep in both directions, i.e. use the default (true,true) for the upSweep and downSweep parameters.
+     * @param faceSeed any representative half edge on the face
+     * @param upSweep true to do the upward sweep.
+     * @param downSweep true to do the downward sweep.
+     */
+    private runRegularization;
+    /**
+     * Regularize a single face.
+     * * Insert edge from any downward interior vertex to something lower
+     * * Insert an edge from each upward interior vertex to something higher.
+     * * The face is split into smaller faces
+     * * Each final face has at most one "min" and one "max", and is easy to triangulate with a bottom to top sweep.
+     * * Normal usage is to sweep in both directions, i.e. use the default (true,true) for the upSweep and downSweep parameters.
+     * @param faceSeed any representative half edge on the face
+     * @param upSweep true to do the upward sweep.
+     * @param downSweep true to do the downward sweep.
+     */
+    regularizeFace(faceSeed: HalfEdge, upSweep?: boolean, downSweep?: boolean): void;
+    regularizeGraph(upSweep?: boolean, downSweep?: boolean): void;
+    /** test if a single face is monotone;  if so, return its (single) min */
+    static isMonotoneFace(seed: HalfEdge): HalfEdge | undefined;
+    /** Return faces filtered by area and test function.
+     * * find one arbitrary representative of each face
+     * * offer the candidate to the mutate function.
+     * * collect results
+     * @param mappedSeeds when filter returns a HalfEdge, collect it here
+     * @param unmappedSeeds when filter does not return a half edge, collect the candidate.
+     */
+    static collectMappedFaceRepresentatives(graph: HalfEdgeGraph, positiveAreaOnly: boolean, mutate: (seed: HalfEdge) => HalfEdge | undefined, mappedEdges: HalfEdge[] | undefined, unMappedSeeds: HalfEdge[] | undefined): void;
+}
+//# sourceMappingURL=RegularizeFace.d.ts.map

package/lib/esm/topology/RegularizeFace.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"RegularizeFace.d.ts","sourceRoot":"","sources":["../../../src/topology/RegularizeFace.ts"],"names":[],"mappings":"AAKA;;GAEG;AAEH,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAgB,MAAM,SAAS,CAAC;AAIhE;;;GAGG;AACH,qBAAa,qBAAqB;IAMhC,OAAc,YAAY,CAAC,EAAE,CAAC,KAAK,EAAE,aAAa,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,KAAK,IAAI,CAAC;gBAC1F,KAAK,EAAE,aAAa;IAUvC;;OAEG;IACI,KAAK,EAAE,aAAa,CAAC;IAC5B,6GAA6G;IACtG,OAAO,EAAE,QAAQ,EAAE,CAAC;IAC3B,8GAA8G;IACvG,SAAS,EAAE,QAAQ,EAAE,CAAC;IAC7B,2FAA2F;IACpF,QAAQ,EAAE,QAAQ,EAAE,CAAC;IAC5B,6FAA6F;IACtF,WAAW,EAAE,QAAQ,EAAE,CAAC;IAE/B,kGAAkG;IAC3F,QAAQ,EAAE,QAAQ,EAAE,CAAC;IAC5B,oGAAoG;IAC7F,QAAQ,EAAE,QAAQ,EAAE,CAAC;IAC5B;;;;OAIG;IACI,+BAA+B,CAAC,QAAQ,EAAE,QAAQ;IAuCzD;;;;OAIG;IACI,uCAAuC,CAAC,cAAc,EAAE,QAAQ,EAAE;IAsCzE,OAAO,CAAC,UAAU;IAMlB;;;;;;;;OAQG;IACH,OAAO,CAAC,kBAAkB;IA4B1B;;;;;OAKG;IACH,OAAO,CAAC,uBAAuB;IA+B/B,OAAO,CAAC,aAAa;IAUrB,OAAO,CAAC,QAAQ;IAMhB,OAAO,CAAC,gCAAgC;IAaxC,wGAAwG;IACxG,OAAO,CAAC,iBAAiB;IASzB;;;;;OAKG;IACH,OAAO,CAAC,SAAS;IAajB;;;;;;;;;;OAUG;IACH,OAAO,CAAC,iBAAiB;IAiCzB;;;;;;;;;;OAUG;IACI,cAAc,CAAC,QAAQ,EAAE,QAAQ,EAAE,OAAO,GAAE,OAAc,EAAE,SAAS,GAAE,OAAc;IAKrF,eAAe,CAAC,OAAO,GAAE,OAAc,EAAE,SAAS,GAAE,OAAc;IAKzE,yEAAyE;WAC3D,cAAc,CAAC,IAAI,EAAE,QAAQ,GAAG,QAAQ,GAAG,SAAS;IAsBlE;;;;;;OAMG;WACW,gCAAgC,CAC5C,KAAK,EAAE,aAAa,EACpB,gBAAgB,EAAE,OAAO,EACzB,MAAM,EAAE,CAAC,IAAI,EAAE,QAAQ,KAAK,QAAQ,GAAG,SAAS,EAChD,WAAW,EAAE,QAAQ,EAAE,GAAG,SAAS,EACnC,aAAa,EAAE,QAAQ,EAAE,GAAG,SAAS;CAwBxC"}