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

package/lib/esm/topology/RegularizeFace.js

@@ -0,0 +1,367 @@
+/*---------------------------------------------------------------------------------------------
+* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+* See LICENSE.md in the project root for license terms and full copyright notice.
+*--------------------------------------------------------------------------------------------*/
+/** @packageDocumentation
+ * @module Topology
+ */
+import { HalfEdge, HalfEdgeMask } from "./Graph";
+import { HalfEdgeGraphOps } from "./Merging";
+//   /* eslint-disable no-console */
+/**
+ * * Context for regularizing single faces.
+ * @internal
+ */
+export class RegularizationContext {
+    constructor(graph) {
+        this.graph = graph;
+        this.upEdges = [];
+        this.downEdges = [];
+        this.bottomPeaks = [];
+        this.topPeaks = [];
+        this.localMin = [];
+        this.localMax = [];
+    }
+    /**
+     * 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) {
+        let nodeA = faceSeed;
+        let nodeB;
+        let nodeC;
+        let abUp;
+        let bcUp;
+        this.upEdges.length = 0;
+        this.downEdges.length = 0;
+        this.topPeaks.length = 0;
+        this.bottomPeaks.length = 0;
+        this.localMin.length = 0;
+        this.localMax.length = 0;
+        do {
+            nodeB = nodeA.faceSuccessor;
+            nodeC = nodeB.faceSuccessor;
+            abUp = HalfEdgeGraphOps.compareNodesYXUp(nodeA, nodeB) < 0;
+            bcUp = HalfEdgeGraphOps.compareNodesYXUp(nodeB, nodeC) < 0;
+            if (abUp) {
+                this.upEdges.push(nodeA);
+                if (!bcUp) {
+                    if (HalfEdgeGraphOps.crossProductToTargets(nodeB, nodeA, nodeC) < 0)
+                        this.localMax.push(nodeB);
+                    else
+                        this.topPeaks.push(nodeB);
+                }
+            }
+            else { // ab is DOWN
+                this.downEdges.push(nodeA);
+                if (bcUp) {
+                    if (HalfEdgeGraphOps.crossProductToTargets(nodeB, nodeA, nodeC) > 0)
+                        this.bottomPeaks.push(nodeB);
+                    else
+                        this.localMin.push(nodeB);
+                }
+            }
+            nodeA = nodeB;
+        } while (nodeA !== faceSeed);
+    }
+    /**
+     * 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) {
+        let nodeA;
+        let nodeB;
+        let nodeC;
+        let abUp;
+        let bcUp;
+        this.upEdges.length = 0;
+        this.downEdges.length = 0;
+        this.topPeaks.length = 0;
+        this.bottomPeaks.length = 0;
+        this.localMin.length = 0;
+        this.localMax.length = 0;
+        for (nodeA of candidateEdges) {
+            nodeB = nodeA.faceSuccessor;
+            nodeC = nodeB.faceSuccessor;
+            abUp = HalfEdgeGraphOps.compareNodesYXUp(nodeA, nodeB) < 0;
+            bcUp = HalfEdgeGraphOps.compareNodesYXUp(nodeB, nodeC) < 0;
+            if (abUp) {
+                this.upEdges.push(nodeA);
+                if (!bcUp) {
+                    if (HalfEdgeGraphOps.crossProductToTargets(nodeB, nodeA, nodeC) < 0)
+                        this.localMax.push(nodeB);
+                    else
+                        this.topPeaks.push(nodeB);
+                }
+            }
+            else { // ab is DOWN
+                this.downEdges.push(nodeA);
+                if (bcUp) {
+                    if (HalfEdgeGraphOps.crossProductToTargets(nodeB, nodeA, nodeC) > 0)
+                        this.bottomPeaks.push(nodeB);
+                    else
+                        this.localMin.push(nodeB);
+                }
+            }
+        }
+    }
+    swapArrays() {
+        let save = this.downEdges;
+        this.downEdges = this.upEdges;
+        this.upEdges = save;
+        save = this.localMax;
+        this.localMax = this.localMin;
+        this.localMin = save;
+        save = this.topPeaks;
+        this.topPeaks = this.bottomPeaks;
+        this.bottomPeaks = save;
+    }
+    /**
+     * 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.
+     */
+    findTopVisibleEdge(node, candidates, directionSign) {
+        const y0 = node.y;
+        const x0 = node.x;
+        let dx;
+        let distanceRight = Number.MAX_SAFE_INTEGER;
+        let result;
+        for (const rightBase of candidates) {
+            const rightTop = rightBase.faceSuccessor;
+            if (rightBase === node || rightTop === node)
+                continue;
+            // for horizontal edge cases -- require edges ends to have strict sign change (no zeros!!)
+            const cRight = HalfEdgeGraphOps.compareNodesYXUp(node, rightBase);
+            const cTop = HalfEdgeGraphOps.compareNodesYXUp(node, rightTop);
+            // console.log(node.id, rightBase.id, rightTop.id, cRight, cTop);
+            if (cRight * cTop >= 0)
+                continue;
+            const fraction = HalfEdge.horizontalScanFraction01(rightBase, y0);
+            if (fraction !== undefined) {
+                dx = directionSign * (rightBase.fractionToX(fraction) - x0);
+                if (dx > 0 && dx < distanceRight) {
+                    result = rightBase;
+                    distanceRight = dx;
+                }
+            }
+        }
+        return result;
+    }
+    /**
+     *
+     * @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.
+     */
+    highestUpPeakConnection(downPeak, downEdgeStart, upEdgeStart) {
+        let highestPeak;
+        for (const upPeak of this.topPeaks) {
+            const y0 = upPeak.y;
+            const x0 = upPeak.x;
+            // is upPeak higher than prior upPeak?
+            if (highestPeak !== undefined && HalfEdgeGraphOps.compareNodesYXUp(upPeak, highestPeak) < 0)
+                continue;
+            // is upPeak BELOW downPeak, ABOVE both limit edges lower node, and between limit edge interiors.
+            if (HalfEdgeGraphOps.compareNodesYXUp(upPeak, downPeak) < 0) {
+                if (downEdgeStart) {
+                    const fraction = HalfEdge.horizontalScanFraction01(downEdgeStart, y0);
+                    if (fraction === undefined)
+                        continue;
+                    if (x0 <= downEdgeStart.fractionToX(fraction))
+                        continue;
+                }
+                if (upEdgeStart) {
+                    const fraction = HalfEdge.horizontalScanFraction01(upEdgeStart, y0);
+                    if (fraction === undefined)
+                        continue;
+                    if (upEdgeStart.fractionToX(fraction) <= x0)
+                        continue;
+                }
+                highestPeak = upPeak;
+            }
+        }
+        return highestPeak;
+    }
+    updateMaxNode(maxNode, candidate, compare) {
+        if (!maxNode)
+            return candidate;
+        if (!candidate)
+            return maxNode;
+        // both are defined .. look for positive compare ...
+        if (compare(maxNode, candidate) < 0)
+            return candidate;
+        return maxNode;
+    }
+    negateXY() {
+        for (const node of this.graph.allHalfEdges) {
+            node.x *= -1;
+            node.y *= -1;
+        }
+    }
+    downwardConnectionFromBottomPeak(node) {
+        let connectTo;
+        const upFunction = HalfEdgeGraphOps.compareNodesYXUp;
+        const upEdgeBase = this.findTopVisibleEdge(node, this.upEdges, 1.0);
+        const downEdgeBase = this.findTopVisibleEdge(node, this.downEdges, -1.0);
+        connectTo = this.updateMaxNode(connectTo, upEdgeBase, upFunction);
+        if (downEdgeBase)
+            connectTo = this.updateMaxNode(connectTo, downEdgeBase.faceSuccessor, upFunction);
+        const upPeakConnection = this.highestUpPeakConnection(node, downEdgeBase, upEdgeBase);
+        if (upPeakConnection !== undefined)
+            connectTo = this.updateMaxNode(connectTo, upPeakConnection, upFunction);
+        return connectTo;
+    }
+    /** Search around the vertex of nodeA for a nodeA1 such that nodeB is visible in the sector at nodeA1 */
+    findVisibleSector(nodeA, nodeB) {
+        let nodeA1 = nodeA;
+        do {
+            if (HalfEdge.isNodeVisibleInSector(nodeB, nodeA1))
+                return nodeA1;
+            nodeA1 = nodeA1.vertexSuccessor;
+        } while (nodeA1 !== nodeA);
+        return undefined;
+    }
+    /**
+     * 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
+     */
+    joinNodes(nodeA, nodeB, direction) {
+        const nodeC = this.graph.createEdgeXYZXYZ(nodeA.x, nodeA.y, nodeA.z, 0, nodeB.x, nodeB.y, nodeB.z, 0);
+        const nodeA1 = this.findVisibleSector(nodeA, nodeB);
+        const nodeB1 = this.findVisibleSector(nodeB, nodeA);
+        if (nodeA1 !== undefined && nodeB1 !== undefined) {
+            HalfEdge.pinch(nodeA1, nodeC);
+            HalfEdge.pinch(nodeB1, nodeC.edgeMate);
+            if (RegularizationContext.announceEdge)
+                RegularizationContext.announceEdge(this.graph, nodeA, nodeB, direction);
+            return nodeC;
+        }
+        return undefined;
+    }
+    /**
+     * 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.
+     */
+    runRegularization(upSweep = true, downSweep = true) {
+        if (upSweep) {
+            this.bottomPeaks.sort(HalfEdgeGraphOps.compareNodesYXUp);
+            for (const bottomPeak of this.bottomPeaks) {
+                // console.log("SEARCH", bottomPeak.id, [bottomPeak.x, bottomPeak.y]);
+                if (!HalfEdgeGraphOps.isDownPeak(bottomPeak))
+                    continue;
+                const target = this.downwardConnectionFromBottomPeak(bottomPeak);
+                if (target !== undefined) {
+                    // console.log("join", bottomPeak.id, [bottomPeak.x, bottomPeak.y], target.id, [target.x, target.y]);
+                    this.joinNodes(bottomPeak, target, 1);
+                }
+            }
+        }
+        if (downSweep) {
+            // flip the whole graph (ouch)
+            this.negateXY();
+            // swap the various p and down seeds ....
+            this.swapArrays();
+            this.bottomPeaks.sort(HalfEdgeGraphOps.compareNodesYXUp);
+            for (const bottomPeak of this.bottomPeaks) {
+                if (!HalfEdgeGraphOps.isDownPeak(bottomPeak))
+                    continue;
+                const target = this.downwardConnectionFromBottomPeak(bottomPeak);
+                if (target !== undefined) {
+                    this.joinNodes(bottomPeak, target, -1);
+                }
+            }
+            this.negateXY();
+            this.swapArrays();
+        }
+    }
+    /**
+     * 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, upSweep = true, downSweep = true) {
+        this.collectVerticalEventsAroundFace(faceSeed);
+        this.runRegularization(upSweep, downSweep);
+    }
+    regularizeGraph(upSweep = true, downSweep = true) {
+        this.collectVerticalEventFromEdgesInAndArray(this.graph.allHalfEdges);
+        this.runRegularization(upSweep, downSweep);
+    }
+    /** test if a single face is monotone;  if so, return its (single) min */
+    static isMonotoneFace(seed) {
+        let numMin = 0;
+        let numMax = 0;
+        let nodeMin;
+        let nodeA = seed;
+        do {
+            const nodeB = nodeA.faceSuccessor;
+            const nodeC = nodeB.faceSuccessor;
+            const ab = HalfEdgeGraphOps.compareNodesYXUp(nodeA, nodeB);
+            const bc = HalfEdgeGraphOps.compareNodesYXUp(nodeB, nodeC);
+            if (ab * bc <= 0) {
+                if (ab > 0) {
+                    numMin++;
+                    nodeMin = nodeB;
+                }
+                if (bc > 0) {
+                    numMax++;
+                }
+            }
+        } while ((nodeA = nodeA.faceSuccessor) !== seed);
+        return numMin === 1 && numMax === 1 ? nodeMin : 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, positiveAreaOnly, mutate, mappedEdges, unMappedSeeds) {
+        if (mappedEdges)
+            mappedEdges.length = 0;
+        if (unMappedSeeds)
+            unMappedSeeds.length = 0;
+        const mask = HalfEdgeMask.VISITED;
+        graph.clearMask(mask);
+        for (const seed of graph.allHalfEdges) {
+            if (!seed.getMask(mask)) {
+                seed.setMaskAroundFace(mask);
+                if (!positiveAreaOnly || seed.signedFaceArea() > 0) {
+                    const edge = mutate(seed);
+                    if (edge) {
+                        if (mappedEdges)
+                            mappedEdges.push(edge);
+                    }
+                    else {
+                        if (unMappedSeeds)
+                            unMappedSeeds.push(seed);
+                    }
+                }
+            }
+        }
+    }
+}
+//# sourceMappingURL=RegularizeFace.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"RegularizeFace.js","sourceRoot":"","sources":["../../../src/topology/RegularizeFace.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AAEH,OAAO,EAAE,QAAQ,EAAiB,YAAY,EAAE,MAAM,SAAS,CAAC;AAChE,OAAO,EAAE,gBAAgB,EAAE,MAAM,WAAW,CAAC;AAE7C,oCAAoC;AACpC;;;GAGG;AACH,MAAM,OAAO,qBAAqB;IAOhC,YAAmB,KAAoB;QACrC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;QAClB,IAAI,CAAC,SAAS,GAAG,EAAE,CAAC;QACpB,IAAI,CAAC,WAAW,GAAG,EAAE,CAAC;QACtB,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAC;QACnB,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAC;QACnB,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAC;IACrB,CAAC;IAmBD;;;;OAIG;IACI,+BAA+B,CAAC,QAAkB;QACvD,IAAI,KAAK,GAAG,QAAQ,CAAC;QACrB,IAAI,KAAK,CAAC;QACV,IAAI,KAAK,CAAC;QACV,IAAI,IAAI,CAAC;QACT,IAAI,IAAI,CAAC;QACT,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;QACxB,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;QAC1B,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;QACzB,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;QAC5B,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;QACzB,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;QACzB,GAAG;YACD,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;YAC5B,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;YAC5B,IAAI,GAAG,gBAAgB,CAAC,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;YAC3D,IAAI,GAAG,gBAAgB,CAAC,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;YAC3D,IAAI,IAAI,EAAE;gBACR,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACzB,IAAI,CAAC,IAAI,EAAE;oBACT,IAAI,gBAAgB,CAAC,qBAAqB,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC;wBACjE,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;;wBAE1B,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;iBAC7B;aAEF;iBAAM,EAAE,aAAa;gBACpB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBAC3B,IAAI,IAAI,EAAE;oBACR,IAAI,gBAAgB,CAAC,qBAAqB,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC;wBACjE,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;;wBAE7B,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;iBAC7B;aACF;YACD,KAAK,GAAG,KAAK,CAAC;SACf,QAAQ,KAAK,KAAK,QAAQ,EAAE;IAC/B,CAAC;IAED;;;;OAIG;IACI,uCAAuC,CAAC,cAA0B;QACvE,IAAI,KAAK,CAAC;QACV,IAAI,KAAK,CAAC;QACV,IAAI,KAAK,CAAC;QACV,IAAI,IAAI,CAAC;QACT,IAAI,IAAI,CAAC;QACT,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;QACxB,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;QAC1B,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;QACzB,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;QAC5B,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;QACzB,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;QACzB,KAAK,KAAK,IAAI,cAAc,EAAE;YAC5B,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;YAC5B,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;YAC5B,IAAI,GAAG,gBAAgB,CAAC,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;YAC3D,IAAI,GAAG,gBAAgB,CAAC,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;YAC3D,IAAI,IAAI,EAAE;gBACR,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACzB,IAAI,CAAC,IAAI,EAAE;oBACT,IAAI,gBAAgB,CAAC,qBAAqB,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC;wBACjE,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;;wBAE1B,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;iBAC7B;aAEF;iBAAM,EAAE,aAAa;gBACpB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBAC3B,IAAI,IAAI,EAAE;oBACR,IAAI,gBAAgB,CAAC,qBAAqB,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC;wBACjE,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;;wBAE7B,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;iBAC7B;aACF;SACF;IACH,CAAC;IAEO,UAAU;QAChB,IAAI,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC;QAAC,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,OAAO,CAAC;QAAC,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC;QAC9E,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC;QAAC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;QAAC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;QAC1E,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC;QAAC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC;QAAC,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;IAClF,CAAC;IAED;;;;;;;;OAQG;IACK,kBAAkB,CAAC,IAAc,EAAE,UAAsB,EAC/D,aAAqB;QACrB,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC;QAClB,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC;QAClB,IAAI,EAAE,CAAC;QACP,IAAI,aAAa,GAAG,MAAM,CAAC,gBAAgB,CAAC;QAC5C,IAAI,MAA4B,CAAC;QACjC,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE;YAClC,MAAM,QAAQ,GAAG,SAAS,CAAC,aAAa,CAAC;YACzC,IAAI,SAAS,KAAK,IAAI,IAAI,QAAQ,KAAK,IAAI;gBACzC,SAAS;YACX,0FAA0F;YAC1F,MAAM,MAAM,GAAG,gBAAgB,CAAC,gBAAgB,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;YAClE,MAAM,IAAI,GAAG,gBAAgB,CAAC,gBAAgB,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;YAC/D,iEAAiE;YACjE,IAAI,MAAM,GAAG,IAAI,IAAI,CAAC;gBACpB,SAAS;YACX,MAAM,QAAQ,GAAG,QAAQ,CAAC,wBAAwB,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC;YAClE,IAAI,QAAQ,KAAK,SAAS,EAAE;gBAC1B,EAAE,GAAG,aAAa,GAAG,CAAC,SAAS,CAAC,WAAW,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC,CAAC;gBAC5D,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,aAAa,EAAE;oBAChC,MAAM,GAAG,SAAS,CAAC;oBACnB,aAAa,GAAG,EAAE,CAAC;iBACpB;aACF;SACF;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;OAKG;IACK,uBAAuB,CAAC,QAAkB,EAAE,aAAmC,EAAE,WAAiC;QACxH,IAAI,WAAW,CAAC;QAEhB,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,QAAQ,EAAE;YAClC,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC;YACpB,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC;YACpB,sCAAsC;YACtC,IAAI,WAAW,KAAK,SAAS,IAAI,gBAAgB,CAAC,gBAAgB,CAAC,MAAM,EAAE,WAAW,CAAC,GAAG,CAAC;gBACzF,SAAS;YACX,iGAAiG;YACjG,IAAI,gBAAgB,CAAC,gBAAgB,CAAC,MAAM,EAAE,QAAQ,CAAC,GAAG,CAAC,EAAE;gBAC3D,IAAI,aAAa,EAAE;oBACjB,MAAM,QAAQ,GAAG,QAAQ,CAAC,wBAAwB,CAAC,aAAa,EAAE,EAAE,CAAC,CAAC;oBACtE,IAAI,QAAQ,KAAK,SAAS;wBACxB,SAAS;oBACX,IAAI,EAAE,IAAI,aAAa,CAAC,WAAW,CAAC,QAAQ,CAAC;wBAC3C,SAAS;iBACZ;gBACD,IAAI,WAAW,EAAE;oBACf,MAAM,QAAQ,GAAG,QAAQ,CAAC,wBAAwB,CAAC,WAAW,EAAE,EAAE,CAAC,CAAC;oBACpE,IAAI,QAAQ,KAAK,SAAS;wBACxB,SAAS;oBACX,IAAI,WAAW,CAAC,WAAW,CAAC,QAAQ,CAAC,IAAI,EAAE;wBACzC,SAAS;iBACZ;gBACD,WAAW,GAAG,MAAM,CAAC;aACtB;SACF;QACD,OAAO,WAAW,CAAC;IACrB,CAAC;IAEO,aAAa,CAAC,OAA6B,EAAE,SAA+B,EAAE,OAA6C;QACjI,IAAI,CAAC,OAAO;YACV,OAAO,SAAS,CAAC;QACnB,IAAI,CAAC,SAAS;YACZ,OAAO,OAAO,CAAC;QACjB,oDAAoD;QACpD,IAAI,OAAO,CAAC,OAAO,EAAE,SAAS,CAAC,GAAG,CAAC;YACjC,OAAO,SAAS,CAAC;QACnB,OAAO,OAAO,CAAC;IACjB,CAAC;IACO,QAAQ;QACd,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,YAAY,EAAE;YAC1C,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;YACb,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;SACd;IACH,CAAC;IACO,gCAAgC,CAAC,IAAc;QACrD,IAAI,SAAS,CAAC;QACd,MAAM,UAAU,GAAG,gBAAgB,CAAC,gBAAgB,CAAC;QACrD,MAAM,UAAU,GAAG,IAAI,CAAC,kBAAkB,CAAC,IAAI,EAAE,IAAI,CAAC,OAAO,EAAE,GAAG,CAAE,CAAC;QACrE,MAAM,YAAY,GAAG,IAAI,CAAC,kBAAkB,CAAC,IAAI,EAAE,IAAI,CAAC,SAAS,EAAE,CAAC,GAAG,CAAE,CAAC;QAC1E,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC,SAAS,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC;QAClE,IAAI,YAAY;YACd,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC,SAAS,EAAE,YAAY,CAAC,aAAa,EAAE,UAAU,CAAC,CAAC;QACpF,MAAM,gBAAgB,GAAG,IAAI,CAAC,uBAAuB,CAAC,IAAI,EAAE,YAAY,EAAE,UAAU,CAAC,CAAC;QACtF,IAAI,gBAAgB,KAAK,SAAS;YAChC,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC,SAAS,EAAE,gBAAgB,EAAE,UAAU,CAAC,CAAC;QAC1E,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,wGAAwG;IAChG,iBAAiB,CAAC,KAAe,EAAE,KAAe;QACxD,IAAI,MAAM,GAAG,KAAK,CAAC;QACnB,GAAG;YACD,IAAI,QAAQ,CAAC,qBAAqB,CAAC,KAAK,EAAE,MAAM,CAAC;gBAC/C,OAAO,MAAM,CAAC;YAChB,MAAM,GAAG,MAAM,CAAC,eAAe,CAAC;SACjC,QAAQ,MAAM,KAAK,KAAK,EAAE;QAC3B,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;OAKG;IACK,SAAS,CAAC,KAAe,EAAE,KAAe,EAAE,SAAiB;QACnE,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACtG,MAAM,MAAM,GAAG,IAAI,CAAC,iBAAiB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QACpD,MAAM,MAAM,GAAG,IAAI,CAAC,iBAAiB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QACpD,IAAI,MAAM,KAAK,SAAS,IAAI,MAAM,KAAK,SAAS,EAAE;YAChD,QAAQ,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;YAC9B,QAAQ,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,QAAQ,CAAC,CAAC;YACvC,IAAI,qBAAqB,CAAC,YAAY;gBACpC,qBAAqB,CAAC,YAAY,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;YAC1E,OAAO,KAAK,CAAC;SACd;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;;;;OAUG;IACK,iBAAiB,CAAC,UAAmB,IAAI,EAAE,YAAqB,IAAI;QAC1E,IAAI,OAAO,EAAE;YACX,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,gBAAgB,CAAC,gBAAgB,CAAC,CAAC;YACzD,KAAK,MAAM,UAAU,IAAI,IAAI,CAAC,WAAW,EAAE;gBACzC,sEAAsE;gBACtE,IAAI,CAAC,gBAAgB,CAAC,UAAU,CAAC,UAAU,CAAC;oBAC1C,SAAS;gBACX,MAAM,MAAM,GAAG,IAAI,CAAC,gCAAgC,CAAC,UAAU,CAAC,CAAC;gBACjE,IAAI,MAAM,KAAK,SAAS,EAAE;oBACxB,qGAAqG;oBACrG,IAAI,CAAC,SAAS,CAAC,UAAU,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC;iBACvC;aACF;SACF;QACD,IAAI,SAAS,EAAE;YACb,8BAA8B;YAC9B,IAAI,CAAC,QAAQ,EAAE,CAAC;YAChB,yCAAyC;YACzC,IAAI,CAAC,UAAU,EAAE,CAAC;YAClB,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,gBAAgB,CAAC,gBAAgB,CAAC,CAAC;YACzD,KAAK,MAAM,UAAU,IAAI,IAAI,CAAC,WAAW,EAAE;gBACzC,IAAI,CAAC,gBAAgB,CAAC,UAAU,CAAC,UAAU,CAAC;oBAC1C,SAAS;gBACX,MAAM,MAAM,GAAG,IAAI,CAAC,gCAAgC,CAAC,UAAU,CAAC,CAAC;gBACjE,IAAI,MAAM,KAAK,SAAS,EAAE;oBACxB,IAAI,CAAC,SAAS,CAAC,UAAU,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC;iBACxC;aACF;YACD,IAAI,CAAC,QAAQ,EAAE,CAAC;YAChB,IAAI,CAAC,UAAU,EAAE,CAAC;SACnB;IACH,CAAC;IAED;;;;;;;;;;OAUG;IACI,cAAc,CAAC,QAAkB,EAAE,UAAmB,IAAI,EAAE,YAAqB,IAAI;QAC1F,IAAI,CAAC,+BAA+B,CAAC,QAAQ,CAAC,CAAC;QAC/C,IAAI,CAAC,iBAAiB,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;IAC7C,CAAC;IAEM,eAAe,CAAC,UAAmB,IAAI,EAAE,YAAqB,IAAI;QACvE,IAAI,CAAC,uCAAuC,CAAC,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;QACtE,IAAI,CAAC,iBAAiB,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;IAC7C,CAAC;IAED,yEAAyE;IAClE,MAAM,CAAC,cAAc,CAAC,IAAc;QACzC,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,IAAI,OAA6B,CAAC;QAClC,IAAI,KAAK,GAAG,IAAI,CAAC;QACjB,GAAG;YACD,MAAM,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;YAClC,MAAM,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;YAClC,MAAM,EAAE,GAAG,gBAAgB,CAAC,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;YAC3D,MAAM,EAAE,GAAG,gBAAgB,CAAC,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;YAC3D,IAAI,EAAE,GAAG,EAAE,IAAI,CAAC,EAAE;gBAChB,IAAI,EAAE,GAAG,CAAC,EAAE;oBACV,MAAM,EAAE,CAAC;oBACT,OAAO,GAAG,KAAK,CAAC;iBACjB;gBACD,IAAI,EAAE,GAAG,CAAC,EAAE;oBACV,MAAM,EAAE,CAAC;iBACV;aACF;SACF,QAAQ,CAAC,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC,KAAK,IAAI,EAAE;QACjD,OAAO,MAAM,KAAK,CAAC,IAAI,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC;IAC5D,CAAC;IACD;;;;;;OAMG;IACI,MAAM,CAAC,gCAAgC,CAC5C,KAAoB,EACpB,gBAAyB,EACzB,MAAgD,EAChD,WAAmC,EACnC,aAAqC;QACrC,IAAI,WAAW;YACb,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;QACzB,IAAI,aAAa;YACf,aAAa,CAAC,MAAM,GAAG,CAAC,CAAC;QAC3B,MAAM,IAAI,GAAG,YAAY,CAAC,OAAO,CAAC;QAClC,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;QACtB,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,YAAY,EAAE;YACrC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;gBACvB,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;gBAC7B,IAAI,CAAC,gBAAgB,IAAI,IAAI,CAAC,cAAc,EAAE,GAAG,CAAC,EAAE;oBAClD,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;oBAC1B,IAAI,IAAI,EAAE;wBACR,IAAI,WAAW;4BACb,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;qBAC1B;yBAAM;wBACL,IAAI,aAAa;4BACf,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;qBAC5B;iBACF;aACF;SACF;IACH,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 { HalfEdge, HalfEdgeGraph, HalfEdgeMask } from \"./Graph\";\nimport { HalfEdgeGraphOps } from \"./Merging\";\n\n//   /* eslint-disable no-console */\n/**\n * * Context for regularizing single faces.\n * @internal\n */\nexport class RegularizationContext {\n  // For debugging use ... \"almost always\" undefined.\n  // If defined, it is called with each inserted node pair.\n  // scale will be either plus or minus one.\n  // when it is negative, the node coordinates (both x and y) have been negated.\n  // The call is made after full insertion into vertex loop.\n  public static announceEdge?: (graph: HalfEdgeGraph, nodeA: HalfEdge, nodeB: HalfEdge, scale: number) => void;\n  public constructor(graph: HalfEdgeGraph) {\n    this.graph = graph;\n    this.upEdges = [];\n    this.downEdges = [];\n    this.bottomPeaks = [];\n    this.topPeaks = [];\n    this.localMin = [];\n    this.localMax = [];\n  }\n\n  /**\n   * These are public only for testing.\n   */\n  public graph: HalfEdgeGraph;\n  /** array of edges directed upward.  Turn can be left or right, but is not large enough to be a min or max */\n  public upEdges: HalfEdge[];\n  /** array of edges directed downward, Turn can be left or right, but is not large enough to be a min or max */\n  public downEdges: HalfEdge[];\n  /** Array of edges whose start is an upward peak (right turn, inbound up, outbound down) */\n  public topPeaks: HalfEdge[];\n  /** Array of edges whose start is an downward peak (right turn, inbound down, outbound up) */\n  public bottomPeaks: HalfEdge[];\n\n  /** Array of edges at local minima (left turn, inbound down, outbound up).  Ensuing chain is up */\n  public localMin: HalfEdge[];\n  /** Array of edges at local maxima (left turn, inbound up, outbound down).  Ensuing chain is down */\n  public localMax: HalfEdge[];\n  /**\n   * Collect (and classify) all the edges around a single face.\n   * * The various arrays are collected: upEdges, downEdges, topPeaks, bottomPeaks, upChains, downChains\n   * @param faceSeed face to examine\n   */\n  public collectVerticalEventsAroundFace(faceSeed: HalfEdge) {\n    let nodeA = faceSeed;\n    let nodeB;\n    let nodeC;\n    let abUp;\n    let bcUp;\n    this.upEdges.length = 0;\n    this.downEdges.length = 0;\n    this.topPeaks.length = 0;\n    this.bottomPeaks.length = 0;\n    this.localMin.length = 0;\n    this.localMax.length = 0;\n    do {\n      nodeB = nodeA.faceSuccessor;\n      nodeC = nodeB.faceSuccessor;\n      abUp = HalfEdgeGraphOps.compareNodesYXUp(nodeA, nodeB) < 0;\n      bcUp = HalfEdgeGraphOps.compareNodesYXUp(nodeB, nodeC) < 0;\n      if (abUp) {\n        this.upEdges.push(nodeA);\n        if (!bcUp) {\n          if (HalfEdgeGraphOps.crossProductToTargets(nodeB, nodeA, nodeC) < 0)\n            this.localMax.push(nodeB);\n          else\n            this.topPeaks.push(nodeB);\n        }\n\n      } else { // ab is DOWN\n        this.downEdges.push(nodeA);\n        if (bcUp) {\n          if (HalfEdgeGraphOps.crossProductToTargets(nodeB, nodeA, nodeC) > 0)\n            this.bottomPeaks.push(nodeB);\n          else\n            this.localMin.push(nodeB);\n        }\n      }\n      nodeA = nodeB;\n    } while (nodeA !== faceSeed);\n  }\n\n  /**\n   * Collect (and classify) all the edges in an array.\n   * * The various arrays are collected: upEdges, downEdges, topPeaks, bottomPeaks, upChains, downChains\n   * @param candidateEdges array of edges.\n   */\n  public collectVerticalEventFromEdgesInAndArray(candidateEdges: HalfEdge[]) {\n    let nodeA;\n    let nodeB;\n    let nodeC;\n    let abUp;\n    let bcUp;\n    this.upEdges.length = 0;\n    this.downEdges.length = 0;\n    this.topPeaks.length = 0;\n    this.bottomPeaks.length = 0;\n    this.localMin.length = 0;\n    this.localMax.length = 0;\n    for (nodeA of candidateEdges) {\n      nodeB = nodeA.faceSuccessor;\n      nodeC = nodeB.faceSuccessor;\n      abUp = HalfEdgeGraphOps.compareNodesYXUp(nodeA, nodeB) < 0;\n      bcUp = HalfEdgeGraphOps.compareNodesYXUp(nodeB, nodeC) < 0;\n      if (abUp) {\n        this.upEdges.push(nodeA);\n        if (!bcUp) {\n          if (HalfEdgeGraphOps.crossProductToTargets(nodeB, nodeA, nodeC) < 0)\n            this.localMax.push(nodeB);\n          else\n            this.topPeaks.push(nodeB);\n        }\n\n      } else { // ab is DOWN\n        this.downEdges.push(nodeA);\n        if (bcUp) {\n          if (HalfEdgeGraphOps.crossProductToTargets(nodeB, nodeA, nodeC) > 0)\n            this.bottomPeaks.push(nodeB);\n          else\n            this.localMin.push(nodeB);\n        }\n      }\n    }\n  }\n\n  private swapArrays() {\n    let save = this.downEdges; this.downEdges = this.upEdges; this.upEdges = save;\n    save = this.localMax; this.localMax = this.localMin; this.localMin = save;\n    save = this.topPeaks; this.topPeaks = this.bottomPeaks; this.bottomPeaks = save;\n  }\n\n  /**\n   * Find the edge (among candidates) which is first struck by a \"rightward\" scan from node\n   * * comparisonFunction determines scan sense\n   *   * HalfEdge.compareNodeYXTheta is an upward scan.\n   *   * HalfEdge.compareNodeYXThetaDownward is a downward scan.\n   * @param node\n   * @param candidates Array of nodes to search\n   * @param nodeComparisonFunction function for lexical comparison.\n   */\n  private findTopVisibleEdge(node: HalfEdge, candidates: HalfEdge[],\n    directionSign: number) {\n    const y0 = node.y;\n    const x0 = node.x;\n    let dx;\n    let distanceRight = Number.MAX_SAFE_INTEGER;\n    let result: HalfEdge | undefined;\n    for (const rightBase of candidates) {\n      const rightTop = rightBase.faceSuccessor;\n      if (rightBase === node || rightTop === node)\n        continue;\n      // for horizontal edge cases -- require edges ends to have strict sign change (no zeros!!)\n      const cRight = HalfEdgeGraphOps.compareNodesYXUp(node, rightBase);\n      const cTop = HalfEdgeGraphOps.compareNodesYXUp(node, rightTop);\n      // console.log(node.id, rightBase.id, rightTop.id, cRight, cTop);\n      if (cRight * cTop >= 0)\n        continue;\n      const fraction = HalfEdge.horizontalScanFraction01(rightBase, y0);\n      if (fraction !== undefined) {\n        dx = directionSign * (rightBase.fractionToX(fraction) - x0);\n        if (dx > 0 && dx < distanceRight) {\n          result = rightBase;\n          distanceRight = dx;\n        }\n      }\n    }\n    return result;\n  }\n  /**\n   *\n   * @param downPeak a \"bottom\" node where the interior CCW loop has a local min\n   * @param downEdgeStart (optional) node at the start (heading downwards!) of an edge that brackets downPeak on the left.\n   * @param upEdgeStart  (optional) node at the start (heading up!) of the edge that brackets downPeak on the right.\n   */\n  private highestUpPeakConnection(downPeak: HalfEdge, downEdgeStart: HalfEdge | undefined, upEdgeStart: HalfEdge | undefined): HalfEdge | undefined {\n    let highestPeak;\n\n    for (const upPeak of this.topPeaks) {\n      const y0 = upPeak.y;\n      const x0 = upPeak.x;\n      // is upPeak higher than prior upPeak?\n      if (highestPeak !== undefined && HalfEdgeGraphOps.compareNodesYXUp(upPeak, highestPeak) < 0)\n        continue;\n      // is upPeak BELOW downPeak, ABOVE both limit edges lower node, and between limit edge interiors.\n      if (HalfEdgeGraphOps.compareNodesYXUp(upPeak, downPeak) < 0) {\n        if (downEdgeStart) {\n          const fraction = HalfEdge.horizontalScanFraction01(downEdgeStart, y0);\n          if (fraction === undefined)\n            continue;\n          if (x0 <= downEdgeStart.fractionToX(fraction))\n            continue;\n        }\n        if (upEdgeStart) {\n          const fraction = HalfEdge.horizontalScanFraction01(upEdgeStart, y0);\n          if (fraction === undefined)\n            continue;\n          if (upEdgeStart.fractionToX(fraction) <= x0)\n            continue;\n        }\n        highestPeak = upPeak;\n      }\n    }\n    return highestPeak;\n  }\n\n  private updateMaxNode(maxNode: HalfEdge | undefined, candidate: HalfEdge | undefined, compare: (a: HalfEdge, b: HalfEdge) => number): HalfEdge | undefined {\n    if (!maxNode)\n      return candidate;\n    if (!candidate)\n      return maxNode;\n    // both are defined .. look for positive compare ...\n    if (compare(maxNode, candidate) < 0)\n      return candidate;\n    return maxNode;\n  }\n  private negateXY() {\n    for (const node of this.graph.allHalfEdges) {\n      node.x *= -1;\n      node.y *= -1;\n    }\n  }\n  private downwardConnectionFromBottomPeak(node: HalfEdge): HalfEdge | undefined {\n    let connectTo;\n    const upFunction = HalfEdgeGraphOps.compareNodesYXUp;\n    const upEdgeBase = this.findTopVisibleEdge(node, this.upEdges, 1.0)!;\n    const downEdgeBase = this.findTopVisibleEdge(node, this.downEdges, -1.0)!;\n    connectTo = this.updateMaxNode(connectTo, upEdgeBase, upFunction);\n    if (downEdgeBase)\n      connectTo = this.updateMaxNode(connectTo, downEdgeBase.faceSuccessor, upFunction);\n    const upPeakConnection = this.highestUpPeakConnection(node, downEdgeBase, upEdgeBase);\n    if (upPeakConnection !== undefined)\n      connectTo = this.updateMaxNode(connectTo, upPeakConnection, upFunction);\n    return connectTo;\n  }\n  /** Search around the vertex of nodeA for a nodeA1 such that nodeB is visible in the sector at nodeA1 */\n  private findVisibleSector(nodeA: HalfEdge, nodeB: HalfEdge): HalfEdge | undefined {\n    let nodeA1 = nodeA;\n    do {\n      if (HalfEdge.isNodeVisibleInSector(nodeB, nodeA1))\n        return nodeA1;\n      nodeA1 = nodeA1.vertexSuccessor;\n    } while (nodeA1 !== nodeA);\n    return undefined;\n  }\n  /**\n   * Create an edge from (some node around the vertex of) nodeA to (some node around the vertex of) nodeB.\n   * * looking around the vertex for alternate insertion corrects cusp insertion errors.\n   * @param nodeA\n   * @param nodeB\n   */\n  private joinNodes(nodeA: HalfEdge, nodeB: HalfEdge, direction: number): HalfEdge | undefined {\n    const nodeC = this.graph.createEdgeXYZXYZ(nodeA.x, nodeA.y, nodeA.z, 0, nodeB.x, nodeB.y, nodeB.z, 0);\n    const nodeA1 = this.findVisibleSector(nodeA, nodeB);\n    const nodeB1 = this.findVisibleSector(nodeB, nodeA);\n    if (nodeA1 !== undefined && nodeB1 !== undefined) {\n      HalfEdge.pinch(nodeA1, nodeC);\n      HalfEdge.pinch(nodeB1, nodeC.edgeMate);\n      if (RegularizationContext.announceEdge)\n        RegularizationContext.announceEdge(this.graph, nodeA, nodeB, direction);\n      return nodeC;\n    }\n    return undefined;\n  }\n  /**\n   * Regularize a single face.\n   * * Insert edge from any downward interior vertex to something lower\n   * * Insert an edge from each upward interior vertex to something higher.\n   * * The face is split into smaller faces\n   * * Each final face has at most one \"min\" and one \"max\", and is easy to triangulate with a bottom to top sweep.\n   * * Normal usage is to sweep in both directions, i.e. use the default (true,true) for the upSweep and downSweep parameters.\n   * @param faceSeed any representative half edge on the face\n   * @param upSweep true to do the upward sweep.\n   * @param downSweep true to do the downward sweep.\n   */\n  private runRegularization(upSweep: boolean = true, downSweep: boolean = true) {\n    if (upSweep) {\n      this.bottomPeaks.sort(HalfEdgeGraphOps.compareNodesYXUp);\n      for (const bottomPeak of this.bottomPeaks) {\n        // console.log(\"SEARCH\", bottomPeak.id, [bottomPeak.x, bottomPeak.y]);\n        if (!HalfEdgeGraphOps.isDownPeak(bottomPeak))\n          continue;\n        const target = this.downwardConnectionFromBottomPeak(bottomPeak);\n        if (target !== undefined) {\n          // console.log(\"join\", bottomPeak.id, [bottomPeak.x, bottomPeak.y], target.id, [target.x, target.y]);\n          this.joinNodes(bottomPeak, target, 1);\n        }\n      }\n    }\n    if (downSweep) {\n      // flip the whole graph (ouch)\n      this.negateXY();\n      // swap the various p and down seeds ....\n      this.swapArrays();\n      this.bottomPeaks.sort(HalfEdgeGraphOps.compareNodesYXUp);\n      for (const bottomPeak of this.bottomPeaks) {\n        if (!HalfEdgeGraphOps.isDownPeak(bottomPeak))\n          continue;\n        const target = this.downwardConnectionFromBottomPeak(bottomPeak);\n        if (target !== undefined) {\n          this.joinNodes(bottomPeak, target, -1);\n        }\n      }\n      this.negateXY();\n      this.swapArrays();\n    }\n  }\n\n  /**\n   * Regularize a single face.\n   * * Insert edge from any downward interior vertex to something lower\n   * * Insert an edge from each upward interior vertex to something higher.\n   * * The face is split into smaller faces\n   * * Each final face has at most one \"min\" and one \"max\", and is easy to triangulate with a bottom to top sweep.\n   * * Normal usage is to sweep in both directions, i.e. use the default (true,true) for the upSweep and downSweep parameters.\n   * @param faceSeed any representative half edge on the face\n   * @param upSweep true to do the upward sweep.\n   * @param downSweep true to do the downward sweep.\n   */\n  public regularizeFace(faceSeed: HalfEdge, upSweep: boolean = true, downSweep: boolean = true) {\n    this.collectVerticalEventsAroundFace(faceSeed);\n    this.runRegularization(upSweep, downSweep);\n  }\n\n  public regularizeGraph(upSweep: boolean = true, downSweep: boolean = true) {\n    this.collectVerticalEventFromEdgesInAndArray(this.graph.allHalfEdges);\n    this.runRegularization(upSweep, downSweep);\n  }\n\n  /** test if a single face is monotone;  if so, return its (single) min */\n  public static isMonotoneFace(seed: HalfEdge): HalfEdge | undefined {\n    let numMin = 0;\n    let numMax = 0;\n    let nodeMin: HalfEdge | undefined;\n    let nodeA = seed;\n    do {\n      const nodeB = nodeA.faceSuccessor;\n      const nodeC = nodeB.faceSuccessor;\n      const ab = HalfEdgeGraphOps.compareNodesYXUp(nodeA, nodeB);\n      const bc = HalfEdgeGraphOps.compareNodesYXUp(nodeB, nodeC);\n      if (ab * bc <= 0) {\n        if (ab > 0) {\n          numMin++;\n          nodeMin = nodeB;\n        }\n        if (bc > 0) {\n          numMax++;\n        }\n      }\n    } while ((nodeA = nodeA.faceSuccessor) !== seed);\n    return numMin === 1 && numMax === 1 ? nodeMin : undefined;\n  }\n  /** Return faces filtered by area and test function.\n   * * find one arbitrary representative of each face\n   * * offer the candidate to the mutate function.\n   * * collect results\n   * @param mappedSeeds when filter returns a HalfEdge, collect it here\n   * @param unmappedSeeds when filter does not return a half edge, collect the candidate.\n   */\n  public static collectMappedFaceRepresentatives(\n    graph: HalfEdgeGraph,\n    positiveAreaOnly: boolean,\n    mutate: (seed: HalfEdge) => HalfEdge | undefined,\n    mappedEdges: HalfEdge[] | undefined,\n    unMappedSeeds: HalfEdge[] | undefined) {\n    if (mappedEdges)\n      mappedEdges.length = 0;\n    if (unMappedSeeds)\n      unMappedSeeds.length = 0;\n    const mask = HalfEdgeMask.VISITED;\n    graph.clearMask(mask);\n    for (const seed of graph.allHalfEdges) {\n      if (!seed.getMask(mask)) {\n        seed.setMaskAroundFace(mask);\n        if (!positiveAreaOnly || seed.signedFaceArea() > 0) {\n          const edge = mutate(seed);\n          if (edge) {\n            if (mappedEdges)\n              mappedEdges.push(edge);\n          } else {\n            if (unMappedSeeds)\n              unMappedSeeds.push(seed);\n          }\n        }\n      }\n    }\n  }\n\n}\n"]}

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

