@itwin/core-geometry 4.4.0-dev.9 → 4.5.0-dev.0

package/lib/esm/polyface/RangeTree/RangeTreeSearchHandlers.d.ts

@@ -0,0 +1,204 @@
+/** @packageDocumentation
+ * @module RangeSearch
+ */
+import { CurveLocationDetail, CurveLocationDetailPair } from "../../curve/CurveLocationDetail";
+import { Point3d } from "../../geometry3d/Point3dVector3d";
+import { Range3d } from "../../geometry3d/Range";
+import { FacetLocationDetail, FacetLocationDetailPair } from "../FacetLocationDetail";
+import { LineString3dRangeTreeContext } from "./LineString3dRangeTreeContext";
+import { MinimumValueTester } from "./MinimumValueTester";
+import { Point3dArrayRangeTreeContext } from "./Point3dArrayRangeTreeContext";
+import { PolyfaceRangeTreeContext } from "./PolyfaceRangeTreeContext";
+import { SingleTreeSearchHandler, TwoTreeDistanceMinimizationSearchHandler } from "./RangeTreeNode";
+/**
+ * Helper class for searching for the closest point in a set of points.
+ * * Future optimization: avoid sqrt by using squared distance throughout (would require refactoring CurveLocationDetail).
+ * @internal
+ */
+export declare class SingleTreeSearchHandlerForClosestPointInArray extends SingleTreeSearchHandler<number> {
+    /** The calling context */
+    context: Point3dArrayRangeTreeContext;
+    /** Evolving search state */
+    searchState: MinimumValueTester<number>;
+    /** Space point for the search  */
+    spacePoint: Point3d;
+    /**
+     * Constructor
+     * @param spacePoint cloned
+     * @param context captured
+     * @param maxDist collect points at no more than this distance from spacePoint
+     */
+    constructor(spacePoint: Point3d, context: Point3dArrayRangeTreeContext, maxDist?: number);
+    /** Return the current closest point */
+    getResult(): CurveLocationDetail | undefined;
+    /** Return the collected closest points (if collecting) */
+    getSavedItems(): CurveLocationDetail[] | undefined;
+    /**
+     * Return true if appData within the range should be offered to `processAppData`.
+     * @param range range containing items to be tested.
+     * @returns true if the spacePoint is within the range or close enough that a point in the range could be the closest.
+     */
+    isRangeActive(range: Range3d): boolean;
+    /** Test a point indexed in the range tree as candidate for "closest" */
+    processAppData(candidateIndex: number): void;
+}
+/**
+ * Helper class for searching for the closest approach between sets of points.
+ * * Future optimization: avoid sqrt by using squared distance throughout (would require refactoring CurveLocationDetail).
+ * @internal
+ */
+export declare class TwoTreeSearchHandlerForPoint3dArrayPoint3dArrayCloseApproach extends TwoTreeDistanceMinimizationSearchHandler<number> {
+    /** Context for first set of points */
+    contextA: Point3dArrayRangeTreeContext;
+    /** Context for second set of points */
+    contextB: Point3dArrayRangeTreeContext;
+    /** Search state with current min distance point pair */
+    searchState: MinimumValueTester<CurveLocationDetailPair>;
+    /**
+     * Constructor
+     * @param contextA captured
+     * @param contextB captured
+     * @param maxDist collect points at no more than this separation distance
+     */
+    constructor(contextA: Point3dArrayRangeTreeContext, contextB: Point3dArrayRangeTreeContext, maxDist?: number);
+    /** Return the current closest approach */
+    getResult(): CurveLocationDetailPair | undefined;
+    /** Return the collected close approaches (if collecting) */
+    getSavedItems(): CurveLocationDetailPair[] | undefined;
+    /** Get current min distance */
+    getCurrentDistance(): number;
+    /** Compute and test the distance between two points, given their indices. */
+    processAppDataPair(indexA: number, indexB: number): void;
+}
+/**
+ * Helper class for searching for the closest point in a linestring.
+ * * Future optimization: avoid sqrt by using squared distance throughout (would require refactoring CurveLocationDetail).
+ * @internal
+ */
+export declare class SingleTreeSearchHandlerForClosestPointOnLineString3d extends SingleTreeSearchHandler<number> {
+    /** The calling context */
+    context: LineString3dRangeTreeContext;
+    /** Evolving search state */
+    searchState: MinimumValueTester<CurveLocationDetail>;
+    /** Space point for the search */
+    spacePoint: Point3d;
+    /**
+     * Constructor
+     * @param spacePoint cloned
+     * @param context captured
+     * @param maxDist collect points at no more than this distance from spacePoint
+     */
+    constructor(spacePoint: Point3d, context: LineString3dRangeTreeContext, maxDist?: number);
+    /** Return the current closest point */
+    getResult(): CurveLocationDetail | undefined;
+    /** Return the collected closest points (if collecting) */
+    getSavedItems(): CurveLocationDetail[] | undefined;
+    /**
+     * Return true if appData within the range should be offered to `processAppData`.
+     * @param range range containing items to be tested.
+     * @returns true if the spacePoint is within the range or close enough that a point in the range could be the closest.
+     */
+    isRangeActive(range: Range3d): boolean;
+    private _workSegment?;
+    /** Test a segment indexed in the range tree as candidate for "closest" */
+    processAppData(candidateIndex: number): void;
+}
+/**
+ * Helper class for searching for the closest approach between linestrings.
+ * * Future optimization: avoid sqrt by using squared distance throughout (would require refactoring CurveLocationDetail).
+ * @internal
+ */
+export declare class TwoTreeSearchHandlerForLineString3dLineString3dCloseApproach extends TwoTreeDistanceMinimizationSearchHandler<number> {
+    /** Context for first polyline */
+    contextA: LineString3dRangeTreeContext;
+    /** Context for second polyline */
+    contextB: LineString3dRangeTreeContext;
+    /** Search state with current min distance point pair */
+    searchState: MinimumValueTester<CurveLocationDetailPair>;
+    /**
+     * Constructor
+     * @param contextA captured
+     * @param contextB captured
+     * @param maxDist collect points at no more than this separation distance
+     */
+    constructor(contextA: LineString3dRangeTreeContext, contextB: LineString3dRangeTreeContext, maxDist?: number);
+    /**
+     * Return the current closest approach.
+     * * Details contain linestring *and* segment data, cf. [[LineString3d.convertLocalToGlobalDetail]]
+     */
+    getResult(): CurveLocationDetailPair | undefined;
+    /** Return the collected close approaches (if collecting) */
+    getSavedItems(): CurveLocationDetailPair[] | undefined;
+    /** Get current min distance */
+    getCurrentDistance(): number;
+    private static _workSegmentA?;
+    private static _workSegmentB?;
+    /** Compute and test the closest approach between two segments, given their indices. */
+    processAppDataPair(indexA: number, indexB: number): void;
+}
+/**
+ * Helper class for searching for the closest point in a polyface.
+ * * Future optimization: avoid sqrt by using squared distance throughout (would require refactoring FacetLocationDetail).
+ * @internal
+ */
+export declare class SingleTreeSearchHandlerForClosestPointOnPolyface extends SingleTreeSearchHandler<number> {
+    /** The calling context */
+    context: PolyfaceRangeTreeContext;
+    /** Evolving search state */
+    searchState: MinimumValueTester<FacetLocationDetail>;
+    /** Space point for the search */
+    spacePoint: Point3d;
+    /** Whether to include facet interior in search */
+    searchFacetInterior: boolean;
+    /**
+     * Constructor
+     * @param spacePoint cloned
+     * @param context captured
+     * @param maxDist collect points at no more than this distance from spacePoint
+     * @param searchFacetInterior true: search facet interior + boundary; false: just boundary
+     */
+    constructor(spacePoint: Point3d, context: PolyfaceRangeTreeContext, maxDist?: number, searchFacetInterior?: boolean);
+    /** Return the current closest point */
+    getResult(): FacetLocationDetail | undefined;
+    /** Return the collected closest points (if collecting) */
+    getSavedItems(): FacetLocationDetail[] | undefined;
+    /**
+     * Return true if appData within the range should be offered to `processAppData`.
+     * @param range range containing items to be tested.
+     * @returns true if the spacePoint is within the range or close enough that a point in the range could be the closest.
+     */
+    isRangeActive(range: Range3d): boolean;
+    /** Test a facet indexed in the range tree as candidate for "closest" */
+    processAppData(candidateIndex: number): void;
+}
+/**
+ * Helper class for searching for the closest approach between polyfaces.
+ * * Future optimization: avoid sqrt by using squared distance throughout (would require refactoring FacetLocationDetail).
+ * @internal
+ */
+export declare class TwoTreeSearchHandlerForFacetFacetCloseApproach extends TwoTreeDistanceMinimizationSearchHandler<number> {
+    /** Context for first polyface */
+    contextA: PolyfaceRangeTreeContext;
+    /** Context for second polyface */
+    contextB: PolyfaceRangeTreeContext;
+    /** Search state with current min distance and facet pair */
+    searchState: MinimumValueTester<FacetLocationDetailPair>;
+    /** Whether to include facet interior in search */
+    searchFacetInterior: boolean;
+    /** Constructor
+     * @param contextA captured
+     * @param contextB captured
+     * @param maxDist collect points at no more than this separation distance
+     * @param searchFacetInterior true: search facet interior + boundary; false: just boundary
+    */
+    constructor(contextA: PolyfaceRangeTreeContext, contextB: PolyfaceRangeTreeContext, maxDist?: number, searchFacetInterior?: boolean);
+    /** Return the facets with closest approach */
+    getResult(): FacetLocationDetailPair | undefined;
+    /** Return the collected close approaches (if collecting) */
+    getSavedItems(): FacetLocationDetailPair[] | undefined;
+    /** Get current min distance */
+    getCurrentDistance(): number;
+    /** Compute and test the closest approach between two facets, given their indices. */
+    processAppDataPair(indexA: number, indexB: number): void;
+}
+//# sourceMappingURL=RangeTreeSearchHandlers.d.ts.map

