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

package/lib/esm/polyface/RangeLengthData.js.map

@@ -1 +1 @@
-{"version":3,"file":"RangeLengthData.js","sourceRoot":"","sources":["../../../src/polyface/RangeLengthData.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAGH,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AAC9C,OAAO,EAAE,SAAS,EAAE,MAAM,uBAAuB,CAAC;AAElD;;;;;;;;;;;GAWG;AACH,MAAM,OAAO,eAAe;IAO1B;QACE,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;QAClC,IAAI,CAAC,KAAK,GAAG,IAAI,SAAS,EAAE,CAAC;QAC7B,IAAI,CAAC,KAAK,GAAG,IAAI,SAAS,EAAE,CAAC;QAC7B,IAAI,CAAC,KAAK,GAAG,IAAI,SAAS,EAAE,CAAC;QAC7B,IAAI,CAAC,UAAU,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;IACzC,CAAC;IAED,2EAA2E;IACpE,+BAA+B,CAAC,MAAwB;QAC7D,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACjC,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACxC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,CAAC,CAAC;QACjD,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,CAAC,CAAC;QACjD,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,CAAC,CAAC;IACnD,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @packageDocumentation\r\n * @module RangeSearch\r\n */\r\n\r\nimport { GrowableXYZArray } from \"../geometry3d/GrowableXYZArray\";\r\nimport { Range3d } from \"../geometry3d/Range\";\r\nimport { UsageSums } from \"../numerics/UsageSums\";\r\n\r\n/**\r\n * Accumulated data for x,y,z length statistics in ranges.\r\n * * Usage pattern:\r\n *   * create a enw RangeLengthData:\r\n *      * `myData = new RangeLengthData ();`\r\n *   * announce ranges to be accumulated:\r\n *     * (many times)  `myData.accumulateRowableXYZArrayRange (points);\r\n *   * access data in public members:\r\n *     * `myData.range` -- the composite range.\r\n *     * `myData.xLength`, `myData.yLength`, `myData.zLength` -- mean, minMax, count, and standardDeviation of range lengths in x,y,z directions.\r\n * @public\r\n */\r\nexport class RangeLengthData {\r\n  /** Overall range of all data observed by `accumulate` methods. */\r\n  public range: Range3d;\r\n  /** */\r\n  public xSums: UsageSums;\r\n  public ySums: UsageSums;\r\n  public zSums: UsageSums;\r\n  public constructor() {\r\n    this.range = Range3d.createNull();\r\n    this.xSums = new UsageSums();\r\n    this.ySums = new UsageSums();\r\n    this.zSums = new UsageSums();\r\n    this._workRange = Range3d.createNull();\r\n  }\r\n  private _workRange: Range3d;\r\n  /** Extend the range and length sums by the range of points in an array. */\r\n  public accumulateGrowableXYZArrayRange(points: GrowableXYZArray) {\r\n    points.setRange(this._workRange);\r\n    this.range.extendRange(this._workRange);\r\n    this.xSums.accumulate(this._workRange.xLength());\r\n    this.ySums.accumulate(this._workRange.yLength());\r\n    this.zSums.accumulate(this._workRange.zLength());\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"RangeLengthData.js","sourceRoot":"","sources":["../../../src/polyface/RangeLengthData.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAGH,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AAC9C,OAAO,EAAE,SAAS,EAAE,MAAM,uBAAuB,CAAC;AAElD;;;;;;;;;;;GAWG;AACH,MAAM,OAAO,eAAe;IAO1B;QACE,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;QAClC,IAAI,CAAC,KAAK,GAAG,IAAI,SAAS,EAAE,CAAC;QAC7B,IAAI,CAAC,KAAK,GAAG,IAAI,SAAS,EAAE,CAAC;QAC7B,IAAI,CAAC,KAAK,GAAG,IAAI,SAAS,EAAE,CAAC;QAC7B,IAAI,CAAC,UAAU,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;IACzC,CAAC;IAED,2EAA2E;IACpE,+BAA+B,CAAC,MAAwB;QAC7D,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACjC,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QACxC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,CAAC,CAAC;QACjD,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,CAAC,CAAC;QACjD,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,CAAC,CAAC;IACnD,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 { GrowableXYZArray } from \"../geometry3d/GrowableXYZArray\";\nimport { Range3d } from \"../geometry3d/Range\";\nimport { UsageSums } from \"../numerics/UsageSums\";\n\n/**\n * Accumulated data for x,y,z length statistics in ranges.\n * * Usage pattern:\n *   * create a enw RangeLengthData:\n *      * `myData = new RangeLengthData ();`\n *   * announce ranges to be accumulated:\n *     * (many times)  `myData.accumulateRowableXYZArrayRange (points);\n *   * access data in public members:\n *     * `myData.range` -- the composite range.\n *     * `myData.xLength`, `myData.yLength`, `myData.zLength` -- mean, minMax, count, and standardDeviation of range lengths in x,y,z directions.\n * @public\n */\nexport class RangeLengthData {\n  /** Overall range of all data observed by `accumulate` methods. */\n  public range: Range3d;\n  /** */\n  public xSums: UsageSums;\n  public ySums: UsageSums;\n  public zSums: UsageSums;\n  public constructor() {\n    this.range = Range3d.createNull();\n    this.xSums = new UsageSums();\n    this.ySums = new UsageSums();\n    this.zSums = new UsageSums();\n    this._workRange = Range3d.createNull();\n  }\n  private _workRange: Range3d;\n  /** Extend the range and length sums by the range of points in an array. */\n  public accumulateGrowableXYZArrayRange(points: GrowableXYZArray) {\n    points.setRange(this._workRange);\n    this.range.extendRange(this._workRange);\n    this.xSums.accumulate(this._workRange.xLength());\n    this.ySums.accumulate(this._workRange.yLength());\n    this.zSums.accumulate(this._workRange.zLength());\n  }\n}\n"]}

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