@@ -0,0 +1,37 @@
+/** @packageDocumentation
+ * @module Topology
+ */
+/**
+ * Class to accumulate statistics about a stream of signed numbers with tag items.
+ * * All sums, counts, extrema, and item values are initialized to zero in the constructor.
+ * * Each call to `announceItem (item, value)` updates the various sums, counts, and extrema.
+ */
+export declare class SignedDataSummary<T> {
+    /** sum of all positive area items */
+    positiveSum: number;
+    /** number of positive area items */
+    numPositive: number;
+    /** sum of negative area items */
+    negativeSum: number;
+    /** number of negative area items */
+    numNegative: number;
+    /** number of zero area items */
+    numZero: number;
+    /** the tag item item with the largest positive data */
+    largestPositiveItem?: T;
+    /** the tag item item with the most negative data */
+    largestNegativeItem?: T;
+    largestPositiveValue: number;
+    largestNegativeValue: number;
+    /** array of all negative area items */
+    negativeItemArray?: T[];
+    /** array of zero area items */
+    zeroItemArray?: T[];
+    /** array of positive area items */
+    positiveItemArray?: T[];
+    /** setup with zero sums and optional arrays */
+    constructor(createArrays: boolean);
+    /** update with an item and its data value. */
+    announceItem(item: T, data: number): void;
+}
+//# sourceMappingURL=SignedDataSummary.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"SignedDataSummary.d.ts","sourceRoot":"","sources":["../../../src/topology/SignedDataSummary.ts"],"names":[],"mappings":"AAKA;;GAEG;AACH;;;;GAIG;AACH,qBAAa,iBAAiB,CAAC,CAAC;IAC9B,qCAAqC;IAC9B,WAAW,EAAE,MAAM,CAAC;IAC3B,oCAAoC;IAC7B,WAAW,EAAE,MAAM,CAAC;IAC3B,iCAAiC;IAC1B,WAAW,EAAE,MAAM,CAAC;IAC3B,oCAAoC;IAC7B,WAAW,EAAE,MAAM,CAAC;IAC3B,gCAAgC;IACzB,OAAO,EAAE,MAAM,CAAC;IACvB,uDAAuD;IAChD,mBAAmB,CAAC,EAAE,CAAC,CAAC;IAC/B,oDAAoD;IAC7C,mBAAmB,CAAC,EAAE,CAAC,CAAC;IACxB,oBAAoB,EAAE,MAAM,CAAC;IAC7B,oBAAoB,EAAE,MAAM,CAAC;IACpC,uCAAuC;IAChC,iBAAiB,CAAC,EAAE,CAAC,EAAE,CAAC;IAC/B,+BAA+B;IACxB,aAAa,CAAC,EAAE,CAAC,EAAE,CAAC;IAC3B,mCAAmC;IAC5B,iBAAiB,CAAC,EAAE,CAAC,EAAE,CAAC;IAC/B,+CAA+C;gBAC5B,YAAY,EAAE,OAAO;IAUxC,8CAA8C;IACvC,YAAY,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM;CAyB1C"}

