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

package/lib/esm/topology/HalfEdgePriorityQueue.js

@@ -0,0 +1,68 @@
+/*---------------------------------------------------------------------------------------------
+* 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 { PriorityQueue } from "@itwin/core-bentley";
+import { HalfEdgeGraphOps } from "./Merging";
+/**
+ * * Combination of a priority queue of HalfEdges with
+ * * Additional "active" array to carry edges that have been removed from the queue but are still to be
+ *    inspected (possibly many times)
+ * * The priority queue default sort is Y-then-X lexical sort.
+ * * Caller has direct access to the queue and array.
+ * * Methods are added here only to do things that involve both the queue and the array.
+ * @internal
+ */
+export class HalfEdgePriorityQueueWithPartnerArray {
+    constructor(compare = HalfEdgeGraphOps.compareNodesYXUp) {
+        this.priorityQueue = new PriorityQueue(compare);
+        this.activeEdges = [];
+    }
+    /** Read a member from the queue and transfer to the active array. */
+    popQueueToArray() {
+        if (this.priorityQueue.isEmpty)
+            return undefined;
+        const x = this.priorityQueue.pop();
+        this.activeEdges.push(x);
+        return x;
+    }
+    /** Pop the last entry and put it back as replacement for current entry at index i.
+     * * Effectively remove active member at index i
+     * * The array order is changed.
+     * * constant time.
+     */
+    popArrayToArrayIndex(i) {
+        const n = this.activeEdges.length;
+        if (i < n) {
+            const x = this.activeEdges.pop();
+            this.activeEdges[i] = x;
+        }
+    }
+    /**
+     * * Scan the active array.
+     * * remove edges whose top y is below y
+     * * (pack all remaining ones back towards the beginning)
+     */
+    removeArrayMembersWithY1Below(y) {
+        let numKeep = 0;
+        const n = this.activeEdges.length;
+        for (let i = 0; i < n; i++) {
+            const q = this.activeEdges[i];
+            const yB = q.faceSuccessor.y;
+            if (yB >= y) {
+                // copy [i] forward to [target]
+                if (numKeep < i)
+                    this.activeEdges[numKeep] = q;
+                numKeep++;
+            }
+            else {
+                // let it go by !!!
+            }
+        }
+        this.activeEdges.length = numKeep;
+    }
+}
+//# sourceMappingURL=HalfEdgePriorityQueue.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"HalfEdgePriorityQueue.js","sourceRoot":"","sources":["../../../src/topology/HalfEdgePriorityQueue.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AACH,OAAO,EAAqB,aAAa,EAAE,MAAM,qBAAqB,CAAC;AAEvE,OAAO,EAAE,gBAAgB,EAAE,MAAM,WAAW,CAAC;AAE7C;;;;;;;;GAQG;AACH,MAAM,OAAO,qCAAqC;IAGhD,YACE,UAAuC,gBAAgB,CAAC,gBAAgB;QACxE,IAAI,CAAC,aAAa,GAAG,IAAI,aAAa,CAAC,OAAO,CAAC,CAAC;QAChD,IAAI,CAAC,WAAW,GAAG,EAAE,CAAC;IACxB,CAAC;IACD,qEAAqE;IAC9D,eAAe;QACpB,IAAI,IAAI,CAAC,aAAa,CAAC,OAAO;YAC5B,OAAO,SAAS,CAAC;QACnB,MAAM,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,EAAG,CAAC;QACpC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzB,OAAO,CAAC,CAAC;IACX,CAAC;IACD;;;;OAIG;IACI,oBAAoB,CAAC,CAAS;QACnC,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC;QAClC,IAAI,CAAC,GAAG,CAAC,EAAE;YACT,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,EAAG,CAAC;YAClC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;SACzB;IACH,CAAC;IACD;;;;OAIG;IACI,6BAA6B,CAAC,CAAS;QAC5C,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC;QAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;YAC9B,MAAM,EAAE,GAAG,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC;YAC7B,IAAI,EAAE,IAAI,CAAC,EAAE;gBACX,+BAA+B;gBAC/B,IAAI,OAAO,GAAG,CAAC;oBACb,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;gBAChC,OAAO,EAAE,CAAC;aACX;iBAAM;gBACL,mBAAmB;aACpB;SACF;QACD,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,OAAO,CAAC;IACpC,CAAC;CACF","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 */\nimport { OrderedComparator, PriorityQueue } from \"@itwin/core-bentley\";\nimport { HalfEdge } from \"./Graph\";\nimport { HalfEdgeGraphOps } from \"./Merging\";\n\n/**\n * * Combination of a priority queue of HalfEdges with\n * * Additional \"active\" array to carry edges that have been removed from the queue but are still to be\n *    inspected (possibly many times)\n * * The priority queue default sort is Y-then-X lexical sort.\n * * Caller has direct access to the queue and array.\n * * Methods are added here only to do things that involve both the queue and the array.\n * @internal\n */\nexport class HalfEdgePriorityQueueWithPartnerArray {\n  public priorityQueue: PriorityQueue<HalfEdge>;\n  public activeEdges: HalfEdge[];\n  public constructor(\n    compare: OrderedComparator<HalfEdge> = HalfEdgeGraphOps.compareNodesYXUp) {\n    this.priorityQueue = new PriorityQueue(compare);\n    this.activeEdges = [];\n  }\n  /** Read a member from the queue and transfer to the active array. */\n  public popQueueToArray(): HalfEdge | undefined {\n    if (this.priorityQueue.isEmpty)\n      return undefined;\n    const x = this.priorityQueue.pop()!;\n    this.activeEdges.push(x);\n    return x;\n  }\n  /** Pop the last entry and put it back as replacement for current entry at index i.\n   * * Effectively remove active member at index i\n   * * The array order is changed.\n   * * constant time.\n   */\n  public popArrayToArrayIndex(i: number) {\n    const n = this.activeEdges.length;\n    if (i < n) {\n      const x = this.activeEdges.pop()!;\n      this.activeEdges[i] = x;\n    }\n  }\n  /**\n   * * Scan the active array.\n   * * remove edges whose top y is below y\n   * * (pack all remaining ones back towards the beginning)\n   */\n  public removeArrayMembersWithY1Below(y: number) {\n    let numKeep = 0;\n    const n = this.activeEdges.length;\n    for (let i = 0; i < n; i++) {\n      const q = this.activeEdges[i];\n      const yB = q.faceSuccessor.y;\n      if (yB >= y) {\n        // copy [i] forward to [target]\n        if (numKeep < i)\n          this.activeEdges[numKeep] = q;\n        numKeep++;\n      } else {\n        // let it go by !!!\n      }\n    }\n    this.activeEdges.length = numKeep;\n  }\n}\n"]}

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

