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

package/lib/esm/polyface/multiclip/GriddedRaggedRange2dSetWithOverflow.d.ts

@@ -0,0 +1,53 @@
+/** @packageDocumentation
+ * @module RangeSearch
+ */
+import { Range2d, Range3d } from "../../geometry3d/Range";
+import { LowAndHighXY } from "../../geometry3d/XYZProps";
+import { LinearSearchRange2dArray } from "./LinearSearchRange2dArray";
+/**
+ * Use GriddedRaggedRange2dSetWithOverflow for searching among many ranges for which
+ * * Most ranges are of somewhat consistent size.
+ * * A modest number of oversizes.
+ * * Maintain the smallish ones in a GriddedRaggedRange2dSet.
+ * * Maintain the overflows in a LinearSearchRange2dArray
+ * @internal
+ */
+export declare class GriddedRaggedRange2dSetWithOverflow<T> {
+    private _gridSet;
+    private _overflowSet;
+    private constructor();
+    /**
+     * Create an (empty) set of ranges.
+     * @param range
+     * @param numXEdge
+     * @param numYEdge
+     */
+    static create<T>(range: Range2d, numXEdge: number, numYEdge: number): GriddedRaggedRange2dSetWithOverflow<T> | undefined;
+    /**
+     * * Search for ranges containing testRange
+     * * Pass each range and tag to handler
+     * * terminate search if handler returns false.
+     * @param testRange search range.
+     * @param handler function to receive range and tag hits.
+     * @return false if search terminated by handler.  Return true if no handler returned false.
+     */
+    searchXY(x: number, y: number, handler: (range: Range2d, tag: T) => boolean): boolean;
+    /**
+     * * Search for ranges overlapping testRange
+     * * Pass each range and tag to handler
+     * * terminate search if handler returns false.
+     * @param testRange search range.
+     * @param handler function to receive range and tag hits.
+     * @return false if search terminated by handler.  Return true if no handler returned false.
+     */
+    searchRange2d(testRange: LowAndHighXY, handler: (range: Range2d, tag: T) => boolean): boolean;
+    /** If possible, insert a range into the set.
+     * * Decline to insert (and return false) if
+     *   * range is null
+     *   * range is not completely contained in the overall range of this set.
+     *   * range x or y extent is larger than 2 grid blocks.
+     */
+    addRange(range: Range2d | Range3d, tag: T): void;
+    visitChildren(initialDepth: number, handler: (depth: number, child: LinearSearchRange2dArray<T>) => void): void;
+}
+//# sourceMappingURL=GriddedRaggedRange2dSetWithOverflow.d.ts.map

package/lib/esm/polyface/multiclip/GriddedRaggedRange2dSetWithOverflow.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"GriddedRaggedRange2dSetWithOverflow.d.ts","sourceRoot":"","sources":["../../../../src/polyface/multiclip/GriddedRaggedRange2dSetWithOverflow.ts"],"names":[],"mappings":"AAIA;;GAEG;AAEH,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,wBAAwB,CAAC;AAC1D,OAAO,EAAE,YAAY,EAAE,MAAM,2BAA2B,CAAC;AAEzD,OAAO,EAAE,wBAAwB,EAAE,MAAM,4BAA4B,CAAC;AAEtE;;;;;;;GAOG;AACH,qBAAa,mCAAmC,CAAC,CAAC;IAChD,OAAO,CAAC,QAAQ,CAA6B;IAC7C,OAAO,CAAC,YAAY,CAA8B;IAClD,OAAO;IAIP;;;;;OAKG;WACW,MAAM,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,mCAAmC,CAAC,CAAC,CAAC,GAAG,SAAS;IAM/H;;;;;;;OAOG;IACI,QAAQ,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,KAAK,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,KAAK,OAAO,GAAG,OAAO;IAG5F;;;;;;;OAOG;IACI,aAAa,CAAC,SAAS,EAAE,YAAY,EAAE,OAAO,EAAE,CAAC,KAAK,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,KAAK,OAAO,GAAG,OAAO;IAGpG;;;;;OAKG;IACI,QAAQ,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO,EAAE,GAAG,EAAE,CAAC,GAAG,IAAI;IAMhD,aAAa,CAAC,YAAY,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,wBAAwB,CAAC,CAAC,CAAC,KAAK,IAAI;CAIhH"}

package/lib/esm/polyface/multiclip/GriddedRaggedRange2dSetWithOverflow.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 { GriddedRaggedRange2dSet } from "./GriddedRaggedRange2dSet";
+import { LinearSearchRange2dArray } from "./LinearSearchRange2dArray";
+/**
+ * Use GriddedRaggedRange2dSetWithOverflow for searching among many ranges for which
+ * * Most ranges are of somewhat consistent size.
+ * * A modest number of oversizes.
+ * * Maintain the smallish ones in a GriddedRaggedRange2dSet.
+ * * Maintain the overflows in a LinearSearchRange2dArray
+ * @internal
+ */
+export class GriddedRaggedRange2dSetWithOverflow {
+    constructor(gridSet, overflowSet) {
+        this._gridSet = gridSet;
+        this._overflowSet = overflowSet;
+    }
+    /**
+     * Create an (empty) set of ranges.
+     * @param range
+     * @param numXEdge
+     * @param numYEdge
+     */
+    static create(range, numXEdge, numYEdge) {
+        const grids = GriddedRaggedRange2dSet.create(range.clone(), numXEdge, numYEdge);
+        if (grids)
+            return new GriddedRaggedRange2dSetWithOverflow(grids, new LinearSearchRange2dArray());
+        return undefined;
+    }
+    /**
+     * * Search for ranges containing testRange
+     * * Pass each range and tag to handler
+     * * terminate search if handler returns false.
+     * @param testRange search range.
+     * @param handler function to receive range and tag hits.
+     * @return false if search terminated by handler.  Return true if no handler returned false.
+     */
+    searchXY(x, y, handler) {
+        return this._gridSet.searchXY(x, y, handler) && this._overflowSet.searchXY(x, y, handler);
+    }
+    /**
+     * * Search for ranges overlapping testRange
+     * * Pass each range and tag to handler
+     * * terminate search if handler returns false.
+     * @param testRange search range.
+     * @param handler function to receive range and tag hits.
+     * @return false if search terminated by handler.  Return true if no handler returned false.
+     */
+    searchRange2d(testRange, handler) {
+        return this._gridSet.searchRange2d(testRange, handler) && this._overflowSet.searchRange2d(testRange, handler);
+    }
+    /** If possible, insert a range into the set.
+     * * Decline to insert (and return false) if
+     *   * range is null
+     *   * range is not completely contained in the overall range of this set.
+     *   * range x or y extent is larger than 2 grid blocks.
+     */
+    addRange(range, tag) {
+        if (!range.isNull) {
+            if (!this._gridSet.conditionalInsert(range, tag))
+                this._overflowSet.addRange(range, tag);
+        }
+    }
+    visitChildren(initialDepth, handler) {
+        handler(initialDepth, this._overflowSet);
+        this._gridSet.visitChildren(initialDepth + 1, handler);
+    }
+}
+//# sourceMappingURL=GriddedRaggedRange2dSetWithOverflow.js.map