@@ -0,0 +1,52 @@
+/** @packageDocumentation
+ * @module RangeSearch
+ */
+import { CurveLocationDetail, CurveLocationDetailPair } from "../../curve/CurveLocationDetail";
+import { LineString3d } from "../../curve/LineString3d";
+import { Point3d } from "../../geometry3d/Point3dVector3d";
+/**
+ * Handler class for searching a range tree containing the segments of a linestring.
+ * * Facilitates multiple searches for closest point and close approach calculations.
+ * @public
+ */
+export declare class LineString3dRangeTreeContext {
+    /** Polyline points being searched, indexed by the range tree */
+    lineString: LineString3d;
+    /** Diagnostic: number of range tests that have returned true */
+    numRangeTestTrue: number;
+    /** Diagnostic: number of range tests that have returned false */
+    numRangeTestFalse: number;
+    /** Diagnostic: number of points tested */
+    numPointTest: number;
+    /** Diagnostic: number of searches. */
+    numSearch: number;
+    /** Range tree, whose appData are indices into the linestring points array */
+    private _rangeTreeRoot;
+    /** Constructor: capture inputs, initialize debug counters */
+    private constructor();
+    /**
+     * Create a range tree context for the polyline points:
+     * * initialize with segment ranges
+     * * appData are segment indices
+     * @param linestring captured if LineString3d, otherwise copied
+     * @param maxChildPerNode maximum children per range tree node (default 4)
+     * @param maxAppDataPerLeaf maximum segment indices per leaf node (default 4)
+     */
+    static createCapture(points: Point3d[] | LineString3d, maxChildPerNode?: number, maxAppDataPerLeaf?: number): LineString3dRangeTreeContext | undefined;
+    /**
+     * Search the range tree for closest point(s) to spacePoint.
+     * @param spacePoint point to test
+     * @param maxDist collect points at no more than this distance from spacePoint. If undefined, return only the closest point.
+     * @return closest point detail(s) with detail.a set to the distance from spacePoint to detail.point
+     */
+    searchForClosestPoint(spacePoint: Point3d, maxDist?: number): CurveLocationDetail | CurveLocationDetail[] | undefined;
+    /**
+     * Search the range trees for closest approach(es) between the polylines.
+     * @param contextA first polyline context
+     * @param contextB second polyline context
+     * @param maxDist collect close approaches separated by no more than this distance. If undefined, return only the closest approach.
+     * @return closest approach detail pair(s), one per context, with detail.a set to the approach distance
+    */
+    static searchForClosestApproach(contextA: LineString3dRangeTreeContext, contextB: LineString3dRangeTreeContext, maxDist?: number): CurveLocationDetailPair | CurveLocationDetailPair[] | undefined;
+}
+//# sourceMappingURL=LineString3dRangeTreeContext.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"LineString3dRangeTreeContext.d.ts","sourceRoot":"","sources":["../../../../src/polyface/RangeTree/LineString3dRangeTreeContext.ts"],"names":[],"mappings":"AAIA;;GAEG;AAEH,OAAO,EAAE,mBAAmB,EAAE,uBAAuB,EAAE,MAAM,iCAAiC,CAAC;AAC/F,OAAO,EAAE,YAAY,EAAE,MAAM,0BAA0B,CAAC;AAExD,OAAO,EAAE,OAAO,EAAE,MAAM,kCAAkC,CAAC;AAO3D;;;;GAIG;AACH,qBAAa,4BAA4B;IACvC,gEAAgE;IACzD,UAAU,EAAE,YAAY,CAAC;IAEhC,gEAAgE;IACzD,gBAAgB,EAAE,MAAM,CAAC;IAChC,iEAAiE;IAC1D,iBAAiB,EAAE,MAAM,CAAC;IACjC,0CAA0C;IACnC,YAAY,EAAE,MAAM,CAAC;IAC5B,sCAAsC;IAC/B,SAAS,EAAE,MAAM,CAAC;IAEzB,6EAA6E;IAC7E,OAAO,CAAC,cAAc,CAAwB;IAE9C,6DAA6D;IAC7D,OAAO;IAQP;;;;;;;OAOG;WACW,aAAa,CAAC,MAAM,EAAE,OAAO,EAAE,GAAG,YAAY,EAAE,eAAe,GAAE,MAAU,EAAE,iBAAiB,GAAE,MAAU,GAAG,4BAA4B,GAAG,SAAS;IAWnK;;;;;OAKG;IACI,qBAAqB,CAAC,UAAU,EAAE,OAAO,EAAE,OAAO,CAAC,EAAE,MAAM,GAAG,mBAAmB,GAAG,mBAAmB,EAAE,GAAG,SAAS;IAa5H;;;;;;MAME;WACY,wBAAwB,CAAC,QAAQ,EAAE,4BAA4B,EAAE,QAAQ,EAAE,4BAA4B,EAAE,OAAO,CAAC,EAAE,MAAM,GAAG,uBAAuB,GAAG,uBAAuB,EAAE,GAAG,SAAS;CAK1M"}

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