@@ -0,0 +1,38 @@
+/** @packageDocumentation
+ * @module Topology
+ */
+import { Point3d } from "../geometry3d/Point3dVector3d";
+import { HalfEdgeGraph } from "./Graph";
+import { HalfEdgePositionDetail } from "./HalfEdgePositionDetail";
+/**
+ * Context for repeated insertion of new points in a graph.
+ * * Initial graph should have clean outer boundary. (e.g. as typically marked with HalfEdgeMask.EXTERIOR)
+ * * After each insertion, the current "position" within the graph is remembered so that each subsequent insertion
+ *     can reuse that position as start for walking to the new point.
+ */
+export declare class InsertAndRetriangulateContext {
+    private _graph;
+    private _edgeSet;
+    private _searcher;
+    private constructor();
+    /** Create a new context referencing the graph. */
+    static create(graph: HalfEdgeGraph): InsertAndRetriangulateContext;
+    /** Query the (pointer to) the graph in the context. */
+    get graph(): HalfEdgeGraph;
+    private retriangulateFromBaseVertex;
+    /** Reset the "current" position to unknown state. */
+    reset(): void;
+    /** Return a (reference to!) the current position in the graph */
+    get currentPosition(): HalfEdgePositionDetail;
+    /**
+     * Linear search through the graph
+     * * Returns a HalfEdgePositionDetail for the nearest edge or vertex.
+     * @param xyz
+     */
+    searchForNearestEdgeOrVertex(xyz: Point3d): HalfEdgePositionDetail;
+    searchForNearestVertex(xyz: Point3d): HalfEdgePositionDetail;
+    resetSearch(xyz: Point3d, maxDim: number): void;
+    insertAndRetriangulate(xyz: Point3d, newZWins: boolean): boolean;
+    moveToPoint(movingPosition: HalfEdgePositionDetail, xyz: Point3d, announcer?: (position: HalfEdgePositionDetail) => boolean): boolean;
+}
+//# sourceMappingURL=InsertAndRetriangulateContext.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"InsertAndRetriangulateContext.d.ts","sourceRoot":"","sources":["../../../src/topology/InsertAndRetriangulateContext.ts"],"names":[],"mappings":"AAIA;;GAEG;AAEH,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AAGxD,OAAO,EAAY,aAAa,EAAgB,MAAM,SAAS,CAAC;AAGhE,OAAO,EAAE,sBAAsB,EAAE,MAAM,0BAA0B,CAAC;AAGlE;;;;;GAKG;AACH,qBAAa,6BAA6B;IACxC,OAAO,CAAC,MAAM,CAAgB;IAC9B,OAAO,CAAC,QAAQ,CAAgB;IAChC,OAAO,CAAC,SAAS,CAAyB;IAK1C,OAAO;IAOP,kDAAkD;WACpC,MAAM,CAAC,KAAK,EAAE,aAAa;IAGzC,uDAAuD;IACvD,IAAW,KAAK,IAAI,aAAa,CAAwB;IAIzD,OAAO,CAAC,2BAA2B;IAenC,qDAAqD;IAC9C,KAAK;IAIZ,iEAAiE;IACjE,IAAW,eAAe,2BAA6B;IACvD;;;;OAIG;IACI,4BAA4B,CAAC,GAAG,EAAE,OAAO,GAAG,sBAAsB;IAkClE,sBAAsB,CAAC,GAAG,EAAE,OAAO,GAAG,sBAAsB;IAc5D,WAAW,CAAC,GAAG,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM;IAMxC,sBAAsB,CAAC,GAAG,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,GAAG,OAAO;IAmChE,WAAW,CAAC,cAAc,EAAE,sBAAsB,EAAE,GAAG,EAAE,OAAO,EAAE,SAAS,CAAC,EAAE,CAAC,QAAQ,EAAE,sBAAsB,KAAK,OAAO,GAAG,OAAO;CAmE7I"}

package/lib/esm/topology/InsertAndRetriangulateContext.js

