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

package/lib/esm/polyface/TriangleCandidate.js

@@ -0,0 +1,116 @@
+/*---------------------------------------------------------------------------------------------
+* 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 { Geometry } from "../Geometry";
+import { BarycentricTriangle } from "../geometry3d/BarycentricTriangle";
+import { Point3d } from "../geometry3d/Point3dVector3d";
+/**
+ * `TriangleCandidate` is a `BarycentricTriangle` with additional application-specific label data:
+ * * `quality` = numeric indicator of quality (e.g. aspect ratio of this triangle or a combination with other triangles)
+ * * `isValid` = boolean flag.
+ * * `id` = application specific identifier
+ * @internal
+ */
+export class TriangleCandidate extends BarycentricTriangle {
+    constructor(point0, point1, point2, id, quality, isValid) {
+        super(point0, point1, point2);
+        this._isValid = isValid;
+        this._quality = quality;
+        this.id = id;
+    }
+    /**
+     * Copy all coordinate and label data from `other` to this.
+     * @param other source triangle
+     */
+    setFrom(other) {
+        super.setFrom(other);
+        this._isValid = other._isValid;
+        this._quality = other._quality;
+        this.id = other.id;
+        return this;
+    }
+    /** Create (always) a TriangleCandidate.
+     * * Access points from multiple `IndexedXYZCollection`
+     * * mark invalid if any indices are invalid.
+     */
+    static createFromIndexedXYZ(source0, index0, source1, index1, source2, index2, id, result) {
+        if (!result)
+            result = new TriangleCandidate(Point3d.create(), Point3d.create(), Point3d.create(), id, 0.0, false);
+        result.id = id;
+        let numValid = 0;
+        if (undefined !== source0.getPoint3dAtCheckedPointIndex(index0, result.points[0]))
+            numValid++;
+        if (undefined !== source1.getPoint3dAtCheckedPointIndex(index1, result.points[1]))
+            numValid++;
+        if (undefined !== source2.getPoint3dAtCheckedPointIndex(index2, result.points[2]))
+            numValid++;
+        if (numValid === 3)
+            result.updateAspectRatio();
+        else
+            result.markInvalid();
+        return result;
+    }
+    /** (property) return the validity flag. */
+    get isValid() { return this._isValid; }
+    /**
+     * * Mark this triangle invalid.
+     * * optionally set aspect ratio.
+     * * points are not changed
+     * @param aspectRatio
+     */
+    markInvalid(quality) {
+        this._isValid = false;
+        if (quality !== undefined)
+            this._quality = quality;
+    }
+    /**
+     * * Recompute the aspect ratio.
+     * * Mark invalid if aspect ratio is 0 or negative.
+     */
+    updateAspectRatio() {
+        this._quality = super.aspectRatio;
+        this._isValid = this._quality > 0.0;
+    }
+    /**
+     * Clone all coordinate and label data.
+     * @param result optional preallocated `TriangleCandidate`
+     */
+    clone(result) {
+        if (result)
+            return result.setFrom(this);
+        return new TriangleCandidate(this.points[0].clone(), this.points[1].clone(), this.points[2].clone(), this.id, this._quality, this._isValid);
+    }
+    /**
+     * Return a `TriangleCandidate` with
+     *  * coordinate data and labels from `candidateA`
+     *  * LOWER quality of the two candidates.
+     *  * quality reduced by 1 if triangles have opposing normals (negative dot product of the two normals)
+     * @param candidateA candidate known to be valid
+     * @param candidateB candidate that may by valid
+     * @param result copy of candidate A, but if candidateB is valid the result aspect ratio is reduced (a) to the minimum of the two ratios and then (b) reduced by 1 if orientations clash.
+     */
+    static copyWithLowerQuality(candidateA, candidateB, result) {
+        result = candidateA.clone(result);
+        if (candidateB.isValid) {
+            const dot = candidateA.dotProductOfCrossProductsFromOrigin(candidateB);
+            result._quality = Geometry.minXY(candidateA.aspectRatio, candidateB.aspectRatio);
+            if (dot < 0.0)
+                result._quality -= 1.0;
+        }
+        return result;
+    }
+    /**
+     * choose better aspect ratio of triangle, other.
+     * @param triangle known valid triangle, to be updated
+     * @param other candidate replacement
+     */
+    static updateIfOtherHasHigherQuality(triangle, other) {
+        if (other.isValid && other._quality > triangle._quality)
+            triangle.setFrom(other);
+    }
+}
+//# sourceMappingURL=TriangleCandidate.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"TriangleCandidate.js","sourceRoot":"","sources":["../../../src/polyface/TriangleCandidate.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AACvC,OAAO,EAAE,mBAAmB,EAAE,MAAM,mCAAmC,CAAC;AAExE,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AAExD;;;;;;GAMG;AACH,MAAM,OAAO,iBAAkB,SAAQ,mBAAmB;IAIxD,YAAoB,MAAe,EAAE,MAAe,EAAE,MAAe,EAAE,EAAU,EAAE,OAAe,EAAE,OAAgB;QAClH,KAAK,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;QAC9B,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;QACxB,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;QACxB,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC;IACf,CAAC;IACD;;;OAGG;IACa,OAAO,CAAC,KAAwB;QAC9C,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QACrB,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC,QAAQ,CAAC;QAC/B,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC,QAAQ,CAAC;QAC/B,IAAI,CAAC,EAAE,GAAG,KAAK,CAAC,EAAE,CAAC;QACnB,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;OAGG;IACI,MAAM,CAAC,oBAAoB,CAAC,OAA6B,EAAE,MAAc,EAAE,OAA6B,EAAE,MAAc,EAAE,OAA6B,EAAE,MAAc,EAAE,EAAU,EAAE,MAA0B;QACpN,IAAI,CAAC,MAAM;YACT,MAAM,GAAG,IAAI,iBAAiB,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,OAAO,CAAC,MAAM,EAAE,EAAE,OAAO,CAAC,MAAM,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;QACvG,MAAM,CAAC,EAAE,GAAG,EAAE,CAAC;QACf,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,IAAI,SAAS,KAAK,OAAO,CAAC,6BAA6B,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAC/E,QAAQ,EAAE,CAAC;QACb,IAAI,SAAS,KAAK,OAAO,CAAC,6BAA6B,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAC/E,QAAQ,EAAE,CAAC;QACb,IAAI,SAAS,KAAK,OAAO,CAAC,6BAA6B,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YAC/E,QAAQ,EAAE,CAAC;QACb,IAAI,QAAQ,KAAK,CAAC;YAChB,MAAM,CAAC,iBAAiB,EAAE,CAAC;;YAE3B,MAAM,CAAC,WAAW,EAAE,CAAC;QACvB,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,2CAA2C;IAC3C,IAAW,OAAO,KAAc,OAAO,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;IACvD;;;;;OAKG;IACI,WAAW,CAAC,OAAgB;QACjC,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC;QACtB,IAAI,OAAO,KAAK,SAAS;YACvB,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;IAC5B,CAAC;IACD;;;OAGG;IACI,iBAAiB;QACtB,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAC,WAAW,CAAC;QAClC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,GAAG,GAAG,CAAC;IACtC,CAAC;IACD;;;OAGG;IACa,KAAK,CAAC,MAA0B;QAC9C,IAAI,MAAM;YACR,OAAO,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QAC9B,OAAO,IAAI,iBAAiB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;IAC9I,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,oBAAoB,CAAC,UAA6B,EAAE,UAA6B,EAAE,MAA0B;QACzH,MAAM,GAAG,UAAU,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;QAClC,IAAI,UAAU,CAAC,OAAO,EAAE;YACtB,MAAM,GAAG,GAAG,UAAU,CAAC,mCAAmC,CAAC,UAAU,CAAC,CAAC;YACvE,MAAM,CAAC,QAAQ,GAAG,QAAQ,CAAC,KAAK,CAAC,UAAU,CAAC,WAAW,EAAE,UAAU,CAAC,WAAW,CAAC,CAAC;YACjF,IAAI,GAAG,GAAG,GAAG;gBACX,MAAM,CAAC,QAAQ,IAAI,GAAG,CAAC;SAC1B;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,6BAA6B,CAAC,QAA2B,EAAE,KAAwB;QAC/F,IAAI,KAAK,CAAC,OAAO,IAAI,KAAK,CAAC,QAAQ,GAAG,QAAQ,CAAC,QAAQ;YACrD,QAAQ,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IAC5B,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 { Geometry } from \"../Geometry\";\r\nimport { BarycentricTriangle } from \"../geometry3d/BarycentricTriangle\";\r\nimport { IndexedXYZCollection } from \"../geometry3d/IndexedXYZCollection\";\r\nimport { Point3d } from \"../geometry3d/Point3dVector3d\";\r\n\r\n/**\r\n * `TriangleCandidate` is a `BarycentricTriangle` with additional application-specific label data:\r\n * * `quality` = numeric indicator of quality (e.g. aspect ratio of this triangle or a combination with other triangles)\r\n * * `isValid` = boolean flag.\r\n * * `id` = application specific identifier\r\n * @internal\r\n */\r\nexport class TriangleCandidate extends BarycentricTriangle {\r\n  private _quality: number;\r\n  private _isValid: boolean;\r\n  public id: number;\r\n  private constructor(point0: Point3d, point1: Point3d, point2: Point3d, id: number, quality: number, isValid: boolean) {\r\n    super(point0, point1, point2);\r\n    this._isValid = isValid;\r\n    this._quality = quality;\r\n    this.id = id;\r\n  }\r\n  /**\r\n   * Copy all coordinate and label data from `other` to this.\r\n   * @param other source triangle\r\n   */\r\n  public override setFrom(other: TriangleCandidate): TriangleCandidate {\r\n    super.setFrom(other);\r\n    this._isValid = other._isValid;\r\n    this._quality = other._quality;\r\n    this.id = other.id;\r\n    return this;\r\n  }\r\n\r\n  /** Create (always) a TriangleCandidate.\r\n   * * Access points from multiple `IndexedXYZCollection`\r\n   * * mark invalid if any indices are invalid.\r\n   */\r\n  public static createFromIndexedXYZ(source0: IndexedXYZCollection, index0: number, source1: IndexedXYZCollection, index1: number, source2: IndexedXYZCollection, index2: number, id: number, result?: TriangleCandidate): TriangleCandidate {\r\n    if (!result)\r\n      result = new TriangleCandidate(Point3d.create(), Point3d.create(), Point3d.create(), id, 0.0, false);\r\n    result.id = id;\r\n    let numValid = 0;\r\n    if (undefined !== source0.getPoint3dAtCheckedPointIndex(index0, result.points[0]))\r\n      numValid++;\r\n    if (undefined !== source1.getPoint3dAtCheckedPointIndex(index1, result.points[1]))\r\n      numValid++;\r\n    if (undefined !== source2.getPoint3dAtCheckedPointIndex(index2, result.points[2]))\r\n      numValid++;\r\n    if (numValid === 3)\r\n      result.updateAspectRatio();\r\n    else\r\n      result.markInvalid();\r\n    return result;\r\n  }\r\n  /** (property) return the validity flag. */\r\n  public get isValid(): boolean { return this._isValid; }\r\n  /**\r\n   * * Mark this triangle invalid.\r\n   * * optionally set aspect ratio.\r\n   * * points are not changed\r\n   * @param aspectRatio\r\n   */\r\n  public markInvalid(quality?: number) {\r\n    this._isValid = false;\r\n    if (quality !== undefined)\r\n      this._quality = quality;\r\n  }\r\n  /**\r\n   * * Recompute the aspect ratio.\r\n   * * Mark invalid if aspect ratio is 0 or negative.\r\n   */\r\n  public updateAspectRatio() {\r\n    this._quality = super.aspectRatio;\r\n    this._isValid = this._quality > 0.0;\r\n  }\r\n  /**\r\n   * Clone all coordinate and label data.\r\n   * @param result optional preallocated `TriangleCandidate`\r\n   */\r\n  public override clone(result?: TriangleCandidate): TriangleCandidate {\r\n    if (result)\r\n      return result.setFrom(this);\r\n    return new TriangleCandidate(this.points[0].clone(), this.points[1].clone(), this.points[2].clone(), this.id, this._quality, this._isValid);\r\n  }\r\n  /**\r\n   * Return a `TriangleCandidate` with\r\n   *  * coordinate data and labels from `candidateA`\r\n   *  * LOWER quality of the two candidates.\r\n   *  * quality reduced by 1 if triangles have opposing normals (negative dot product of the two normals)\r\n   * @param candidateA candidate known to be valid\r\n   * @param candidateB candidate that may by valid\r\n   * @param result copy of candidate A, but if candidateB is valid the result aspect ratio is reduced (a) to the minimum of the two ratios and then (b) reduced by 1 if orientations clash.\r\n   */\r\n  public static copyWithLowerQuality(candidateA: TriangleCandidate, candidateB: TriangleCandidate, result?: TriangleCandidate): TriangleCandidate {\r\n    result = candidateA.clone(result);\r\n    if (candidateB.isValid) {\r\n      const dot = candidateA.dotProductOfCrossProductsFromOrigin(candidateB);\r\n      result._quality = Geometry.minXY(candidateA.aspectRatio, candidateB.aspectRatio);\r\n      if (dot < 0.0)\r\n        result._quality -= 1.0;\r\n    }\r\n    return result;\r\n  }\r\n  /**\r\n   * choose better aspect ratio of triangle, other.\r\n   * @param triangle known valid triangle, to be updated\r\n   * @param other candidate replacement\r\n   */\r\n  public static updateIfOtherHasHigherQuality(triangle: TriangleCandidate, other: TriangleCandidate) {\r\n    if (other.isValid && other._quality > triangle._quality)\r\n      triangle.setFrom(other);\r\n  }\r\n}\r\n"]}

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