@@ -0,0 +1,74 @@
+/*---------------------------------------------------------------------------------------------
+* 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 { LineString3d } from "../../curve/LineString3d";
+import { Geometry } from "../../Geometry";
+import { Range3d } from "../../geometry3d/Range";
+import { RangeTreeNode, RangeTreeOps } from "./RangeTreeNode";
+import { SingleTreeSearchHandlerForClosestPointOnLineString3d, TwoTreeSearchHandlerForLineString3dLineString3dCloseApproach, } from "./RangeTreeSearchHandlers";
+/**
+ * Handler class for searching a range tree containing the segments of a linestring.
+ * * Facilitates multiple searches for closest point and close approach calculations.
+ * @public
+ */
+export class LineString3dRangeTreeContext {
+    /** Constructor: capture inputs, initialize debug counters */
+    constructor(rangeTreeRoot, points) {
+        this.lineString = points;
+        this._rangeTreeRoot = rangeTreeRoot;
+        this.numRangeTestTrue = 0;
+        this.numRangeTestFalse = 0;
+        this.numPointTest = 0;
+        this.numSearch = 0;
+    }
+    /**
+     * Create a range tree context for the polyline points:
+     * * initialize with segment ranges
+     * * appData are segment indices
+     * @param linestring captured if LineString3d, otherwise copied
+     * @param maxChildPerNode maximum children per range tree node (default 4)
+     * @param maxAppDataPerLeaf maximum segment indices per leaf node (default 4)
+     */
+    static createCapture(points, maxChildPerNode = 4, maxAppDataPerLeaf = 4) {
+        const linestring = points instanceof LineString3d ? points : LineString3d.createPoints(points);
+        const rangeTreeRoot = RangeTreeOps.createByIndexSplits(((index) => { return Range3d.create(linestring.pointAt(index), linestring.pointAt(index + 1)); }), ((index) => { return index; }), linestring.numPoints() - 1, // number of segments
+        maxChildPerNode, maxAppDataPerLeaf);
+        return rangeTreeRoot ? new LineString3dRangeTreeContext(rangeTreeRoot, linestring) : undefined;
+    }
+    /**
+     * Search the range tree for closest point(s) to spacePoint.
+     * @param spacePoint point to test
+     * @param maxDist collect points at no more than this distance from spacePoint. If undefined, return only the closest point.
+     * @return closest point detail(s) with detail.a set to the distance from spacePoint to detail.point
+     */
+    searchForClosestPoint(spacePoint, maxDist) {
+        const handler = new SingleTreeSearchHandlerForClosestPointOnLineString3d(spacePoint, this, maxDist);
+        this.numSearch++;
+        // seed the search with a few segments -- this reduces early trips deep into ranges that are far from spacePoint.
+        const numTest = Geometry.clamp(Math.floor(this.lineString.numPoints() / 20), 2, 7);
+        const testStep = Math.floor(this.lineString.numPoints() / numTest);
+        handler.processAppData(0);
+        handler.processAppData(this.lineString.numPoints() - 2);
+        for (let i = testStep; i + 1 < this.lineString.numPoints(); i += testStep)
+            handler.processAppData(i);
+        this._rangeTreeRoot.searchTopDown(handler);
+        return handler.searchState.savedItems.length <= 1 ? handler.getResult() : handler.getSavedItems();
+    }
+    /**
+     * Search the range trees for closest approach(es) between the polylines.
+     * @param contextA first polyline context
+     * @param contextB second polyline context
+     * @param maxDist collect close approaches separated by no more than this distance. If undefined, return only the closest approach.
+     * @return closest approach detail pair(s), one per context, with detail.a set to the approach distance
+    */
+    static searchForClosestApproach(contextA, contextB, maxDist) {
+        const handler = new TwoTreeSearchHandlerForLineString3dLineString3dCloseApproach(contextA, contextB, maxDist);
+        RangeTreeNode.searchTwoTreesTopDown(contextA._rangeTreeRoot, contextB._rangeTreeRoot, handler);
+        return handler.searchState.savedItems.length <= 1 ? handler.getResult() : handler.getSavedItems();
+    }
+}
+//# sourceMappingURL=LineString3dRangeTreeContext.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"LineString3dRangeTreeContext.js","sourceRoot":"","sources":["../../../../src/polyface/RangeTree/LineString3dRangeTreeContext.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAGH,OAAO,EAAE,YAAY,EAAE,MAAM,0BAA0B,CAAC;AACxD,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAE1C,OAAO,EAAE,OAAO,EAAE,MAAM,wBAAwB,CAAC;AACjD,OAAO,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAC9D,OAAO,EACL,oDAAoD,EAAE,4DAA4D,GACnH,MAAM,2BAA2B,CAAC;AAEnC;;;;GAIG;AACH,MAAM,OAAO,4BAA4B;IAgBvC,6DAA6D;IAC7D,YAAoB,aAAoC,EAAE,MAAoB;QAC5E,IAAI,CAAC,UAAU,GAAG,MAAM,CAAC;QACzB,IAAI,CAAC,cAAc,GAAG,aAAa,CAAC;QACpC,IAAI,CAAC,gBAAgB,GAAG,CAAC,CAAC;QAC1B,IAAI,CAAC,iBAAiB,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,YAAY,GAAG,CAAC,CAAC;QACtB,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;IACrB,CAAC;IACD;;;;;;;OAOG;IACI,MAAM,CAAC,aAAa,CAAC,MAAgC,EAAE,kBAA0B,CAAC,EAAE,oBAA4B,CAAC;QACtH,MAAM,UAAU,GAAG,MAAM,YAAY,YAAY,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,YAAY,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;QAC/F,MAAM,aAAa,GAAG,YAAY,CAAC,mBAAmB,CACpD,CAAC,CAAC,KAAa,EAAW,EAAE,GAAG,OAAO,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,KAAK,CAAE,EAAE,UAAU,CAAC,OAAO,CAAC,KAAK,GAAG,CAAC,CAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EACpH,CAAC,CAAC,KAAa,EAAU,EAAE,GAAG,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC,EAC9C,UAAU,CAAC,SAAS,EAAE,GAAG,CAAC,EAAI,qBAAqB;QACnD,eAAe,EACf,iBAAiB,CAClB,CAAC;QACF,OAAO,aAAa,CAAC,CAAC,CAAC,IAAI,4BAA4B,CAAC,aAAa,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IACjG,CAAC;IACD;;;;;OAKG;IACI,qBAAqB,CAAC,UAAmB,EAAE,OAAgB;QAChE,MAAM,OAAO,GAAG,IAAI,oDAAoD,CAAC,UAAU,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;QACpG,IAAI,CAAC,SAAS,EAAE,CAAC;QACjB,iHAAiH;QACjH,MAAM,OAAO,GAAG,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,SAAS,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACnF,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,SAAS,EAAE,GAAG,OAAO,CAAC,CAAC;QACnE,OAAO,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;QAC1B,OAAO,CAAC,cAAc,CAAC,IAAI,CAAC,UAAU,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC,CAAC;QACxD,KAAK,IAAI,CAAC,GAAG,QAAQ,EAAE,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,SAAS,EAAE,EAAE,CAAC,IAAI,QAAQ;YACvE,OAAO,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAI,CAAC,cAAc,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;QAC3C,OAAO,OAAO,CAAC,WAAW,CAAC,UAAU,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,aAAa,EAAE,CAAC;IACpG,CAAC;IACD;;;;;;MAME;IACK,MAAM,CAAC,wBAAwB,CAAC,QAAsC,EAAE,QAAsC,EAAE,OAAgB;QACrI,MAAM,OAAO,GAAG,IAAI,4DAA4D,CAAC,QAAQ,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;QAC9G,aAAa,CAAC,qBAAqB,CAAC,QAAQ,CAAC,cAAc,EAAE,QAAQ,CAAC,cAAc,EAAE,OAAO,CAAC,CAAC;QAC/F,OAAO,OAAO,CAAC,WAAW,CAAC,UAAU,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,aAAa,EAAE,CAAC;IACpG,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 { LineString3d } from \"../../curve/LineString3d\";\nimport { Geometry } from \"../../Geometry\";\nimport { Point3d } from \"../../geometry3d/Point3dVector3d\";\nimport { Range3d } from \"../../geometry3d/Range\";\nimport { RangeTreeNode, RangeTreeOps } from \"./RangeTreeNode\";\nimport {\n  SingleTreeSearchHandlerForClosestPointOnLineString3d, TwoTreeSearchHandlerForLineString3dLineString3dCloseApproach,\n} from \"./RangeTreeSearchHandlers\";\n\n/**\n * Handler class for searching a range tree containing the segments of a linestring.\n * * Facilitates multiple searches for closest point and close approach calculations.\n * @public\n */\nexport class LineString3dRangeTreeContext {\n  /** Polyline points being searched, indexed by the range tree */\n  public lineString: LineString3d;\n\n  /** Diagnostic: number of range tests that have returned true */\n  public numRangeTestTrue: number;\n  /** Diagnostic: number of range tests that have returned false */\n  public numRangeTestFalse: number;\n  /** Diagnostic: number of points tested */\n  public numPointTest: number;\n  /** Diagnostic: number of searches. */\n  public numSearch: number;\n\n  /** Range tree, whose appData are indices into the linestring points array */\n  private _rangeTreeRoot: RangeTreeNode<number>;\n\n  /** Constructor: capture inputs, initialize debug counters */\n  private constructor(rangeTreeRoot: RangeTreeNode<number>, points: LineString3d) {\n    this.lineString = points;\n    this._rangeTreeRoot = rangeTreeRoot;\n    this.numRangeTestTrue = 0;\n    this.numRangeTestFalse = 0;\n    this.numPointTest = 0;\n    this.numSearch = 0;\n  }\n  /**\n   * Create a range tree context for the polyline points:\n   * * initialize with segment ranges\n   * * appData are segment indices\n   * @param linestring captured if LineString3d, otherwise copied\n   * @param maxChildPerNode maximum children per range tree node (default 4)\n   * @param maxAppDataPerLeaf maximum segment indices per leaf node (default 4)\n   */\n  public static createCapture(points: Point3d[] | LineString3d, maxChildPerNode: number = 4, maxAppDataPerLeaf: number = 4): LineString3dRangeTreeContext | undefined {\n    const linestring = points instanceof LineString3d ? points : LineString3d.createPoints(points);\n    const rangeTreeRoot = RangeTreeOps.createByIndexSplits<number>(\n      ((index: number): Range3d => { return Range3d.create(linestring.pointAt(index)!, linestring.pointAt(index + 1)!); }),\n      ((index: number): number => { return index; }),\n      linestring.numPoints() - 1,   // number of segments\n      maxChildPerNode,\n      maxAppDataPerLeaf,\n    );\n    return rangeTreeRoot ? new LineString3dRangeTreeContext(rangeTreeRoot, linestring) : undefined;\n  }\n  /**\n   * Search the range tree for closest point(s) to spacePoint.\n   * @param spacePoint point to test\n   * @param maxDist collect points at no more than this distance from spacePoint. If undefined, return only the closest point.\n   * @return closest point detail(s) with detail.a set to the distance from spacePoint to detail.point\n   */\n  public searchForClosestPoint(spacePoint: Point3d, maxDist?: number): CurveLocationDetail | CurveLocationDetail[] | undefined {\n    const handler = new SingleTreeSearchHandlerForClosestPointOnLineString3d(spacePoint, this, maxDist);\n    this.numSearch++;\n    // seed the search with a few segments -- this reduces early trips deep into ranges that are far from spacePoint.\n    const numTest = Geometry.clamp(Math.floor(this.lineString.numPoints() / 20), 2, 7);\n    const testStep = Math.floor(this.lineString.numPoints() / numTest);\n    handler.processAppData(0);\n    handler.processAppData(this.lineString.numPoints() - 2);\n    for (let i = testStep; i + 1 < this.lineString.numPoints(); i += testStep)\n      handler.processAppData(i);\n    this._rangeTreeRoot.searchTopDown(handler);\n    return handler.searchState.savedItems.length <= 1 ? handler.getResult() : handler.getSavedItems();\n  }\n  /**\n   * Search the range trees for closest approach(es) between the polylines.\n   * @param contextA first polyline context\n   * @param contextB second polyline context\n   * @param maxDist collect close approaches separated by no more than this distance. If undefined, return only the closest approach.\n   * @return closest approach detail pair(s), one per context, with detail.a set to the approach distance\n  */\n  public static searchForClosestApproach(contextA: LineString3dRangeTreeContext, contextB: LineString3dRangeTreeContext, maxDist?: number): CurveLocationDetailPair | CurveLocationDetailPair[] | undefined {\n    const handler = new TwoTreeSearchHandlerForLineString3dLineString3dCloseApproach(contextA, contextB, maxDist);\n    RangeTreeNode.searchTwoTreesTopDown(contextA._rangeTreeRoot, contextB._rangeTreeRoot, handler);\n    return handler.searchState.savedItems.length <= 1 ? handler.getResult() : handler.getSavedItems();\n  }\n}\n"]}

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

