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

package/lib/esm/geometry3d/Segment1d.js

@@ -0,0 +1,169 @@
+/*---------------------------------------------------------------------------------------------
+* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+* See LICENSE.md in the project root for license terms and full copyright notice.
+*--------------------------------------------------------------------------------------------*/
+/** @packageDocumentation
+ * @module CartesianGeometry
+ */
+import { Geometry } from "../Geometry";
+/**
+ * * A Segment1d is an interval of an axis named x.
+ * * The interval is defined by two values x0 and x1.
+ * * The x0 and x1 values can be in either order.
+ *   * if `x0 < x1` fractional coordinates within the segment move from left to right.
+ *   * if `x0 > x1` fractional coordinates within the segment move from right to left.
+ * * This differs from a Range1d in that:
+ * * For a Range1d the reversed ordering of its limit values means "empty interval".
+ * * For a Segment1d the reversed ordering is a real interval but fractional positions move backwards.
+ * * The segment is parameterized with a fraction
+ * * * Fraction 0 is the start (`x0`)
+ * * * Fraction 1 is the end (`x1`)
+ * * * The fraction equation is `x = x0 + fraction * (x1-x0)` or (equivalently) `x = (1-fraction) * x0 + fraction * x1`
+ * @public
+ */
+export class Segment1d {
+    constructor(x0, x1) {
+        this.x0 = x0;
+        this.x1 = x1;
+    }
+    /**
+     * replace both end values.
+     * @param x0 new x0 value
+     * @param x1 new y0 value
+     */
+    set(x0, x1) { this.x0 = x0, this.x1 = x1; }
+    /**
+     * shift (translate) the segment along its axis by adding `dx` to both `x0` and `x1`.
+     * @param dx value to add to both x0 and x1
+     */
+    shift(dx) { this.x0 += dx, this.x1 += dx; }
+    /**
+     * create segment1d with given end values
+     * @param x0 start value
+     * @param x1 end value
+     * @param result optional pre-existing result to be reinitialized.
+     */
+    static create(x0 = 0, x1 = 1, result) {
+        if (!result)
+            return new Segment1d(x0, x1);
+        result.set(x0, x1);
+        return result;
+    }
+    /**
+     * Copy both end values from other Segment1d
+     * @param other source Segment1d
+     */
+    setFrom(other) { this.x0 = other.x0; this.x1 = other.x1; }
+    /**
+     * clone this Segment1d, return as a separate object.
+     */
+    clone() { return new Segment1d(this.x0, this.x1); }
+    /**
+     * Returns true if both coordinates (`x0` and `x1`) are in the 0..1 range.
+     */
+    get isIn01() {
+        return Geometry.isIn01(this.x0) && Geometry.isIn01(this.x1);
+    }
+    /**
+     * Evaluate the segment at fractional position
+     * @returns position within the segment
+     * @param fraction fractional position within this segment
+     */
+    fractionToPoint(fraction) { return Geometry.interpolate(this.x0, fraction, this.x1); }
+    /**
+     * Return the signed start-to-end shift (aka signed distance)
+     */
+    signedDelta() { return this.x1 - this.x0; }
+    /**
+     * Return the absolute start-to-end shift (aka distance)
+     */
+    absoluteDelta() { return Math.abs(this.x1 - this.x0); }
+    /**
+     * * swap the x0 and x1 member values.
+     * * This makes the fractionToPoint evaluates reverse direction.
+     */
+    reverseInPlace() { const x = this.x0; this.x0 = this.x1; this.x1 = x; }
+    /**
+     * * if `x1<x0` multiplied by the scale factor is (strictly) negative, swap the x0 and x1 member values.
+     * * This makes the fractionToPoint evaluates reverse direction.
+     */
+    reverseIfNeededForDeltaSign(sign = 1) {
+        if (sign * (this.x1 - this.x0) < 0)
+            this.reverseInPlace();
+    }
+    /**
+     * Near equality test, using Geometry.isSameCoordinate for tolerances.
+     */
+    isAlmostEqual(other) {
+        return Geometry.isSameCoordinate(this.x0, other.x0) && Geometry.isSameCoordinate(this.x1, other.x1);
+    }
+    /**
+     * Return true if the segment limits are (exactly) 0 and 1
+     */
+    get isExact01() { return this.x0 === 0.0 && this.x1 === 1.0; }
+    /**
+     * Return true if the segment limits are (exactly) 1 and 0
+     */
+    get isExact01Reversed() { return this.x0 === 1.0 && this.x1 === 0.0; }
+    /** On input, `this` is an interval of a line.  On output, the interval has been clipped to positive parts of a linear function
+     * * f0 and f1 are values at parameter values 0 and 1 (which are in general NOT x0 and x1)
+     * * From that determine where the segment crosses function value 0.
+     * * The segment contains some interval in the same parameter space.
+     * * Clip the segment to the positive part of the space.
+     * * Return true (and modify the segment) if any of the segment remains.
+     * * Return false (but without modifying the segment) if the active part is entirely out.
+     */
+    clipBy01FunctionValuesPositive(f0, f1) {
+        const df01 = f1 - f0;
+        const fA = f0 + this.x0 * df01;
+        const fB = f0 + this.x1 * df01;
+        const dfAB = fB - fA;
+        if (fA > 0) {
+            if (fB >= 0)
+                return true; // inside at both ends
+            /** There is an inside to outside crossing. The division is safe ... (and value between 0 and 1) */
+            const u = -fA / dfAB;
+            this.x1 = this.x0 + u * (this.x1 - this.x0);
+            return true;
+        }
+        else if (fA < 0) {
+            if (fB < 0)
+                return false; // outside at both ends.
+            /** There is an outside to inside crossing crossing. The division is safe ... (and value between 0 and 1) */
+            const u = -fA / dfAB;
+            this.x0 = this.x0 + u * (this.x1 - this.x0);
+            return true;
+        }
+        /** fA is on the cut.   fB determines the entire segment. */
+        return fB > 0;
+    }
+    /**
+     * * On input, (f0,f1) is a (directed) segment.
+     * * On output, it is restricted to (0,1) while maintaining direction
+     * * If the clip leaves nothing, leave this segment alone and return false.
+     * * If the clip leaves something, update this segment and return true.
+     */
+    clampDirectedTo01() {
+        let x0 = this.x0;
+        let x1 = this.x1;
+        if (x1 > x0) {
+            if (x0 < 0)
+                x0 = 0;
+            if (x1 > 1)
+                x1 = 1;
+            if (x0 >= x1)
+                return false;
+        }
+        else {
+            if (x0 > 1)
+                x0 = 1;
+            if (x1 < 0)
+                x1 = 0;
+            if (x0 <= x1)
+                return false;
+        }
+        this.set(x0, x1);
+        return true;
+    }
+}
+//# sourceMappingURL=Segment1d.js.map

