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

package/lib/esm/topology/HalfEdgePointInGraphSearch.js

@@ -0,0 +1,252 @@
+/*---------------------------------------------------------------------------------------------
+* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+* See LICENSE.md in the project root for license terms and full copyright notice.
+*--------------------------------------------------------------------------------------------*/
+/** @packageDocumentation
+ * @module Topology
+ */
+import { Geometry } from "../Geometry";
+import { Vector3d } from "../geometry3d/Point3dVector3d";
+import { NodeXYZUV } from "./HalfEdgeNodeXYZUV";
+import { HalfEdgePositionDetail } from "./HalfEdgePositionDetail";
+/* eslint-disable @typescript-eslint/naming-convention */
+export var RayClassification;
+(function (RayClassification) {
+    RayClassification[RayClassification["RC_NoHits"] = 0] = "RC_NoHits";
+    RayClassification[RayClassification["RC_TargetOnVertex"] = 1] = "RC_TargetOnVertex";
+    RayClassification[RayClassification["RC_TargetOnEdge"] = 2] = "RC_TargetOnEdge";
+    RayClassification[RayClassification["RC_Bracket"] = 3] = "RC_Bracket";
+    RayClassification[RayClassification["RC_TargetBefore"] = 4] = "RC_TargetBefore";
+    RayClassification[RayClassification["RC_TargetAfter"] = 5] = "RC_TargetAfter";
+})(RayClassification || (RayClassification = {}));
+/* eslint-enable @typescript-eslint/naming-convention */
+export class PointSearchContext {
+    constructor(tol) {
+        this._tol = tol;
+    }
+    static create(tol = Geometry.smallMetricDistance) {
+        return new PointSearchContext(tol);
+    }
+    panic() {
+        return HalfEdgePositionDetail.create();
+    }
+    // From given edge start point
+    // The edgeHit is reused as the result.
+    reAimFromEdge(edgeHit, ray, targetDistance) {
+        const nodeA = edgeHit.node;
+        const dataA = NodeXYZUV.createNodeAndRayOrigin(nodeA, ray);
+        const dataB = NodeXYZUV.createNodeAndRayOrigin(nodeA.edgeMate, ray);
+        const sideA = -dataA.classifyV(0.0, this._tol);
+        const sideB = -dataB.classifyV(0.0, this._tol);
+        let result;
+        if (sideA * sideB < 0) {
+            // Simple crossing -- just aim into a face
+            if (sideA > 0) {
+                result = edgeHit.resetAsFace(dataA.node);
+            }
+            else {
+                result = edgeHit.resetAsFace(dataB.node);
+            }
+        }
+        else if (sideA === 0 || sideB === 0) {
+            // The usual case is both 0 i.e. ray is clearly along the edge.
+            const alongA = dataA.classifyU(targetDistance, this._tol);
+            const alongB = dataB.classifyU(targetDistance, this._tol);
+            if (alongA === 0 && sideA === 0) {
+                result = edgeHit.resetAsVertex(dataA.node);
+                result.setITag(1);
+            }
+            else if (alongB === 0 && sideB === 0) {
+                result = edgeHit.resetAsVertex(dataB.node);
+                result.setITag(1);
+            }
+            else if (alongA * alongB < 0) {
+                // target is within edge
+                // (.. This is written for the case where both sideA and sideB are zero.
+                //    If only one is zero, this computes a close edge point but the strong "on" conclusion might be wrong)
+                const edgeFraction = (targetDistance - dataA.u) / (dataB.u - dataA.u);
+                result = edgeHit.resetAtEdgeAndFraction(dataA.node, edgeFraction);
+                result.setITag(1);
+            }
+            else if (alongA < 0 && alongB < 0) {
+                // target is beyond the edge -- move towards it.
+                if (dataA.u > dataB.u)
+                    result = edgeHit.resetAsVertex(dataA.node);
+                else
+                    result = edgeHit.resetAsVertex(dataB.node);
+            }
+            else {
+                // This shouldn't happen -- maybe as if the initial edge point was not within the edge???
+                if (Math.abs(dataA.u) < this._tol
+                    && Math.abs(dataA.v) < this._tol) {
+                    result = edgeHit.resetAsVertex(dataA.node); // , dataA);
+                }
+                else if (Math.abs(dataB.u) < this._tol
+                    && Math.abs(dataB.v) < this._tol) {
+                    result = edgeHit.resetAsVertex(dataB.node);
+                }
+                else {
+                    edgeHit.resetAsUnknown();
+                    result = this.panic();
+                }
+            }
+        }
+        else {
+            // Both vertices are to same side of the line.   This can't happen for edge point between nodes.
+            edgeHit.resetAsUnknown();
+            result = this.panic();
+        }
+        return result;
+    }
+    // From given edge start point, pick vertex or edge side for proceeding along ray.
+    // RAY IS ASSUMED TO START AT THE VERTEX PRECISELY !!!!
+    reAimFromVertex(searchBase, ray, targetDistance) {
+        const vertexNode = searchBase.node;
+        let result;
+        let outboundEdge = vertexNode;
+        do {
+            // DPoint3d xyzBase;
+            // vu_getDPoint3d(& xyzBase, outboundEdge);
+            const data0 = NodeXYZUV.createNodeAndRayOrigin(outboundEdge.faceSuccessor, ray);
+            const data1 = NodeXYZUV.createNodeAndRayOrigin(outboundEdge.facePredecessor, ray);
+            const u0 = data0.u;
+            // double u1 = data1.GetU ();
+            const v0 = data0.v;
+            const v1 = data1.v;
+            if (Math.abs(v0) < this._tol) {
+                if (Math.abs(u0 - targetDistance) < this._tol) {
+                    // Direct hit at far end
+                    result = searchBase.resetAsVertex(data0.node);
+                    result.setITag(1);
+                    return result;
+                }
+                else if (u0 > targetDistance) {
+                    // Direct hig within edge
+                    const edgeFraction = targetDistance / u0;
+                    result = searchBase.resetAtEdgeAndFraction(outboundEdge, edgeFraction);
+                    return result;
+                }
+                else if (Math.abs(u0) <= this._tol) {
+                    // Unexpected direct hit on the base of the search, but call it a hit....
+                    result = searchBase.resetAsVertex(outboundEdge);
+                    result.setITag(1);
+                    return result;
+                }
+                else if (u0 > this._tol) {
+                    // Advance to vertex  ...
+                    // double edgeFraction = targetDistance / u0;
+                    result = searchBase.resetAsVertex(data0.node);
+                    return result;
+                }
+                else {
+                    // Search direction is exactly opposite this edge.
+                    // See if the other side of the sector is turned even beyond that ...
+                    if (v1 > this._tol) {
+                        result = searchBase.resetAsFace(outboundEdge, outboundEdge);
+                        return result;
+                    }
+                }
+            }
+            else if (v0 < -this._tol) {
+                if (v1 > this._tol) {
+                    // The usual simple entry into an angle < 180
+                    result = searchBase.resetAsFace(outboundEdge, outboundEdge);
+                    return result;
+                }
+            }
+            // NEEDS WORK: angle >= 180 cases !!!!
+            outboundEdge = outboundEdge.vertexSuccessor;
+        } while (outboundEdge !== vertexNode);
+        return this.panic();
+    }
+    // Visit all edges around face.
+    // reset lastBefore and firstAfter describing progress towards target distance on ray.
+    reAimAroundFace(faceNode, ray, targetDistance, // !< distance to target point
+    lastBefore, // CALLER CREATED -- reset as first hit on negative side of ray.
+    firstAfter) {
+        lastBefore.resetAsUndefinedWithTag(-Number.MAX_VALUE);
+        firstAfter.resetAsUndefinedWithTag(Number.MAX_VALUE);
+        const data0 = NodeXYZUV.createNodeAndRayOrigin(faceNode, ray);
+        let data1;
+        let node0 = faceNode;
+        do {
+            const node1 = node0.faceSuccessor;
+            data1 = NodeXYZUV.createNodeAndRayOrigin(node1, ray, data1);
+            const u0 = data0.u;
+            const u1 = data1.u;
+            const v0 = data0.v;
+            const v1 = data1.v;
+            if (Math.abs(v1) < this._tol) {
+                // Vertex hit ...
+                const vertexHit = HalfEdgePositionDetail.createVertex(node1);
+                vertexHit.setDTag(u1);
+                if (Math.abs(u1 - targetDistance) < this._tol) {
+                    firstAfter.setFrom(vertexHit);
+                    lastBefore.setFrom(vertexHit);
+                    return RayClassification.RC_TargetOnVertex;
+                }
+                if (u1 > targetDistance && u1 < firstAfter.getDTag())
+                    firstAfter.setFrom(vertexHit);
+                if (u1 < targetDistance && u1 > lastBefore.getDTag())
+                    lastBefore.setFrom(vertexHit);
+            }
+            else if (v0 * v1 < 0.0) {
+                // Edge Crossing ...
+                const edgeFraction = -v0 / (v1 - v0);
+                const uEdge = Geometry.interpolate(u0, edgeFraction, u1);
+                const edgeHit = HalfEdgePositionDetail.createEdgeAtFraction(data0.node, edgeFraction);
+                edgeHit.setDTag(uEdge);
+                if (Math.abs(uEdge - targetDistance) <= this._tol) {
+                    firstAfter.setFrom(edgeHit);
+                    lastBefore.setFrom(edgeHit);
+                    return RayClassification.RC_TargetOnEdge;
+                }
+                if (uEdge > targetDistance && uEdge < firstAfter.getDTag()) {
+                    firstAfter.setFrom(edgeHit);
+                    firstAfter.setITag(v0 > 0.0 ? -1 : 1);
+                }
+                if (uEdge < targetDistance && uEdge > lastBefore.getDTag()) {
+                    lastBefore.setFrom(edgeHit);
+                    lastBefore.setDTag(uEdge);
+                }
+            }
+            data0.setFrom(data1);
+            node0 = node0.faceSuccessor;
+        } while (node0 !== faceNode);
+        const afterTag = firstAfter.getITag();
+        firstAfter.setITag(0);
+        lastBefore.setITag(0);
+        if (lastBefore.isUnclassified) {
+            if (firstAfter.isUnclassified)
+                return RayClassification.RC_NoHits;
+            return RayClassification.RC_TargetBefore;
+        }
+        if (firstAfter.isUnclassified
+            || (firstAfter.isEdge && afterTag && afterTag < 0)) {
+            return RayClassification.RC_TargetAfter;
+        }
+        else {
+            return RayClassification.RC_Bracket;
+        }
+    }
+    // Return false if target is reached !!!!
+    /**
+     * Set (replace contents) ray with
+     * * `origin` at start
+     * * `direction` is unit vector from start towards target
+     * * `a` is distance from start to target.
+     * @param start existing position
+     * @param target target xy coordinates
+     * @param ray ray to update
+     */
+    setSearchRay(start, target, ray) {
+        ray.origin.setFromPoint3d(start);
+        Vector3d.createStartEnd(ray.origin, target, ray.direction);
+        ray.direction.z = 0.0;
+        const distanceToTarget = ray.direction.magnitudeXY();
+        ray.a = ray.direction.magnitude();
+        ray.direction.scaleInPlace(1 / ray.a);
+        return distanceToTarget >= this._tol;
+    }
+}
+//# sourceMappingURL=HalfEdgePointInGraphSearch.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"HalfEdgePointInGraphSearch.js","sourceRoot":"","sources":["../../../src/topology/HalfEdgePointInGraphSearch.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AACvC,OAAO,EAAW,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAGlE,OAAO,EAAE,SAAS,EAAE,MAAM,qBAAqB,CAAC;AAChD,OAAO,EAAE,sBAAsB,EAAE,MAAM,0BAA0B,CAAC;AAElE,yDAAyD;AACzD,MAAM,CAAN,IAAY,iBAOX;AAPD,WAAY,iBAAiB;IAC3B,mEAAS,CAAA;IACT,mFAAiB,CAAA;IACjB,+EAAe,CAAA;IACf,qEAAU,CAAA;IACV,+EAAe,CAAA;IACf,6EAAc,CAAA;AAChB,CAAC,EAPW,iBAAiB,KAAjB,iBAAiB,QAO5B;AACD,wDAAwD;AAExD,MAAM,OAAO,kBAAkB;IAE7B,YAAoB,GAAW;QAC7B,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC;IAClB,CAAC;IACM,MAAM,CAAC,MAAM,CAAC,MAAc,QAAQ,CAAC,mBAAmB;QAC7D,OAAO,IAAI,kBAAkB,CAAC,GAAG,CAAC,CAAC;IACrC,CAAC;IACO,KAAK;QACX,OAAO,sBAAsB,CAAC,MAAM,EAAE,CAAC;IACzC,CAAC;IACD,8BAA8B;IAC9B,uCAAuC;IAChC,aAAa,CAClB,OAA+B,EAC/B,GAAU,EACV,cAAsB;QACtB,MAAM,KAAK,GAAG,OAAO,CAAC,IAAK,CAAC;QAC5B,MAAM,KAAK,GAAG,SAAS,CAAC,sBAAsB,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QAC3D,MAAM,KAAK,GAAG,SAAS,CAAC,sBAAsB,CAAC,KAAK,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;QACpE,MAAM,KAAK,GAAG,CAAC,KAAK,CAAC,SAAS,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QAC/C,MAAM,KAAK,GAAG,CAAC,KAAK,CAAC,SAAS,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QAC/C,IAAI,MAAM,CAAC;QACX,IAAI,KAAK,GAAG,KAAK,GAAG,CAAC,EAAE;YACrB,0CAA0C;YAC1C,IAAI,KAAK,GAAG,CAAC,EAAE;gBACb,MAAM,GAAG,OAAO,CAAC,WAAW,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;aAC1C;iBAAM;gBACL,MAAM,GAAG,OAAO,CAAC,WAAW,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;aAC1C;SACF;aAAM,IAAI,KAAK,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC,EAAE;YACrC,+DAA+D;YAE/D,MAAM,MAAM,GAAG,KAAK,CAAC,SAAS,CAAC,cAAc,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;YAC1D,MAAM,MAAM,GAAG,KAAK,CAAC,SAAS,CAAC,cAAc,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;YAC1D,IAAI,MAAM,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC,EAAE;gBAC/B,MAAM,GAAG,OAAO,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;gBAC3C,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;aACnB;iBAAM,IAAI,MAAM,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC,EAAE;gBACtC,MAAM,GAAG,OAAO,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;gBAC3C,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;aACnB;iBAAM,IAAI,MAAM,GAAG,MAAM,GAAG,CAAC,EAAE;gBAC9B,wBAAwB;gBACxB,wEAAwE;gBACxE,0GAA0G;gBAE1G,MAAM,YAAY,GAAG,CAAC,cAAc,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;gBACtE,MAAM,GAAG,OAAO,CAAC,sBAAsB,CAAC,KAAK,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;gBAClE,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;aACnB;iBAAM,IAAI,MAAM,GAAG,CAAC,IAAI,MAAM,GAAG,CAAC,EAAE;gBACnC,gDAAgD;gBAChD,IAAI,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC;oBACnB,MAAM,GAAG,OAAO,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;;oBAE3C,MAAM,GAAG,OAAO,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;aAC9C;iBAAM;gBACL,yFAAyF;gBACzF,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI;uBAC5B,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,EAChC;oBACA,MAAM,GAAG,OAAO,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,YAAY;iBACzD;qBAAM,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI;uBACnC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,EAChC;oBACA,MAAM,GAAG,OAAO,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;iBAC5C;qBAAM;oBACL,OAAO,CAAC,cAAc,EAAE,CAAC;oBACzB,MAAM,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;iBACvB;aACF;SACF;aAAM;YACL,gGAAgG;YAChG,OAAO,CAAC,cAAc,EAAE,CAAC;YACzB,MAAM,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;SACvB;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,kFAAkF;IAClF,uDAAuD;IAChD,eAAe,CACpB,UAAkC,EAClC,GAAU,EACV,cAAsB;QACtB,MAAM,UAAU,GAAG,UAAU,CAAC,IAAI,CAAC;QACnC,IAAI,MAAM,CAAC;QACX,IAAI,YAAY,GAAG,UAAW,CAAC;QAC/B,GAAG;YACD,oBAAoB;YACpB,2CAA2C;YAC3C,MAAM,KAAK,GAAG,SAAS,CAAC,sBAAsB,CAAC,YAAY,CAAC,aAAa,EAAE,GAAG,CAAC,CAAC;YAChF,MAAM,KAAK,GAAG,SAAS,CAAC,sBAAsB,CAAC,YAAY,CAAC,eAAe,EAAE,GAAG,CAAC,CAAC;YAClF,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC;YACnB,6BAA6B;YAC7B,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC;YACnB,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC;YACnB,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE;gBAC5B,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,cAAc,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE;oBAC7C,wBAAwB;oBACxB,MAAM,GAAG,UAAU,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;oBAC9C,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;oBAClB,OAAO,MAAM,CAAC;iBACf;qBAAM,IAAI,EAAE,GAAG,cAAc,EAAE;oBAC9B,yBAAyB;oBACzB,MAAM,YAAY,GAAG,cAAc,GAAG,EAAE,CAAC;oBACzC,MAAM,GAAG,UAAU,CAAC,sBAAsB,CAAC,YAAY,EAAE,YAAY,CAAC,CAAC;oBACvE,OAAO,MAAM,CAAC;iBACf;qBAAM,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,IAAI,EAAE;oBACpC,yEAAyE;oBACzE,MAAM,GAAG,UAAU,CAAC,aAAa,CAAC,YAAY,CAAC,CAAC;oBAChD,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;oBAClB,OAAO,MAAM,CAAC;iBACf;qBAAM,IAAI,EAAE,GAAG,IAAI,CAAC,IAAI,EAAE;oBACzB,yBAAyB;oBACzB,6CAA6C;oBAC7C,MAAM,GAAG,UAAU,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;oBAC9C,OAAO,MAAM,CAAC;iBACf;qBAAM;oBACL,kDAAkD;oBAClD,qEAAqE;oBACrE,IAAI,EAAE,GAAG,IAAI,CAAC,IAAI,EAAE;wBAClB,MAAM,GAAG,UAAU,CAAC,WAAW,CAAC,YAAY,EAAE,YAAY,CAAC,CAAC;wBAC5D,OAAO,MAAM,CAAC;qBACf;iBACF;aACF;iBAAM,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE;gBAC1B,IAAI,EAAE,GAAG,IAAI,CAAC,IAAI,EAAE;oBAClB,6CAA6C;oBAC7C,MAAM,GAAG,UAAU,CAAC,WAAW,CAAC,YAAY,EAAE,YAAY,CAAC,CAAC;oBAC5D,OAAO,MAAM,CAAC;iBACf;aACF;YACD,sCAAsC;YACtC,YAAY,GAAG,YAAY,CAAC,eAAe,CAAC;SAC7C,QAAQ,YAAY,KAAK,UAAU,EAAE;QACtC,OAAO,IAAI,CAAC,KAAK,EAAE,CAAC;IACtB,CAAC;IAED,+BAA+B;IAC/B,sFAAsF;IAC/E,eAAe,CACpB,QAAkB,EAClB,GAAU,EACV,cAAsB,EAAG,8BAA8B;IACvD,UAAkC,EAAI,gEAAgE;IACtG,UAAkC;QAElC,UAAU,CAAC,uBAAuB,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QACtD,UAAU,CAAC,uBAAuB,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QACrD,MAAM,KAAK,GAAG,SAAS,CAAC,sBAAsB,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;QAC9D,IAAI,KAAK,CAAC;QACV,IAAI,KAAK,GAAG,QAAQ,CAAC;QACrB,GAAG;YACD,MAAM,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;YAClC,KAAK,GAAG,SAAS,CAAC,sBAAsB,CAAC,KAAK,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;YAC5D,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC;YACnB,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC;YACnB,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC;YACnB,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC;YACnB,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE;gBAC5B,iBAAiB;gBACjB,MAAM,SAAS,GAAG,sBAAsB,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;gBAC7D,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;gBACtB,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,cAAc,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE;oBAC7C,UAAU,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;oBAC9B,UAAU,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;oBAC9B,OAAO,iBAAiB,CAAC,iBAAiB,CAAC;iBAC5C;gBACD,IAAI,EAAE,GAAG,cAAc,IAAI,EAAE,GAAG,UAAU,CAAC,OAAO,EAAG;oBACnD,UAAU,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;gBAChC,IAAI,EAAE,GAAG,cAAc,IAAI,EAAE,GAAG,UAAU,CAAC,OAAO,EAAG;oBACnD,UAAU,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;aACjC;iBAAM,IAAI,EAAE,GAAG,EAAE,GAAG,GAAG,EAAE;gBACxB,oBAAoB;gBACpB,MAAM,YAAY,GAAG,CAAE,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;gBACtC,MAAM,KAAK,GAAG,QAAQ,CAAC,WAAW,CAAC,EAAE,EAAE,YAAY,EAAE,EAAE,CAAC,CAAC;gBACzD,MAAM,OAAO,GAAG,sBAAsB,CAAC,oBAAoB,CAAC,KAAK,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;gBACtF,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;gBACvB,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,cAAc,CAAC,IAAI,IAAI,CAAC,IAAI,EAAE;oBACjD,UAAU,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;oBAC5B,UAAU,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;oBAC5B,OAAO,iBAAiB,CAAC,eAAe,CAAC;iBAC1C;gBACD,IAAI,KAAK,GAAG,cAAc,IAAI,KAAK,GAAG,UAAU,CAAC,OAAO,EAAG,EAAE;oBAC3D,UAAU,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;oBAC5B,UAAU,CAAC,OAAO,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;iBACvC;gBACD,IAAI,KAAK,GAAG,cAAc,IAAI,KAAK,GAAG,UAAU,CAAC,OAAO,EAAG,EAAE;oBAC3D,UAAU,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;oBAC5B,UAAU,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;iBAC3B;aACF;YACD,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YACrB,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;SAC7B,QAAQ,KAAK,KAAK,QAAQ,EAAE;QAE7B,MAAM,QAAQ,GAAG,UAAU,CAAC,OAAO,EAAE,CAAC;QACtC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QACtB,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QACtB,IAAI,UAAU,CAAC,cAAc,EAAE;YAC7B,IAAI,UAAU,CAAC,cAAc;gBAC3B,OAAO,iBAAiB,CAAC,SAAS,CAAC;YACrC,OAAO,iBAAiB,CAAC,eAAe,CAAC;SAC1C;QACD,IAAI,UAAU,CAAC,cAAc;eACxB,CAAC,UAAU,CAAC,MAAM,IAAI,QAAQ,IAAI,QAAQ,GAAG,CAAC,CAAC,EAAE;YACpD,OAAO,iBAAiB,CAAC,cAAc,CAAC;SACzC;aAAM;YACL,OAAO,iBAAiB,CAAC,UAAU,CAAC;SACrC;IACH,CAAC;IAED,yCAAyC;IACzC;;;;;;;;OAQG;IACI,YAAY,CAAC,KAA6B,EAAE,MAAe,EAAE,GAAU;QAC5E,GAAG,CAAC,MAAM,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC;QACjC,QAAQ,CAAC,cAAc,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,CAAC,SAAS,CAAC,CAAC;QAC3D,GAAG,CAAC,SAAS,CAAC,CAAC,GAAG,GAAG,CAAC;QACtB,MAAM,gBAAgB,GAAG,GAAG,CAAC,SAAS,CAAC,WAAW,EAAE,CAAC;QACrD,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,SAAS,CAAC,SAAS,EAAE,CAAC;QAClC,GAAG,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;QACtC,OAAO,gBAAgB,IAAI,IAAI,CAAC,IAAI,CAAC;IACvC,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\nimport { Geometry } from \"../Geometry\";\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\nimport { Ray3d } from \"../geometry3d/Ray3d\";\nimport { HalfEdge } from \"./Graph\";\nimport { NodeXYZUV } from \"./HalfEdgeNodeXYZUV\";\nimport { HalfEdgePositionDetail } from \"./HalfEdgePositionDetail\";\n\n/* eslint-disable @typescript-eslint/naming-convention */\nexport enum RayClassification {\n  RC_NoHits,\n  RC_TargetOnVertex,\n  RC_TargetOnEdge,\n  RC_Bracket,\n  RC_TargetBefore,\n  RC_TargetAfter,\n}\n/* eslint-enable @typescript-eslint/naming-convention */\n\nexport class PointSearchContext {\n  private _tol: number;\n  private constructor(tol: number) {\n    this._tol = tol;\n  }\n  public static create(tol: number = Geometry.smallMetricDistance) {\n    return new PointSearchContext(tol);\n  }\n  private panic(): HalfEdgePositionDetail {\n    return HalfEdgePositionDetail.create();\n  }\n  // From given edge start point\n  // The edgeHit is reused as the result.\n  public reAimFromEdge(\n    edgeHit: HalfEdgePositionDetail,\n    ray: Ray3d,\n    targetDistance: number): HalfEdgePositionDetail {\n    const nodeA = edgeHit.node!;\n    const dataA = NodeXYZUV.createNodeAndRayOrigin(nodeA, ray);\n    const dataB = NodeXYZUV.createNodeAndRayOrigin(nodeA.edgeMate, ray);\n    const sideA = -dataA.classifyV(0.0, this._tol);\n    const sideB = -dataB.classifyV(0.0, this._tol);\n    let result;\n    if (sideA * sideB < 0) {\n      // Simple crossing -- just aim into a face\n      if (sideA > 0) {\n        result = edgeHit.resetAsFace(dataA.node);\n      } else {\n        result = edgeHit.resetAsFace(dataB.node);\n      }\n    } else if (sideA === 0 || sideB === 0) {\n      // The usual case is both 0 i.e. ray is clearly along the edge.\n\n      const alongA = dataA.classifyU(targetDistance, this._tol);\n      const alongB = dataB.classifyU(targetDistance, this._tol);\n      if (alongA === 0 && sideA === 0) {\n        result = edgeHit.resetAsVertex(dataA.node);\n        result.setITag(1);\n      } else if (alongB === 0 && sideB === 0) {\n        result = edgeHit.resetAsVertex(dataB.node);\n        result.setITag(1);\n      } else if (alongA * alongB < 0) {\n        // target is within edge\n        // (.. This is written for the case where both sideA and sideB are zero.\n        //    If only one is zero, this computes a close edge point but the strong \"on\" conclusion might be wrong)\n\n        const edgeFraction = (targetDistance - dataA.u) / (dataB.u - dataA.u);\n        result = edgeHit.resetAtEdgeAndFraction(dataA.node, edgeFraction);\n        result.setITag(1);\n      } else if (alongA < 0 && alongB < 0) {\n        // target is beyond the edge -- move towards it.\n        if (dataA.u > dataB.u)\n          result = edgeHit.resetAsVertex(dataA.node);\n        else\n          result = edgeHit.resetAsVertex(dataB.node);\n      } else {\n        // This shouldn't happen -- maybe as if the initial edge point was not within the edge???\n        if (Math.abs(dataA.u) < this._tol\n          && Math.abs(dataA.v) < this._tol\n        ) {\n          result = edgeHit.resetAsVertex(dataA.node); // , dataA);\n        } else if (Math.abs(dataB.u) < this._tol\n          && Math.abs(dataB.v) < this._tol\n        ) {\n          result = edgeHit.resetAsVertex(dataB.node);\n        } else {\n          edgeHit.resetAsUnknown();\n          result = this.panic();\n        }\n      }\n    } else {\n      // Both vertices are to same side of the line.   This can't happen for edge point between nodes.\n      edgeHit.resetAsUnknown();\n      result = this.panic();\n    }\n    return result;\n  }\n\n  // From given edge start point, pick vertex or edge side for proceeding along ray.\n  // RAY IS ASSUMED TO START AT THE VERTEX PRECISELY !!!!\n  public reAimFromVertex(\n    searchBase: HalfEdgePositionDetail,\n    ray: Ray3d,\n    targetDistance: number): HalfEdgePositionDetail {\n    const vertexNode = searchBase.node;\n    let result;\n    let outboundEdge = vertexNode!;\n    do {\n      // DPoint3d xyzBase;\n      // vu_getDPoint3d(& xyzBase, outboundEdge);\n      const data0 = NodeXYZUV.createNodeAndRayOrigin(outboundEdge.faceSuccessor, ray);\n      const data1 = NodeXYZUV.createNodeAndRayOrigin(outboundEdge.facePredecessor, ray);\n      const u0 = data0.u;\n      // double u1 = data1.GetU ();\n      const v0 = data0.v;\n      const v1 = data1.v;\n      if (Math.abs(v0) < this._tol) {\n        if (Math.abs(u0 - targetDistance) < this._tol) {\n          // Direct hit at far end\n          result = searchBase.resetAsVertex(data0.node);\n          result.setITag(1);\n          return result;\n        } else if (u0 > targetDistance) {\n          // Direct hig within edge\n          const edgeFraction = targetDistance / u0;\n          result = searchBase.resetAtEdgeAndFraction(outboundEdge, edgeFraction);\n          return result;\n        } else if (Math.abs(u0) <= this._tol) {\n          // Unexpected direct hit on the base of the search, but call it a hit....\n          result = searchBase.resetAsVertex(outboundEdge);\n          result.setITag(1);\n          return result;\n        } else if (u0 > this._tol) {\n          // Advance to vertex  ...\n          // double edgeFraction = targetDistance / u0;\n          result = searchBase.resetAsVertex(data0.node);\n          return result;\n        } else {\n          // Search direction is exactly opposite this edge.\n          // See if the other side of the sector is turned even beyond that ...\n          if (v1 > this._tol) {\n            result = searchBase.resetAsFace(outboundEdge, outboundEdge);\n            return result;\n          }\n        }\n      } else if (v0 < -this._tol) {\n        if (v1 > this._tol) {\n          // The usual simple entry into an angle < 180\n          result = searchBase.resetAsFace(outboundEdge, outboundEdge);\n          return result;\n        }\n      }\n      // NEEDS WORK: angle >= 180 cases !!!!\n      outboundEdge = outboundEdge.vertexSuccessor;\n    } while (outboundEdge !== vertexNode);\n    return this.panic();\n  }\n\n  // Visit all edges around face.\n  // reset lastBefore and firstAfter describing progress towards target distance on ray.\n  public reAimAroundFace(\n    faceNode: HalfEdge,\n    ray: Ray3d,\n    targetDistance: number,  // !< distance to target point\n    lastBefore: HalfEdgePositionDetail,   // CALLER CREATED -- reset as first hit on negative side of ray.\n    firstAfter: HalfEdgePositionDetail): RayClassification {  // ! CALLER CREATED -- reset as first hit on positive side of ray.\n\n    lastBefore.resetAsUndefinedWithTag(-Number.MAX_VALUE);\n    firstAfter.resetAsUndefinedWithTag(Number.MAX_VALUE);\n    const data0 = NodeXYZUV.createNodeAndRayOrigin(faceNode, ray);\n    let data1;\n    let node0 = faceNode;\n    do {\n      const node1 = node0.faceSuccessor;\n      data1 = NodeXYZUV.createNodeAndRayOrigin(node1, ray, data1);\n      const u0 = data0.u;\n      const u1 = data1.u;\n      const v0 = data0.v;\n      const v1 = data1.v;\n      if (Math.abs(v1) < this._tol) {\n        // Vertex hit ...\n        const vertexHit = HalfEdgePositionDetail.createVertex(node1);\n        vertexHit.setDTag(u1);\n        if (Math.abs(u1 - targetDistance) < this._tol) {\n          firstAfter.setFrom(vertexHit);\n          lastBefore.setFrom(vertexHit);\n          return RayClassification.RC_TargetOnVertex;\n        }\n        if (u1 > targetDistance && u1 < firstAfter.getDTag()!)\n          firstAfter.setFrom(vertexHit);\n        if (u1 < targetDistance && u1 > lastBefore.getDTag()!)\n          lastBefore.setFrom(vertexHit);\n      } else if (v0 * v1 < 0.0) {\n        // Edge Crossing ...\n        const edgeFraction = - v0 / (v1 - v0);\n        const uEdge = Geometry.interpolate(u0, edgeFraction, u1);\n        const edgeHit = HalfEdgePositionDetail.createEdgeAtFraction(data0.node, edgeFraction);\n        edgeHit.setDTag(uEdge);\n        if (Math.abs(uEdge - targetDistance) <= this._tol) {\n          firstAfter.setFrom(edgeHit);\n          lastBefore.setFrom(edgeHit);\n          return RayClassification.RC_TargetOnEdge;\n        }\n        if (uEdge > targetDistance && uEdge < firstAfter.getDTag()!) {\n          firstAfter.setFrom(edgeHit);\n          firstAfter.setITag(v0 > 0.0 ? -1 : 1);\n        }\n        if (uEdge < targetDistance && uEdge > lastBefore.getDTag()!) {\n          lastBefore.setFrom(edgeHit);\n          lastBefore.setDTag(uEdge);\n        }\n      }\n      data0.setFrom(data1);\n      node0 = node0.faceSuccessor;\n    } while (node0 !== faceNode);\n\n    const afterTag = firstAfter.getITag();\n    firstAfter.setITag(0);\n    lastBefore.setITag(0);\n    if (lastBefore.isUnclassified) {\n      if (firstAfter.isUnclassified)\n        return RayClassification.RC_NoHits;\n      return RayClassification.RC_TargetBefore;\n    }\n    if (firstAfter.isUnclassified\n      || (firstAfter.isEdge && afterTag && afterTag < 0)) {\n      return RayClassification.RC_TargetAfter;\n    } else {\n      return RayClassification.RC_Bracket;\n    }\n  }\n\n  // Return false if target is reached !!!!\n  /**\n   * Set (replace contents) ray with\n   * * `origin` at start\n   * * `direction` is unit vector from start towards target\n   * * `a` is distance from start to target.\n   * @param start existing position\n   * @param target target xy coordinates\n   * @param ray ray to update\n   */\n  public setSearchRay(start: HalfEdgePositionDetail, target: Point3d, ray: Ray3d): boolean {\n    ray.origin.setFromPoint3d(start);\n    Vector3d.createStartEnd(ray.origin, target, ray.direction);\n    ray.direction.z = 0.0;\n    const distanceToTarget = ray.direction.magnitudeXY();\n    ray.a = ray.direction.magnitude();\n    ray.direction.scaleInPlace(1 / ray.a);\n    return distanceToTarget >= this._tol;\n  }\n}\n"]}

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