@@ -0,0 +1,60 @@
+/** @packageDocumentation
+ * @module CartesianGeometry
+ */
+/**
+ * Data carrier for use when repeatedly testing items (of parameterized type T) to determine the one with a minimum associated value.
+ * * Optionally pushes to arrays of items and values when the value does not exceed a given trigger.
+ * * * The item at minimum value is still recorded, even if the minimum value exceeds the trigger value.
+ * * When comparing a potential minimum value to an undefined value, the number is always accepted as the new minimum.
+ * @internal
+ */
+export declare class MinimumValueTester<T> {
+    itemAtMinValue: T | undefined;
+    minValue: number | undefined;
+    triggerForSavingToArray: number | undefined;
+    savedItems: T[];
+    savedValues: number[];
+    /**
+     * Capture the given item with undefined item and value, and optional maxValueForSavingToArray.
+     */
+    private constructor();
+    /**
+     * Static method to create a tester.
+     * @param maxValueForSavingToArray optional numeric value limiting items to save to the optional array.
+     * @returns new tester.
+     */
+    static create<T>(maxValueForSavingToArray?: number): MinimumValueTester<T>;
+    /**
+     * Install new minimum value and associated item, both possibly undefined.
+     * * The existing arrays of saved items and values, and the trigger value, are unaffected.
+     * @param item object to associate with the new minimum value
+     * @param value new minimum value
+     */
+    resetMinValueAndItem(item?: T | undefined, value?: number | undefined): void;
+    /**
+     * Set the trigger value.
+     * @param value new trigger value
+     * @param reinitializeArrays whether to clear the arrays of saved items and values
+     */
+    resetTriggerValueForSavingToArray(value: number | undefined, reinitializeArrays?: boolean): void;
+    /**
+     * Test a new item with value.
+     * * Push the new item and value to the saved arrays if both:
+     *   * `this.triggerForSavingToArray` is defined
+     *   * the new value is less than or equal to `this.triggerForSavingToArray`.
+     * * Save the new item and value if either:
+     *   * `this.minValue` is undefined
+     *   * new value is less than `this.minValue`.
+     * @param item item to be saved (captured!) if value conditions are met
+     * @param value numeric value being minimized.
+     * @returns true if and only if the input value is the new minimum value.
+     */
+    testAndSave(item: T, value: number): boolean;
+    /** Whether the input value is small enough to be saved to this instance. */
+    doesValueTrigger(value: number): boolean;
+    /** Whether the input value is smaller than the last recorded minimum value. */
+    isNewMinValue(value: number): boolean;
+    /** Whether the input value is small enough to be the new minimum or to be saved to this instance. */
+    isNewMinOrTrigger(value: number): boolean;
+}
+//# sourceMappingURL=MinimumValueTester.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"MinimumValueTester.d.ts","sourceRoot":"","sources":["../../../../src/polyface/RangeTree/MinimumValueTester.ts"],"names":[],"mappings":"AAIA;;GAEG;AAEH;;;;;;GAMG;AACH,qBAAa,kBAAkB,CAAC,CAAC;IACxB,cAAc,EAAE,CAAC,GAAG,SAAS,CAAC;IAC9B,QAAQ,EAAE,MAAM,GAAG,SAAS,CAAC;IAC7B,uBAAuB,EAAE,MAAM,GAAG,SAAS,CAAC;IAC5C,UAAU,EAAE,CAAC,EAAE,CAAM;IACrB,WAAW,EAAE,MAAM,EAAE,CAAM;IAClC;;OAEG;IACH,OAAO;IAIP;;;;OAIG;WACW,MAAM,CAAC,CAAC,EAAE,wBAAwB,CAAC,EAAE,MAAM,GAAG,kBAAkB,CAAC,CAAC,CAAC;IAGjF;;;;;OAKG;IACI,oBAAoB,CAAC,IAAI,GAAE,CAAC,GAAG,SAAqB,EAAE,KAAK,GAAE,MAAM,GAAG,SAAqB;IAIlG;;;;OAIG;IACI,iCAAiC,CAAC,KAAK,EAAE,MAAM,GAAG,SAAS,EAAE,kBAAkB,GAAE,OAAe;IAOvG;;;;;;;;;;;OAWG;IACI,WAAW,CAAC,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,GAAG,OAAO;IAYnD,4EAA4E;IACrE,gBAAgB,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO;IAG/C,+EAA+E;IACxE,aAAa,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO;IAG5C,qGAAqG;IAC9F,iBAAiB,CAAC,KAAK,EAAE,MAAM,GAAG,OAAO;CAGjD"}

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