@@ -0,0 +1,239 @@
+/*---------------------------------------------------------------------------------------------
+* 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 { Point3d } from "../geometry3d/Point3dVector3d";
+import { Ray3d } from "../geometry3d/Ray3d";
+import { SmallSystem } from "../numerics/Polynomials";
+import { HalfEdgeMask } from "./Graph";
+import { MarkedEdgeSet } from "./HalfEdgeMarkSet";
+import { PointSearchContext, RayClassification } from "./HalfEdgePointInGraphSearch";
+import { HalfEdgePositionDetail } from "./HalfEdgePositionDetail";
+import { Triangulator } from "./Triangulation";
+/**
+ * Context for repeated insertion of new points in a graph.
+ * * Initial graph should have clean outer boundary. (e.g. as typically marked with HalfEdgeMask.EXTERIOR)
+ * * After each insertion, the current "position" within the graph is remembered so that each subsequent insertion
+ *     can reuse that position as start for walking to the new point.
+ */
+export class InsertAndRetriangulateContext {
+    // Temporaries used in reAimFromFace
+    // private _lastBefore: HalfEdgePositionDetail;
+    // private _firstAfter: HalfEdgePositionDetail;
+    constructor(graph) {
+        this._graph = graph;
+        this._edgeSet = MarkedEdgeSet.create(graph);
+        this._searcher = HalfEdgePositionDetail.create();
+        // this._lastBefore = HalfEdgePositionDetail.create();
+        // this._firstAfter = HalfEdgePositionDetail.create();
+    }
+    /** Create a new context referencing the graph. */
+    static create(graph) {
+        return new InsertAndRetriangulateContext(graph);
+    }
+    /** Query the (pointer to) the graph in the context. */
+    get graph() { return this._graph; }
+    // Walk face from edgeNode;  insert new edges back to start node from all except
+    //   immediate successor and predecessor.
+    // insert all new nodes, and nodes of the existing face, in edgeSet.
+    retriangulateFromBaseVertex(centralNode) {
+        const numNode = centralNode.countEdgesAroundFace();
+        this._edgeSet.addAroundFace(centralNode);
+        if (numNode < 4 || centralNode.signedFaceArea() <= 0.0)
+            return;
+        const numEdge = numNode - 3;
+        let farNode = centralNode.faceSuccessor;
+        let nearNode = centralNode;
+        for (let i = 0; i < numEdge; i++) {
+            farNode = farNode.faceSuccessor;
+            nearNode = this._graph.createEdgeHalfEdgeHalfEdge(nearNode, 0, farNode, 0);
+            farNode = nearNode.faceSuccessor;
+            this._edgeSet.addToSet(nearNode);
+        }
+    }
+    /** Reset the "current" position to unknown state. */
+    reset() {
+        this._searcher = HalfEdgePositionDetail.create();
+    }
+    /** Return a (reference to!) the current position in the graph */
+    get currentPosition() { return this._searcher; }
+    /**
+     * Linear search through the graph
+     * * Returns a HalfEdgePositionDetail for the nearest edge or vertex.
+     * @param xyz
+     */
+    searchForNearestEdgeOrVertex(xyz) {
+        const position = HalfEdgePositionDetail.create();
+        position.setDTag(Number.MAX_VALUE);
+        const xyzC = Point3d.create();
+        let fractionC;
+        let distanceC;
+        for (const nodeA of this._graph.allHalfEdges) {
+            const nodeB = nodeA.faceSuccessor;
+            fractionC = SmallSystem.lineSegment3dXYClosestPointUnbounded(nodeA, nodeB, xyz);
+            if (fractionC !== undefined) {
+                if (fractionC > 1.0) {
+                    distanceC = xyz.distanceXY(nodeB);
+                    if (distanceC < position.getDTag()) {
+                        position.resetAsVertex(nodeB);
+                        position.setDTag(distanceC);
+                    }
+                }
+                else if (fractionC < 0.0) {
+                    distanceC = xyz.distanceXY(nodeA);
+                    if (distanceC < position.getDTag()) {
+                        position.resetAsVertex(nodeA);
+                        position.setDTag(distanceC);
+                    }
+                }
+                else {
+                    nodeA.fractionToPoint3d(fractionC, xyzC);
+                    distanceC = xyz.distanceXY(xyzC);
+                    if (distanceC < position.getDTag()) {
+                        position.resetAtEdgeAndFraction(nodeA, fractionC);
+                    }
+                }
+            }
+        }
+        return position;
+    }
+    searchForNearestVertex(xyz) {
+        const position = HalfEdgePositionDetail.create();
+        position.setDTag(Number.MAX_VALUE);
+        let distanceA;
+        for (const nodeA of this._graph.allHalfEdges) {
+            distanceA = xyz.distanceXY(nodeA);
+            if (distanceA < position.getDTag()) {
+                position.resetAsVertex(nodeA);
+                position.setDTag(distanceA);
+            }
+        }
+        return position;
+    }
+    resetSearch(xyz, maxDim) {
+        if (maxDim > 0)
+            this._searcher = this.searchForNearestEdgeOrVertex(xyz);
+        else
+            this._searcher = this.searchForNearestVertex(xyz);
+    }
+    insertAndRetriangulate(xyz, newZWins) {
+        this.moveToPoint(this._searcher, xyz);
+        const seedNode = this._searcher.node;
+        let stat = false;
+        if (seedNode === undefined) {
+        }
+        else if (this._searcher.isFace) {
+            if (!seedNode.isMaskSet(HalfEdgeMask.EXTERIOR)) {
+                const newInteriorNode = this._graph.createEdgeXYZHalfEdge(xyz.x, xyz.y, xyz.z, 0, seedNode, 0);
+                this.retriangulateFromBaseVertex(newInteriorNode);
+                Triangulator.flipTrianglesInEdgeSet(this._graph, this._edgeSet);
+                this._searcher.resetAsVertex(newInteriorNode);
+            }
+            stat = true;
+        }
+        else if (this._searcher.isEdge) {
+            const newA = this._graph.splitEdgeAtFraction(seedNode, this._searcher.edgeFraction);
+            const newB = newA.vertexPredecessor;
+            this.retriangulateFromBaseVertex(newA);
+            this.retriangulateFromBaseVertex(newB);
+            Triangulator.flipTrianglesInEdgeSet(this._graph, this._edgeSet);
+            this._searcher.resetAsVertex(newA);
+            stat = true;
+        }
+        else if (this._searcher.isVertex) {
+            // There's already a vertex there.  Maybe the z is different.
+            if (newZWins)
+                seedNode.setXYZAroundVertex(xyz.x, xyz.y, xyz.z);
+            stat = true;
+        }
+        else {
+            stat = false;
+        }
+        return stat;
+    }
+    // Advance movingPosition to a face, edge, or vertex position detail that contains xyz.
+    // Prior content in movingPosition is used as seed.
+    // Return true if successful.
+    moveToPoint(movingPosition, xyz, announcer) {
+        const psc = PointSearchContext.create();
+        movingPosition.setITag(0);
+        if (movingPosition.isUnclassified) {
+            moveToAnyUnmaskedEdge(this.graph, movingPosition, 0.5, 0);
+            if (movingPosition.isUnclassified)
+                return false;
+        }
+        // double tol = vu_getMergeTol (pGraph);
+        const ray = Ray3d.createXAxis();
+        for (; movingPosition.getITag() === 0;) {
+            if (announcer !== undefined) {
+                const continueSearch = announcer(movingPosition);
+                if (!continueSearch)
+                    break;
+            }
+            if (!psc.setSearchRay(movingPosition, xyz, ray)) {
+                return false;
+            }
+            else if (movingPosition.isFace) {
+                const lastBefore = HalfEdgePositionDetail.create();
+                const firstAfter = HalfEdgePositionDetail.create();
+                const rc = psc.reAimAroundFace(movingPosition.node, ray, ray.a, lastBefore, firstAfter);
+                // reAimAroundFace returns lots of cases in `lastBefore` !!
+                switch (rc) {
+                    case RayClassification.RC_NoHits: {
+                        movingPosition.resetAsUnknown();
+                        break;
+                    }
+                    case RayClassification.RC_TargetOnVertex: {
+                        movingPosition.setFrom(lastBefore);
+                        movingPosition.setITag(1);
+                        break;
+                    }
+                    case RayClassification.RC_TargetOnEdge: {
+                        movingPosition.setFrom(lastBefore);
+                        movingPosition.setITag(1);
+                        break;
+                    }
+                    case RayClassification.RC_Bracket: {
+                        movingPosition.resetAsFace(lastBefore.node, xyz);
+                        movingPosition.setITag(1);
+                        break;
+                    }
+                    case RayClassification.RC_TargetBefore: {
+                        movingPosition.resetAsFace(movingPosition.node, xyz);
+                        movingPosition.setITag(1);
+                        break;
+                    }
+                    case RayClassification.RC_TargetAfter: {
+                        movingPosition.setFrom(lastBefore);
+                        break;
+                    }
+                }
+            }
+            else if (movingPosition.isEdge) {
+                psc.reAimFromEdge(movingPosition, ray, ray.a);
+                if (movingPosition.isUnclassified)
+                    break;
+            }
+            else if (movingPosition.isVertex) {
+                psc.reAimFromVertex(movingPosition, ray, ray.a);
+                if (movingPosition.isUnclassified)
+                    break;
+            }
+        }
+        return movingPosition.isAtXY(xyz.x, xyz.y);
+    }
+}
+// Create a VuPositionDetail for specified fraction along any unmasked edge.
+function moveToAnyUnmaskedEdge(graph, position, edgeFraction, skipMask) {
+    for (const candidate of graph.allHalfEdges) {
+        if (!candidate.isMaskSet(skipMask)) {
+            position.resetAtEdgeAndFraction(candidate, edgeFraction);
+            return true;
+        }
+    }
+    return false;
+}
+//# sourceMappingURL=InsertAndRetriangulateContext.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"InsertAndRetriangulateContext.js","sourceRoot":"","sources":["../../../src/topology/InsertAndRetriangulateContext.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AACxD,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAC5C,OAAO,EAAE,WAAW,EAAE,MAAM,yBAAyB,CAAC;AACtD,OAAO,EAA2B,YAAY,EAAE,MAAM,SAAS,CAAC;AAChE,OAAO,EAAE,aAAa,EAAE,MAAM,mBAAmB,CAAC;AAClD,OAAO,EAAE,kBAAkB,EAAE,iBAAiB,EAAE,MAAM,8BAA8B,CAAC;AACrF,OAAO,EAAE,sBAAsB,EAAE,MAAM,0BAA0B,CAAC;AAClE,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAE/C;;;;;GAKG;AACH,MAAM,OAAO,6BAA6B;IAIxC,oCAAoC;IACpC,+CAA+C;IAC/C,+CAA+C;IAE/C,YAAoB,KAAoB;QACtC,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,QAAQ,GAAG,aAAa,CAAC,MAAM,CAAC,KAAK,CAAE,CAAC;QAC7C,IAAI,CAAC,SAAS,GAAG,sBAAsB,CAAC,MAAM,EAAE,CAAC;QACjD,sDAAsD;QACtD,sDAAsD;IACxD,CAAC;IACD,kDAAkD;IAC3C,MAAM,CAAC,MAAM,CAAC,KAAoB;QACvC,OAAO,IAAI,6BAA6B,CAAC,KAAK,CAAC,CAAC;IAClD,CAAC;IACD,uDAAuD;IACvD,IAAW,KAAK,KAAoB,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IACzD,gFAAgF;IAChF,yCAAyC;IACzC,oEAAoE;IAC5D,2BAA2B,CAAC,WAAqB;QACvD,MAAM,OAAO,GAAG,WAAW,CAAC,oBAAoB,EAAE,CAAC;QACnD,IAAI,CAAC,QAAQ,CAAC,aAAa,CAAC,WAAW,CAAC,CAAC;QACzC,IAAI,OAAO,GAAG,CAAC,IAAI,WAAW,CAAC,cAAc,EAAE,IAAI,GAAG;YACpD,OAAO;QACT,MAAM,OAAO,GAAG,OAAO,GAAG,CAAC,CAAC;QAC5B,IAAI,OAAO,GAAG,WAAW,CAAC,aAAa,CAAC;QACxC,IAAI,QAAQ,GAAG,WAAW,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,EAAE,CAAC,EAAE,EAAE;YAChC,OAAO,GAAG,OAAO,CAAC,aAAa,CAAC;YAChC,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,0BAA0B,CAAC,QAAQ,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC;YAC3E,OAAO,GAAG,QAAQ,CAAC,aAAa,CAAC;YACjC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;SAClC;IACH,CAAC;IACD,qDAAqD;IAC9C,KAAK;QACV,IAAI,CAAC,SAAS,GAAG,sBAAsB,CAAC,MAAM,EAAE,CAAC;IACnD,CAAC;IAED,iEAAiE;IACjE,IAAW,eAAe,KAAK,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;IACvD;;;;OAIG;IACI,4BAA4B,CAAC,GAAY;QAC9C,MAAM,QAAQ,GAAG,sBAAsB,CAAC,MAAM,EAAE,CAAC;QACjD,QAAQ,CAAC,OAAO,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QACnC,MAAM,IAAI,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;QAC9B,IAAI,SAAS,CAAC;QACd,IAAI,SAAS,CAAC;QACd,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,YAAY,EAAE;YAC5C,MAAM,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;YAClC,SAAS,GAAG,WAAW,CAAC,oCAAoC,CAAC,KAAK,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;YAChF,IAAI,SAAS,KAAK,SAAS,EAAE;gBAC3B,IAAI,SAAS,GAAG,GAAG,EAAE;oBACnB,SAAS,GAAG,GAAG,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;oBAClC,IAAI,SAAS,GAAG,QAAQ,CAAC,OAAO,EAAG,EAAE;wBACnC,QAAQ,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;wBAC9B,QAAQ,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;qBAC7B;iBACF;qBAAM,IAAI,SAAS,GAAG,GAAG,EAAE;oBAC1B,SAAS,GAAG,GAAG,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;oBAClC,IAAI,SAAS,GAAG,QAAQ,CAAC,OAAO,EAAG,EAAE;wBACnC,QAAQ,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;wBAC9B,QAAQ,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;qBAC7B;iBACF;qBAAM;oBACL,KAAK,CAAC,iBAAiB,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;oBAEzC,SAAS,GAAG,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;oBACjC,IAAI,SAAS,GAAG,QAAQ,CAAC,OAAO,EAAG,EAAE;wBACnC,QAAQ,CAAC,sBAAsB,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;qBACnD;iBACF;aACF;SACF;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IACM,sBAAsB,CAAC,GAAY;QACxC,MAAM,QAAQ,GAAG,sBAAsB,CAAC,MAAM,EAAE,CAAC;QACjD,QAAQ,CAAC,OAAO,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QACnC,IAAI,SAAS,CAAC;QACd,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,YAAY,EAAE;YAC5C,SAAS,GAAG,GAAG,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;YAClC,IAAI,SAAS,GAAG,QAAQ,CAAC,OAAO,EAAG,EAAE;gBACnC,QAAQ,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;gBAC9B,QAAQ,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;aAC7B;SACF;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IAEM,WAAW,CAAC,GAAY,EAAE,MAAc;QAC7C,IAAI,MAAM,GAAG,CAAC;YACZ,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,4BAA4B,CAAC,GAAG,CAAC,CAAC;;YAExD,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,CAAC;IACtD,CAAC;IACM,sBAAsB,CAAC,GAAY,EAAE,QAAiB;QAC3D,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;QACtC,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC;QACrC,IAAI,IAAI,GAAG,KAAK,CAAC;QACjB,IAAI,QAAQ,KAAK,SAAS,EAAE;SAC3B;aAAM,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE;YAChC,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,YAAY,CAAC,QAAQ,CAAC,EAAE;gBAC9C,MAAM,eAAe,GAAG,IAAI,CAAC,MAAM,CAAC,qBAAqB,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC;gBAC/F,IAAI,CAAC,2BAA2B,CAAC,eAAe,CAAC,CAAC;gBAClD,YAAY,CAAC,sBAAsB,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;gBAChE,IAAI,CAAC,SAAS,CAAC,aAAa,CAAC,eAAe,CAAC,CAAC;aAC/C;YACD,IAAI,GAAG,IAAI,CAAC;SACb;aAAM,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE;YAChC,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,mBAAmB,CAAC,QAAQ,EAAE,IAAI,CAAC,SAAS,CAAC,YAAa,CAAC,CAAC;YACrF,MAAM,IAAI,GAAG,IAAI,CAAC,iBAAiB,CAAC;YACpC,IAAI,CAAC,2BAA2B,CAAC,IAAI,CAAC,CAAC;YACvC,IAAI,CAAC,2BAA2B,CAAC,IAAI,CAAC,CAAC;YACvC,YAAY,CAAC,sBAAsB,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;YAChE,IAAI,CAAC,SAAS,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;YACnC,IAAI,GAAG,IAAI,CAAC;SACb;aAAM,IAAI,IAAI,CAAC,SAAS,CAAC,QAAQ,EAAE;YAClC,6DAA6D;YAC7D,IAAI,QAAQ;gBACV,QAAQ,CAAC,kBAAkB,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;YACnD,IAAI,GAAG,IAAI,CAAC;SACb;aAAM;YACL,IAAI,GAAG,KAAK,CAAC;SACd;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,uFAAuF;IACvF,mDAAmD;IACnD,6BAA6B;IACtB,WAAW,CAAC,cAAsC,EAAE,GAAY,EAAE,SAAyD;QAChI,MAAM,GAAG,GAAG,kBAAkB,CAAC,MAAM,EAAE,CAAC;QACxC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QAC1B,IAAI,cAAc,CAAC,cAAc,EAAE;YACjC,qBAAqB,CAAC,IAAI,CAAC,KAAK,EAAE,cAAc,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;YAC1D,IAAI,cAAc,CAAC,cAAc;gBAC/B,OAAO,KAAK,CAAC;SAChB;QAED,wCAAwC;QACxC,MAAM,GAAG,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;QAChC,OAAO,cAAc,CAAC,OAAO,EAAE,KAAK,CAAC,GAAG;YACtC,IAAI,SAAS,KAAK,SAAS,EAAE;gBAC3B,MAAM,cAAc,GAAG,SAAS,CAAC,cAAc,CAAC,CAAC;gBACjD,IAAI,CAAC,cAAc;oBACjB,MAAM;aACT;YACD,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,cAAc,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE;gBAC/C,OAAO,KAAK,CAAC;aACd;iBAAM,IAAI,cAAc,CAAC,MAAM,EAAE;gBAChC,MAAM,UAAU,GAAG,sBAAsB,CAAC,MAAM,EAAE,CAAC;gBACnD,MAAM,UAAU,GAAG,sBAAsB,CAAC,MAAM,EAAE,CAAC;gBACnD,MAAM,EAAE,GAAG,GAAG,CAAC,eAAe,CAAC,cAAc,CAAC,IAAK,EAAE,GAAG,EAAE,GAAG,CAAC,CAAE,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC;gBAC1F,2DAA2D;gBAC3D,QAAQ,EAAE,EAAE;oBACV,KAAK,iBAAiB,CAAC,SAAS,CAAC,CAAC;wBAChC,cAAc,CAAC,cAAc,EAAE,CAAC;wBAChC,MAAM;qBACP;oBACD,KAAK,iBAAiB,CAAC,iBAAiB,CAAC,CAAC;wBACxC,cAAc,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;wBACnC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;wBAC1B,MAAM;qBACP;oBACD,KAAK,iBAAiB,CAAC,eAAe,CAAC,CAAC;wBACtC,cAAc,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;wBACnC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;wBAC1B,MAAM;qBACP;oBACD,KAAK,iBAAiB,CAAC,UAAU,CAAC,CAAC;wBACjC,cAAc,CAAC,WAAW,CAAC,UAAU,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;wBACjD,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;wBAC1B,MAAM;qBACP;oBACD,KAAK,iBAAiB,CAAC,eAAe,CAAC,CAAC;wBACtC,cAAc,CAAC,WAAW,CAAC,cAAc,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;wBACrD,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;wBAC1B,MAAM;qBACP;oBACD,KAAK,iBAAiB,CAAC,cAAc,CAAC,CAAC;wBACrC,cAAc,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;wBACnC,MAAM;qBACP;iBACF;aACF;iBAAM,IAAI,cAAc,CAAC,MAAM,EAAE;gBAChC,GAAG,CAAC,aAAa,CAAC,cAAc,EAAE,GAAG,EAAE,GAAG,CAAC,CAAE,CAAC,CAAC;gBAC/C,IAAI,cAAc,CAAC,cAAc;oBAC/B,MAAM;aACT;iBAAM,IAAI,cAAc,CAAC,QAAQ,EAAE;gBAClC,GAAG,CAAC,eAAe,CAAC,cAAc,EAAE,GAAG,EAAE,GAAG,CAAC,CAAE,CAAC,CAAC;gBACjD,IAAI,cAAc,CAAC,cAAc;oBAC/B,MAAM;aACT;SACF;QAED,OAAO,cAAc,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IAC7C,CAAC;CACF;AACD,4EAA4E;AAC5E,SAAS,qBAAqB,CAAC,KAAoB,EAAE,QAAgC,EAAE,YAAoB,EAAE,QAAsB;IACjI,KAAK,MAAM,SAAS,IAAI,KAAK,CAAC,YAAY,EAAE;QAC1C,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,QAAQ,CAAC,EAAE;YAClC,QAAQ,CAAC,sBAAsB,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC;YACzD,OAAO,IAAI,CAAC;SACb;KACF;IACD,OAAO,KAAK,CAAC;AACf,CAAC","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/** @packageDocumentation\r\n * @module Topology\r\n */\r\n\r\nimport { Point3d } from \"../geometry3d/Point3dVector3d\";\r\nimport { Ray3d } from \"../geometry3d/Ray3d\";\r\nimport { SmallSystem } from \"../numerics/Polynomials\";\r\nimport { HalfEdge, HalfEdgeGraph, HalfEdgeMask } from \"./Graph\";\r\nimport { MarkedEdgeSet } from \"./HalfEdgeMarkSet\";\r\nimport { PointSearchContext, RayClassification } from \"./HalfEdgePointInGraphSearch\";\r\nimport { HalfEdgePositionDetail } from \"./HalfEdgePositionDetail\";\r\nimport { Triangulator } from \"./Triangulation\";\r\n\r\n/**\r\n * Context for repeated insertion of new points in a graph.\r\n * * Initial graph should have clean outer boundary. (e.g. as typically marked with HalfEdgeMask.EXTERIOR)\r\n * * After each insertion, the current \"position\" within the graph is remembered so that each subsequent insertion\r\n *     can reuse that position as start for walking to the new point.\r\n */\r\nexport class InsertAndRetriangulateContext {\r\n  private _graph: HalfEdgeGraph;\r\n  private _edgeSet: MarkedEdgeSet;\r\n  private _searcher: HalfEdgePositionDetail;\r\n  // Temporaries used in reAimFromFace\r\n  // private _lastBefore: HalfEdgePositionDetail;\r\n  // private _firstAfter: HalfEdgePositionDetail;\r\n\r\n  private constructor(graph: HalfEdgeGraph) {\r\n    this._graph = graph;\r\n    this._edgeSet = MarkedEdgeSet.create(graph)!;\r\n    this._searcher = HalfEdgePositionDetail.create();\r\n    // this._lastBefore = HalfEdgePositionDetail.create();\r\n    // this._firstAfter = HalfEdgePositionDetail.create();\r\n  }\r\n  /** Create a new context referencing the graph. */\r\n  public static create(graph: HalfEdgeGraph) {\r\n    return new InsertAndRetriangulateContext(graph);\r\n  }\r\n  /** Query the (pointer to) the graph in the context. */\r\n  public get graph(): HalfEdgeGraph { return this._graph; }\r\n  // Walk face from edgeNode;  insert new edges back to start node from all except\r\n  //   immediate successor and predecessor.\r\n  // insert all new nodes, and nodes of the existing face, in edgeSet.\r\n  private retriangulateFromBaseVertex(centralNode: HalfEdge) {\r\n    const numNode = centralNode.countEdgesAroundFace();\r\n    this._edgeSet.addAroundFace(centralNode);\r\n    if (numNode < 4 || centralNode.signedFaceArea() <= 0.0)\r\n      return;\r\n    const numEdge = numNode - 3;\r\n    let farNode = centralNode.faceSuccessor;\r\n    let nearNode = centralNode;\r\n    for (let i = 0; i < numEdge; i++) {\r\n      farNode = farNode.faceSuccessor;\r\n      nearNode = this._graph.createEdgeHalfEdgeHalfEdge(nearNode, 0, farNode, 0);\r\n      farNode = nearNode.faceSuccessor;\r\n      this._edgeSet.addToSet(nearNode);\r\n    }\r\n  }\r\n  /** Reset the \"current\" position to unknown state. */\r\n  public reset() {\r\n    this._searcher = HalfEdgePositionDetail.create();\r\n  }\r\n\r\n  /** Return a (reference to!) the current position in the graph */\r\n  public get currentPosition() { return this._searcher; }\r\n  /**\r\n   * Linear search through the graph\r\n   * * Returns a HalfEdgePositionDetail for the nearest edge or vertex.\r\n   * @param xyz\r\n   */\r\n  public searchForNearestEdgeOrVertex(xyz: Point3d): HalfEdgePositionDetail {\r\n    const position = HalfEdgePositionDetail.create();\r\n    position.setDTag(Number.MAX_VALUE);\r\n    const xyzC = Point3d.create();\r\n    let fractionC;\r\n    let distanceC;\r\n    for (const nodeA of this._graph.allHalfEdges) {\r\n      const nodeB = nodeA.faceSuccessor;\r\n      fractionC = SmallSystem.lineSegment3dXYClosestPointUnbounded(nodeA, nodeB, xyz);\r\n      if (fractionC !== undefined) {\r\n        if (fractionC > 1.0) {\r\n          distanceC = xyz.distanceXY(nodeB);\r\n          if (distanceC < position.getDTag()!) {\r\n            position.resetAsVertex(nodeB);\r\n            position.setDTag(distanceC);\r\n          }\r\n        } else if (fractionC < 0.0) {\r\n          distanceC = xyz.distanceXY(nodeA);\r\n          if (distanceC < position.getDTag()!) {\r\n            position.resetAsVertex(nodeA);\r\n            position.setDTag(distanceC);\r\n          }\r\n        } else {\r\n          nodeA.fractionToPoint3d(fractionC, xyzC);\r\n\r\n          distanceC = xyz.distanceXY(xyzC);\r\n          if (distanceC < position.getDTag()!) {\r\n            position.resetAtEdgeAndFraction(nodeA, fractionC);\r\n          }\r\n        }\r\n      }\r\n    }\r\n    return position;\r\n  }\r\n  public searchForNearestVertex(xyz: Point3d): HalfEdgePositionDetail {\r\n    const position = HalfEdgePositionDetail.create();\r\n    position.setDTag(Number.MAX_VALUE);\r\n    let distanceA;\r\n    for (const nodeA of this._graph.allHalfEdges) {\r\n      distanceA = xyz.distanceXY(nodeA);\r\n      if (distanceA < position.getDTag()!) {\r\n        position.resetAsVertex(nodeA);\r\n        position.setDTag(distanceA);\r\n      }\r\n    }\r\n    return position;\r\n  }\r\n\r\n  public resetSearch(xyz: Point3d, maxDim: number) {\r\n    if (maxDim > 0)\r\n      this._searcher = this.searchForNearestEdgeOrVertex(xyz);\r\n    else\r\n      this._searcher = this.searchForNearestVertex(xyz);\r\n  }\r\n  public insertAndRetriangulate(xyz: Point3d, newZWins: boolean): boolean {\r\n    this.moveToPoint(this._searcher, xyz);\r\n    const seedNode = this._searcher.node;\r\n    let stat = false;\r\n    if (seedNode === undefined) {\r\n    } else if (this._searcher.isFace) {\r\n      if (!seedNode.isMaskSet(HalfEdgeMask.EXTERIOR)) {\r\n        const newInteriorNode = this._graph.createEdgeXYZHalfEdge(xyz.x, xyz.y, xyz.z, 0, seedNode, 0);\r\n        this.retriangulateFromBaseVertex(newInteriorNode);\r\n        Triangulator.flipTrianglesInEdgeSet(this._graph, this._edgeSet);\r\n        this._searcher.resetAsVertex(newInteriorNode);\r\n      }\r\n      stat = true;\r\n    } else if (this._searcher.isEdge) {\r\n      const newA = this._graph.splitEdgeAtFraction(seedNode, this._searcher.edgeFraction!);\r\n      const newB = newA.vertexPredecessor;\r\n      this.retriangulateFromBaseVertex(newA);\r\n      this.retriangulateFromBaseVertex(newB);\r\n      Triangulator.flipTrianglesInEdgeSet(this._graph, this._edgeSet);\r\n      this._searcher.resetAsVertex(newA);\r\n      stat = true;\r\n    } else if (this._searcher.isVertex) {\r\n      // There's already a vertex there.  Maybe the z is different.\r\n      if (newZWins)\r\n        seedNode.setXYZAroundVertex(xyz.x, xyz.y, xyz.z);\r\n      stat = true;\r\n    } else {\r\n      stat = false;\r\n    }\r\n    return stat;\r\n  }\r\n\r\n  // Advance movingPosition to a face, edge, or vertex position detail that contains xyz.\r\n  // Prior content in movingPosition is used as seed.\r\n  // Return true if successful.\r\n  public moveToPoint(movingPosition: HalfEdgePositionDetail, xyz: Point3d, announcer?: (position: HalfEdgePositionDetail) => boolean): boolean {\r\n    const psc = PointSearchContext.create();\r\n    movingPosition.setITag(0);\r\n    if (movingPosition.isUnclassified) {\r\n      moveToAnyUnmaskedEdge(this.graph, movingPosition, 0.5, 0);\r\n      if (movingPosition.isUnclassified)\r\n        return false;\r\n    }\r\n\r\n    // double tol = vu_getMergeTol (pGraph);\r\n    const ray = Ray3d.createXAxis();\r\n    for (; movingPosition.getITag() === 0;) {\r\n      if (announcer !== undefined) {\r\n        const continueSearch = announcer(movingPosition);\r\n        if (!continueSearch)\r\n          break;\r\n      }\r\n      if (!psc.setSearchRay(movingPosition, xyz, ray)) {\r\n        return false;\r\n      } else if (movingPosition.isFace) {\r\n        const lastBefore = HalfEdgePositionDetail.create();\r\n        const firstAfter = HalfEdgePositionDetail.create();\r\n        const rc = psc.reAimAroundFace(movingPosition.node!, ray, ray.a!, lastBefore, firstAfter);\r\n        // reAimAroundFace returns lots of cases in `lastBefore` !!\r\n        switch (rc) {\r\n          case RayClassification.RC_NoHits: {\r\n            movingPosition.resetAsUnknown();\r\n            break;\r\n          }\r\n          case RayClassification.RC_TargetOnVertex: {\r\n            movingPosition.setFrom(lastBefore);\r\n            movingPosition.setITag(1);\r\n            break;\r\n          }\r\n          case RayClassification.RC_TargetOnEdge: {\r\n            movingPosition.setFrom(lastBefore);\r\n            movingPosition.setITag(1);\r\n            break;\r\n          }\r\n          case RayClassification.RC_Bracket: {\r\n            movingPosition.resetAsFace(lastBefore.node, xyz);\r\n            movingPosition.setITag(1);\r\n            break;\r\n          }\r\n          case RayClassification.RC_TargetBefore: {\r\n            movingPosition.resetAsFace(movingPosition.node, xyz);\r\n            movingPosition.setITag(1);\r\n            break;\r\n          }\r\n          case RayClassification.RC_TargetAfter: {\r\n            movingPosition.setFrom(lastBefore);\r\n            break;\r\n          }\r\n        }\r\n      } else if (movingPosition.isEdge) {\r\n        psc.reAimFromEdge(movingPosition, ray, ray.a!);\r\n        if (movingPosition.isUnclassified)\r\n          break;\r\n      } else if (movingPosition.isVertex) {\r\n        psc.reAimFromVertex(movingPosition, ray, ray.a!);\r\n        if (movingPosition.isUnclassified)\r\n          break;\r\n      }\r\n    }\r\n\r\n    return movingPosition.isAtXY(xyz.x, xyz.y);\r\n  }\r\n}\r\n// Create a VuPositionDetail for specified fraction along any unmasked edge.\r\nfunction moveToAnyUnmaskedEdge(graph: HalfEdgeGraph, position: HalfEdgePositionDetail, edgeFraction: number, skipMask: HalfEdgeMask): boolean {\r\n  for (const candidate of graph.allHalfEdges) {\r\n    if (!candidate.isMaskSet(skipMask)) {\r\n      position.resetAtEdgeAndFraction(candidate, edgeFraction);\r\n      return true;\r\n    }\r\n  }\r\n  return false;\r\n}\r\n"]}

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