@@ -0,0 +1,97 @@
+/** @packageDocumentation
+ * @module Topology
+ */
+import { Point3d } from "../geometry3d/Point3dVector3d";
+import { XYAndZ } from "../geometry3d/XYZProps";
+import { HalfEdge } from "./Graph";
+/**
+ * Enumeration of categorization of "where" a HalfEdgePositionDetail is sitting in the graph.
+ */
+export declare enum HalfEdgeTopo {
+    /** No known position */
+    None = 0,
+    /**  */
+    Vertex = 1,
+    Edge = 2,
+    Face = 3
+}
+/**
+ * Description of a generalized position within a graph, categorized as:
+ * * "at a certain node around a vertex"
+ * * "at a fractional position along an edge
+ * * "within a face"
+ */
+export declare class HalfEdgePositionDetail {
+    /** the relevant node */
+    private _node?;
+    /** The current coordinates */
+    x: number;
+    y: number;
+    z: number;
+    /** fractional position along edge.   Only defined if the topo tag is `HalfEdgeTopo.Edge` */
+    private _edgeFraction?;
+    /** Enumeration of status vertex, edge, or face status. */
+    private _topo;
+    /** first data tag */
+    private _iTag?;
+    /** second data tag */
+    private _dTag?;
+    /** Constructor.
+     * * The point is CAPTURED.  (static `create` methods normally clone their inputs.)
+     */
+    private constructor();
+    /** Copy (clones of) all data from other */
+    setFrom(other: HalfEdgePositionDetail): void;
+    /** reset to null topo state. */
+    resetAsUnknown(): void;
+    /**  Create with null data. */
+    static create(): HalfEdgePositionDetail;
+    getITag(): number | undefined;
+    setITag(value: number): void;
+    getDTag(): number | undefined;
+    setDTag(value: number): void;
+    getTopo(): HalfEdgeTopo;
+    /** Create with node, fraction along edge, marked as "HalfEdgeTopo.Edge".  Compute interpolated xyz on the edge */
+    static createEdgeAtFraction(node: HalfEdge, edgeFraction: number): HalfEdgePositionDetail;
+    /** reassign contents so this instance becomes a face hit.
+     * @param node new node value. If missing, current node is left unchanged.
+     * @param xyz new coordinates. if missing, current coordinates are left unchanged.
+     */
+    resetAsFace(node?: HalfEdge, xyz?: XYAndZ): HalfEdgePositionDetail;
+    /** reassign contents so this instance has dTag but no node or HalfEdgeTopo
+     */
+    resetAsUndefinedWithTag(dTag: number): HalfEdgePositionDetail;
+    /** reassign contents so this instance becomes an edge hit
+     * @param node new node value.
+     * @param edgeFraction new edge fraction.   xyz is recomputed from this edge and its face successor.
+     */
+    resetAtEdgeAndFraction(node: HalfEdge, edgeFraction: number): HalfEdgePositionDetail;
+    /** Create at a node.
+     * * Take xyz from the node.
+     */
+    static createVertex(node: HalfEdge): HalfEdgePositionDetail;
+    /** Create with node and (optional) xyz, marked as "HalfEdgeTopo.Vertex"
+     * * if the xyz is omitted, take from the node.
+     */
+    resetAsVertex(node: HalfEdge): HalfEdgePositionDetail;
+    /** Copy x,y,z from the node to this instance local values. */
+    setXYZFromNode(node: HalfEdge): void;
+    /**
+     * Return the (possibly undefined) edge fraction.
+     */
+    get edgeFraction(): number | undefined;
+    /** Return true if this detail is marked as being within a face. */
+    get isFace(): boolean;
+    /** Return true if this detail is marked as being within an edge. */
+    get isEdge(): boolean;
+    /** Return true if this detail is marked as being at a vertex. */
+    get isVertex(): boolean;
+    /** Return true if this detail has no vertex, edge, or face qualifier. */
+    get isUnclassified(): boolean;
+    /** Return the node reference from this detail */
+    get node(): HalfEdge | undefined;
+    /** Return the (clone of, or optional filled in result) coordinates from this detail. */
+    clonePoint(result?: Point3d): Point3d;
+    isAtXY(x: number, y: number): boolean;
+}
+//# sourceMappingURL=HalfEdgePositionDetail.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"HalfEdgePositionDetail.d.ts","sourceRoot":"","sources":["../../../src/topology/HalfEdgePositionDetail.ts"],"names":[],"mappings":"AAIA;;GAEG;AAGH,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AACxD,OAAO,EAAE,MAAM,EAAE,MAAM,wBAAwB,CAAC;AAChD,OAAO,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAEnC;;GAEG;AACH,oBAAY,YAAY;IACtB,wBAAwB;IACxB,IAAI,IAAI;IACR,OAAO;IACP,MAAM,IAAI;IACV,IAAI,IAAI;IACR,IAAI,IAAI;CACT;AACD;;;;;GAKG;AACH,qBAAa,sBAAsB;IACjC,wBAAwB;IACxB,OAAO,CAAC,KAAK,CAAC,CAAW;IACzB,8BAA8B;IACvB,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACV,CAAC,EAAE,MAAM,CAAC;IACjB,4FAA4F;IAC5F,OAAO,CAAC,aAAa,CAAC,CAAS;IAC/B,0DAA0D;IAC1D,OAAO,CAAC,KAAK,CAAe;IAC5B,qBAAqB;IACrB,OAAO,CAAC,KAAK,CAAC,CAAS;IACvB,sBAAsB;IACtB,OAAO,CAAC,KAAK,CAAC,CAAS;IACvB;;OAEG;IACH,OAAO;IASP,2CAA2C;IACpC,OAAO,CAAC,KAAK,EAAE,sBAAsB;IAU5C,gCAAgC;IACzB,cAAc;IAIrB,8BAA8B;WAChB,MAAM,IAAI,sBAAsB;IAIvC,OAAO,IAAI,MAAM,GAAG,SAAS;IAC7B,OAAO,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI;IAE5B,OAAO,IAAI,MAAM,GAAG,SAAS;IAC7B,OAAO,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI;IAC5B,OAAO,IAAI,YAAY;IAE9B,kHAAkH;WACpG,oBAAoB,CAAC,IAAI,EAAE,QAAQ,EAAE,YAAY,EAAE,MAAM,GAAG,sBAAsB;IAQhG;;;OAGG;IACI,WAAW,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,GAAG,CAAC,EAAE,MAAM,GAAG,sBAAsB;IAYzE;OACG;IACI,uBAAuB,CAAC,IAAI,EAAE,MAAM,GAAG,sBAAsB;IASpE;;;OAGG;IACI,sBAAsB,CAAC,IAAI,EAAE,QAAQ,EAAE,YAAY,EAAE,MAAM,GAAG,sBAAsB;IAW3F;;OAEG;WACW,YAAY,CAAC,IAAI,EAAE,QAAQ,GAAG,sBAAsB;IAIlE;;OAEG;IACI,aAAa,CAAC,IAAI,EAAE,QAAQ,GAAG,sBAAsB;IAM5D,8DAA8D;IACvD,cAAc,CAAC,IAAI,EAAE,QAAQ;IAKpC;;OAEG;IACH,IAAW,YAAY,IAAI,MAAM,GAAG,SAAS,CAE5C;IAED,mEAAmE;IACnE,IAAW,MAAM,IAAI,OAAO,CAA6C;IACzE,oEAAoE;IACpE,IAAW,MAAM,IAAI,OAAO,CAA6C;IACzE,iEAAiE;IACjE,IAAW,QAAQ,IAAI,OAAO,CAA+C;IAC7E,yEAAyE;IACzE,IAAW,cAAc,IAAI,OAAO,CAA6C;IAEjF,iDAAiD;IACjD,IAAW,IAAI,IAAI,QAAQ,GAAG,SAAS,CAAuB;IAC9D,wFAAwF;IACjF,UAAU,CAAC,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO;IAkBrC,MAAM,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,OAAO;CAI7C"}