package/lib/esm/polyface/multiclip/GriddedRaggedRange2dSetWithOverflow.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"GriddedRaggedRange2dSetWithOverflow.js","sourceRoot":"","sources":["../../../../src/polyface/multiclip/GriddedRaggedRange2dSetWithOverflow.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAIH,OAAO,EAAE,uBAAuB,EAAE,MAAM,2BAA2B,CAAC;AACpE,OAAO,EAAE,wBAAwB,EAAE,MAAM,4BAA4B,CAAC;AAEtE;;;;;;;GAOG;AACH,MAAM,OAAO,mCAAmC;IAG9C,YAAoB,OAAmC,EAAE,WAAwC;QAC/F,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;QACxB,IAAI,CAAC,YAAY,GAAG,WAAW,CAAC;IAClC,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,MAAM,CAAI,KAAc,EAAE,QAAgB,EAAE,QAAgB;QACxE,MAAM,KAAK,GAAG,uBAAuB,CAAC,MAAM,CAAI,KAAK,CAAC,KAAK,EAAE,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;QACnF,IAAI,KAAK;YACP,OAAO,IAAI,mCAAmC,CAAI,KAAK,EAAE,IAAI,wBAAwB,EAAK,CAAC,CAAC;QAC9F,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;OAOG;IACI,QAAQ,CAAC,CAAS,EAAE,CAAS,EAAE,OAA4C;QAChF,OAAO,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC,IAAI,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC;IAC5F,CAAC;IACD;;;;;;;OAOG;IACI,aAAa,CAAC,SAAuB,EAAE,OAA4C;QACxF,OAAO,IAAI,CAAC,QAAQ,CAAC,aAAa,CAAC,SAAS,EAAE,OAAO,CAAC,IAAI,IAAI,CAAC,YAAY,CAAC,aAAa,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;IAChH,CAAC;IACD;;;;;OAKG;IACI,QAAQ,CAAC,KAAwB,EAAE,GAAM;QAC9C,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE;YACjB,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,iBAAiB,CAAC,KAAK,EAAE,GAAG,CAAC;gBAC9C,IAAI,CAAC,YAAY,CAAC,QAAQ,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;SAC1C;IACH,CAAC;IACM,aAAa,CAAC,YAAoB,EAAE,OAAoE;QAC7G,OAAO,CAAC,YAAY,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC;QACzC,IAAI,CAAC,QAAQ,CAAC,aAAa,CAAC,YAAY,GAAG,CAAC,EAAE,OAAO,CAAC,CAAC;IACzD,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 { Range2d, Range3d } from \"../../geometry3d/Range\";\r\nimport { LowAndHighXY } from \"../../geometry3d/XYZProps\";\r\nimport { GriddedRaggedRange2dSet } from \"./GriddedRaggedRange2dSet\";\r\nimport { LinearSearchRange2dArray } from \"./LinearSearchRange2dArray\";\r\n\r\n/**\r\n * Use GriddedRaggedRange2dSetWithOverflow for searching among many ranges for which\r\n * * Most ranges are of somewhat consistent size.\r\n * * A modest number of oversizes.\r\n * * Maintain the smallish ones in a GriddedRaggedRange2dSet.\r\n * * Maintain the overflows in a LinearSearchRange2dArray\r\n * @internal\r\n */\r\nexport class GriddedRaggedRange2dSetWithOverflow<T> {\r\n  private _gridSet: GriddedRaggedRange2dSet<T>;\r\n  private _overflowSet: LinearSearchRange2dArray<T>;\r\n  private constructor(gridSet: GriddedRaggedRange2dSet<T>, overflowSet: LinearSearchRange2dArray<T>) {\r\n    this._gridSet = gridSet;\r\n    this._overflowSet = overflowSet;\r\n  }\r\n  /**\r\n   * Create an (empty) set of ranges.\r\n   * @param range\r\n   * @param numXEdge\r\n   * @param numYEdge\r\n   */\r\n  public static create<T>(range: Range2d, numXEdge: number, numYEdge: number): GriddedRaggedRange2dSetWithOverflow<T> | undefined {\r\n    const grids = GriddedRaggedRange2dSet.create<T>(range.clone(), numXEdge, numYEdge);\r\n    if (grids)\r\n      return new GriddedRaggedRange2dSetWithOverflow<T>(grids, new LinearSearchRange2dArray<T>());\r\n    return undefined;\r\n  }\r\n  /**\r\n   * * Search for ranges containing testRange\r\n   * * Pass each range and tag to handler\r\n   * * terminate search if handler returns false.\r\n   * @param testRange search range.\r\n   * @param handler function to receive range and tag hits.\r\n   * @return false if search terminated by handler.  Return true if no handler returned false.\r\n   */\r\n  public searchXY(x: number, y: number, handler: (range: Range2d, tag: T) => boolean): boolean {\r\n    return this._gridSet.searchXY(x, y, handler) && this._overflowSet.searchXY(x, y, handler);\r\n  }\r\n  /**\r\n   * * Search for ranges overlapping testRange\r\n   * * Pass each range and tag to handler\r\n   * * terminate search if handler returns false.\r\n   * @param testRange search range.\r\n   * @param handler function to receive range and tag hits.\r\n   * @return false if search terminated by handler.  Return true if no handler returned false.\r\n   */\r\n  public searchRange2d(testRange: LowAndHighXY, handler: (range: Range2d, tag: T) => boolean): boolean {\r\n    return this._gridSet.searchRange2d(testRange, handler) && this._overflowSet.searchRange2d(testRange, handler);\r\n  }\r\n  /** If possible, insert a range into the set.\r\n   * * Decline to insert (and return false) if\r\n   *   * range is null\r\n   *   * range is not completely contained in the overall range of this set.\r\n   *   * range x or y extent is larger than 2 grid blocks.\r\n   */\r\n  public addRange(range: Range2d | Range3d, tag: T): void {\r\n    if (!range.isNull) {\r\n      if (!this._gridSet.conditionalInsert(range, tag))\r\n        this._overflowSet.addRange(range, tag);\r\n    }\r\n  }\r\n  public visitChildren(initialDepth: number, handler: (depth: number, child: LinearSearchRange2dArray<T>) => void) {\r\n    handler(initialDepth, this._overflowSet);\r\n    this._gridSet.visitChildren(initialDepth + 1, handler);\r\n  }\r\n}\r\n"]}

package/lib/esm/polyface/multiclip/LinearSearchRange2dArray.d.ts

@@ -0,0 +1,44 @@
+/** @packageDocumentation
+ * @module RangeSearch
+ */
+import { Range2d } from "../../geometry3d/Range";
+import { LowAndHighXY } from "../../geometry3d/XYZProps";
+import { Range2dSearchInterface } from "./Range2dSearchInterface";
+/**
+ * * Array of Range2d
+ * * user data tag attached to each range via cast as (any).userTag.
+ * * Search operations are simple linear.
+ * * This class can be used directly for "smallish" range sets, or as the leaf level of hierarchical structures for larger range sets.
+ * *
+ * @internal
+ */
+export declare class LinearSearchRange2dArray<T> implements Range2dSearchInterface<T> {
+    private _rangeArray;
+    private _isDirty;
+    private _compositeRange;
+    constructor();
+    private updateForSearch;
+    /** Return the overall range of all member ranges. */
+    totalRange(result?: Range2d): Range2d;
+    /** Add a range to the search set. */
+    addRange(range: LowAndHighXY, tag: T): void;
+    /**
+     * * Search for ranges containing testRange
+     * * Pass each range and tag to handler
+     * * terminate search if handler returns false.
+     * @param testRange search range.
+     * @param handler function to receive range and tag hits.
+     * @return false if search terminated by handler.  Return true if no handler returned false.
+     */
+    searchXY(x: number, y: number, handler: (range: Range2d, tag: T) => boolean): boolean;
+    /**
+     * * Search for ranges overlapping testRange
+     * * Pass each range and tag to handler
+     * * terminate search if handler returns false.
+     * @param testRange search range.
+     * @param handler function to receive range and tag hits.
+     * @return false if search terminated by handler.  Return true if no handler returned false.
+     */
+    searchRange2d(testRange: LowAndHighXY, handler: (range: Range2d, tag: T) => boolean): boolean;
+}
+//# sourceMappingURL=LinearSearchRange2dArray.d.ts.map

package/lib/esm/polyface/multiclip/LinearSearchRange2dArray.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"LinearSearchRange2dArray.d.ts","sourceRoot":"","sources":["../../../../src/polyface/multiclip/LinearSearchRange2dArray.ts"],"names":[],"mappings":"AAIA;;GAEG;AAEH,OAAO,EAAE,OAAO,EAAE,MAAM,wBAAwB,CAAC;AACjD,OAAO,EAAE,YAAY,EAAE,MAAM,2BAA2B,CAAC;AACzD,OAAO,EAAE,sBAAsB,EAAE,MAAM,0BAA0B,CAAC;AAElE;;;;;;;GAOG;AACH,qBAAa,wBAAwB,CAAC,CAAC,CAAE,YAAW,sBAAsB,CAAC,CAAC,CAAC;IAC3E,OAAO,CAAC,WAAW,CAAY;IAC/B,OAAO,CAAC,QAAQ,CAAU;IAC1B,OAAO,CAAC,eAAe,CAAU;;IAOjC,OAAO,CAAC,eAAe;IAGvB,qDAAqD;IAC9C,UAAU,CAAC,MAAM,CAAC,EAAE,OAAO,GAAG,OAAO;IAI5C,qCAAqC;IAC9B,QAAQ,CAAC,KAAK,EAAE,YAAY,EAAE,GAAG,EAAE,CAAC;IAS3C;;;;;;;OAOG;IACI,QAAQ,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,KAAK,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,KAAK,OAAO,GAAG,OAAO;IAW5F;;;;;;;OAOG;IACI,aAAa,CAAC,SAAS,EAAE,YAAY,EAAE,OAAO,EAAE,CAAC,KAAK,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,KAAK,OAAO,GAAG,OAAO;CAUrG"}