package/lib/esm/geometry3d/Segment1d.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Segment1d.js","sourceRoot":"","sources":["../../../src/geometry3d/Segment1d.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAEvC;;;;;;;;;;;;;;GAcG;AACH,MAAM,OAAO,SAAS;IAKpB,YAAoB,EAAU,EAAE,EAAU;QACxC,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC;QACb,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC;IACf,CAAC;IACD;;;;OAIG;IACI,GAAG,CAAC,EAAU,EAAE,EAAU,IAAI,IAAI,CAAC,EAAE,GAAG,EAAE,EAAE,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;IAClE;;;OAGG;IACI,KAAK,CAAC,EAAU,IAAI,IAAI,CAAC,EAAE,IAAI,EAAE,EAAE,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;IAC1D;;;;;OAKG;IACI,MAAM,CAAC,MAAM,CAAC,KAAa,CAAC,EAAE,KAAa,CAAC,EAAE,MAAkB;QACrE,IAAI,CAAC,MAAM;YACT,OAAO,IAAI,SAAS,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC/B,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACnB,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;OAGG;IACI,OAAO,CAAC,KAAgB,IAAI,IAAI,CAAC,EAAE,GAAG,KAAK,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,GAAG,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;IAC5E;;OAEG;IACI,KAAK,KAAgB,OAAO,IAAI,SAAS,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACrE;;OAEG;IACH,IAAW,MAAM;QACf,OAAO,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAE9D,CAAC;IACD;;;;OAIG;IACI,eAAe,CAAC,QAAgB,IAAY,OAAO,QAAQ,CAAC,WAAW,CAAC,IAAI,CAAC,EAAE,EAAE,QAAQ,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC7G;;OAEG;IACI,WAAW,KAAa,OAAO,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1D;;OAEG;IACI,aAAa,KAAa,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACtE;;;OAGG;IACI,cAAc,KAAW,MAAM,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IACpF;;;OAGG;IACI,2BAA2B,CAAC,OAAe,CAAC;QACjD,IAAI,IAAI,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC;YAChC,IAAI,CAAC,cAAc,EAAE,CAAC;IAC1B,CAAC;IACD;;OAEG;IACI,aAAa,CAAC,KAAgB;QACnC,OAAO,QAAQ,CAAC,gBAAgB,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,EAAE,CAAC,IAAI,QAAQ,CAAC,gBAAgB,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC;IACtG,CAAC;IACD;;OAEG;IACH,IAAW,SAAS,KAAc,OAAO,IAAI,CAAC,EAAE,KAAK,GAAG,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;IAC9E;;OAEG;IACH,IAAW,iBAAiB,KAAc,OAAO,IAAI,CAAC,EAAE,KAAK,GAAG,IAAI,IAAI,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;IAEtF;;;;;;;OAOG;IACI,8BAA8B,CAAC,EAAU,EAAE,EAAU;QAC1D,MAAM,IAAI,GAAG,EAAE,GAAG,EAAE,CAAC;QACrB,MAAM,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC;QAC/B,MAAM,EAAE,GAAG,EAAE,GAAG,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC;QAC/B,MAAM,IAAI,GAAG,EAAE,GAAG,EAAE,CAAC;QACrB,IAAI,EAAE,GAAG,CAAC,EAAE;YACV,IAAI,EAAE,IAAI,CAAC;gBAAE,OAAO,IAAI,CAAC,CAAC,sBAAsB;YAChD,mGAAmG;YACnG,MAAM,CAAC,GAAG,CAAC,EAAE,GAAG,IAAI,CAAC;YACrB,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC;YAC5C,OAAO,IAAI,CAAC;SACb;aAAM,IAAI,EAAE,GAAG,CAAC,EAAE;YACjB,IAAI,EAAE,GAAG,CAAC;gBAAE,OAAO,KAAK,CAAC,CAAG,wBAAwB;YACpD,4GAA4G;YAC5G,MAAM,CAAC,GAAG,CAAC,EAAE,GAAG,IAAI,CAAC;YACrB,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC;YAC5C,OAAO,IAAI,CAAC;SACb;QACD,4DAA4D;QAC5D,OAAO,EAAE,GAAG,CAAC,CAAC;IAChB,CAAC;IACD;;;;;OAKG;IACI,iBAAiB;QACtB,IAAI,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC;QACjB,IAAI,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC;QACjB,IAAI,EAAE,GAAG,EAAE,EAAE;YACX,IAAI,EAAE,GAAG,CAAC;gBAAE,EAAE,GAAG,CAAC,CAAC;YACnB,IAAI,EAAE,GAAG,CAAC;gBAAE,EAAE,GAAG,CAAC,CAAC;YACnB,IAAI,EAAE,IAAI,EAAE;gBACV,OAAO,KAAK,CAAC;SAChB;aAAM;YACL,IAAI,EAAE,GAAG,CAAC;gBAAE,EAAE,GAAG,CAAC,CAAC;YACnB,IAAI,EAAE,GAAG,CAAC;gBAAE,EAAE,GAAG,CAAC,CAAC;YACnB,IAAI,EAAE,IAAI,EAAE;gBACV,OAAO,KAAK,CAAC;SAChB;QACD,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACjB,OAAO,IAAI,CAAC;IACd,CAAC;CAEF","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module CartesianGeometry\r\n */\r\n\r\nimport { Geometry } from \"../Geometry\";\r\n\r\n/**\r\n * * A Segment1d is an interval of an axis named x.\r\n * * The interval is defined by two values x0 and x1.\r\n * * The x0 and x1 values can be in either order.\r\n *   * if `x0 < x1` fractional coordinates within the segment move from left to right.\r\n *   * if `x0 > x1` fractional coordinates within the segment move from right to left.\r\n * * This differs from a Range1d in that:\r\n * * For a Range1d the reversed ordering of its limit values means \"empty interval\".\r\n * * For a Segment1d the reversed ordering is a real interval but fractional positions move backwards.\r\n * * The segment is parameterized with a fraction\r\n * * * Fraction 0 is the start (`x0`)\r\n * * * Fraction 1 is the end (`x1`)\r\n * * * The fraction equation is `x = x0 + fraction * (x1-x0)` or (equivalently) `x = (1-fraction) * x0 + fraction * x1`\r\n * @public\r\n */\r\nexport class Segment1d {\r\n  /** start coordinate */\r\n  public x0: number;\r\n  /** end coordinate */\r\n  public x1: number;\r\n  private constructor(x0: number, x1: number) {\r\n    this.x0 = x0;\r\n    this.x1 = x1;\r\n  }\r\n  /**\r\n   * replace both end values.\r\n   * @param x0 new x0 value\r\n   * @param x1 new y0 value\r\n   */\r\n  public set(x0: number, x1: number) { this.x0 = x0, this.x1 = x1; }\r\n  /**\r\n   * shift (translate) the segment along its axis by adding `dx` to both `x0` and `x1`.\r\n   * @param dx value to add to both x0 and x1\r\n   */\r\n  public shift(dx: number) { this.x0 += dx, this.x1 += dx; }\r\n  /**\r\n   * create segment1d with given end values\r\n   * @param x0 start value\r\n   * @param x1 end value\r\n   * @param result optional pre-existing result to be reinitialized.\r\n   */\r\n  public static create(x0: number = 0, x1: number = 1, result?: Segment1d): Segment1d {\r\n    if (!result)\r\n      return new Segment1d(x0, x1);\r\n    result.set(x0, x1);\r\n    return result;\r\n  }\r\n  /**\r\n   * Copy both end values from other Segment1d\r\n   * @param other source Segment1d\r\n   */\r\n  public setFrom(other: Segment1d) { this.x0 = other.x0; this.x1 = other.x1; }\r\n  /**\r\n   * clone this Segment1d, return as a separate object.\r\n   */\r\n  public clone(): Segment1d { return new Segment1d(this.x0, this.x1); }\r\n  /**\r\n   * Returns true if both coordinates (`x0` and `x1`) are in the 0..1 range.\r\n   */\r\n  public get isIn01() {\r\n    return Geometry.isIn01(this.x0) && Geometry.isIn01(this.x1);\r\n\r\n  }\r\n  /**\r\n   * Evaluate the segment at fractional position\r\n   * @returns position within the segment\r\n   * @param fraction fractional position within this segment\r\n   */\r\n  public fractionToPoint(fraction: number): number { return Geometry.interpolate(this.x0, fraction, this.x1); }\r\n  /**\r\n   * Return the signed start-to-end shift (aka signed distance)\r\n   */\r\n  public signedDelta(): number { return this.x1 - this.x0; }\r\n  /**\r\n   * Return the absolute start-to-end shift (aka distance)\r\n   */\r\n  public absoluteDelta(): number { return Math.abs(this.x1 - this.x0); }\r\n  /**\r\n   * * swap the x0 and x1 member values.\r\n   * * This makes the fractionToPoint evaluates reverse direction.\r\n   */\r\n  public reverseInPlace(): void { const x = this.x0; this.x0 = this.x1; this.x1 = x; }\r\n  /**\r\n   * * if `x1<x0` multiplied by the scale factor is (strictly) negative, swap the x0 and x1 member values.\r\n   * * This makes the fractionToPoint evaluates reverse direction.\r\n   */\r\n  public reverseIfNeededForDeltaSign(sign: number = 1): void {\r\n    if (sign * (this.x1 - this.x0) < 0)\r\n      this.reverseInPlace();\r\n  }\r\n  /**\r\n   * Near equality test, using Geometry.isSameCoordinate for tolerances.\r\n   */\r\n  public isAlmostEqual(other: Segment1d): boolean {\r\n    return Geometry.isSameCoordinate(this.x0, other.x0) && Geometry.isSameCoordinate(this.x1, other.x1);\r\n  }\r\n  /**\r\n   * Return true if the segment limits are (exactly) 0 and 1\r\n   */\r\n  public get isExact01(): boolean { return this.x0 === 0.0 && this.x1 === 1.0; }\r\n  /**\r\n   * Return true if the segment limits are (exactly) 1 and 0\r\n   */\r\n  public get isExact01Reversed(): boolean { return this.x0 === 1.0 && this.x1 === 0.0; }\r\n\r\n  /** On input, `this` is an interval of a line.  On output, the interval has been clipped to positive parts of a linear function\r\n   * * f0 and f1 are values at parameter values 0 and 1 (which are in general NOT x0 and x1)\r\n   * * From that determine where the segment crosses function value 0.\r\n   * * The segment contains some interval in the same parameter space.\r\n   * * Clip the segment to the positive part of the space.\r\n   * * Return true (and modify the segment) if any of the segment remains.\r\n   * * Return false (but without modifying the segment) if the active part is entirely out.\r\n   */\r\n  public clipBy01FunctionValuesPositive(f0: number, f1: number): boolean {\r\n    const df01 = f1 - f0;\r\n    const fA = f0 + this.x0 * df01;\r\n    const fB = f0 + this.x1 * df01;\r\n    const dfAB = fB - fA;\r\n    if (fA > 0) {\r\n      if (fB >= 0) return true; // inside at both ends\r\n      /** There is an inside to outside crossing. The division is safe ... (and value between 0 and 1) */\r\n      const u = -fA / dfAB;\r\n      this.x1 = this.x0 + u * (this.x1 - this.x0);\r\n      return true;\r\n    } else if (fA < 0) {\r\n      if (fB < 0) return false;   // outside at both ends.\r\n      /** There is an outside to inside crossing crossing. The division is safe ... (and value between 0 and 1) */\r\n      const u = -fA / dfAB;\r\n      this.x0 = this.x0 + u * (this.x1 - this.x0);\r\n      return true;\r\n    }\r\n    /** fA is on the cut.   fB determines the entire segment. */\r\n    return fB > 0;\r\n  }\r\n  /**\r\n   * * On input, (f0,f1) is a (directed) segment.\r\n   * * On output, it is restricted to (0,1) while maintaining direction\r\n   * * If the clip leaves nothing, leave this segment alone and return false.\r\n   * * If the clip leaves something, update this segment and return true.\r\n   */\r\n  public clampDirectedTo01(): boolean {\r\n    let x0 = this.x0;\r\n    let x1 = this.x1;\r\n    if (x1 > x0) {\r\n      if (x0 < 0) x0 = 0;\r\n      if (x1 > 1) x1 = 1;\r\n      if (x0 >= x1)\r\n        return false;\r\n    } else {\r\n      if (x0 > 1) x0 = 1;\r\n      if (x1 < 0) x1 = 0;\r\n      if (x0 <= x1)\r\n        return false;\r\n    }\r\n    this.set(x0, x1);\r\n    return true;\r\n  }\r\n\r\n}\r\n"]}

