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

package/lib/cjs/topology/HalfEdgePointInGraphSearch.d.ts

@@ -2,32 +2,74 @@ import { Point3d } from "../geometry3d/Point3dVector3d";
 import { Ray3d } from "../geometry3d/Ray3d";
 import { HalfEdge } from "./Graph";
 import { HalfEdgePositionDetail } from "./HalfEdgePositionDetail";
+/**
+ * Return code from [PointSearchContext.reAimAroundFace]
+ * @internal
+ */
 export declare enum RayClassification {
-    RC_NoHits = 0,
-    RC_TargetOnVertex = 1,
-    RC_TargetOnEdge = 2,
-    RC_Bracket = 3,
-    RC_TargetBefore = 4,
-    RC_TargetAfter = 5
+    NoHits = 0,
+    TargetOnVertex = 1,
+    TargetOnEdge = 2,
+    Bracket = 3,
+    TargetBefore = 4,
+    TargetAfter = 5
 }
+/**
+ * Context for searching for the location of an xy-point in a graph.
+ * * Assumptions: interior faces of the graph are convex, no edge has length less than `tol`.
+ * @internal
+ */
 export declare class PointSearchContext {
     private _tol;
     private constructor();
     static create(tol?: number): PointSearchContext;
     private panic;
+    /**
+     * Reposition `edgeHit` to an adjacent face or vertex, or another position on the edge, that is closer to the
+     * target point.
+     * @param edgeHit start position on a graph edge, updated and returned.
+     * @param ray the ray to the target point. Origin is assumed to lie on the edge.
+     * @param targetDistance distance along the ray to the target point.
+     * @return detail closer to the target point.
+     */
     reAimFromEdge(edgeHit: HalfEdgePositionDetail, ray: Ray3d, targetDistance: number): HalfEdgePositionDetail;
-    reAimFromVertex(searchBase: HalfEdgePositionDetail, ray: Ray3d, targetDistance: number): HalfEdgePositionDetail;
-    reAimAroundFace(faceNode: HalfEdge, ray: Ray3d, targetDistance: number, // !< distance to target point
-    lastBefore: HalfEdgePositionDetail, // CALLER CREATED -- reset as first hit on negative side of ray.
-    firstAfter: HalfEdgePositionDetail): RayClassification;
     /**
-     * Set (replace contents) ray with
-     * * `origin` at start
-     * * `direction` is unit vector from start towards target
-     * * `a` is distance from start to target.
+     * Reposition `vertexHit` to an adjacent face, edge, or vertex hit that is closer to the target point.
+     * @param vertexHit start position at a graph vertex, updated and returned.
+     * @param ray the ray to the target point, assumed to start exactly at the vertex.
+     * @param targetDistance distance along the ray to the target point.
+     * @return detail closer to the target point.
+     */
+    reAimFromVertex(vertexHit: HalfEdgePositionDetail, ray: Ray3d, targetDistance: number): HalfEdgePositionDetail;
+    /**
+     * Visit all edges around the face, updating `lastBefore` and `firstAfter` to ray-edge intersections that
+     * lie directly before and/or after the target point on the ray, if at all.
+     * @param faceNode starting node on a graph face.
+     * @param ray the ray to the target point.
+     * @param targetDistance distance along the ray to the target point.
+     * @param lastBefore the detail to reset as the last hit on the ray before the target point (CALLER CREATED).
+     * @param firstAfter the detail to reset as the first hit on the ray after the target point (CALLER CREATED).
+     * @returns summary of the updated details:
+     * * [[RayClassification.TargetOnVertex]] - target lies at a vertex of the face (details are identical).
+     * * [[RayClassification.TargetOnEdge]] - target lies on an edge of the face (details are identical).
+     * * [[RayClassification.TargetBefore]] - target lies before the face; the ray intersects the face beyond
+     * the target point.
+     * * [[RayClassification.TargetAfter]] - target lies after the face; the ray intersects the face before
+     * the target point.
+     * * [[RayClassification.Bracket]] - target lies between intersections of the ray and the face; if the face
+     * is convex, this means the target lies inside the face.
+     * * [[RayClassification.NoHits]] - the face does not intersect the ray.
+     */
+    reAimAroundFace(faceNode: HalfEdge, ray: Ray3d, targetDistance: number, lastBefore: HalfEdgePositionDetail, firstAfter: HalfEdgePositionDetail): RayClassification;
+    /**
+     * Initialize the input ray for topology search:
+     * * `origin` is at `start`
+     * * `direction` is the unit xy-vector from `start` towards `target`
+     * * `a` is the xy-distance from `start` to `target`
      * @param start existing position
      * @param target target xy coordinates
-     * @param ray ray to update
+     * @param ray updated in place
+     * @returns false if target is reached.
      */
     setSearchRay(start: HalfEdgePositionDetail, target: Point3d, ray: Ray3d): boolean;
 }

package/lib/cjs/topology/HalfEdgePointInGraphSearch.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"HalfEdgePointInGraphSearch.d.ts","sourceRoot":"","sources":["../../../src/topology/HalfEdgePointInGraphSearch.ts"],"names":[],"mappings":"AAUA,OAAO,EAAE,OAAO,EAAY,MAAM,+BAA+B,CAAC;AAClE,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAC5C,OAAO,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AAEnC,OAAO,EAAE,sBAAsB,EAAE,MAAM,0BAA0B,CAAC;AAGlE,oBAAY,iBAAiB;IAC3B,SAAS,IAAA;IACT,iBAAiB,IAAA;IACjB,eAAe,IAAA;IACf,UAAU,IAAA;IACV,eAAe,IAAA;IACf,cAAc,IAAA;CACf;AAGD,qBAAa,kBAAkB;IAC7B,OAAO,CAAC,IAAI,CAAS;IACrB,OAAO;WAGO,MAAM,CAAC,GAAG,GAAE,MAAqC;IAG/D,OAAO,CAAC,KAAK;IAKN,aAAa,CAClB,OAAO,EAAE,sBAAsB,EAC/B,GAAG,EAAE,KAAK,EACV,cAAc,EAAE,MAAM,GAAG,sBAAsB;IAgE1C,eAAe,CACpB,UAAU,EAAE,sBAAsB,EAClC,GAAG,EAAE,KAAK,EACV,cAAc,EAAE,MAAM,GAAG,sBAAsB;IAyD1C,eAAe,CACpB,QAAQ,EAAE,QAAQ,EAClB,GAAG,EAAE,KAAK,EACV,cAAc,EAAE,MAAM,EAAG,8BAA8B;IACvD,UAAU,EAAE,sBAAsB,EAAI,gEAAgE;IACtG,UAAU,EAAE,sBAAsB,GAAG,iBAAiB;IAoExD;;;;;;;;OAQG;IACI,YAAY,CAAC,KAAK,EAAE,sBAAsB,EAAE,MAAM,EAAE,OAAO,EAAE,GAAG,EAAE,KAAK,GAAG,OAAO;CASzF"}
+{"version":3,"file":"HalfEdgePointInGraphSearch.d.ts","sourceRoot":"","sources":["../../../src/topology/HalfEdgePointInGraphSearch.ts"],"names":[],"mappings":"AAWA,OAAO,EAAE,OAAO,EAAY,MAAM,+BAA+B,CAAC;AAClE,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAC5C,OAAO,EAAE,QAAQ,EAAgB,MAAM,SAAS,CAAC;AAEjD,OAAO,EAAE,sBAAsB,EAAE,MAAM,0BAA0B,CAAC;AAIlE;;;GAGG;AACH,oBAAY,iBAAiB;IAC3B,MAAM,IAAA;IACN,cAAc,IAAA;IACd,YAAY,IAAA;IACZ,OAAO,IAAA;IACP,YAAY,IAAA;IACZ,WAAW,IAAA;CACZ;AAED;;;;GAIG;AACH,qBAAa,kBAAkB;IAC7B,OAAO,CAAC,IAAI,CAAS;IACrB,OAAO;WAGO,MAAM,CAAC,GAAG,GAAE,MAAqC;IAG/D,OAAO,CAAC,KAAK;IAab;;;;;;;OAOG;IACI,aAAa,CAClB,OAAO,EAAE,sBAAsB,EAAE,GAAG,EAAE,KAAK,EAAE,cAAc,EAAE,MAAM,GAClE,sBAAsB;IAsDzB;;;;;;OAMG;IACI,eAAe,CACpB,SAAS,EAAE,sBAAsB,EAAE,GAAG,EAAE,KAAK,EAAE,cAAc,EAAE,MAAM,GACpE,sBAAsB;IA0DzB;;;;;;;;;;;;;;;;;;OAkBG;IACI,eAAe,CACpB,QAAQ,EAAE,QAAQ,EAClB,GAAG,EAAE,KAAK,EACV,cAAc,EAAE,MAAM,EACtB,UAAU,EAAE,sBAAsB,EAClC,UAAU,EAAE,sBAAsB,GACjC,iBAAiB;IA0DpB;;;;;;;;;OASG;IACI,YAAY,CAAC,KAAK,EAAE,sBAAsB,EAAE,MAAM,EAAE,OAAO,EAAE,GAAG,EAAE,KAAK,GAAG,OAAO;CAWzF"}