package/lib/esm/polyface/multiclip/LinearSearchRange2dArray.js

@@ -0,0 +1,80 @@
+/*---------------------------------------------------------------------------------------------
+* 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 { Range2d } from "../../geometry3d/Range";
+/**
+ * * Array of Range2d
+ * * user data tag attached to each range via cast as (any).userTag.
+ * * Search operations are simple linear.
+ * * This class can be used directly for "smallish" range sets, or as the leaf level of hierarchical structures for larger range sets.
+ * *
+ * @internal
+ */
+export class LinearSearchRange2dArray {
+    constructor() {
+        this._rangeArray = [];
+        this._isDirty = false;
+        this._compositeRange = Range2d.createNull();
+    }
+    // TODO: build search structure
+    updateForSearch() {
+        this._isDirty = false;
+    }
+    /** Return the overall range of all member ranges. */
+    totalRange(result) {
+        result = result ? result : Range2d.createNull();
+        return this._compositeRange.clone(result);
+    }
+    /** Add a range to the search set. */
+    addRange(range, tag) {
+        this._isDirty = true;
+        const myRange = Range2d.createNull();
+        myRange.tag = tag;
+        myRange.extendXY(range.low.x, range.low.y);
+        myRange.extendXY(range.high.x, range.high.y);
+        this._compositeRange.extendRange(myRange);
+        this._rangeArray.push(myRange);
+    }
+    /**
+     * * Search for ranges containing testRange
+     * * Pass each range and tag to handler
+     * * terminate search if handler returns false.
+     * @param testRange search range.
+     * @param handler function to receive range and tag hits.
+     * @return false if search terminated by handler.  Return true if no handler returned false.
+     */
+    searchXY(x, y, handler) {
+        if (this._isDirty)
+            this.updateForSearch();
+        // NEEDS WORK: Linear search here -- do better!
+        for (const candidate of this._rangeArray) {
+            if (candidate.containsXY(x, y))
+                if (!handler(candidate, candidate.tag))
+                    return false;
+        }
+        return true;
+    }
+    /**
+     * * Search for ranges overlapping testRange
+     * * Pass each range and tag to handler
+     * * terminate search if handler returns false.
+     * @param testRange search range.
+     * @param handler function to receive range and tag hits.
+     * @return false if search terminated by handler.  Return true if no handler returned false.
+     */
+    searchRange2d(testRange, handler) {
+        if (this._isDirty)
+            this.updateForSearch();
+        for (const candidate of this._rangeArray) {
+            if (candidate.intersectsRange(testRange))
+                if (!handler(candidate, candidate.tag))
+                    return false;
+        }
+        return true;
+    }
+}
+//# sourceMappingURL=LinearSearchRange2dArray.js.map

package/lib/esm/polyface/multiclip/LinearSearchRange2dArray.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"LinearSearchRange2dArray.js","sourceRoot":"","sources":["../../../../src/polyface/multiclip/LinearSearchRange2dArray.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH,OAAO,EAAE,OAAO,EAAE,MAAM,wBAAwB,CAAC;AAIjD;;;;;;;GAOG;AACH,MAAM,OAAO,wBAAwB;IAInC;QACE,IAAI,CAAC,WAAW,GAAG,EAAE,CAAC;QACtB,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC;QACtB,IAAI,CAAC,eAAe,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;IAC9C,CAAC;IACD,+BAA+B;IACvB,eAAe;QACrB,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC;IACxB,CAAC;IACD,qDAAqD;IAC9C,UAAU,CAAC,MAAgB;QAChC,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,UAAU,EAAE,CAAC;QAChD,OAAO,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IAC5C,CAAC;IACD,qCAAqC;IAC9B,QAAQ,CAAC,KAAmB,EAAE,GAAM;QACzC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;QACrB,MAAM,OAAO,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;QACpC,OAAe,CAAC,GAAG,GAAG,GAAG,CAAC;QAC3B,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC3C,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7C,IAAI,CAAC,eAAe,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;QAC1C,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACjC,CAAC;IACD;;;;;;;OAOG;IACI,QAAQ,CAAC,CAAS,EAAE,CAAS,EAAE,OAA4C;QAChF,IAAI,IAAI,CAAC,QAAQ;YACf,IAAI,CAAC,eAAe,EAAE,CAAC;QACzB,+CAA+C;QAC/C,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,WAAW,EAAE;YACxC,IAAI,SAAS,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC,CAAC;gBAC5B,IAAI,CAAC,OAAO,CAAC,SAAS,EAAG,SAAiB,CAAC,GAAG,CAAC;oBAC7C,OAAO,KAAK,CAAC;SAClB;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;;;;;;OAOG;IACI,aAAa,CAAC,SAAuB,EAAE,OAA4C;QACxF,IAAI,IAAI,CAAC,QAAQ;YACf,IAAI,CAAC,eAAe,EAAE,CAAC;QACzB,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,WAAW,EAAE;YACxC,IAAI,SAAS,CAAC,eAAe,CAAC,SAAS,CAAC;gBACtC,IAAI,CAAC,OAAO,CAAC,SAAS,EAAG,SAAiB,CAAC,GAAG,CAAC;oBAC7C,OAAO,KAAK,CAAC;SAClB;QACD,OAAO,IAAI,CAAC;IACd,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 { Range2d } from \"../../geometry3d/Range\";\r\nimport { LowAndHighXY } from \"../../geometry3d/XYZProps\";\r\nimport { Range2dSearchInterface } from \"./Range2dSearchInterface\";\r\n\r\n/**\r\n * * Array of Range2d\r\n * * user data tag attached to each range via cast as (any).userTag.\r\n * * Search operations are simple linear.\r\n * * This class can be used directly for \"smallish\" range sets, or as the leaf level of hierarchical structures for larger range sets.\r\n * *\r\n * @internal\r\n */\r\nexport class LinearSearchRange2dArray<T> implements Range2dSearchInterface<T> {\r\n  private _rangeArray: Range2d[];\r\n  private _isDirty: boolean;\r\n  private _compositeRange: Range2d;\r\n  public constructor() {\r\n    this._rangeArray = [];\r\n    this._isDirty = false;\r\n    this._compositeRange = Range2d.createNull();\r\n  }\r\n  // TODO: build search structure\r\n  private updateForSearch() {\r\n    this._isDirty = false;\r\n  }\r\n  /** Return the overall range of all member ranges. */\r\n  public totalRange(result?: Range2d): Range2d {\r\n    result = result ? result : Range2d.createNull();\r\n    return this._compositeRange.clone(result);\r\n  }\r\n  /** Add a range to the search set. */\r\n  public addRange(range: LowAndHighXY, tag: T) {\r\n    this._isDirty = true;\r\n    const myRange = Range2d.createNull();\r\n    (myRange as any).tag = tag;\r\n    myRange.extendXY(range.low.x, range.low.y);\r\n    myRange.extendXY(range.high.x, range.high.y);\r\n    this._compositeRange.extendRange(myRange);\r\n    this._rangeArray.push(myRange);\r\n  }\r\n  /**\r\n   * * Search for ranges containing testRange\r\n   * * Pass each range and tag to handler\r\n   * * terminate search if handler returns false.\r\n   * @param testRange search range.\r\n   * @param handler function to receive range and tag hits.\r\n   * @return false if search terminated by handler.  Return true if no handler returned false.\r\n   */\r\n  public searchXY(x: number, y: number, handler: (range: Range2d, tag: T) => boolean): boolean {\r\n    if (this._isDirty)\r\n      this.updateForSearch();\r\n    // NEEDS WORK: Linear search here -- do better!\r\n    for (const candidate of this._rangeArray) {\r\n      if (candidate.containsXY(x, y))\r\n        if (!handler(candidate, (candidate as any).tag))\r\n          return false;\r\n    }\r\n    return true;\r\n  }\r\n  /**\r\n   * * Search for ranges overlapping testRange\r\n   * * Pass each range and tag to handler\r\n   * * terminate search if handler returns false.\r\n   * @param testRange search range.\r\n   * @param handler function to receive range and tag hits.\r\n   * @return false if search terminated by handler.  Return true if no handler returned false.\r\n   */\r\n  public searchRange2d(testRange: LowAndHighXY, handler: (range: Range2d, tag: T) => boolean): boolean {\r\n    if (this._isDirty)\r\n      this.updateForSearch();\r\n    for (const candidate of this._rangeArray) {\r\n      if (candidate.intersectsRange(testRange))\r\n        if (!handler(candidate, (candidate as any).tag))\r\n          return false;\r\n    }\r\n    return true;\r\n  }\r\n}\r\n"]}