package/lib/esm/geometry3d/SortablePolygon.d.ts

@@ -0,0 +1,50 @@
+/** @packageDocumentation
+ * @module CartesianGeometry
+ */
+import { AnyRegion } from "../curve/CurveChain";
+import { Loop } from "../curve/Loop";
+import { IndexedReadWriteXYZCollection, IndexedXYZCollection } from "./IndexedXYZCollection";
+import { Point3d } from "./Point3dVector3d";
+import { Range3d } from "./Range";
+/**
+ * A `SortablePolygon` carries a (single) loop with data useful for sorting for inner-outer structure.
+ * @internal
+ */
+export declare class SortablePolygon {
+    private _loopCarrier;
+    anyPoint?: Point3d;
+    sortKey: number;
+    range: Range3d;
+    parentIndex?: number;
+    isHole: boolean;
+    outputSetIndex?: number;
+    /**
+     *
+     * @param loop Loop to capture.
+     */
+    constructor(loop: IndexedReadWriteXYZCollection | Loop, range: Range3d);
+    /** Push loop with sort data onto the array.
+     * * No action if no clear normal.
+     * * return true if pushed.
+     */
+    static pushPolygon(loops: SortablePolygon[], loop: IndexedReadWriteXYZCollection): boolean;
+    /** Push loop with sort data onto the array.
+     * * No action if no clear normal.
+     * * return true if pushed.
+     */
+    static pushLoop(loops: SortablePolygon[], loop: Loop): boolean;
+    /** Push loop with sort data onto the array.
+     * * No action if no clear normal.
+     * * return true if pushed.
+     */
+    private static assignParentsAndDepth;
+    private static assemblePolygonSet;
+    private static assembleLoopSet;
+    static sortAsAnyRegion(loops: SortablePolygon[]): AnyRegion;
+    static sortAsArrayOfArrayOfPolygons(loops: SortablePolygon[]): IndexedReadWriteXYZCollection[][];
+    grabPolygon(): IndexedXYZCollection | undefined;
+    grabLoop(): Loop | undefined;
+    reverseForAreaSign(targetSign: number): void;
+    getAnyInteriorPoint(): Point3d | undefined;
+}
+//# sourceMappingURL=SortablePolygon.d.ts.map

package/lib/esm/geometry3d/SortablePolygon.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"SortablePolygon.d.ts","sourceRoot":"","sources":["../../../src/geometry3d/SortablePolygon.ts"],"names":[],"mappings":"AAKA;;GAEG;AACH,OAAO,EAAE,SAAS,EAAE,MAAM,qBAAqB,CAAC;AAIhD,OAAO,EAAE,IAAI,EAAE,MAAM,eAAe,CAAC;AAIrC,OAAO,EAAE,6BAA6B,EAAE,oBAAoB,EAAE,MAAM,wBAAwB,CAAC;AAC7F,OAAO,EAAE,OAAO,EAAE,MAAM,mBAAmB,CAAC;AAE5C,OAAO,EAAE,OAAO,EAAE,MAAM,SAAS,CAAC;AAsKlC;;;GAGG;AACH,qBAAa,eAAe;IAC1B,OAAO,CAAC,YAAY,CAAsB;IACnC,QAAQ,CAAC,EAAE,OAAO,CAAC;IACnB,OAAO,EAAE,MAAM,CAAC;IAChB,KAAK,EAAE,OAAO,CAAC;IACf,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,MAAM,EAAE,OAAO,CAAC;IAChB,cAAc,CAAC,EAAE,MAAM,CAAC;IAC/B;;;OAGG;gBACgB,IAAI,EAAE,6BAA6B,GAAG,IAAI,EAAE,KAAK,EAAE,OAAO;IAS7E;;;OAGG;WACW,WAAW,CAAC,KAAK,EAAE,eAAe,EAAE,EAAE,IAAI,EAAE,6BAA6B,GAAG,OAAO;IASjG;;;OAGG;WACW,QAAQ,CAAC,KAAK,EAAE,eAAe,EAAE,EAAE,IAAI,EAAE,IAAI,GAAG,OAAO;IASrE;;;OAGG;IACH,OAAO,CAAC,MAAM,CAAC,qBAAqB;IAyBpC,OAAO,CAAC,MAAM,CAAC,kBAAkB;IAwBjC,OAAO,CAAC,MAAM,CAAC,eAAe;WAuChB,eAAe,CAAC,KAAK,EAAE,eAAe,EAAE,GAAG,SAAS;WAYpD,4BAA4B,CAAC,KAAK,EAAE,eAAe,EAAE,GAAG,6BAA6B,EAAE,EAAE;IAIhG,WAAW,IAAI,oBAAoB,GAAG,SAAS;IAG/C,QAAQ,IAAI,IAAI,GAAG,SAAS;IAG5B,kBAAkB,CAAC,UAAU,EAAE,MAAM;IAGrC,mBAAmB,IAAI,OAAO,GAAG,SAAS;CAGlD"}

package/lib/esm/geometry3d/SortablePolygon.js