package/lib/esm/polyface/RangeTree/RangeTreeSearchHandlers.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"RangeTreeSearchHandlers.d.ts","sourceRoot":"","sources":["../../../../src/polyface/RangeTree/RangeTreeSearchHandlers.ts"],"names":[],"mappings":"AAIA;;GAEG;AAEH,OAAO,EAAE,mBAAmB,EAAE,uBAAuB,EAAE,MAAM,iCAAiC,CAAC;AAG/F,OAAO,EAAE,OAAO,EAAE,MAAM,kCAAkC,CAAC;AAE3D,OAAO,EAAE,OAAO,EAAE,MAAM,wBAAwB,CAAC;AACjD,OAAO,EAA6B,mBAAmB,EAAE,uBAAuB,EAAgC,MAAM,wBAAwB,CAAC;AAC/I,OAAO,EAAE,4BAA4B,EAAE,MAAM,gCAAgC,CAAC;AAC9E,OAAO,EAAE,kBAAkB,EAAE,MAAM,sBAAsB,CAAC;AAC1D,OAAO,EAAE,4BAA4B,EAAE,MAAM,gCAAgC,CAAC;AAC9E,OAAO,EAAE,wBAAwB,EAAE,MAAM,4BAA4B,CAAC;AACtE,OAAO,EAAE,uBAAuB,EAAE,wCAAwC,EAAE,MAAM,iBAAiB,CAAC;AAEpG;;;;GAIG;AACH,qBAAa,6CAA8C,SAAQ,uBAAuB,CAAC,MAAM,CAAC;IAChG,0BAA0B;IACnB,OAAO,EAAE,4BAA4B,CAAC;IAC7C,4BAA4B;IACrB,WAAW,EAAE,kBAAkB,CAAC,MAAM,CAAC,CAAC;IAC/C,kCAAkC;IAC3B,UAAU,EAAE,OAAO,CAAC;IAE3B;;;;;OAKG;gBACgB,UAAU,EAAE,OAAO,EAAE,OAAO,EAAE,4BAA4B,EAAE,OAAO,CAAC,EAAE,MAAM;IAQ/F,uCAAuC;IAChC,SAAS,IAAI,mBAAmB,GAAG,SAAS;IASnD,0DAA0D;IACnD,aAAa,IAAI,mBAAmB,EAAE,GAAG,SAAS;IAYzD;;;;OAIG;IACa,aAAa,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO;IAStD,wEAAwE;IACxD,cAAc,CAAC,cAAc,EAAE,MAAM,GAAG,IAAI;CAK7D;AAED;;;;GAIG;AACH,qBAAa,4DAA6D,SAAQ,wCAAwC,CAAC,MAAM,CAAC;IAChI,sCAAsC;IAC/B,QAAQ,EAAE,4BAA4B,CAAC;IAC9C,uCAAuC;IAChC,QAAQ,EAAE,4BAA4B,CAAC;IAC9C,wDAAwD;IACjD,WAAW,EAAE,kBAAkB,CAAC,uBAAuB,CAAC,CAAC;IAEhE;;;;;OAKG;gBACgB,QAAQ,EAAE,4BAA4B,EAAE,QAAQ,EAAE,4BAA4B,EAAE,OAAO,CAAC,EAAE,MAAM;IAQnH,0CAA0C;IACnC,SAAS,IAAI,uBAAuB,GAAG,SAAS;IAMvD,4DAA4D;IACrD,aAAa,IAAI,uBAAuB,EAAE,GAAG,SAAS;IAM7D,+BAA+B;IACf,kBAAkB,IAAI,MAAM;IAI5C,6EAA6E;IAC7D,kBAAkB,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,IAAI;CAczE;AAED;;;;GAIG;AACH,qBAAa,oDAAqD,SAAQ,uBAAuB,CAAC,MAAM,CAAC;IACvG,0BAA0B;IACnB,OAAO,EAAE,4BAA4B,CAAC;IAC7C,4BAA4B;IACrB,WAAW,EAAE,kBAAkB,CAAC,mBAAmB,CAAC,CAAC;IAC5D,iCAAiC;IAC1B,UAAU,EAAE,OAAO,CAAC;IAE3B;;;;;OAKG;gBACgB,UAAU,EAAE,OAAO,EAAE,OAAO,EAAE,4BAA4B,EAAE,OAAO,CAAC,EAAE,MAAM;IAQ/F,uCAAuC;IAChC,SAAS,IAAI,mBAAmB,GAAG,SAAS;IAMnD,0DAA0D;IACnD,aAAa,IAAI,mBAAmB,EAAE,GAAG,SAAS;IAMzD;;;;OAIG;IACa,aAAa,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO;IAStD,OAAO,CAAC,YAAY,CAAC,CAAgB;IACrC,0EAA0E;IAC1D,cAAc,CAAC,cAAc,EAAE,MAAM,GAAG,IAAI;CAS7D;AAED;;;;GAIG;AACH,qBAAa,4DAA6D,SAAQ,wCAAwC,CAAC,MAAM,CAAC;IAChI,iCAAiC;IAC1B,QAAQ,EAAE,4BAA4B,CAAC;IAC9C,kCAAkC;IAC3B,QAAQ,EAAE,4BAA4B,CAAC;IAC9C,wDAAwD;IACjD,WAAW,EAAE,kBAAkB,CAAC,uBAAuB,CAAC,CAAC;IAEhE;;;;;OAKG;gBACgB,QAAQ,EAAE,4BAA4B,EAAE,QAAQ,EAAE,4BAA4B,EAAE,OAAO,CAAC,EAAE,MAAM;IAQnH;;;OAGG;IACI,SAAS,IAAI,uBAAuB,GAAG,SAAS;IAMvD,4DAA4D;IACrD,aAAa,IAAI,uBAAuB,EAAE,GAAG,SAAS;IAM7D,+BAA+B;IACf,kBAAkB,IAAI,MAAM;IAI5C,OAAO,CAAC,MAAM,CAAC,aAAa,CAAC,CAAgB;IAC7C,OAAO,CAAC,MAAM,CAAC,aAAa,CAAC,CAAgB;IAC7C,uFAAuF;IACvE,kBAAkB,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,IAAI;CAazE;AAED;;;;GAIG;AACH,qBAAa,gDAAiD,SAAQ,uBAAuB,CAAC,MAAM,CAAC;IACnG,0BAA0B;IACnB,OAAO,EAAE,wBAAwB,CAAC;IACzC,4BAA4B;IACrB,WAAW,EAAE,kBAAkB,CAAC,mBAAmB,CAAC,CAAC;IAC5D,iCAAiC;IAC1B,UAAU,EAAE,OAAO,CAAC;IAC3B,kDAAkD;IAC3C,mBAAmB,EAAE,OAAO,CAAC;IAEpC;;;;;;OAMG;gBACgB,UAAU,EAAE,OAAO,EAAE,OAAO,EAAE,wBAAwB,EAAE,OAAO,CAAC,EAAE,MAAM,EAAE,mBAAmB,GAAE,OAAe;IASjI,uCAAuC;IAChC,SAAS,IAAI,mBAAmB,GAAG,SAAS;IAMnD,0DAA0D;IACnD,aAAa,IAAI,mBAAmB,EAAE,GAAG,SAAS;IAMzD;;;;OAIG;IACa,aAAa,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO;IAStD,wEAAwE;IACxD,cAAc,CAAC,cAAc,EAAE,MAAM,GAAG,IAAI;CAkB7D;AACD;;;;GAIG;AACH,qBAAa,8CAA+C,SAAQ,wCAAwC,CAAC,MAAM,CAAC;IAClH,iCAAiC;IAC1B,QAAQ,EAAE,wBAAwB,CAAC;IAC1C,kCAAkC;IAC3B,QAAQ,EAAE,wBAAwB,CAAC;IAC1C,4DAA4D;IACrD,WAAW,EAAE,kBAAkB,CAAC,uBAAuB,CAAC,CAAC;IAChE,kDAAkD;IAC3C,mBAAmB,EAAE,OAAO,CAAC;IAEpC;;;;;MAKE;gBACiB,QAAQ,EAAE,wBAAwB,EAAE,QAAQ,EAAE,wBAAwB,EAAE,OAAO,CAAC,EAAE,MAAM,EAAE,mBAAmB,GAAE,OAAe;IASjJ,8CAA8C;IACvC,SAAS,IAAI,uBAAuB,GAAG,SAAS;IAMvD,4DAA4D;IACrD,aAAa,IAAI,uBAAuB,EAAE,GAAG,SAAS;IAM7D,+BAA+B;IACf,kBAAkB,IAAI,MAAM;IAI5C,qFAAqF;IACrE,kBAAkB,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,IAAI;CAkBzE"}