@@ -0,0 +1,29 @@
+/** @packageDocumentation
+ * @module Polyface
+ */
+import { IndexedPolyface } from "../Polyface";
+import { Angle } from "../../geometry3d/Angle";
+/**
+ * Helper context for normal averaging.
+ * All methods are static.
+ * @internal
+ */
+export declare class BuildAverageNormalsContext {
+    /**
+     * * At each vertex of the mesh
+     *   * Find clusters of almost parallel normals
+     *   * Compute simple average of those normals
+     *   * Index to the averages
+     * * For typical meshes, this correctly clusters adjacent normals.
+     * * One cam imagine a vertex with multiple "smooth cone-like" sets of incident facets such that averaging occurs among two nonadjacent cones.  But this does not seem to be a problem in practice.
+     * @param polyface polyface to update.
+     * @param toleranceAngle averaging is done between normals up to this angle.
+     */
+    static buildFastAverageNormals(polyface: IndexedPolyface, toleranceAngle: Angle): void;
+    /**
+     * Set up indexed normals with one normal in the plane of each facet of the mesh.
+     * @param polyface mesh to modify
+     */
+    static buildPerFaceNormals(polyface: IndexedPolyface): void;
+}
+//# sourceMappingURL=BuildAverageNormalsContext.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"BuildAverageNormalsContext.d.ts","sourceRoot":"","sources":["../../../../src/polyface/multiclip/BuildAverageNormalsContext.ts"],"names":[],"mappings":"AAIA;;GAEG;AAIH,OAAO,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC;AAG9C,OAAO,EAAE,KAAK,EAAE,MAAM,wBAAwB,CAAC;AA8C/C;;;;GAIG;AAEH,qBAAa,0BAA0B;IACrC;;;;;;;;;OASG;WACW,uBAAuB,CAAC,QAAQ,EAAE,eAAe,EAAE,cAAc,EAAE,KAAK;IA6EtF;;;OAGG;WACW,mBAAmB,CAAC,QAAQ,EAAE,eAAe;CAmB5D"}

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