@@ -0,0 +1,33 @@
+/** @packageDocumentation
+ * @module Topology
+ */
+/**
+ * Methods to "grab and drop" mask bits.
+ * * Caller code (e.g. HalfEdgeGraph) initializes with a block of bits to be managed.
+ * * Callers borrow and return masks with "grabMask" and "dropMask"
+ * * Callers must exercise grab/drop balance discipline.
+ * @internal
+ */
+export declare class MaskManager {
+    private _freeMasks;
+    private _originalFreeMasks;
+    private _firstFreeMask;
+    /**
+     * @param freeMasks caller-defined block of bits that are to be managed.
+     */
+    private constructor();
+    /** Create a MaskManager.
+     * Typical use:   MaskManager.create (0xFFFF0000)
+     * * This makes bits 16 through 31 available to be borrowed, with lower bits available for fixed usage.
+     */
+    static create(freeMasks: number): MaskManager | undefined;
+    /**
+     * Find a mask bit that is not "in use".
+     */
+    grabMask(): number;
+    /**
+     * Find a mask bit that is not "in use".
+     */
+    dropMask(mask: number): void;
+}
+//# sourceMappingURL=MaskManager.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"MaskManager.d.ts","sourceRoot":"","sources":["../../../src/topology/MaskManager.ts"],"names":[],"mappings":"AAKA;;GAEG;AACH;;;;;;GAMG;AACH,qBAAa,WAAW;IACtB,OAAO,CAAC,UAAU,CAAS;IAC3B,OAAO,CAAC,kBAAkB,CAAS;IACnC,OAAO,CAAC,cAAc,CAAS;IAC/B;;OAEG;IACH,OAAO;IAKP;;;OAGG;WACW,MAAM,CAAC,SAAS,EAAE,MAAM,GAAG,WAAW,GAAG,SAAS;IAehE;;OAEG;IACI,QAAQ,IAAI,MAAM;IAUzB;;OAEG;IACI,QAAQ,CAAC,IAAI,EAAE,MAAM;CAK7B"}