package/lib/esm/polyface/RangeTree/RangeTreeSearchHandlers.js

@@ -0,0 +1,374 @@
+/*---------------------------------------------------------------------------------------------
+* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+* See LICENSE.md in the project root for license terms and full copyright notice.
+*--------------------------------------------------------------------------------------------*/
+/** @packageDocumentation
+ * @module RangeSearch
+ */
+import { CurveLocationDetail, CurveLocationDetailPair } from "../../curve/CurveLocationDetail";
+import { LineSegment3d } from "../../curve/LineSegment3d";
+import { LineString3d } from "../../curve/LineString3d";
+import { PolygonOps } from "../../geometry3d/PolygonOps";
+import { ConvexFacetLocationDetail, FacetLocationDetailPair, NonConvexFacetLocationDetail } from "../FacetLocationDetail";
+import { MinimumValueTester } from "./MinimumValueTester";
+import { SingleTreeSearchHandler, TwoTreeDistanceMinimizationSearchHandler } from "./RangeTreeNode";
+/**
+ * Helper class for searching for the closest point in a set of points.
+ * * Future optimization: avoid sqrt by using squared distance throughout (would require refactoring CurveLocationDetail).
+ * @internal
+ */
+export class SingleTreeSearchHandlerForClosestPointInArray extends SingleTreeSearchHandler {
+    /**
+     * Constructor
+     * @param spacePoint cloned
+     * @param context captured
+     * @param maxDist collect points at no more than this distance from spacePoint
+     */
+    constructor(spacePoint, context, maxDist) {
+        super();
+        this.context = context;
+        if (maxDist !== undefined && maxDist < 0)
+            maxDist = undefined;
+        this.searchState = MinimumValueTester.create(maxDist);
+        this.spacePoint = spacePoint.clone();
+    }
+    /** Return the current closest point */
+    getResult() {
+        if (this.searchState.minValue !== undefined && this.searchState.itemAtMinValue !== undefined) {
+            const iPoint = this.searchState.itemAtMinValue;
+            const cld = CurveLocationDetail.createCurveFractionPoint(undefined, iPoint, this.context.points[iPoint]);
+            cld.a = this.searchState.minValue;
+            return cld;
+        }
+        return undefined;
+    }
+    /** Return the collected closest points (if collecting) */
+    getSavedItems() {
+        if (this.searchState.savedItems.length === 0)
+            return undefined;
+        const cldArray = [];
+        for (let i = 0; i < this.searchState.savedItems.length; ++i) {
+            const iPoint = this.searchState.savedItems[i];
+            const cld = CurveLocationDetail.createCurveFractionPoint(undefined, iPoint, this.context.points[iPoint]);
+            cld.a = this.searchState.savedValues[i];
+            cldArray.push(cld);
+        }
+        return cldArray;
+    }
+    /**
+     * Return true if appData within the range should be offered to `processAppData`.
+     * @param range range containing items to be tested.
+     * @returns true if the spacePoint is within the range or close enough that a point in the range could be the closest.
+     */
+    isRangeActive(range) {
+        const dMin = range.distanceToPoint(this.spacePoint);
+        if (this.searchState.isNewMinValue(dMin)) {
+            this.context.numRangeTestTrue++;
+            return true;
+        }
+        this.context.numRangeTestFalse++;
+        return false;
+    }
+    /** Test a point indexed in the range tree as candidate for "closest" */
+    processAppData(candidateIndex) {
+        const d = this.spacePoint.distance(this.context.points[candidateIndex]);
+        this.context.numPointTest++;
+        this.searchState.testAndSave(candidateIndex, d);
+    }
+}
+/**
+ * Helper class for searching for the closest approach between sets of points.
+ * * Future optimization: avoid sqrt by using squared distance throughout (would require refactoring CurveLocationDetail).
+ * @internal
+ */
+export class TwoTreeSearchHandlerForPoint3dArrayPoint3dArrayCloseApproach extends TwoTreeDistanceMinimizationSearchHandler {
+    /**
+     * Constructor
+     * @param contextA captured
+     * @param contextB captured
+     * @param maxDist collect points at no more than this separation distance
+     */
+    constructor(contextA, contextB, maxDist) {
+        super();
+        this.contextA = contextA;
+        this.contextB = contextB;
+        if (maxDist !== undefined && maxDist < 0)
+            maxDist = undefined;
+        this.searchState = MinimumValueTester.create(maxDist);
+    }
+    /** Return the current closest approach */
+    getResult() {
+        if (this.searchState.minValue !== undefined) {
+            return this.searchState.itemAtMinValue;
+        }
+        return undefined;
+    }
+    /** Return the collected close approaches (if collecting) */
+    getSavedItems() {
+        if (this.searchState.savedItems.length > 0) {
+            return this.searchState.savedItems;
+        }
+        return undefined;
+    }
+    /** Get current min distance */
+    getCurrentDistance() {
+        const d = this.searchState.minValue;
+        return d === undefined ? Number.MAX_VALUE : d;
+    }
+    /** Compute and test the distance between two points, given their indices. */
+    processAppDataPair(indexA, indexB) {
+        this.contextA.numPointTest++;
+        const pointA = this.contextA.points[indexA];
+        const pointB = this.contextB.points[indexB];
+        const d = pointA.distance(pointB);
+        if (this.searchState.isNewMinOrTrigger(d)) {
+            const cldPair = CurveLocationDetailPair.createCapture(CurveLocationDetail.createCurveFractionPoint(undefined, indexA, pointA), CurveLocationDetail.createCurveFractionPoint(undefined, indexB, pointB));
+            cldPair.detailA.a = cldPair.detailB.a = d;
+            this.searchState.testAndSave(cldPair, d);
+        }
+    }
+}
+/**
+ * Helper class for searching for the closest point in a linestring.
+ * * Future optimization: avoid sqrt by using squared distance throughout (would require refactoring CurveLocationDetail).
+ * @internal
+ */
+export class SingleTreeSearchHandlerForClosestPointOnLineString3d extends SingleTreeSearchHandler {
+    /**
+     * Constructor
+     * @param spacePoint cloned
+     * @param context captured
+     * @param maxDist collect points at no more than this distance from spacePoint
+     */
+    constructor(spacePoint, context, maxDist) {
+        super();
+        this.context = context;
+        if (maxDist !== undefined && maxDist < 0)
+            maxDist = undefined;
+        this.searchState = MinimumValueTester.create(maxDist);
+        this.spacePoint = spacePoint.clone();
+    }
+    /** Return the current closest point */
+    getResult() {
+        if (this.searchState.minValue !== undefined && this.searchState.itemAtMinValue !== undefined) {
+            return this.searchState.itemAtMinValue;
+        }
+        return undefined;
+    }
+    /** Return the collected closest points (if collecting) */
+    getSavedItems() {
+        if (this.searchState.savedItems.length > 0) {
+            return this.searchState.savedItems;
+        }
+        return undefined;
+    }
+    /**
+     * Return true if appData within the range should be offered to `processAppData`.
+     * @param range range containing items to be tested.
+     * @returns true if the spacePoint is within the range or close enough that a point in the range could be the closest.
+     */
+    isRangeActive(range) {
+        const dMin = range.distanceToPoint(this.spacePoint);
+        if (this.searchState.isNewMinValue(dMin)) {
+            this.context.numRangeTestTrue++;
+            return true;
+        }
+        this.context.numRangeTestFalse++;
+        return false;
+    }
+    /** Test a segment indexed in the range tree as candidate for "closest" */
+    processAppData(candidateIndex) {
+        const segment = this._workSegment = this.context.lineString.getIndexedSegment(candidateIndex, this._workSegment);
+        if (segment) {
+            const cld = segment.closestPoint(this.spacePoint, false);
+            LineString3d.convertLocalToGlobalDetail(cld, candidateIndex, this.context.lineString.numEdges(), this.context.lineString);
+            this.context.numPointTest++;
+            this.searchState.testAndSave(cld, cld.a);
+        }
+    }
+}
+/**
+ * Helper class for searching for the closest approach between linestrings.
+ * * Future optimization: avoid sqrt by using squared distance throughout (would require refactoring CurveLocationDetail).
+ * @internal
+ */
+export class TwoTreeSearchHandlerForLineString3dLineString3dCloseApproach extends TwoTreeDistanceMinimizationSearchHandler {
+    /**
+     * Constructor
+     * @param contextA captured
+     * @param contextB captured
+     * @param maxDist collect points at no more than this separation distance
+     */
+    constructor(contextA, contextB, maxDist) {
+        super();
+        this.contextA = contextA;
+        this.contextB = contextB;
+        if (maxDist !== undefined && maxDist < 0)
+            maxDist = undefined;
+        this.searchState = MinimumValueTester.create(maxDist);
+    }
+    /**
+     * Return the current closest approach.
+     * * Details contain linestring *and* segment data, cf. [[LineString3d.convertLocalToGlobalDetail]]
+     */
+    getResult() {
+        if (this.searchState.minValue !== undefined) {
+            return this.searchState.itemAtMinValue;
+        }
+        return undefined;
+    }
+    /** Return the collected close approaches (if collecting) */
+    getSavedItems() {
+        if (this.searchState.savedItems.length > 0) {
+            return this.searchState.savedItems;
+        }
+        return undefined;
+    }
+    /** Get current min distance */
+    getCurrentDistance() {
+        const d = this.searchState.minValue;
+        return d === undefined ? Number.MAX_VALUE : d;
+    }
+    /** Compute and test the closest approach between two segments, given their indices. */
+    processAppDataPair(indexA, indexB) {
+        this.contextA.numPointTest++;
+        const segA = TwoTreeSearchHandlerForLineString3dLineString3dCloseApproach._workSegmentA =
+            this.contextA.lineString.getIndexedSegment(indexA, TwoTreeSearchHandlerForLineString3dLineString3dCloseApproach._workSegmentA);
+        const segB = TwoTreeSearchHandlerForLineString3dLineString3dCloseApproach._workSegmentB =
+            this.contextB.lineString.getIndexedSegment(indexB, TwoTreeSearchHandlerForLineString3dLineString3dCloseApproach._workSegmentB);
+        const cldPair = LineSegment3d.closestApproach(segA, false, segB, false);
+        if (cldPair && this.searchState.isNewMinOrTrigger(cldPair.detailA.a)) {
+            LineString3d.convertLocalToGlobalDetail(cldPair.detailA, indexA, this.contextA.lineString.numEdges(), this.contextA.lineString);
+            LineString3d.convertLocalToGlobalDetail(cldPair.detailB, indexB, this.contextB.lineString.numEdges(), this.contextB.lineString);
+            this.searchState.testAndSave(cldPair, cldPair.detailA.a);
+        }
+    }
+}
+/**
+ * Helper class for searching for the closest point in a polyface.
+ * * Future optimization: avoid sqrt by using squared distance throughout (would require refactoring FacetLocationDetail).
+ * @internal
+ */
+export class SingleTreeSearchHandlerForClosestPointOnPolyface extends SingleTreeSearchHandler {
+    /**
+     * Constructor
+     * @param spacePoint cloned
+     * @param context captured
+     * @param maxDist collect points at no more than this distance from spacePoint
+     * @param searchFacetInterior true: search facet interior + boundary; false: just boundary
+     */
+    constructor(spacePoint, context, maxDist, searchFacetInterior = false) {
+        super();
+        this.context = context;
+        if (maxDist !== undefined && maxDist < 0)
+            maxDist = undefined;
+        this.searchState = MinimumValueTester.create(maxDist);
+        this.spacePoint = spacePoint.clone();
+        this.searchFacetInterior = searchFacetInterior;
+    }
+    /** Return the current closest point */
+    getResult() {
+        if (this.searchState.minValue !== undefined && this.searchState.itemAtMinValue !== undefined) {
+            return this.searchState.itemAtMinValue;
+        }
+        return undefined;
+    }
+    /** Return the collected closest points (if collecting) */
+    getSavedItems() {
+        if (this.searchState.savedItems.length > 0) {
+            return this.searchState.savedItems;
+        }
+        return undefined;
+    }
+    /**
+     * Return true if appData within the range should be offered to `processAppData`.
+     * @param range range containing items to be tested.
+     * @returns true if the spacePoint is within the range or close enough that a point in the range could be the closest.
+     */
+    isRangeActive(range) {
+        const dMin = range.distanceToPoint(this.spacePoint);
+        if (this.searchState.isNewMinValue(dMin)) {
+            this.context.numRangeTestTrue++;
+            return true;
+        }
+        this.context.numRangeTestFalse++;
+        return false;
+    }
+    /** Test a facet indexed in the range tree as candidate for "closest" */
+    processAppData(candidateIndex) {
+        this.context.visitor.setNumWrap(0); // so edgeCount === pointCount; closure point unnecessary for closestPoint[OnBoundary]
+        if (this.context.visitor.moveToReadIndex(candidateIndex)) {
+            let pld;
+            if (this.searchFacetInterior)
+                pld = PolygonOps.closestPoint(this.context.visitor.point, this.spacePoint);
+            else
+                pld = PolygonOps.closestPointOnBoundary(this.context.visitor.point, this.spacePoint);
+            this.context.numFacetTest++;
+            if (pld && this.searchState.isNewMinOrTrigger(pld.a)) {
+                const edgeCount = this.context.visitor.pointCount;
+                const fld = this.context.convexFacets
+                    ? ConvexFacetLocationDetail.createCapture(this.context.visitor.currentReadIndex(), edgeCount, pld)
+                    : NonConvexFacetLocationDetail.createCapture(this.context.visitor.currentReadIndex(), edgeCount, pld);
+                this.searchState.testAndSave(fld, pld.a);
+            }
+        }
+    }
+}
+/**
+ * Helper class for searching for the closest approach between polyfaces.
+ * * Future optimization: avoid sqrt by using squared distance throughout (would require refactoring FacetLocationDetail).
+ * @internal
+ */
+export class TwoTreeSearchHandlerForFacetFacetCloseApproach extends TwoTreeDistanceMinimizationSearchHandler {
+    /** Constructor
+     * @param contextA captured
+     * @param contextB captured
+     * @param maxDist collect points at no more than this separation distance
+     * @param searchFacetInterior true: search facet interior + boundary; false: just boundary
+    */
+    constructor(contextA, contextB, maxDist, searchFacetInterior = false) {
+        super();
+        this.contextA = contextA;
+        this.contextB = contextB;
+        if (maxDist !== undefined && maxDist < 0)
+            maxDist = undefined;
+        this.searchState = MinimumValueTester.create(maxDist);
+        this.searchFacetInterior = searchFacetInterior && contextA.convexFacets && contextB.convexFacets;
+    }
+    /** Return the facets with closest approach */
+    getResult() {
+        if (this.searchState.minValue !== undefined) {
+            return this.searchState.itemAtMinValue;
+        }
+        return undefined;
+    }
+    /** Return the collected close approaches (if collecting) */
+    getSavedItems() {
+        if (this.searchState.savedItems.length > 0) {
+            return this.searchState.savedItems;
+        }
+        return undefined;
+    }
+    /** Get current min distance */
+    getCurrentDistance() {
+        const d = this.searchState.minValue;
+        return d === undefined ? Number.MAX_VALUE : d;
+    }
+    /** Compute and test the closest approach between two facets, given their indices. */
+    processAppDataPair(indexA, indexB) {
+        this.contextA.visitor.setNumWrap(1); // closed polygons are more efficient for PolygonOps.closestApproach
+        this.contextB.visitor.setNumWrap(1);
+        if (this.contextA.visitor.moveToReadIndex(indexA) && this.contextB.visitor.moveToReadIndex(indexB)) {
+            // ASSUME: not worth sending in maxDist here...
+            const pldPair = PolygonOps.closestApproach(this.contextA.visitor.point, this.contextB.visitor.point, undefined, this.searchFacetInterior);
+            this.contextA.numFacetTest++;
+            if (pldPair && this.searchState.isNewMinOrTrigger(pldPair.detailA.a)) {
+                const edgeCountA = this.contextA.visitor.pointCount - 1;
+                const edgeCountB = this.contextB.visitor.pointCount - 1;
+                const fldPair = FacetLocationDetailPair.create(this.contextA.convexFacets ? ConvexFacetLocationDetail.createCapture(indexA, edgeCountA, pldPair.detailA) : NonConvexFacetLocationDetail.createCapture(indexA, edgeCountA, pldPair.detailA), this.contextB.convexFacets ? ConvexFacetLocationDetail.createCapture(indexB, edgeCountB, pldPair.detailB) : NonConvexFacetLocationDetail.createCapture(indexB, edgeCountB, pldPair.detailB));
+                this.searchState.testAndSave(fldPair, fldPair.detailA.a);
+            }
+        }
+    }
+}
+//# sourceMappingURL=RangeTreeSearchHandlers.js.map