package/lib/esm/topology/HalfEdgePositionDetail.js

@@ -0,0 +1,173 @@
+/*---------------------------------------------------------------------------------------------
+* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+* See LICENSE.md in the project root for license terms and full copyright notice.
+*--------------------------------------------------------------------------------------------*/
+/** @packageDocumentation
+ * @module Topology
+ */
+import { Geometry } from "../Geometry";
+import { Point3d } from "../geometry3d/Point3dVector3d";
+/**
+ * Enumeration of categorization of "where" a HalfEdgePositionDetail is sitting in the graph.
+ */
+export var HalfEdgeTopo;
+(function (HalfEdgeTopo) {
+    /** No known position */
+    HalfEdgeTopo[HalfEdgeTopo["None"] = 0] = "None";
+    /**  */
+    HalfEdgeTopo[HalfEdgeTopo["Vertex"] = 1] = "Vertex";
+    HalfEdgeTopo[HalfEdgeTopo["Edge"] = 2] = "Edge";
+    HalfEdgeTopo[HalfEdgeTopo["Face"] = 3] = "Face";
+})(HalfEdgeTopo || (HalfEdgeTopo = {}));
+/**
+ * Description of a generalized position within a graph, categorized as:
+ * * "at a certain node around a vertex"
+ * * "at a fractional position along an edge
+ * * "within a face"
+ */
+export class HalfEdgePositionDetail {
+    /** Constructor.
+     * * The point is CAPTURED.  (static `create` methods normally clone their inputs.)
+     */
+    constructor(node, x, y, z, topo, edgeFraction, iTag, _dTag) {
+        this._node = node;
+        this.x = x;
+        this.y = y;
+        this.z = z;
+        this._topo = topo;
+        this._edgeFraction = edgeFraction;
+        this._iTag = iTag;
+        this._dTag = _dTag;
+    }
+    /** Copy (clones of) all data from other */
+    setFrom(other) {
+        this._node = other._node;
+        this.x = other.x;
+        this.y = other.y;
+        this.z = other.z;
+        this._topo = other._topo;
+        this._edgeFraction = other._edgeFraction;
+        this._iTag = other._iTag;
+        this._dTag = other._dTag;
+    }
+    /** reset to null topo state. */
+    resetAsUnknown() {
+        this._node = undefined;
+        this._topo = HalfEdgeTopo.None;
+    }
+    /**  Create with null data. */
+    static create() {
+        const detail = new HalfEdgePositionDetail(undefined, 0, 0, 0, HalfEdgeTopo.None);
+        return detail;
+    }
+    getITag() { return this._iTag; }
+    setITag(value) { this._iTag = value; }
+    getDTag() { return this._dTag; }
+    setDTag(value) { this._dTag = value; }
+    getTopo() { return this._topo; }
+    /** Create with node, fraction along edge, marked as "HalfEdgeTopo.Edge".  Compute interpolated xyz on the edge */
+    static createEdgeAtFraction(node, edgeFraction) {
+        const node1 = node.faceSuccessor;
+        const x = Geometry.interpolate(node.x, edgeFraction, node1.x);
+        const y = Geometry.interpolate(node.y, edgeFraction, node1.y);
+        const z = Geometry.interpolate(node.z, edgeFraction, node1.z);
+        return new HalfEdgePositionDetail(node, x, y, z, HalfEdgeTopo.Edge, edgeFraction);
+    }
+    /** reassign contents so this instance becomes a face hit.
+     * @param node new node value. If missing, current node is left unchanged.
+     * @param xyz new coordinates. if missing, current coordinates are left unchanged.
+     */
+    resetAsFace(node, xyz) {
+        this._topo = HalfEdgeTopo.Face;
+        if (node)
+            this._node = node;
+        if (xyz) {
+            this.x = xyz.x;
+            this.y = xyz.y;
+            this.z = xyz.z;
+        }
+        return this;
+    }
+    /** reassign contents so this instance has dTag but no node or HalfEdgeTopo
+     */
+    resetAsUndefinedWithTag(dTag) {
+        this._topo = HalfEdgeTopo.None;
+        this._dTag = 0;
+        this._iTag = 0;
+        this._dTag = dTag;
+        this._node = undefined;
+        return this;
+    }
+    /** reassign contents so this instance becomes an edge hit
+     * @param node new node value.
+     * @param edgeFraction new edge fraction.   xyz is recomputed from this edge and its face successor.
+     */
+    resetAtEdgeAndFraction(node, edgeFraction) {
+        this._topo = HalfEdgeTopo.Edge;
+        this._node = node;
+        const nodeB = node.faceSuccessor;
+        this._edgeFraction = edgeFraction;
+        this.x = Geometry.interpolate(node.x, edgeFraction, nodeB.x);
+        this.y = Geometry.interpolate(node.y, edgeFraction, nodeB.y);
+        this.z = Geometry.interpolate(node.z, edgeFraction, nodeB.z);
+        return this;
+    }
+    /** Create at a node.
+     * * Take xyz from the node.
+     */
+    static createVertex(node) {
+        return new HalfEdgePositionDetail(node, node.x, node.y, node.z, HalfEdgeTopo.Vertex);
+    }
+    /** Create with node and (optional) xyz, marked as "HalfEdgeTopo.Vertex"
+     * * if the xyz is omitted, take from the node.
+     */
+    resetAsVertex(node) {
+        this._topo = HalfEdgeTopo.Vertex;
+        this._node = node;
+        this.setXYZFromNode(node);
+        return this;
+    }
+    /** Copy x,y,z from the node to this instance local values. */
+    setXYZFromNode(node) {
+        this.x = node.x;
+        this.y = node.y;
+        this.z = node.z;
+    }
+    /**
+     * Return the (possibly undefined) edge fraction.
+     */
+    get edgeFraction() {
+        return this._edgeFraction;
+    }
+    /** Return true if this detail is marked as being within a face. */
+    get isFace() { return this._topo === HalfEdgeTopo.Face; }
+    /** Return true if this detail is marked as being within an edge. */
+    get isEdge() { return this._topo === HalfEdgeTopo.Edge; }
+    /** Return true if this detail is marked as being at a vertex. */
+    get isVertex() { return this._topo === HalfEdgeTopo.Vertex; }
+    /** Return true if this detail has no vertex, edge, or face qualifier. */
+    get isUnclassified() { return this._topo === HalfEdgeTopo.None; }
+    /** Return the node reference from this detail */
+    get node() { return this._node; }
+    /** Return the (clone of, or optional filled in result) coordinates from this detail. */
+    clonePoint(result) { return Point3d.create(this.x, this.y, this.z, result); }
+    /*
+      // If candidateKey is less than resultKey, replace resultPos and resultKey
+      // by the candidate data.
+      public updateMinimizer(
+        HalfEdgePositionDetail & resultPos, number & resultKey,
+    : HalfEdgePositionDetail & candidatePos, candidateKey: number
+      ): boolean {
+        if (candidateKey < resultKey) {
+          resultKey = candidateKey;
+          resultPos = candidatePos;
+          return true;
+        }
+        return false;
+      }
+    */
+    isAtXY(x, y) {
+        return this._topo !== HalfEdgeTopo.None && Geometry.isSameCoordinate(this.x, x) && Geometry.isSameCoordinate(this.y, y);
+    }
+}
+//# sourceMappingURL=HalfEdgePositionDetail.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"HalfEdgePositionDetail.js","sourceRoot":"","sources":["../../../src/topology/HalfEdgePositionDetail.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AACvC,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AAIxD;;GAEG;AACH,MAAM,CAAN,IAAY,YAOX;AAPD,WAAY,YAAY;IACtB,wBAAwB;IACxB,+CAAQ,CAAA;IACR,OAAO;IACP,mDAAU,CAAA;IACV,+CAAQ,CAAA;IACR,+CAAQ,CAAA;AACV,CAAC,EAPW,YAAY,KAAZ,YAAY,QAOvB;AACD;;;;;GAKG;AACH,MAAM,OAAO,sBAAsB;IAejC;;OAEG;IACH,YAAoB,IAA0B,EAAE,CAAS,EAAE,CAAS,EAAE,CAAS,EAAE,IAAkB,EAAE,YAAqB,EAAE,IAAa,EAAE,KAAc;QACvJ,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QACnC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,aAAa,GAAG,YAAY,CAAC;QAClC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IACrB,CAAC;IAED,2CAA2C;IACpC,OAAO,CAAC,KAA6B;QAC1C,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;QACzB,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;QACjB,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;QACjB,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;QACjB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;QACzB,IAAI,CAAC,aAAa,GAAG,KAAK,CAAC,aAAa,CAAC;QACzC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;QACzB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC;IAC3B,CAAC;IACD,gCAAgC;IACzB,cAAc;QACnB,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC;QACvB,IAAI,CAAC,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC;IACjC,CAAC;IACD,8BAA8B;IACvB,MAAM,CAAC,MAAM;QAClB,MAAM,MAAM,GAAG,IAAI,sBAAsB,CAAC,SAAS,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,IAAI,CAAC,CAAC;QACjF,OAAO,MAAM,CAAC;IAChB,CAAC;IACM,OAAO,KAAyB,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;IACpD,OAAO,CAAC,KAAa,IAAU,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC;IAEpD,OAAO,KAAyB,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;IACpD,OAAO,CAAC,KAAa,IAAU,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC;IACpD,OAAO,KAAmB,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;IAErD,kHAAkH;IAC3G,MAAM,CAAC,oBAAoB,CAAC,IAAc,EAAE,YAAoB;QACrE,MAAM,KAAK,GAAG,IAAI,CAAC,aAAa,CAAC;QACjC,MAAM,CAAC,GAAG,QAAQ,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,EAAE,YAAY,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;QAC9D,MAAM,CAAC,GAAG,QAAQ,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,EAAE,YAAY,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;QAC9D,MAAM,CAAC,GAAG,QAAQ,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,EAAE,YAAY,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;QAC9D,OAAO,IAAI,sBAAsB,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,YAAY,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;IACpF,CAAC;IAED;;;OAGG;IACI,WAAW,CAAC,IAAe,EAAE,GAAY;QAC9C,IAAI,CAAC,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC;QAC/B,IAAI,IAAI;YACN,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QACpB,IAAI,GAAG,EAAE;YACP,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;YACf,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;YACf,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;SAChB;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;OACG;IACI,uBAAuB,CAAC,IAAY;QACzC,IAAI,CAAC,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC;QAC/B,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QACf,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QACf,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC;QACvB,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;OAGG;IACI,sBAAsB,CAAC,IAAc,EAAE,YAAoB;QAChE,IAAI,CAAC,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC;QAC/B,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,MAAM,KAAK,GAAG,IAAI,CAAC,aAAa,CAAC;QACjC,IAAI,CAAC,aAAa,GAAG,YAAY,CAAC;QAClC,IAAI,CAAC,CAAC,GAAG,QAAQ,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,EAAE,YAAY,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;QAC7D,IAAI,CAAC,CAAC,GAAG,QAAQ,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,EAAE,YAAY,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;QAC7D,IAAI,CAAC,CAAC,GAAG,QAAQ,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,EAAE,YAAY,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;QAC7D,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACI,MAAM,CAAC,YAAY,CAAC,IAAc;QACvC,OAAO,IAAI,sBAAsB,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,YAAY,CAAC,MAAM,CAAC,CAAC;IACvF,CAAC;IAED;;OAEG;IACI,aAAa,CAAC,IAAc;QACjC,IAAI,CAAC,KAAK,GAAG,YAAY,CAAC,MAAM,CAAC;QACjC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;QAClB,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC;QAC1B,OAAO,IAAI,CAAC;IACd,CAAC;IACD,8DAA8D;IACvD,cAAc,CAAC,IAAc;QAClC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;QAChB,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;QAChB,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;IAClB,CAAC;IACD;;OAEG;IACH,IAAW,YAAY;QACrB,OAAO,IAAI,CAAC,aAAa,CAAC;IAC5B,CAAC;IAED,mEAAmE;IACnE,IAAW,MAAM,KAAc,OAAO,IAAI,CAAC,KAAK,KAAK,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC;IACzE,oEAAoE;IACpE,IAAW,MAAM,KAAc,OAAO,IAAI,CAAC,KAAK,KAAK,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC;IACzE,iEAAiE;IACjE,IAAW,QAAQ,KAAc,OAAO,IAAI,CAAC,KAAK,KAAK,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC;IAC7E,yEAAyE;IACzE,IAAW,cAAc,KAAc,OAAO,IAAI,CAAC,KAAK,KAAK,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC;IAEjF,iDAAiD;IACjD,IAAW,IAAI,KAA2B,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;IAC9D,wFAAwF;IACjF,UAAU,CAAC,MAAgB,IAAa,OAAO,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;IAEvG;;;;;;;;;;;;;;MAcE;IAEK,MAAM,CAAC,CAAS,EAAE,CAAS;QAChC,OAAO,IAAI,CAAC,KAAK,KAAK,YAAY,CAAC,IAAI,IAAI,QAAQ,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,QAAQ,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAE1H,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/** @packageDocumentation\r\n * @module Topology\r\n */\r\n\r\nimport { Geometry } from \"../Geometry\";\r\nimport { Point3d } from \"../geometry3d/Point3dVector3d\";\r\nimport { XYAndZ } from \"../geometry3d/XYZProps\";\r\nimport { HalfEdge } from \"./Graph\";\r\n\r\n/**\r\n * Enumeration of categorization of \"where\" a HalfEdgePositionDetail is sitting in the graph.\r\n */\r\nexport enum HalfEdgeTopo {\r\n  /** No known position */\r\n  None = 0,\r\n  /**  */\r\n  Vertex = 1,\r\n  Edge = 2,\r\n  Face = 3,\r\n}\r\n/**\r\n * Description of a generalized position within a graph, categorized as:\r\n * * \"at a certain node around a vertex\"\r\n * * \"at a fractional position along an edge\r\n * * \"within a face\"\r\n */\r\nexport class HalfEdgePositionDetail {\r\n  /** the relevant node */\r\n  private _node?: HalfEdge;\r\n  /** The current coordinates */\r\n  public x: number;\r\n  public y: number;\r\n  public z: number;\r\n  /** fractional position along edge.   Only defined if the topo tag is `HalfEdgeTopo.Edge` */\r\n  private _edgeFraction?: number;\r\n  /** Enumeration of status vertex, edge, or face status. */\r\n  private _topo: HalfEdgeTopo;\r\n  /** first data tag */\r\n  private _iTag?: number;\r\n  /** second data tag */\r\n  private _dTag?: number;\r\n  /** Constructor.\r\n   * * The point is CAPTURED.  (static `create` methods normally clone their inputs.)\r\n   */\r\n  private constructor(node: HalfEdge | undefined, x: number, y: number, z: number, topo: HalfEdgeTopo, edgeFraction?: number, iTag?: number, _dTag?: number) {\r\n    this._node = node;\r\n    this.x = x; this.y = y; this.z = z;\r\n    this._topo = topo;\r\n    this._edgeFraction = edgeFraction;\r\n    this._iTag = iTag;\r\n    this._dTag = _dTag;\r\n  }\r\n\r\n  /** Copy (clones of) all data from other */\r\n  public setFrom(other: HalfEdgePositionDetail) {\r\n    this._node = other._node;\r\n    this.x = other.x;\r\n    this.y = other.y;\r\n    this.z = other.z;\r\n    this._topo = other._topo;\r\n    this._edgeFraction = other._edgeFraction;\r\n    this._iTag = other._iTag;\r\n    this._dTag = other._dTag;\r\n  }\r\n  /** reset to null topo state. */\r\n  public resetAsUnknown() {\r\n    this._node = undefined;\r\n    this._topo = HalfEdgeTopo.None;\r\n  }\r\n  /**  Create with null data. */\r\n  public static create(): HalfEdgePositionDetail {\r\n    const detail = new HalfEdgePositionDetail(undefined, 0, 0, 0, HalfEdgeTopo.None);\r\n    return detail;\r\n  }\r\n  public getITag(): number | undefined { return this._iTag; }\r\n  public setITag(value: number): void { this._iTag = value; }\r\n\r\n  public getDTag(): number | undefined { return this._dTag; }\r\n  public setDTag(value: number): void { this._dTag = value; }\r\n  public getTopo(): HalfEdgeTopo { return this._topo; }\r\n\r\n  /** Create with node, fraction along edge, marked as \"HalfEdgeTopo.Edge\".  Compute interpolated xyz on the edge */\r\n  public static createEdgeAtFraction(node: HalfEdge, edgeFraction: number): HalfEdgePositionDetail {\r\n    const node1 = node.faceSuccessor;\r\n    const x = Geometry.interpolate(node.x, edgeFraction, node1.x);\r\n    const y = Geometry.interpolate(node.y, edgeFraction, node1.y);\r\n    const z = Geometry.interpolate(node.z, edgeFraction, node1.z);\r\n    return new HalfEdgePositionDetail(node, x, y, z, HalfEdgeTopo.Edge, edgeFraction);\r\n  }\r\n\r\n  /** reassign contents so this instance becomes a face hit.\r\n   * @param node new node value. If missing, current node is left unchanged.\r\n   * @param xyz new coordinates. if missing, current coordinates are left unchanged.\r\n   */\r\n  public resetAsFace(node?: HalfEdge, xyz?: XYAndZ): HalfEdgePositionDetail {\r\n    this._topo = HalfEdgeTopo.Face;\r\n    if (node)\r\n      this._node = node;\r\n    if (xyz) {\r\n      this.x = xyz.x;\r\n      this.y = xyz.y;\r\n      this.z = xyz.z;\r\n    }\r\n    return this;\r\n  }\r\n\r\n  /** reassign contents so this instance has dTag but no node or HalfEdgeTopo\r\n   */\r\n  public resetAsUndefinedWithTag(dTag: number): HalfEdgePositionDetail {\r\n    this._topo = HalfEdgeTopo.None;\r\n    this._dTag = 0;\r\n    this._iTag = 0;\r\n    this._dTag = dTag;\r\n    this._node = undefined;\r\n    return this;\r\n  }\r\n\r\n  /** reassign contents so this instance becomes an edge hit\r\n   * @param node new node value.\r\n   * @param edgeFraction new edge fraction.   xyz is recomputed from this edge and its face successor.\r\n   */\r\n  public resetAtEdgeAndFraction(node: HalfEdge, edgeFraction: number): HalfEdgePositionDetail {\r\n    this._topo = HalfEdgeTopo.Edge;\r\n    this._node = node;\r\n    const nodeB = node.faceSuccessor;\r\n    this._edgeFraction = edgeFraction;\r\n    this.x = Geometry.interpolate(node.x, edgeFraction, nodeB.x);\r\n    this.y = Geometry.interpolate(node.y, edgeFraction, nodeB.y);\r\n    this.z = Geometry.interpolate(node.z, edgeFraction, nodeB.z);\r\n    return this;\r\n  }\r\n\r\n  /** Create at a node.\r\n   * * Take xyz from the node.\r\n   */\r\n  public static createVertex(node: HalfEdge): HalfEdgePositionDetail {\r\n    return new HalfEdgePositionDetail(node, node.x, node.y, node.z, HalfEdgeTopo.Vertex);\r\n  }\r\n\r\n  /** Create with node and (optional) xyz, marked as \"HalfEdgeTopo.Vertex\"\r\n   * * if the xyz is omitted, take from the node.\r\n   */\r\n  public resetAsVertex(node: HalfEdge): HalfEdgePositionDetail {\r\n    this._topo = HalfEdgeTopo.Vertex;\r\n    this._node = node;\r\n    this.setXYZFromNode(node);\r\n    return this;\r\n  }\r\n  /** Copy x,y,z from the node to this instance local values. */\r\n  public setXYZFromNode(node: HalfEdge) {\r\n    this.x = node.x;\r\n    this.y = node.y;\r\n    this.z = node.z;\r\n  }\r\n  /**\r\n   * Return the (possibly undefined) edge fraction.\r\n   */\r\n  public get edgeFraction(): number | undefined {\r\n    return this._edgeFraction;\r\n  }\r\n\r\n  /** Return true if this detail is marked as being within a face. */\r\n  public get isFace(): boolean { return this._topo === HalfEdgeTopo.Face; }\r\n  /** Return true if this detail is marked as being within an edge. */\r\n  public get isEdge(): boolean { return this._topo === HalfEdgeTopo.Edge; }\r\n  /** Return true if this detail is marked as being at a vertex. */\r\n  public get isVertex(): boolean { return this._topo === HalfEdgeTopo.Vertex; }\r\n  /** Return true if this detail has no vertex, edge, or face qualifier. */\r\n  public get isUnclassified(): boolean { return this._topo === HalfEdgeTopo.None; }\r\n\r\n  /** Return the node reference from this detail */\r\n  public get node(): HalfEdge | undefined { return this._node; }\r\n  /** Return the (clone of, or optional filled in result) coordinates from this detail. */\r\n  public clonePoint(result?: Point3d): Point3d { return Point3d.create(this.x, this.y, this.z, result); }\r\n\r\n  /*\r\n    // If candidateKey is less than resultKey, replace resultPos and resultKey\r\n    // by the candidate data.\r\n    public updateMinimizer(\r\n      HalfEdgePositionDetail & resultPos, number & resultKey,\r\n  : HalfEdgePositionDetail & candidatePos, candidateKey: number\r\n    ): boolean {\r\n      if (candidateKey < resultKey) {\r\n        resultKey = candidateKey;\r\n        resultPos = candidatePos;\r\n        return true;\r\n      }\r\n      return false;\r\n    }\r\n  */\r\n\r\n  public isAtXY(x: number, y: number): boolean {\r\n    return this._topo !== HalfEdgeTopo.None && Geometry.isSameCoordinate(this.x, x) && Geometry.isSameCoordinate(this.y, y);\r\n\r\n  }\r\n}\r\n"]}

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