@@ -0,0 +1,312 @@
+/*---------------------------------------------------------------------------------------------
+* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+* See LICENSE.md in the project root for license terms and full copyright notice.
+*--------------------------------------------------------------------------------------------*/
+import { CurveChain } from "../curve/CurveCollection";
+import { CurvePrimitive } from "../curve/CurvePrimitive";
+import { LineString3d } from "../curve/LineString3d";
+import { Loop } from "../curve/Loop";
+import { ParityRegion } from "../curve/ParityRegion";
+import { RegionOps } from "../curve/RegionOps";
+import { UnionRegion } from "../curve/UnionRegion";
+import { IndexedReadWriteXYZCollection } from "./IndexedXYZCollection";
+import { PolygonOps } from "./PolygonOps";
+/** abstract base class for area-related queries of a loop.
+ * * subclasses have particular logic for `Loop` and polygon data.
+ * @internal
+ */
+class SimpleRegionCarrier {
+}
+/**
+ * Implement `LoopCarrier` queries with the area as a polygon carried in an `IndexedReadWriteXYZCollection`
+ */
+class PolygonCarrier extends SimpleRegionCarrier {
+    constructor(data) {
+        super();
+        this.data = data;
+        this._signedArea = PolygonOps.areaXY(data);
+    }
+    get signedArea() { return this._signedArea; }
+    /**
+     * classify xy parts of point wrt this loop.
+     * @param xy
+     * @internal
+     */
+    classifyPointXY(xy) {
+        return PolygonOps.classifyPointInPolygonXY(xy.x, xy.y, this.data);
+    }
+    /** Return some point "inside"
+     * NEEDS WORK: this returns a point ON --
+     */
+    getAnyInteriorPoint() {
+        for (let childIndex = 0; childIndex < this.data.length; childIndex++) {
+            const q = this.constructInteriorPointNearEdge(childIndex, 0.2349);
+            if (q !== undefined)
+                return q;
+        }
+        return undefined;
+    }
+    grabPolygon() { return this.data; }
+    grabLoop() {
+        return Loop.createPolygon(this.data);
+    }
+    reverseForAreaSign(targetSign) {
+        if (targetSign * this._signedArea < 0.0) {
+            this.data.reverseInPlace();
+            this._signedArea *= -1.0;
+        }
+    }
+    constructInteriorPointNearEdge(edgeIndex, fractionAlong) {
+        if (edgeIndex + 1 < this.data.length) {
+            const point0 = this.data.getPoint3dAtUncheckedPointIndex(edgeIndex);
+            const point1 = this.data.getPoint3dAtUncheckedPointIndex(edgeIndex + 1);
+            const vector = point0.vectorTo(point1);
+            const point = point0.interpolate(fractionAlong, point1);
+            vector.rotate90CCWXY(vector);
+            if (vector.normalizeInPlace()) {
+                if (this._signedArea < 0)
+                    vector.scaleInPlace(-1.0);
+                const refDistance = Math.sqrt(Math.abs(this._signedArea));
+                for (let fraction = 1.0e-5; fraction < 3; fraction *= 5.0) {
+                    const candidatePoint = point.plusScaled(vector, fraction * refDistance);
+                    if (1 === this.classifyPointXY(candidatePoint))
+                        return candidatePoint;
+                }
+            }
+        }
+        return undefined;
+    }
+}
+/**
+ * Implement `LoopCarrier` queries with the area as a strongly typed `Loop`
+ */
+class LoopCarrier extends SimpleRegionCarrier {
+    constructor(data) {
+        super();
+        this.data = data;
+        const areaMoments = RegionOps.computeXYAreaMoments(data);
+        this._signedArea = areaMoments !== undefined ? areaMoments.quantitySum : 0.0;
+    }
+    get signedArea() { return this._signedArea; }
+    /**
+     * classify xy parts of point wrt this loop.
+     * @param xy
+     * @internal
+     */
+    classifyPointXY(xy) {
+        return RegionOps.testPointInOnOutRegionXY(this.data, xy.x, xy.y);
+    }
+    constructInteriorPointNearChild(childIndex, fractionAlong) {
+        if (childIndex < this.data.children.length) {
+            const primitive = this.data.children[childIndex];
+            const ray = primitive.fractionToPointAndUnitTangent(fractionAlong);
+            ray.direction.rotate90CCWXY(ray.direction);
+            if (this._signedArea < 0.0)
+                ray.direction.scaleInPlace(-1.0);
+            const refDistance = Math.sqrt(Math.abs(this._signedArea));
+            for (let fraction = 1.0e-5; fraction < 3; fraction *= 5.0) {
+                const candidatePoint = ray.fractionToPoint(fraction * refDistance);
+                if (1 === this.classifyPointXY(candidatePoint))
+                    return candidatePoint;
+            }
+        }
+        return undefined;
+    }
+    /** Return some point "inside"
+     * NEEDS WORK: this returns a point ON --
+     */
+    getAnyInteriorPoint() {
+        for (let childIndex = 0; childIndex < this.data.children.length; childIndex++) {
+            const q = this.constructInteriorPointNearChild(childIndex, 0.2349);
+            if (q !== undefined)
+                return q;
+        }
+        return undefined;
+    }
+    grabPolygon() {
+        const strokes = this.data.cloneStroked();
+        if (strokes instanceof CurveChain) {
+            const linestring = LineString3d.create();
+            for (const child of strokes.children) {
+                if (child instanceof CurvePrimitive) {
+                    child.emitStrokes(linestring);
+                }
+            }
+            return linestring.numPoints() > 0 ? linestring.packedPoints : undefined;
+        }
+        return undefined;
+    }
+    grabLoop() {
+        return this.data;
+    }
+    reverseForAreaSign(targetSign) {
+        if (targetSign * this._signedArea < 0.0) {
+            this.data.reverseChildrenInPlace();
+            this._signedArea *= -1.0;
+        }
+    }
+}
+/**
+ * A `SortablePolygon` carries a (single) loop with data useful for sorting for inner-outer structure.
+ * @internal
+ */
+export class SortablePolygon {
+    /**
+     *
+     * @param loop Loop to capture.
+     */
+    constructor(loop, range) {
+        if (loop instanceof IndexedReadWriteXYZCollection)
+            this._loopCarrier = new PolygonCarrier(loop);
+        else
+            this._loopCarrier = new LoopCarrier(loop);
+        this.range = range;
+        this.sortKey = Math.abs(this._loopCarrier.signedArea);
+        this.isHole = false;
+    }
+    /** Push loop with sort data onto the array.
+     * * No action if no clear normal.
+     * * return true if pushed.
+     */
+    static pushPolygon(loops, loop) {
+        const range = loop.getRange();
+        const sortablePolygon = new SortablePolygon(loop, range);
+        if (sortablePolygon.sortKey > 0.0) {
+            loops.push(sortablePolygon);
+            return true;
+        }
+        return false;
+    }
+    /** Push loop with sort data onto the array.
+     * * No action if no clear normal.
+     * * return true if pushed.
+     */
+    static pushLoop(loops, loop) {
+        const range = loop.range();
+        const sortablePolygon = new SortablePolygon(loop, range);
+        if (sortablePolygon.sortKey > 0.0) {
+            loops.push(sortablePolygon);
+            return true;
+        }
+        return false;
+    }
+    /** Push loop with sort data onto the array.
+     * * No action if no clear normal.
+     * * return true if pushed.
+     */
+    static assignParentsAndDepth(loops) {
+        // Sort largest to smallest ...
+        loops.sort((loopA, loopB) => (loopB.sortKey - loopA.sortKey));
+        // starting with smallest loop, point each loop to smallest containing parent.
+        for (let i = loops.length; i-- > 0;) {
+            const thisLoop = loops[i];
+            const xy = thisLoop._loopCarrier.getAnyInteriorPoint();
+            if (xy !== undefined) {
+                // find smallest containing parent (search forward only to hit)
+                loops[i].parentIndex = undefined;
+                loops[i].outputSetIndex = undefined;
+                for (let j = i; j-- > 0;) {
+                    const otherLoop = loops[j];
+                    if (otherLoop.range.containsXY(xy.x, xy.y)) {
+                        if (1 === otherLoop._loopCarrier.classifyPointXY(xy)) {
+                            thisLoop.parentIndex = j;
+                            // The loops are searched from small area to larger.  Any other containing loop is larger, so otherLoop must be the smallest.
+                            break;
+                        }
+                    }
+                }
+            }
+        }
+    }
+    static assemblePolygonSet(loops) {
+        const outputSets = [];
+        // In large-to-small order:
+        // If a loop has no parent or has a "hole" as parent it is outer.
+        // otherwise (i.e. it has a non-hole parent) it becomes a hole in the parent.
+        for (const loopData of loops) {
+            loopData.isHole = false;
+            const parentIndex = loopData.parentIndex;
+            if (parentIndex !== undefined)
+                loopData.isHole = !loops[parentIndex].isHole;
+            if (!loopData.isHole) {
+                loopData._loopCarrier.reverseForAreaSign(1.0);
+                loopData.outputSetIndex = outputSets.length;
+                outputSets.push([]);
+                outputSets[loopData.outputSetIndex].push(loopData._loopCarrier.grabPolygon());
+            }
+            else {
+                loopData._loopCarrier.reverseForAreaSign(-1.0);
+                const outputSetIndex = loops[parentIndex].outputSetIndex;
+                outputSets[outputSetIndex].push(loopData._loopCarrier.grabPolygon());
+            }
+        }
+        return outputSets;
+    }
+    static assembleLoopSet(loops) {
+        const outputSets = [];
+        const numLoops = loops.length;
+        // In large-to-small order:
+        // If a loop has no parent or has a "hole" as parent it is outer.
+        // otherwise (i.e. it has a non-hole parent) it becomes a hole in the parent.
+        for (let candidateIndex = 0; candidateIndex < numLoops; candidateIndex++) {
+            const candidateData = loops[candidateIndex];
+            const parentIndex = candidateData.parentIndex;
+            candidateData.isHole = parentIndex !== undefined ? !loops[parentIndex].isHole : false;
+            if (!candidateData.isHole) {
+                candidateData._loopCarrier.reverseForAreaSign(1.0);
+                const candidateLoop = candidateData._loopCarrier.grabLoop();
+                let candidateParityRegion;
+                // find all directly contained children . . .
+                for (let childIndex = candidateIndex + 1; childIndex < numLoops; childIndex++) {
+                    const childData = loops[childIndex];
+                    if (childData.parentIndex === candidateIndex) {
+                        if (candidateParityRegion === undefined) {
+                            candidateParityRegion = ParityRegion.create();
+                            candidateParityRegion.tryAddChild(candidateLoop);
+                            childData._loopCarrier.reverseForAreaSign(-1.0);
+                            candidateParityRegion.tryAddChild(childData._loopCarrier.grabLoop());
+                        }
+                        else {
+                            childData._loopCarrier.reverseForAreaSign(-1.0);
+                            candidateParityRegion.tryAddChild(childData._loopCarrier.grabLoop());
+                        }
+                    }
+                }
+                if (candidateParityRegion !== undefined)
+                    outputSets.push(candidateParityRegion);
+                else if (candidateLoop !== undefined)
+                    outputSets.push(candidateLoop);
+            }
+        }
+        return outputSets;
+    }
+    static sortAsAnyRegion(loops) {
+        this.assignParentsAndDepth(loops);
+        const regions = this.assembleLoopSet(loops);
+        if (regions.length === 1)
+            return regions[0];
+        else {
+            const unionRegion = UnionRegion.create();
+            for (const region of regions)
+                unionRegion.tryAddChild(region);
+            return unionRegion;
+        }
+    }
+    static sortAsArrayOfArrayOfPolygons(loops) {
+        this.assignParentsAndDepth(loops);
+        return this.assemblePolygonSet(loops);
+    }
+    grabPolygon() {
+        return this._loopCarrier.grabPolygon();
+    }
+    grabLoop() {
+        return this._loopCarrier.grabLoop();
+    }
+    reverseForAreaSign(targetSign) {
+        this._loopCarrier.reverseForAreaSign(targetSign);
+    }
+    getAnyInteriorPoint() {
+        return this._loopCarrier.getAnyInteriorPoint();
+    }
+}
+//# sourceMappingURL=SortablePolygon.js.map