package/lib/esm/polyface/multiclip/Range2dSearchInterface.d.ts

@@ -0,0 +1,32 @@
+/** @packageDocumentation
+ * @module RangeSearch
+ */
+import { Range2d } from "../../geometry3d/Range";
+import { LowAndHighXY } from "../../geometry3d/XYZProps";
+/**
+ * Interface for classes that can search with range optimizations.
+ * @public
+ */
+export interface Range2dSearchInterface<T> {
+    /**
+     * * Search for ranges containing testRange
+     * * Pass each range and tag to handler
+     * * terminate search if handler returns false.
+     * @param testRange search range.
+     * @param handler function to receive range and tag hits.  "true" means continue the search.
+     * @returns false if any handler call returned false.  Otherwise return true.
+     */
+    searchXY(x: number, y: number, handler: (range: Range2d, tag: T) => boolean): boolean;
+    /**
+     * * Search for ranges overlapping testRange
+     * * Pass each range and tag to handler
+     * * terminate search if handler returns false.
+     * @param testRange search range.
+     * @param handler function to receive range and tag hits.  "true" means continue the search.
+     * @returns false if any handler call returned false.  Otherwise return true.
+     */
+    searchRange2d(testRange: LowAndHighXY, handler: (range: Range2d, tag: T) => boolean): boolean;
+    /** Add a range to the search set. */
+    addRange(range: LowAndHighXY, tag: T): void;
+}
+//# sourceMappingURL=Range2dSearchInterface.d.ts.map

package/lib/esm/polyface/multiclip/Range2dSearchInterface.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"Range2dSearchInterface.d.ts","sourceRoot":"","sources":["../../../../src/polyface/multiclip/Range2dSearchInterface.ts"],"names":[],"mappings":"AAIA;;GAEG;AAEH,OAAO,EAAE,OAAO,EAAE,MAAM,wBAAwB,CAAC;AACjD,OAAO,EAAE,YAAY,EAAE,MAAM,2BAA2B,CAAC;AAEzD;;;GAGG;AACH,MAAM,WAAW,sBAAsB,CAAC,CAAC;IACvC;;;;;;;OAOG;IACH,QAAQ,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,KAAK,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,KAAK,OAAO,GAAG,OAAO,CAAC;IACtF;;;;;;;OAOG;IACH,aAAa,CAAC,SAAS,EAAE,YAAY,EAAE,OAAO,EAAE,CAAC,KAAK,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,KAAK,OAAO,GAAG,OAAO,CAAC;IAC9F,qCAAqC;IACrC,QAAQ,CAAC,KAAK,EAAE,YAAY,EAAE,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC;CAC7C"}

package/lib/esm/polyface/multiclip/Range2dSearchInterface.js

@@ -0,0 +1,9 @@
+/*---------------------------------------------------------------------------------------------
+* 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
+ */
+export {};
+//# sourceMappingURL=Range2dSearchInterface.js.map

package/lib/esm/polyface/multiclip/Range2dSearchInterface.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Range2dSearchInterface.js","sourceRoot":"","sources":["../../../../src/polyface/multiclip/Range2dSearchInterface.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG","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 { Range2d } from \"../../geometry3d/Range\";\r\nimport { LowAndHighXY } from \"../../geometry3d/XYZProps\";\r\n\r\n/**\r\n * Interface for classes that can search with range optimizations.\r\n * @public\r\n */\r\nexport interface Range2dSearchInterface<T> {\r\n  /**\r\n   * * Search for ranges containing testRange\r\n   * * Pass each range and tag to handler\r\n   * * terminate search if handler returns false.\r\n   * @param testRange search range.\r\n   * @param handler function to receive range and tag hits.  \"true\" means continue the search.\r\n   * @returns false if any handler call returned false.  Otherwise return true.\r\n   */\r\n  searchXY(x: number, y: number, handler: (range: Range2d, tag: T) => boolean): boolean;\r\n  /**\r\n   * * Search for ranges overlapping testRange\r\n   * * Pass each range and tag to handler\r\n   * * terminate search if handler returns false.\r\n   * @param testRange search range.\r\n   * @param handler function to receive range and tag hits.  \"true\" means continue the search.\r\n   * @returns false if any handler call returned false.  Otherwise return true.\r\n   */\r\n  searchRange2d(testRange: LowAndHighXY, handler: (range: Range2d, tag: T) => boolean): boolean;\r\n  /** Add a range to the search set. */\r\n  addRange(range: LowAndHighXY, tag: T): void;\r\n}\r\n"]}

package/lib/esm/polyface/multiclip/RangeSearch.d.ts

@@ -0,0 +1,27 @@
+/** @packageDocumentation
+ * @module RangeSearch
+ */
+import { UsageSums } from "../../numerics/UsageSums";
+import { RangeLengthData } from "../RangeLengthData";
+import { Range2dSearchInterface } from "./Range2dSearchInterface";
+/** Class with static members to work with various range searchers. */
+export declare class RangeSearch {
+    static readonly smallCountLimit = 40;
+    /** Target size for grid block size divided by representative per-entry range size. */
+    static readonly defaultRangesPerBlockEdge = 4;
+    /** the "representative range size"is the mean range size plus this number of standard deviations */
+    static readonly defaultStandardDeviationAdjustment = 1;
+    /** Based on range count and distribution, return an object which can answer 2d range queries */
+    static create2dSearcherForRangeLengthData<T>(rangeLengthData: RangeLengthData, rangesPerBlockEdge?: number, standardDeviationAdjustment?: number): Range2dSearchInterface<T> | undefined;
+    /** Return the number of grid bocks (in one direction) for
+     * * The total range length in this direction
+     * * individual ranges whose count, mean and standard deviation are available in the sums.
+     * @param totalRange the total range being searched (in this direction)
+     * @param sums source for mean, count, and standard deviation of individual ranges
+     * @param rangesPerBlockEdge target ratio of edge length in search blocks divided by representative length of individual range edges
+     * @param standardDeviationAdjustment the number of standard deviations above the mean to be applied to convert mean to representative length.  Typically 0 to 1.
+     * @returns number of blocks in grid.
+     */
+    static estimateGridBlockCount(totalLength: number, sums: UsageSums, rangesPerBlockEdge?: number, standardDeviationAdjustment?: number): number;
+}
+//# sourceMappingURL=RangeSearch.d.ts.map

package/lib/esm/polyface/multiclip/RangeSearch.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"RangeSearch.d.ts","sourceRoot":"","sources":["../../../../src/polyface/multiclip/RangeSearch.ts"],"names":[],"mappings":"AAIA;;GAEG;AAIH,OAAO,EAAE,SAAS,EAAE,MAAM,0BAA0B,CAAC;AACrD,OAAO,EAAE,eAAe,EAAE,MAAM,oBAAoB,CAAC;AAGrD,OAAO,EAAE,sBAAsB,EAAE,MAAM,0BAA0B,CAAC;AAElE,sEAAsE;AACtE,qBAAa,WAAW;IACtB,gBAAuB,eAAe,MAAM;IAC5C,sFAAsF;IACtF,gBAAuB,yBAAyB,KAAK;IACrD,oGAAoG;IACpG,gBAAuB,kCAAkC,KAAO;IAChE,gGAAgG;WAClF,kCAAkC,CAAC,CAAC,EAAE,eAAe,EAAE,eAAe,EAAE,kBAAkB,GAAE,MAA8C,EAAE,2BAA2B,GAAE,MAAuD,GAAG,sBAAsB,CAAC,CAAC,CAAC,GAAG,SAAS;IAUtR;;;;;;;;OAQG;WACW,sBAAsB,CAAC,WAAW,EAAE,MAAM,EAAE,IAAI,EAAE,SAAS,EAAE,kBAAkB,GAAE,MAA8C,EAAE,2BAA2B,GAAE,MAAuD,GAAG,MAAM;CAS7O"}