@@ -0,0 +1,160 @@
+/*---------------------------------------------------------------------------------------------
+* 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 { Vector3d } from "../../geometry3d/Point3dVector3d";
+import { PolygonOps } from "../../geometry3d/PolygonOps";
+import { Geometry } from "../../Geometry";
+import { GrowableXYZArray } from "../../geometry3d/GrowableXYZArray";
+/**
+ * Normal vector with area (or other numeric) and source index
+ * @internal
+ */
+class IndexedAreaAndNormal {
+    constructor(index, area, normal) {
+        this.index = index;
+        this.area = area;
+        this.normal = normal;
+    }
+    addWeightedNormal(weight, normal) {
+        this.area += weight;
+        this.normal.addScaledInPlace(normal, weight);
+    }
+    divideNormalByArea() {
+        this.normal.scaleInPlace(1.0 / this.area);
+    }
+}
+/**
+ * index data for a single sector of some facet.
+ * @internal
+ */
+class SectorData {
+    constructor(facetData, sectorIndex, vertexIndex) {
+        this.facetData = facetData;
+        this.sectorClusterData = undefined;
+        this.sectorIndex = sectorIndex;
+        this.vertexIndex = vertexIndex;
+    }
+    static cbSectorSort(left, right) { return left.sectorIndex - right.sectorIndex; }
+    static cbVertexSort(left, right) { return left.vertexIndex - right.vertexIndex; }
+    static pushToArray(data, facetData, sectorIndex, vertexIndex) {
+        data.push(new SectorData(facetData, sectorIndex, vertexIndex));
+    }
+}
+/**
+ * Helper context for normal averaging.
+ * All methods are static.
+ * @internal
+ */
+export class BuildAverageNormalsContext {
+    /**
+     * * At each vertex of the mesh
+     *   * Find clusters of almost parallel normals
+     *   * Compute simple average of those normals
+     *   * Index to the averages
+     * * For typical meshes, this correctly clusters adjacent normals.
+     * * One cam imagine a vertex with multiple "smooth cone-like" sets of incident facets such that averaging occurs among two nonadjacent cones.  But this does not seem to be a problem in practice.
+     * @param polyface polyface to update.
+     * @param toleranceAngle averaging is done between normals up to this angle.
+     */
+    static buildFastAverageNormals(polyface, toleranceAngle) {
+        // We ASSUME that the visitor order matches index order in polyface.data .....
+        const visitor = polyface.createVisitor(0);
+        const defaultNormal = Vector3d.create(0, 0, 1);
+        const smallArea = Geometry.smallMetricDistanceSquared; // I DO NOT LIKE THIS TOLERANCE
+        const sectors = [];
+        let facetIndex = 0;
+        let sectorIndex = 0;
+        // create one IndexedAreaNormal structure for each facet.
+        // At each sector of each face, notate (a) IndexedAreaNormal of the facet, (b) the sector index, (c) the point index.
+        while (visitor.moveToNextFacet()) {
+            const facetNormal = PolygonOps.areaNormalGo(visitor.point);
+            let area = facetNormal.magnitude();
+            if (area < smallArea) {
+                facetNormal.setFromVector3d(defaultNormal);
+                area = 0.0;
+            }
+            else {
+                facetNormal.scaleInPlace(1.0 / area);
+            }
+            const facetData = new IndexedAreaAndNormal(facetIndex++, area, facetNormal);
+            for (let i = 0; i < visitor.pointCount; i++) {
+                SectorData.pushToArray(sectors, facetData, sectorIndex++, visitor.clientPointIndex(i));
+            }
+        }
+        // Sort by the vertex index so all the sectors around each vertex are clustered . .
+        sectors.sort(SectorData.cbVertexSort);
+        // Walk the sectors around each vertex .  ..
+        // For each unassigned sector
+        //     walk to further sectors of the same vertex with near-parallel normals, accumulating average normal.
+        //     notate all sectors in the cluster with the averaged-normal structure.
+        const clusters = [];
+        let toleranceRadians = toleranceAngle.radians;
+        if (toleranceRadians < 0.0001)
+            toleranceRadians = 0.0001;
+        let clusterIndex = 0;
+        for (let baseSectorIndex = 0; baseSectorIndex < sectors.length; baseSectorIndex++) {
+            const baseData = sectors[baseSectorIndex];
+            const vertexIndex = baseData.vertexIndex;
+            const baseFacetData = baseData.facetData;
+            if (baseData.sectorClusterData === undefined) {
+                const clusterNormal = new IndexedAreaAndNormal(clusterIndex++, 0.0, Vector3d.createZero());
+                clusters.push(clusterNormal);
+                // Accumulate with equal weights . . .
+                clusterNormal.addWeightedNormal(1.0, baseData.facetData.normal.clone());
+                for (let candidateSectorIndex = baseSectorIndex; candidateSectorIndex < sectors.length; candidateSectorIndex++) {
+                    const candidateSector = sectors[candidateSectorIndex];
+                    if (candidateSector.vertexIndex !== vertexIndex)
+                        break;
+                    if (candidateSector.facetData.normal.angleTo(baseFacetData.normal).radians > toleranceRadians)
+                        continue;
+                    if (candidateSector.sectorClusterData === undefined) {
+                        clusterNormal.addWeightedNormal(1.0, candidateSector.facetData.normal);
+                        candidateSector.sectorClusterData = clusterNormal;
+                    }
+                }
+            }
+        }
+        // Resort by original sector index.
+        sectors.sort(SectorData.cbSectorSort);
+        // normalize the sums and emplace in the facets  . . .
+        polyface.data.normalIndex = [];
+        polyface.data.normal = new GrowableXYZArray(sectors.length);
+        for (const cluster of clusters) {
+            cluster.divideNormalByArea();
+            cluster.index = polyface.data.normal.length;
+            polyface.data.normal.push(cluster.normal);
+        }
+        // emplace the indices
+        for (const sector of sectors) {
+            polyface.data.normalIndex.push(sector.sectorClusterData.index);
+        }
+    }
+    /**
+     * Set up indexed normals with one normal in the plane of each facet of the mesh.
+     * @param polyface mesh to modify
+     */
+    static buildPerFaceNormals(polyface) {
+        const visitor = polyface.createVisitor(0);
+        const facetNormal = Vector3d.create(0, 0, 1);
+        const defaultNormal = Vector3d.create(0, 0, 1);
+        // polyface.data.clearNormals();
+        const newNormals = new GrowableXYZArray(polyface.faceCount);
+        const newIndices = [];
+        while (visitor.moveToNextFacet()) {
+            const thisNormalIndex = newNormals.length;
+            if (PolygonOps.unitNormal(visitor.point, facetNormal))
+                newNormals.push(facetNormal);
+            else
+                newNormals.push(defaultNormal);
+            for (let i = 0; i < visitor.pointCount; i++)
+                newIndices.push(thisNormalIndex);
+        }
+        polyface.data.normalIndex = newIndices;
+        polyface.data.normal = newNormals;
+    }
+}
+//# sourceMappingURL=BuildAverageNormalsContext.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"BuildAverageNormalsContext.js","sourceRoot":"","sources":["../../../../src/polyface/multiclip/BuildAverageNormalsContext.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,kCAAkC,CAAC;AAC5D,OAAO,EAAE,UAAU,EAAE,MAAM,6BAA6B,CAAC;AAEzD,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAC1C,OAAO,EAAE,gBAAgB,EAAE,MAAM,mCAAmC,CAAC;AAGrE;;;GAGG;AACH,MAAM,oBAAoB;IACxB,YAAmB,KAAa,EAAE,IAAY,EAAE,MAAgB;QAC9D,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;IACvB,CAAC;IAKM,iBAAiB,CAAC,MAAc,EAAE,MAAgB;QACvD,IAAI,CAAC,IAAI,IAAI,MAAM,CAAC;QACpB,IAAI,CAAC,MAAM,CAAC,gBAAgB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC/C,CAAC;IACM,kBAAkB;QACvB,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5C,CAAC;CACF;AAED;;;GAGG;AACH,MAAM,UAAU;IACd,YAAoB,SAA+B,EAAE,WAAmB,EAAE,WAAmB;QAC3F,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,iBAAiB,GAAG,SAAS,CAAC;QACnC,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;QAC/B,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;IACjC,CAAC;IAKM,MAAM,CAAC,YAAY,CAAC,IAAgB,EAAE,KAAiB,IAAY,OAAO,IAAI,CAAC,WAAW,GAAG,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC;IACjH,MAAM,CAAC,YAAY,CAAC,IAAgB,EAAE,KAAiB,IAAY,OAAO,IAAI,CAAC,WAAW,GAAG,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC;IACjH,MAAM,CAAC,WAAW,CAAC,IAAkB,EAAE,SAA+B,EAAE,WAAmB,EAAE,WAAmB;QACrH,IAAI,CAAC,IAAI,CAAC,IAAI,UAAU,CAAC,SAAS,EAAE,WAAW,EAAE,WAAW,CAAC,CAAC,CAAC;IACjE,CAAC;CACF;AACD;;;;GAIG;AAEH,MAAM,OAAO,0BAA0B;IACrC;;;;;;;;;OASG;IACI,MAAM,CAAC,uBAAuB,CAAC,QAAyB,EAAE,cAAqB;QACpF,8EAA8E;QAC9E,MAAM,OAAO,GAAG,QAAQ,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;QAC1C,MAAM,aAAa,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC/C,MAAM,SAAS,GAAG,QAAQ,CAAC,0BAA0B,CAAC,CAAI,+BAA+B;QACzF,MAAM,OAAO,GAAiB,EAAE,CAAC;QACjC,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,IAAI,WAAW,GAAG,CAAC,CAAC;QACpB,yDAAyD;QACzD,qHAAqH;QAErH,OAAO,OAAO,CAAC,eAAe,EAAE,EAAE;YAChC,MAAM,WAAW,GAAG,UAAU,CAAC,YAAY,CAAC,OAAO,CAAC,KAAK,CAAE,CAAC;YAC5D,IAAI,IAAI,GAAG,WAAW,CAAC,SAAS,EAAE,CAAC;YACnC,IAAI,IAAI,GAAG,SAAS,EAAE;gBACpB,WAAW,CAAC,eAAe,CAAC,aAAa,CAAC,CAAC;gBAC3C,IAAI,GAAG,GAAG,CAAC;aACZ;iBAAM;gBACL,WAAW,CAAC,YAAY,CAAC,GAAG,GAAG,IAAI,CAAC,CAAC;aACtC;YACD,MAAM,SAAS,GAAG,IAAI,oBAAoB,CAAC,UAAU,EAAE,EAAE,IAAI,EAAE,WAAW,CAAC,CAAC;YAC5E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC,EAAE,EAAE;gBAC3C,UAAU,CAAC,WAAW,CAAC,OAAO,EAAE,SAAS,EAAE,WAAW,EAAE,EAAE,OAAO,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC;aACxF;SACF;QACD,mFAAmF;QACnF,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC,YAAY,CAAC,CAAC;QAEtC,4CAA4C;QAC5C,6BAA6B;QAC7B,0GAA0G;QAC1G,4EAA4E;QAC5E,MAAM,QAAQ,GAA2B,EAAE,CAAC;QAC5C,IAAI,gBAAgB,GAAG,cAAc,CAAC,OAAO,CAAC;QAC9C,IAAI,gBAAgB,GAAG,MAAM;YAC3B,gBAAgB,GAAG,MAAM,CAAC;QAE5B,IAAI,YAAY,GAAG,CAAC,CAAC;QACrB,KAAK,IAAI,eAAe,GAAG,CAAC,EAAE,eAAe,GAAG,OAAO,CAAC,MAAM,EAAE,eAAe,EAAE,EAAE;YACjF,MAAM,QAAQ,GAAG,OAAO,CAAC,eAAe,CAAC,CAAC;YAC1C,MAAM,WAAW,GAAG,QAAQ,CAAC,WAAW,CAAC;YACzC,MAAM,aAAa,GAAG,QAAQ,CAAC,SAAS,CAAC;YACzC,IAAI,QAAQ,CAAC,iBAAiB,KAAK,SAAS,EAAE;gBAC5C,MAAM,aAAa,GAAG,IAAI,oBAAoB,CAAC,YAAY,EAAE,EAAE,GAAG,EAAE,QAAQ,CAAC,UAAU,EAAE,CAAC,CAAC;gBAC3F,QAAQ,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;gBAC7B,sCAAsC;gBACtC,aAAa,CAAC,iBAAiB,CAAC,GAAG,EAAE,QAAQ,CAAC,SAAS,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC;gBACxE,KAAK,IAAI,oBAAoB,GAAG,eAAe,EAC7C,oBAAoB,GAAG,OAAO,CAAC,MAAM,EACrC,oBAAoB,EAAE,EAAE;oBACxB,MAAM,eAAe,GAAG,OAAO,CAAC,oBAAoB,CAAC,CAAC;oBACtD,IAAI,eAAe,CAAC,WAAW,KAAK,WAAW;wBAC7C,MAAM;oBACR,IAAI,eAAe,CAAC,SAAS,CAAC,MAAM,CAAC,OAAO,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,OAAO,GAAG,gBAAgB;wBAC3F,SAAS;oBACX,IAAI,eAAe,CAAC,iBAAiB,KAAK,SAAS,EAAE;wBACnD,aAAa,CAAC,iBAAiB,CAAC,GAAG,EAAE,eAAe,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;wBACvE,eAAe,CAAC,iBAAiB,GAAG,aAAa,CAAC;qBACnD;iBACF;aACF;SACF;QACD,mCAAmC;QACnC,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC,YAAY,CAAC,CAAC;QACtC,sDAAsD;QACtD,QAAQ,CAAC,IAAI,CAAC,WAAW,GAAG,EAAE,CAAC;QAC/B,QAAQ,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,gBAAgB,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QAC5D,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE;YAC9B,OAAO,CAAC,kBAAkB,EAAE,CAAC;YAC7B,OAAO,CAAC,KAAK,GAAG,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC;YAC5C,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;SAC3C;QACD,sBAAsB;QACtB,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE;YAC5B,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,iBAAkB,CAAC,KAAK,CAAC,CAAC;SACjE;IACH,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,mBAAmB,CAAC,QAAyB;QACzD,MAAM,OAAO,GAAG,QAAQ,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;QAC1C,MAAM,WAAW,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC7C,MAAM,aAAa,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAC/C,gCAAgC;QAChC,MAAM,UAAU,GAAG,IAAI,gBAAgB,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;QAC5D,MAAM,UAAU,GAAa,EAAE,CAAC;QAChC,OAAO,OAAO,CAAC,eAAe,EAAE,EAAE;YAChC,MAAM,eAAe,GAAG,UAAU,CAAC,MAAM,CAAC;YAC1C,IAAI,UAAU,CAAC,UAAU,CAAC,OAAO,CAAC,KAAK,EAAE,WAAW,CAAC;gBACnD,UAAU,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;;gBAE7B,UAAU,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;YACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC,EAAE;gBACzC,UAAU,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;SACpC;QACD,QAAQ,CAAC,IAAI,CAAC,WAAW,GAAG,UAAU,CAAC;QACvC,QAAQ,CAAC,IAAI,CAAC,MAAM,GAAG,UAAU,CAAC;IACpC,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 { Vector3d } from \"../../geometry3d/Point3dVector3d\";\r\nimport { PolygonOps } from \"../../geometry3d/PolygonOps\";\r\nimport { IndexedPolyface } from \"../Polyface\";\r\nimport { Geometry } from \"../../Geometry\";\r\nimport { GrowableXYZArray } from \"../../geometry3d/GrowableXYZArray\";\r\nimport { Angle } from \"../../geometry3d/Angle\";\r\n\r\n/**\r\n * Normal vector with area (or other numeric) and source index\r\n * @internal\r\n */\r\nclass IndexedAreaAndNormal {\r\n  public constructor(index: number, area: number, normal: Vector3d) {\r\n    this.index = index;\r\n    this.area = area;\r\n    this.normal = normal;\r\n  }\r\n  public index: number;\r\n  public area: number;\r\n  public normal: Vector3d;\r\n\r\n  public addWeightedNormal(weight: number, normal: Vector3d) {\r\n    this.area += weight;\r\n    this.normal.addScaledInPlace(normal, weight);\r\n  }\r\n  public divideNormalByArea() {\r\n    this.normal.scaleInPlace(1.0 / this.area);\r\n  }\r\n}\r\n\r\n/**\r\n * index data for a single sector of some facet.\r\n * @internal\r\n */\r\nclass SectorData {\r\n  private constructor(facetData: IndexedAreaAndNormal, sectorIndex: number, vertexIndex: number) {\r\n    this.facetData = facetData;\r\n    this.sectorClusterData = undefined;\r\n    this.sectorIndex = sectorIndex;\r\n    this.vertexIndex = vertexIndex;\r\n  }\r\n  public facetData: IndexedAreaAndNormal;\r\n  public sectorIndex: number;\r\n  public vertexIndex: number;\r\n  public sectorClusterData: IndexedAreaAndNormal | undefined;\r\n  public static cbSectorSort(left: SectorData, right: SectorData): number { return left.sectorIndex - right.sectorIndex; }\r\n  public static cbVertexSort(left: SectorData, right: SectorData): number { return left.vertexIndex - right.vertexIndex; }\r\n  public static pushToArray(data: SectorData[], facetData: IndexedAreaAndNormal, sectorIndex: number, vertexIndex: number) {\r\n    data.push(new SectorData(facetData, sectorIndex, vertexIndex));\r\n  }\r\n}\r\n/**\r\n * Helper context for normal averaging.\r\n * All methods are static.\r\n * @internal\r\n */\r\n\r\nexport class BuildAverageNormalsContext {\r\n  /**\r\n   * * At each vertex of the mesh\r\n   *   * Find clusters of almost parallel normals\r\n   *   * Compute simple average of those normals\r\n   *   * Index to the averages\r\n   * * For typical meshes, this correctly clusters adjacent normals.\r\n   * * One cam imagine a vertex with multiple \"smooth cone-like\" sets of incident facets such that averaging occurs among two nonadjacent cones.  But this does not seem to be a problem in practice.\r\n   * @param polyface polyface to update.\r\n   * @param toleranceAngle averaging is done between normals up to this angle.\r\n   */\r\n  public static buildFastAverageNormals(polyface: IndexedPolyface, toleranceAngle: Angle) {\r\n    // We ASSUME that the visitor order matches index order in polyface.data .....\r\n    const visitor = polyface.createVisitor(0);\r\n    const defaultNormal = Vector3d.create(0, 0, 1);\r\n    const smallArea = Geometry.smallMetricDistanceSquared;    // I DO NOT LIKE THIS TOLERANCE\r\n    const sectors: SectorData[] = [];\r\n    let facetIndex = 0;\r\n    let sectorIndex = 0;\r\n    // create one IndexedAreaNormal structure for each facet.\r\n    // At each sector of each face, notate (a) IndexedAreaNormal of the facet, (b) the sector index, (c) the point index.\r\n\r\n    while (visitor.moveToNextFacet()) {\r\n      const facetNormal = PolygonOps.areaNormalGo(visitor.point)!;\r\n      let area = facetNormal.magnitude();\r\n      if (area < smallArea) {\r\n        facetNormal.setFromVector3d(defaultNormal);\r\n        area = 0.0;\r\n      } else {\r\n        facetNormal.scaleInPlace(1.0 / area);\r\n      }\r\n      const facetData = new IndexedAreaAndNormal(facetIndex++, area, facetNormal);\r\n      for (let i = 0; i < visitor.pointCount; i++) {\r\n        SectorData.pushToArray(sectors, facetData, sectorIndex++, visitor.clientPointIndex(i));\r\n      }\r\n    }\r\n    // Sort by the vertex index so all the sectors around each vertex are clustered . .\r\n    sectors.sort(SectorData.cbVertexSort);\r\n\r\n    // Walk the sectors around each vertex .  ..\r\n    // For each unassigned sector\r\n    //     walk to further sectors of the same vertex with near-parallel normals, accumulating average normal.\r\n    //     notate all sectors in the cluster with the averaged-normal structure.\r\n    const clusters: IndexedAreaAndNormal[] = [];\r\n    let toleranceRadians = toleranceAngle.radians;\r\n    if (toleranceRadians < 0.0001)\r\n      toleranceRadians = 0.0001;\r\n\r\n    let clusterIndex = 0;\r\n    for (let baseSectorIndex = 0; baseSectorIndex < sectors.length; baseSectorIndex++) {\r\n      const baseData = sectors[baseSectorIndex];\r\n      const vertexIndex = baseData.vertexIndex;\r\n      const baseFacetData = baseData.facetData;\r\n      if (baseData.sectorClusterData === undefined) {\r\n        const clusterNormal = new IndexedAreaAndNormal(clusterIndex++, 0.0, Vector3d.createZero());\r\n        clusters.push(clusterNormal);\r\n        // Accumulate with equal weights . . .\r\n        clusterNormal.addWeightedNormal(1.0, baseData.facetData.normal.clone());\r\n        for (let candidateSectorIndex = baseSectorIndex;\r\n          candidateSectorIndex < sectors.length;\r\n          candidateSectorIndex++) {\r\n          const candidateSector = sectors[candidateSectorIndex];\r\n          if (candidateSector.vertexIndex !== vertexIndex)\r\n            break;\r\n          if (candidateSector.facetData.normal.angleTo(baseFacetData.normal).radians > toleranceRadians)\r\n            continue;\r\n          if (candidateSector.sectorClusterData === undefined) {\r\n            clusterNormal.addWeightedNormal(1.0, candidateSector.facetData.normal);\r\n            candidateSector.sectorClusterData = clusterNormal;\r\n          }\r\n        }\r\n      }\r\n    }\r\n    // Resort by original sector index.\r\n    sectors.sort(SectorData.cbSectorSort);\r\n    // normalize the sums and emplace in the facets  . . .\r\n    polyface.data.normalIndex = [];\r\n    polyface.data.normal = new GrowableXYZArray(sectors.length);\r\n    for (const cluster of clusters) {\r\n      cluster.divideNormalByArea();\r\n      cluster.index = polyface.data.normal.length;\r\n      polyface.data.normal.push(cluster.normal);\r\n    }\r\n    // emplace the indices\r\n    for (const sector of sectors) {\r\n      polyface.data.normalIndex.push(sector.sectorClusterData!.index);\r\n    }\r\n  }\r\n  /**\r\n   * Set up indexed normals with one normal in the plane of each facet of the mesh.\r\n   * @param polyface mesh to modify\r\n   */\r\n  public static buildPerFaceNormals(polyface: IndexedPolyface) {\r\n    const visitor = polyface.createVisitor(0);\r\n    const facetNormal = Vector3d.create(0, 0, 1);\r\n    const defaultNormal = Vector3d.create(0, 0, 1);\r\n    // polyface.data.clearNormals();\r\n    const newNormals = new GrowableXYZArray(polyface.faceCount);\r\n    const newIndices: number[] = [];\r\n    while (visitor.moveToNextFacet()) {\r\n      const thisNormalIndex = newNormals.length;\r\n      if (PolygonOps.unitNormal(visitor.point, facetNormal))\r\n        newNormals.push(facetNormal);\r\n      else\r\n        newNormals.push(defaultNormal);\r\n      for (let i = 0; i < visitor.pointCount; i++)\r\n        newIndices.push(thisNormalIndex);\r\n    }\r\n    polyface.data.normalIndex = newIndices;\r\n    polyface.data.normal = newNormals;\r\n  }\r\n}\r\n"]}

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