@@ -0,0 +1,92 @@
+/*---------------------------------------------------------------------------------------------
+* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+* See LICENSE.md in the project root for license terms and full copyright notice.
+*--------------------------------------------------------------------------------------------*/
+/** @packageDocumentation
+ * @module CartesianGeometry
+ */
+/**
+ * Data carrier for use when repeatedly testing items (of parameterized type T) to determine the one with a minimum associated value.
+ * * Optionally pushes to arrays of items and values when the value does not exceed a given trigger.
+ * * * The item at minimum value is still recorded, even if the minimum value exceeds the trigger value.
+ * * When comparing a potential minimum value to an undefined value, the number is always accepted as the new minimum.
+ * @internal
+ */
+export class MinimumValueTester {
+    /**
+     * Capture the given item with undefined item and value, and optional maxValueForSavingToArray.
+     */
+    constructor(maxValueForSavingToArray) {
+        this.savedItems = [];
+        this.savedValues = [];
+        this.resetMinValueAndItem(undefined, undefined);
+        this.resetTriggerValueForSavingToArray(maxValueForSavingToArray, false);
+    }
+    /**
+     * Static method to create a tester.
+     * @param maxValueForSavingToArray optional numeric value limiting items to save to the optional array.
+     * @returns new tester.
+     */
+    static create(maxValueForSavingToArray) {
+        return new MinimumValueTester(maxValueForSavingToArray);
+    }
+    /**
+     * Install new minimum value and associated item, both possibly undefined.
+     * * The existing arrays of saved items and values, and the trigger value, are unaffected.
+     * @param item object to associate with the new minimum value
+     * @param value new minimum value
+     */
+    resetMinValueAndItem(item = undefined, value = undefined) {
+        this.itemAtMinValue = item;
+        this.minValue = value;
+    }
+    /**
+     * Set the trigger value.
+     * @param value new trigger value
+     * @param reinitializeArrays whether to clear the arrays of saved items and values
+     */
+    resetTriggerValueForSavingToArray(value, reinitializeArrays = false) {
+        this.triggerForSavingToArray = value;
+        if (reinitializeArrays) {
+            this.savedItems = [];
+            this.savedValues = [];
+        }
+    }
+    /**
+     * Test a new item with value.
+     * * Push the new item and value to the saved arrays if both:
+     *   * `this.triggerForSavingToArray` is defined
+     *   * the new value is less than or equal to `this.triggerForSavingToArray`.
+     * * Save the new item and value if either:
+     *   * `this.minValue` is undefined
+     *   * new value is less than `this.minValue`.
+     * @param item item to be saved (captured!) if value conditions are met
+     * @param value numeric value being minimized.
+     * @returns true if and only if the input value is the new minimum value.
+     */
+    testAndSave(item, value) {
+        if (this.doesValueTrigger(value)) {
+            this.savedValues.push(value);
+            this.savedItems.push(item);
+        }
+        if (this.isNewMinValue(value)) {
+            this.minValue = value;
+            this.itemAtMinValue = item;
+            return true;
+        }
+        return false;
+    }
+    /** Whether the input value is small enough to be saved to this instance. */
+    doesValueTrigger(value) {
+        return this.triggerForSavingToArray !== undefined && value <= this.triggerForSavingToArray;
+    }
+    /** Whether the input value is smaller than the last recorded minimum value. */
+    isNewMinValue(value) {
+        return this.minValue === undefined || value < this.minValue;
+    }
+    /** Whether the input value is small enough to be the new minimum or to be saved to this instance. */
+    isNewMinOrTrigger(value) {
+        return this.isNewMinValue(value) || this.doesValueTrigger(value);
+    }
+}
+//# sourceMappingURL=MinimumValueTester.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"MinimumValueTester.js","sourceRoot":"","sources":["../../../../src/polyface/RangeTree/MinimumValueTester.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH;;;;;;GAMG;AACH,MAAM,OAAO,kBAAkB;IAM7B;;OAEG;IACH,YAAoB,wBAAiC;QAL9C,eAAU,GAAQ,EAAE,CAAC;QACrB,gBAAW,GAAa,EAAE,CAAC;QAKhC,IAAI,CAAC,oBAAoB,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;QAChD,IAAI,CAAC,iCAAiC,CAAC,wBAAwB,EAAE,KAAK,CAAC,CAAC;IAC1E,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,MAAM,CAAI,wBAAiC;QACvD,OAAO,IAAI,kBAAkB,CAAI,wBAAwB,CAAC,CAAC;IAC7D,CAAC;IACD;;;;;OAKG;IACI,oBAAoB,CAAC,OAAsB,SAAS,EAAE,QAA4B,SAAS;QAChG,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC;QAC3B,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC;IACxB,CAAC;IACD;;;;OAIG;IACI,iCAAiC,CAAC,KAAyB,EAAE,qBAA8B,KAAK;QACrG,IAAI,CAAC,uBAAuB,GAAG,KAAK,CAAC;QACrC,IAAI,kBAAkB,EAAE;YACtB,IAAI,CAAC,UAAU,GAAG,EAAE,CAAC;YACrB,IAAI,CAAC,WAAW,GAAG,EAAE,CAAC;SACvB;IACH,CAAC;IACD;;;;;;;;;;;OAWG;IACI,WAAW,CAAC,IAAO,EAAE,KAAa;QACvC,IAAI,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,EAAE;YAChC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC7B,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;SAC5B;QACD,IAAI,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,EAAE;YAC7B,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC;YACtB,IAAI,CAAC,cAAc,GAAG,IAAI,CAAC;YAC3B,OAAO,IAAI,CAAC;SACb;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,4EAA4E;IACrE,gBAAgB,CAAC,KAAa;QACnC,OAAO,IAAI,CAAC,uBAAuB,KAAK,SAAS,IAAI,KAAK,IAAI,IAAI,CAAC,uBAAuB,CAAC;IAC7F,CAAC;IACD,+EAA+E;IACxE,aAAa,CAAC,KAAa;QAChC,OAAO,IAAI,CAAC,QAAQ,KAAK,SAAS,IAAI,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC;IAC9D,CAAC;IACD,qGAAqG;IAC9F,iBAAiB,CAAC,KAAa;QACpC,OAAO,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC;IACnE,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 CartesianGeometry\n */\n\n/**\n * Data carrier for use when repeatedly testing items (of parameterized type T) to determine the one with a minimum associated value.\n * * Optionally pushes to arrays of items and values when the value does not exceed a given trigger.\n * * * The item at minimum value is still recorded, even if the minimum value exceeds the trigger value.\n * * When comparing a potential minimum value to an undefined value, the number is always accepted as the new minimum.\n * @internal\n */\nexport class MinimumValueTester<T>{\n  public itemAtMinValue: T | undefined;\n  public minValue: number | undefined;\n  public triggerForSavingToArray: number | undefined;\n  public savedItems: T[] = [];\n  public savedValues: number[] = [];\n  /**\n   * Capture the given item with undefined item and value, and optional maxValueForSavingToArray.\n   */\n  private constructor(maxValueForSavingToArray?: number) {\n    this.resetMinValueAndItem(undefined, undefined);\n    this.resetTriggerValueForSavingToArray(maxValueForSavingToArray, false);\n  }\n  /**\n   * Static method to create a tester.\n   * @param maxValueForSavingToArray optional numeric value limiting items to save to the optional array.\n   * @returns new tester.\n   */\n  public static create<T>(maxValueForSavingToArray?: number): MinimumValueTester<T> {\n    return new MinimumValueTester<T>(maxValueForSavingToArray);\n  }\n  /**\n   * Install new minimum value and associated item, both possibly undefined.\n   * * The existing arrays of saved items and values, and the trigger value, are unaffected.\n   * @param item object to associate with the new minimum value\n   * @param value new minimum value\n   */\n  public resetMinValueAndItem(item: T | undefined = undefined, value: number | undefined = undefined) {\n    this.itemAtMinValue = item;\n    this.minValue = value;\n  }\n  /**\n   * Set the trigger value.\n   * @param value new trigger value\n   * @param reinitializeArrays whether to clear the arrays of saved items and values\n   */\n  public resetTriggerValueForSavingToArray(value: number | undefined, reinitializeArrays: boolean = false) {\n    this.triggerForSavingToArray = value;\n    if (reinitializeArrays) {\n      this.savedItems = [];\n      this.savedValues = [];\n    }\n  }\n  /**\n   * Test a new item with value.\n   * * Push the new item and value to the saved arrays if both:\n   *   * `this.triggerForSavingToArray` is defined\n   *   * the new value is less than or equal to `this.triggerForSavingToArray`.\n   * * Save the new item and value if either:\n   *   * `this.minValue` is undefined\n   *   * new value is less than `this.minValue`.\n   * @param item item to be saved (captured!) if value conditions are met\n   * @param value numeric value being minimized.\n   * @returns true if and only if the input value is the new minimum value.\n   */\n  public testAndSave(item: T, value: number): boolean {\n    if (this.doesValueTrigger(value)) {\n      this.savedValues.push(value);\n      this.savedItems.push(item);\n    }\n    if (this.isNewMinValue(value)) {\n      this.minValue = value;\n      this.itemAtMinValue = item;\n      return true;\n    }\n    return false;\n  }\n  /** Whether the input value is small enough to be saved to this instance. */\n  public doesValueTrigger(value: number): boolean {\n    return this.triggerForSavingToArray !== undefined && value <= this.triggerForSavingToArray;\n  }\n  /** Whether the input value is smaller than the last recorded minimum value. */\n  public isNewMinValue(value: number): boolean {\n    return this.minValue === undefined || value < this.minValue;\n  }\n  /** Whether the input value is small enough to be the new minimum or to be saved to this instance. */\n  public isNewMinOrTrigger(value: number): boolean {\n    return this.isNewMinValue(value) || this.doesValueTrigger(value);\n  }\n}\n"]}

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