package/lib/cjs/topology/HalfEdgePointInGraphSearch.js

@@ -8,21 +8,31 @@ exports.PointSearchContext = exports.RayClassification = void 0;
 /** @packageDocumentation
  * @module Topology
  */
+const core_bentley_1 = require("@itwin/core-bentley");
 const Geometry_1 = require("../Geometry");
 const Point3dVector3d_1 = require("../geometry3d/Point3dVector3d");
+const Graph_1 = require("./Graph");
 const HalfEdgeNodeXYZUV_1 = require("./HalfEdgeNodeXYZUV");
 const HalfEdgePositionDetail_1 = require("./HalfEdgePositionDetail");
-/* eslint-disable @typescript-eslint/naming-convention */
+// cspell:word Chebyshev
+/**
+ * Return code from [PointSearchContext.reAimAroundFace]
+ * @internal
+ */
 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["NoHits"] = 0] = "NoHits";
+    RayClassification[RayClassification["TargetOnVertex"] = 1] = "TargetOnVertex";
+    RayClassification[RayClassification["TargetOnEdge"] = 2] = "TargetOnEdge";
+    RayClassification[RayClassification["Bracket"] = 3] = "Bracket";
+    RayClassification[RayClassification["TargetBefore"] = 4] = "TargetBefore";
+    RayClassification[RayClassification["TargetAfter"] = 5] = "TargetAfter";
 })(RayClassification || (exports.RayClassification = RayClassification = {}));