package/lib/esm/polyface/RangeTree/RangeTreeSearchHandlers.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"RangeTreeSearchHandlers.js","sourceRoot":"","sources":["../../../../src/polyface/RangeTree/RangeTreeSearchHandlers.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH,OAAO,EAAE,mBAAmB,EAAE,uBAAuB,EAAE,MAAM,iCAAiC,CAAC;AAC/F,OAAO,EAAE,aAAa,EAAE,MAAM,2BAA2B,CAAC;AAC1D,OAAO,EAAE,YAAY,EAAE,MAAM,0BAA0B,CAAC;AAExD,OAAO,EAAyB,UAAU,EAAE,MAAM,6BAA6B,CAAC;AAEhF,OAAO,EAAE,yBAAyB,EAAuB,uBAAuB,EAAE,4BAA4B,EAAE,MAAM,wBAAwB,CAAC;AAE/I,OAAO,EAAE,kBAAkB,EAAE,MAAM,sBAAsB,CAAC;AAG1D,OAAO,EAAE,uBAAuB,EAAE,wCAAwC,EAAE,MAAM,iBAAiB,CAAC;AAEpG;;;;GAIG;AACH,MAAM,OAAO,6CAA8C,SAAQ,uBAA+B;IAQhG;;;;;OAKG;IACH,YAAmB,UAAmB,EAAE,OAAqC,EAAE,OAAgB;QAC7F,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,OAAO,KAAK,SAAS,IAAI,OAAO,GAAG,CAAC;YACtC,OAAO,GAAG,SAAS,CAAC;QACtB,IAAI,CAAC,WAAW,GAAG,kBAAkB,CAAC,MAAM,CAAS,OAAO,CAAC,CAAC;QAC9D,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC,KAAK,EAAE,CAAC;IACvC,CAAC;IACD,uCAAuC;IAChC,SAAS;QACd,IAAI,IAAI,CAAC,WAAW,CAAC,QAAQ,KAAK,SAAS,IAAI,IAAI,CAAC,WAAW,CAAC,cAAc,KAAK,SAAS,EAAE;YAC5F,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC;YAC/C,MAAM,GAAG,GAAG,mBAAmB,CAAC,wBAAwB,CAAC,SAAS,EAAE,MAAM,EAAE,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;YACzG,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC;YAClC,OAAO,GAAG,CAAC;SACZ;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,0DAA0D;IACnD,aAAa;QAClB,IAAI,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC;YAC1C,OAAO,SAAS,CAAC;QACnB,MAAM,QAAQ,GAA0B,EAAE,CAAC;QAC3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,MAAM,EAAE,EAAE,CAAC,EAAE;YAC3D,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YAC9C,MAAM,GAAG,GAAG,mBAAmB,CAAC,wBAAwB,CAAC,SAAS,EAAE,MAAM,EAAE,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;YACzG,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;YACxC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;SACpB;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IACD;;;;OAIG;IACa,aAAa,CAAC,KAAc;QAC1C,MAAM,IAAI,GAAG,KAAK,CAAC,eAAe,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACpD,IAAI,IAAI,CAAC,WAAW,CAAC,aAAa,CAAC,IAAI,CAAC,EAAE;YACxC,IAAI,CAAC,OAAO,CAAC,gBAAgB,EAAE,CAAC;YAChC,OAAO,IAAI,CAAC;SACb;QACD,IAAI,CAAC,OAAO,CAAC,iBAAiB,EAAE,CAAC;QACjC,OAAO,KAAK,CAAC;IACf,CAAC;IACD,wEAAwE;IACxD,cAAc,CAAC,cAAsB;QACnD,MAAM,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,cAAc,CAAC,CAAC,CAAC;QACxE,IAAI,CAAC,OAAO,CAAC,YAAY,EAAE,CAAC;QAC5B,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC;IAClD,CAAC;CACF;AAED;;;;GAIG;AACH,MAAM,OAAO,4DAA6D,SAAQ,wCAAgD;IAQhI;;;;;OAKG;IACH,YAAmB,QAAsC,EAAE,QAAsC,EAAE,OAAgB;QACjH,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,OAAO,KAAK,SAAS,IAAI,OAAO,GAAG,CAAC;YACtC,OAAO,GAAG,SAAS,CAAC;QACtB,IAAI,CAAC,WAAW,GAAG,kBAAkB,CAAC,MAAM,CAA0B,OAAO,CAAC,CAAC;IACjF,CAAC;IACD,0CAA0C;IACnC,SAAS;QACd,IAAI,IAAI,CAAC,WAAW,CAAC,QAAQ,KAAK,SAAS,EAAE;YAC3C,OAAO,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC;SACxC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,4DAA4D;IACrD,aAAa;QAClB,IAAI,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE;YAC1C,OAAO,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC;SACpC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,+BAA+B;IACf,kBAAkB;QAChC,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC;QACpC,OAAO,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;IAChD,CAAC;IACD,6EAA6E;IAC7D,kBAAkB,CAAC,MAAc,EAAE,MAAc;QAC/D,IAAI,CAAC,QAAQ,CAAC,YAAY,EAAE,CAAC;QAC7B,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC5C,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC5C,MAAM,CAAC,GAAG,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QAClC,IAAI,IAAI,CAAC,WAAW,CAAC,iBAAiB,CAAC,CAAC,CAAC,EAAE;YACzC,MAAM,OAAO,GAAG,uBAAuB,CAAC,aAAa,CACnD,mBAAmB,CAAC,wBAAwB,CAAC,SAAS,EAAE,MAAM,EAAE,MAAM,CAAC,EACvE,mBAAmB,CAAC,wBAAwB,CAAC,SAAS,EAAE,MAAM,EAAE,MAAM,CAAC,CACxE,CAAC;YACF,OAAO,CAAC,OAAO,CAAC,CAAC,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC;YAC1C,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;SAC1C;IACH,CAAC;CACF;AAED;;;;GAIG;AACH,MAAM,OAAO,oDAAqD,SAAQ,uBAA+B;IAQvG;;;;;OAKG;IACH,YAAmB,UAAmB,EAAE,OAAqC,EAAE,OAAgB;QAC7F,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,OAAO,KAAK,SAAS,IAAI,OAAO,GAAG,CAAC;YACtC,OAAO,GAAG,SAAS,CAAC;QACtB,IAAI,CAAC,WAAW,GAAG,kBAAkB,CAAC,MAAM,CAAsB,OAAO,CAAC,CAAC;QAC3E,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC,KAAK,EAAE,CAAC;IACvC,CAAC;IACD,uCAAuC;IAChC,SAAS;QACd,IAAI,IAAI,CAAC,WAAW,CAAC,QAAQ,KAAK,SAAS,IAAI,IAAI,CAAC,WAAW,CAAC,cAAc,KAAK,SAAS,EAAE;YAC5F,OAAO,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC;SACxC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,0DAA0D;IACnD,aAAa;QAClB,IAAI,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE;YAC1C,OAAO,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC;SACpC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;OAIG;IACa,aAAa,CAAC,KAAc;QAC1C,MAAM,IAAI,GAAG,KAAK,CAAC,eAAe,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACpD,IAAI,IAAI,CAAC,WAAW,CAAC,aAAa,CAAC,IAAI,CAAC,EAAE;YACxC,IAAI,CAAC,OAAO,CAAC,gBAAgB,EAAE,CAAC;YAChC,OAAO,IAAI,CAAC;SACb;QACD,IAAI,CAAC,OAAO,CAAC,iBAAiB,EAAE,CAAC;QACjC,OAAO,KAAK,CAAC;IACf,CAAC;IAED,0EAA0E;IAC1D,cAAc,CAAC,cAAsB;QACnD,MAAM,OAAO,GAAG,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,iBAAiB,CAAC,cAAc,EAAE,IAAI,CAAC,YAAY,CAAE,CAAC;QAClH,IAAI,OAAO,EAAE;YACX,MAAM,GAAG,GAAG,OAAO,CAAC,YAAY,CAAC,IAAI,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;YACzD,YAAY,CAAC,0BAA0B,CAAC,GAAG,EAAE,cAAc,EAAE,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,QAAQ,EAAE,EAAE,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;YAC1H,IAAI,CAAC,OAAO,CAAC,YAAY,EAAE,CAAC;YAC5B,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;SAC1C;IACH,CAAC;CACF;AAED;;;;GAIG;AACH,MAAM,OAAO,4DAA6D,SAAQ,wCAAgD;IAQhI;;;;;OAKG;IACH,YAAmB,QAAsC,EAAE,QAAsC,EAAE,OAAgB;QACjH,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,OAAO,KAAK,SAAS,IAAI,OAAO,GAAG,CAAC;YACtC,OAAO,GAAG,SAAS,CAAC;QACtB,IAAI,CAAC,WAAW,GAAG,kBAAkB,CAAC,MAAM,CAA0B,OAAO,CAAC,CAAC;IACjF,CAAC;IACD;;;OAGG;IACI,SAAS;QACd,IAAI,IAAI,CAAC,WAAW,CAAC,QAAQ,KAAK,SAAS,EAAE;YAC3C,OAAO,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC;SACxC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,4DAA4D;IACrD,aAAa;QAClB,IAAI,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE;YAC1C,OAAO,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC;SACpC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,+BAA+B;IACf,kBAAkB;QAChC,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC;QACpC,OAAO,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;IAChD,CAAC;IAGD,uFAAuF;IACvE,kBAAkB,CAAC,MAAc,EAAE,MAAc;QAC/D,IAAI,CAAC,QAAQ,CAAC,YAAY,EAAE,CAAC;QAC7B,MAAM,IAAI,GAAG,4DAA4D,CAAC,aAAa;YACrF,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,iBAAiB,CAAC,MAAM,EAAE,4DAA4D,CAAC,aAAa,CAAE,CAAC;QAClI,MAAM,IAAI,GAAG,4DAA4D,CAAC,aAAa;YACrF,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,iBAAiB,CAAC,MAAM,EAAE,4DAA4D,CAAC,aAAa,CAAE,CAAC;QAClI,MAAM,OAAO,GAAG,aAAa,CAAC,eAAe,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;QACxE,IAAI,OAAO,IAAI,IAAI,CAAC,WAAW,CAAC,iBAAiB,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;YACpE,YAAY,CAAC,0BAA0B,CAAC,OAAO,CAAC,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,QAAQ,EAAE,EAAE,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;YAChI,YAAY,CAAC,0BAA0B,CAAC,OAAO,CAAC,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,QAAQ,EAAE,EAAE,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;YAChI,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC,OAAO,EAAE,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;SAC1D;IACH,CAAC;CACF;AAED;;;;GAIG;AACH,MAAM,OAAO,gDAAiD,SAAQ,uBAA+B;IAUnG;;;;;;OAMG;IACH,YAAmB,UAAmB,EAAE,OAAiC,EAAE,OAAgB,EAAE,sBAA+B,KAAK;QAC/H,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,OAAO,KAAK,SAAS,IAAI,OAAO,GAAG,CAAC;YACtC,OAAO,GAAG,SAAS,CAAC;QACtB,IAAI,CAAC,WAAW,GAAG,kBAAkB,CAAC,MAAM,CAAsB,OAAO,CAAC,CAAC;QAC3E,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC,KAAK,EAAE,CAAC;QACrC,IAAI,CAAC,mBAAmB,GAAG,mBAAmB,CAAC;IACjD,CAAC;IACD,uCAAuC;IAChC,SAAS;QACd,IAAI,IAAI,CAAC,WAAW,CAAC,QAAQ,KAAK,SAAS,IAAI,IAAI,CAAC,WAAW,CAAC,cAAc,KAAK,SAAS,EAAE;YAC5F,OAAO,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC;SACxC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,0DAA0D;IACnD,aAAa;QAClB,IAAI,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE;YAC1C,OAAO,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC;SACpC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;OAIG;IACa,aAAa,CAAC,KAAc;QAC1C,MAAM,IAAI,GAAG,KAAK,CAAC,eAAe,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACpD,IAAI,IAAI,CAAC,WAAW,CAAC,aAAa,CAAC,IAAI,CAAC,EAAE;YACxC,IAAI,CAAC,OAAO,CAAC,gBAAgB,EAAE,CAAC;YAChC,OAAO,IAAI,CAAC;SACb;QACD,IAAI,CAAC,OAAO,CAAC,iBAAiB,EAAE,CAAC;QACjC,OAAO,KAAK,CAAC;IACf,CAAC;IACD,wEAAwE;IACxD,cAAc,CAAC,cAAsB;QACnD,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,sFAAsF;QAC1H,IAAI,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,eAAe,CAAC,cAAc,CAAC,EAAE;YACxD,IAAI,GAAsC,CAAC;YAC3C,IAAI,IAAI,CAAC,mBAAmB;gBAC1B,GAAG,GAAG,UAAU,CAAC,YAAY,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;;gBAE3E,GAAG,GAAG,UAAU,CAAC,sBAAsB,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;YACvF,IAAI,CAAC,OAAO,CAAC,YAAY,EAAE,CAAC;YAC5B,IAAI,GAAG,IAAI,IAAI,CAAC,WAAW,CAAC,iBAAiB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;gBACpD,MAAM,SAAS,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,UAAU,CAAC;gBAClD,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,YAAY;oBACnC,CAAC,CAAC,yBAAyB,CAAC,aAAa,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,gBAAgB,EAAE,EAAE,SAAS,EAAE,GAAG,CAAC;oBAClG,CAAC,CAAC,4BAA4B,CAAC,aAAa,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,gBAAgB,EAAE,EAAE,SAAS,EAAE,GAAG,CAAC,CAAC;gBACxG,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;aAC1C;SACF;IACH,CAAC;CACF;AACD;;;;GAIG;AACH,MAAM,OAAO,8CAA+C,SAAQ,wCAAgD;IAUlH;;;;;MAKE;IACF,YAAmB,QAAkC,EAAE,QAAkC,EAAE,OAAgB,EAAE,sBAA+B,KAAK;QAC/I,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,OAAO,KAAK,SAAS,IAAI,OAAO,GAAG,CAAC;YACtC,OAAO,GAAG,SAAS,CAAC;QACtB,IAAI,CAAC,WAAW,GAAG,kBAAkB,CAAC,MAAM,CAA0B,OAAO,CAAC,CAAC;QAC/E,IAAI,CAAC,mBAAmB,GAAG,mBAAmB,IAAI,QAAQ,CAAC,YAAY,IAAI,QAAQ,CAAC,YAAY,CAAC;IACnG,CAAC;IACD,8CAA8C;IACvC,SAAS;QACd,IAAI,IAAI,CAAC,WAAW,CAAC,QAAQ,KAAK,SAAS,EAAE;YAC3C,OAAO,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC;SACxC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,4DAA4D;IACrD,aAAa;QAClB,IAAI,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE;YAC1C,OAAO,IAAI,CAAC,WAAW,CAAC,UAAU,CAAC;SACpC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,+BAA+B;IACf,kBAAkB;QAChC,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC;QACpC,OAAO,CAAC,KAAK,SAAS,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;IAChD,CAAC;IACD,qFAAqF;IACrE,kBAAkB,CAAC,MAAc,EAAE,MAAc;QAC/D,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAE,oEAAoE;QAC1G,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;QACpC,IAAI,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,eAAe,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,eAAe,CAAC,MAAM,CAAC,EAAE;YAClG,+CAA+C;YAC/C,MAAM,OAAO,GAAG,UAAU,CAAC,eAAe,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,KAAK,EAAE,SAAS,EAAE,IAAI,CAAC,mBAAmB,CAAC,CAAC;YAC1I,IAAI,CAAC,QAAQ,CAAC,YAAY,EAAE,CAAC;YAC7B,IAAI,OAAO,IAAI,IAAI,CAAC,WAAW,CAAC,iBAAiB,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;gBACpE,MAAM,UAAU,GAAG,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,UAAU,GAAG,CAAC,CAAC;gBACxD,MAAM,UAAU,GAAG,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,UAAU,GAAG,CAAC,CAAC;gBACxD,MAAM,OAAO,GAAG,uBAAuB,CAAC,MAAM,CAC5C,IAAI,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC,CAAC,yBAAyB,CAAC,aAAa,CAAC,MAAM,EAAE,UAAU,EAAE,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,4BAA4B,CAAC,aAAa,CAAC,MAAM,EAAE,UAAU,EAAE,OAAO,CAAC,OAAO,CAAC,EAC3L,IAAI,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC,CAAC,yBAAyB,CAAC,aAAa,CAAC,MAAM,EAAE,UAAU,EAAE,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,4BAA4B,CAAC,aAAa,CAAC,MAAM,EAAE,UAAU,EAAE,OAAO,CAAC,OAAO,CAAC,CAC5L,CAAC;gBACF,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC,OAAO,EAAE,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;aAC1D;SACF;IACH,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/** @packageDocumentation\n * @module RangeSearch\n */\n\nimport { CurveLocationDetail, CurveLocationDetailPair } from \"../../curve/CurveLocationDetail\";\nimport { LineSegment3d } from \"../../curve/LineSegment3d\";\nimport { LineString3d } from \"../../curve/LineString3d\";\nimport { Point3d } from \"../../geometry3d/Point3dVector3d\";\nimport { PolygonLocationDetail, PolygonOps } from \"../../geometry3d/PolygonOps\";\nimport { Range3d } from \"../../geometry3d/Range\";\nimport { ConvexFacetLocationDetail, FacetLocationDetail, FacetLocationDetailPair, NonConvexFacetLocationDetail } from \"../FacetLocationDetail\";\nimport { LineString3dRangeTreeContext } from \"./LineString3dRangeTreeContext\";\nimport { MinimumValueTester } from \"./MinimumValueTester\";\nimport { Point3dArrayRangeTreeContext } from \"./Point3dArrayRangeTreeContext\";\nimport { PolyfaceRangeTreeContext } from \"./PolyfaceRangeTreeContext\";\nimport { SingleTreeSearchHandler, TwoTreeDistanceMinimizationSearchHandler } from \"./RangeTreeNode\";\n\n/**\n * Helper class for searching for the closest point in a set of points.\n * * Future optimization: avoid sqrt by using squared distance throughout (would require refactoring CurveLocationDetail).\n * @internal\n */\nexport class SingleTreeSearchHandlerForClosestPointInArray extends SingleTreeSearchHandler<number> {\n  /** The calling context */\n  public context: Point3dArrayRangeTreeContext;\n  /** Evolving search state */\n  public searchState: MinimumValueTester<number>;\n  /** Space point for the search  */\n  public spacePoint: Point3d;\n\n  /**\n   * Constructor\n   * @param spacePoint cloned\n   * @param context captured\n   * @param maxDist collect points at no more than this distance from spacePoint\n   */\n  public constructor(spacePoint: Point3d, context: Point3dArrayRangeTreeContext, maxDist?: number) {\n    super();\n    this.context = context;\n    if (maxDist !== undefined && maxDist < 0)\n      maxDist = undefined;\n    this.searchState = MinimumValueTester.create<number>(maxDist);\n    this.spacePoint = spacePoint.clone();\n  }\n  /** Return the current closest point */\n  public getResult(): CurveLocationDetail | undefined {\n    if (this.searchState.minValue !== undefined && this.searchState.itemAtMinValue !== undefined) {\n      const iPoint = this.searchState.itemAtMinValue;\n      const cld = CurveLocationDetail.createCurveFractionPoint(undefined, iPoint, this.context.points[iPoint]);\n      cld.a = this.searchState.minValue;\n      return cld;\n    }\n    return undefined;\n  }\n  /** Return the collected closest points (if collecting) */\n  public getSavedItems(): CurveLocationDetail[] | undefined {\n    if (this.searchState.savedItems.length === 0)\n      return undefined;\n    const cldArray: CurveLocationDetail[] = [];\n    for (let i = 0; i < this.searchState.savedItems.length; ++i) {\n      const iPoint = this.searchState.savedItems[i];\n      const cld = CurveLocationDetail.createCurveFractionPoint(undefined, iPoint, this.context.points[iPoint]);\n      cld.a = this.searchState.savedValues[i];\n      cldArray.push(cld);\n    }\n    return cldArray;\n  }\n  /**\n   * Return true if appData within the range should be offered to `processAppData`.\n   * @param range range containing items to be tested.\n   * @returns true if the spacePoint is within the range or close enough that a point in the range could be the closest.\n   */\n  public override isRangeActive(range: Range3d): boolean {\n    const dMin = range.distanceToPoint(this.spacePoint);\n    if (this.searchState.isNewMinValue(dMin)) {\n      this.context.numRangeTestTrue++;\n      return true;\n    }\n    this.context.numRangeTestFalse++;\n    return false;\n  }\n  /** Test a point indexed in the range tree as candidate for \"closest\" */\n  public override processAppData(candidateIndex: number): void {\n    const d = this.spacePoint.distance(this.context.points[candidateIndex]);\n    this.context.numPointTest++;\n    this.searchState.testAndSave(candidateIndex, d);\n  }\n}\n\n/**\n * Helper class for searching for the closest approach between sets of points.\n * * Future optimization: avoid sqrt by using squared distance throughout (would require refactoring CurveLocationDetail).\n * @internal\n */\nexport class TwoTreeSearchHandlerForPoint3dArrayPoint3dArrayCloseApproach extends TwoTreeDistanceMinimizationSearchHandler<number> {\n  /** Context for first set of points */\n  public contextA: Point3dArrayRangeTreeContext;\n  /** Context for second set of points */\n  public contextB: Point3dArrayRangeTreeContext;\n  /** Search state with current min distance point pair */\n  public searchState: MinimumValueTester<CurveLocationDetailPair>;\n\n  /**\n   * Constructor\n   * @param contextA captured\n   * @param contextB captured\n   * @param maxDist collect points at no more than this separation distance\n   */\n  public constructor(contextA: Point3dArrayRangeTreeContext, contextB: Point3dArrayRangeTreeContext, maxDist?: number) {\n    super();\n    this.contextA = contextA;\n    this.contextB = contextB;\n    if (maxDist !== undefined && maxDist < 0)\n      maxDist = undefined;\n    this.searchState = MinimumValueTester.create<CurveLocationDetailPair>(maxDist);\n  }\n  /** Return the current closest approach */\n  public getResult(): CurveLocationDetailPair | undefined {\n    if (this.searchState.minValue !== undefined) {\n      return this.searchState.itemAtMinValue;\n    }\n    return undefined;\n  }\n  /** Return the collected close approaches (if collecting) */\n  public getSavedItems(): CurveLocationDetailPair[] | undefined {\n    if (this.searchState.savedItems.length > 0) {\n      return this.searchState.savedItems;\n    }\n    return undefined;\n  }\n  /** Get current min distance */\n  public override getCurrentDistance(): number {\n    const d = this.searchState.minValue;\n    return d === undefined ? Number.MAX_VALUE : d;\n  }\n  /** Compute and test the distance between two points, given their indices. */\n  public override processAppDataPair(indexA: number, indexB: number): void {\n    this.contextA.numPointTest++;\n    const pointA = this.contextA.points[indexA];\n    const pointB = this.contextB.points[indexB];\n    const d = pointA.distance(pointB);\n    if (this.searchState.isNewMinOrTrigger(d)) {\n      const cldPair = CurveLocationDetailPair.createCapture(\n        CurveLocationDetail.createCurveFractionPoint(undefined, indexA, pointA),\n        CurveLocationDetail.createCurveFractionPoint(undefined, indexB, pointB),\n      );\n      cldPair.detailA.a = cldPair.detailB.a = d;\n      this.searchState.testAndSave(cldPair, d);\n    }\n  }\n}\n\n/**\n * Helper class for searching for the closest point in a linestring.\n * * Future optimization: avoid sqrt by using squared distance throughout (would require refactoring CurveLocationDetail).\n * @internal\n */\nexport class SingleTreeSearchHandlerForClosestPointOnLineString3d extends SingleTreeSearchHandler<number> {\n  /** The calling context */\n  public context: LineString3dRangeTreeContext;\n  /** Evolving search state */\n  public searchState: MinimumValueTester<CurveLocationDetail>;\n  /** Space point for the search */\n  public spacePoint: Point3d;\n\n  /**\n   * Constructor\n   * @param spacePoint cloned\n   * @param context captured\n   * @param maxDist collect points at no more than this distance from spacePoint\n   */\n  public constructor(spacePoint: Point3d, context: LineString3dRangeTreeContext, maxDist?: number) {\n    super();\n    this.context = context;\n    if (maxDist !== undefined && maxDist < 0)\n      maxDist = undefined;\n    this.searchState = MinimumValueTester.create<CurveLocationDetail>(maxDist);\n    this.spacePoint = spacePoint.clone();\n  }\n  /** Return the current closest point */\n  public getResult(): CurveLocationDetail | undefined {\n    if (this.searchState.minValue !== undefined && this.searchState.itemAtMinValue !== undefined) {\n      return this.searchState.itemAtMinValue;\n    }\n    return undefined;\n  }\n  /** Return the collected closest points (if collecting) */\n  public getSavedItems(): CurveLocationDetail[] | undefined {\n    if (this.searchState.savedItems.length > 0) {\n      return this.searchState.savedItems;\n    }\n    return undefined;\n  }\n  /**\n   * Return true if appData within the range should be offered to `processAppData`.\n   * @param range range containing items to be tested.\n   * @returns true if the spacePoint is within the range or close enough that a point in the range could be the closest.\n   */\n  public override isRangeActive(range: Range3d): boolean {\n    const dMin = range.distanceToPoint(this.spacePoint);\n    if (this.searchState.isNewMinValue(dMin)) {\n      this.context.numRangeTestTrue++;\n      return true;\n    }\n    this.context.numRangeTestFalse++;\n    return false;\n  }\n  private _workSegment?: LineSegment3d;\n  /** Test a segment indexed in the range tree as candidate for \"closest\" */\n  public override processAppData(candidateIndex: number): void {\n    const segment = this._workSegment = this.context.lineString.getIndexedSegment(candidateIndex, this._workSegment)!;\n    if (segment) {\n      const cld = segment.closestPoint(this.spacePoint, false);\n      LineString3d.convertLocalToGlobalDetail(cld, candidateIndex, this.context.lineString.numEdges(), this.context.lineString);\n      this.context.numPointTest++;\n      this.searchState.testAndSave(cld, cld.a);\n    }\n  }\n}\n\n/**\n * Helper class for searching for the closest approach between linestrings.\n * * Future optimization: avoid sqrt by using squared distance throughout (would require refactoring CurveLocationDetail).\n * @internal\n */\nexport class TwoTreeSearchHandlerForLineString3dLineString3dCloseApproach extends TwoTreeDistanceMinimizationSearchHandler<number> {\n  /** Context for first polyline */\n  public contextA: LineString3dRangeTreeContext;\n  /** Context for second polyline */\n  public contextB: LineString3dRangeTreeContext;\n  /** Search state with current min distance point pair */\n  public searchState: MinimumValueTester<CurveLocationDetailPair>;\n\n  /**\n   * Constructor\n   * @param contextA captured\n   * @param contextB captured\n   * @param maxDist collect points at no more than this separation distance\n   */\n  public constructor(contextA: LineString3dRangeTreeContext, contextB: LineString3dRangeTreeContext, maxDist?: number) {\n    super();\n    this.contextA = contextA;\n    this.contextB = contextB;\n    if (maxDist !== undefined && maxDist < 0)\n      maxDist = undefined;\n    this.searchState = MinimumValueTester.create<CurveLocationDetailPair>(maxDist);\n  }\n  /**\n   * Return the current closest approach.\n   * * Details contain linestring *and* segment data, cf. [[LineString3d.convertLocalToGlobalDetail]]\n   */\n  public getResult(): CurveLocationDetailPair | undefined {\n    if (this.searchState.minValue !== undefined) {\n      return this.searchState.itemAtMinValue;\n    }\n    return undefined;\n  }\n  /** Return the collected close approaches (if collecting) */\n  public getSavedItems(): CurveLocationDetailPair[] | undefined {\n    if (this.searchState.savedItems.length > 0) {\n      return this.searchState.savedItems;\n    }\n    return undefined;\n  }\n  /** Get current min distance */\n  public override getCurrentDistance(): number {\n    const d = this.searchState.minValue;\n    return d === undefined ? Number.MAX_VALUE : d;\n  }\n  private static _workSegmentA?: LineSegment3d;\n  private static _workSegmentB?: LineSegment3d;\n  /** Compute and test the closest approach between two segments, given their indices. */\n  public override processAppDataPair(indexA: number, indexB: number): void {\n    this.contextA.numPointTest++;\n    const segA = TwoTreeSearchHandlerForLineString3dLineString3dCloseApproach._workSegmentA =\n      this.contextA.lineString.getIndexedSegment(indexA, TwoTreeSearchHandlerForLineString3dLineString3dCloseApproach._workSegmentA)!;\n    const segB = TwoTreeSearchHandlerForLineString3dLineString3dCloseApproach._workSegmentB =\n      this.contextB.lineString.getIndexedSegment(indexB, TwoTreeSearchHandlerForLineString3dLineString3dCloseApproach._workSegmentB)!;\n    const cldPair = LineSegment3d.closestApproach(segA, false, segB, false);\n    if (cldPair && this.searchState.isNewMinOrTrigger(cldPair.detailA.a)) {\n      LineString3d.convertLocalToGlobalDetail(cldPair.detailA, indexA, this.contextA.lineString.numEdges(), this.contextA.lineString);\n      LineString3d.convertLocalToGlobalDetail(cldPair.detailB, indexB, this.contextB.lineString.numEdges(), this.contextB.lineString);\n      this.searchState.testAndSave(cldPair, cldPair.detailA.a);\n    }\n  }\n}\n\n/**\n * Helper class for searching for the closest point in a polyface.\n * * Future optimization: avoid sqrt by using squared distance throughout (would require refactoring FacetLocationDetail).\n * @internal\n */\nexport class SingleTreeSearchHandlerForClosestPointOnPolyface extends SingleTreeSearchHandler<number> {\n  /** The calling context */\n  public context: PolyfaceRangeTreeContext;\n  /** Evolving search state */\n  public searchState: MinimumValueTester<FacetLocationDetail>;\n  /** Space point for the search */\n  public spacePoint: Point3d;\n  /** Whether to include facet interior in search */\n  public searchFacetInterior: boolean;\n\n  /**\n   * Constructor\n   * @param spacePoint cloned\n   * @param context captured\n   * @param maxDist collect points at no more than this distance from spacePoint\n   * @param searchFacetInterior true: search facet interior + boundary; false: just boundary\n   */\n  public constructor(spacePoint: Point3d, context: PolyfaceRangeTreeContext, maxDist?: number, searchFacetInterior: boolean = false) {\n    super();\n    this.context = context;\n    if (maxDist !== undefined && maxDist < 0)\n      maxDist = undefined;\n    this.searchState = MinimumValueTester.create<FacetLocationDetail>(maxDist);\n    this.spacePoint = spacePoint.clone();\n    this.searchFacetInterior = searchFacetInterior;\n  }\n  /** Return the current closest point */\n  public getResult(): FacetLocationDetail | undefined {\n    if (this.searchState.minValue !== undefined && this.searchState.itemAtMinValue !== undefined) {\n      return this.searchState.itemAtMinValue;\n    }\n    return undefined;\n  }\n  /** Return the collected closest points (if collecting) */\n  public getSavedItems(): FacetLocationDetail[] | undefined {\n    if (this.searchState.savedItems.length > 0) {\n      return this.searchState.savedItems;\n    }\n    return undefined;\n  }\n  /**\n   * Return true if appData within the range should be offered to `processAppData`.\n   * @param range range containing items to be tested.\n   * @returns true if the spacePoint is within the range or close enough that a point in the range could be the closest.\n   */\n  public override isRangeActive(range: Range3d): boolean {\n    const dMin = range.distanceToPoint(this.spacePoint);\n    if (this.searchState.isNewMinValue(dMin)) {\n      this.context.numRangeTestTrue++;\n      return true;\n    }\n    this.context.numRangeTestFalse++;\n    return false;\n  }\n  /** Test a facet indexed in the range tree as candidate for \"closest\" */\n  public override processAppData(candidateIndex: number): void {\n    this.context.visitor.setNumWrap(0); // so edgeCount === pointCount; closure point unnecessary for closestPoint[OnBoundary]\n    if (this.context.visitor.moveToReadIndex(candidateIndex)) {\n      let pld: PolygonLocationDetail | undefined;\n      if (this.searchFacetInterior)\n        pld = PolygonOps.closestPoint(this.context.visitor.point, this.spacePoint);\n      else\n        pld = PolygonOps.closestPointOnBoundary(this.context.visitor.point, this.spacePoint);\n      this.context.numFacetTest++;\n      if (pld && this.searchState.isNewMinOrTrigger(pld.a)) {\n        const edgeCount = this.context.visitor.pointCount;\n        const fld = this.context.convexFacets\n          ? ConvexFacetLocationDetail.createCapture(this.context.visitor.currentReadIndex(), edgeCount, pld)\n          : NonConvexFacetLocationDetail.createCapture(this.context.visitor.currentReadIndex(), edgeCount, pld);\n        this.searchState.testAndSave(fld, pld.a);\n      }\n    }\n  }\n}\n/**\n * Helper class for searching for the closest approach between polyfaces.\n * * Future optimization: avoid sqrt by using squared distance throughout (would require refactoring FacetLocationDetail).\n * @internal\n */\nexport class TwoTreeSearchHandlerForFacetFacetCloseApproach extends TwoTreeDistanceMinimizationSearchHandler<number> {\n  /** Context for first polyface */\n  public contextA: PolyfaceRangeTreeContext;\n  /** Context for second polyface */\n  public contextB: PolyfaceRangeTreeContext;\n  /** Search state with current min distance and facet pair */\n  public searchState: MinimumValueTester<FacetLocationDetailPair>;\n  /** Whether to include facet interior in search */\n  public searchFacetInterior: boolean;\n\n  /** Constructor\n   * @param contextA captured\n   * @param contextB captured\n   * @param maxDist collect points at no more than this separation distance\n   * @param searchFacetInterior true: search facet interior + boundary; false: just boundary\n  */\n  public constructor(contextA: PolyfaceRangeTreeContext, contextB: PolyfaceRangeTreeContext, maxDist?: number, searchFacetInterior: boolean = false) {\n    super();\n    this.contextA = contextA;\n    this.contextB = contextB;\n    if (maxDist !== undefined && maxDist < 0)\n      maxDist = undefined;\n    this.searchState = MinimumValueTester.create<FacetLocationDetailPair>(maxDist);\n    this.searchFacetInterior = searchFacetInterior && contextA.convexFacets && contextB.convexFacets;\n  }\n  /** Return the facets with closest approach */\n  public getResult(): FacetLocationDetailPair | undefined {\n    if (this.searchState.minValue !== undefined) {\n      return this.searchState.itemAtMinValue;\n    }\n    return undefined;\n  }\n  /** Return the collected close approaches (if collecting) */\n  public getSavedItems(): FacetLocationDetailPair[] | undefined {\n    if (this.searchState.savedItems.length > 0) {\n      return this.searchState.savedItems;\n    }\n    return undefined;\n  }\n  /** Get current min distance */\n  public override getCurrentDistance(): number {\n    const d = this.searchState.minValue;\n    return d === undefined ? Number.MAX_VALUE : d;\n  }\n  /** Compute and test the closest approach between two facets, given their indices. */\n  public override processAppDataPair(indexA: number, indexB: number): void {\n    this.contextA.visitor.setNumWrap(1);  // closed polygons are more efficient for PolygonOps.closestApproach\n    this.contextB.visitor.setNumWrap(1);\n    if (this.contextA.visitor.moveToReadIndex(indexA) && this.contextB.visitor.moveToReadIndex(indexB)) {\n      // ASSUME: not worth sending in maxDist here...\n      const pldPair = PolygonOps.closestApproach(this.contextA.visitor.point, this.contextB.visitor.point, undefined, this.searchFacetInterior);\n      this.contextA.numFacetTest++;\n      if (pldPair && this.searchState.isNewMinOrTrigger(pldPair.detailA.a)) {\n        const edgeCountA = this.contextA.visitor.pointCount - 1;\n        const edgeCountB = this.contextB.visitor.pointCount - 1;\n        const fldPair = FacetLocationDetailPair.create(\n          this.contextA.convexFacets ? ConvexFacetLocationDetail.createCapture(indexA, edgeCountA, pldPair.detailA) : NonConvexFacetLocationDetail.createCapture(indexA, edgeCountA, pldPair.detailA),\n          this.contextB.convexFacets ? ConvexFacetLocationDetail.createCapture(indexB, edgeCountB, pldPair.detailB) : NonConvexFacetLocationDetail.createCapture(indexB, edgeCountB, pldPair.detailB),\n        );\n        this.searchState.testAndSave(fldPair, fldPair.detailA.a);\n      }\n    }\n  }\n}\n\n"]}