package/lib/esm/polyface/multiclip/RangeSearch.js

@@ -0,0 +1,49 @@
+/*---------------------------------------------------------------------------------------------
+* 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 { Geometry } from "../../Geometry";
+import { Range2d } from "../../geometry3d/Range";
+import { GriddedRaggedRange2dSetWithOverflow } from "./GriddedRaggedRange2dSetWithOverflow";
+import { LinearSearchRange2dArray } from "./LinearSearchRange2dArray";
+/** Class with static members to work with various range searchers. */
+export class RangeSearch {
+    /** Based on range count and distribution, return an object which can answer 2d range queries */
+    static create2dSearcherForRangeLengthData(rangeLengthData, rangesPerBlockEdge = RangeSearch.defaultRangesPerBlockEdge, standardDeviationAdjustment = RangeSearch.defaultStandardDeviationAdjustment) {
+        // for smallish sets, just linear search  . . ..
+        if (rangeLengthData.xSums.count < RangeSearch.smallCountLimit)
+            return new LinearSearchRange2dArray();
+        const numXBlock = this.estimateGridBlockCount(rangeLengthData.range.xLength(), rangeLengthData.xSums, rangesPerBlockEdge, standardDeviationAdjustment);
+        const numYBlock = this.estimateGridBlockCount(rangeLengthData.range.yLength(), rangeLengthData.ySums, rangesPerBlockEdge, standardDeviationAdjustment);
+        if (numXBlock < 2 && numYBlock < 2)
+            return new LinearSearchRange2dArray();
+        return GriddedRaggedRange2dSetWithOverflow.create(Range2d.createFrom(rangeLengthData.range), numXBlock, numYBlock);
+    }
+    /** Return the number of grid bocks (in one direction) for
+     * * The total range length in this direction
+     * * individual ranges whose count, mean and standard deviation are available in the sums.
+     * @param totalRange the total range being searched (in this direction)
+     * @param sums source for mean, count, and standard deviation of individual ranges
+     * @param rangesPerBlockEdge target ratio of edge length in search blocks divided by representative length of individual range edges
+     * @param standardDeviationAdjustment the number of standard deviations above the mean to be applied to convert mean to representative length.  Typically 0 to 1.
+     * @returns number of blocks in grid.
+     */
+    static estimateGridBlockCount(totalLength, sums, rangesPerBlockEdge = RangeSearch.defaultRangesPerBlockEdge, standardDeviationAdjustment = RangeSearch.defaultStandardDeviationAdjustment) {
+        if (sums.count < 1)
+            return 1;
+        const representativeRangeLength = rangesPerBlockEdge * (sums.mean + standardDeviationAdjustment * sums.standardDeviation);
+        const gridEdgeLength = Geometry.conditionalDivideFraction(totalLength, representativeRangeLength);
+        if (gridEdgeLength === undefined)
+            return 1;
+        return Math.ceil(gridEdgeLength);
+    }
+}
+RangeSearch.smallCountLimit = 40;
+/** Target size for grid block size divided by representative per-entry range size. */
+RangeSearch.defaultRangesPerBlockEdge = 4;
+/** the "representative range size"is the mean range size plus this number of standard deviations */
+RangeSearch.defaultStandardDeviationAdjustment = 1.0;
+//# sourceMappingURL=RangeSearch.js.map

package/lib/esm/polyface/multiclip/RangeSearch.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"RangeSearch.js","sourceRoot":"","sources":["../../../../src/polyface/multiclip/RangeSearch.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAC1C,OAAO,EAAE,OAAO,EAAE,MAAM,wBAAwB,CAAC;AAGjD,OAAO,EAAE,mCAAmC,EAAE,MAAM,uCAAuC,CAAC;AAC5F,OAAO,EAAE,wBAAwB,EAAE,MAAM,4BAA4B,CAAC;AAGtE,sEAAsE;AACtE,MAAM,OAAO,WAAW;IAMtB,gGAAgG;IACzF,MAAM,CAAC,kCAAkC,CAAI,eAAgC,EAAE,qBAA6B,WAAW,CAAC,yBAAyB,EAAE,8BAAsC,WAAW,CAAC,kCAAkC;QAC5O,gDAAgD;QAChD,IAAI,eAAe,CAAC,KAAK,CAAC,KAAK,GAAG,WAAW,CAAC,eAAe;YAC3D,OAAO,IAAI,wBAAwB,EAAE,CAAC;QACxC,MAAM,SAAS,GAAG,IAAI,CAAC,sBAAsB,CAAC,eAAe,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,eAAe,CAAC,KAAK,EAAE,kBAAkB,EAAE,2BAA2B,CAAC,CAAC;QACvJ,MAAM,SAAS,GAAG,IAAI,CAAC,sBAAsB,CAAC,eAAe,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,eAAe,CAAC,KAAK,EAAE,kBAAkB,EAAE,2BAA2B,CAAC,CAAC;QACvJ,IAAI,SAAS,GAAG,CAAC,IAAI,SAAS,GAAG,CAAC;YAChC,OAAO,IAAI,wBAAwB,EAAE,CAAC;QACxC,OAAO,mCAAmC,CAAC,MAAM,CAAI,OAAO,CAAC,UAAU,CAAC,eAAe,CAAC,KAAK,CAAC,EAAE,SAAS,EAAE,SAAS,CAAC,CAAC;IACxH,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,sBAAsB,CAAC,WAAmB,EAAE,IAAe,EAAE,qBAA6B,WAAW,CAAC,yBAAyB,EAAE,8BAAsC,WAAW,CAAC,kCAAkC;QACjO,IAAI,IAAI,CAAC,KAAK,GAAG,CAAC;YAChB,OAAO,CAAC,CAAC;QACX,MAAM,yBAAyB,GAAG,kBAAkB,GAAG,CAAC,IAAI,CAAC,IAAI,GAAG,2BAA2B,GAAG,IAAI,CAAC,iBAAiB,CAAC,CAAC;QAC1H,MAAM,cAAc,GAAG,QAAQ,CAAC,yBAAyB,CAAC,WAAW,EAAE,yBAAyB,CAAC,CAAC;QAClG,IAAI,cAAc,KAAK,SAAS;YAC9B,OAAO,CAAC,CAAC;QACX,OAAO,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;IACnC,CAAC;;AAjCsB,2BAAe,GAAG,EAAE,CAAC;AAC5C,sFAAsF;AAC/D,qCAAyB,GAAG,CAAC,CAAC;AACrD,oGAAoG;AAC7E,8CAAkC,GAAG,GAAG,CAAC","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 { Geometry } from \"../../Geometry\";\r\nimport { Range2d } from \"../../geometry3d/Range\";\r\nimport { UsageSums } from \"../../numerics/UsageSums\";\r\nimport { RangeLengthData } from \"../RangeLengthData\";\r\nimport { GriddedRaggedRange2dSetWithOverflow } from \"./GriddedRaggedRange2dSetWithOverflow\";\r\nimport { LinearSearchRange2dArray } from \"./LinearSearchRange2dArray\";\r\nimport { Range2dSearchInterface } from \"./Range2dSearchInterface\";\r\n\r\n/** Class with static members to work with various range searchers. */\r\nexport class RangeSearch {\r\n  public static readonly smallCountLimit = 40;\r\n  /** Target size for grid block size divided by representative per-entry range size. */\r\n  public static readonly defaultRangesPerBlockEdge = 4;\r\n  /** the \"representative range size\"is the mean range size plus this number of standard deviations */\r\n  public static readonly defaultStandardDeviationAdjustment = 1.0;\r\n  /** Based on range count and distribution, return an object which can answer 2d range queries */\r\n  public static create2dSearcherForRangeLengthData<T>(rangeLengthData: RangeLengthData, rangesPerBlockEdge: number = RangeSearch.defaultRangesPerBlockEdge, standardDeviationAdjustment: number = RangeSearch.defaultStandardDeviationAdjustment): Range2dSearchInterface<T> | undefined {\r\n    // for smallish sets, just linear search  . . ..\r\n    if (rangeLengthData.xSums.count < RangeSearch.smallCountLimit)\r\n      return new LinearSearchRange2dArray();\r\n    const numXBlock = this.estimateGridBlockCount(rangeLengthData.range.xLength(), rangeLengthData.xSums, rangesPerBlockEdge, standardDeviationAdjustment);\r\n    const numYBlock = this.estimateGridBlockCount(rangeLengthData.range.yLength(), rangeLengthData.ySums, rangesPerBlockEdge, standardDeviationAdjustment);\r\n    if (numXBlock < 2 && numYBlock < 2)\r\n      return new LinearSearchRange2dArray();\r\n    return GriddedRaggedRange2dSetWithOverflow.create<T>(Range2d.createFrom(rangeLengthData.range), numXBlock, numYBlock);\r\n  }\r\n  /** Return the number of grid bocks (in one direction) for\r\n   * * The total range length in this direction\r\n   * * individual ranges whose count, mean and standard deviation are available in the sums.\r\n   * @param totalRange the total range being searched (in this direction)\r\n   * @param sums source for mean, count, and standard deviation of individual ranges\r\n   * @param rangesPerBlockEdge target ratio of edge length in search blocks divided by representative length of individual range edges\r\n   * @param standardDeviationAdjustment the number of standard deviations above the mean to be applied to convert mean to representative length.  Typically 0 to 1.\r\n   * @returns number of blocks in grid.\r\n   */\r\n  public static estimateGridBlockCount(totalLength: number, sums: UsageSums, rangesPerBlockEdge: number = RangeSearch.defaultRangesPerBlockEdge, standardDeviationAdjustment: number = RangeSearch.defaultStandardDeviationAdjustment): number {\r\n    if (sums.count < 1)\r\n      return 1;\r\n    const representativeRangeLength = rangesPerBlockEdge * (sums.mean + standardDeviationAdjustment * sums.standardDeviation);\r\n    const gridEdgeLength = Geometry.conditionalDivideFraction(totalLength, representativeRangeLength);\r\n    if (gridEdgeLength === undefined)\r\n      return 1;\r\n    return Math.ceil(gridEdgeLength);\r\n  }\r\n}\r\n"]}

