@itwin/core-geometry 5.1.0-dev.9 → 5.2.0-dev.2

package/lib/cjs/curve/RegionOpsClassificationSweeps.js

@@ -4,7 +4,7 @@
 * See LICENSE.md in the project root for license terms and full copyright notice.
 *--------------------------------------------------------------------------------------------*/
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.GraphComponentArray = exports.GraphComponent = exports.RegionBooleanContext = exports.RegionGroup = exports.RegionGroupOpType = exports.RegionOpsFaceToFaceSearch = void 0;
+exports.GraphComponentArray = exports.GraphComponent = exports.RegionBooleanContext = exports.RegionGroup = exports.RegionGroupMember = exports.RegionGroupOpType = exports.RegionOpsFaceToFaceSearch = void 0;
 /** @packageDocumentation
  * @module Curve
  */
@@ -21,6 +21,7 @@ const CurveCurve_1 = require("./CurveCurve");
 const CurveLocationDetail_1 = require("./CurveLocationDetail");
 const GeometryQuery_1 = require("./GeometryQuery");
 const PlaneAltitudeRangeContext_1 = require("./internalContexts/PlaneAltitudeRangeContext");
+const TransferWithSplitArcs_1 = require("./internalContexts/TransferWithSplitArcs");
 const LineSegment3d_1 = require("./LineSegment3d");
 const Loop_1 = require("./Loop");
 const ParityRegion_1 = require("./ParityRegion");
@@ -43,14 +44,22 @@ const UnionRegion_1 = require("./UnionRegion");
  * @internal
  */
 class RegionOpsFaceToFaceSearchCallbacks {
-    /** Announce a representative node on the outer face of a component */
-    startComponent(_node) { return true; }
-    /** Announce return to outer face */
-    finishComponent(_node) { return true; }
-    /** Announce face entry */
-    enterFace(_facePathStack, _newFaceNode) { return true; }
-    /** Announce face exit */
-    leaveFace(_facePathStack, _newFaceNode) { return true; }
+    /** Announce a representative node on the outer face of a component. */
+    startComponent(_node) {
+        return true;
+    }
+    /** Announce return to outer face. */
+    finishComponent(_node) {
+        return true;
+    }
+    /** Announce face entry. */
+    enterFace(_facePathStack, _newFaceNode) {
+        return true;
+    }
+    /** Announce face exit. */
+    leaveFace(_facePathStack, _newFaceNode) {
+        return true;
+    }
 }
 /**
  * Implementation of `RegionOpsFaceToFaceSearchCallbacks` for binary boolean sweep with polygonal regions.
@@ -113,14 +122,14 @@ class RegionOpsBinaryBooleanSweepCallbacks extends RegionOpsFaceToFaceSearchCall
  */
 class RegionOpsFaceToFaceSearch {
     /**
-     * run a DFS with face-to-face step announcements.
+     * Run a DFS with face-to-face step announcements.
      * * false return from any function terminates search immediately.
      * * all reachable nodes assumed to have both visit masks clear.
      * @param graph containing graph.
      * @param seed first node to visit.
      * @param faceHasBeenVisited mask marking faces that have been seen.
      * @param nodeHasBeenVisited mask marking node-to-node step around face.
-     *
+     * @param callbacks callbacks.
      */
     static faceToFaceSearchFromOuterLoop(_graph, seed, faceHasBeenVisited, nodeHasBeenVisited, callbacks) {
         if (seed.isMaskSet(faceHasBeenVisited))
@@ -134,10 +143,10 @@ class RegionOpsFaceToFaceSearch {
             let entryNode = faceWalker;
             let mate = faceWalker.edgeMate;
             if (!mate.isMaskSet(faceHasBeenVisited)) {
-                // the faceWalker seed is always on the base of the stack.
-                // the stack then contains even-odd pairs of (entryNode, currentNode)
-                // * entryNode is the node where a face was entered.
-                // * faceNode is another node around that face.
+                // The faceWalker seed is always on the base of the stack.
+                // The stack then contains even-odd pairs of (entryNode, faceNode).
+                // entryNode is the node where a face was entered.
+                // faceNode is another node around that face.
                 facePathStack.push(faceWalker);
                 facePathStack.push(mate);
                 let faceNode = mate.faceSuccessor;
@@ -168,13 +177,13 @@ class RegionOpsFaceToFaceSearch {
                             entryNode = facePathStack[facePathStack.length - 1];
                         }
                         if (faceNode.isMaskSet(nodeHasBeenVisited)) {
-                            // this is disaster !!!
+                            // this is disaster
                             return;
                         }
                     }
                 }
             }
-            // continue at outermost level .....
+            // continue at outermost level
             faceWalker = faceWalker.faceSuccessor;
         } while (faceWalker !== seed);
         callbacks.finishComponent(seed);