package/lib/esm/topology/MaskManager.js

@@ -0,0 +1,63 @@
+/*---------------------------------------------------------------------------------------------
+* 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
+ */
+/**
+ * Methods to "grab and drop" mask bits.
+ * * Caller code (e.g. HalfEdgeGraph) initializes with a block of bits to be managed.
+ * * Callers borrow and return masks with "grabMask" and "dropMask"
+ * * Callers must exercise grab/drop balance discipline.
+ * @internal
+ */
+export class MaskManager {
+    /**
+     * @param freeMasks caller-defined block of bits that are to be managed.
+     */
+    constructor(freeMasks, firstFreeMask) {
+        this._originalFreeMasks = freeMasks;
+        this._freeMasks = freeMasks;
+        this._firstFreeMask = firstFreeMask;
+    }
+    /** Create a MaskManager.
+     * Typical use:   MaskManager.create (0xFFFF0000)
+     * * This makes bits 16 through 31 available to be borrowed, with lower bits available for fixed usage.
+     */
+    static create(freeMasks) {
+        // look for first bit up to bit 31
+        let firstFree = 0;
+        let testBit = 0x01;
+        for (let i = 0; i < 32; i++) {
+            if ((testBit & freeMasks) !== 0) {
+                firstFree = testBit;
+                break;
+            }
+            testBit = (testBit << 1);
+        }
+        if (firstFree === 0)
+            return undefined;
+        return new MaskManager(freeMasks, firstFree);
+    }
+    /**
+     * Find a mask bit that is not "in use".
+     */
+    grabMask() {
+        let mask = this._firstFreeMask;
+        if (this._freeMasks === 0)
+            return 0;
+        while (!(mask & this._freeMasks))
+            mask = mask << 1;
+        this._freeMasks &= ~mask;
+        return mask;
+    }
+    /**
+     * Find a mask bit that is not "in use".
+     */
+    dropMask(mask) {
+        mask &= this._originalFreeMasks; // prevent "drop" of mask not in the pool.
+        this._freeMasks |= mask;
+    }
+}
+//# sourceMappingURL=MaskManager.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"MaskManager.js","sourceRoot":"","sources":["../../../src/topology/MaskManager.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AACH;;;;;;GAMG;AACH,MAAM,OAAO,WAAW;IAItB;;OAEG;IACH,YAAoB,SAAiB,EAAE,aAAqB;QAC1D,IAAI,CAAC,kBAAkB,GAAG,SAAS,CAAC;QACpC,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;QAC5B,IAAI,CAAC,cAAc,GAAG,aAAa,CAAC;IACtC,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,MAAM,CAAC,SAAiB;QACpC,kCAAkC;QAClC,IAAI,SAAS,GAAG,CAAC,CAAC;QAClB,IAAI,OAAO,GAAG,IAAI,CAAC;QACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE;YAC3B,IAAI,CAAC,OAAO,GAAG,SAAS,CAAC,KAAK,CAAC,EAAE;gBAC/B,SAAS,GAAG,OAAO,CAAC;gBACpB,MAAM;aACP;YACD,OAAO,GAAG,CAAC,OAAO,IAAI,CAAC,CAAC,CAAC;SAC1B;QACD,IAAI,SAAS,KAAK,CAAC;YACjB,OAAO,SAAS,CAAC;QACnB,OAAO,IAAI,WAAW,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;IAC/C,CAAC;IACD;;OAEG;IACI,QAAQ;QACb,IAAI,IAAI,GAAG,IAAI,CAAC,cAAc,CAAC;QAC/B,IAAI,IAAI,CAAC,UAAU,KAAK,CAAC;YACvB,OAAO,CAAC,CAAC;QACX,OAAO,CAAC,CAAC,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC;YAC9B,IAAI,GAAG,IAAI,IAAI,CAAC,CAAC;QAEnB,IAAI,CAAC,UAAU,IAAI,CAAC,IAAI,CAAC;QACzB,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;OAEG;IACI,QAAQ,CAAC,IAAY;QAC1B,IAAI,IAAI,IAAI,CAAC,kBAAkB,CAAC,CAAI,0CAA0C;QAC9E,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC;IAC1B,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/**\n * Methods to \"grab and drop\" mask bits.\n * * Caller code (e.g. HalfEdgeGraph) initializes with a block of bits to be managed.\n * * Callers borrow and return masks with \"grabMask\" and \"dropMask\"\n * * Callers must exercise grab/drop balance discipline.\n * @internal\n */\nexport class MaskManager {\n  private _freeMasks: number;\n  private _originalFreeMasks: number;\n  private _firstFreeMask: number;\n  /**\n   * @param freeMasks caller-defined block of bits that are to be managed.\n   */\n  private constructor(freeMasks: number, firstFreeMask: number) {\n    this._originalFreeMasks = freeMasks;\n    this._freeMasks = freeMasks;\n    this._firstFreeMask = firstFreeMask;\n  }\n  /** Create a MaskManager.\n   * Typical use:   MaskManager.create (0xFFFF0000)\n   * * This makes bits 16 through 31 available to be borrowed, with lower bits available for fixed usage.\n   */\n  public static create(freeMasks: number): MaskManager | undefined {\n    // look for first bit up to bit 31\n    let firstFree = 0;\n    let testBit = 0x01;\n    for (let i = 0; i < 32; i++) {\n      if ((testBit & freeMasks) !== 0) {\n        firstFree = testBit;\n        break;\n      }\n      testBit = (testBit << 1);\n    }\n    if (firstFree === 0)\n      return undefined;\n    return new MaskManager(freeMasks, firstFree);\n  }\n  /**\n   * Find a mask bit that is not \"in use\".\n   */\n  public grabMask(): number {\n    let mask = this._firstFreeMask;\n    if (this._freeMasks === 0)\n      return 0;\n    while (!(mask & this._freeMasks))\n      mask = mask << 1;\n\n    this._freeMasks &= ~mask;\n    return mask;\n  }\n  /**\n   * Find a mask bit that is not \"in use\".\n   */\n  public dropMask(mask: number) {\n    mask &= this._originalFreeMasks;    // prevent \"drop\" of mask not in the pool.\n    this._freeMasks |= mask;\n  }\n\n}\n"]}

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