package/lib/esm/topology/SignedDataSummary.js

@@ -0,0 +1,54 @@
+/*---------------------------------------------------------------------------------------------
+* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+* See LICENSE.md in the project root for license terms and full copyright notice.
+*--------------------------------------------------------------------------------------------*/
+/** @packageDocumentation
+ * @module Topology
+ */
+/**
+ * Class to accumulate statistics about a stream of signed numbers with tag items.
+ * * All sums, counts, extrema, and item values are initialized to zero in the constructor.
+ * * Each call to `announceItem (item, value)` updates the various sums, counts, and extrema.
+ */
+export class SignedDataSummary {
+    /** setup with zero sums and optional arrays */
+    constructor(createArrays) {
+        this.positiveSum = this.negativeSum = 0.0;
+        this.numPositive = this.numNegative = this.numZero = 0.0;
+        this.largestPositiveValue = this.largestNegativeValue = 0.0;
+        if (createArrays) {
+            this.negativeItemArray = [];
+            this.positiveItemArray = [];
+            this.zeroItemArray = [];
+        }
+    }
+    /** update with an item and its data value. */
+    announceItem(item, data) {
+        if (data < 0) {
+            this.numNegative++;
+            this.negativeSum += data;
+            if (this.negativeItemArray)
+                this.negativeItemArray.push(item);
+            if (data < this.largestNegativeValue) {
+                this.largestNegativeValue = data;
+                this.largestNegativeItem = item;
+            }
+        }
+        else if (data > 0) {
+            this.numPositive++;
+            this.positiveSum += data;
+            if (this.positiveItemArray)
+                this.positiveItemArray.push(item);
+            if (data > this.largestPositiveValue) {
+                this.largestPositiveValue = data;
+                this.largestPositiveItem = item;
+            }
+        }
+        else {
+            this.numZero++;
+            if (this.zeroItemArray)
+                this.zeroItemArray.push(item);
+        }
+    }
+}
+//# sourceMappingURL=SignedDataSummary.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"SignedDataSummary.js","sourceRoot":"","sources":["../../../src/topology/SignedDataSummary.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AACH;;;;GAIG;AACH,MAAM,OAAO,iBAAiB;IAuB5B,+CAA+C;IAC/C,YAAmB,YAAqB;QACtC,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW,GAAG,GAAG,CAAC;QAC1C,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,OAAO,GAAG,GAAG,CAAC;QACzD,IAAI,CAAC,oBAAoB,GAAG,IAAI,CAAC,oBAAoB,GAAG,GAAG,CAAC;QAC5D,IAAI,YAAY,EAAE;YAChB,IAAI,CAAC,iBAAiB,GAAG,EAAE,CAAC;YAC5B,IAAI,CAAC,iBAAiB,GAAG,EAAE,CAAC;YAC5B,IAAI,CAAC,aAAa,GAAG,EAAE,CAAC;SACzB;IACH,CAAC;IACD,8CAA8C;IACvC,YAAY,CAAC,IAAO,EAAE,IAAY;QACvC,IAAI,IAAI,GAAG,CAAC,EAAE;YACZ,IAAI,CAAC,WAAW,EAAE,CAAC;YACnB,IAAI,CAAC,WAAW,IAAI,IAAI,CAAC;YACzB,IAAI,IAAI,CAAC,iBAAiB;gBACxB,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACpC,IAAI,IAAI,GAAG,IAAI,CAAC,oBAAoB,EAAE;gBACpC,IAAI,CAAC,oBAAoB,GAAG,IAAI,CAAC;gBACjC,IAAI,CAAC,mBAAmB,GAAG,IAAI,CAAC;aACjC;SACF;aAAM,IAAI,IAAI,GAAG,CAAC,EAAE;YACnB,IAAI,CAAC,WAAW,EAAE,CAAC;YACnB,IAAI,CAAC,WAAW,IAAI,IAAI,CAAC;YACzB,IAAI,IAAI,CAAC,iBAAiB;gBACxB,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACpC,IAAI,IAAI,GAAG,IAAI,CAAC,oBAAoB,EAAE;gBACpC,IAAI,CAAC,oBAAoB,GAAG,IAAI,CAAC;gBACjC,IAAI,CAAC,mBAAmB,GAAG,IAAI,CAAC;aACjC;SACF;aAAM;YACL,IAAI,CAAC,OAAO,EAAE,CAAC;YACf,IAAI,IAAI,CAAC,aAAa;gBACpB,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;SACjC;IACH,CAAC;CACF","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\n\r\n/** @packageDocumentation\r\n * @module Topology\r\n */\r\n/**\r\n * Class to accumulate statistics about a stream of signed numbers with tag items.\r\n * * All sums, counts, extrema, and item values are initialized to zero in the constructor.\r\n * * Each call to `announceItem (item, value)` updates the various sums, counts, and extrema.\r\n */\r\nexport class SignedDataSummary<T> {\r\n  /** sum of all positive area items */\r\n  public positiveSum: number;\r\n  /** number of positive area items */\r\n  public numPositive: number;\r\n  /** sum of negative area items */\r\n  public negativeSum: number;\r\n  /** number of negative area items */\r\n  public numNegative: number;\r\n  /** number of zero area items */\r\n  public numZero: number;\r\n  /** the tag item item with the largest positive data */\r\n  public largestPositiveItem?: T;\r\n  /** the tag item item with the most negative data */\r\n  public largestNegativeItem?: T;\r\n  public largestPositiveValue: number;\r\n  public largestNegativeValue: number;\r\n  /** array of all negative area items */\r\n  public negativeItemArray?: T[];\r\n  /** array of zero area items */\r\n  public zeroItemArray?: T[];\r\n  /** array of positive area items */\r\n  public positiveItemArray?: T[];\r\n  /** setup with zero sums and optional arrays */\r\n  public constructor(createArrays: boolean) {\r\n    this.positiveSum = this.negativeSum = 0.0;\r\n    this.numPositive = this.numNegative = this.numZero = 0.0;\r\n    this.largestPositiveValue = this.largestNegativeValue = 0.0;\r\n    if (createArrays) {\r\n      this.negativeItemArray = [];\r\n      this.positiveItemArray = [];\r\n      this.zeroItemArray = [];\r\n    }\r\n  }\r\n  /** update with an item and its data value. */\r\n  public announceItem(item: T, data: number) {\r\n    if (data < 0) {\r\n      this.numNegative++;\r\n      this.negativeSum += data;\r\n      if (this.negativeItemArray)\r\n        this.negativeItemArray.push(item);\r\n      if (data < this.largestNegativeValue) {\r\n        this.largestNegativeValue = data;\r\n        this.largestNegativeItem = item;\r\n      }\r\n    } else if (data > 0) {\r\n      this.numPositive++;\r\n      this.positiveSum += data;\r\n      if (this.positiveItemArray)\r\n        this.positiveItemArray.push(item);\r\n      if (data > this.largestPositiveValue) {\r\n        this.largestPositiveValue = data;\r\n        this.largestPositiveItem = item;\r\n      }\r\n    } else {\r\n      this.numZero++;\r\n      if (this.zeroItemArray)\r\n        this.zeroItemArray.push(item);\r\n    }\r\n  }\r\n}\r\n"]}