@@ -0,0 +1,57 @@
+/** @packageDocumentation
+ * @module RangeSearch
+ */
+import { CurveLocationDetail, CurveLocationDetailPair } from "../../curve/CurveLocationDetail";
+import { Point3d } from "../../geometry3d/Point3dVector3d";
+/**
+ * Handler class for searching a range tree containing unordered Point3d data.
+ * * Facilitates multiple searches for closest point and close approach calculations.
+ * @public
+ */
+export declare class Point3dArrayRangeTreeContext {
+    /** Array of points being searched, indexed by the range tree */
+    points: Point3d[];
+    /** Diagnostic: number of range tests returned true */
+    numRangeTestTrue: number;
+    /** Diagnostic: number of range tests returned false */
+    numRangeTestFalse: number;
+    /** Diagnostic: number of point distance tests */
+    numPointTest: number;
+    /** Diagnostic: number of searches */
+    numSearch: number;
+    /** range tree, whose appData are indices into the points array */
+    private _rangeTreeRoot;
+    /** Constructor: capture inputs, initialize debug counters */
+    private constructor();
+    /**
+     * Create a range tree context with given points:
+     * * initialize with single-point ranges
+     * * appData are point indices
+     * @param points captured
+     * @param maxChildPerNode maximum children per range tree node (default 4)
+     * @param maxAppDataPerLeaf maximum point indices per leaf node (default 4)
+     */
+    static createCapture(points: Point3d[], maxChildPerNode?: number, maxAppDataPerLeaf?: number): Point3dArrayRangeTreeContext | undefined;
+    /**
+     * Search the range tree for closest point(s) to spacePoint.
+     * @param spacePoint point to test
+     * @param maxDist collect points at no more than this distance from spacePoint. If undefined, return only the closest point.
+     * @return closest point detail(s) with following fields set:
+     * * detail.point = the closest point
+     * * detail.fraction = the index of the closest point in the points array
+     * * detail.a = distance from spacePoint to closest point
+     */
+    searchForClosestPoint(spacePoint: Point3d, maxDist?: number): CurveLocationDetail | CurveLocationDetail[] | undefined;
+    /**
+     * Search the range trees for closest approach(es) between the point arrays.
+     * @param contextA first point array context
+     * @param contextB second point array context
+     * @param maxDist collect close approaches separated by no more than this distance. If undefined, return only the closest approach.
+     * @return closest approach detail pair(s), one per context, each with the following fields set:
+     * * detail.point = the point at closest approach
+     * * detail.fraction = the index of detail.point in the points array
+     * * detail.a = the closest approach distance
+    */
+    static searchForClosestApproach(contextA: Point3dArrayRangeTreeContext, contextB: Point3dArrayRangeTreeContext, maxDist?: number): CurveLocationDetailPair | CurveLocationDetailPair[] | undefined;
+}
+//# sourceMappingURL=Point3dArrayRangeTreeContext.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"Point3dArrayRangeTreeContext.d.ts","sourceRoot":"","sources":["../../../../src/polyface/RangeTree/Point3dArrayRangeTreeContext.ts"],"names":[],"mappings":"AAIA;;GAEG;AAEH,OAAO,EAAE,mBAAmB,EAAE,uBAAuB,EAAE,MAAM,iCAAiC,CAAC;AAC/F,OAAO,EAAE,OAAO,EAAE,MAAM,kCAAkC,CAAC;AAO3D;;;;GAIG;AACH,qBAAa,4BAA4B;IACvC,gEAAgE;IACzD,MAAM,EAAE,OAAO,EAAE,CAAC;IAEzB,sDAAsD;IAC/C,gBAAgB,EAAE,MAAM,CAAC;IAChC,uDAAuD;IAChD,iBAAiB,EAAE,MAAM,CAAC;IACjC,iDAAiD;IAC1C,YAAY,EAAE,MAAM,CAAC;IAC5B,qCAAqC;IAC9B,SAAS,EAAE,MAAM,CAAC;IAEzB,kEAAkE;IAClE,OAAO,CAAC,cAAc,CAAwB;IAE9C,6DAA6D;IAC7D,OAAO;IAQP;;;;;;;OAOG;WACW,aAAa,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,eAAe,GAAE,MAAU,EAAE,iBAAiB,GAAE,MAAU,GAAG,4BAA4B,GAAG,SAAS;IAUpJ;;;;;;;;OAQG;IACI,qBAAqB,CAAC,UAAU,EAAE,OAAO,EAAE,OAAO,CAAC,EAAE,MAAM,GAAG,mBAAmB,GAAG,mBAAmB,EAAE,GAAG,SAAS;IAM5H;;;;;;;;;MASE;WACY,wBAAwB,CAAC,QAAQ,EAAE,4BAA4B,EAAE,QAAQ,EAAE,4BAA4B,EAAE,OAAO,CAAC,EAAE,MAAM,GAAG,uBAAuB,GAAG,uBAAuB,EAAE,GAAG,SAAS;CAK1M"}

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

