@itwin/core-geometry 4.9.0-dev.9 → 4.10.0-dev.0

package/lib/esm/topology/InsertAndRetriangulateContext.js

@@ -5,7 +5,10 @@
 /** @packageDocumentation
  * @module Topology
  */
+import { assert } from "@itwin/core-bentley";
+import { Geometry, PolygonLocation } from "../Geometry";
 import { Point3d } from "../geometry3d/Point3dVector3d";
+import { PolygonOps } from "../geometry3d/PolygonOps";
 import { Ray3d } from "../geometry3d/Ray3d";
 import { SmallSystem } from "../numerics/Polynomials";
 import { HalfEdgeMask } from "./Graph";
@@ -13,37 +16,59 @@ import { MarkedEdgeSet } from "./HalfEdgeMarkSet";
 import { PointSearchContext, RayClassification } from "./HalfEdgePointInGraphSearch";
 import { HalfEdgePositionDetail } from "./HalfEdgePositionDetail";
 import { Triangulator } from "./Triangulation";
+/**
+ * Options for setting the z-coordinate of a vertex in the triangulation when a point with the same xy is inserted.
+ * @internal
+ */
+export var InsertedVertexZOptions;
+(function (InsertedVertexZOptions) {
+    /** The point's z-coordinate is ignored, and the existing vertex's z-coordinate is unchanged. */
+    InsertedVertexZOptions[InsertedVertexZOptions["Ignore"] = 0] = "Ignore";
+    /** The point's z-coordinate replaces the existing vertex's z-coordinate. */
+    InsertedVertexZOptions[InsertedVertexZOptions["Replace"] = 1] = "Replace";
+    /**
+     * Like [[InsertedVertexZOptions.Replace]], but the existing vertex's z-coordinate is updated only if the
+     * point's z-coordinate is larger.
+     */
+    InsertedVertexZOptions[InsertedVertexZOptions["ReplaceIfLarger"] = 2] = "ReplaceIfLarger";
+    /**
+     * Like [[InsertedVertexZOptions.Replace]], but the existing vertex's z-coordinate is updated only if the
+     * point's z-coordinate is smaller.
+     */
+    InsertedVertexZOptions[InsertedVertexZOptions["ReplaceIfSmaller"] = 3] = "ReplaceIfSmaller";
+})(InsertedVertexZOptions || (InsertedVertexZOptions = {}));
 /**
  * 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)
+ * * Initial graph should have clean outer boundary (e.g., as typically marked with `HalfEdgeMask.EXTERIOR` and
+ * `HalfEdgeMask.BOUNDARY_EDGE`).
  * * 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.
+ * can reuse that position as start for walking to the new point.
+ * @internal
  */
 export class InsertAndRetriangulateContext {
-    // Temporaries used in reAimFromFace
-    // private _lastBefore: HalfEdgePositionDetail;
-    // private _firstAfter: HalfEdgePositionDetail;
-    constructor(graph) {
+    constructor(graph, tolerance) {
         this._graph = graph;
         this._edgeSet = MarkedEdgeSet.create(graph);
         this._searcher = HalfEdgePositionDetail.create();
-        // this._lastBefore = HalfEdgePositionDetail.create();
-        // this._firstAfter = HalfEdgePositionDetail.create();
+        this._tolerance = tolerance;
     }
     /** Create a new context referencing the graph. */
-    static create(graph) {
-        return new InsertAndRetriangulateContext(graph);
+    static create(graph, tolerance = Geometry.smallMetricDistance) {
+        return new InsertAndRetriangulateContext(graph, tolerance);
     }
     /** 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.
+    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)
+        if (numNode < 4 || centralNode.isMaskSet(HalfEdgeMask.EXTERIOR))
             return;
+        this._edgeSet.addAroundFace(centralNode);
         const numEdge = numNode - 3;
         let farNode = centralNode.faceSuccessor;
         let nearNode = centralNode;
@@ -58,13 +83,11 @@ export class InsertAndRetriangulateContext {
     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
-     */
+    /** Return a (reference to!) the current position in the graph. */
+    get currentPosition() {
+        return this._searcher;
+    }
+    /** Linear search for the nearest graph edge or vertex. */
     searchForNearestEdgeOrVertex(xyz) {
         const position = HalfEdgePositionDetail.create();
         position.setDTag(Number.MAX_VALUE);
@@ -100,6 +123,7 @@ export class InsertAndRetriangulateContext {
         }
         return position;
     }
+    /** Linear search for the nearest graph vertex. */
     searchForNearestVertex(xyz) {
         const position = HalfEdgePositionDetail.create();
         position.setDTag(Number.MAX_VALUE);
@@ -113,60 +137,139 @@ export class InsertAndRetriangulateContext {
         }
         return position;
     }
-    resetSearch(xyz, maxDim) {
-        if (maxDim > 0)
+    /**
+     * Reset the "current" position to a vertex nearest the target point.
+     * @param xyz target point
+     * @param searchEdgesToo reset to nearest vertex or edge
+    */
+    resetSearch(xyz, searchEdgesToo) {
+        if (searchEdgesToo)
             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) {
+    /** Reclassify the current interior face hit if it is too close to an edge of the face. */
+    reclassifyFaceHit(point) {
+        if (undefined === this._searcher.node || !this._searcher.isFace || this._searcher.node.isMaskSet(HalfEdgeMask.EXTERIOR))
+            return false;
+        const pointXY = Point3d.create(point.x, point.y);
+        const face = this._searcher.node.collectAroundFace((node) => {
+            const xy = Point3d.create(node.x, node.y);
+            xy.node = node; // decorate the point with the node
+            return xy;
+        });
+        const detail = PolygonOps.closestPointOnBoundary(face, pointXY, this._tolerance);
+        assert(detail.code === PolygonLocation.OnPolygonEdgeInterior);
+        if (detail.a > this._tolerance)
+            return false;
+        const edge = face[detail.closestEdgeIndex].node;
+        const vertex = (detail.closestEdgeParam < 0.5) ? edge : edge.faceSuccessor;
+        if (detail.point.distanceSquaredXY(vertex) <= this._tolerance * this._tolerance)
+            this._searcher.resetAsVertex(vertex);
+        else
+            this._searcher.resetAtEdgeAndFraction(edge, detail.closestEdgeParam);
+        return true;
+    }
+    /** Reclassify the current interior edge hit if it is too close to an edge of either adjacent face. */
+    reclassifyEdgeHit(point) {
+        if (undefined === this._searcher.node || !this._searcher.isEdge || this._searcher.node.isMaskSet(HalfEdgeMask.BOUNDARY_EDGE))
+            return false;
+        const pointXY = Point3d.create(point.x, point.y);
+        const superFace = [];
+        for (let n = this._searcher.node.faceSuccessor; n !== this._searcher.node; n = n.faceSuccessor) {
+            const xy = Point3d.create(n.x, n.y);
+            xy.node = n; // decorate the point with a node of the left face
+            superFace.push(xy);
+        }
+        for (let n = this._searcher.node.vertexPredecessor; n !== this._searcher.node.edgeMate; n = n.faceSuccessor) {
+            const xy = Point3d.create(n.x, n.y);
+            xy.node = n; // decorate the point with a node of the right face
+            superFace.push(xy);
         }
-        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);
+        const detail = PolygonOps.closestPointOnBoundary(superFace, pointXY, this._tolerance);
+        if (detail.a > this._tolerance)
+            return false;
+        const edge = superFace[detail.closestEdgeIndex].node;
+        const vertex = (detail.closestEdgeParam < 0.5) ? edge : edge.faceSuccessor;
+        if (detail.code === PolygonLocation.OnPolygonVertex) // can happen if superFace is non-concave (e.g., a dart)
+            this._searcher.resetAsVertex(vertex);
+        else if (detail.point.distanceSquaredXY(vertex) <= this._tolerance * this._tolerance)
+            this._searcher.resetAsVertex(vertex);
+        else
+            this._searcher.resetAtEdgeAndFraction(edge, detail.closestEdgeParam);
+        return true;
+    }
+    /**
+     * Given a point that was just inserted into the graph at the given node, apply the z-coordinate rule around
+     * the vertex loop.
+     */
+    updateZAroundVertex(node, point, zOption) {
+        if (InsertedVertexZOptions.Ignore === zOption)
+            return;
+        if ((InsertedVertexZOptions.ReplaceIfLarger === zOption) && (point.z <= node.z))
+            return;
+        if ((InsertedVertexZOptions.ReplaceIfSmaller === zOption) && (point.z >= node.z))
+            return;
+        // only replace z; preserving xy preserves convexity of the hull
+        node.setXYZAroundVertex(node.x, node.y, point.z);
+    }
+    /**
+     * Insert a new point into the graph and retriangulate.
+     * @param point the coordinates of the node to be inserted.
+     * @param newZWins rule governing when `point.z` should override the z-coordinate of an existing vertex with the
+     * same x and y.
+     * @returns true if and only if the point didn't need to be inserted or was successfully inserted.
+     */
+    insertAndRetriangulate(point, newZWins) {
+        this.moveToPoint(this._searcher, point);
+        if (this._searcher.node === undefined)
+            return false;
+        // Try to avoid skinny triangles. If we iterated, this could get out of control (e.g., inserting point into a fan).
+        // Limiting to one reclassification ensures the hit doesn't move more than tol and reduces skinny triangles
+        // adjacent to the hull.
+        if (!this.reclassifyFaceHit(point))
+            this.reclassifyEdgeHit(point);
+        if (this._searcher.isFace) {
+            // insert point into the graph if it lies in an interior face
+            if (!this._searcher.node.isMaskSet(HalfEdgeMask.EXTERIOR)) {
+                const newNode = this._graph.createEdgeXYZHalfEdge(point.x, point.y, point.z, 0, this._searcher.node, 0);
+                this.retriangulateFromBaseVertex(newNode);
                 Triangulator.flipTrianglesInEdgeSet(this._graph, this._edgeSet);
-                this._searcher.resetAsVertex(newInteriorNode);
+                this._searcher.resetAsVertex(newNode);
             }
-            stat = true;
         }
         else if (this._searcher.isEdge) {
-            const newA = this._graph.splitEdgeAtFraction(seedNode, this._searcher.edgeFraction);
+            // insert point into the graph by splitting its containing edge
+            const newA = this._graph.splitEdgeAtFraction(this._searcher.node, this._searcher.edgeFraction);
             const newB = newA.vertexPredecessor;
+            this.updateZAroundVertex(newA, point, InsertedVertexZOptions.Replace); // always replace
             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;
+            // no need to insert point as there's already a vertex there, but maybe update its z-coord
+            this.updateZAroundVertex(this._searcher.node, point, newZWins);
         }
-        return stat;
+        return true;
     }
-    // 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();
+    /**
+     * Advance movingPosition to a face, edge, or vertex position detail that contains `target`.
+     * @param movingPosition input seed for search, updated on return.
+     * @param target point to search for containing topology in the graph.
+     * @param announcer optional callback invoked during search loop; return false to end search.
+     * @returns true if search was successful.
+     */
+    moveToPoint(movingPosition, target, announcer) {
+        const psc = PointSearchContext.create(this._tolerance);
         movingPosition.setITag(0);
         if (movingPosition.isUnclassified) {
-            moveToAnyUnmaskedEdge(this.graph, movingPosition, 0.5, 0);
+            moveToAnyUnmaskedEdge(this.graph, movingPosition, 0.5, HalfEdgeMask.NULL_MASK);
             if (movingPosition.isUnclassified)
                 return false;
         }
         let trap = 0;
-        // double tol = vu_getMergeTol (pGraph);
         const ray = Ray3d.createXAxis();
         for (; movingPosition.getITag() === 0 && trap < 2;) {
             if (announcer !== undefined) {
@@ -174,40 +277,40 @@ export class InsertAndRetriangulateContext {
                 if (!continueSearch)
                     break;
             }
-            if (!psc.setSearchRay(movingPosition, xyz, ray)) {
+            if (!psc.setSearchRay(movingPosition, target, 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` !!
+                // reAimAroundFace returns lots of cases in `lastBefore`
                 switch (rc) {
-                    case RayClassification.RC_NoHits: {
+                    case RayClassification.NoHits: {
                         movingPosition.resetAsUnknown();
                         break;
                     }
-                    case RayClassification.RC_TargetOnVertex: {
+                    case RayClassification.TargetOnVertex: {
                         movingPosition.setFrom(lastBefore);
                         movingPosition.setITag(1);
                         break;
                     }
-                    case RayClassification.RC_TargetOnEdge: {
+                    case RayClassification.TargetOnEdge: {
                         movingPosition.setFrom(lastBefore);
                         movingPosition.setITag(1);
                         break;
                     }
-                    case RayClassification.RC_Bracket: {
-                        movingPosition.resetAsFace(lastBefore.node, xyz);
+                    case RayClassification.Bracket: {
+                        movingPosition.resetAsFace(lastBefore.node, target);
                         movingPosition.setITag(1);
                         break;
                     }
-                    case RayClassification.RC_TargetBefore: {
-                        movingPosition.resetAsFace(movingPosition.node, xyz);
+                    case RayClassification.TargetBefore: { // do we ever get here?
+                        movingPosition.resetAsFace(movingPosition.node, target);
                         movingPosition.setITag(1);
                         break;
                     }
-                    case RayClassification.RC_TargetAfter: {
+                    case RayClassification.TargetAfter: {
                         if (movingPosition.node === lastBefore.node
                             && movingPosition.isFace
                             && (lastBefore.isEdge || lastBefore.isVertex)) {
@@ -232,27 +335,23 @@ export class InsertAndRetriangulateContext {
                     break;
             }
         }
-        if (movingPosition.isAtXY(xyz.x, xyz.y))
+        if (movingPosition.isAtXY(target.x, target.y))
             return true;
         if (trap > 1) {
-            // Ugh.  We exited the loop by repeatedly hitting the same node
-            // with edge or vertex type in lastBefore.
-            // This happens only when the target point is exterior.
-            // (Heavy triangulation use cases start with a convex hull and only do interior intersections,
-            //     so case only happens in contrived unit tests.... so far ...)
-            // What to mark?
-            // Leave it as is, but mark as exterior target
-            //
+            // ugh! We exited the loop by repeatedly hitting the same node with edge or vertex type in lastBefore.
+            // This happens only when the target point is exterior (heavy triangulation use cases start with a convex
+            // hull and only do interior intersections, so case only happens in contrived unit tests so far
+            // What to mark? Leave it as is, but mark as exterior target
             if (movingPosition.node !== undefined) {
                 movingPosition.setIsExteriorTarget(true);
             }
             return false;
         }
-        // Murky here ...  should never be hit.  Has never been hit in unit tests.
+        // murky here; should never be hit. Has never been hit in unit tests.
         return false;
     }
 }
-// Create a VuPositionDetail for specified fraction along any unmasked edge.
+/** Set `position` to a random unmasked edge at the specified fraction. */
 function moveToAnyUnmaskedEdge(graph, position, edgeFraction, skipMask) {
     for (const candidate of graph.allHalfEdges) {
         if (!candidate.isMaskSet(skipMask)) {

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

@@ -1 +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,CAAC;YACjC,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;QACnC,CAAC;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,CAAC;YAC7C,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,CAAC;gBAC5B,IAAI,SAAS,GAAG,GAAG,EAAE,CAAC;oBACpB,SAAS,GAAG,GAAG,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;oBAClC,IAAI,SAAS,GAAG,QAAQ,CAAC,OAAO,EAAG,EAAE,CAAC;wBACpC,QAAQ,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;wBAC9B,QAAQ,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;oBAC9B,CAAC;gBACH,CAAC;qBAAM,IAAI,SAAS,GAAG,GAAG,EAAE,CAAC;oBAC3B,SAAS,GAAG,GAAG,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;oBAClC,IAAI,SAAS,GAAG,QAAQ,CAAC,OAAO,EAAG,EAAE,CAAC;wBACpC,QAAQ,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;wBAC9B,QAAQ,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;oBAC9B,CAAC;gBACH,CAAC;qBAAM,CAAC;oBACN,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,CAAC;wBACpC,QAAQ,CAAC,sBAAsB,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;oBACpD,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;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,CAAC;YAC7C,SAAS,GAAG,GAAG,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;YAClC,IAAI,SAAS,GAAG,QAAQ,CAAC,OAAO,EAAG,EAAE,CAAC;gBACpC,QAAQ,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;gBAC9B,QAAQ,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;YAC9B,CAAC;QACH,CAAC;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,CAAC;QAC7B,CAAC;aAAM,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC;YACjC,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,YAAY,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC/C,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;YAChD,CAAC;YACD,IAAI,GAAG,IAAI,CAAC;QACd,CAAC;aAAM,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC;YACjC,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;QACd,CAAC;aAAM,IAAI,IAAI,CAAC,SAAS,CAAC,QAAQ,EAAE,CAAC;YACnC,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;QACd,CAAC;aAAM,CAAC;YACN,IAAI,GAAG,KAAK,CAAC;QACf,CAAC;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,CAAC;YAClC,qBAAqB,CAAC,IAAI,CAAC,KAAK,EAAE,cAAc,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;YAC1D,IAAI,cAAc,CAAC,cAAc;gBAC/B,OAAO,KAAK,CAAC;QACjB,CAAC;QACD,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,wCAAwC;QACxC,MAAM,GAAG,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;QAChC,OAAO,cAAc,CAAC,OAAO,EAAE,KAAK,CAAC,IAAI,IAAI,GAAG,CAAC,GAAG,CAAC;YACnD,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;gBAC5B,MAAM,cAAc,GAAG,SAAS,CAAC,cAAc,CAAC,CAAC;gBACjD,IAAI,CAAC,cAAc;oBACjB,MAAM;YACV,CAAC;YACD,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,cAAc,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;gBAChD,OAAO,KAAK,CAAC;YACf,CAAC;iBAAM,IAAI,cAAc,CAAC,MAAM,EAAE,CAAC;gBACjC,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,CAAC;oBACX,KAAK,iBAAiB,CAAC,SAAS,CAAC,CAAC,CAAC;wBACjC,cAAc,CAAC,cAAc,EAAE,CAAC;wBAChC,MAAM;oBACR,CAAC;oBACD,KAAK,iBAAiB,CAAC,iBAAiB,CAAC,CAAC,CAAC;wBACzC,cAAc,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;wBACnC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;wBAC1B,MAAM;oBACR,CAAC;oBACD,KAAK,iBAAiB,CAAC,eAAe,CAAC,CAAC,CAAC;wBACvC,cAAc,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;wBACnC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;wBAC1B,MAAM;oBACR,CAAC;oBACD,KAAK,iBAAiB,CAAC,UAAU,CAAC,CAAC,CAAC;wBAClC,cAAc,CAAC,WAAW,CAAC,UAAU,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;wBACjD,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;wBAC1B,MAAM;oBACR,CAAC;oBACD,KAAK,iBAAiB,CAAC,eAAe,CAAC,CAAC,CAAC;wBACvC,cAAc,CAAC,WAAW,CAAC,cAAc,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;wBACrD,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;wBAC1B,MAAM;oBACR,CAAC;oBACD,KAAK,iBAAiB,CAAC,cAAc,CAAC,CAAC,CAAC;wBACtC,IAAI,cAAc,CAAC,IAAI,KAAK,UAAU,CAAC,IAAI;+BACtC,cAAc,CAAC,MAAM;+BACrB,CAAC,UAAU,CAAC,MAAM,IAAI,UAAU,CAAC,QAAQ,CAAC,EAAC,CAAC;4BAC/C,IAAI,EAAE,CAAC;wBACT,CAAC;6BAAM,CAAC;4BACN,IAAI,GAAG,CAAC,CAAC;wBACX,CAAC;wBACD,cAAc,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;wBACnC,MAAM;oBACR,CAAC;gBACH,CAAC;YACH,CAAC;iBAAM,IAAI,cAAc,CAAC,MAAM,EAAE,CAAC;gBACjC,GAAG,CAAC,aAAa,CAAC,cAAc,EAAE,GAAG,EAAE,GAAG,CAAC,CAAE,CAAC,CAAC;gBAC/C,IAAI,cAAc,CAAC,cAAc;oBAC/B,MAAM;YACV,CAAC;iBAAM,IAAI,cAAc,CAAC,QAAQ,EAAE,CAAC;gBACnC,GAAG,CAAC,eAAe,CAAC,cAAc,EAAE,GAAG,EAAE,GAAG,CAAC,CAAE,CAAC,CAAC;gBACjD,IAAI,cAAc,CAAC,cAAc;oBAC/B,MAAM;YACV,CAAC;QACH,CAAC;QACD,IAAI,cAAc,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;YACrC,OAAO,IAAI,CAAC;QACd,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;YACb,+DAA+D;YAC/D,0CAA0C;YAC1C,uDAAuD;YACvD,8FAA8F;YAC9F,mEAAmE;YACnE,gBAAgB;YAChB,8CAA8C;YAC9C,EAAE;YACF,IAAI,cAAc,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;gBACpC,cAAc,CAAC,mBAAmB,CAAC,IAAI,CAAC,CAAC;YAC7C,CAAC;YACD,OAAO,KAAK,CAAC;QACf,CAAC;QACD,0EAA0E;QAC1E,OAAO,KAAK,CAAC;IACf,CAAC;CAEF;AACD,4EAA4E;AAC5E,SAAS,qBAAqB,CAAC,KAAoB,EAAE,QAAgC,EAAE,YAAoB,EAAE,QAAsB;IACjI,KAAK,MAAM,SAAS,IAAI,KAAK,CAAC,YAAY,EAAE,CAAC;QAC3C,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,QAAQ,CAAC,EAAE,CAAC;YACnC,QAAQ,CAAC,sBAAsB,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC;YACzD,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;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    let trap = 0;\r\n    // double tol = vu_getMergeTol (pGraph);\r\n    const ray = Ray3d.createXAxis();\r\n    for (; movingPosition.getITag() === 0 && trap < 2;) {\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            if (movingPosition.node === lastBefore.node\r\n              && movingPosition.isFace\r\n              && (lastBefore.isEdge || lastBefore.isVertex)){\r\n              trap++;\r\n            } else {\r\n              trap = 0;\r\n            }\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    if (movingPosition.isAtXY(xyz.x, xyz.y))\r\n      return true;\r\n    if (trap > 1) {\r\n      // Ugh.  We exited the loop by repeatedly hitting the same node\r\n      // with edge or vertex type in lastBefore.\r\n      // This happens only when the target point is exterior.\r\n      // (Heavy triangulation use cases start with a convex hull and only do interior intersections,\r\n      //     so case only happens in contrived unit tests.... so far ...)\r\n      // What to mark?\r\n      // Leave it as is, but mark as exterior target\r\n      //\r\n      if (movingPosition.node !== undefined) {\r\n          movingPosition.setIsExteriorTarget(true);\r\n      }\r\n      return false;\r\n    }\r\n    // Murky here ...  should never be hit.  Has never been hit in unit tests.\r\n    return false;\r\n  }\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"]}
+{"version":3,"file":"InsertAndRetriangulateContext.js","sourceRoot":"","sources":["../../../src/topology/InsertAndRetriangulateContext.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,qBAAqB,CAAC;AAC7C,OAAO,EAAE,QAAQ,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AACxD,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AACxD,OAAO,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AACtD,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;;;GAGG;AACH,MAAM,CAAN,IAAY,sBAeX;AAfD,WAAY,sBAAsB;IAChC,gGAAgG;IAChG,uEAAM,CAAA;IACN,4EAA4E;IAC5E,yEAAO,CAAA;IACP;;;OAGG;IACH,yFAAe,CAAA;IACf;;;OAGG;IACH,2FAAgB,CAAA;AAClB,CAAC,EAfW,sBAAsB,KAAtB,sBAAsB,QAejC;AAED;;;;;;;GAOG;AACH,MAAM,OAAO,6BAA6B;IAMxC,YAAoB,KAAoB,EAAE,SAAiB;QACzD,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,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;IAC9B,CAAC;IACD,kDAAkD;IAC3C,MAAM,CAAC,MAAM,CAAC,KAAoB,EAAE,YAAoB,QAAQ,CAAC,mBAAmB;QACzF,OAAO,IAAI,6BAA6B,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;IAC7D,CAAC;IACD,uDAAuD;IACvD,IAAW,KAAK;QACd,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IACD;;;OAGG;IACK,2BAA2B,CAAC,WAAqB;QACvD,MAAM,OAAO,GAAG,WAAW,CAAC,oBAAoB,EAAE,CAAC;QACnD,IAAI,OAAO,GAAG,CAAC,IAAI,WAAW,CAAC,SAAS,CAAC,YAAY,CAAC,QAAQ,CAAC;YAC7D,OAAO;QACT,IAAI,CAAC,QAAQ,CAAC,aAAa,CAAC,WAAW,CAAC,CAAC;QACzC,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,CAAC;YACjC,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;QACnC,CAAC;IACH,CAAC;IACD,qDAAqD;IAC9C,KAAK;QACV,IAAI,CAAC,SAAS,GAAG,sBAAsB,CAAC,MAAM,EAAE,CAAC;IACnD,CAAC;IACD,kEAAkE;IAClE,IAAW,eAAe;QACxB,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IACD,0DAA0D;IACnD,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,CAAC;YAC7C,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,CAAC;gBAC5B,IAAI,SAAS,GAAG,GAAG,EAAE,CAAC;oBACpB,SAAS,GAAG,GAAG,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;oBAClC,IAAI,SAAS,GAAG,QAAQ,CAAC,OAAO,EAAG,EAAE,CAAC;wBACpC,QAAQ,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;wBAC9B,QAAQ,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;oBAC9B,CAAC;gBACH,CAAC;qBAAM,IAAI,SAAS,GAAG,GAAG,EAAE,CAAC;oBAC3B,SAAS,GAAG,GAAG,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;oBAClC,IAAI,SAAS,GAAG,QAAQ,CAAC,OAAO,EAAG,EAAE,CAAC;wBACpC,QAAQ,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;wBAC9B,QAAQ,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;oBAC9B,CAAC;gBACH,CAAC;qBAAM,CAAC;oBACN,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,CAAC;wBACpC,QAAQ,CAAC,sBAAsB,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;oBACpD,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD,kDAAkD;IAC3C,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,CAAC;YAC7C,SAAS,GAAG,GAAG,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;YAClC,IAAI,SAAS,GAAG,QAAQ,CAAC,OAAO,EAAG,EAAE,CAAC;gBACpC,QAAQ,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;gBAC9B,QAAQ,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;YAC9B,CAAC;QACH,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD;;;;MAIE;IACK,WAAW,CAAC,GAAY,EAAE,cAAuB;QACtD,IAAI,cAAc;YAChB,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;IACD,0FAA0F;IAClF,iBAAiB,CAAC,KAAc;QACtC,IAAI,SAAS,KAAK,IAAI,CAAC,SAAS,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,QAAQ,CAAC;YACrH,OAAO,KAAK,CAAC;QACf,MAAM,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;QACjD,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC,IAAc,EAAE,EAAE;YACpE,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;YACzC,EAAU,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC,mCAAmC;YAC5D,OAAO,EAAE,CAAC;QACZ,CAAC,CAAC,CAAC;QACH,MAAM,MAAM,GAAG,UAAU,CAAC,sBAAsB,CAAC,IAAI,EAAE,OAAO,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;QACjF,MAAM,CAAC,MAAM,CAAC,IAAI,KAAK,eAAe,CAAC,qBAAqB,CAAC,CAAC;QAC9D,IAAI,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,UAAU;YAC5B,OAAO,KAAK,CAAC;QACf,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,gBAAgB,CAAC,CAAC,IAAI,CAAC;QAChD,MAAM,MAAM,GAAG,CAAC,MAAM,CAAC,gBAAgB,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC;QAC3E,IAAI,MAAM,CAAC,KAAK,CAAC,iBAAiB,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU;YAC7E,IAAI,CAAC,SAAS,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;;YAErC,IAAI,CAAC,SAAS,CAAC,sBAAsB,CAAC,IAAI,EAAE,MAAM,CAAC,gBAAgB,CAAC,CAAC;QACvE,OAAO,IAAI,CAAC;IACd,CAAC;IACD,sGAAsG;IAC9F,iBAAiB,CAAC,KAAc;QACtC,IAAI,SAAS,KAAK,IAAI,CAAC,SAAS,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,aAAa,CAAC;YAC1H,OAAO,KAAK,CAAC;QACf,MAAM,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;QACjD,MAAM,SAAS,GAAc,EAAE,CAAC;QAChC,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,aAAa,EAAE,CAAC,KAAK,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,aAAa,EAAE,CAAC;YAC/F,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YACnC,EAAU,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,kDAAkD;YACxE,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACrB,CAAC;QACD,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,iBAAiB,EAAE,CAAC,KAAK,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,CAAC,aAAa,EAAE,CAAC;YAC5G,MAAM,EAAE,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;YACnC,EAAU,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,mDAAmD;YACzE,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACrB,CAAC;QACD,MAAM,MAAM,GAAG,UAAU,CAAC,sBAAsB,CAAC,SAAS,EAAE,OAAO,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;QACtF,IAAI,MAAM,CAAC,CAAC,GAAG,IAAI,CAAC,UAAU;YAC5B,OAAO,KAAK,CAAC;QACf,MAAM,IAAI,GAAI,SAAS,CAAC,MAAM,CAAC,gBAAgB,CAAS,CAAC,IAAI,CAAC;QAC9D,MAAM,MAAM,GAAG,CAAC,MAAM,CAAC,gBAAgB,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC;QAC3E,IAAI,MAAM,CAAC,IAAI,KAAK,eAAe,CAAC,eAAe,EAAE,wDAAwD;YAC3G,IAAI,CAAC,SAAS,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;aAClC,IAAI,MAAM,CAAC,KAAK,CAAC,iBAAiB,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,UAAU;YAClF,IAAI,CAAC,SAAS,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;;YAErC,IAAI,CAAC,SAAS,CAAC,sBAAsB,CAAC,IAAI,EAAE,MAAM,CAAC,gBAAgB,CAAC,CAAC;QACvE,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;;OAGG;IACK,mBAAmB,CAAC,IAAc,EAAE,KAAc,EAAE,OAA+B;QACzF,IAAI,sBAAsB,CAAC,MAAM,KAAK,OAAO;YAC3C,OAAO;QACT,IAAI,CAAC,sBAAsB,CAAC,eAAe,KAAK,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC;YAC7E,OAAO;QACT,IAAI,CAAC,sBAAsB,CAAC,gBAAgB,KAAK,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC;YAC9E,OAAO;QACT,gEAAgE;QAChE,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;IACnD,CAAC;IACD;;;;;;OAMG;IACI,sBAAsB,CAAC,KAAc,EAAE,QAAgC;QAC5E,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;QACxC,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,KAAK,SAAS;YACnC,OAAO,KAAK,CAAC;QACf,mHAAmH;QACnH,2GAA2G;QAC3G,wBAAwB;QACxB,IAAI,CAAC,IAAI,CAAC,iBAAiB,CAAC,KAAK,CAAC;YAChC,IAAI,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC;QAChC,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC;YAC1B,6DAA6D;YAC7D,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC1D,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,qBAAqB,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;gBACxG,IAAI,CAAC,2BAA2B,CAAC,OAAO,CAAC,CAAC;gBAC1C,YAAY,CAAC,sBAAsB,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;gBAChE,IAAI,CAAC,SAAS,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;YACxC,CAAC;QACH,CAAC;aAAM,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC;YACjC,+DAA+D;YAC/D,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,mBAAmB,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,YAAa,CAAC,CAAC;YAChG,MAAM,IAAI,GAAG,IAAI,CAAC,iBAAiB,CAAC;YACpC,IAAI,CAAC,mBAAmB,CAAC,IAAI,EAAE,KAAK,EAAE,sBAAsB,CAAC,OAAO,CAAC,CAAC,CAAE,iBAAiB;YACzF,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;QACrC,CAAC;aAAM,IAAI,IAAI,CAAC,SAAS,CAAC,QAAQ,EAAE,CAAC;YACnC,0FAA0F;YAC1F,IAAI,CAAC,mBAAmB,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC;QACjE,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;;;;;OAMG;IACI,WAAW,CAChB,cAAsC,EACtC,MAAe,EACf,SAAyD;QAEzD,MAAM,GAAG,GAAG,kBAAkB,CAAC,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACvD,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QAC1B,IAAI,cAAc,CAAC,cAAc,EAAE,CAAC;YAClC,qBAAqB,CAAC,IAAI,CAAC,KAAK,EAAE,cAAc,EAAE,GAAG,EAAE,YAAY,CAAC,SAAS,CAAC,CAAC;YAC/E,IAAI,cAAc,CAAC,cAAc;gBAC/B,OAAO,KAAK,CAAC;QACjB,CAAC;QACD,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,MAAM,GAAG,GAAG,KAAK,CAAC,WAAW,EAAE,CAAC;QAChC,OAAO,cAAc,CAAC,OAAO,EAAE,KAAK,CAAC,IAAI,IAAI,GAAG,CAAC,GAAG,CAAC;YACnD,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;gBAC5B,MAAM,cAAc,GAAG,SAAS,CAAC,cAAc,CAAC,CAAC;gBACjD,IAAI,CAAC,cAAc;oBACjB,MAAM;YACV,CAAC;YACD,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,cAAc,EAAE,MAAM,EAAE,GAAG,CAAC,EAAE,CAAC;gBACnD,OAAO,KAAK,CAAC;YACf,CAAC;iBAAM,IAAI,cAAc,CAAC,MAAM,EAAE,CAAC;gBACjC,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,wDAAwD;gBACxD,QAAQ,EAAE,EAAE,CAAC;oBACX,KAAK,iBAAiB,CAAC,MAAM,CAAC,CAAC,CAAC;wBAC9B,cAAc,CAAC,cAAc,EAAE,CAAC;wBAChC,MAAM;oBACR,CAAC;oBACD,KAAK,iBAAiB,CAAC,cAAc,CAAC,CAAC,CAAC;wBACtC,cAAc,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;wBACnC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;wBAC1B,MAAM;oBACR,CAAC;oBACD,KAAK,iBAAiB,CAAC,YAAY,CAAC,CAAC,CAAC;wBACpC,cAAc,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;wBACnC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;wBAC1B,MAAM;oBACR,CAAC;oBACD,KAAK,iBAAiB,CAAC,OAAO,CAAC,CAAC,CAAC;wBAC/B,cAAc,CAAC,WAAW,CAAC,UAAU,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;wBACpD,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;wBAC1B,MAAM;oBACR,CAAC;oBACD,KAAK,iBAAiB,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,uBAAuB;wBAC5D,cAAc,CAAC,WAAW,CAAC,cAAc,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;wBACxD,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;wBAC1B,MAAM;oBACR,CAAC;oBACD,KAAK,iBAAiB,CAAC,WAAW,CAAC,CAAC,CAAC;wBACnC,IAAI,cAAc,CAAC,IAAI,KAAK,UAAU,CAAC,IAAI;+BACtC,cAAc,CAAC,MAAM;+BACrB,CAAC,UAAU,CAAC,MAAM,IAAI,UAAU,CAAC,QAAQ,CAAC,EAAE,CAAC;4BAChD,IAAI,EAAE,CAAC;wBACT,CAAC;6BAAM,CAAC;4BACN,IAAI,GAAG,CAAC,CAAC;wBACX,CAAC;wBACD,cAAc,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;wBACnC,MAAM;oBACR,CAAC;gBACH,CAAC;YACH,CAAC;iBAAM,IAAI,cAAc,CAAC,MAAM,EAAE,CAAC;gBACjC,GAAG,CAAC,aAAa,CAAC,cAAc,EAAE,GAAG,EAAE,GAAG,CAAC,CAAE,CAAC,CAAC;gBAC/C,IAAI,cAAc,CAAC,cAAc;oBAC/B,MAAM;YACV,CAAC;iBAAM,IAAI,cAAc,CAAC,QAAQ,EAAE,CAAC;gBACnC,GAAG,CAAC,eAAe,CAAC,cAAc,EAAE,GAAG,EAAE,GAAG,CAAC,CAAE,CAAC,CAAC;gBACjD,IAAI,cAAc,CAAC,cAAc;oBAC/B,MAAM;YACV,CAAC;QACH,CAAC;QACD,IAAI,cAAc,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;YAC3C,OAAO,IAAI,CAAC;QACd,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;YACb,sGAAsG;YACtG,yGAAyG;YACzG,+FAA+F;YAC/F,4DAA4D;YAC5D,IAAI,cAAc,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;gBACtC,cAAc,CAAC,mBAAmB,CAAC,IAAI,CAAC,CAAC;YAC3C,CAAC;YACD,OAAO,KAAK,CAAC;QACf,CAAC;QACD,qEAAqE;QACrE,OAAO,KAAK,CAAC;IACf,CAAC;CACF;AACD,0EAA0E;AAC1E,SAAS,qBAAqB,CAC5B,KAAoB,EAAE,QAAgC,EAAE,YAAoB,EAAE,QAAsB;IAEpG,KAAK,MAAM,SAAS,IAAI,KAAK,CAAC,YAAY,EAAE,CAAC;QAC3C,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,QAAQ,CAAC,EAAE,CAAC;YACnC,QAAQ,CAAC,sBAAsB,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC;YACzD,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n/** @packageDocumentation\n * @module Topology\n */\n\nimport { assert } from \"@itwin/core-bentley\";\nimport { Geometry, PolygonLocation } from \"../Geometry\";\nimport { Point3d } from \"../geometry3d/Point3dVector3d\";\nimport { PolygonOps } from \"../geometry3d/PolygonOps\";\nimport { Ray3d } from \"../geometry3d/Ray3d\";\nimport { SmallSystem } from \"../numerics/Polynomials\";\nimport { HalfEdge, HalfEdgeGraph, HalfEdgeMask } from \"./Graph\";\nimport { MarkedEdgeSet } from \"./HalfEdgeMarkSet\";\nimport { PointSearchContext, RayClassification } from \"./HalfEdgePointInGraphSearch\";\nimport { HalfEdgePositionDetail } from \"./HalfEdgePositionDetail\";\nimport { Triangulator } from \"./Triangulation\";\n\n/**\n * Options for setting the z-coordinate of a vertex in the triangulation when a point with the same xy is inserted.\n * @internal\n */\nexport enum InsertedVertexZOptions {\n  /** The point's z-coordinate is ignored, and the existing vertex's z-coordinate is unchanged. */\n  Ignore,\n  /** The point's z-coordinate replaces the existing vertex's z-coordinate. */\n  Replace,\n  /**\n   * Like [[InsertedVertexZOptions.Replace]], but the existing vertex's z-coordinate is updated only if the\n   * point's z-coordinate is larger.\n   */\n  ReplaceIfLarger,\n  /**\n   * Like [[InsertedVertexZOptions.Replace]], but the existing vertex's z-coordinate is updated only if the\n   * point's z-coordinate is smaller.\n   */\n  ReplaceIfSmaller,\n}\n\n/**\n * Context for repeated insertion of new points in a graph.\n * * Initial graph should have clean outer boundary (e.g., as typically marked with `HalfEdgeMask.EXTERIOR` and\n * `HalfEdgeMask.BOUNDARY_EDGE`).\n * * After each insertion, the current \"position\" within the graph is remembered so that each subsequent insertion\n * can reuse that position as start for walking to the new point.\n * @internal\n */\nexport class InsertAndRetriangulateContext {\n  private _graph: HalfEdgeGraph;\n  private _edgeSet: MarkedEdgeSet;\n  private _searcher: HalfEdgePositionDetail;\n  private _tolerance: number;\n\n  private constructor(graph: HalfEdgeGraph, tolerance: number) {\n    this._graph = graph;\n    this._edgeSet = MarkedEdgeSet.create(graph)!;\n    this._searcher = HalfEdgePositionDetail.create();\n    this._tolerance = tolerance;\n  }\n  /** Create a new context referencing the graph. */\n  public static create(graph: HalfEdgeGraph, tolerance: number = Geometry.smallMetricDistance) {\n    return new InsertAndRetriangulateContext(graph, tolerance);\n  }\n  /** Query the (pointer to) the graph in the context. */\n  public get graph(): HalfEdgeGraph {\n    return this._graph;\n  }\n  /**\n   * Walk face from edgeNode. Insert new edges back to start node from all except immediate successor and predecessor.\n   * Insert all new nodes and nodes of the existing face in edgeSet.\n   */\n  private retriangulateFromBaseVertex(centralNode: HalfEdge) {\n    const numNode = centralNode.countEdgesAroundFace();\n    if (numNode < 4 || centralNode.isMaskSet(HalfEdgeMask.EXTERIOR))\n      return;\n    this._edgeSet.addAroundFace(centralNode);\n    const numEdge = numNode - 3;\n    let farNode = centralNode.faceSuccessor;\n    let nearNode = centralNode;\n    for (let i = 0; i < numEdge; i++) {\n      farNode = farNode.faceSuccessor;\n      nearNode = this._graph.createEdgeHalfEdgeHalfEdge(nearNode, 0, farNode, 0);\n      farNode = nearNode.faceSuccessor;\n      this._edgeSet.addToSet(nearNode);\n    }\n  }\n  /** Reset the \"current\" position to unknown state. */\n  public reset() {\n    this._searcher = HalfEdgePositionDetail.create();\n  }\n  /** Return a (reference to!) the current position in the graph. */\n  public get currentPosition() {\n    return this._searcher;\n  }\n  /** Linear search for the nearest graph edge or vertex. */\n  public searchForNearestEdgeOrVertex(xyz: Point3d): HalfEdgePositionDetail {\n    const position = HalfEdgePositionDetail.create();\n    position.setDTag(Number.MAX_VALUE);\n    const xyzC = Point3d.create();\n    let fractionC;\n    let distanceC;\n    for (const nodeA of this._graph.allHalfEdges) {\n      const nodeB = nodeA.faceSuccessor;\n      fractionC = SmallSystem.lineSegment3dXYClosestPointUnbounded(nodeA, nodeB, xyz);\n      if (fractionC !== undefined) {\n        if (fractionC > 1.0) {\n          distanceC = xyz.distanceXY(nodeB);\n          if (distanceC < position.getDTag()!) {\n            position.resetAsVertex(nodeB);\n            position.setDTag(distanceC);\n          }\n        } else if (fractionC < 0.0) {\n          distanceC = xyz.distanceXY(nodeA);\n          if (distanceC < position.getDTag()!) {\n            position.resetAsVertex(nodeA);\n            position.setDTag(distanceC);\n          }\n        } else {\n          nodeA.fractionToPoint3d(fractionC, xyzC);\n\n          distanceC = xyz.distanceXY(xyzC);\n          if (distanceC < position.getDTag()!) {\n            position.resetAtEdgeAndFraction(nodeA, fractionC);\n          }\n        }\n      }\n    }\n    return position;\n  }\n  /** Linear search for the nearest graph vertex. */\n  public searchForNearestVertex(xyz: Point3d): HalfEdgePositionDetail {\n    const position = HalfEdgePositionDetail.create();\n    position.setDTag(Number.MAX_VALUE);\n    let distanceA;\n    for (const nodeA of this._graph.allHalfEdges) {\n      distanceA = xyz.distanceXY(nodeA);\n      if (distanceA < position.getDTag()!) {\n        position.resetAsVertex(nodeA);\n        position.setDTag(distanceA);\n      }\n    }\n    return position;\n  }\n  /**\n   * Reset the \"current\" position to a vertex nearest the target point.\n   * @param xyz target point\n   * @param searchEdgesToo reset to nearest vertex or edge\n  */\n  public resetSearch(xyz: Point3d, searchEdgesToo: boolean): void {\n    if (searchEdgesToo)\n      this._searcher = this.searchForNearestEdgeOrVertex(xyz);\n    else\n      this._searcher = this.searchForNearestVertex(xyz);\n  }\n  /** Reclassify the current interior face hit if it is too close to an edge of the face. */\n  private reclassifyFaceHit(point: Point3d): boolean {\n    if (undefined === this._searcher.node || !this._searcher.isFace || this._searcher.node.isMaskSet(HalfEdgeMask.EXTERIOR))\n      return false;\n    const pointXY = Point3d.create(point.x, point.y);\n    const face = this._searcher.node.collectAroundFace((node: HalfEdge) => {\n      const xy = Point3d.create(node.x, node.y);\n      (xy as any).node = node; // decorate the point with the node\n      return xy;\n    });\n    const detail = PolygonOps.closestPointOnBoundary(face, pointXY, this._tolerance);\n    assert(detail.code === PolygonLocation.OnPolygonEdgeInterior);\n    if (detail.a > this._tolerance)\n      return false;\n    const edge = face[detail.closestEdgeIndex].node;\n    const vertex = (detail.closestEdgeParam < 0.5) ? edge : edge.faceSuccessor;\n    if (detail.point.distanceSquaredXY(vertex) <= this._tolerance * this._tolerance)\n      this._searcher.resetAsVertex(vertex);\n    else\n      this._searcher.resetAtEdgeAndFraction(edge, detail.closestEdgeParam);\n    return true;\n  }\n  /** Reclassify the current interior edge hit if it is too close to an edge of either adjacent face. */\n  private reclassifyEdgeHit(point: Point3d): boolean {\n    if (undefined === this._searcher.node || !this._searcher.isEdge || this._searcher.node.isMaskSet(HalfEdgeMask.BOUNDARY_EDGE))\n      return false;\n    const pointXY = Point3d.create(point.x, point.y);\n    const superFace: Point3d[] = [];\n    for (let n = this._searcher.node.faceSuccessor; n !== this._searcher.node; n = n.faceSuccessor) {\n      const xy = Point3d.create(n.x, n.y);\n      (xy as any).node = n; // decorate the point with a node of the left face\n      superFace.push(xy);\n    }\n    for (let n = this._searcher.node.vertexPredecessor; n !== this._searcher.node.edgeMate; n = n.faceSuccessor) {\n      const xy = Point3d.create(n.x, n.y);\n      (xy as any).node = n; // decorate the point with a node of the right face\n      superFace.push(xy);\n    }\n    const detail = PolygonOps.closestPointOnBoundary(superFace, pointXY, this._tolerance);\n    if (detail.a > this._tolerance)\n      return false;\n    const edge = (superFace[detail.closestEdgeIndex] as any).node;\n    const vertex = (detail.closestEdgeParam < 0.5) ? edge : edge.faceSuccessor;\n    if (detail.code === PolygonLocation.OnPolygonVertex) // can happen if superFace is non-concave (e.g., a dart)\n      this._searcher.resetAsVertex(vertex);\n    else if (detail.point.distanceSquaredXY(vertex) <= this._tolerance * this._tolerance)\n      this._searcher.resetAsVertex(vertex);\n    else\n      this._searcher.resetAtEdgeAndFraction(edge, detail.closestEdgeParam);\n    return true;\n  }\n  /**\n   * Given a point that was just inserted into the graph at the given node, apply the z-coordinate rule around\n   * the vertex loop.\n   */\n  private updateZAroundVertex(node: HalfEdge, point: Point3d, zOption: InsertedVertexZOptions): void {\n    if (InsertedVertexZOptions.Ignore === zOption)\n      return;\n    if ((InsertedVertexZOptions.ReplaceIfLarger === zOption) && (point.z <= node.z))\n      return;\n    if ((InsertedVertexZOptions.ReplaceIfSmaller === zOption) && (point.z >= node.z))\n      return;\n    // only replace z; preserving xy preserves convexity of the hull\n    node.setXYZAroundVertex(node.x, node.y, point.z);\n  }\n  /**\n   * Insert a new point into the graph and retriangulate.\n   * @param point the coordinates of the node to be inserted.\n   * @param newZWins rule governing when `point.z` should override the z-coordinate of an existing vertex with the\n   * same x and y.\n   * @returns true if and only if the point didn't need to be inserted or was successfully inserted.\n   */\n  public insertAndRetriangulate(point: Point3d, newZWins: InsertedVertexZOptions): boolean {\n    this.moveToPoint(this._searcher, point);\n    if (this._searcher.node === undefined)\n      return false;\n    // Try to avoid skinny triangles. If we iterated, this could get out of control (e.g., inserting point into a fan).\n    // Limiting to one reclassification ensures the hit doesn't move more than tol and reduces skinny triangles\n    // adjacent to the hull.\n    if (!this.reclassifyFaceHit(point))\n      this.reclassifyEdgeHit(point);\n    if (this._searcher.isFace) {\n      // insert point into the graph if it lies in an interior face\n      if (!this._searcher.node.isMaskSet(HalfEdgeMask.EXTERIOR)) {\n        const newNode = this._graph.createEdgeXYZHalfEdge(point.x, point.y, point.z, 0, this._searcher.node, 0);\n        this.retriangulateFromBaseVertex(newNode);\n        Triangulator.flipTrianglesInEdgeSet(this._graph, this._edgeSet);\n        this._searcher.resetAsVertex(newNode);\n      }\n    } else if (this._searcher.isEdge) {\n      // insert point into the graph by splitting its containing edge\n      const newA = this._graph.splitEdgeAtFraction(this._searcher.node, this._searcher.edgeFraction!);\n      const newB = newA.vertexPredecessor;\n      this.updateZAroundVertex(newA, point, InsertedVertexZOptions.Replace);  // always replace\n      this.retriangulateFromBaseVertex(newA);\n      this.retriangulateFromBaseVertex(newB);\n      Triangulator.flipTrianglesInEdgeSet(this._graph, this._edgeSet);\n      this._searcher.resetAsVertex(newA);\n    } else if (this._searcher.isVertex) {\n      // no need to insert point as there's already a vertex there, but maybe update its z-coord\n      this.updateZAroundVertex(this._searcher.node, point, newZWins);\n    }\n    return true;\n  }\n  /**\n   * Advance movingPosition to a face, edge, or vertex position detail that contains `target`.\n   * @param movingPosition input seed for search, updated on return.\n   * @param target point to search for containing topology in the graph.\n   * @param announcer optional callback invoked during search loop; return false to end search.\n   * @returns true if search was successful.\n   */\n  public moveToPoint(\n    movingPosition: HalfEdgePositionDetail,\n    target: Point3d,\n    announcer?: (position: HalfEdgePositionDetail) => boolean,\n  ): boolean {\n    const psc = PointSearchContext.create(this._tolerance);\n    movingPosition.setITag(0);\n    if (movingPosition.isUnclassified) {\n      moveToAnyUnmaskedEdge(this.graph, movingPosition, 0.5, HalfEdgeMask.NULL_MASK);\n      if (movingPosition.isUnclassified)\n        return false;\n    }\n    let trap = 0;\n    const ray = Ray3d.createXAxis();\n    for (; movingPosition.getITag() === 0 && trap < 2;) {\n      if (announcer !== undefined) {\n        const continueSearch = announcer(movingPosition);\n        if (!continueSearch)\n          break;\n      }\n      if (!psc.setSearchRay(movingPosition, target, ray)) {\n        return false;\n      } else if (movingPosition.isFace) {\n        const lastBefore = HalfEdgePositionDetail.create();\n        const firstAfter = HalfEdgePositionDetail.create();\n        const rc = psc.reAimAroundFace(movingPosition.node!, ray, ray.a!, lastBefore, firstAfter);\n        // reAimAroundFace returns lots of cases in `lastBefore`\n        switch (rc) {\n          case RayClassification.NoHits: {\n            movingPosition.resetAsUnknown();\n            break;\n          }\n          case RayClassification.TargetOnVertex: {\n            movingPosition.setFrom(lastBefore);\n            movingPosition.setITag(1);\n            break;\n          }\n          case RayClassification.TargetOnEdge: {\n            movingPosition.setFrom(lastBefore);\n            movingPosition.setITag(1);\n            break;\n          }\n          case RayClassification.Bracket: {\n            movingPosition.resetAsFace(lastBefore.node, target);\n            movingPosition.setITag(1);\n            break;\n          }\n          case RayClassification.TargetBefore: { // do we ever get here?\n            movingPosition.resetAsFace(movingPosition.node, target);\n            movingPosition.setITag(1);\n            break;\n          }\n          case RayClassification.TargetAfter: {\n            if (movingPosition.node === lastBefore.node\n              && movingPosition.isFace\n              && (lastBefore.isEdge || lastBefore.isVertex)) {\n              trap++;\n            } else {\n              trap = 0;\n            }\n            movingPosition.setFrom(lastBefore);\n            break;\n          }\n        }\n      } else if (movingPosition.isEdge) {\n        psc.reAimFromEdge(movingPosition, ray, ray.a!);\n        if (movingPosition.isUnclassified)\n          break;\n      } else if (movingPosition.isVertex) {\n        psc.reAimFromVertex(movingPosition, ray, ray.a!);\n        if (movingPosition.isUnclassified)\n          break;\n      }\n    }\n    if (movingPosition.isAtXY(target.x, target.y))\n      return true;\n    if (trap > 1) {\n      // ugh! We exited the loop by repeatedly hitting the same node with edge or vertex type in lastBefore.\n      // This happens only when the target point is exterior (heavy triangulation use cases start with a convex\n      // hull and only do interior intersections, so case only happens in contrived unit tests so far\n      // What to mark? Leave it as is, but mark as exterior target\n      if (movingPosition.node !== undefined) {\n        movingPosition.setIsExteriorTarget(true);\n      }\n      return false;\n    }\n    // murky here; should never be hit. Has never been hit in unit tests.\n    return false;\n  }\n}\n/** Set `position` to a random unmasked edge at the specified fraction. */\nfunction moveToAnyUnmaskedEdge(\n  graph: HalfEdgeGraph, position: HalfEdgePositionDetail, edgeFraction: number, skipMask: HalfEdgeMask,\n): boolean {\n  for (const candidate of graph.allHalfEdges) {\n    if (!candidate.isMaskSet(skipMask)) {\n      position.resetAtEdgeAndFraction(candidate, edgeFraction);\n      return true;\n    }\n  }\n  return false;\n}\n"]}

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

@@ -1 +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;;;;OAIG;IACH,YAAoB,SAAiB,EAAE,aAAqB;QAC1D,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;QAC5B,IAAI,CAAC,kBAAkB,GAAG,SAAS,CAAC;QACpC,IAAI,CAAC,cAAc,GAAG,aAAa,CAAC;IACtC,CAAC;IACD;;;;OAIG;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,CAAC;YAC5B,IAAI,CAAC,OAAO,GAAG,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC;gBAChC,SAAS,GAAG,OAAO,CAAC;gBACpB,MAAM;YACR,CAAC;YACD,OAAO,GAAG,CAAC,OAAO,IAAI,CAAC,CAAC,CAAC;QAC3B,CAAC;QACD,IAAI,SAAS,KAAK,CAAC;YACjB,OAAO,SAAS,CAAC;QACnB,OAAO,IAAI,WAAW,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;IAC/C,CAAC;IACD,yEAAyE;IAClE,QAAQ;QACb,IAAI,IAAI,CAAC,UAAU,KAAK,CAAC;YACvB,OAAO,CAAC,CAAC;QACX,IAAI,IAAI,GAAG,IAAI,CAAC,cAAc,CAAC;QAC/B,OAAO,CAAC,CAAC,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC;YAC9B,IAAI,GAAG,IAAI,IAAI,CAAC,CAAC;QACnB,IAAI,CAAC,UAAU,IAAI,CAAC,IAAI,CAAC;QACzB,OAAO,IAAI,CAAC;IACd,CAAC;IACD,8DAA8D;IACvD,QAAQ,CAAC,IAAY;QAC1B,IAAI,IAAI,IAAI,CAAC,kBAAkB,CAAC,CAAC,kDAAkD;QACnF,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC;IAC1B,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 * Methods to \"grab and drop\" mask bits.\r\n * * Caller code (e.g. HalfEdgeGraph) initializes with a block of bits to be managed.\r\n * * Callers borrow and return masks with \"grabMask\" and \"dropMask\".\r\n * * Callers must exercise grab/drop balance discipline.\r\n * @internal\r\n */\r\nexport class MaskManager {\r\n  private _freeMasks: number;\r\n  private _originalFreeMasks: number;\r\n  private _firstFreeMask: number;\r\n  /**\r\n   * Constructor\r\n   * @param freeMasks caller-defined block of bits that are to be managed.\r\n   * @param firstFreeMask the first free mask in the freeMasks bits block.\r\n   */\r\n  private constructor(freeMasks: number, firstFreeMask: number) {\r\n    this._freeMasks = freeMasks;\r\n    this._originalFreeMasks = freeMasks;\r\n    this._firstFreeMask = firstFreeMask;\r\n  }\r\n  /**\r\n   * Create a MaskManager.\r\n   * Typical use: MaskManager.create(0xFFFF0000)\r\n   * * This makes bits 16 through 31 available to be borrowed, with lower bits available for fixed usage.\r\n   */\r\n  public static create(freeMasks: number): MaskManager | undefined {\r\n    // look for first bit up to bit 31\r\n    let firstFree = 0;\r\n    let testBit = 0x01;\r\n    for (let i = 0; i < 32; i++) {\r\n      if ((testBit & freeMasks) !== 0) {\r\n        firstFree = testBit;\r\n        break;\r\n      }\r\n      testBit = (testBit << 1);\r\n    }\r\n    if (firstFree === 0)\r\n      return undefined;\r\n    return new MaskManager(freeMasks, firstFree);\r\n  }\r\n  /** Find a mask bit that is not \"in use\" in order to borrow that mask. */\r\n  public grabMask(): number {\r\n    if (this._freeMasks === 0)\r\n      return 0;\r\n    let mask = this._firstFreeMask;\r\n    while (!(mask & this._freeMasks))\r\n      mask = mask << 1;\r\n    this._freeMasks &= ~mask;\r\n    return mask;\r\n  }\r\n  /** Return the borrowed mask so it is not \"in use\" anymore. */\r\n  public dropMask(mask: number) {\r\n    mask &= this._originalFreeMasks; // prevent \"drop\" of mask that is not in the pool.\r\n    this._freeMasks |= mask;\r\n  }\r\n}\r\n"]}
+{"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;;;;OAIG;IACH,YAAoB,SAAiB,EAAE,aAAqB;QAC1D,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;QAC5B,IAAI,CAAC,kBAAkB,GAAG,SAAS,CAAC;QACpC,IAAI,CAAC,cAAc,GAAG,aAAa,CAAC;IACtC,CAAC;IACD;;;;OAIG;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,CAAC;YAC5B,IAAI,CAAC,OAAO,GAAG,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC;gBAChC,SAAS,GAAG,OAAO,CAAC;gBACpB,MAAM;YACR,CAAC;YACD,OAAO,GAAG,CAAC,OAAO,IAAI,CAAC,CAAC,CAAC;QAC3B,CAAC;QACD,IAAI,SAAS,KAAK,CAAC;YACjB,OAAO,SAAS,CAAC;QACnB,OAAO,IAAI,WAAW,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;IAC/C,CAAC;IACD,yEAAyE;IAClE,QAAQ;QACb,IAAI,IAAI,CAAC,UAAU,KAAK,CAAC;YACvB,OAAO,CAAC,CAAC;QACX,IAAI,IAAI,GAAG,IAAI,CAAC,cAAc,CAAC;QAC/B,OAAO,CAAC,CAAC,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC;YAC9B,IAAI,GAAG,IAAI,IAAI,CAAC,CAAC;QACnB,IAAI,CAAC,UAAU,IAAI,CAAC,IAAI,CAAC;QACzB,OAAO,IAAI,CAAC;IACd,CAAC;IACD,8DAA8D;IACvD,QAAQ,CAAC,IAAY;QAC1B,IAAI,IAAI,IAAI,CAAC,kBAAkB,CAAC,CAAC,kDAAkD;QACnF,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC;IAC1B,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 */\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   * Constructor\n   * @param freeMasks caller-defined block of bits that are to be managed.\n   * @param firstFreeMask the first free mask in the freeMasks bits block.\n   */\n  private constructor(freeMasks: number, firstFreeMask: number) {\n    this._freeMasks = freeMasks;\n    this._originalFreeMasks = freeMasks;\n    this._firstFreeMask = firstFreeMask;\n  }\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  /** Find a mask bit that is not \"in use\" in order to borrow that mask. */\n  public grabMask(): number {\n    if (this._freeMasks === 0)\n      return 0;\n    let mask = this._firstFreeMask;\n    while (!(mask & this._freeMasks))\n      mask = mask << 1;\n    this._freeMasks &= ~mask;\n    return mask;\n  }\n  /** Return the borrowed mask so it is not \"in use\" anymore. */\n  public dropMask(mask: number) {\n    mask &= this._originalFreeMasks; // prevent \"drop\" of mask that is not in the pool.\n    this._freeMasks |= mask;\n  }\n}\n"]}

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

@@ -144,8 +144,8 @@ export declare class HalfEdgeGraphMerge {
     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.
+     * * Graph gets full splitEdges, regularize (optional), and triangulate.
+     * @returns graph, or undefined if bad data.
      */
     static formGraphFromChains(chains: MultiLineStringDataVariant, regularize?: boolean, mask?: HalfEdgeMask): HalfEdgeGraph | undefined;
 }

package/lib/esm/topology/Merging.js

@@ -556,8 +556,8 @@ export class HalfEdgeGraphMerge {
     }
     /**
      * * Input is random linestrings, not necessarily loops
-     * * Graph gets full splitEdges, regularize, and triangulate.
-     * @returns triangulated graph, or undefined if bad data.
+     * * Graph gets full splitEdges, regularize (optional), and triangulate.
+     * @returns graph, or undefined if bad data.
      */
     static formGraphFromChains(chains, regularize = true, mask = HalfEdgeMask.PRIMARY_EDGE) {
         if (chains.length < 1)