@@ -0,0 +1,90 @@
+/** @packageDocumentation
+ * @module Topology
+ */
+import { LineSegment3d } from "../curve/LineSegment3d";
+import { Range3d } from "../geometry3d/Range";
+import { HalfEdge, HalfEdgeGraph, HalfEdgeMask } from "./Graph";
+import { MultiLineStringDataVariant } from "./Triangulation";
+export declare class GraphSplitData {
+    numUpEdge: number;
+    numIntersectionTest: number;
+    numSplit: number;
+    numPopOut: number;
+    numA0B0: number;
+    numA0B1: number;
+    constructor();
+}
+/**
+ * * Assorted methods used in algorithms on HalfEdgeGraph.
+ * @internal
+ */
+export declare class HalfEdgeGraphOps {
+    /** Compare function for sorting with primary y compare, secondary  x compare. */
+    static compareNodesYXUp(a: HalfEdge, b: HalfEdge): 1 | 0 | -1;
+    /** 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: HalfEdge): boolean;
+    /** 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: HalfEdge, targetA: HalfEdge, targetB: HalfEdge): number;
+    static graphRange(graph: HalfEdgeGraph): Range3d;
+    /** Returns an array of a all nodes (both ends) of edges created from segments. */
+    static segmentArrayToGraphEdges(segments: LineSegment3d[], returnGraph: HalfEdgeGraph, mask: HalfEdgeMask): HalfEdge[];
+    /**
+     * * 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: HalfEdgeGraph): void;
+    /**
+     * * Visit all nodes in `graph`.
+     * * invoke `pinch(node, vertexPredecessor)`
+     * * this leaves the graph as isolated edges.
+     * @param graph graph to modify
+     */
+    static isolateAllEdges(graph: HalfEdgeGraph): void;
+}
+/**
+ * @internal
+ */
+export declare 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: HalfEdgeGraph, outboundRadiansFunction?: (he: HalfEdge) => number): void;
+    private static buildVerticalSweepPriorityQueue;
+    private static snapFractionToNode;
+    private static computeIntersectionFractionsOnEdges;
+    /**
+     * Split edges at intersections.
+     * * This is a large operation.
+     * @param graph
+     */
+    static splitIntersectingEdges(graph: HalfEdgeGraph): GraphSplitData;
+    /**
+     * 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: LineSegment3d[]): HalfEdgeGraph;
+    /**
+     * * 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: MultiLineStringDataVariant, regularize?: boolean, mask?: HalfEdgeMask): HalfEdgeGraph | undefined;
+}
+//# sourceMappingURL=Merging.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"Merging.d.ts","sourceRoot":"","sources":["../../../src/topology/Merging.ts"],"names":[],"mappings":"AAKA;;GAEG;AAEH,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AAIvD,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AAG9C,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AAGhE,OAAO,EAAE,0BAA0B,EAAgB,MAAM,iBAAiB,CAAC;AAE3E,qBAAa,cAAc;IAClB,SAAS,SAAK;IACd,mBAAmB,SAAK;IACxB,QAAQ,SAAK;IACb,SAAS,SAAK;IACd,OAAO,SAAK;IACZ,OAAO,SAAK;;CAGpB;AAED;;;GAGG;AACH,qBAAa,gBAAgB;IAE3B,iFAAiF;WACnE,gBAAgB,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,EAAE,QAAQ;IAgBvD,mIAAmI;WACrH,UAAU,CAAC,KAAK,EAAE,QAAQ;IAQxC;;;;OAIG;WACW,qBAAqB,CAAC,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,GAAG,MAAM;WAOnF,UAAU,CAAC,KAAK,EAAE,aAAa,GAAG,OAAO;IAOvD,kFAAkF;WACpE,wBAAwB,CAAC,QAAQ,EAAE,aAAa,EAAE,EAAE,WAAW,EAAE,aAAa,EAAE,IAAI,EAAE,YAAY,GAAG,QAAQ,EAAE;IAwB7H;;;;;;OAMG;WACW,iBAAiB,CAAC,KAAK,EAAE,aAAa;IAiBpD;;;;;OAKG;WACW,eAAe,CAAC,KAAK,EAAE,aAAa;CAOnD;AACD;;GAEG;AACH,qBAAa,kBAAkB;IAC7B;;;;;;;OAOG;WACW,sBAAsB,CAAC,KAAK,EAAE,aAAa,EAAE,uBAAuB,CAAC,EAAE,CAAC,EAAE,EAAE,QAAQ,KAAK,MAAM;IAqG7G,OAAO,CAAC,MAAM,CAAC,+BAA+B;IAU9C,OAAO,CAAC,MAAM,CAAC,kBAAkB;IAKjC,OAAO,CAAC,MAAM,CAAC,mCAAmC;IAyBlD;;;;OAIG;WACW,sBAAsB,CAAC,KAAK,EAAE,aAAa,GAAG,cAAc;IA+C1E;;;;;;;;OAQG;WACW,qBAAqB,CAAC,YAAY,EAAE,aAAa,EAAE,GAAG,aAAa;IAUjF;;;;OAIG;WACW,mBAAmB,CAAC,MAAM,EAAE,0BAA0B,EAAE,UAAU,GAAE,OAAc,EAAE,IAAI,GAAE,YAAwC,GAAG,aAAa,GAAG,SAAS;CAiB7K"}