@@ -0,0 +1,69 @@
+/*---------------------------------------------------------------------------------------------
+* 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 { Range3d } from "../../geometry3d/Range";
+import { RangeTreeNode, RangeTreeOps } from "./RangeTreeNode";
+import { SingleTreeSearchHandlerForClosestPointInArray, TwoTreeSearchHandlerForPoint3dArrayPoint3dArrayCloseApproach, } from "./RangeTreeSearchHandlers";
+/**
+ * Handler class for searching a range tree containing unordered Point3d data.
+ * * Facilitates multiple searches for closest point and close approach calculations.
+ * @public
+ */
+export class Point3dArrayRangeTreeContext {
+    /** Constructor: capture inputs, initialize debug counters */
+    constructor(rangeTreeRoot, points) {
+        this.points = points;
+        this._rangeTreeRoot = rangeTreeRoot;
+        this.numRangeTestTrue = 0;
+        this.numRangeTestFalse = 0;
+        this.numPointTest = 0;
+        this.numSearch = 0;
+    }
+    /**
+     * Create a range tree context with given points:
+     * * initialize with single-point ranges
+     * * appData are point indices
+     * @param points captured
+     * @param maxChildPerNode maximum children per range tree node (default 4)
+     * @param maxAppDataPerLeaf maximum point indices per leaf node (default 4)
+     */
+    static createCapture(points, maxChildPerNode = 4, maxAppDataPerLeaf = 4) {
+        const rangeTreeRoot = RangeTreeOps.createByIndexSplits(((index) => { return Range3d.create(points[index]); }), ((index) => { return index; }), points.length, maxChildPerNode, maxAppDataPerLeaf);
+        return rangeTreeRoot ? new Point3dArrayRangeTreeContext(rangeTreeRoot, points) : undefined;
+    }
+    /**
+     * Search the range tree for closest point(s) to spacePoint.
+     * @param spacePoint point to test
+     * @param maxDist collect points at no more than this distance from spacePoint. If undefined, return only the closest point.
+     * @return closest point detail(s) with following fields set:
+     * * detail.point = the closest point
+     * * detail.fraction = the index of the closest point in the points array
+     * * detail.a = distance from spacePoint to closest point
+     */
+    searchForClosestPoint(spacePoint, maxDist) {
+        const handler = new SingleTreeSearchHandlerForClosestPointInArray(spacePoint, this, maxDist);
+        this.numSearch++;
+        this._rangeTreeRoot.searchTopDown(handler);
+        return handler.searchState.savedItems.length <= 1 ? handler.getResult() : handler.getSavedItems();
+    }
+    /**
+     * Search the range trees for closest approach(es) between the point arrays.
+     * @param contextA first point array context
+     * @param contextB second point array context
+     * @param maxDist collect close approaches separated by no more than this distance. If undefined, return only the closest approach.
+     * @return closest approach detail pair(s), one per context, each with the following fields set:
+     * * detail.point = the point at closest approach
+     * * detail.fraction = the index of detail.point in the points array
+     * * detail.a = the closest approach distance
+    */
+    static searchForClosestApproach(contextA, contextB, maxDist) {
+        const handler = new TwoTreeSearchHandlerForPoint3dArrayPoint3dArrayCloseApproach(contextA, contextB, maxDist);
+        RangeTreeNode.searchTwoTreesTopDown(contextA._rangeTreeRoot, contextB._rangeTreeRoot, handler);
+        return handler.searchState.savedItems.length <= 1 ? handler.getResult() : handler.getSavedItems();
+    }
+}
+//# sourceMappingURL=Point3dArrayRangeTreeContext.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"Point3dArrayRangeTreeContext.js","sourceRoot":"","sources":["../../../../src/polyface/RangeTree/Point3dArrayRangeTreeContext.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAIH,OAAO,EAAE,OAAO,EAAE,MAAM,wBAAwB,CAAC;AACjD,OAAO,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAC9D,OAAO,EACL,6CAA6C,EAAE,4DAA4D,GAC5G,MAAM,2BAA2B,CAAC;AAEnC;;;;GAIG;AACH,MAAM,OAAO,4BAA4B;IAgBvC,6DAA6D;IAC7D,YAAoB,aAAoC,EAAE,MAAiB;QACzE,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,cAAc,GAAG,aAAa,CAAC;QACpC,IAAI,CAAC,gBAAgB,GAAG,CAAC,CAAC;QAC1B,IAAI,CAAC,iBAAiB,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,YAAY,GAAG,CAAC,CAAC;QACtB,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;IACrB,CAAC;IACD;;;;;;;OAOG;IACI,MAAM,CAAC,aAAa,CAAC,MAAiB,EAAE,kBAA0B,CAAC,EAAE,oBAA4B,CAAC;QACvG,MAAM,aAAa,GAAG,YAAY,CAAC,mBAAmB,CACpD,CAAC,CAAC,KAAa,EAAW,EAAE,GAAG,OAAO,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EACvE,CAAC,CAAC,KAAa,EAAU,EAAE,GAAG,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC,EAC9C,MAAM,CAAC,MAAM,EACb,eAAe,EACf,iBAAiB,CAClB,CAAC;QACF,OAAO,aAAa,CAAC,CAAC,CAAC,IAAI,4BAA4B,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAC7F,CAAC;IACD;;;;;;;;OAQG;IACI,qBAAqB,CAAC,UAAmB,EAAE,OAAgB;QAChE,MAAM,OAAO,GAAG,IAAI,6CAA6C,CAAC,UAAU,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;QAC7F,IAAI,CAAC,SAAS,EAAE,CAAC;QACjB,IAAI,CAAC,cAAc,CAAC,aAAa,CAAC,OAAO,CAAC,CAAC;QAC3C,OAAO,OAAO,CAAC,WAAW,CAAC,UAAU,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,aAAa,EAAE,CAAC;IACpG,CAAC;IACD;;;;;;;;;MASE;IACK,MAAM,CAAC,wBAAwB,CAAC,QAAsC,EAAE,QAAsC,EAAE,OAAgB;QACrI,MAAM,OAAO,GAAG,IAAI,4DAA4D,CAAC,QAAQ,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;QAC9G,aAAa,CAAC,qBAAqB,CAAC,QAAQ,CAAC,cAAc,EAAE,QAAQ,CAAC,cAAc,EAAE,OAAO,CAAC,CAAC;QAC/F,OAAO,OAAO,CAAC,WAAW,CAAC,UAAU,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,aAAa,EAAE,CAAC;IACpG,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 { Point3d } from \"../../geometry3d/Point3dVector3d\";\nimport { Range3d } from \"../../geometry3d/Range\";\nimport { RangeTreeNode, RangeTreeOps } from \"./RangeTreeNode\";\nimport {\n  SingleTreeSearchHandlerForClosestPointInArray, TwoTreeSearchHandlerForPoint3dArrayPoint3dArrayCloseApproach,\n} from \"./RangeTreeSearchHandlers\";\n\n/**\n * Handler class for searching a range tree containing unordered Point3d data.\n * * Facilitates multiple searches for closest point and close approach calculations.\n * @public\n */\nexport class Point3dArrayRangeTreeContext {\n  /** Array of points being searched, indexed by the range tree */\n  public points: Point3d[];\n\n  /** Diagnostic: number of range tests returned true */\n  public numRangeTestTrue: number;\n  /** Diagnostic: number of range tests returned false */\n  public numRangeTestFalse: number;\n  /** Diagnostic: number of point distance tests */\n  public numPointTest: number;\n  /** Diagnostic: number of searches */\n  public numSearch: number;\n\n  /** range tree, whose appData are indices into the points array */\n  private _rangeTreeRoot: RangeTreeNode<number>;\n\n  /** Constructor: capture inputs, initialize debug counters */\n  private constructor(rangeTreeRoot: RangeTreeNode<number>, points: Point3d[]) {\n    this.points = points;\n    this._rangeTreeRoot = rangeTreeRoot;\n    this.numRangeTestTrue = 0;\n    this.numRangeTestFalse = 0;\n    this.numPointTest = 0;\n    this.numSearch = 0;\n  }\n  /**\n   * Create a range tree context with given points:\n   * * initialize with single-point ranges\n   * * appData are point indices\n   * @param points captured\n   * @param maxChildPerNode maximum children per range tree node (default 4)\n   * @param maxAppDataPerLeaf maximum point indices per leaf node (default 4)\n   */\n  public static createCapture(points: Point3d[], maxChildPerNode: number = 4, maxAppDataPerLeaf: number = 4): Point3dArrayRangeTreeContext | undefined {\n    const rangeTreeRoot = RangeTreeOps.createByIndexSplits<number>(\n      ((index: number): Range3d => { return Range3d.create(points[index]); }),\n      ((index: number): number => { return index; }),\n      points.length,\n      maxChildPerNode,\n      maxAppDataPerLeaf,\n    );\n    return rangeTreeRoot ? new Point3dArrayRangeTreeContext(rangeTreeRoot, points) : undefined;\n  }\n  /**\n   * Search the range tree for closest point(s) to spacePoint.\n   * @param spacePoint point to test\n   * @param maxDist collect points at no more than this distance from spacePoint. If undefined, return only the closest point.\n   * @return closest point detail(s) with following fields set:\n   * * detail.point = the closest point\n   * * detail.fraction = the index of the closest point in the points array\n   * * detail.a = distance from spacePoint to closest point\n   */\n  public searchForClosestPoint(spacePoint: Point3d, maxDist?: number): CurveLocationDetail | CurveLocationDetail[] | undefined {\n    const handler = new SingleTreeSearchHandlerForClosestPointInArray(spacePoint, this, maxDist);\n    this.numSearch++;\n    this._rangeTreeRoot.searchTopDown(handler);\n    return handler.searchState.savedItems.length <= 1 ? handler.getResult() : handler.getSavedItems();\n  }\n  /**\n   * Search the range trees for closest approach(es) between the point arrays.\n   * @param contextA first point array context\n   * @param contextB second point array context\n   * @param maxDist collect close approaches separated by no more than this distance. If undefined, return only the closest approach.\n   * @return closest approach detail pair(s), one per context, each with the following fields set:\n   * * detail.point = the point at closest approach\n   * * detail.fraction = the index of detail.point in the points array\n   * * detail.a = the closest approach distance\n  */\n  public static searchForClosestApproach(contextA: Point3dArrayRangeTreeContext, contextB: Point3dArrayRangeTreeContext, maxDist?: number): CurveLocationDetailPair | CurveLocationDetailPair[] | undefined {\n    const handler = new TwoTreeSearchHandlerForPoint3dArrayPoint3dArrayCloseApproach(contextA, contextB, maxDist);\n    RangeTreeNode.searchTwoTreesTopDown(contextA._rangeTreeRoot, contextB._rangeTreeRoot, handler);\n    return handler.searchState.savedItems.length <= 1 ? handler.getResult() : handler.getSavedItems();\n  }\n}\n\n"]}

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