@@ -0,0 +1,81 @@
+/** @packageDocumentation
+ * @module RangeSearch
+ */
+import { Range2d, Range3d } from "../../geometry3d/Range";
+import { LowAndHighXY } from "../../geometry3d/XYZProps";
+import { LinearSearchRange2dArray } from "./LinearSearchRange2dArray";
+export declare type OptionalLinearSearchRange2dArray<T> = LinearSearchRange2dArray<T> | undefined;
+/**
+ * A GriddedRaggedRange2dSet is
+ * * A doubly dimensioned array of LinearSearchRange2dArray
+ * * Each entry represents a block in a uniform grid within the master range of the GriddedRaggedRange2dSet.
+ * * Member ranges are noted in the grid block containing the range's lower left corner.
+ * * Member ranges larger than twice the grid size are rejected by the insert method.
+ * * Hence a search involving a point in grid block (i,j) must examine ranges in grid blocks left and below, i.e. (i-1,j-1), (i-1,j), (i,j-1)
+ * @internal
+ */
+export declare class GriddedRaggedRange2dSet<T> {
+    private _range;
+    private _numXEdge;
+    private _numYEdge;
+    /** Each grid block is a simple linear search set
+     *
+     */
+    private _rangesInBlock;
+    private constructor();
+    /**
+     * Create an (empty) set of ranges.
+     * @param range
+     * @param numXEdge
+     * @param numYEdge
+     */
+    static create<T>(range: Range2d, numXEdge: number, numYEdge: number): GriddedRaggedRange2dSet<T> | undefined;
+    private xIndex;
+    private yIndex;
+    private getBlock;
+    /** 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.
+     */
+    conditionalInsert(range: Range2d | Range3d, tag: T): boolean;
+    /**
+     * * Search a single block
+     * * Pass each range and tag to handler
+     * * and return false if bad cell or 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.
+     */
+    private searchXYInIndexedBlock;
+    /**
+     * * Search a single block
+     * * Pass each range and tag to handler
+     * * and return false if bad cell or 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.
+     */
+    private searchRange2dInIndexedBlock;
+    /**
+     * * 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;
+    visitChildren(initialDepth: number, handler: (depth: number, child: LinearSearchRange2dArray<T>) => void): void;
+}
+//# sourceMappingURL=GriddedRaggedRange2dSet.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"GriddedRaggedRange2dSet.d.ts","sourceRoot":"","sources":["../../../../src/polyface/multiclip/GriddedRaggedRange2dSet.ts"],"names":[],"mappings":"AAIA;;GAEG;AAEH,OAAO,EAAE,OAAO,EAAE,OAAO,EAAE,MAAM,wBAAwB,CAAC;AAC1D,OAAO,EAAE,YAAY,EAAE,MAAM,2BAA2B,CAAC;AACzD,OAAO,EAAE,wBAAwB,EAAE,MAAM,4BAA4B,CAAC;AAEtE,oBAAY,gCAAgC,CAAC,CAAC,IAAI,wBAAwB,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC;AAC1F;;;;;;;;GAQG;AACH,qBAAa,uBAAuB,CAAC,CAAC;IACpC,OAAO,CAAC,MAAM,CAAU;IACxB,OAAO,CAAC,SAAS,CAAS;IAC1B,OAAO,CAAC,SAAS,CAAS;IAC1B;;OAEG;IACH,OAAO,CAAC,cAAc,CAAoD;IAC1E,OAAO;IAaP;;;;;OAKG;WACW,MAAM,CAAC,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,uBAAuB,CAAC,CAAC,CAAC,GAAG,SAAS;IAKnH,OAAO,CAAC,MAAM;IAId,OAAO,CAAC,MAAM;IAId,OAAO,CAAC,QAAQ;IAQhB;;;;;OAKG;IACI,iBAAiB,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO,EAAE,GAAG,EAAE,CAAC,GAAG,OAAO;IAoBnE;;;;;;;OAOG;IACH,OAAO,CAAC,sBAAsB;IAM9B;;;;;;;OAOG;IACH,OAAO,CAAC,2BAA2B;IAMnC;;;;;;;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;IAQ5F;;;;;;;OAOG;IACI,aAAa,CAAC,SAAS,EAAE,YAAY,EAAE,OAAO,EAAE,CAAC,KAAK,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,KAAK,OAAO,GAAG,OAAO;IAa7F,aAAa,CAAC,YAAY,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,wBAAwB,CAAC,CAAC,CAAC,KAAK,IAAI;CAQhH"}

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

@@ -0,0 +1,159 @@
+/*---------------------------------------------------------------------------------------------
+* 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 { LinearSearchRange2dArray } from "./LinearSearchRange2dArray";
+/**
+ * A GriddedRaggedRange2dSet is
+ * * A doubly dimensioned array of LinearSearchRange2dArray
+ * * Each entry represents a block in a uniform grid within the master range of the GriddedRaggedRange2dSet.
+ * * Member ranges are noted in the grid block containing the range's lower left corner.
+ * * Member ranges larger than twice the grid size are rejected by the insert method.
+ * * Hence a search involving a point in grid block (i,j) must examine ranges in grid blocks left and below, i.e. (i-1,j-1), (i-1,j), (i,j-1)
+ * @internal
+ */
+export class GriddedRaggedRange2dSet {
+    constructor(range, numXEdge, numYEdge) {
+        this._range = range;
+        this._numXEdge = numXEdge;
+        this._numYEdge = numYEdge;
+        this._rangesInBlock = [];
+        for (let j = 0; j < this._numYEdge; j++) {
+            const thisRow = [];
+            for (let i = 0; i < this._numXEdge; i++) {
+                thisRow.push(undefined);
+            }
+            this._rangesInBlock.push(thisRow);
+        }
+    }
+    /**
+     * Create an (empty) set of ranges.
+     * @param range
+     * @param numXEdge
+     * @param numYEdge
+     */
+    static create(range, numXEdge, numYEdge) {
+        if (numXEdge < 1 || numYEdge < 1 || range.isNull || range.isSinglePoint)
+            return undefined;
+        return new GriddedRaggedRange2dSet(range.clone(), numXEdge, numYEdge);
+    }
+    xIndex(x) {
+        const fraction = (x - this._range.low.x) / (this._range.high.x - this._range.low.x);
+        return Math.floor(fraction * this._numXEdge);
+    }
+    yIndex(y) {
+        const fraction = (y - this._range.low.y) / (this._range.high.y - this._range.low.y);
+        return Math.floor(fraction * this._numXEdge);
+    }
+    getBlock(i, j) {
+        if (i >= 0 && i < this._numXEdge && j >= 0 && j < this._numYEdge) {
+            if (!this._rangesInBlock[j][i])
+                this._rangesInBlock[j][i] = new LinearSearchRange2dArray();
+            return this._rangesInBlock[j][i];
+        }
+        return undefined;
+    }
+    /** 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.
+     */
+    conditionalInsert(range, tag) {
+        if (range.isNull)
+            return false;
+        if (!this._range.containsRange(range))
+            return false;
+        const xIndex0 = this.xIndex(range.low.x);
+        const xIndex1 = this.xIndex(range.high.x);
+        const yIndex0 = this.yIndex(range.low.y);
+        const yIndex1 = this.yIndex(range.high.y);
+        if (!(xIndex0 === xIndex1 || xIndex0 + 1 === xIndex1))
+            return false;
+        if (!(yIndex0 === yIndex1 || yIndex0 + 1 === yIndex1))
+            return false;
+        const rangesInBlock = this.getBlock(xIndex0, yIndex0);
+        if (rangesInBlock) {
+            rangesInBlock.addRange(range, tag);
+            return true;
+        }
+        return false;
+    }
+    /**
+     * * Search a single block
+     * * Pass each range and tag to handler
+     * * and return false if bad cell or 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.
+     */
+    searchXYInIndexedBlock(i, j, x, y, handler) {
+        const rangesInBlock = this.getBlock(i, j);
+        if (!rangesInBlock)
+            return true;
+        return rangesInBlock.searchXY(x, y, handler);
+    }
+    /**
+     * * Search a single block
+     * * Pass each range and tag to handler
+     * * and return false if bad cell or 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.
+     */
+    searchRange2dInIndexedBlock(i, j, testRange, handler) {
+        const rangesInBlock = this.getBlock(i, j);
+        if (!rangesInBlock)
+            return true;
+        return rangesInBlock.searchRange2d(testRange, handler);
+    }
+    /**
+     * * 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) {
+        const i = this.xIndex(x);
+        const j = this.yIndex(y);
+        return this.searchXYInIndexedBlock(i, j, x, y, handler)
+            && this.searchXYInIndexedBlock(i - 1, j, x, y, handler)
+            && this.searchXYInIndexedBlock(i, j - 1, x, y, handler)
+            && this.searchXYInIndexedBlock(i - 1, j - 1, 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) {
+        const xIndex0 = this.xIndex(testRange.low.x) - 1;
+        const xIndex1 = this.xIndex(testRange.high.x);
+        const yIndex0 = this.yIndex(testRange.low.y) - 1;
+        const yIndex1 = this.yIndex(testRange.high.y);
+        for (let i = xIndex0; i <= xIndex1; i++) {
+            for (let j = yIndex0; j <= yIndex1; j++) {
+                if (!this.searchRange2dInIndexedBlock(i, j, testRange, handler))
+                    return false;
+            }
+        }
+        return true;
+    }
+    visitChildren(initialDepth, handler) {
+        for (const row of this._rangesInBlock) {
+            for (const block of row) {
+                if (block)
+                    handler(initialDepth, block);
+            }
+        }
+    }
+}
+//# sourceMappingURL=GriddedRaggedRange2dSet.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"GriddedRaggedRange2dSet.js","sourceRoot":"","sources":["../../../../src/polyface/multiclip/GriddedRaggedRange2dSet.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAIH,OAAO,EAAE,wBAAwB,EAAE,MAAM,4BAA4B,CAAC;AAGtE;;;;;;;;GAQG;AACH,MAAM,OAAO,uBAAuB;IAQlC,YAAoB,KAAc,EAAE,QAAgB,EAAE,QAAgB;QACpE,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC;QAC1B,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC;QAC1B,IAAI,CAAC,cAAc,GAAG,EAAE,CAAC;QACzB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC,EAAE,EAAE;YACvC,MAAM,OAAO,GAA+C,EAAE,CAAC;YAC/D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC,EAAE,EAAE;gBACvC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;aACzB;YACD,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;SACnC;IACH,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,MAAM,CAAI,KAAc,EAAE,QAAgB,EAAE,QAAgB;QACxE,IAAI,QAAQ,GAAG,CAAC,IAAI,QAAQ,GAAG,CAAC,IAAI,KAAK,CAAC,MAAM,IAAI,KAAK,CAAC,aAAa;YACrE,OAAO,SAAS,CAAC;QACnB,OAAO,IAAI,uBAAuB,CAAC,KAAK,CAAC,KAAK,EAAE,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC;IACxE,CAAC;IACO,MAAM,CAAC,CAAS;QACtB,MAAM,QAAQ,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACpF,OAAO,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC;IAC/C,CAAC;IACO,MAAM,CAAC,CAAS;QACtB,MAAM,QAAQ,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACpF,OAAO,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC;IAC/C,CAAC;IACO,QAAQ,CAAC,CAAS,EAAE,CAAS;QACnC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,SAAS,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,SAAS,EAAE;YAChE,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC5B,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,wBAAwB,EAAE,CAAC;YAC7D,OAAO,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SAClC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;OAKG;IACI,iBAAiB,CAAC,KAAwB,EAAE,GAAM;QACvD,IAAI,KAAK,CAAC,MAAM;YACd,OAAO,KAAK,CAAC;QACf,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,KAAK,CAAC;YACnC,OAAO,KAAK,CAAC;QACf,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACzC,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1C,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACzC,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1C,IAAI,CAAC,CAAC,OAAO,KAAK,OAAO,IAAI,OAAO,GAAG,CAAC,KAAK,OAAO,CAAC;YACnD,OAAO,KAAK,CAAC;QACf,IAAI,CAAC,CAAC,OAAO,KAAK,OAAO,IAAI,OAAO,GAAG,CAAC,KAAK,OAAO,CAAC;YACnD,OAAO,KAAK,CAAC;QACf,MAAM,aAAa,GAAG,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QACtD,IAAI,aAAa,EAAE;YACjB,aAAa,CAAC,QAAQ,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YACnC,OAAO,IAAI,CAAC;SACb;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;;OAOG;IACK,sBAAsB,CAAC,CAAS,EAAE,CAAS,EAAE,CAAS,EAAE,CAAS,EAAE,OAA4C;QACrH,MAAM,aAAa,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC1C,IAAI,CAAC,aAAa;YAChB,OAAO,IAAI,CAAC;QACd,OAAO,aAAa,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC;IAC/C,CAAC;IACD;;;;;;;OAOG;IACK,2BAA2B,CAAC,CAAS,EAAE,CAAS,EAAE,SAAuB,EAAE,OAA4C;QAC7H,MAAM,aAAa,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC1C,IAAI,CAAC,aAAa;YAChB,OAAO,IAAI,CAAC;QACd,OAAO,aAAa,CAAC,aAAa,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;IACzD,CAAC;IACD;;;;;;;OAOG;IACI,QAAQ,CAAC,CAAS,EAAE,CAAS,EAAE,OAA4C;QAChF,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACzB,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACzB,OAAO,IAAI,CAAC,sBAAsB,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC;eAClD,IAAI,CAAC,sBAAsB,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC;eACpD,IAAI,CAAC,sBAAsB,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC;eACpD,IAAI,CAAC,sBAAsB,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,OAAO,CAAC,CAAC;IAChE,CAAC;IACD;;;;;;;OAOG;IACI,aAAa,CAAC,SAAuB,EAAE,OAA4C;QACxF,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACjD,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9C,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QACjD,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9C,KAAK,IAAI,CAAC,GAAG,OAAO,EAAE,CAAC,IAAI,OAAO,EAAE,CAAC,EAAE,EAAE;YACvC,KAAK,IAAI,CAAC,GAAG,OAAO,EAAE,CAAC,IAAI,OAAO,EAAE,CAAC,EAAE,EAAE;gBACvC,IAAI,CAAC,IAAI,CAAC,2BAA2B,CAAC,CAAC,EAAE,CAAC,EAAE,SAAS,EAAE,OAAO,CAAC;oBAC7D,OAAO,KAAK,CAAC;aAChB;SACF;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IACM,aAAa,CAAC,YAAoB,EAAE,OAAoE;QAC7G,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,cAAc,EAAE;YACrC,KAAK,MAAM,KAAK,IAAI,GAAG,EAAE;gBACvB,IAAI,KAAK;oBACP,OAAO,CAAC,YAAY,EAAE,KAAK,CAAC,CAAC;aAChC;SACF;IACH,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 { LinearSearchRange2dArray } from \"./LinearSearchRange2dArray\";\r\n\r\nexport type OptionalLinearSearchRange2dArray<T> = LinearSearchRange2dArray<T> | undefined;\r\n/**\r\n * A GriddedRaggedRange2dSet is\r\n * * A doubly dimensioned array of LinearSearchRange2dArray\r\n * * Each entry represents a block in a uniform grid within the master range of the GriddedRaggedRange2dSet.\r\n * * Member ranges are noted in the grid block containing the range's lower left corner.\r\n * * Member ranges larger than twice the grid size are rejected by the insert method.\r\n * * Hence a search involving a point in grid block (i,j) must examine ranges in grid blocks left and below, i.e. (i-1,j-1), (i-1,j), (i,j-1)\r\n * @internal\r\n */\r\nexport class GriddedRaggedRange2dSet<T> {\r\n  private _range: Range2d;\r\n  private _numXEdge: number;\r\n  private _numYEdge: number;\r\n  /** Each grid block is a simple linear search set\r\n   *\r\n   */\r\n  private _rangesInBlock: Array<Array<OptionalLinearSearchRange2dArray<T>>>;\r\n  private constructor(range: Range2d, numXEdge: number, numYEdge: number) {\r\n    this._range = range;\r\n    this._numXEdge = numXEdge;\r\n    this._numYEdge = numYEdge;\r\n    this._rangesInBlock = [];\r\n    for (let j = 0; j < this._numYEdge; j++) {\r\n      const thisRow: Array<OptionalLinearSearchRange2dArray<T>> = [];\r\n      for (let i = 0; i < this._numXEdge; i++) {\r\n        thisRow.push(undefined);\r\n      }\r\n      this._rangesInBlock.push(thisRow);\r\n    }\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): GriddedRaggedRange2dSet<T> | undefined {\r\n    if (numXEdge < 1 || numYEdge < 1 || range.isNull || range.isSinglePoint)\r\n      return undefined;\r\n    return new GriddedRaggedRange2dSet(range.clone(), numXEdge, numYEdge);\r\n  }\r\n  private xIndex(x: number): number {\r\n    const fraction = (x - this._range.low.x) / (this._range.high.x - this._range.low.x);\r\n    return Math.floor(fraction * this._numXEdge);\r\n  }\r\n  private yIndex(y: number): number {\r\n    const fraction = (y - this._range.low.y) / (this._range.high.y - this._range.low.y);\r\n    return Math.floor(fraction * this._numXEdge);\r\n  }\r\n  private getBlock(i: number, j: number): LinearSearchRange2dArray<T> | undefined {\r\n    if (i >= 0 && i < this._numXEdge && j >= 0 && j < this._numYEdge) {\r\n      if (!this._rangesInBlock[j][i])\r\n        this._rangesInBlock[j][i] = new LinearSearchRange2dArray();\r\n      return this._rangesInBlock[j][i];\r\n    }\r\n    return undefined;\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 conditionalInsert(range: Range2d | Range3d, tag: T): boolean {\r\n    if (range.isNull)\r\n      return false;\r\n    if (!this._range.containsRange(range))\r\n      return false;\r\n    const xIndex0 = this.xIndex(range.low.x);\r\n    const xIndex1 = this.xIndex(range.high.x);\r\n    const yIndex0 = this.yIndex(range.low.y);\r\n    const yIndex1 = this.yIndex(range.high.y);\r\n    if (!(xIndex0 === xIndex1 || xIndex0 + 1 === xIndex1))\r\n      return false;\r\n    if (!(yIndex0 === yIndex1 || yIndex0 + 1 === yIndex1))\r\n      return false;\r\n    const rangesInBlock = this.getBlock(xIndex0, yIndex0);\r\n    if (rangesInBlock) {\r\n      rangesInBlock.addRange(range, tag);\r\n      return true;\r\n    }\r\n    return false;\r\n  }\r\n  /**\r\n   * * Search a single block\r\n   * * Pass each range and tag to handler\r\n   * * and return false if bad cell or 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  private searchXYInIndexedBlock(i: number, j: number, x: number, y: number, handler: (range: Range2d, tag: T) => boolean): boolean {\r\n    const rangesInBlock = this.getBlock(i, j);\r\n    if (!rangesInBlock)\r\n      return true;\r\n    return rangesInBlock.searchXY(x, y, handler);\r\n  }\r\n  /**\r\n   * * Search a single block\r\n   * * Pass each range and tag to handler\r\n   * * and return false if bad cell or 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  private searchRange2dInIndexedBlock(i: number, j: number, testRange: LowAndHighXY, handler: (range: Range2d, tag: T) => boolean): boolean {\r\n    const rangesInBlock = this.getBlock(i, j);\r\n    if (!rangesInBlock)\r\n      return true;\r\n    return rangesInBlock.searchRange2d(testRange, handler);\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    const i = this.xIndex(x);\r\n    const j = this.yIndex(y);\r\n    return this.searchXYInIndexedBlock(i, j, x, y, handler)\r\n      && this.searchXYInIndexedBlock(i - 1, j, x, y, handler)\r\n      && this.searchXYInIndexedBlock(i, j - 1, x, y, handler)\r\n      && this.searchXYInIndexedBlock(i - 1, j - 1, 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    const xIndex0 = this.xIndex(testRange.low.x) - 1;\r\n    const xIndex1 = this.xIndex(testRange.high.x);\r\n    const yIndex0 = this.yIndex(testRange.low.y) - 1;\r\n    const yIndex1 = this.yIndex(testRange.high.y);\r\n    for (let i = xIndex0; i <= xIndex1; i++) {\r\n      for (let j = yIndex0; j <= yIndex1; j++) {\r\n        if (!this.searchRange2dInIndexedBlock(i, j, testRange, handler))\r\n          return false;\r\n      }\r\n    }\r\n    return true;\r\n  }\r\n  public visitChildren(initialDepth: number, handler: (depth: number, child: LinearSearchRange2dArray<T>) => void) {\r\n    for (const row of this._rangesInBlock) {\r\n      for (const block of row) {\r\n        if (block)\r\n          handler(initialDepth, block);\r\n      }\r\n    }\r\n  }\r\n}\r\n"]}