-/* eslint-enable @typescript-eslint/naming-convention */
+/**
+ * Context for searching for the location of an xy-point in a graph.
+ * * Assumptions: interior faces of the graph are convex, no edge has length less than `tol`.
+ * @internal
+ */
 class PointSearchContext {
     constructor(tol) {
         this._tol = tol;
@@ -31,10 +41,26 @@ class PointSearchContext {
         return new PointSearchContext(tol);
     }
     panic() {
+        // A note on "unexpectedly" found in comments in this file:
+        // Though this class assumes all edges of the graph have length at least tolerance, the tests below account for
+        // edges with smaller length. This is because we are using two different metrics: Euclidean for distinguishing
+        // points matching user expectation, and Chebyshev, aka "max component", for efficiently testing ray-sector
+        // inclusion in the reAimXXX methods. In particular, epsilon-balls in the former metric are smaller than in the
+        // latter. Thus an edge can be inserted into the graph with Euclidean length (barely) greater than epsilon, but
+        // the edge's parallel and perpendicular components with respect to a ray can have Euclidean length *less* than
+        // epsilon, yielding a Chebyshev edge length less than epsilon. This discrepancy requires careful analysis below,
+        // and if this method is invoked, it is probably because we've missed a case where a dot/cross product lies just
+        // beyond the tolerance.
         return HalfEdgePositionDetail_1.HalfEdgePositionDetail.create();
     }
-    // From given edge start point
-    // The edgeHit is reused as the result.
+    /**
+     * Reposition `edgeHit` to an adjacent face or vertex, or another position on the edge, that is closer to the
+     * target point.
+     * @param edgeHit start position on a graph edge, updated and returned.
+     * @param ray the ray to the target point. Origin is assumed to lie on the edge.
+     * @param targetDistance distance along the ray to the target point.
+     * @return detail closer to the target point.
+     */
     reAimFromEdge(edgeHit, ray, targetDistance) {
         const nodeA = edgeHit.node;
         const dataA = HalfEdgeNodeXYZUV_1.NodeXYZUV.createNodeAndRayOrigin(nodeA, ray);
@@ -42,8 +68,7 @@ class PointSearchContext {
         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 * sideB < 0) { // simple crossing; just aim into a face
             if (sideA > 0) {
                 result = edgeHit.resetAsFace(dataA.node);
             }
@@ -52,126 +77,150 @@ class PointSearchContext {
             }
         }
         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) {
+            if (sideA === 0 && alongA === 0) { // hit start vertex
                 result = edgeHit.resetAsVertex(dataA.node);
                 result.setITag(1);
             }
-            else if (alongB === 0 && sideB === 0) {
+            else if (sideB === 0 && alongB === 0) { // hit end vertex
                 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 (sideA === 0 && sideB === 0) { // ray is clearly along the edge
+                if (alongA * alongB < 0) { // target is within edge
+                    const edgeFraction = (targetDistance - dataA.u) / (dataB.u - dataA.u);
+                    result = edgeHit.resetAtEdgeAndFraction(dataA.node, edgeFraction);
+                    result.setITag(1);
                 }
-                else if (Math.abs(dataB.u) < this._tol
-                    && Math.abs(dataB.v) < this._tol) {
-                    result = edgeHit.resetAsVertex(dataB.node);
+                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 {
+                else { // both vertices lie on the ray before or after the target; shouldn't happen for edgeHit between nodes
                     edgeHit.resetAsUnknown();
                     result = this.panic();
                 }
             }
+            else if (sideA === 0) { // ray near start vertex but NOT parallel to the edge
+                if (0 === dataA.classifyU(0.0, this._tol))
+                    result = edgeHit.resetAsVertex(dataA.node);
+                else
+                    result = edgeHit.resetAsFace(sideB > 0 ? dataB.node : dataA.node);
+            }
+            else { // ray near end vertex but NOT parallel to the edge
+                (0, core_bentley_1.assert)(sideB === 0);
+                if (0 === dataB.classifyU(0.0, this._tol))
+                    result = edgeHit.resetAsVertex(dataB.node);
+                else
+                    result = edgeHit.resetAsFace(sideA > 0 ? dataA.node : dataB.node);
+            }
         }
-        else {
-            // Both vertices are to same side of the line.   This can't happen for edge point between nodes.
+        else { // both vertices are to same side of the ray; shouldn't happen for edgeHit 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;
+    /**
+     * Reposition `vertexHit` to an adjacent face, edge, or vertex hit that is closer to the target point.
+     * @param vertexHit start position at a graph vertex, updated and returned.
+     * @param ray the ray to the target point, assumed to start exactly at the vertex.
+     * @param targetDistance distance along the ray to the target point.
+     * @return detail closer to the target point.
+     */
+    reAimFromVertex(vertexHit, ray, targetDistance) {
+        (0, core_bentley_1.assert)(ray.origin.isExactEqual(vertexHit));
+        const vertexNode = vertexHit.node;
         let outboundEdge = vertexNode;
+        // lambda to handle the case where the target definitively lies in the same direction as outboundEdge
+        const advancePositionAlongOutboundEdge = (rayParam) => {
+            if (Math.abs(rayParam - targetDistance) <= this._tol) { // direct hit at far end of outBoundEdge
+                vertexHit.resetAsVertex(outboundEdge.faceSuccessor).setITag(1);
+            }
+            else if (rayParam > targetDistance) { // direct hit within outBoundEdge
+                vertexHit.resetAtEdgeAndFraction(outboundEdge, targetDistance / rayParam);
+            }
+            else if (rayParam > this._tol) { // far end of outBoundEdge is closer to target
+                vertexHit.resetAsVertex(outboundEdge.faceSuccessor);
+            }
+            else {
+                return false;
+            }
+            return true;
+        };
         do {
-            // DPoint3d xyzBase;
-            // vu_getDPoint3d(& xyzBase, outboundEdge);
+            // examine the sector at the outboundEdge node; if ray lies in this sector, return updated detail
             const data0 = HalfEdgeNodeXYZUV_1.NodeXYZUV.createNodeAndRayOrigin(outboundEdge.faceSuccessor, ray);
             const data1 = HalfEdgeNodeXYZUV_1.NodeXYZUV.createNodeAndRayOrigin(outboundEdge.facePredecessor, ray);
+            // u0 is the length of projection of faceSuccessor to the ray and v0 is the length of projection of
+            // faceSuccessor to the ray perp line (90 degrees CCW). Similarly for u1 and v1 with facePredecessor.
             const u0 = data0.u;
-            // double u1 = data1.GetU ();
+            const u1 = data1.u;
             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;
-                    }
+            // examine dot and cross of ray with both edges defining this sector to see if ray lies between them
+            if (Math.abs(v0) <= this._tol) { // ray parallel to outBoundEdge
+                if (advancePositionAlongOutboundEdge(u0))
+                    return vertexHit;
+                if (Math.abs(u0) <= this._tol) { // edge is unexpectedly* small
+                    if (v0 <= 0 && v1 > this._tol && (u0 >= 0 || (u0 < 0 && u1 > this._tol)))
+                        return vertexHit.resetAsFace(outboundEdge, outboundEdge);
                 }
+                // The only remaining case is u0 < -this._tol: ray points opposite outBoundEdge.
+                // By our convexity assumption, the only way that ray lies in this sector is if the lookBack
+                // vector points in the same direction as ray, but this would be handled in the next sector.
             }
             else if (v0 < -this._tol) {
-                if (v1 > this._tol) {
-                    // The usual simple entry into an angle < 180
-                    result = searchBase.resetAsFace(outboundEdge, outboundEdge);
-                    return result;
+                if (v1 > this._tol) // ray definitely lies in this sector
+                    return vertexHit.resetAsFace(outboundEdge, outboundEdge);
+                if (v1 >= -this._tol) { // ray and lookBack vector are parallel
+                    // handle special cases not handled in the next sector
+                    if (Math.abs(u1) <= this._tol) { // lookBack vector is unexpectedly* small...
+                        if (v1 > 0 && (u1 >= 0 || (u0 > this._tol && u1 < 0))) // ...and ray is in this sector
+                            return vertexHit.resetAsFace(outboundEdge, outboundEdge);
+                    }
+                    else if (u0 > this._tol && u1 < 0) { // ray and lookBack point in opposite directions
+                        return vertexHit.resetAsVertex(outboundEdge.faceSuccessor); // far end is closer to target
+                    }
                 }
+                // The only remaining case is v1 < -this._tol: ray definitely lies outside this sector.
             }
-            // NEEDS WORK: angle >= 180 cases !!!!
+            // Proceed to the next sector around this vertex. We even examine the (concave) exterior sector at a boundary
+            // vertex in order to handle the case where the target lies in the direction of an exterior outboundEdge.
             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) {
+    /**
+     * Visit all edges around the face, updating `lastBefore` and `firstAfter` to ray-edge intersections that
+     * lie directly before and/or after the target point on the ray, if at all.
+     * @param faceNode starting node on a graph face.
+     * @param ray the ray to the target point.
+     * @param targetDistance distance along the ray to the target point.
+     * @param lastBefore the detail to reset as the last hit on the ray before the target point (CALLER CREATED).
+     * @param firstAfter the detail to reset as the first hit on the ray after the target point (CALLER CREATED).
+     * @returns summary of the updated details:
+     * * [[RayClassification.TargetOnVertex]] - target lies at a vertex of the face (details are identical).
+     * * [[RayClassification.TargetOnEdge]] - target lies on an edge of the face (details are identical).
+     * * [[RayClassification.TargetBefore]] - target lies before the face; the ray intersects the face beyond
+     * the target point.
+     * * [[RayClassification.TargetAfter]] - target lies after the face; the ray intersects the face before
+     * the target point.
+     * * [[RayClassification.Bracket]] - target lies between intersections of the ray and the face; if the face
+     * is convex, this means the target lies inside the face.
+     * * [[RayClassification.NoHits]] - the face does not intersect the ray.
+     */
+    reAimAroundFace(faceNode, ray, targetDistance, lastBefore, firstAfter) {
+        (0, core_bentley_1.assert)(!faceNode.isMaskSet(Graph_1.HalfEdgeMask.EXTERIOR));
         lastBefore.resetAsUndefinedWithTag(-Number.MAX_VALUE);
         firstAfter.resetAsUndefinedWithTag(Number.MAX_VALUE);
         const data0 = HalfEdgeNodeXYZUV_1.NodeXYZUV.createNodeAndRayOrigin(faceNode, ray);
         let data1;
         let node0 = faceNode;
+        // find the intersection of the ray with each edge of the face to classify the ray hit
         do {
             const node1 = node0.faceSuccessor;
             data1 = HalfEdgeNodeXYZUV_1.NodeXYZUV.createNodeAndRayOrigin(node1, ray, data1);
@@ -179,78 +228,70 @@ class PointSearchContext {
             const u1 = data1.u;
             const v0 = data0.v;
             const v1 = data1.v;
-            if (Math.abs(v1) < this._tol) {
-                // Vertex hit ...
+            if (Math.abs(v1) < this._tol) { // ray parallel to edge
                 const vertexHit = HalfEdgePositionDetail_1.HalfEdgePositionDetail.createVertex(node1);
                 vertexHit.setDTag(u1);
                 if (Math.abs(u1 - targetDistance) < this._tol) {
                     firstAfter.setFrom(vertexHit);
                     lastBefore.setFrom(vertexHit);
-                    return RayClassification.RC_TargetOnVertex;
+                    return RayClassification.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 ...
+            else if (v0 * v1 < 0.0) { // ray crosses edge
                 const edgeFraction = -v0 / (v1 - v0);
-                const uEdge = Geometry_1.Geometry.interpolate(u0, edgeFraction, u1);
+                const rayFraction = Geometry_1.Geometry.interpolate(u0, edgeFraction, u1);
                 const edgeHit = HalfEdgePositionDetail_1.HalfEdgePositionDetail.createEdgeAtFraction(data0.node, edgeFraction);
-                edgeHit.setDTag(uEdge);
-                if (Math.abs(uEdge - targetDistance) <= this._tol) {
+                edgeHit.setDTag(rayFraction);
+                if (Math.abs(rayFraction - targetDistance) <= this._tol) {
                     firstAfter.setFrom(edgeHit);
                     lastBefore.setFrom(edgeHit);
-                    return RayClassification.RC_TargetOnEdge;
+                    return RayClassification.TargetOnEdge;
                 }
-                if (uEdge > targetDistance && uEdge < firstAfter.getDTag()) {
+                if (rayFraction > targetDistance && rayFraction < firstAfter.getDTag())
                     firstAfter.setFrom(edgeHit);
-                    firstAfter.setITag(v0 > 0.0 ? -1 : 1);
-                }
-                if (uEdge < targetDistance && uEdge > lastBefore.getDTag()) {
+                if (rayFraction < targetDistance && rayFraction > lastBefore.getDTag())
                     lastBefore.setFrom(edgeHit);
-                    lastBefore.setDTag(uEdge);
-                }
             }
             data0.setFrom(data1);
             node0 = node0.faceSuccessor;
         } while (node0 !== faceNode);
-        // Returned to start node !!!
-        const afterTag = firstAfter.getITag();
+        // returned to start node
         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 RayClassification.NoHits;
+            return RayClassification.TargetBefore;
         }
+        if (firstAfter.isUnclassified)
+            return RayClassification.TargetAfter;
+        else
+            return RayClassification.Bracket; // face is locally convex; target lies inside this face
     }
-    // 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.
+     * Initialize the input ray for topology search:
+     * * `origin` is at `start`
+     * * `direction` is the unit xy-vector from `start` towards `target`
+     * * `a` is the xy-distance from `start` to `target`
      * @param start existing position
      * @param target target xy coordinates
-     * @param ray ray to update
+     * @param ray updated in place
+     * @returns false if target is reached.
      */
     setSearchRay(start, target, ray) {
         ray.origin.setFromPoint3d(start);
         Point3dVector3d_1.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;
+        const distanceToTargetXY = ray.direction.magnitudeXY();
+        if (distanceToTargetXY < this._tol)
+            return false; // no searching necessary, we are already at the target point
+        ray.a = distanceToTargetXY;
+        ray.direction.scaleInPlace(1 / distanceToTargetXY);
+        return true;
     }
 }
 exports.PointSearchContext = PointSearchContext;

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

@@ -1 +1 @@
-{"version":3,"file":"HalfEdgePointInGraphSearch.js","sourceRoot":"","sources":["../../../src/topology/HalfEdgePointInGraphSearch.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AAEH,0CAAuC;AACvC,mEAAkE;AAGlE,2DAAgD;AAChD,qEAAkE;AAElE,yDAAyD;AACzD,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,iCAAjB,iBAAiB,QAO5B;AACD,wDAAwD;AAExD,MAAa,kBAAkB;IAE7B,YAAoB,GAAW;QAC7B,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC;IAClB,CAAC;IACM,MAAM,CAAC,MAAM,CAAC,MAAc,mBAAQ,CAAC,mBAAmB;QAC7D,OAAO,IAAI,kBAAkB,CAAC,GAAG,CAAC,CAAC;IACrC,CAAC;IACO,KAAK;QACX,OAAO,+CAAsB,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,6BAAS,CAAC,sBAAsB,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QAC3D,MAAM,KAAK,GAAG,6BAAS,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,CAAC;YACtB,0CAA0C;YAC1C,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;gBACd,MAAM,GAAG,OAAO,CAAC,WAAW,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YAC3C,CAAC;iBAAM,CAAC;gBACN,MAAM,GAAG,OAAO,CAAC,WAAW,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YAC3C,CAAC;QACH,CAAC;aAAM,IAAI,KAAK,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;YACtC,+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,CAAC;gBAChC,MAAM,GAAG,OAAO,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;gBAC3C,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACpB,CAAC;iBAAM,IAAI,MAAM,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;gBACvC,MAAM,GAAG,OAAO,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;gBAC3C,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACpB,CAAC;iBAAM,IAAI,MAAM,GAAG,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC/B,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;YACpB,CAAC;iBAAM,IAAI,MAAM,GAAG,CAAC,IAAI,MAAM,GAAG,CAAC,EAAE,CAAC;gBACpC,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;YAC/C,CAAC;iBAAM,CAAC;gBACN,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,CAAC;oBACD,MAAM,GAAG,OAAO,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,YAAY;gBAC1D,CAAC;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,CAAC;oBACD,MAAM,GAAG,OAAO,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;gBAC7C,CAAC;qBAAM,CAAC;oBACN,OAAO,CAAC,cAAc,EAAE,CAAC;oBACzB,MAAM,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;gBACxB,CAAC;YACH,CAAC;QACH,CAAC;aAAM,CAAC;YACN,gGAAgG;YAChG,OAAO,CAAC,cAAc,EAAE,CAAC;YACzB,MAAM,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;QACxB,CAAC;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,CAAC;YACF,oBAAoB;YACpB,2CAA2C;YAC3C,MAAM,KAAK,GAAG,6BAAS,CAAC,sBAAsB,CAAC,YAAY,CAAC,aAAa,EAAE,GAAG,CAAC,CAAC;YAChF,MAAM,KAAK,GAAG,6BAAS,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,CAAC;gBAC7B,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,cAAc,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;oBAC9C,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;gBAChB,CAAC;qBAAM,IAAI,EAAE,GAAG,cAAc,EAAE,CAAC;oBAC/B,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;gBAChB,CAAC;qBAAM,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;oBACrC,yEAAyE;oBACzE,MAAM,GAAG,UAAU,CAAC,aAAa,CAAC,YAAY,CAAC,CAAC;oBAChD,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;oBAClB,OAAO,MAAM,CAAC;gBAChB,CAAC;qBAAM,IAAI,EAAE,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;oBAC1B,yBAAyB;oBACzB,6CAA6C;oBAC7C,MAAM,GAAG,UAAU,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;oBAC9C,OAAO,MAAM,CAAC;gBAChB,CAAC;qBAAM,CAAC;oBACN,kDAAkD;oBAClD,qEAAqE;oBACrE,IAAI,EAAE,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;wBACnB,MAAM,GAAG,UAAU,CAAC,WAAW,CAAC,YAAY,EAAE,YAAY,CAAC,CAAC;wBAC5D,OAAO,MAAM,CAAC;oBAChB,CAAC;gBACH,CAAC;YACH,CAAC;iBAAM,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;gBAC3B,IAAI,EAAE,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;oBACnB,6CAA6C;oBAC7C,MAAM,GAAG,UAAU,CAAC,WAAW,CAAC,YAAY,EAAE,YAAY,CAAC,CAAC;oBAC5D,OAAO,MAAM,CAAC;gBAChB,CAAC;YACH,CAAC;YACD,sCAAsC;YACtC,YAAY,GAAG,YAAY,CAAC,eAAe,CAAC;QAC9C,CAAC,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,6BAAS,CAAC,sBAAsB,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;QAC9D,IAAI,KAAK,CAAC;QACV,IAAI,KAAK,GAAG,QAAQ,CAAC;QACrB,GAAG,CAAC;YACF,MAAM,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;YAClC,KAAK,GAAG,6BAAS,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,CAAC;gBAC7B,iBAAiB;gBACjB,MAAM,SAAS,GAAG,+CAAsB,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,CAAC;oBAC9C,UAAU,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;oBAC9B,UAAU,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;oBAC9B,OAAO,iBAAiB,CAAC,iBAAiB,CAAC;gBAC7C,CAAC;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;YAClC,CAAC;iBAAM,IAAI,EAAE,GAAG,EAAE,GAAG,GAAG,EAAE,CAAC;gBACzB,oBAAoB;gBACpB,MAAM,YAAY,GAAG,CAAE,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;gBACtC,MAAM,KAAK,GAAG,mBAAQ,CAAC,WAAW,CAAC,EAAE,EAAE,YAAY,EAAE,EAAE,CAAC,CAAC;gBACzD,MAAM,OAAO,GAAG,+CAAsB,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,CAAC;oBAClD,UAAU,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;oBAC5B,UAAU,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;oBAC5B,OAAO,iBAAiB,CAAC,eAAe,CAAC;gBAC3C,CAAC;gBACD,IAAI,KAAK,GAAG,cAAc,IAAI,KAAK,GAAG,UAAU,CAAC,OAAO,EAAG,EAAE,CAAC;oBAC5D,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;gBACxC,CAAC;gBACD,IAAI,KAAK,GAAG,cAAc,IAAI,KAAK,GAAG,UAAU,CAAC,OAAO,EAAG,EAAE,CAAC;oBAC5D,UAAU,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;oBAC5B,UAAU,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;gBAC5B,CAAC;YACH,CAAC;YACD,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YACrB,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;QAC9B,CAAC,QAAQ,KAAK,KAAK,QAAQ,EAAE;QACjC,6BAA6B;QACzB,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,CAAC;YAC9B,IAAI,UAAU,CAAC,cAAc;gBAC3B,OAAO,iBAAiB,CAAC,SAAS,CAAC;YACrC,OAAO,iBAAiB,CAAC,eAAe,CAAC;QAC3C,CAAC;QACD,IAAI,UAAU,CAAC,cAAc;eACxB,CAAC,UAAU,CAAC,MAAM,IAAI,QAAQ,IAAI,QAAQ,GAAG,CAAC,CAAC,EAAE,CAAC;YACrD,OAAO,iBAAiB,CAAC,cAAc,CAAC;QAC1C,CAAC;aAAM,CAAC;YACN,OAAO,iBAAiB,CAAC,UAAU,CAAC;QACtC,CAAC;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,0BAAQ,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;AAvOD,gDAuOC","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\nimport { Geometry } from \"../Geometry\";\r\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\r\nimport { Ray3d } from \"../geometry3d/Ray3d\";\r\nimport { HalfEdge } from \"./Graph\";\r\nimport { NodeXYZUV } from \"./HalfEdgeNodeXYZUV\";\r\nimport { HalfEdgePositionDetail } from \"./HalfEdgePositionDetail\";\r\n\r\n/* eslint-disable @typescript-eslint/naming-convention */\r\nexport enum RayClassification {\r\n  RC_NoHits,\r\n  RC_TargetOnVertex,\r\n  RC_TargetOnEdge,\r\n  RC_Bracket,\r\n  RC_TargetBefore,\r\n  RC_TargetAfter,\r\n}\r\n/* eslint-enable @typescript-eslint/naming-convention */\r\n\r\nexport class PointSearchContext {\r\n  private _tol: number;\r\n  private constructor(tol: number) {\r\n    this._tol = tol;\r\n  }\r\n  public static create(tol: number = Geometry.smallMetricDistance) {\r\n    return new PointSearchContext(tol);\r\n  }\r\n  private panic(): HalfEdgePositionDetail {\r\n    return HalfEdgePositionDetail.create();\r\n  }\r\n  // From given edge start point\r\n  // The edgeHit is reused as the result.\r\n  public reAimFromEdge(\r\n    edgeHit: HalfEdgePositionDetail,\r\n    ray: Ray3d,\r\n    targetDistance: number): HalfEdgePositionDetail {\r\n    const nodeA = edgeHit.node!;\r\n    const dataA = NodeXYZUV.createNodeAndRayOrigin(nodeA, ray);\r\n    const dataB = NodeXYZUV.createNodeAndRayOrigin(nodeA.edgeMate, ray);\r\n    const sideA = -dataA.classifyV(0.0, this._tol);\r\n    const sideB = -dataB.classifyV(0.0, this._tol);\r\n    let result;\r\n    if (sideA * sideB < 0) {\r\n      // Simple crossing -- just aim into a face\r\n      if (sideA > 0) {\r\n        result = edgeHit.resetAsFace(dataA.node);\r\n      } else {\r\n        result = edgeHit.resetAsFace(dataB.node);\r\n      }\r\n    } else if (sideA === 0 || sideB === 0) {\r\n      // The usual case is both 0 i.e. ray is clearly along the edge.\r\n\r\n      const alongA = dataA.classifyU(targetDistance, this._tol);\r\n      const alongB = dataB.classifyU(targetDistance, this._tol);\r\n      if (alongA === 0 && sideA === 0) {\r\n        result = edgeHit.resetAsVertex(dataA.node);\r\n        result.setITag(1);\r\n      } else if (alongB === 0 && sideB === 0) {\r\n        result = edgeHit.resetAsVertex(dataB.node);\r\n        result.setITag(1);\r\n      } else if (alongA * alongB < 0) {\r\n        // target is within edge\r\n        // (.. This is written for the case where both sideA and sideB are zero.\r\n        //    If only one is zero, this computes a close edge point but the strong \"on\" conclusion might be wrong)\r\n\r\n        const edgeFraction = (targetDistance - dataA.u) / (dataB.u - dataA.u);\r\n        result = edgeHit.resetAtEdgeAndFraction(dataA.node, edgeFraction);\r\n        result.setITag(1);\r\n      } else if (alongA < 0 && alongB < 0) {\r\n        // target is beyond the edge -- move towards it.\r\n        if (dataA.u > dataB.u)\r\n          result = edgeHit.resetAsVertex(dataA.node);\r\n        else\r\n          result = edgeHit.resetAsVertex(dataB.node);\r\n      } else {\r\n        // This shouldn't happen -- maybe as if the initial edge point was not within the edge???\r\n        if (Math.abs(dataA.u) < this._tol\r\n          && Math.abs(dataA.v) < this._tol\r\n        ) {\r\n          result = edgeHit.resetAsVertex(dataA.node); // , dataA);\r\n        } else if (Math.abs(dataB.u) < this._tol\r\n          && Math.abs(dataB.v) < this._tol\r\n        ) {\r\n          result = edgeHit.resetAsVertex(dataB.node);\r\n        } else {\r\n          edgeHit.resetAsUnknown();\r\n          result = this.panic();\r\n        }\r\n      }\r\n    } else {\r\n      // Both vertices are to same side of the line.   This can't happen for edge point between nodes.\r\n      edgeHit.resetAsUnknown();\r\n      result = this.panic();\r\n    }\r\n    return result;\r\n  }\r\n\r\n  // From given edge start point, pick vertex or edge side for proceeding along ray.\r\n  // RAY IS ASSUMED TO START AT THE VERTEX PRECISELY !!!!\r\n  public reAimFromVertex(\r\n    searchBase: HalfEdgePositionDetail,\r\n    ray: Ray3d,\r\n    targetDistance: number): HalfEdgePositionDetail {\r\n    const vertexNode = searchBase.node;\r\n    let result;\r\n    let outboundEdge = vertexNode!;\r\n    do {\r\n      // DPoint3d xyzBase;\r\n      // vu_getDPoint3d(& xyzBase, outboundEdge);\r\n      const data0 = NodeXYZUV.createNodeAndRayOrigin(outboundEdge.faceSuccessor, ray);\r\n      const data1 = NodeXYZUV.createNodeAndRayOrigin(outboundEdge.facePredecessor, ray);\r\n      const u0 = data0.u;\r\n      // double u1 = data1.GetU ();\r\n      const v0 = data0.v;\r\n      const v1 = data1.v;\r\n      if (Math.abs(v0) < this._tol) {\r\n        if (Math.abs(u0 - targetDistance) < this._tol) {\r\n          // Direct hit at far end\r\n          result = searchBase.resetAsVertex(data0.node);\r\n          result.setITag(1);\r\n          return result;\r\n        } else if (u0 > targetDistance) {\r\n          // Direct hig within edge\r\n          const edgeFraction = targetDistance / u0;\r\n          result = searchBase.resetAtEdgeAndFraction(outboundEdge, edgeFraction);\r\n          return result;\r\n        } else if (Math.abs(u0) <= this._tol) {\r\n          // Unexpected direct hit on the base of the search, but call it a hit....\r\n          result = searchBase.resetAsVertex(outboundEdge);\r\n          result.setITag(1);\r\n          return result;\r\n        } else if (u0 > this._tol) {\r\n          // Advance to vertex  ...\r\n          // double edgeFraction = targetDistance / u0;\r\n          result = searchBase.resetAsVertex(data0.node);\r\n          return result;\r\n        } else {\r\n          // Search direction is exactly opposite this edge.\r\n          // See if the other side of the sector is turned even beyond that ...\r\n          if (v1 > this._tol) {\r\n            result = searchBase.resetAsFace(outboundEdge, outboundEdge);\r\n            return result;\r\n          }\r\n        }\r\n      } else if (v0 < -this._tol) {\r\n        if (v1 > this._tol) {\r\n          // The usual simple entry into an angle < 180\r\n          result = searchBase.resetAsFace(outboundEdge, outboundEdge);\r\n          return result;\r\n        }\r\n      }\r\n      // NEEDS WORK: angle >= 180 cases !!!!\r\n      outboundEdge = outboundEdge.vertexSuccessor;\r\n    } while (outboundEdge !== vertexNode);\r\n    return this.panic();\r\n  }\r\n\r\n  // Visit all edges around face.\r\n  // reset lastBefore and firstAfter describing progress towards target distance on ray.\r\n  public reAimAroundFace(\r\n    faceNode: HalfEdge,\r\n    ray: Ray3d,\r\n    targetDistance: number,  // !< distance to target point\r\n    lastBefore: HalfEdgePositionDetail,   // CALLER CREATED -- reset as first hit on negative side of ray.\r\n    firstAfter: HalfEdgePositionDetail): RayClassification {  // ! CALLER CREATED -- reset as first hit on positive side of ray.\r\n\r\n    lastBefore.resetAsUndefinedWithTag(-Number.MAX_VALUE);\r\n    firstAfter.resetAsUndefinedWithTag(Number.MAX_VALUE);\r\n    const data0 = NodeXYZUV.createNodeAndRayOrigin(faceNode, ray);\r\n    let data1;\r\n    let node0 = faceNode;\r\n    do {\r\n      const node1 = node0.faceSuccessor;\r\n      data1 = NodeXYZUV.createNodeAndRayOrigin(node1, ray, data1);\r\n      const u0 = data0.u;\r\n      const u1 = data1.u;\r\n      const v0 = data0.v;\r\n      const v1 = data1.v;\r\n      if (Math.abs(v1) < this._tol) {\r\n        // Vertex hit ...\r\n        const vertexHit = HalfEdgePositionDetail.createVertex(node1);\r\n        vertexHit.setDTag(u1);\r\n        if (Math.abs(u1 - targetDistance) < this._tol) {\r\n          firstAfter.setFrom(vertexHit);\r\n          lastBefore.setFrom(vertexHit);\r\n          return RayClassification.RC_TargetOnVertex;\r\n        }\r\n        if (u1 > targetDistance && u1 < firstAfter.getDTag()!)\r\n          firstAfter.setFrom(vertexHit);\r\n        if (u1 < targetDistance && u1 > lastBefore.getDTag()!)\r\n          lastBefore.setFrom(vertexHit);\r\n      } else if (v0 * v1 < 0.0) {\r\n        // Edge Crossing ...\r\n        const edgeFraction = - v0 / (v1 - v0);\r\n        const uEdge = Geometry.interpolate(u0, edgeFraction, u1);\r\n        const edgeHit = HalfEdgePositionDetail.createEdgeAtFraction(data0.node, edgeFraction);\r\n        edgeHit.setDTag(uEdge);\r\n        if (Math.abs(uEdge - targetDistance) <= this._tol) {\r\n          firstAfter.setFrom(edgeHit);\r\n          lastBefore.setFrom(edgeHit);\r\n          return RayClassification.RC_TargetOnEdge;\r\n        }\r\n        if (uEdge > targetDistance && uEdge < firstAfter.getDTag()!) {\r\n          firstAfter.setFrom(edgeHit);\r\n          firstAfter.setITag(v0 > 0.0 ? -1 : 1);\r\n        }\r\n        if (uEdge < targetDistance && uEdge > lastBefore.getDTag()!) {\r\n          lastBefore.setFrom(edgeHit);\r\n          lastBefore.setDTag(uEdge);\r\n        }\r\n      }\r\n      data0.setFrom(data1);\r\n      node0 = node0.faceSuccessor;\r\n    } while (node0 !== faceNode);\r\n// Returned to start node !!!\r\n    const afterTag = firstAfter.getITag();\r\n    firstAfter.setITag(0);\r\n    lastBefore.setITag(0);\r\n    if (lastBefore.isUnclassified) {\r\n      if (firstAfter.isUnclassified)\r\n        return RayClassification.RC_NoHits;\r\n      return RayClassification.RC_TargetBefore;\r\n    }\r\n    if (firstAfter.isUnclassified\r\n      || (firstAfter.isEdge && afterTag && afterTag < 0)) {\r\n      return RayClassification.RC_TargetAfter;\r\n    } else {\r\n      return RayClassification.RC_Bracket;\r\n    }\r\n  }\r\n\r\n  // Return false if target is reached !!!!\r\n  /**\r\n   * Set (replace contents) ray with\r\n   * * `origin` at start\r\n   * * `direction` is unit vector from start towards target\r\n   * * `a` is distance from start to target.\r\n   * @param start existing position\r\n   * @param target target xy coordinates\r\n   * @param ray ray to update\r\n   */\r\n  public setSearchRay(start: HalfEdgePositionDetail, target: Point3d, ray: Ray3d): boolean {\r\n    ray.origin.setFromPoint3d(start);\r\n    Vector3d.createStartEnd(ray.origin, target, ray.direction);\r\n    ray.direction.z = 0.0;\r\n    const distanceToTarget = ray.direction.magnitudeXY();\r\n    ray.a = ray.direction.magnitude();\r\n    ray.direction.scaleInPlace(1 / ray.a);\r\n    return distanceToTarget >= this._tol;\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"HalfEdgePointInGraphSearch.js","sourceRoot":"","sources":["../../../src/topology/HalfEdgePointInGraphSearch.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AAEH,sDAA6C;AAC7C,0CAAuC;AACvC,mEAAkE;AAElE,mCAAiD;AACjD,2DAAgD;AAChD,qEAAkE;AAElE,wBAAwB;AAExB;;;GAGG;AACH,IAAY,iBAOX;AAPD,WAAY,iBAAiB;IAC3B,6DAAM,CAAA;IACN,6EAAc,CAAA;IACd,yEAAY,CAAA;IACZ,+DAAO,CAAA;IACP,yEAAY,CAAA;IACZ,uEAAW,CAAA;AACb,CAAC,EAPW,iBAAiB,iCAAjB,iBAAiB,QAO5B;AAED;;;;GAIG;AACH,MAAa,kBAAkB;IAE7B,YAAoB,GAAW;QAC7B,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC;IAClB,CAAC;IACM,MAAM,CAAC,MAAM,CAAC,MAAc,mBAAQ,CAAC,mBAAmB;QAC7D,OAAO,IAAI,kBAAkB,CAAC,GAAG,CAAC,CAAC;IACrC,CAAC;IACO,KAAK;QACX,2DAA2D;QAC3D,+GAA+G;QAC/G,8GAA8G;QAC9G,2GAA2G;QAC3G,+GAA+G;QAC/G,+GAA+G;QAC/G,+GAA+G;QAC/G,iHAAiH;QACjH,gHAAgH;QAChH,wBAAwB;QACxB,OAAO,+CAAsB,CAAC,MAAM,EAAE,CAAC;IACzC,CAAC;IACD;;;;;;;OAOG;IACI,aAAa,CAClB,OAA+B,EAAE,GAAU,EAAE,cAAsB;QAEnE,MAAM,KAAK,GAAG,OAAO,CAAC,IAAK,CAAC;QAC5B,MAAM,KAAK,GAAG,6BAAS,CAAC,sBAAsB,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QAC3D,MAAM,KAAK,GAAG,6BAAS,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,CAAC,CAAC,wCAAwC;YAC/D,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;gBACd,MAAM,GAAG,OAAO,CAAC,WAAW,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YAC3C,CAAC;iBAAM,CAAC;gBACN,MAAM,GAAG,OAAO,CAAC,WAAW,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YAC3C,CAAC;QACH,CAAC;aAAM,IAAI,KAAK,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;YACtC,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,KAAK,KAAK,CAAC,IAAI,MAAM,KAAK,CAAC,EAAE,CAAC,CAAC,mBAAmB;gBACpD,MAAM,GAAG,OAAO,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;gBAC3C,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACpB,CAAC;iBAAM,IAAI,KAAK,KAAK,CAAC,IAAI,MAAM,KAAK,CAAC,EAAE,CAAC,CAAC,iBAAiB;gBACzD,MAAM,GAAG,OAAO,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;gBAC3C,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACpB,CAAC;iBAAM,IAAI,KAAK,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC,CAAC,gCAAgC;gBACvE,IAAI,MAAM,GAAG,MAAM,GAAG,CAAC,EAAE,CAAC,CAAC,wBAAwB;oBACjD,MAAM,YAAY,GAAG,CAAC,cAAc,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;oBACtE,MAAM,GAAG,OAAO,CAAC,sBAAsB,CAAC,KAAK,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;oBAClE,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gBACpB,CAAC;qBAAM,IAAI,MAAM,GAAG,CAAC,IAAI,MAAM,GAAG,CAAC,EAAE,CAAC,CAAC,6CAA6C;oBAClF,IAAI,KAAK,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC;wBACnB,MAAM,GAAG,OAAO,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;;wBAE3C,MAAM,GAAG,OAAO,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;gBAC/C,CAAC;qBAAM,CAAC,CAAC,sGAAsG;oBAC7G,OAAO,CAAC,cAAc,EAAE,CAAC;oBACzB,MAAM,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;gBACxB,CAAC;YACH,CAAC;iBAAM,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC,CAAC,qDAAqD;gBAC7E,IAAI,CAAC,KAAK,KAAK,CAAC,SAAS,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,CAAC;oBACvC,MAAM,GAAG,OAAO,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;;oBAE3C,MAAM,GAAG,OAAO,CAAC,WAAW,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YACtE,CAAC;iBAAM,CAAC,CAAC,mDAAmD;gBAC1D,IAAA,qBAAM,EAAC,KAAK,KAAK,CAAC,CAAC,CAAC;gBACpB,IAAI,CAAC,KAAK,KAAK,CAAC,SAAS,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,CAAC;oBACvC,MAAM,GAAG,OAAO,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;;oBAE3C,MAAM,GAAG,OAAO,CAAC,WAAW,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YACtE,CAAC;QACH,CAAC;aAAM,CAAC,CAAC,wFAAwF;YAC/F,OAAO,CAAC,cAAc,EAAE,CAAC;YACzB,MAAM,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;QACxB,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;;OAMG;IACI,eAAe,CACpB,SAAiC,EAAE,GAAU,EAAE,cAAsB;QAErE,IAAA,qBAAM,EAAC,GAAG,CAAC,MAAM,CAAC,YAAY,CAAC,SAAS,CAAC,CAAC,CAAC;QAC3C,MAAM,UAAU,GAAG,SAAS,CAAC,IAAI,CAAC;QAClC,IAAI,YAAY,GAAG,UAAW,CAAC;QAC/B,qGAAqG;QACrG,MAAM,gCAAgC,GAAG,CAAC,QAAgB,EAAW,EAAE;YACrE,IAAI,IAAI,CAAC,GAAG,CAAC,QAAQ,GAAG,cAAc,CAAC,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,wCAAwC;gBAC9F,SAAS,CAAC,aAAa,CAAC,YAAY,CAAC,aAAa,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YACjE,CAAC;iBAAM,IAAI,QAAQ,GAAG,cAAc,EAAE,CAAC,CAAC,iCAAiC;gBACvE,SAAS,CAAC,sBAAsB,CAAC,YAAY,EAAE,cAAc,GAAG,QAAQ,CAAC,CAAC;YAC5E,CAAC;iBAAM,IAAI,QAAQ,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,8CAA8C;gBAC/E,SAAS,CAAC,aAAa,CAAC,YAAY,CAAC,aAAa,CAAC,CAAC;YACtD,CAAC;iBAAM,CAAC;gBACN,OAAO,KAAK,CAAC;YACf,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC,CAAC;QACF,GAAG,CAAC;YACF,iGAAiG;YACjG,MAAM,KAAK,GAAG,6BAAS,CAAC,sBAAsB,CAAC,YAAY,CAAC,aAAa,EAAE,GAAG,CAAC,CAAC;YAChF,MAAM,KAAK,GAAG,6BAAS,CAAC,sBAAsB,CAAC,YAAY,CAAC,eAAe,EAAE,GAAG,CAAC,CAAC;YAClF,mGAAmG;YACnG,qGAAqG;YACrG,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,oGAAoG;YACpG,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,+BAA+B;gBAC9D,IAAI,gCAAgC,CAAC,EAAE,CAAC;oBACtC,OAAO,SAAS,CAAC;gBACnB,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,8BAA8B;oBAC7D,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,GAAG,IAAI,CAAC,IAAI,IAAI,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;wBACtE,OAAO,SAAS,CAAC,WAAW,CAAC,YAAY,EAAE,YAAY,CAAC,CAAC;gBAC7D,CAAC;gBACD,gFAAgF;gBAChF,4FAA4F;gBAC5F,4FAA4F;YAC9F,CAAC;iBAAM,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;gBAC3B,IAAI,EAAE,GAAG,IAAI,CAAC,IAAI,EAAE,qCAAqC;oBACvD,OAAO,SAAS,CAAC,WAAW,CAAC,YAAY,EAAE,YAAY,CAAC,CAAC;gBAC3D,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,uCAAuC;oBAC7D,sDAAsD;oBACtD,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,4CAA4C;wBAC3E,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,IAAI,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,+BAA+B;4BACpF,OAAO,SAAS,CAAC,WAAW,CAAC,YAAY,EAAE,YAAY,CAAC,CAAC;oBAC7D,CAAC;yBAAM,IAAI,EAAE,GAAG,IAAI,CAAC,IAAI,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,gDAAgD;wBACrF,OAAO,SAAS,CAAC,aAAa,CAAC,YAAY,CAAC,aAAa,CAAC,CAAC,CAAC,8BAA8B;oBAC5F,CAAC;gBACH,CAAC;gBACD,uFAAuF;YACzF,CAAC;YACD,6GAA6G;YAC7G,yGAAyG;YACzG,YAAY,GAAG,YAAY,CAAC,eAAe,CAAC;QAC9C,CAAC,QAAQ,YAAY,KAAK,UAAU,EAAE;QACtC,OAAO,IAAI,CAAC,KAAK,EAAE,CAAC;IACtB,CAAC;IACD;;;;;;;;;;;;;;;;;;OAkBG;IACI,eAAe,CACpB,QAAkB,EAClB,GAAU,EACV,cAAsB,EACtB,UAAkC,EAClC,UAAkC;QAElC,IAAA,qBAAM,EAAC,CAAC,QAAQ,CAAC,SAAS,CAAC,oBAAY,CAAC,QAAQ,CAAC,CAAC,CAAC;QACnD,UAAU,CAAC,uBAAuB,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QACtD,UAAU,CAAC,uBAAuB,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;QACrD,MAAM,KAAK,GAAG,6BAAS,CAAC,sBAAsB,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;QAC9D,IAAI,KAAK,CAAC;QACV,IAAI,KAAK,GAAG,QAAQ,CAAC;QACrB,sFAAsF;QACtF,GAAG,CAAC;YACF,MAAM,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;YAClC,KAAK,GAAG,6BAAS,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,CAAC,CAAC,uBAAuB;gBACrD,MAAM,SAAS,GAAG,+CAAsB,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,CAAC;oBAC9C,UAAU,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;oBAC9B,UAAU,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;oBAC9B,OAAO,iBAAiB,CAAC,cAAc,CAAC;gBAC1C,CAAC;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;YAClC,CAAC;iBAAM,IAAI,EAAE,GAAG,EAAE,GAAG,GAAG,EAAE,CAAC,CAAC,mBAAmB;gBAC7C,MAAM,YAAY,GAAG,CAAC,EAAE,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC;gBACrC,MAAM,WAAW,GAAG,mBAAQ,CAAC,WAAW,CAAC,EAAE,EAAE,YAAY,EAAE,EAAE,CAAC,CAAC;gBAC/D,MAAM,OAAO,GAAG,+CAAsB,CAAC,oBAAoB,CAAC,KAAK,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;gBACtF,OAAO,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;gBAC7B,IAAI,IAAI,CAAC,GAAG,CAAC,WAAW,GAAG,cAAc,CAAC,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;oBACxD,UAAU,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;oBAC5B,UAAU,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;oBAC5B,OAAO,iBAAiB,CAAC,YAAY,CAAC;gBACxC,CAAC;gBACD,IAAI,WAAW,GAAG,cAAc,IAAI,WAAW,GAAG,UAAU,CAAC,OAAO,EAAG;oBACrE,UAAU,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;gBAC9B,IAAI,WAAW,GAAG,cAAc,IAAI,WAAW,GAAG,UAAU,CAAC,OAAO,EAAG;oBACrE,UAAU,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;YAChC,CAAC;YACD,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YACrB,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;QAC9B,CAAC,QAAQ,KAAK,KAAK,QAAQ,EAAE;QAC7B,yBAAyB;QACzB,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QACtB,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QACtB,IAAI,UAAU,CAAC,cAAc,EAAE,CAAC;YAC9B,IAAI,UAAU,CAAC,cAAc;gBAC3B,OAAO,iBAAiB,CAAC,MAAM,CAAC;YAClC,OAAO,iBAAiB,CAAC,YAAY,CAAC;QACxC,CAAC;QACD,IAAI,UAAU,CAAC,cAAc;YAC3B,OAAO,iBAAiB,CAAC,WAAW,CAAC;;YAErC,OAAO,iBAAiB,CAAC,OAAO,CAAC,CAAC,uDAAuD;IAC7F,CAAC;IACD;;;;;;;;;OASG;IACI,YAAY,CAAC,KAA6B,EAAE,MAAe,EAAE,GAAU;QAC5E,GAAG,CAAC,MAAM,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC;QACjC,0BAAQ,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,kBAAkB,GAAG,GAAG,CAAC,SAAS,CAAC,WAAW,EAAE,CAAC;QACvD,IAAI,kBAAkB,GAAG,IAAI,CAAC,IAAI;YAChC,OAAO,KAAK,CAAC,CAAC,6DAA6D;QAC7E,GAAG,CAAC,CAAC,GAAG,kBAAkB,CAAC;QAC3B,GAAG,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,GAAG,kBAAkB,CAAC,CAAC;QACnD,OAAO,IAAI,CAAC;IACd,CAAC;CACF;AAhQD,gDAgQC","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 { assert } from \"@itwin/core-bentley\";\nimport { Geometry } from \"../Geometry\";\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\nimport { Ray3d } from \"../geometry3d/Ray3d\";\nimport { HalfEdge, HalfEdgeMask } from \"./Graph\";\nimport { NodeXYZUV } from \"./HalfEdgeNodeXYZUV\";\nimport { HalfEdgePositionDetail } from \"./HalfEdgePositionDetail\";\n\n// cspell:word Chebyshev\n\n/**\n * Return code from [PointSearchContext.reAimAroundFace]\n * @internal\n */\nexport enum RayClassification {\n  NoHits,\n  TargetOnVertex,\n  TargetOnEdge,\n  Bracket,\n  TargetBefore,\n  TargetAfter,\n}\n\n/**\n * Context for searching for the location of an xy-point in a graph.\n * * Assumptions: interior faces of the graph are convex, no edge has length less than `tol`.\n * @internal\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    // A note on \"unexpectedly\" found in comments in this file:\n    // Though this class assumes all edges of the graph have length at least tolerance, the tests below account for\n    // edges with smaller length. This is because we are using two different metrics: Euclidean for distinguishing\n    // points matching user expectation, and Chebyshev, aka \"max component\", for efficiently testing ray-sector\n    // inclusion in the reAimXXX methods. In particular, epsilon-balls in the former metric are smaller than in the\n    // latter. Thus an edge can be inserted into the graph with Euclidean length (barely) greater than epsilon, but\n    // the edge's parallel and perpendicular components with respect to a ray can have Euclidean length *less* than\n    // epsilon, yielding a Chebyshev edge length less than epsilon. This discrepancy requires careful analysis below,\n    // and if this method is invoked, it is probably because we've missed a case where a dot/cross product lies just\n    // beyond the tolerance.\n    return HalfEdgePositionDetail.create();\n  }\n  /**\n   * Reposition `edgeHit` to an adjacent face or vertex, or another position on the edge, that is closer to the\n   * target point.\n   * @param edgeHit start position on a graph edge, updated and returned.\n   * @param ray the ray to the target point. Origin is assumed to lie on the edge.\n   * @param targetDistance distance along the ray to the target point.\n   * @return detail closer to the target point.\n   */\n  public reAimFromEdge(\n    edgeHit: HalfEdgePositionDetail, ray: Ray3d, targetDistance: number,\n  ): 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) { // 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      const alongA = dataA.classifyU(targetDistance, this._tol);\n      const alongB = dataB.classifyU(targetDistance, this._tol);\n      if (sideA === 0 && alongA === 0) { // hit start vertex\n        result = edgeHit.resetAsVertex(dataA.node);\n        result.setITag(1);\n      } else if (sideB === 0 && alongB === 0) { // hit end vertex\n        result = edgeHit.resetAsVertex(dataB.node);\n        result.setITag(1);\n      } else if (sideA === 0 && sideB === 0) { // ray is clearly along the edge\n        if (alongA * alongB < 0) { // target is within edge\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) { // 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 { // both vertices lie on the ray before or after the target; shouldn't happen for edgeHit between nodes\n          edgeHit.resetAsUnknown();\n          result = this.panic();\n        }\n      } else if (sideA === 0) { // ray near start vertex but NOT parallel to the edge\n        if (0 === dataA.classifyU(0.0, this._tol))\n          result = edgeHit.resetAsVertex(dataA.node);\n        else\n          result = edgeHit.resetAsFace(sideB > 0 ? dataB.node : dataA.node);\n      } else { // ray near end vertex but NOT parallel to the edge\n        assert(sideB === 0);\n        if (0 === dataB.classifyU(0.0, this._tol))\n          result = edgeHit.resetAsVertex(dataB.node);\n        else\n          result = edgeHit.resetAsFace(sideA > 0 ? dataA.node : dataB.node);\n      }\n    } else { // both vertices are to same side of the ray; shouldn't happen for edgeHit between nodes\n      edgeHit.resetAsUnknown();\n      result = this.panic();\n    }\n    return result;\n  }\n  /**\n   * Reposition `vertexHit` to an adjacent face, edge, or vertex hit that is closer to the target point.\n   * @param vertexHit start position at a graph vertex, updated and returned.\n   * @param ray the ray to the target point, assumed to start exactly at the vertex.\n   * @param targetDistance distance along the ray to the target point.\n   * @return detail closer to the target point.\n   */\n  public reAimFromVertex(\n    vertexHit: HalfEdgePositionDetail, ray: Ray3d, targetDistance: number,\n  ): HalfEdgePositionDetail {\n    assert(ray.origin.isExactEqual(vertexHit));\n    const vertexNode = vertexHit.node;\n    let outboundEdge = vertexNode!;\n    // lambda to handle the case where the target definitively lies in the same direction as outboundEdge\n    const advancePositionAlongOutboundEdge = (rayParam: number): boolean => {\n      if (Math.abs(rayParam - targetDistance) <= this._tol) { // direct hit at far end of outBoundEdge\n        vertexHit.resetAsVertex(outboundEdge.faceSuccessor).setITag(1);\n      } else if (rayParam > targetDistance) { // direct hit within outBoundEdge\n        vertexHit.resetAtEdgeAndFraction(outboundEdge, targetDistance / rayParam);\n      } else if (rayParam > this._tol) { // far end of outBoundEdge is closer to target\n        vertexHit.resetAsVertex(outboundEdge.faceSuccessor);\n      } else {\n        return false;\n      }\n      return true;\n    };\n    do {\n      // examine the sector at the outboundEdge node; if ray lies in this sector, return updated detail\n      const data0 = NodeXYZUV.createNodeAndRayOrigin(outboundEdge.faceSuccessor, ray);\n      const data1 = NodeXYZUV.createNodeAndRayOrigin(outboundEdge.facePredecessor, ray);\n      // u0 is the length of projection of faceSuccessor to the ray and v0 is the length of projection of\n      // faceSuccessor to the ray perp line (90 degrees CCW). Similarly for u1 and v1 with facePredecessor.\n      const u0 = data0.u;\n      const u1 = data1.u;\n      const v0 = data0.v;\n      const v1 = data1.v;\n      // examine dot and cross of ray with both edges defining this sector to see if ray lies between them\n      if (Math.abs(v0) <= this._tol) { // ray parallel to outBoundEdge\n        if (advancePositionAlongOutboundEdge(u0))\n          return vertexHit;\n        if (Math.abs(u0) <= this._tol) { // edge is unexpectedly* small\n          if (v0 <= 0 && v1 > this._tol && (u0 >= 0 || (u0 < 0 && u1 > this._tol)))\n            return vertexHit.resetAsFace(outboundEdge, outboundEdge);\n        }\n        // The only remaining case is u0 < -this._tol: ray points opposite outBoundEdge.\n        // By our convexity assumption, the only way that ray lies in this sector is if the lookBack\n        // vector points in the same direction as ray, but this would be handled in the next sector.\n      } else if (v0 < -this._tol) {\n        if (v1 > this._tol) // ray definitely lies in this sector\n          return vertexHit.resetAsFace(outboundEdge, outboundEdge);\n        if (v1 >= -this._tol) { // ray and lookBack vector are parallel\n          // handle special cases not handled in the next sector\n          if (Math.abs(u1) <= this._tol) { // lookBack vector is unexpectedly* small...\n            if (v1 > 0 && (u1 >= 0 || (u0 > this._tol && u1 < 0))) // ...and ray is in this sector\n              return vertexHit.resetAsFace(outboundEdge, outboundEdge);\n          } else if (u0 > this._tol && u1 < 0) { // ray and lookBack point in opposite directions\n            return vertexHit.resetAsVertex(outboundEdge.faceSuccessor); // far end is closer to target\n          }\n        }\n        // The only remaining case is v1 < -this._tol: ray definitely lies outside this sector.\n      }\n      // Proceed to the next sector around this vertex. We even examine the (concave) exterior sector at a boundary\n      // vertex in order to handle the case where the target lies in the direction of an exterior outboundEdge.\n      outboundEdge = outboundEdge.vertexSuccessor;\n    } while (outboundEdge !== vertexNode);\n    return this.panic();\n  }\n  /**\n   * Visit all edges around the face, updating `lastBefore` and `firstAfter` to ray-edge intersections that\n   * lie directly before and/or after the target point on the ray, if at all.\n   * @param faceNode starting node on a graph face.\n   * @param ray the ray to the target point.\n   * @param targetDistance distance along the ray to the target point.\n   * @param lastBefore the detail to reset as the last hit on the ray before the target point (CALLER CREATED).\n   * @param firstAfter the detail to reset as the first hit on the ray after the target point (CALLER CREATED).\n   * @returns summary of the updated details:\n   * * [[RayClassification.TargetOnVertex]] - target lies at a vertex of the face (details are identical).\n   * * [[RayClassification.TargetOnEdge]] - target lies on an edge of the face (details are identical).\n   * * [[RayClassification.TargetBefore]] - target lies before the face; the ray intersects the face beyond\n   * the target point.\n   * * [[RayClassification.TargetAfter]] - target lies after the face; the ray intersects the face before\n   * the target point.\n   * * [[RayClassification.Bracket]] - target lies between intersections of the ray and the face; if the face\n   * is convex, this means the target lies inside the face.\n   * * [[RayClassification.NoHits]] - the face does not intersect the ray.\n   */\n  public reAimAroundFace(\n    faceNode: HalfEdge,\n    ray: Ray3d,\n    targetDistance: number,\n    lastBefore: HalfEdgePositionDetail,\n    firstAfter: HalfEdgePositionDetail,\n  ): RayClassification {\n    assert(!faceNode.isMaskSet(HalfEdgeMask.EXTERIOR));\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    // find the intersection of the ray with each edge of the face to classify the ray hit\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) { // ray parallel to edge\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.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) { // ray crosses edge\n        const edgeFraction = -v0 / (v1 - v0);\n        const rayFraction = Geometry.interpolate(u0, edgeFraction, u1);\n        const edgeHit = HalfEdgePositionDetail.createEdgeAtFraction(data0.node, edgeFraction);\n        edgeHit.setDTag(rayFraction);\n        if (Math.abs(rayFraction - targetDistance) <= this._tol) {\n          firstAfter.setFrom(edgeHit);\n          lastBefore.setFrom(edgeHit);\n          return RayClassification.TargetOnEdge;\n        }\n        if (rayFraction > targetDistance && rayFraction < firstAfter.getDTag()!)\n          firstAfter.setFrom(edgeHit);\n        if (rayFraction < targetDistance && rayFraction > lastBefore.getDTag()!)\n          lastBefore.setFrom(edgeHit);\n      }\n      data0.setFrom(data1);\n      node0 = node0.faceSuccessor;\n    } while (node0 !== faceNode);\n    // returned to start node\n    firstAfter.setITag(0);\n    lastBefore.setITag(0);\n    if (lastBefore.isUnclassified) {\n      if (firstAfter.isUnclassified)\n        return RayClassification.NoHits;\n      return RayClassification.TargetBefore;\n    }\n    if (firstAfter.isUnclassified)\n      return RayClassification.TargetAfter;\n    else\n      return RayClassification.Bracket; // face is locally convex; target lies inside this face\n  }\n  /**\n   * Initialize the input ray for topology search:\n   * * `origin` is at `start`\n   * * `direction` is the unit xy-vector from `start` towards `target`\n   * * `a` is the xy-distance from `start` to `target`\n   * @param start existing position\n   * @param target target xy coordinates\n   * @param ray updated in place\n   * @returns false if target is reached.\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 distanceToTargetXY = ray.direction.magnitudeXY();\n    if (distanceToTargetXY < this._tol)\n      return false; // no searching necessary, we are already at the target point\n    ray.a = distanceToTargetXY;\n    ray.direction.scaleInPlace(1 / distanceToTargetXY);\n    return true;\n  }\n}\n"]}