@@ -0,0 +1,34 @@
+/** @packageDocumentation
+ * @module Topology
+ */
+import { OrderedComparator, PriorityQueue } from "@itwin/core-bentley";
+import { HalfEdge } from "./Graph";
+/**
+ * * Combination of a priority queue of HalfEdges with
+ * * Additional "active" array to carry edges that have been removed from the queue but are still to be
+ *    inspected (possibly many times)
+ * * The priority queue default sort is Y-then-X lexical sort.
+ * * Caller has direct access to the queue and array.
+ * * Methods are added here only to do things that involve both the queue and the array.
+ * @internal
+ */
+export declare class HalfEdgePriorityQueueWithPartnerArray {
+    priorityQueue: PriorityQueue<HalfEdge>;
+    activeEdges: HalfEdge[];
+    constructor(compare?: OrderedComparator<HalfEdge>);
+    /** Read a member from the queue and transfer to the active array. */
+    popQueueToArray(): HalfEdge | undefined;
+    /** Pop the last entry and put it back as replacement for current entry at index i.
+     * * Effectively remove active member at index i
+     * * The array order is changed.
+     * * constant time.
+     */
+    popArrayToArrayIndex(i: number): void;
+    /**
+     * * Scan the active array.
+     * * remove edges whose top y is below y
+     * * (pack all remaining ones back towards the beginning)
+     */
+    removeArrayMembersWithY1Below(y: number): void;
+}
+//# sourceMappingURL=HalfEdgePriorityQueue.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"HalfEdgePriorityQueue.d.ts","sourceRoot":"","sources":["../../../src/topology/HalfEdgePriorityQueue.ts"],"names":[],"mappings":"AAKA;;GAEG;AACH,OAAO,EAAE,iBAAiB,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC;AACvE,OAAO,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAGnC;;;;;;;;GAQG;AACH,qBAAa,qCAAqC;IACzC,aAAa,EAAE,aAAa,CAAC,QAAQ,CAAC,CAAC;IACvC,WAAW,EAAE,QAAQ,EAAE,CAAC;gBAE7B,OAAO,GAAE,iBAAiB,CAAC,QAAQ,CAAqC;IAI1E,qEAAqE;IAC9D,eAAe,IAAI,QAAQ,GAAG,SAAS;IAO9C;;;;OAIG;IACI,oBAAoB,CAAC,CAAC,EAAE,MAAM;IAOrC;;;;OAIG;IACI,6BAA6B,CAAC,CAAC,EAAE,MAAM;CAiB/C"}