@@ -305,8 +314,11 @@ class RegionGroupMember {
         this.parentGroup = parentGroup;
         this.sweepState = 0;
     }
-    clearState() { this.sweepState = 0; }
+    clearState() {
+        this.sweepState = 0;
+    }
 }
+exports.RegionGroupMember = RegionGroupMember;
 /**
  * A `RegionGroup` is
  * * An array of `RegionGroupMembers`, carrying the regions of the Ai or Bi part of the boolean expression.
@@ -344,8 +356,7 @@ class RegionGroup {
         }
         return range;
     }
-    /** Ask if the current _numIn count qualifies as an "in" for this operation type.
-     */
+    /** Ask if the current _numIn count qualifies as an "in" for this operation type. */
     getInOut() {
         // UNION is true if one or more members are IN
         if (this.groupOpType === RegionGroupOpType.Union)
@@ -361,8 +372,9 @@ class RegionGroup {
     // push new members into the group.
     addMember(data, allowLineSegment = false) {
         if (data instanceof Loop_1.Loop || data instanceof ParityRegion_1.ParityRegion) {
-            const cleanerData = data.clone();
+            let cleanerData = data.clone();
             RegionOps_1.RegionOps.consolidateAdjacentPrimitives(cleanerData);
+            cleanerData = TransferWithSplitArcs_1.TransferWithSplitArcs.clone(cleanerData);
             this.members.push(new RegionGroupMember(cleanerData, this));
         }
         else if (data instanceof UnionRegion_1.UnionRegion) {
@@ -393,28 +405,29 @@ exports.RegionGroup = RegionGroup;
 /**
  * A `RegionBooleanContext` carries structure and operations for binary operations between two sets of regions.
  * * In the binary operation OP (union, intersection, parity, difference), the left and right operands
- *     are each a composite union, difference, or parity among multiple inputs, i.e.
+ * are each a composite union, difference, or parity among multiple inputs, i.e.,
  *   * (operationA among Ai) OP (operationB among Bi)
  *   * where the Ai are one set of regions, being combined by operationA
- *   * and the Bi are the another set of regions, being combined by operationB
- * * Each group of Ai and Bi is a `RegionGroup`
+ *   * and the Bi are the another set of regions, being combined by operationB.
+ * * Each group of Ai and Bi is a `RegionGroup`.
  * * This is an extremely delicate structure.
  * * Members are public because of the unique variety of queries, but should only be used for queries.
  * * The graph and curves in the booleans are connected by an extended pointer chain:
- *    * (HalfEdge in Graph).edgeTag points to a CurveLocationDetail
- *    * (CurveLocationDetail).curve points to a curve
- *    * (Curve).parent points to RegionGroupMember
- *    * (RegionGroupMember) points to RegionGroup
- *    * (RegionGroup) points to RegionBooleanBinaryContext
- * * So..when a graph sweep crosses an edge,
- *    * the chain leads to a parity count in the RegionGroupMember
- *    * that can change the number of members active in the RegionGroup
+ *    * (HalfEdge in Graph).edgeTag points to a CurveLocationDetail.
+ *    * (CurveLocationDetail).curve points to a curve.
+ *    * (Curve).parent points to RegionGroupMember.
+ *    * (RegionGroupMember) points to RegionGroup.
+ *    * (RegionGroup) points to RegionBooleanBinaryContext.
+ * * So when a graph sweep crosses an edge
+ *    * the chain leads to a parity count in the RegionGroupMember.
+ *    * that can change the number of members active in the RegionGroup.
  *    * which can change the state of the context.
  * @internal
  */
 class RegionBooleanContext {
     groupA;
     groupB;
+    /** bridge edges */
     extraGeometry;
     graph;
     faceAreaFunction;
@@ -423,7 +436,7 @@ class RegionBooleanContext {
         this.groupA = new RegionGroup(this, groupTypeA);
         this.groupB = new RegionGroup(this, groupTypeB);
         this.extraGeometry = new RegionGroup(this, RegionGroupOpType.NonBounding);
-        this.binaryOp = RegionOps_1.RegionBinaryOpType.Union; // it will be revised on can calls.
+        this.binaryOp = RegionOps_1.RegionBinaryOpType.Union; // revised in runClassificationSweep
     }
     /**
      * Create a context with both A and B groups empty.
@@ -437,8 +450,6 @@ class RegionBooleanContext {
     addMembers(dataA, dataB) {
         this.groupA.addMember(dataA);
         this.groupB.addMember(dataB);
-        // const doConnectives = 1;
-        // if (doConnectives !== 0)
         this.addConnectives();
     }
     _workSegment;
@@ -482,18 +493,106 @@ class RegionBooleanContext {
         }
         const ray = Ray3d_1.Ray3d.createZero();
         for (const p of maxPoints) {
-            // Make a line from...
-            //  1) exactly the max point of the loops to
-            //  2) a point clearly outside the big range
-            // If p came from some inner loop this will...
-            //  1) create a bridge from the inner loop through any containing loops (always)
-            //  2) avoid crossing any containing loop at a vertex. (with high probability, but not absolutely always)
+            // Make a line from
+            //    1) exactly the max point of the loops to
+            //    2) a point clearly outside the big range
+            // If p came from some inner loop this will
+            //    1) create a bridge from the inner loop through any containing loops (always)
+            //    2) avoid crossing any containing loop at a vertex. (with high probability, but not absolutely always)
             const bridgeLength = margin + Ray3d_1.Ray3d.create(p, RegionBooleanContext._bridgeDirection, ray).intersectionWithRange3d(rangeAB).high;
             const outside = Point3dVector3d_1.Point3d.createAdd2Scaled(p, 1.0, RegionBooleanContext._bridgeDirection, bridgeLength);
             const bridgeLine = LineSegment3d_1.LineSegment3d.createXYXY(p.x, p.y, outside.x, outside.y);
             this.extraGeometry.addMember(bridgeLine, true);
         }
     }
+    /**
+     * Simplify the graph by removing bridge edges that do not serve to connect inner and outer loops, i.e.:
+     * * the bridge edge is dangling
+     * * the bridge edge is adjacent to multiple faces
+     * * the bridge edge is adjacent to a negative area face
+     * @returns the number of extraneous bridge edges removed from the graph.
+     */
+    removeExtraneousBridgeEdges() {
+        const toHeal = [];
+        const interiorBridges = [];
+        // lambda test for boundary edge. Relies only on face loop orientation. Doesn't use HalfEdgeMasks!
+        const isExteriorEdge = (node) => {
+            if (this.faceAreaFunction(node) < 0.0)
+                return true;
+            if (!node.findAroundFace(node.edgeMate))
+                return this.faceAreaFunction(node.edgeMate) < 0.0;
+            return false;
+        };
+        // isolate dangling bridges, bridges separating different faces, and "exterior" bridges in the negative area face
+        this.graph.announceEdges((_graph, node) => {
+            if (node.edgeTag !== undefined) {
+                if (node.edgeTag instanceof CurveLocationDetail_1.CurveLocationDetail) {
+                    if (node.edgeTag.curve) {
+                        if (node.edgeTag.curve.parent instanceof RegionGroupMember) {
+                            if (node.edgeTag.curve.parent.parentGroup === this.extraGeometry) {
+                                if (node.isDangling || node.edgeMate.isDangling || !node.findAroundFace(node.edgeMate) || this.faceAreaFunction(node) < 0.0) {
+                                    toHeal.push(node.vertexSuccessor);
+                                    toHeal.push(node.edgeMate.vertexSuccessor);
+                                    node.isolateEdge();
+                                }
+                                else {
+                                    interiorBridges.push(node);
+                                }
+                            }
+                        }
+                    }
+                }
+            }
+            return true;
+        });
+        // At this point, all bridges that were exterior are isolated, but this may have caused formerly
+        // interior bridges to become exterior. Now we successively isolate exterior bridges until none remain.
+        let numIsolatedThisPass;
+        do {
+            numIsolatedThisPass = 0;
+            for (const node of interiorBridges) {
+                if (!node.isIsolatedEdge && isExteriorEdge(node)) {
+                    toHeal.push(node.vertexSuccessor);
+                    toHeal.push(node.edgeMate.vertexSuccessor);
+                    node.isolateEdge();
+                    numIsolatedThisPass++;
+                }
+            }
+        } while (numIsolatedThisPass > 0);
+        // lambda to extend the detail interval on a side of a healed edge
+        const mergeDetails = (he, newFraction, newPoint) => {
+            if (he && he.edgeTag instanceof CurveLocationDetail_1.CurveLocationDetail && he.sortData !== undefined && newFraction !== undefined && newPoint) {
+                if (he.sortData > 0)
+                    he.edgeTag.captureFraction1Point1(newFraction, newPoint);
+                else
+                    he.edgeTag.captureFractionPoint(newFraction, newPoint);
+            }
+        };
+        // At this point all removable bridges are isolated. Clean up their original vertex loops, if possible.
+        for (const doomedA of toHeal) {
+            const doomedB = doomedA.vertexSuccessor;
+            if ( // are the geometries mergeable?
+            doomedA !== doomedB &&
+                doomedA.edgeTag instanceof CurveLocationDetail_1.CurveLocationDetail && doomedA.sortData !== undefined &&
+                doomedB.edgeTag instanceof CurveLocationDetail_1.CurveLocationDetail && doomedB.sortData !== undefined &&
+                doomedA.edgeTag.curve === doomedB.edgeTag.curve &&
+                doomedA.edgeTag.hasFraction1 && doomedB.edgeTag.hasFraction1 &&
+                doomedA.sortData * doomedB.sortData < 0 &&
+                ((doomedA.sortData > 0 && Geometry_1.Geometry.isSmallRelative(doomedA.edgeTag.fraction - doomedB.edgeTag.fraction1)) ||
+                    (doomedA.sortData < 0 && Geometry_1.Geometry.isSmallRelative(doomedA.edgeTag.fraction1 - doomedB.edgeTag.fraction)))) {
+                const survivorA = Graph_1.HalfEdge.healEdge(doomedA, false);
+                if (survivorA) {
+                    const endFractionA = (doomedA.sortData > 0) ? doomedA.edgeTag.fraction1 : doomedA.edgeTag.fraction;
+                    const endPointA = (doomedA.sortData > 0) ? doomedA.edgeTag.point1 : doomedA.edgeTag.point;
+                    mergeDetails(survivorA, endFractionA, endPointA);
+                    const endFractionB = (doomedB.sortData > 0) ? doomedB.edgeTag.fraction1 : doomedB.edgeTag.fraction;
+                    const endPointB = (doomedB.sortData > 0) ? doomedB.edgeTag.point1 : doomedB.edgeTag.point;
+                    mergeDetails(survivorA.edgeMate, endFractionB, endPointB);
+                }
+            }
+        }
+        return this.graph.deleteIsolatedEdges();
+    }
     /**
      * Markup and assembly steps for geometry in the RegionGroups.
      * * Annotate connection from group to curves.
@@ -504,7 +603,7 @@ class RegionBooleanContext {
      */
     annotateAndMergeCurvesInGraph(mergeTolerance = Geometry_1.Geometry.smallMetricDistance) {
         const allPrimitives = [];
-        // ASSUME loops have fine-grained types -- no linestrings !!
+        // ASSUME loops have fine-grained types (no linestrings)
         for (const group of [this.groupA, this.groupB, this.extraGeometry]) {
             for (const member of group.members) {
                 let k = allPrimitives.length;
@@ -515,11 +614,11 @@ class RegionBooleanContext {
                 }
             }
         }
-        //    const range = RegionOps.curveArrayRange(allPrimitives);
         const intersections = CurveCurve_1.CurveCurve.allIntersectionsAmongPrimitivesXY(allPrimitives, mergeTolerance);
         const graph = PlanarSubdivision_1.PlanarSubdivision.assembleHalfEdgeGraph(allPrimitives, intersections, mergeTolerance);
         this.graph = graph;
         this.faceAreaFunction = faceAreaFromCurvedEdgeData;
+        this.removeExtraneousBridgeEdges();
     }
     _announceFaceFunction;
     /**
@@ -534,9 +633,8 @@ class RegionBooleanContext {
         this._announceFaceFunction = announceFaceFunction;
         this.binaryOp = binaryOp;
         this.graph.clearMask(Graph_1.HalfEdgeMask.EXTERIOR);
-        for (const group of [this.groupA, this.groupB]) {
+        for (const group of [this.groupA, this.groupB])
             group.clearState();
-        }
         const faceHasBeenVisitedMask = this.graph.grabMask();
         const nodeHasBeenVisitedMask = this.graph.grabMask();
         const componentArray = GraphComponentArray.create(this.graph);
@@ -617,18 +715,19 @@ class RegionBooleanContext {
         return undefined;
     }
     // obligations to act as sweep callback ...
-    /** Announce a representative node on the outer face of a component */
+    /** Announce a representative node on the outer face of a component. */
     startComponent(outerFaceNode) {
         outerFaceNode.setMaskAroundFace(Graph_1.HalfEdgeMask.EXTERIOR);
         if (this._announceFaceFunction)
             this._announceFaceFunction(this.graph, outerFaceNode, -1, faceAreaFromCurvedEdgeData(outerFaceNode));
         return true;
     }
-    /** Announce return to outer face */
+    /** Announce return to outer face. */
     finishComponent(_node) {
         return true;
     }
-    /** Announce entry to a graph face.
+    /**
+     * Announce entry to a graph face.
      * * Both both sides of a graph edge are from the same RegionGroupMember.
      * * Hence "crossing that edge" changes the parity count for the RegionGroupMember that owns that edge by 1.
      * * The parity count for other RegionGroupMembers are never affected by this crossing.
@@ -650,8 +749,9 @@ class RegionBooleanContext {
     }
 }
 exports.RegionBooleanContext = RegionBooleanContext;
-/** return xy area between a (part of a) curve and the x axis through a reference point.
- * If detail is undefined or does not have both start and end fractions, just do trapezoid area
+/**
+ * Return xy area between (part of) a curve and the x axis through a reference point.
+ * If detail is undefined or does not have both start and end fractions, just do trapezoid area.
  */
 function areaUnderPartialCurveXY(detail, xyStart, xyEnd, referencePoint) {
     // area between trapezoid and axis
@@ -665,15 +765,21 @@ function areaUnderPartialCurveXY(detail, xyStart, xyEnd, referencePoint) {
     let areaToChord = 0.0;
     if (detail && detail.curve && detail.hasFraction1) {
         if (detail.curve instanceof LineSegment3d_1.LineSegment3d) {
-            // ah .. nothing to do for a line segment
+            // nothing to do for a line segment
         }
         else if (detail.curve instanceof Arc3d_1.Arc3d) {
             areaToChord = detail.curve.areaToChordXY(detail.fraction, detail.fraction1);
         }
+        else {
+            const partial = detail.curve.clonePartialCurve(detail.fraction, detail.fraction1);
+            areaToChord = partial ?
+                RegionOps_1.RegionOps.computeXYArea(Loop_1.Loop.create(partial, LineSegment3d_1.LineSegment3d.create(detail.point1, detail.point))) ?? 0
+                : 0;
+        }
     }
     return trapezoidArea + areaToChord;
 }
-/** Compute face area for a face whose edges are decorated with CurveLocationDetail for their (partial) curves */
+/** Compute face area for a face whose edges are decorated with CurveLocationDetail for their (partial) curves. */
 function faceAreaFromCurvedEdgeData(faceSeed) {
     let area = 0.0;
     let edge = faceSeed;
@@ -696,8 +802,7 @@ class GraphComponent {
         this.faceAreas = [];
     }
     /**
-     * visit all vertices and edges in the component to build face area array and composite range.
-     *
+     * Visit all vertices and edges in the component to build face area array and composite range.
      * @param extendRangeForEdge optional function to compute edge range.  If undefined, linear edge is assumed.
      * @param faceAreaFunction optional function to compute face area.  If undefined, linear edges are assumed.
      */
@@ -722,7 +827,8 @@ class GraphComponent {
     }
 }
 exports.GraphComponent = GraphComponent;
-/** build and hold an array of component data for a HalfEdgeGraph.
+/**
+ * Build and hold an array of component data for a HalfEdgeGraph.
  * @internal
  */
 class GraphComponentArray {