package/lib/esm/polyface/multiclip/SweepLineStringToFacetContext.d.ts

@@ -0,0 +1,25 @@
+/** @packageDocumentation
+ * @module Polyface
+ */
+import { GrowableXYZArray } from "../../geometry3d/GrowableXYZArray";
+import { AnnounceDrapePanel } from "../PolyfaceQuery";
+import { Polyface } from "../Polyface";
+export declare class SweepLineStringToFacetContext {
+    private _spacePoints;
+    private _spacePointsRange;
+    private _numSpacePoints;
+    private constructor();
+    static create(xyz: GrowableXYZArray): SweepLineStringToFacetContext | undefined;
+    private _segmentPoint0;
+    private _segmentPoint1;
+    private _localSegmentPoint0;
+    private _localSegmentPoint1;
+    private _clipFractions;
+    private _localFrame;
+    private _polygonRange;
+    /** process a single polygon.
+     * @returns number crudely indicating how much work was done.
+     */
+    projectToPolygon(polygon: GrowableXYZArray, announce: AnnounceDrapePanel, polyface: Polyface, readIndex: number): number;
+}
+//# sourceMappingURL=SweepLineStringToFacetContext.d.ts.map

package/lib/esm/polyface/multiclip/SweepLineStringToFacetContext.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"SweepLineStringToFacetContext.d.ts","sourceRoot":"","sources":["../../../../src/polyface/multiclip/SweepLineStringToFacetContext.ts"],"names":[],"mappings":"AAIA;;GAEG;AAGH,OAAO,EAAE,gBAAgB,EAAE,MAAM,mCAAmC,CAAC;AAGrE,OAAO,EAAE,kBAAkB,EAAE,MAAM,kBAAkB,CAAC;AAGtD,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAEvC,qBAAa,6BAA6B;IACxC,OAAO,CAAC,YAAY,CAAmB;IACvC,OAAO,CAAC,iBAAiB,CAAU;IACnC,OAAO,CAAC,eAAe,CAAS;IAChC,OAAO;WAMO,MAAM,CAAC,GAAG,EAAE,gBAAgB,GAAG,6BAA6B,GAAG,SAAS;IAQtF,OAAO,CAAC,cAAc,CAAoB;IAC1C,OAAO,CAAC,cAAc,CAAoB;IAC1C,OAAO,CAAC,mBAAmB,CAAoB;IAC/C,OAAO,CAAC,mBAAmB,CAAoB;IAC/C,OAAO,CAAC,cAAc,CAA0B;IAChD,OAAO,CAAC,WAAW,CAA8B;IACjD,OAAO,CAAC,aAAa,CAAoB;IAEzC;;OAEG;IACI,gBAAgB,CAAC,OAAO,EAAE,gBAAgB,EAAE,QAAQ,EAAE,kBAAkB,EAAE,QAAQ,EAAE,QAAQ,EAAE,SAAS,EAAE,MAAM,GAAG,MAAM;CAoDhI"}

package/lib/esm/polyface/multiclip/SweepLineStringToFacetContext.js

@@ -0,0 +1,90 @@
+/*---------------------------------------------------------------------------------------------
+* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+* See LICENSE.md in the project root for license terms and full copyright notice.
+*--------------------------------------------------------------------------------------------*/
+/** @packageDocumentation
+ * @module Polyface
+ */
+import { Transform } from "../../geometry3d/Transform";
+import { Point3d } from "../../geometry3d/Point3dVector3d";
+import { Segment1d } from "../../geometry3d/Segment1d";
+import { Range3d } from "../../geometry3d/Range";
+import { Geometry } from "../../Geometry";
+export class SweepLineStringToFacetContext {
+    constructor(spacePoints) {
+        // temporaries reused over multiple calls to process a single facet . ..
+        this._segmentPoint0 = Point3d.create();
+        this._segmentPoint1 = Point3d.create();
+        this._localSegmentPoint0 = Point3d.create();
+        this._localSegmentPoint1 = Point3d.create();
+        this._clipFractions = Segment1d.create(0, 1);
+        this._localFrame = Transform.createIdentity();
+        this._polygonRange = Range3d.create();
+        this._spacePoints = spacePoints;
+        this._spacePointsRange = new Range3d();
+        spacePoints.setRange(this._spacePointsRange);
+        this._numSpacePoints = this._spacePoints.length;
+    }
+    static create(xyz) {
+        if (xyz.length > 1) {
+            return new SweepLineStringToFacetContext(xyz.clone());
+        }
+        return undefined;
+    }
+    /** process a single polygon.
+     * @returns number crudely indicating how much work was done.
+     */
+    projectToPolygon(polygon, announce, polyface, readIndex) {
+        polygon.setRange(this._polygonRange);
+        let workCounter = 0;
+        if (!this._polygonRange.intersectsRangeXY(this._spacePointsRange))
+            return workCounter;
+        // numTest++;
+        // For each triangle within the facet ...
+        // remark: this loop only runs once in triangle mesh, twice in quads ...
+        for (let k1 = 1; k1 + 1 < polygon.length; k1++) {
+            workCounter++;
+            const frame = polygon.fillLocalXYTriangleFrame(0, k1, k1 + 1, this._localFrame);
+            if (frame) {
+                // For each stroke of the linestring ...
+                for (let i1 = 1; i1 < this._numSpacePoints; i1++) {
+                    workCounter++;
+                    this._spacePoints.getPoint3dAtCheckedPointIndex(i1 - 1, this._segmentPoint0);
+                    this._spacePoints.getPoint3dAtCheckedPointIndex(i1, this._segmentPoint1);
+                    frame.multiplyInversePoint3d(this._segmentPoint0, this._localSegmentPoint0);
+                    frame.multiplyInversePoint3d(this._segmentPoint1, this._localSegmentPoint1);
+                    this._clipFractions.set(0, 1);
+                    /** (x,y,1-x-y) are barycentric coordinates in the triangle !!! */
+                    if (this._clipFractions.clipBy01FunctionValuesPositive(this._localSegmentPoint0.x, this._localSegmentPoint1.x)
+                        && this._clipFractions.clipBy01FunctionValuesPositive(this._localSegmentPoint0.y, this._localSegmentPoint1.y)
+                        && this._clipFractions.clipBy01FunctionValuesPositive(1 - this._localSegmentPoint0.x - this._localSegmentPoint0.y, 1 - this._localSegmentPoint1.x - this._localSegmentPoint1.y)) {
+                        /* project the local segment point to the plane. */
+                        workCounter++;
+                        const localClippedPointA = this._localSegmentPoint0.interpolate(this._clipFractions.x0, this._localSegmentPoint1);
+                        const localClippedPointB = this._localSegmentPoint0.interpolate(this._clipFractions.x1, this._localSegmentPoint1);
+                        const worldClippedPointA = this._localFrame.multiplyPoint3d(localClippedPointA);
+                        const worldClippedPointB = this._localFrame.multiplyPoint3d(localClippedPointB);
+                        const planePointA = this._localFrame.multiplyXYZ(localClippedPointA.x, localClippedPointA.y, 0.0);
+                        const planePointB = this._localFrame.multiplyXYZ(localClippedPointB.x, localClippedPointB.y, 0.0);
+                        const splitParameter = Geometry.inverseInterpolate01(this._localSegmentPoint0.z, this._localSegmentPoint1.z);
+                        // emit 1 or 2 panels, oriented so panel normal is always to the left of the line.
+                        if (splitParameter !== undefined && splitParameter > this._clipFractions.x0 && splitParameter < this._clipFractions.x1) {
+                            workCounter++;
+                            const piercePointX = this._segmentPoint0.interpolate(splitParameter, this._segmentPoint1);
+                            const piercePointY = piercePointX.clone(); // so points are distinct for the two triangle announcements.
+                            announce(this._spacePoints, i1 - 1, polyface, readIndex, [worldClippedPointA, piercePointX, planePointA], 2, 1);
+                            announce(this._spacePoints, i1 - 1, polyface, readIndex, [worldClippedPointB, piercePointY, planePointB], 1, 2);
+                        }
+                        else if (this._localSegmentPoint0.z > 0) { // segment is entirely above
+                            announce(this._spacePoints, i1 - 1, polyface, readIndex, [worldClippedPointA, worldClippedPointB, planePointB, planePointA], 3, 2);
+                        }
+                        else // segment is entirely under
+                            announce(this._spacePoints, i1 - 1, polyface, readIndex, [worldClippedPointB, worldClippedPointA, planePointA, planePointB], 2, 3);
+                    }
+                }
+            }
+        }
+        return workCounter;
+    }
+}
+//# sourceMappingURL=SweepLineStringToFacetContext.js.map