package/lib/esm/geometry3d/SortablePolygon.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"SortablePolygon.js","sourceRoot":"","sources":["../../../src/geometry3d/SortablePolygon.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAM/F,OAAO,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AACtD,OAAO,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAC;AACzD,OAAO,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AACrD,OAAO,EAAE,IAAI,EAAE,MAAM,eAAe,CAAC;AACrC,OAAO,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AACrD,OAAO,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAC;AAC/C,OAAO,EAAE,WAAW,EAAE,MAAM,sBAAsB,CAAC;AACnD,OAAO,EAAE,6BAA6B,EAAwB,MAAM,wBAAwB,CAAC;AAE7F,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAI1C;;;GAGG;AACH,MAAe,mBAAmB;CAuBjC;AACD;;GAEG;AACH,MAAM,cAAe,SAAQ,mBAAmB;IAI9C,YAAmB,IAAmC;QACpD,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,WAAW,GAAG,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAC7C,CAAC;IALD,IAAW,UAAU,KAAa,OAAO,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;IAM5D;;;;OAIG;IACI,eAAe,CAAC,EAAS;QAC9B,OAAO,UAAU,CAAC,wBAAwB,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;IACpE,CAAC;IACD;;OAEG;IACI,mBAAmB;QACxB,KAAK,IAAI,UAAU,GAAG,CAAC,EAAE,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,UAAU,EAAE,EAAE;YACpE,MAAM,CAAC,GAAG,IAAI,CAAC,8BAA8B,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC;YAClE,IAAI,CAAC,KAAK,SAAS;gBACjB,OAAO,CAAC,CAAC;SACZ;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACM,WAAW,KAAgD,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IAC9E,QAAQ;QACb,OAAO,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACvC,CAAC;IACM,kBAAkB,CAAC,UAAkB;QAC1C,IAAI,UAAU,GAAG,IAAI,CAAC,WAAW,GAAG,GAAG,EAAE;YACvC,IAAI,CAAC,IAAI,CAAC,cAAc,EAAE,CAAC;YAC3B,IAAI,CAAC,WAAW,IAAI,CAAC,GAAG,CAAC;SAC1B;IACH,CAAC;IACM,8BAA8B,CAAC,SAAiB,EAAE,aAAqB;QAC5E,IAAI,SAAS,GAAG,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;YACpC,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,+BAA+B,CAAC,SAAS,CAAC,CAAC;YACpE,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,+BAA+B,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC;YACxE,MAAM,MAAM,GAAG,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;YACvC,MAAM,KAAK,GAAG,MAAM,CAAC,WAAW,CAAC,aAAa,EAAE,MAAM,CAAC,CAAC;YACxD,MAAM,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;YAC7B,IAAI,MAAM,CAAC,gBAAgB,EAAE,EAAE;gBAC7B,IAAI,IAAI,CAAC,WAAW,GAAG,CAAC;oBACtB,MAAM,CAAC,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC;gBAC5B,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;gBAC1D,KAAK,IAAI,QAAQ,GAAG,MAAM,EAAE,QAAQ,GAAG,CAAC,EAAE,QAAQ,IAAI,GAAG,EAAE;oBACzD,MAAM,cAAc,GAAG,KAAK,CAAC,UAAU,CAAC,MAAM,EAAE,QAAQ,GAAG,WAAW,CAAC,CAAC;oBACxE,IAAI,CAAC,KAAK,IAAI,CAAC,eAAe,CAAC,cAAc,CAAC;wBAC5C,OAAO,cAAc,CAAC;iBACzB;aACF;SACF;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;CAEF;AACD;;GAEG;AACH,MAAM,WAAY,SAAQ,mBAAmB;IAI3C,YAAmB,IAAU;QAC3B,KAAK,EAAE,CAAC;QACR,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,MAAM,WAAW,GAAG,SAAS,CAAC,oBAAoB,CAAC,IAAI,CAAC,CAAC;QACzD,IAAI,CAAC,WAAW,GAAG,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,WAAW,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,CAAC;IAC/E,CAAC;IAND,IAAW,UAAU,KAAa,OAAO,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;IAO5D;;;;OAIG;IACI,eAAe,CAAC,EAAS;QAC9B,OAAO,SAAS,CAAC,wBAAwB,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IACnE,CAAC;IACM,+BAA+B,CAAC,UAAkB,EAAE,aAAqB;QAC9E,IAAI,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE;YAC1C,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;YACjD,MAAM,GAAG,GAAG,SAAS,CAAC,6BAA6B,CAAC,aAAa,CAAC,CAAC;YACnE,GAAG,CAAC,SAAS,CAAC,aAAa,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YAC3C,IAAI,IAAI,CAAC,WAAW,GAAG,GAAG;gBACxB,GAAG,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC;YACnC,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;YAC1D,KAAK,IAAI,QAAQ,GAAG,MAAM,EAAE,QAAQ,GAAG,CAAC,EAAE,QAAQ,IAAI,GAAG,EAAE;gBACzD,MAAM,cAAc,GAAG,GAAG,CAAC,eAAe,CAAC,QAAQ,GAAG,WAAW,CAAC,CAAC;gBACnE,IAAI,CAAC,KAAK,IAAI,CAAC,eAAe,CAAC,cAAc,CAAC;oBAC5C,OAAO,cAAc,CAAC;aACzB;SACF;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;OAEG;IACI,mBAAmB;QACxB,KAAK,IAAI,UAAU,GAAG,CAAC,EAAE,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,UAAU,EAAE,EAAE;YAC7E,MAAM,CAAC,GAAG,IAAI,CAAC,+BAA+B,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC;YACnE,IAAI,CAAC,KAAK,SAAS;gBACjB,OAAO,CAAC,CAAC;SACZ;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACM,WAAW;QAChB,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE,CAAC;QACzC,IAAI,OAAO,YAAY,UAAU,EAAE;YACjC,MAAM,UAAU,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC;YACzC,KAAK,MAAM,KAAK,IAAI,OAAO,CAAC,QAAQ,EAAE;gBACpC,IAAI,KAAK,YAAY,cAAc,EAAE;oBACnC,KAAK,CAAC,WAAW,CAAC,UAAU,CAAC,CAAC;iBAC/B;aACF;YACD,OAAO,UAAU,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,YAAY,CAAC,CAAC,CAAC,SAAS,CAAC;SACzE;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACM,QAAQ;QACb,OAAO,IAAI,CAAC,IAAI,CAAC;IACnB,CAAC;IACM,kBAAkB,CAAC,UAAkB;QAC1C,IAAI,UAAU,GAAG,IAAI,CAAC,WAAW,GAAG,GAAG,EAAE;YACvC,IAAI,CAAC,IAAI,CAAC,sBAAsB,EAAE,CAAC;YACnC,IAAI,CAAC,WAAW,IAAI,CAAC,GAAG,CAAC;SAC1B;IACH,CAAC;CACF;AAED;;;GAGG;AACH,MAAM,OAAO,eAAe;IAQ1B;;;OAGG;IACH,YAAmB,IAA0C,EAAE,KAAc;QAC3E,IAAI,IAAI,YAAY,6BAA6B;YAC/C,IAAI,CAAC,YAAY,GAAG,IAAI,cAAc,CAAC,IAAI,CAAC,CAAC;;YAE7C,IAAI,CAAC,YAAY,GAAG,IAAI,WAAW,CAAC,IAAI,CAAC,CAAC;QAC5C,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,UAAU,CAAC,CAAC;QACtD,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;IACtB,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,WAAW,CAAC,KAAwB,EAAE,IAAmC;QACrF,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;QAC9B,MAAM,eAAe,GAAG,IAAI,eAAe,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QACzD,IAAI,eAAe,CAAC,OAAO,GAAG,GAAG,EAAE;YACjC,KAAK,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;YAC5B,OAAO,IAAI,CAAC;SACb;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,QAAQ,CAAC,KAAwB,EAAE,IAAU;QACzD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;QAC3B,MAAM,eAAe,GAAG,IAAI,eAAe,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QACzD,IAAI,eAAe,CAAC,OAAO,GAAG,GAAG,EAAE;YACjC,KAAK,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;YAC5B,OAAO,IAAI,CAAC;SACb;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;OAGG;IACK,MAAM,CAAC,qBAAqB,CAAC,KAAwB;QAC3D,+BAA+B;QAC/B,KAAK,CAAC,IAAI,CAAC,CAAC,KAAsB,EAAE,KAAsB,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;QAChG,8EAA8E;QAC9E,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,GAAG,CAAC,GAAG;YACnC,MAAM,QAAQ,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YAC1B,MAAM,EAAE,GAAG,QAAQ,CAAC,YAAY,CAAC,mBAAmB,EAAE,CAAC;YACvD,IAAI,EAAE,KAAK,SAAS,EAAE;gBACpB,+DAA+D;gBAC/D,KAAK,CAAC,CAAC,CAAC,CAAC,WAAW,GAAG,SAAS,CAAC;gBACjC,KAAK,CAAC,CAAC,CAAC,CAAC,cAAc,GAAG,SAAS,CAAC;gBACpC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,GAAG;oBACxB,MAAM,SAAS,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;oBAC3B,IAAI,SAAS,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE;wBAC1C,IAAI,CAAC,KAAK,SAAS,CAAC,YAAY,CAAC,eAAe,CAAC,EAAE,CAAC,EAAE;4BACpD,QAAQ,CAAC,WAAW,GAAG,CAAC,CAAC;4BACzB,6HAA6H;4BAC7H,MAAM;yBACP;qBACF;iBACF;aACF;SACF;IACH,CAAC;IAEO,MAAM,CAAC,kBAAkB,CAAC,KAAwB;QACxD,MAAM,UAAU,GAAsC,EAAE,CAAC;QAEzD,2BAA2B;QAC3B,iEAAiE;QACjE,6EAA6E;QAC7E,KAAK,MAAM,QAAQ,IAAI,KAAK,EAAE;YAC5B,QAAQ,CAAC,MAAM,GAAG,KAAK,CAAC;YACxB,MAAM,WAAW,GAAG,QAAQ,CAAC,WAAW,CAAC;YACzC,IAAI,WAAW,KAAK,SAAS;gBAC3B,QAAQ,CAAC,MAAM,GAAG,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,MAAM,CAAC;YAC/C,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE;gBACpB,QAAQ,CAAC,YAAY,CAAC,kBAAkB,CAAC,GAAG,CAAC,CAAC;gBAC9C,QAAQ,CAAC,cAAc,GAAG,UAAU,CAAC,MAAM,CAAC;gBAC5C,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACpB,UAAU,CAAC,QAAQ,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,YAAY,CAAC,WAAW,EAAG,CAAC,CAAC;aAChF;iBAAM;gBACL,QAAQ,CAAC,YAAY,CAAC,kBAAkB,CAAC,CAAC,GAAG,CAAC,CAAC;gBAC/C,MAAM,cAAc,GAAG,KAAK,CAAC,WAAY,CAAC,CAAC,cAAe,CAAC;gBAC3D,UAAU,CAAC,cAAc,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,YAAY,CAAC,WAAW,EAAG,CAAC,CAAC;aACvE;SACF;QACD,OAAO,UAAU,CAAC;IACpB,CAAC;IACO,MAAM,CAAC,eAAe,CAAC,KAAwB;QACrD,MAAM,UAAU,GAAgB,EAAE,CAAC;QACnC,MAAM,QAAQ,GAAG,KAAK,CAAC,MAAM,CAAC;QAC9B,2BAA2B;QAC3B,iEAAiE;QACjE,6EAA6E;QAC7E,KAAK,IAAI,cAAc,GAAG,CAAC,EAAE,cAAc,GAAG,QAAQ,EAAE,cAAc,EAAE,EAAE;YACxE,MAAM,aAAa,GAAG,KAAK,CAAC,cAAc,CAAC,CAAC;YAC5C,MAAM,WAAW,GAAG,aAAa,CAAC,WAAW,CAAC;YAC9C,aAAa,CAAC,MAAM,GAAG,WAAW,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC;YAEtF,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE;gBACzB,aAAa,CAAC,YAAY,CAAC,kBAAkB,CAAC,GAAG,CAAC,CAAC;gBACnD,MAAM,aAAa,GAAG,aAAa,CAAC,YAAY,CAAC,QAAQ,EAAG,CAAC;gBAC7D,IAAI,qBAA+C,CAAC;gBACpD,6CAA6C;gBAC7C,KAAK,IAAI,UAAU,GAAG,cAAc,GAAG,CAAC,EAAE,UAAU,GAAG,QAAQ,EAAE,UAAU,EAAE,EAAE;oBAC7E,MAAM,SAAS,GAAG,KAAK,CAAC,UAAU,CAAC,CAAC;oBACpC,IAAI,SAAS,CAAC,WAAW,KAAK,cAAc,EAAE;wBAC5C,IAAI,qBAAqB,KAAK,SAAS,EAAE;4BACvC,qBAAqB,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC;4BAC9C,qBAAqB,CAAC,WAAW,CAAC,aAAa,CAAC,CAAC;4BACjD,SAAS,CAAC,YAAY,CAAC,kBAAkB,CAAC,CAAC,GAAG,CAAC,CAAC;4BAChD,qBAAqB,CAAC,WAAW,CAAC,SAAS,CAAC,YAAY,CAAC,QAAQ,EAAE,CAAC,CAAC;yBACtE;6BAAM;4BACL,SAAS,CAAC,YAAY,CAAC,kBAAkB,CAAC,CAAC,GAAG,CAAC,CAAC;4BAChD,qBAAqB,CAAC,WAAW,CAAC,SAAS,CAAC,YAAY,CAAC,QAAQ,EAAE,CAAC,CAAC;yBACtE;qBACF;iBACF;gBACD,IAAI,qBAAqB,KAAK,SAAS;oBACrC,UAAU,CAAC,IAAI,CAAC,qBAAqB,CAAC,CAAC;qBACpC,IAAI,aAAa,KAAK,SAAS;oBAClC,UAAU,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;aAClC;SACF;QACD,OAAO,UAAU,CAAC;IACpB,CAAC;IAEM,MAAM,CAAC,eAAe,CAAC,KAAwB;QACpD,IAAI,CAAC,qBAAqB,CAAC,KAAK,CAAC,CAAC;QAClC,MAAM,OAAO,GAAG,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC;QAC5C,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YACtB,OAAO,OAAO,CAAC,CAAC,CAAC,CAAC;aACf;YACH,MAAM,WAAW,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC;YACzC,KAAK,MAAM,MAAM,IAAI,OAAO;gBAC1B,WAAW,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;YAClC,OAAO,WAAW,CAAC;SACpB;IACH,CAAC;IACM,MAAM,CAAC,4BAA4B,CAAC,KAAwB;QACjE,IAAI,CAAC,qBAAqB,CAAC,KAAK,CAAC,CAAC;QAClC,OAAO,IAAI,CAAC,kBAAkB,CAAC,KAAK,CAAC,CAAC;IACxC,CAAC;IACM,WAAW;QAChB,OAAO,IAAI,CAAC,YAAY,CAAC,WAAW,EAAE,CAAC;IACzC,CAAC;IACM,QAAQ;QACb,OAAO,IAAI,CAAC,YAAY,CAAC,QAAQ,EAAE,CAAC;IACtC,CAAC;IACM,kBAAkB,CAAC,UAAkB;QAC1C,IAAI,CAAC,YAAY,CAAC,kBAAkB,CAAC,UAAU,CAAC,CAAC;IACnD,CAAC;IACM,mBAAmB;QACxB,OAAO,IAAI,CAAC,YAAY,CAAC,mBAAmB,EAAE,CAAC;IACjD,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\r\n/** @packageDocumentation\r\n * @module CartesianGeometry\r\n */\r\nimport { AnyRegion } from \"../curve/CurveChain\";\r\nimport { CurveChain } from \"../curve/CurveCollection\";\r\nimport { CurvePrimitive } from \"../curve/CurvePrimitive\";\r\nimport { LineString3d } from \"../curve/LineString3d\";\r\nimport { Loop } from \"../curve/Loop\";\r\nimport { ParityRegion } from \"../curve/ParityRegion\";\r\nimport { RegionOps } from \"../curve/RegionOps\";\r\nimport { UnionRegion } from \"../curve/UnionRegion\";\r\nimport { IndexedReadWriteXYZCollection, IndexedXYZCollection } from \"./IndexedXYZCollection\";\r\nimport { Point3d } from \"./Point3dVector3d\";\r\nimport { PolygonOps } from \"./PolygonOps\";\r\nimport { Range3d } from \"./Range\";\r\nimport { XAndY } from \"./XYZProps\";\r\n\r\n/** abstract base class for area-related queries of a loop.\r\n * * subclasses have particular logic for `Loop` and polygon data.\r\n * @internal\r\n */\r\nabstract class SimpleRegionCarrier {\r\n  public abstract classifyPointXY(xy: XAndY): number | undefined;\r\n  // Find any point on an edge.\r\n  // evaluate tangent.\r\n  // move to left or right according to signedArea, producing an interior point for the loop.\r\n  public abstract getAnyInteriorPoint(): Point3d | undefined;\r\n  /**\r\n   * * grab the loop formatted as a simple polygon.\r\n   * * stroke if necessary.\r\n   */\r\n  public abstract grabPolygon(): IndexedReadWriteXYZCollection | undefined;\r\n  /**\r\n   * * grab the loop formatted as a strongly typed loop object\r\n   */\r\n  public abstract grabLoop(): Loop | undefined;\r\n  /**\r\n   * (Property access) Return the signed area of the loop\r\n   */\r\n  public abstract get signedArea(): number;\r\n  /**\r\n   * If the current `signedArea` has different sign versus `targetSign`, reverse the loop in place.\r\n   */\r\n  public abstract reverseForAreaSign(targetSign: number): void;\r\n}\r\n/**\r\n * Implement `LoopCarrier` queries with the area as a polygon carried in an `IndexedReadWriteXYZCollection`\r\n */\r\nclass PolygonCarrier extends SimpleRegionCarrier {\r\n  public data: IndexedReadWriteXYZCollection;\r\n  private _signedArea: number;\r\n  public get signedArea(): number { return this._signedArea; }\r\n  public constructor(data: IndexedReadWriteXYZCollection) {\r\n    super();\r\n    this.data = data;\r\n    this._signedArea = PolygonOps.areaXY(data);\r\n  }\r\n  /**\r\n   * classify xy parts of point wrt this loop.\r\n   * @param xy\r\n   * @internal\r\n   */\r\n  public classifyPointXY(xy: XAndY): number | undefined {\r\n    return PolygonOps.classifyPointInPolygonXY(xy.x, xy.y, this.data);\r\n  }\r\n  /** Return some point \"inside\"\r\n   * NEEDS WORK: this returns a point ON --\r\n   */\r\n  public getAnyInteriorPoint(): Point3d | undefined {\r\n    for (let childIndex = 0; childIndex < this.data.length; childIndex++) {\r\n      const q = this.constructInteriorPointNearEdge(childIndex, 0.2349);\r\n      if (q !== undefined)\r\n        return q;\r\n    }\r\n    return undefined;\r\n  }\r\n  public grabPolygon(): IndexedReadWriteXYZCollection | undefined { return this.data; }\r\n  public grabLoop(): Loop | undefined {\r\n    return Loop.createPolygon(this.data);\r\n  }\r\n  public reverseForAreaSign(targetSign: number) {\r\n    if (targetSign * this._signedArea < 0.0) {\r\n      this.data.reverseInPlace();\r\n      this._signedArea *= -1.0;\r\n    }\r\n  }\r\n  public constructInteriorPointNearEdge(edgeIndex: number, fractionAlong: number): Point3d | undefined {\r\n    if (edgeIndex + 1 < this.data.length) {\r\n      const point0 = this.data.getPoint3dAtUncheckedPointIndex(edgeIndex);\r\n      const point1 = this.data.getPoint3dAtUncheckedPointIndex(edgeIndex + 1);\r\n      const vector = point0.vectorTo(point1);\r\n      const point = point0.interpolate(fractionAlong, point1);\r\n      vector.rotate90CCWXY(vector);\r\n      if (vector.normalizeInPlace()) {\r\n        if (this._signedArea < 0)\r\n          vector.scaleInPlace(-1.0);\r\n        const refDistance = Math.sqrt(Math.abs(this._signedArea));\r\n        for (let fraction = 1.0e-5; fraction < 3; fraction *= 5.0) {\r\n          const candidatePoint = point.plusScaled(vector, fraction * refDistance);\r\n          if (1 === this.classifyPointXY(candidatePoint))\r\n            return candidatePoint;\r\n        }\r\n      }\r\n    }\r\n    return undefined;\r\n  }\r\n\r\n}\r\n/**\r\n * Implement `LoopCarrier` queries with the area as a strongly typed `Loop`\r\n */\r\nclass LoopCarrier extends SimpleRegionCarrier {\r\n  public data: Loop;\r\n  private _signedArea: number;\r\n  public get signedArea(): number { return this._signedArea; }\r\n  public constructor(data: Loop) {\r\n    super();\r\n    this.data = data;\r\n    const areaMoments = RegionOps.computeXYAreaMoments(data);\r\n    this._signedArea = areaMoments !== undefined ? areaMoments.quantitySum : 0.0;\r\n  }\r\n  /**\r\n   * classify xy parts of point wrt this loop.\r\n   * @param xy\r\n   * @internal\r\n   */\r\n  public classifyPointXY(xy: XAndY): number | undefined {\r\n    return RegionOps.testPointInOnOutRegionXY(this.data, xy.x, xy.y);\r\n  }\r\n  public constructInteriorPointNearChild(childIndex: number, fractionAlong: number): Point3d | undefined {\r\n    if (childIndex < this.data.children.length) {\r\n      const primitive = this.data.children[childIndex];\r\n      const ray = primitive.fractionToPointAndUnitTangent(fractionAlong);\r\n      ray.direction.rotate90CCWXY(ray.direction);\r\n      if (this._signedArea < 0.0)\r\n        ray.direction.scaleInPlace(-1.0);\r\n      const refDistance = Math.sqrt(Math.abs(this._signedArea));\r\n      for (let fraction = 1.0e-5; fraction < 3; fraction *= 5.0) {\r\n        const candidatePoint = ray.fractionToPoint(fraction * refDistance);\r\n        if (1 === this.classifyPointXY(candidatePoint))\r\n          return candidatePoint;\r\n      }\r\n    }\r\n    return undefined;\r\n  }\r\n  /** Return some point \"inside\"\r\n   * NEEDS WORK: this returns a point ON --\r\n   */\r\n  public getAnyInteriorPoint(): Point3d | undefined {\r\n    for (let childIndex = 0; childIndex < this.data.children.length; childIndex++) {\r\n      const q = this.constructInteriorPointNearChild(childIndex, 0.2349);\r\n      if (q !== undefined)\r\n        return q;\r\n    }\r\n    return undefined;\r\n  }\r\n  public grabPolygon(): IndexedReadWriteXYZCollection | undefined {\r\n    const strokes = this.data.cloneStroked();\r\n    if (strokes instanceof CurveChain) {\r\n      const linestring = LineString3d.create();\r\n      for (const child of strokes.children) {\r\n        if (child instanceof CurvePrimitive) {\r\n          child.emitStrokes(linestring);\r\n        }\r\n      }\r\n      return linestring.numPoints() > 0 ? linestring.packedPoints : undefined;\r\n    }\r\n    return undefined;\r\n  }\r\n  public grabLoop(): Loop | undefined {\r\n    return this.data;\r\n  }\r\n  public reverseForAreaSign(targetSign: number) {\r\n    if (targetSign * this._signedArea < 0.0) {\r\n      this.data.reverseChildrenInPlace();\r\n      this._signedArea *= -1.0;\r\n    }\r\n  }\r\n}\r\n\r\n/**\r\n * A `SortablePolygon` carries a (single) loop with data useful for sorting for inner-outer structure.\r\n * @internal\r\n */\r\nexport class SortablePolygon {\r\n  private _loopCarrier: SimpleRegionCarrier;\r\n  public anyPoint?: Point3d;\r\n  public sortKey: number;\r\n  public range: Range3d;\r\n  public parentIndex?: number;\r\n  public isHole: boolean;\r\n  public outputSetIndex?: number;\r\n  /**\r\n   *\r\n   * @param loop Loop to capture.\r\n   */\r\n  public constructor(loop: IndexedReadWriteXYZCollection | Loop, range: Range3d) {\r\n    if (loop instanceof IndexedReadWriteXYZCollection)\r\n      this._loopCarrier = new PolygonCarrier(loop);\r\n    else\r\n      this._loopCarrier = new LoopCarrier(loop);\r\n    this.range = range;\r\n    this.sortKey = Math.abs(this._loopCarrier.signedArea);\r\n    this.isHole = false;\r\n  }\r\n  /** Push loop with sort data onto the array.\r\n   * * No action if no clear normal.\r\n   * * return true if pushed.\r\n   */\r\n  public static pushPolygon(loops: SortablePolygon[], loop: IndexedReadWriteXYZCollection): boolean {\r\n    const range = loop.getRange();\r\n    const sortablePolygon = new SortablePolygon(loop, range);\r\n    if (sortablePolygon.sortKey > 0.0) {\r\n      loops.push(sortablePolygon);\r\n      return true;\r\n    }\r\n    return false;\r\n  }\r\n  /** Push loop with sort data onto the array.\r\n   * * No action if no clear normal.\r\n   * * return true if pushed.\r\n   */\r\n  public static pushLoop(loops: SortablePolygon[], loop: Loop): boolean {\r\n    const range = loop.range();\r\n    const sortablePolygon = new SortablePolygon(loop, range);\r\n    if (sortablePolygon.sortKey > 0.0) {\r\n      loops.push(sortablePolygon);\r\n      return true;\r\n    }\r\n    return false;\r\n  }\r\n  /** Push loop with sort data onto the array.\r\n   * * No action if no clear normal.\r\n   * * return true if pushed.\r\n   */\r\n  private static assignParentsAndDepth(loops: SortablePolygon[]): void {\r\n    // Sort largest to smallest ...\r\n    loops.sort((loopA: SortablePolygon, loopB: SortablePolygon) => (loopB.sortKey - loopA.sortKey));\r\n    // starting with smallest loop, point each loop to smallest containing parent.\r\n    for (let i = loops.length; i-- > 0;) {\r\n      const thisLoop = loops[i];\r\n      const xy = thisLoop._loopCarrier.getAnyInteriorPoint();\r\n      if (xy !== undefined) {\r\n        // find smallest containing parent (search forward only to hit)\r\n        loops[i].parentIndex = undefined;\r\n        loops[i].outputSetIndex = undefined;\r\n        for (let j = i; j-- > 0;) {\r\n          const otherLoop = loops[j];\r\n          if (otherLoop.range.containsXY(xy.x, xy.y)) {\r\n            if (1 === otherLoop._loopCarrier.classifyPointXY(xy)) {\r\n              thisLoop.parentIndex = j;\r\n              // The loops are searched from small area to larger.  Any other containing loop is larger, so otherLoop must be the smallest.\r\n              break;\r\n            }\r\n          }\r\n        }\r\n      }\r\n    }\r\n  }\r\n\r\n  private static assemblePolygonSet(loops: SortablePolygon[]): IndexedReadWriteXYZCollection[][] {\r\n    const outputSets: IndexedReadWriteXYZCollection[][] = [];\r\n\r\n    // In large-to-small order:\r\n    // If a loop has no parent or has a \"hole\" as parent it is outer.\r\n    // otherwise (i.e. it has a non-hole parent) it becomes a hole in the parent.\r\n    for (const loopData of loops) {\r\n      loopData.isHole = false;\r\n      const parentIndex = loopData.parentIndex;\r\n      if (parentIndex !== undefined)\r\n        loopData.isHole = !loops[parentIndex].isHole;\r\n      if (!loopData.isHole) {\r\n        loopData._loopCarrier.reverseForAreaSign(1.0);\r\n        loopData.outputSetIndex = outputSets.length;\r\n        outputSets.push([]);\r\n        outputSets[loopData.outputSetIndex].push(loopData._loopCarrier.grabPolygon()!);\r\n      } else {\r\n        loopData._loopCarrier.reverseForAreaSign(-1.0);\r\n        const outputSetIndex = loops[parentIndex!].outputSetIndex!;\r\n        outputSets[outputSetIndex].push(loopData._loopCarrier.grabPolygon()!);\r\n      }\r\n    }\r\n    return outputSets;\r\n  }\r\n  private static assembleLoopSet(loops: SortablePolygon[]): AnyRegion[] {\r\n    const outputSets: AnyRegion[] = [];\r\n    const numLoops = loops.length;\r\n    // In large-to-small order:\r\n    // If a loop has no parent or has a \"hole\" as parent it is outer.\r\n    // otherwise (i.e. it has a non-hole parent) it becomes a hole in the parent.\r\n    for (let candidateIndex = 0; candidateIndex < numLoops; candidateIndex++) {\r\n      const candidateData = loops[candidateIndex];\r\n      const parentIndex = candidateData.parentIndex;\r\n      candidateData.isHole = parentIndex !== undefined ? !loops[parentIndex].isHole : false;\r\n\r\n      if (!candidateData.isHole) {\r\n        candidateData._loopCarrier.reverseForAreaSign(1.0);\r\n        const candidateLoop = candidateData._loopCarrier.grabLoop()!;\r\n        let candidateParityRegion: ParityRegion | undefined;\r\n        // find all directly contained children . . .\r\n        for (let childIndex = candidateIndex + 1; childIndex < numLoops; childIndex++) {\r\n          const childData = loops[childIndex];\r\n          if (childData.parentIndex === candidateIndex) {\r\n            if (candidateParityRegion === undefined) {\r\n              candidateParityRegion = ParityRegion.create();\r\n              candidateParityRegion.tryAddChild(candidateLoop);\r\n              childData._loopCarrier.reverseForAreaSign(-1.0);\r\n              candidateParityRegion.tryAddChild(childData._loopCarrier.grabLoop());\r\n            } else {\r\n              childData._loopCarrier.reverseForAreaSign(-1.0);\r\n              candidateParityRegion.tryAddChild(childData._loopCarrier.grabLoop());\r\n            }\r\n          }\r\n        }\r\n        if (candidateParityRegion !== undefined)\r\n          outputSets.push(candidateParityRegion);\r\n        else if (candidateLoop !== undefined)\r\n          outputSets.push(candidateLoop);\r\n      }\r\n    }\r\n    return outputSets;\r\n  }\r\n\r\n  public static sortAsAnyRegion(loops: SortablePolygon[]): AnyRegion {\r\n    this.assignParentsAndDepth(loops);\r\n    const regions = this.assembleLoopSet(loops);\r\n    if (regions.length === 1)\r\n      return regions[0];\r\n    else {\r\n      const unionRegion = UnionRegion.create();\r\n      for (const region of regions)\r\n        unionRegion.tryAddChild(region);\r\n      return unionRegion;\r\n    }\r\n  }\r\n  public static sortAsArrayOfArrayOfPolygons(loops: SortablePolygon[]): IndexedReadWriteXYZCollection[][] {\r\n    this.assignParentsAndDepth(loops);\r\n    return this.assemblePolygonSet(loops);\r\n  }\r\n  public grabPolygon(): IndexedXYZCollection | undefined {\r\n    return this._loopCarrier.grabPolygon();\r\n  }\r\n  public grabLoop(): Loop | undefined {\r\n    return this._loopCarrier.grabLoop();\r\n  }\r\n  public reverseForAreaSign(targetSign: number) {\r\n    this._loopCarrier.reverseForAreaSign(targetSign);\r\n  }\r\n  public getAnyInteriorPoint(): Point3d | undefined {\r\n    return this._loopCarrier.getAnyInteriorPoint();\r\n  }\r\n}\r\n"]}