@@ -0,0 +1,57 @@
+/** @packageDocumentation
+ * @module RangeSearch
+ */
+import { Point3d } from "../../geometry3d/Point3dVector3d";
+import { FacetLocationDetail, FacetLocationDetailPair } from "../FacetLocationDetail";
+import { Polyface, PolyfaceVisitor } from "../Polyface";
+/**
+ * Handler class for searching a range tree containing the facets of a polyface.
+ * * Facilitates multiple searches for closest point and close approach calculations.
+ * @public
+ */
+export declare class PolyfaceRangeTreeContext {
+    /** Visitor for the polyface being searched */
+    visitor: PolyfaceVisitor;
+    /** Whether all facets to visit are known to be convex. */
+    convexFacets: boolean;
+    /** Diagnostic: number of range tests that have returned true. */
+    numRangeTestTrue: number;
+    /** Diagnostic: number of range tests that have been returned false */
+    numRangeTestFalse: number;
+    /** Diagnostic: number of facet tests. */
+    numFacetTest: number;
+    /** Diagnostic: number of searches performed. */
+    numSearch: number;
+    /** Range tree, whose appData are facet (read) indices */
+    private _rangeTreeRoot;
+    /** Constructor: capture inputs, initialize debug counters */
+    private constructor();
+    /**
+     * Create a range tree context for the Polyface facets.
+     * * This is a very simple construction that splits "right and left parts" of the facet sequence.
+     * * Facets with any recognizable "left to right" or "top to bottom" sequencing will have very effective search structures.
+     * @param visitor access to facets, captured if PolyfaceVisitor
+     * @param maxChildPerNode maximum children per range tree node (default 4)
+     * @param maxAppDataPerLeaf maximum facet indices per leaf node (default 4)
+     * @param convexFacets whether all facets are known to be convex (cf. [[PolyfaceQuery.areFacetsConvex]]) (default false)
+     */
+    static createCapture(visitor: Polyface | PolyfaceVisitor, maxChildPerNode?: number, maxAppDataPerLeaf?: number, convexFacets?: boolean): PolyfaceRangeTreeContext | undefined;
+    /**
+     * Search the range tree for closest facet(s) to spacePoint.
+     * @param spacePoint point to test
+     * @param maxDist collect points at no more than this distance from spacePoint. If undefined, return only the closest point.
+     * @param searchFacetInterior whether to include facet interiors in search. Default is false: just consider facet boundaries.
+     * @return closest point detail(s) with detail.a set to the distance from spacePoint to detail.point
+     */
+    searchForClosestPoint(spacePoint: Point3d, maxDist?: number, searchFacetInterior?: boolean): FacetLocationDetail | FacetLocationDetail[] | undefined;
+    /**
+     * Search the range trees for closest approach(es) between the polyfaces.
+     * @param contextA first polyface context
+     * @param contextB second polyface context
+     * @param maxDist collect close approaches separated by no more than this distance. If undefined, return only the closest approach.
+     * @param searchFacetInterior whether to include facet interiors in search (`context.convexFacets` must be true for both contexts). Default is false: just consider facet boundaries.
+     * @return closest approach detail pair(s), one per context, with detail.a set to the approach distance
+    */
+    static searchForClosestApproach(contextA: PolyfaceRangeTreeContext, contextB: PolyfaceRangeTreeContext, maxDist?: number, searchFacetInterior?: boolean): FacetLocationDetailPair | FacetLocationDetailPair[] | undefined;
+}
+//# sourceMappingURL=PolyfaceRangeTreeContext.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"PolyfaceRangeTreeContext.d.ts","sourceRoot":"","sources":["../../../../src/polyface/RangeTree/PolyfaceRangeTreeContext.ts"],"names":[],"mappings":"AAIA;;GAEG;AAGH,OAAO,EAAE,OAAO,EAAE,MAAM,kCAAkC,CAAC;AAE3D,OAAO,EAAE,mBAAmB,EAAE,uBAAuB,EAAE,MAAM,wBAAwB,CAAC;AACtF,OAAO,EAAE,QAAQ,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AAKxD;;;;GAIG;AACH,qBAAa,wBAAwB;IACnC,8CAA8C;IACvC,OAAO,EAAE,eAAe,CAAC;IAChC,0DAA0D;IACnD,YAAY,EAAE,OAAO,CAAC;IAE7B,iEAAiE;IAC1D,gBAAgB,EAAE,MAAM,CAAC;IAChC,sEAAsE;IAC/D,iBAAiB,EAAE,MAAM,CAAC;IACjC,yCAAyC;IAClC,YAAY,EAAE,MAAM,CAAC;IAC5B,gDAAgD;IACzC,SAAS,EAAE,MAAM,CAAC;IAEzB,yDAAyD;IACzD,OAAO,CAAC,cAAc,CAAwB;IAE9C,6DAA6D;IAC7D,OAAO;IASP;;;;;;;;OAQG;WACW,aAAa,CAAC,OAAO,EAAE,QAAQ,GAAG,eAAe,EAAE,eAAe,GAAE,MAAU,EAAE,iBAAiB,GAAE,MAAU,EAAE,YAAY,GAAE,OAAe,GAAG,wBAAwB,GAAG,SAAS;IAajM;;;;;;OAMG;IACI,qBAAqB,CAAC,UAAU,EAAE,OAAO,EAAE,OAAO,CAAC,EAAE,MAAM,EAAE,mBAAmB,GAAE,OAAe,GAAG,mBAAmB,GAAG,mBAAmB,EAAE,GAAG,SAAS;IAclK;;;;;;;MAOE;WACY,wBAAwB,CAAC,QAAQ,EAAE,wBAAwB,EAAE,QAAQ,EAAE,wBAAwB,EAAE,OAAO,CAAC,EAAE,MAAM,EAAE,mBAAmB,GAAE,OAAe,GAAG,uBAAuB,GAAG,uBAAuB,EAAE,GAAG,SAAS;CAKxO"}