package/lib/esm/polyface/multiclip/SweepLineStringToFacetContext.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"SweepLineStringToFacetContext.js","sourceRoot":"","sources":["../../../../src/polyface/multiclip/SweepLineStringToFacetContext.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH,OAAO,EAAE,SAAS,EAAE,MAAM,4BAA4B,CAAC;AAEvD,OAAO,EAAE,OAAO,EAAE,MAAM,kCAAkC,CAAC;AAC3D,OAAO,EAAE,SAAS,EAAE,MAAM,4BAA4B,CAAC;AAEvD,OAAO,EAAE,OAAO,EAAE,MAAM,wBAAwB,CAAC;AACjD,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAG1C,MAAM,OAAO,6BAA6B;IAIxC,YAAoB,WAA6B;QAajD,wEAAwE;QAChE,mBAAc,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;QAClC,mBAAc,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;QAClC,wBAAmB,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;QACvC,wBAAmB,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;QACvC,mBAAc,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACxC,gBAAW,GAAG,SAAS,CAAC,cAAc,EAAE,CAAC;QACzC,kBAAa,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;QAnBvC,IAAI,CAAC,YAAY,GAAG,WAAW,CAAC;QAChC,IAAI,CAAC,iBAAiB,GAAG,IAAI,OAAO,EAAE,CAAC;QACvC,WAAW,CAAC,QAAQ,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC;QAC7C,IAAI,CAAC,eAAe,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC;IAClD,CAAC;IACM,MAAM,CAAC,MAAM,CAAC,GAAqB;QACxC,IAAI,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE;YAClB,OAAO,IAAI,6BAA6B,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC;SACvD;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAWD;;OAEG;IACI,gBAAgB,CAAC,OAAyB,EAAE,QAA4B,EAAE,QAAkB,EAAE,SAAiB;QACpH,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QACrC,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,iBAAiB,CAAC,IAAI,CAAC,iBAAiB,CAAC;YAC/D,OAAO,WAAW,CAAC;QACrB,aAAa;QACb,yCAAyC;QACzC,wEAAwE;QACxE,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE;YAC9C,WAAW,EAAE,CAAC;YACd,MAAM,KAAK,GAAG,OAAO,CAAC,wBAAwB,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;YAChF,IAAI,KAAK,EAAE;gBACT,wCAAwC;gBACxC,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,IAAI,CAAC,eAAe,EAAE,EAAE,EAAE,EAAE;oBAChD,WAAW,EAAE,CAAC;oBACd,IAAI,CAAC,YAAY,CAAC,6BAA6B,CAAC,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,cAAc,CAAC,CAAC;oBAC7E,IAAI,CAAC,YAAY,CAAC,6BAA6B,CAAC,EAAE,EAAE,IAAI,CAAC,cAAc,CAAC,CAAC;oBACzE,KAAK,CAAC,sBAAsB,CAAC,IAAI,CAAC,cAAc,EAAE,IAAI,CAAC,mBAAmB,CAAC,CAAC;oBAC5E,KAAK,CAAC,sBAAsB,CAAC,IAAI,CAAC,cAAc,EAAE,IAAI,CAAC,mBAAmB,CAAC,CAAC;oBAC5E,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;oBAC9B,kEAAkE;oBAClE,IAAI,IAAI,CAAC,cAAc,CAAC,8BAA8B,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC,EAAE,IAAI,CAAC,mBAAmB,CAAC,CAAC,CAAC;2BACzG,IAAI,CAAC,cAAc,CAAC,8BAA8B,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC,EAAE,IAAI,CAAC,mBAAmB,CAAC,CAAC,CAAC;2BAC1G,IAAI,CAAC,cAAc,CAAC,8BAA8B,CACnD,CAAC,GAAG,IAAI,CAAC,mBAAmB,CAAC,CAAC,GAAG,IAAI,CAAC,mBAAmB,CAAC,CAAC,EAC3D,CAAC,GAAG,IAAI,CAAC,mBAAmB,CAAC,CAAC,GAAG,IAAI,CAAC,mBAAmB,CAAC,CAAC,CAAC,EAAE;wBAChE,mDAAmD;wBACnD,WAAW,EAAE,CAAC;wBACd,MAAM,kBAAkB,GAAG,IAAI,CAAC,mBAAmB,CAAC,WAAW,CAAC,IAAI,CAAC,cAAc,CAAC,EAAE,EAAE,IAAI,CAAC,mBAAmB,CAAC,CAAC;wBAClH,MAAM,kBAAkB,GAAG,IAAI,CAAC,mBAAmB,CAAC,WAAW,CAAC,IAAI,CAAC,cAAc,CAAC,EAAE,EAAE,IAAI,CAAC,mBAAmB,CAAC,CAAC;wBAClH,MAAM,kBAAkB,GAAG,IAAI,CAAC,WAAW,CAAC,eAAe,CAAC,kBAAkB,CAAE,CAAC;wBACjF,MAAM,kBAAkB,GAAG,IAAI,CAAC,WAAW,CAAC,eAAe,CAAC,kBAAkB,CAAE,CAAC;wBACjF,MAAM,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC,kBAAkB,CAAC,CAAC,EAAE,kBAAkB,CAAC,CAAC,EAAE,GAAG,CAAE,CAAC;wBACnG,MAAM,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC,kBAAkB,CAAC,CAAC,EAAE,kBAAkB,CAAC,CAAC,EAAE,GAAG,CAAE,CAAC;wBACnG,MAAM,cAAc,GAAG,QAAQ,CAAC,oBAAoB,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC,EAAE,IAAI,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC;wBAC7G,kFAAkF;wBAClF,IAAI,cAAc,KAAK,SAAS,IAAI,cAAc,GAAG,IAAI,CAAC,cAAc,CAAC,EAAE,IAAI,cAAc,GAAG,IAAI,CAAC,cAAc,CAAC,EAAE,EAAE;4BACtH,WAAW,EAAE,CAAC;4BACd,MAAM,YAAY,GAAG,IAAI,CAAC,cAAc,CAAC,WAAW,CAAC,cAAc,EAAE,IAAI,CAAC,cAAc,CAAC,CAAC;4BAC1F,MAAM,YAAY,GAAG,YAAY,CAAC,KAAK,EAAE,CAAC,CAAG,6DAA6D;4BAC1G,QAAQ,CAAC,IAAI,CAAC,YAAY,EAAE,EAAE,GAAG,CAAC,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC,kBAAkB,EAAE,YAAY,EAAE,WAAW,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;4BAChH,QAAQ,CAAC,IAAI,CAAC,YAAY,EAAE,EAAE,GAAG,CAAC,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC,kBAAkB,EAAE,YAAY,EAAE,WAAW,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;yBACjH;6BAAM,IAAI,IAAI,CAAC,mBAAmB,CAAC,CAAC,GAAG,CAAC,EAAE,EAAG,4BAA4B;4BACxE,QAAQ,CAAC,IAAI,CAAC,YAAY,EAAE,EAAE,GAAG,CAAC,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC,kBAAkB,EAAE,kBAAkB,EAAE,WAAW,EAAE,WAAW,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;yBACpI;6BAAM,4BAA4B;4BACjC,QAAQ,CAAC,IAAI,CAAC,YAAY,EAAE,EAAE,GAAG,CAAC,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC,kBAAkB,EAAE,kBAAkB,EAAE,WAAW,EAAE,WAAW,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;qBACtI;iBACF;aACF;SACF;QACD,OAAO,WAAW,CAAC;IACrB,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 Polyface\r\n */\r\n\r\nimport { Transform } from \"../../geometry3d/Transform\";\r\nimport { GrowableXYZArray } from \"../../geometry3d/GrowableXYZArray\";\r\nimport { Point3d } from \"../../geometry3d/Point3dVector3d\";\r\nimport { Segment1d } from \"../../geometry3d/Segment1d\";\r\nimport { AnnounceDrapePanel } from \"../PolyfaceQuery\";\r\nimport { Range3d } from \"../../geometry3d/Range\";\r\nimport { Geometry } from \"../../Geometry\";\r\nimport { Polyface } from \"../Polyface\";\r\n\r\nexport class SweepLineStringToFacetContext {\r\n  private _spacePoints: GrowableXYZArray;\r\n  private _spacePointsRange: Range3d;\r\n  private _numSpacePoints: number;\r\n  private constructor(spacePoints: GrowableXYZArray) {\r\n    this._spacePoints = spacePoints;\r\n    this._spacePointsRange = new Range3d();\r\n    spacePoints.setRange(this._spacePointsRange);\r\n    this._numSpacePoints = this._spacePoints.length;\r\n  }\r\n  public static create(xyz: GrowableXYZArray): SweepLineStringToFacetContext | undefined {\r\n    if (xyz.length > 1) {\r\n      return new SweepLineStringToFacetContext(xyz.clone());\r\n    }\r\n    return undefined;\r\n  }\r\n\r\n  // temporaries reused over multiple calls to process a single facet . ..\r\n  private _segmentPoint0 = Point3d.create();\r\n  private _segmentPoint1 = Point3d.create();\r\n  private _localSegmentPoint0 = Point3d.create();\r\n  private _localSegmentPoint1 = Point3d.create();\r\n  private _clipFractions = Segment1d.create(0, 1);\r\n  private _localFrame = Transform.createIdentity();\r\n  private _polygonRange = Range3d.create();\r\n\r\n  /** process a single polygon.\r\n   * @returns number crudely indicating how much work was done.\r\n   */\r\n  public projectToPolygon(polygon: GrowableXYZArray, announce: AnnounceDrapePanel, polyface: Polyface, readIndex: number): number {\r\n    polygon.setRange(this._polygonRange);\r\n    let workCounter = 0;\r\n    if (!this._polygonRange.intersectsRangeXY(this._spacePointsRange))\r\n      return workCounter;\r\n    // numTest++;\r\n    // For each triangle within the facet ...\r\n    // remark: this loop only runs once in triangle mesh, twice in quads ...\r\n    for (let k1 = 1; k1 + 1 < polygon.length; k1++) {\r\n      workCounter++;\r\n      const frame = polygon.fillLocalXYTriangleFrame(0, k1, k1 + 1, this._localFrame);\r\n      if (frame) {\r\n        // For each stroke of the linestring ...\r\n        for (let i1 = 1; i1 < this._numSpacePoints; i1++) {\r\n          workCounter++;\r\n          this._spacePoints.getPoint3dAtCheckedPointIndex(i1 - 1, this._segmentPoint0);\r\n          this._spacePoints.getPoint3dAtCheckedPointIndex(i1, this._segmentPoint1);\r\n          frame.multiplyInversePoint3d(this._segmentPoint0, this._localSegmentPoint0);\r\n          frame.multiplyInversePoint3d(this._segmentPoint1, this._localSegmentPoint1);\r\n          this._clipFractions.set(0, 1);\r\n          /** (x,y,1-x-y) are barycentric coordinates in the triangle !!! */\r\n          if (this._clipFractions.clipBy01FunctionValuesPositive(this._localSegmentPoint0.x, this._localSegmentPoint1.x)\r\n            && this._clipFractions.clipBy01FunctionValuesPositive(this._localSegmentPoint0.y, this._localSegmentPoint1.y)\r\n            && this._clipFractions.clipBy01FunctionValuesPositive(\r\n              1 - this._localSegmentPoint0.x - this._localSegmentPoint0.y,\r\n              1 - this._localSegmentPoint1.x - this._localSegmentPoint1.y)) {\r\n            /* project the local segment point to the plane. */\r\n            workCounter++;\r\n            const localClippedPointA = this._localSegmentPoint0.interpolate(this._clipFractions.x0, this._localSegmentPoint1);\r\n            const localClippedPointB = this._localSegmentPoint0.interpolate(this._clipFractions.x1, this._localSegmentPoint1);\r\n            const worldClippedPointA = this._localFrame.multiplyPoint3d(localClippedPointA)!;\r\n            const worldClippedPointB = this._localFrame.multiplyPoint3d(localClippedPointB)!;\r\n            const planePointA = this._localFrame.multiplyXYZ(localClippedPointA.x, localClippedPointA.y, 0.0)!;\r\n            const planePointB = this._localFrame.multiplyXYZ(localClippedPointB.x, localClippedPointB.y, 0.0)!;\r\n            const splitParameter = Geometry.inverseInterpolate01(this._localSegmentPoint0.z, this._localSegmentPoint1.z);\r\n            // emit 1 or 2 panels, oriented so panel normal is always to the left of the line.\r\n            if (splitParameter !== undefined && splitParameter > this._clipFractions.x0 && splitParameter < this._clipFractions.x1) {\r\n              workCounter++;\r\n              const piercePointX = this._segmentPoint0.interpolate(splitParameter, this._segmentPoint1);\r\n              const piercePointY = piercePointX.clone();   // so points are distinct for the two triangle announcements.\r\n              announce(this._spacePoints, i1 - 1, polyface, readIndex, [worldClippedPointA, piercePointX, planePointA], 2, 1);\r\n              announce(this._spacePoints, i1 - 1, polyface, readIndex, [worldClippedPointB, piercePointY, planePointB], 1, 2);\r\n            } else if (this._localSegmentPoint0.z > 0) {  // segment is entirely above\r\n              announce(this._spacePoints, i1 - 1, polyface, readIndex, [worldClippedPointA, worldClippedPointB, planePointB, planePointA], 3, 2);\r\n            } else // segment is entirely under\r\n              announce(this._spacePoints, i1 - 1, polyface, readIndex, [worldClippedPointB, worldClippedPointA, planePointA, planePointB], 2, 3);\r\n          }\r\n        }\r\n      }\r\n    }\r\n    return workCounter;\r\n  }\r\n}\r\n"]}