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

package/lib/esm/numerics/Complex.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 Numerics
+ */
+import { Geometry } from "../Geometry";
+import { Angle } from "../geometry3d/Angle";
+/**
+ * OPerations on a "complex number" class with real part `x` and complex part `y`
+ * @internal
+ */
+export class Complex {
+    constructor(x = 0, y = 0) { this._x = x; this._y = y; }
+    /** Real part */
+    get x() { return this._x; }
+    set x(value) { this._x = value; }
+    /** Imaginary part */
+    get y() { return this._y; }
+    set y(value) { this._y = value; }
+    /** set x and y parts from args. */
+    set(x = 0, y = 0) { this.x = x; this.y = y; }
+    /** set `this.x` and `this.y` from `other.x` and `other.y` */
+    setFrom(other) { this.x = other.x; this.y = other.y; }
+    /** clone the complex x,y */
+    clone() { return new Complex(this.x, this.y); }
+    /** test for near equality using coordinate tolerances */
+    isAlmostEqual(other) { return Geometry.isAlmostEqualNumber(this.x, other.x) && Geometry.isAlmostEqualNumber(this.x, other.x); }
+    /** Create a new Complex instance from given x and y. */
+    static create(x = 0, y = 0, result) {
+        if (result) {
+            result.x = x;
+            result.y = y;
+            return result;
+        }
+        return new Complex(x, y);
+    }
+    /** Return the complex sum `this+other` */
+    plus(other, result) { return Complex.create(this.x + other.x, this.y + other.y, result); }
+    /** Return the complex difference  `this-other` */
+    minus(other, result) { return Complex.create(this.x - other.x, this.y - other.y, result); }
+    /** Return the complex product  `this * other` */
+    times(other, result) {
+        return Complex.create(this.x * other.x - this.y * other.y, this.x * other.y + this.y * other.x, result);
+    }
+    /** Return the complex product `this * x+i*y`. That is, the second Complex value exists via the args without being formally created as an instance. */
+    timesXY(x, y, result) {
+        return Complex.create(this.x * x - this.y * y, this.x * y + this.y * x, result);
+    }
+    /** Return the mangitude of the complex number */
+    magnitude() { return Geometry.hypotenuseXY(this.x, this.y); }
+    /** Return the angle from x axis to the vector (x,y) */
+    angle() { return Angle.createAtan2(this.y, this.x); }
+    /** Return the xy plane distance between this and other */
+    distance(other) {
+        return Geometry.hypotenuseXY(this.x - other.x, this.y - other.y);
+    }
+    /** Return the squared xy plane distance between this and other. */
+    magnitudeSquared() { return this.x * this.x + this.y * this.y; }
+    /** Return the complex division `this / other` */
+    divide(other, result) {
+        const bb = other.magnitudeSquared();
+        if (bb === 0.0)
+            return undefined;
+        const divbb = 1.0 / bb;
+        return Complex.create((this.x * other.x + this.y * other.y) * divbb, (this.y * other.x - this.x * other.y) * divbb, result);
+    }
+    /** Return the complex square root of this. */
+    sqrt(result) {
+        if ((this.x === 0.0) && (this.y === 0.0))
+            return Complex.create(0, 0, result);
+        const x = Math.abs(this.x);
+        const y = Math.abs(this.y);
+        let r = 0;
+        let w = 0;
+        if (x >= y) {
+            r = y / x;
+            w = Math.sqrt(x) * Math.sqrt(0.5 * (1.0 + Math.sqrt(1.0 + r * r)));
+        }
+        else {
+            r = x / y;
+            w = Math.sqrt(y) * Math.sqrt(0.5 * (r + Math.sqrt(1.0 + r * r)));
+        }
+        if (this.x >= 0.0) {
+            return Complex.create(w, this.y / (2.0 * w), result);
+        }
+        else {
+            const y1 = (this.y >= 0) ? w : -w;
+            return Complex.create(this.y / (2.0 * y1), y1, result);
+        }
+    }
+    /** set the complex x,y from a json object of the form like
+     * * x,y key value pairs:   `{x:1,y:2}`
+     * * array of numbers:  `[1,2]`
+     */
+    setFromJSON(json) {
+        if (Array.isArray(json) && json.length > 1) {
+            this.set(json[0], json[1]);
+        }
+        else if (json && json.x && json.y) {
+            this.set(json.x, json.y);
+        }
+        else {
+            this.set(0, 0);
+        }
+    }
+    /** Create a `Complex` instance from a json object. */
+    static fromJSON(json) { const result = new Complex(); result.setFromJSON(json); return result; }
+    /**
+     * Convert an Complex to a JSON object.
+     * @return {*} [x,y]
+     */
+    toJSON() { return [this.x, this.y]; }
+}
+//# sourceMappingURL=Complex.js.map

package/lib/esm/numerics/Complex.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Complex.js","sourceRoot":"","sources":["../../../src/numerics/Complex.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AACH,OAAO,EAAmB,QAAQ,EAAE,MAAM,aAAa,CAAC;AACxD,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAE5C;;;GAGG;AACH,MAAM,OAAO,OAAO;IAWlB,YAAmB,IAAY,CAAC,EAAE,IAAY,CAAC,IAAI,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC;IAT9E,gBAAgB;IAChB,IAAW,CAAC,KAAa,OAAO,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1C,IAAW,CAAC,CAAC,KAAa,IAAI,IAAI,CAAC,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC;IAGhD,qBAAqB;IACrB,IAAW,CAAC,KAAa,OAAO,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1C,IAAW,CAAC,CAAC,KAAa,IAAI,IAAI,CAAC,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC;IAGhD,mCAAmC;IAC5B,GAAG,CAAC,IAAY,CAAC,EAAE,IAAY,CAAC,IAAU,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAC1E,6DAA6D;IACtD,OAAO,CAAC,KAAc,IAAI,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IACtE,4BAA4B;IACrB,KAAK,KAAc,OAAO,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/D,yDAAyD;IAClD,aAAa,CAAC,KAAc,IAAa,OAAO,QAAQ,CAAC,mBAAmB,CAAC,IAAI,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,IAAI,QAAQ,CAAC,mBAAmB,CAAC,IAAI,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACxJ,wDAAwD;IACjD,MAAM,CAAC,MAAM,CAAC,IAAY,CAAC,EAAE,IAAY,CAAC,EAAE,MAAgB;QACjE,IAAI,MAAM,EAAE;YACV,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC;YACb,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC;YACb,OAAO,MAAM,CAAC;SACf;QACD,OAAO,IAAI,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC3B,CAAC;IACD,0CAA0C;IACnC,IAAI,CAAC,KAAc,EAAE,MAAgB,IAAa,OAAO,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;IAC7H,kDAAkD;IAC3C,KAAK,CAAC,KAAc,EAAE,MAAgB,IAAa,OAAO,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;IAC9H,iDAAiD;IAC1C,KAAK,CAAC,KAAc,EAAE,MAAgB;QAC3C,OAAO,OAAO,CAAC,MAAM,CACnB,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,EACnC,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,EACnC,MAAM,CAAC,CAAC;IACZ,CAAC;IACD,sJAAsJ;IAC/I,OAAO,CAAC,CAAS,EAAE,CAAS,EAAE,MAAgB;QACnD,OAAO,OAAO,CAAC,MAAM,CACnB,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,EACvB,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,EACvB,MAAM,CAAC,CAAC;IACZ,CAAC;IACD,iDAAiD;IAC1C,SAAS,KAAa,OAAO,QAAQ,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5E,uDAAuD;IAChD,KAAK,KAAY,OAAO,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACnE,0DAA0D;IACnD,QAAQ,CAAC,KAAc;QAC5B,OAAO,QAAQ,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;IACnE,CAAC;IACD,mEAAmE;IAC5D,gBAAgB,KAAa,OAAO,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/E,iDAAiD;IAC1C,MAAM,CAAC,KAAc,EAAE,MAAgB;QAC5C,MAAM,EAAE,GAAG,KAAK,CAAC,gBAAgB,EAAE,CAAC;QACpC,IAAI,EAAE,KAAK,GAAG;YACZ,OAAO,SAAS,CAAC;QACnB,MAAM,KAAK,GAAG,GAAG,GAAG,EAAE,CAAC;QACvB,OAAO,OAAO,CAAC,MAAM,CACnB,CAAC,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,EAC7C,CAAC,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,EAC7C,MAAM,CAAC,CAAC;IACZ,CAAC;IACD,8CAA8C;IACvC,IAAI,CAAC,MAAgB;QAC1B,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,GAAG,CAAC;YACtC,OAAO,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC;QAEtC,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC3B,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC3B,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,IAAI,CAAC,IAAI,CAAC,EAAE;YACV,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACV,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;SACpE;aAAM;YACL,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACV,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;SAClE;QAED,IAAI,IAAI,CAAC,CAAC,IAAI,GAAG,EAAE;YACjB,OAAO,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;SACtD;aAAM;YACL,MAAM,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAClC,OAAO,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,EAAE,CAAC,EAAE,EAAE,EAAE,MAAM,CAAC,CAAC;SACxD;IACH,CAAC;IACD;;;OAGG;IACI,WAAW,CAAC,IAAU;QAC3B,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE;YAC1C,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;SAC5B;aAAM,IAAI,IAAI,IAAI,IAAI,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,EAAE;YACnC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;SAC1B;aAAM;YACL,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;SAChB;IACH,CAAC;IACD,sDAAsD;IAC/C,MAAM,CAAC,QAAQ,CAAC,IAAU,IAAa,MAAM,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,MAAM,CAAC,CAAC,CAAC;IAEtH;;;OAGG;IACI,MAAM,KAAU,OAAO,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;CAElD","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 Numerics\r\n */\r\nimport { BeJSONFunctions, Geometry } from \"../Geometry\";\r\nimport { Angle } from \"../geometry3d/Angle\";\r\n\r\n/**\r\n * OPerations on a \"complex number\" class with real part `x` and complex part `y`\r\n * @internal\r\n */\r\nexport class Complex implements BeJSONFunctions {\r\n  private _x: number;\r\n  /** Real part */\r\n  public get x(): number { return this._x; }\r\n  public set x(value: number) { this._x = value; }\r\n\r\n  private _y: number;\r\n  /** Imaginary part */\r\n  public get y(): number { return this._y; }\r\n  public set y(value: number) { this._y = value; }\r\n\r\n  public constructor(x: number = 0, y: number = 0) { this._x = x; this._y = y; }\r\n  /** set x and y parts from args. */\r\n  public set(x: number = 0, y: number = 0): void { this.x = x; this.y = y; }\r\n  /** set `this.x` and `this.y` from `other.x` and `other.y` */\r\n  public setFrom(other: Complex) { this.x = other.x; this.y = other.y; }\r\n  /** clone the complex x,y */\r\n  public clone(): Complex { return new Complex(this.x, this.y); }\r\n  /** test for near equality using coordinate tolerances */\r\n  public isAlmostEqual(other: Complex): boolean { return Geometry.isAlmostEqualNumber(this.x, other.x) && Geometry.isAlmostEqualNumber(this.x, other.x); }\r\n  /** Create a new Complex instance from given x and y. */\r\n  public static create(x: number = 0, y: number = 0, result?: Complex): Complex {\r\n    if (result) {\r\n      result.x = x;\r\n      result.y = y;\r\n      return result;\r\n    }\r\n    return new Complex(x, y);\r\n  }\r\n  /** Return the complex sum `this+other` */\r\n  public plus(other: Complex, result?: Complex): Complex { return Complex.create(this.x + other.x, this.y + other.y, result); }\r\n  /** Return the complex difference  `this-other` */\r\n  public minus(other: Complex, result?: Complex): Complex { return Complex.create(this.x - other.x, this.y - other.y, result); }\r\n  /** Return the complex product  `this * other` */\r\n  public times(other: Complex, result?: Complex): Complex {\r\n    return Complex.create(\r\n      this.x * other.x - this.y * other.y,\r\n      this.x * other.y + this.y * other.x,\r\n      result);\r\n  }\r\n  /** Return the complex product `this * x+i*y`. That is, the second Complex value exists via the args without being formally created as an instance. */\r\n  public timesXY(x: number, y: number, result?: Complex): Complex {\r\n    return Complex.create(\r\n      this.x * x - this.y * y,\r\n      this.x * y + this.y * x,\r\n      result);\r\n  }\r\n  /** Return the mangitude of the complex number */\r\n  public magnitude(): number { return Geometry.hypotenuseXY(this.x, this.y); }\r\n  /** Return the angle from x axis to the vector (x,y) */\r\n  public angle(): Angle { return Angle.createAtan2(this.y, this.x); }\r\n  /** Return the xy plane distance between this and other */\r\n  public distance(other: Complex) {\r\n    return Geometry.hypotenuseXY(this.x - other.x, this.y - other.y);\r\n  }\r\n  /** Return the squared xy plane distance between this and other. */\r\n  public magnitudeSquared(): number { return this.x * this.x + this.y * this.y; }\r\n  /** Return the complex division `this / other` */\r\n  public divide(other: Complex, result?: Complex): Complex | undefined {\r\n    const bb = other.magnitudeSquared();\r\n    if (bb === 0.0)\r\n      return undefined;\r\n    const divbb = 1.0 / bb;\r\n    return Complex.create(\r\n      (this.x * other.x + this.y * other.y) * divbb,\r\n      (this.y * other.x - this.x * other.y) * divbb,\r\n      result);\r\n  }\r\n  /** Return the complex square root of this. */\r\n  public sqrt(result?: Complex): Complex {\r\n    if ((this.x === 0.0) && (this.y === 0.0))\r\n      return Complex.create(0, 0, result);\r\n\r\n    const x = Math.abs(this.x);\r\n    const y = Math.abs(this.y);\r\n    let r = 0;\r\n    let w = 0;\r\n    if (x >= y) {\r\n      r = y / x;\r\n      w = Math.sqrt(x) * Math.sqrt(0.5 * (1.0 + Math.sqrt(1.0 + r * r)));\r\n    } else {\r\n      r = x / y;\r\n      w = Math.sqrt(y) * Math.sqrt(0.5 * (r + Math.sqrt(1.0 + r * r)));\r\n    }\r\n\r\n    if (this.x >= 0.0) {\r\n      return Complex.create(w, this.y / (2.0 * w), result);\r\n    } else {\r\n      const y1 = (this.y >= 0) ? w : -w;\r\n      return Complex.create(this.y / (2.0 * y1), y1, result);\r\n    }\r\n  }\r\n  /** set the complex x,y from a json object of the form like\r\n   * * x,y key value pairs:   `{x:1,y:2}`\r\n   * * array of numbers:  `[1,2]`\r\n   */\r\n  public setFromJSON(json?: any): void {\r\n    if (Array.isArray(json) && json.length > 1) {\r\n      this.set(json[0], json[1]);\r\n    } else if (json && json.x && json.y) {\r\n      this.set(json.x, json.y);\r\n    } else {\r\n      this.set(0, 0);\r\n    }\r\n  }\r\n  /** Create a `Complex` instance from a json object. */\r\n  public static fromJSON(json?: any): Complex { const result = new Complex(); result.setFromJSON(json); return result; }\r\n\r\n  /**\r\n   * Convert an Complex to a JSON object.\r\n   * @return {*} [x,y]\r\n   */\r\n  public toJSON(): any { return [this.x, this.y]; }\r\n\r\n}\r\n"]}

package/lib/esm/numerics/ConvexPolygon2d.d.ts

@@ -0,0 +1,86 @@
+import { Point2d, Vector2d } from "../geometry3d/Point2dVector2d";
+import { Range1d } from "../geometry3d/Range";
+/**
+ * Ray with xy origin and direction
+ * @internal
+ */
+export declare class Ray2d {
+    private _origin;
+    private _direction;
+    private constructor();
+    /** Create from 2d `origin` and `target`.
+     * * `target - origin` is the direction vector.
+     */
+    static createOriginAndTarget(origin: Point2d, target: Point2d): Ray2d;
+    /** Create from (clones of) `origin` point and `direction` vector */
+    static createOriginAndDirection(origin: Point2d, direction: Vector2d): Ray2d;
+    /** Capture `origin` and `direction` as ray member variables. */
+    static createOriginAndDirectionCapture(origin: Point2d, direction: Vector2d): Ray2d;
+    /** Get the (REFERENCE TO) the ray origin. */
+    get origin(): Point2d;
+    /** Get the (REFERENCE TO) the ray direction. */
+    get direction(): Vector2d;
+    /**
+     *  Return a ray that is parallel at distance to the left, specified as fraction of the ray's direction vector.
+     */
+    parallelRay(leftFraction: number): Ray2d;
+    /** Return a ray with same origin, direction rotated 90 degrees counterclockwise */
+    ccwPerpendicularRay(): Ray2d;
+    /** Return a ray with same origin, direction rotated 90 degrees clockwise */
+    cwPerpendicularRay(): Ray2d;
+    /** Normalize the direction vector in place. */
+    normalizeDirectionInPlace(defaultX?: number, defaultY?: number): boolean;
+    /**
+     * Intersect this ray (ASSUMED NORMALIZED) with unbounded line defined by points.
+     *  (The normalization assumption affects test for parallel vectors.)
+     *  Fraction and dHds passed as number[] to use by reference... Sticking to return of true and false in the case fraction is zero after
+     *  a true safe divide
+     */
+    intersectUnboundedLine(linePointA: Point2d, linePointB: Point2d, fraction: number[], dHds: number[]): boolean;
+    /** return the ray fraction where point projects to the ray */
+    projectionFraction(point: Point2d): number;
+    /** return the fraction of projection to the perpendicular ray */
+    perpendicularProjectionFraction(point: Point2d): number;
+    /** Return point from origin plus a scaled vector */
+    fractionToPoint(f: number): Point2d;
+}
+/**
+ * Convex hull of points in 2d.
+ * @internal
+ */
+export declare class ConvexPolygon2d {
+    private _hullPoints;
+    constructor(points: Point2d[] | undefined);
+    /** Create the hull */
+    static createHull(points: Point2d[]): ConvexPolygon2d;
+    /** Create the hull. First try to use the points as given. */
+    static createHullIsValidCheck(points: Point2d[]): ConvexPolygon2d;
+    /** Return a reference of the hull points. */
+    get points(): Point2d[];
+    /** Test if hull points are a convex, CCW polygon */
+    static isValidConvexHull(points: Point2d[]): boolean;
+    /** Return true if the convex hull (to the left of the edges) contains the test point */
+    containsPoint(point: Point2d): boolean;
+    /** Return the largest outside. (return 0 if in or on) */
+    distanceOutside(xy: Point2d): number;
+    /** Offset the entire hull (in place) by distance.
+     * Returns false if an undefined occurred from normalizing (could occur after changing some hull points already)
+     */
+    offsetInPlace(distance: number): boolean;
+    /**
+     * Return 2 distances bounding the intersection of the ray with a convex hull.
+     * ASSUME (for tolerance) the ray has normalized direction vector.
+     * Both negative and positive distances along the ray are possible.
+     * Returns range with extremities if less than 3 points, distanceA > distanceB, or if cross product < 0
+     */
+    clipRay(ray: Ray2d): Range1d;
+    /** Return the range of (fractional) ray positions for projections of all points from the arrays. */
+    rangeAlongRay(ray: Ray2d): Range1d;
+    /** Return the range of (fractional) ray positions for projections of all points from the arrays. */
+    rangePerpendicularToRay(ray: Ray2d): Range1d;
+    /** Computes the hull of a convex polygon from points given. Returns the hull as a new Point2d array.
+     *  Returns an empty hull if less than 3 points are given.
+     */
+    static computeConvexHull(points: Point2d[]): Point2d[] | undefined;
+}
+//# sourceMappingURL=ConvexPolygon2d.d.ts.map

package/lib/esm/numerics/ConvexPolygon2d.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ConvexPolygon2d.d.ts","sourceRoot":"","sources":["../../../src/numerics/ConvexPolygon2d.ts"],"names":[],"mappings":"AAUA,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAClE,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AAE9C;;;GAGG;AACH,qBAAa,KAAK;IAChB,OAAO,CAAC,OAAO,CAAU;IACzB,OAAO,CAAC,UAAU,CAAW;IAE7B,OAAO;IAIP;;OAEG;WACW,qBAAqB,CAAC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,GAAG,KAAK;IAG5E,oEAAoE;WACtD,wBAAwB,CAAC,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,QAAQ,GAAG,KAAK;IAGnF,gEAAgE;WAClD,+BAA+B,CAAC,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,QAAQ,GAAG,KAAK;IAG1F,6CAA6C;IAC7C,IAAW,MAAM,YAA2B;IAC5C,gDAAgD;IAChD,IAAW,SAAS,aAA8B;IAElD;;OAEG;IACI,WAAW,CAAC,YAAY,EAAE,MAAM,GAAG,KAAK;IAG/C,mFAAmF;IAC5E,mBAAmB,IAAI,KAAK;IAInC,4EAA4E;IACrE,kBAAkB,IAAI,KAAK;IAGlC,+CAA+C;IACxC,yBAAyB,CAAC,QAAQ,GAAE,MAAU,EAAE,QAAQ,GAAE,MAAU,GAAG,OAAO;IAWrF;;;;;OAKG;IACI,sBAAsB,CAAC,UAAU,EAAE,OAAO,EAAE,UAAU,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,OAAO;IAgBpH,8DAA8D;IACvD,kBAAkB,CAAC,KAAK,EAAE,OAAO,GAAG,MAAM;IAIjD,iEAAiE;IAC1D,+BAA+B,CAAC,KAAK,EAAE,OAAO,GAAG,MAAM;IAO9D,oDAAoD;IAC7C,eAAe,CAAC,CAAC,EAAE,MAAM,GAAG,OAAO;CAG3C;AACD;;;GAGG;AACH,qBAAa,eAAe;IAG1B,OAAO,CAAC,WAAW,CAAY;gBAEnB,MAAM,EAAE,OAAO,EAAE,GAAG,SAAS;IAUzC,sBAAsB;WACR,UAAU,CAAC,MAAM,EAAE,OAAO,EAAE,GAAG,eAAe;IAI5D,6DAA6D;WAC/C,sBAAsB,CAAC,MAAM,EAAE,OAAO,EAAE;IAOtD,6CAA6C;IAC7C,IAAW,MAAM,IAAI,OAAO,EAAE,CAE7B;IAED,oDAAoD;WACtC,iBAAiB,CAAC,MAAM,EAAE,OAAO,EAAE;IAajD,wFAAwF;IACjF,aAAa,CAAC,KAAK,EAAE,OAAO,GAAG,OAAO;IAa7C,yDAAyD;IAClD,eAAe,CAAC,EAAE,EAAE,OAAO,GAAG,MAAM;IA2B3C;;OAEG;IACI,aAAa,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO;IA6B/C;;;;;OAKG;IACI,OAAO,CAAC,GAAG,EAAE,KAAK,GAAG,OAAO;IAuCnC,oGAAoG;IAC7F,aAAa,CAAC,GAAG,EAAE,KAAK,GAAG,OAAO;IAOzC,oGAAoG;IAC7F,uBAAuB,CAAC,GAAG,EAAE,KAAK,GAAG,OAAO;IAOnD;;OAEG;WACW,iBAAiB,CAAC,MAAM,EAAE,OAAO,EAAE,GAAG,OAAO,EAAE,GAAG,SAAS;CAuC1E"}

package/lib/esm/numerics/ConvexPolygon2d.js

@@ -0,0 +1,313 @@
+/*---------------------------------------------------------------------------------------------
+* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+* See LICENSE.md in the project root for license terms and full copyright notice.
+*--------------------------------------------------------------------------------------------*/
+/** @packageDocumentation
+ * @module Numerics
+ */
+import { Geometry } from "../Geometry";
+import { Vector2d } from "../geometry3d/Point2dVector2d";
+import { Range1d } from "../geometry3d/Range";
+/**
+ * Ray with xy origin and direction
+ * @internal
+ */
+export class Ray2d {
+    constructor(origin, direction) {
+        this._origin = origin;
+        this._direction = direction;
+    }
+    /** Create from 2d `origin` and `target`.
+     * * `target - origin` is the direction vector.
+     */
+    static createOriginAndTarget(origin, target) {
+        return new Ray2d(origin.clone(), origin.vectorTo(target));
+    }
+    /** Create from (clones of) `origin` point and `direction` vector */
+    static createOriginAndDirection(origin, direction) {
+        return new Ray2d(origin.clone(), direction.clone());
+    }
+    /** Capture `origin` and `direction` as ray member variables. */
+    static createOriginAndDirectionCapture(origin, direction) {
+        return new Ray2d(origin, direction);
+    }
+    /** Get the (REFERENCE TO) the ray origin. */
+    get origin() { return this._origin; }
+    /** Get the (REFERENCE TO) the ray direction. */
+    get direction() { return this._direction; }
+    /**
+     *  Return a ray that is parallel at distance to the left, specified as fraction of the ray's direction vector.
+     */
+    parallelRay(leftFraction) {
+        return new Ray2d(this._origin.addForwardLeft(0.0, leftFraction, this._direction), this._direction);
+    }
+    /** Return a ray with same origin, direction rotated 90 degrees counterclockwise */
+    ccwPerpendicularRay() {
+        return new Ray2d(this._origin, this._direction.rotate90CCWXY());
+    }
+    /** Return a ray with same origin, direction rotated 90 degrees clockwise */
+    cwPerpendicularRay() {
+        return new Ray2d(this._origin, this._direction.rotate90CWXY());
+    }
+    /** Normalize the direction vector in place. */
+    normalizeDirectionInPlace(defaultX = 1, defaultY = 0) {
+        if (this._direction.normalize(this._direction)) {
+            return true;
+        }
+        else {
+            this._direction.x = defaultX;
+            this._direction.y = defaultY;
+            // magnitude = 0.0;
+            return false;
+        }
+    }
+    /**
+     * Intersect this ray (ASSUMED NORMALIZED) with unbounded line defined by points.
+     *  (The normalization assumption affects test for parallel vectors.)
+     *  Fraction and dHds passed as number[] to use by reference... Sticking to return of true and false in the case fraction is zero after
+     *  a true safe divide
+     */
+    intersectUnboundedLine(linePointA, linePointB, fraction, dHds) {
+        const lineDirection = linePointA.vectorTo(linePointB);
+        const vector0 = linePointA.vectorTo(this._origin);
+        const h0 = vector0.crossProduct(lineDirection);
+        dHds[0] = this._direction.crossProduct(lineDirection);
+        // h = h0 + s * dh
+        const ff = Geometry.conditionalDivideFraction(-h0, dHds[0]);
+        if (ff !== undefined) {
+            fraction[0] = ff;
+            return true;
+        }
+        else {
+            fraction[0] = 0.0;
+            return false;
+        }
+    }
+    /** return the ray fraction where point projects to the ray */
+    projectionFraction(point) {
+        return this._origin.vectorTo(point).fractionOfProjectionToVector(this._direction);
+    }
+    /** return the fraction of projection to the perpendicular ray */
+    perpendicularProjectionFraction(point) {
+        const uv = this._direction.crossProduct(this._origin.vectorTo(point));
+        const uu = this._direction.magnitudeSquared();
+        // Want zero returned if failure case, not undefined
+        return Geometry.safeDivideFraction(uv, uu, 0.0);
+    }
+    /** Return point from origin plus a scaled vector */
+    fractionToPoint(f) {
+        return this._origin.plusScaled(this._direction, f);
+    }
+}
+/**
+ * Convex hull of points in 2d.
+ * @internal
+ */
+export class ConvexPolygon2d {
+    constructor(points) {
+        this._hullPoints = [];
+        // Deep copy of points array given
+        if (points) {
+            for (const point of points) {
+                this._hullPoints.push(point);
+            }
+        }
+    }
+    /** Create the hull */
+    static createHull(points) {
+        return new ConvexPolygon2d(ConvexPolygon2d.computeConvexHull(points));
+    }
+    /** Create the hull. First try to use the points as given. */
+    static createHullIsValidCheck(points) {
+        if (ConvexPolygon2d.isValidConvexHull(points))
+            return new ConvexPolygon2d(points);
+        else
+            return new ConvexPolygon2d(ConvexPolygon2d.computeConvexHull(points));
+    }
+    /** Return a reference of the hull points. */
+    get points() {
+        return this._hullPoints;
+    }
+    /** Test if hull points are a convex, CCW polygon */
+    static isValidConvexHull(points) {
+        if (points.length < 3)
+            return false;
+        const n = points.length;
+        for (let i = 0; i < n; i++) {
+            const i1 = (i + 1) % n;
+            const i2 = (i + 2) % n;
+            if (points[i].crossProductToPoints(points[i1], points[i2]) < 0.0)
+                return false;
+        }
+        return true;
+    }
+    /** Return true if the convex hull (to the left of the edges) contains the test point */
+    containsPoint(point) {
+        let xy0 = this._hullPoints[this._hullPoints.length - 1];
+        // double tol = -1.0e-20;  negative tol!!
+        for (const i of this._hullPoints) {
+            const xy1 = i;
+            const c = xy0.crossProductToPoints(xy1, point);
+            if (c < 0.0)
+                return false;
+            xy0 = i;
+        }
+        return true;
+    }
+    /** Return the largest outside. (return 0 if in or on) */
+    distanceOutside(xy) {
+        let maxDistance = 0.0;
+        const n = this._hullPoints.length;
+        let xy0 = this._hullPoints[n - 1];
+        // double tol = -1.0e-20;  // negative tol!!
+        for (let i = 0; i < n; i++) {
+            const xy1 = this._hullPoints[i];
+            const c = xy0.crossProductToPoints(xy1, xy);
+            if (c < 0.0) {
+                const ray = Ray2d.createOriginAndTarget(xy0, xy1);
+                const s = ray.projectionFraction(xy);
+                let d = 0.0;
+                if (s < 0.0)
+                    d = xy0.distance(xy);
+                else if (s > 1.0)
+                    d = xy1.distance(xy);
+                else
+                    d = xy.distance(ray.fractionToPoint(s));
+                if (d > maxDistance)
+                    maxDistance = d;
+            }
+            xy0 = this._hullPoints[i];
+        }
+        return maxDistance;
+    }
+    /** Offset the entire hull (in place) by distance.
+     * Returns false if an undefined occurred from normalizing (could occur after changing some hull points already)
+     */
+    offsetInPlace(distance) {
+        const n = this._hullPoints.length;
+        if (n >= 3) {
+            const hullPoint0 = this._hullPoints[0];
+            let edgeA = this._hullPoints[n - 1].vectorTo(hullPoint0);
+            edgeA = edgeA.normalize();
+            if (edgeA === undefined) {
+                return false;
+            }
+            let perpA = edgeA.rotate90CWXY();
+            let edgeB;
+            let perpB;
+            for (let i = 0; i < n; i++) {
+                const j = i + 1;
+                edgeB = this._hullPoints[i].vectorTo(j < n ? this._hullPoints[j] : hullPoint0);
+                edgeB = edgeB.normalize();
+                if (edgeB === undefined) {
+                    return false;
+                }
+                perpB = edgeB.rotate90CWXY();
+                const offsetBisector = Vector2d.createOffsetBisector(perpA, perpB, distance);
+                if (offsetBisector === undefined) {
+                    return false;
+                }
+                this._hullPoints[i] = this._hullPoints[i].plus(offsetBisector);
+                // PerpA takes up reference to perpB, as perpB will die in new iteration
+                perpA = perpB;
+            }
+        }
+        return true;
+    }
+    /**
+     * Return 2 distances bounding the intersection of the ray with a convex hull.
+     * ASSUME (for tolerance) the ray has normalized direction vector.
+     * Both negative and positive distances along the ray are possible.
+     * Returns range with extremities if less than 3 points, distanceA > distanceB, or if cross product < 0
+     */
+    clipRay(ray) {
+        let distanceA = -Number.MAX_VALUE;
+        let distanceB = Number.MAX_VALUE;
+        const n = this._hullPoints.length;
+        if (n < 3)
+            return Range1d.createNull();
+        let xy0 = this._hullPoints[n - 1];
+        for (const xy1 of this._hullPoints) {
+            const distance = [];
+            const dHds = [];
+            if (ray.intersectUnboundedLine(xy0, xy1, distance, dHds)) {
+                if (dHds[0] > 0.0) {
+                    if (distance[0] < distanceB)
+                        distanceB = distance[0];
+                }
+                else {
+                    if (distance[0] > distanceA)
+                        distanceA = distance[0];
+                }
+                if (distanceA > distanceB)
+                    return Range1d.createNull();
+            }
+            else {
+                // ray is parallel to the edge.
+                // Any single point out classifies it all . ..
+                if (xy0.crossProductToPoints(xy1, ray.origin) < 0.0)
+                    return Range1d.createNull();
+            }
+            // xy1 is reassigned with each new loop
+            xy0 = xy1;
+        }
+        const range = Range1d.createNull();
+        range.extendX(distanceA);
+        range.extendX(distanceB);
+        return range;
+    }
+    /** Return the range of (fractional) ray positions for projections of all points from the arrays. */
+    rangeAlongRay(ray) {
+        const range = Range1d.createNull();
+        for (const xy1 of this._hullPoints)
+            range.extendX(ray.projectionFraction(xy1));
+        return range;
+    }
+    /** Return the range of (fractional) ray positions for projections of all points from the arrays. */
+    rangePerpendicularToRay(ray) {
+        const range = Range1d.createNull();
+        for (const xy1 of this._hullPoints)
+            range.extendX(ray.perpendicularProjectionFraction(xy1));
+        return range;
+    }
+    /** Computes the hull of a convex polygon from points given. Returns the hull as a new Point2d array.
+     *  Returns an empty hull if less than 3 points are given.
+     */
+    static computeConvexHull(points) {
+        const hull = [];
+        const n = points.length;
+        if (n < 3)
+            return undefined;
+        // Get deep copy
+        const xy1 = points.slice(0, n);
+        xy1.sort(Geometry.lexicalXYLessThan);
+        hull.push(xy1[0]); // This is sure to stay
+        hull.push(xy1[1]); // This one can be removed in loop.
+        // First sweep creates upper hull
+        for (let i = 2; i < n; i++) {
+            const candidate = xy1[i];
+            let top = hull.length - 1;
+            while (top > 0 && hull[top - 1].crossProductToPoints(hull[top], candidate) <= 0.0) {
+                top--;
+                hull.pop();
+            }
+            hull.push(candidate);
+        }
+        // Second sweep creates lower hull right to left
+        const i0 = hull.length - 1;
+        // xy1.back () is already on stack.
+        hull.push(xy1[n - 2]);
+        for (let i = n - 2; i-- > 0;) {
+            const candidate = xy1[i];
+            let top = hull.length - 1;
+            while (top > i0 && hull[top - 1].crossProductToPoints(hull[top], candidate) <= 0.0) {
+                top--;
+                hull.pop();
+            }
+            if (i > 0) // don't replicate start point!!!
+                hull.push(candidate);
+        }
+        return hull;
+    }
+}
+//# sourceMappingURL=ConvexPolygon2d.js.map

package/lib/esm/numerics/ConvexPolygon2d.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ConvexPolygon2d.js","sourceRoot":"","sources":["../../../src/numerics/ConvexPolygon2d.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAE/F;;GAEG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AACvC,OAAO,EAAW,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAClE,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AAE9C;;;GAGG;AACH,MAAM,OAAO,KAAK;IAIhB,YAAoB,MAAe,EAAE,SAAmB;QACtD,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;QACtB,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;IAC9B,CAAC;IACD;;OAEG;IACI,MAAM,CAAC,qBAAqB,CAAC,MAAe,EAAE,MAAe;QAClE,OAAO,IAAI,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,EAAE,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC;IAC5D,CAAC;IACD,oEAAoE;IAC7D,MAAM,CAAC,wBAAwB,CAAC,MAAe,EAAE,SAAmB;QACzE,OAAO,IAAI,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,EAAE,SAAS,CAAC,KAAK,EAAE,CAAC,CAAC;IACtD,CAAC;IACD,gEAAgE;IACzD,MAAM,CAAC,+BAA+B,CAAC,MAAe,EAAE,SAAmB;QAChF,OAAO,IAAI,KAAK,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;IACtC,CAAC;IACD,6CAA6C;IAC7C,IAAW,MAAM,KAAK,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;IAC5C,gDAAgD;IAChD,IAAW,SAAS,KAAK,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;IAElD;;OAEG;IACI,WAAW,CAAC,YAAoB;QACrC,OAAO,IAAI,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,cAAc,CAAC,GAAG,EAAE,YAAY,EAAE,IAAI,CAAC,UAAU,CAAC,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;IACrG,CAAC;IACD,mFAAmF;IAC5E,mBAAmB;QACxB,OAAO,IAAI,KAAK,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,UAAU,CAAC,aAAa,EAAE,CAAC,CAAC;IAClE,CAAC;IAED,4EAA4E;IACrE,kBAAkB;QACvB,OAAO,IAAI,KAAK,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,UAAU,CAAC,YAAY,EAAE,CAAC,CAAC;IACjE,CAAC;IACD,+CAA+C;IACxC,yBAAyB,CAAC,WAAmB,CAAC,EAAE,WAAmB,CAAC;QACzE,IAAI,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE;YAC9C,OAAO,IAAI,CAAC;SACb;aAAM;YACL,IAAI,CAAC,UAAU,CAAC,CAAC,GAAG,QAAQ,CAAC;YAC7B,IAAI,CAAC,UAAU,CAAC,CAAC,GAAG,QAAQ,CAAC;YAC7B,mBAAmB;YACnB,OAAO,KAAK,CAAC;SACd;IACH,CAAC;IAED;;;;;OAKG;IACI,sBAAsB,CAAC,UAAmB,EAAE,UAAmB,EAAE,QAAkB,EAAE,IAAc;QACxG,MAAM,aAAa,GAAG,UAAU,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;QACtD,MAAM,OAAO,GAAG,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAClD,MAAM,EAAE,GAAG,OAAO,CAAC,YAAY,CAAC,aAAa,CAAC,CAAC;QAC/C,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,YAAY,CAAC,aAAa,CAAC,CAAC;QACtD,kBAAkB;QAClB,MAAM,EAAE,GAAG,QAAQ,CAAC,yBAAyB,CAAC,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5D,IAAI,EAAE,KAAK,SAAS,EAAE;YACpB,QAAQ,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;YACjB,OAAO,IAAI,CAAC;SACb;aAAM;YACL,QAAQ,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;YAClB,OAAO,KAAK,CAAC;SACd;IACH,CAAC;IAED,8DAA8D;IACvD,kBAAkB,CAAC,KAAc;QACtC,OAAO,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,4BAA4B,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IACpF,CAAC;IAED,iEAAiE;IAC1D,+BAA+B,CAAC,KAAc;QACnD,MAAM,EAAE,GAAG,IAAI,CAAC,UAAU,CAAC,YAAY,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC;QACtE,MAAM,EAAE,GAAG,IAAI,CAAC,UAAU,CAAC,gBAAgB,EAAE,CAAC;QAC9C,oDAAoD;QACpD,OAAO,QAAQ,CAAC,kBAAkB,CAAC,EAAE,EAAE,EAAE,EAAE,GAAG,CAAC,CAAC;IAClD,CAAC;IAED,oDAAoD;IAC7C,eAAe,CAAC,CAAS;QAC9B,OAAO,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;IACrD,CAAC;CACF;AACD;;;GAGG;AACH,MAAM,OAAO,eAAe;IAK1B,YAAY,MAA6B;QACvC,IAAI,CAAC,WAAW,GAAG,EAAE,CAAC;QACtB,kCAAkC;QAClC,IAAI,MAAM,EAAE;YACV,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE;gBAC1B,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;aAC9B;SACF;IACH,CAAC;IAED,sBAAsB;IACf,MAAM,CAAC,UAAU,CAAC,MAAiB;QACxC,OAAO,IAAI,eAAe,CAAC,eAAe,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC,CAAC;IACxE,CAAC;IAED,6DAA6D;IACtD,MAAM,CAAC,sBAAsB,CAAC,MAAiB;QACpD,IAAI,eAAe,CAAC,iBAAiB,CAAC,MAAM,CAAC;YAC3C,OAAO,IAAI,eAAe,CAAC,MAAM,CAAC,CAAC;;YAEnC,OAAO,IAAI,eAAe,CAAC,eAAe,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC,CAAC;IAC1E,CAAC;IAED,6CAA6C;IAC7C,IAAW,MAAM;QACf,OAAO,IAAI,CAAC,WAAW,CAAC;IAC1B,CAAC;IAED,oDAAoD;IAC7C,MAAM,CAAC,iBAAiB,CAAC,MAAiB;QAC/C,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;YACnB,OAAO,KAAK,CAAC;QACf,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;QACxB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;YACvB,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;YACvB,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,oBAAoB,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,EAAE,CAAC,CAAC,GAAG,GAAG;gBAC9D,OAAO,KAAK,CAAC;SAChB;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,wFAAwF;IACjF,aAAa,CAAC,KAAc;QACjC,IAAI,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACxD,yCAAyC;QACzC,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,WAAW,EAAE;YAChC,MAAM,GAAG,GAAG,CAAC,CAAC;YACd,MAAM,CAAC,GAAG,GAAG,CAAC,oBAAoB,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;YAC/C,IAAI,CAAC,GAAG,GAAG;gBACT,OAAO,KAAK,CAAC;YACf,GAAG,GAAG,CAAC,CAAC;SACT;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,yDAAyD;IAClD,eAAe,CAAC,EAAW;QAChC,IAAI,WAAW,GAAG,GAAG,CAAC;QACtB,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC;QAClC,IAAI,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAClC,4CAA4C;QAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;YAChC,MAAM,CAAC,GAAG,GAAG,CAAC,oBAAoB,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;YAC5C,IAAI,CAAC,GAAG,GAAG,EAAE;gBACX,MAAM,GAAG,GAAG,KAAK,CAAC,qBAAqB,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;gBAClD,MAAM,CAAC,GAAG,GAAG,CAAC,kBAAkB,CAAC,EAAE,CAAC,CAAC;gBACrC,IAAI,CAAC,GAAG,GAAG,CAAC;gBACZ,IAAI,CAAC,GAAG,GAAG;oBACT,CAAC,GAAG,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;qBAClB,IAAI,CAAC,GAAG,GAAG;oBACd,CAAC,GAAG,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;;oBAErB,CAAC,GAAG,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC;gBAE1C,IAAI,CAAC,GAAG,WAAW;oBACjB,WAAW,GAAG,CAAC,CAAC;aACnB;YACD,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;SAC3B;QACD,OAAO,WAAW,CAAC;IACrB,CAAC;IAED;;OAEG;IACI,aAAa,CAAC,QAAgB;QACnC,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC;QAClC,IAAI,CAAC,IAAI,CAAC,EAAE;YACV,MAAM,UAAU,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;YACvC,IAAI,KAAK,GAAyB,IAAI,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;YAC/E,KAAK,GAAG,KAAK,CAAC,SAAS,EAAE,CAAC;YAC1B,IAAI,KAAK,KAAK,SAAS,EAAE;gBAAE,OAAO,KAAK,CAAC;aAAE;YAE1C,IAAI,KAAK,GAAG,KAAK,CAAC,YAAY,EAAE,CAAC;YACjC,IAAI,KAA2B,CAAC;YAChC,IAAI,KAAe,CAAC;YACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;gBAC1B,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAChB,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;gBAC/E,KAAK,GAAG,KAAK,CAAC,SAAS,EAAE,CAAC;gBAC1B,IAAI,KAAK,KAAK,SAAS,EAAE;oBAAE,OAAO,KAAK,CAAC;iBAAE;gBAE1C,KAAK,GAAG,KAAK,CAAC,YAAY,EAAE,CAAC;gBAC7B,MAAM,cAAc,GAAG,QAAQ,CAAC,oBAAoB,CAAC,KAAK,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC;gBAC7E,IAAI,cAAc,KAAK,SAAS,EAAE;oBAAE,OAAO,KAAK,CAAC;iBAAE;gBAEnD,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;gBAC/D,wEAAwE;gBACxE,KAAK,GAAG,KAAK,CAAC;aACf;SACF;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;OAKG;IACI,OAAO,CAAC,GAAU;QACvB,IAAI,SAAS,GAAG,CAAE,MAAM,CAAC,SAAS,CAAC;QACnC,IAAI,SAAS,GAAG,MAAM,CAAC,SAAS,CAAC;QAEjC,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC;QAElC,IAAI,CAAC,GAAG,CAAC;YACP,OAAO,OAAO,CAAC,UAAU,EAAE,CAAC;QAE9B,IAAI,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAClC,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,WAAW,EAAE;YAClC,MAAM,QAAQ,GAAa,EAAE,CAAC;YAC9B,MAAM,IAAI,GAAa,EAAE,CAAC;YAC1B,IAAI,GAAG,CAAC,sBAAsB,CAAC,GAAG,EAAE,GAAG,EAAE,QAAQ,EAAE,IAAI,CAAC,EAAE;gBACxD,IAAI,IAAI,CAAC,CAAC,CAAC,GAAG,GAAG,EAAE;oBACjB,IAAI,QAAQ,CAAC,CAAC,CAAC,GAAG,SAAS;wBACzB,SAAS,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;iBAC3B;qBAAM;oBACL,IAAI,QAAQ,CAAC,CAAC,CAAC,GAAG,SAAS;wBACzB,SAAS,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;iBAC3B;gBACD,IAAI,SAAS,GAAG,SAAS;oBACvB,OAAO,OAAO,CAAC,UAAU,EAAE,CAAC;aAC/B;iBAAM;gBACL,+BAA+B;gBAC/B,8CAA8C;gBAC9C,IAAI,GAAG,CAAC,oBAAoB,CAAC,GAAG,EAAE,GAAG,CAAC,MAAM,CAAC,GAAG,GAAG;oBACjD,OAAO,OAAO,CAAC,UAAU,EAAE,CAAC;aAC/B;YAED,uCAAuC;YACvC,GAAG,GAAG,GAAG,CAAC;SACX;QACD,MAAM,KAAK,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;QACnC,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;QACzB,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;QACzB,OAAO,KAAK,CAAC;IACf,CAAC;IAED,oGAAoG;IAC7F,aAAa,CAAC,GAAU;QAC7B,MAAM,KAAK,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;QACnC,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,WAAW;YAChC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,kBAAkB,CAAC,GAAG,CAAC,CAAC,CAAC;QAC7C,OAAO,KAAK,CAAC;IACf,CAAC;IAED,oGAAoG;IAC7F,uBAAuB,CAAC,GAAU;QACvC,MAAM,KAAK,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;QACnC,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,WAAW;YAChC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,+BAA+B,CAAC,GAAG,CAAC,CAAC,CAAC;QAC1D,OAAO,KAAK,CAAC;IACf,CAAC;IAED;;OAEG;IACI,MAAM,CAAC,iBAAiB,CAAC,MAAiB;QAC/C,MAAM,IAAI,GAAc,EAAE,CAAC;QAC3B,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;QACxB,IAAI,CAAC,GAAG,CAAC;YACP,OAAO,SAAS,CAAC;QACnB,gBAAgB;QAChB,MAAM,GAAG,GAAc,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC1C,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,iBAAiB,CAAC,CAAC;QACrC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,uBAAuB;QAC1C,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,mCAAmC;QAEtD,iCAAiC;QACjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,MAAM,SAAS,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;YACzB,IAAI,GAAG,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;YAC1B,OAAO,GAAG,GAAG,CAAC,IAAI,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,oBAAoB,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,SAAS,CAAC,IAAI,GAAG,EAAE;gBACjF,GAAG,EAAE,CAAC;gBACN,IAAI,CAAC,GAAG,EAAE,CAAC;aACZ;YACD,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;SACtB;QAED,gDAAgD;QAChD,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;QAC3B,mCAAmC;QACnC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACtB,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,GAAG;YAC5B,MAAM,SAAS,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;YACzB,IAAI,GAAG,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;YAC1B,OAAO,GAAG,GAAG,EAAE,IAAI,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,oBAAoB,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,SAAS,CAAC,IAAI,GAAG,EAAE;gBAClF,GAAG,EAAE,CAAC;gBACN,IAAI,CAAC,GAAG,EAAE,CAAC;aACZ;YACD,IAAI,CAAC,GAAG,CAAC,EAAE,iCAAiC;gBAC1C,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;SACxB;QAED,OAAO,IAAI,CAAC;IACd,CAAC;CACF","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n\r\n/** @packageDocumentation\r\n * @module Numerics\r\n */\r\n\r\nimport { Geometry } from \"../Geometry\";\r\nimport { Point2d, Vector2d } from \"../geometry3d/Point2dVector2d\";\r\nimport { Range1d } from \"../geometry3d/Range\";\r\n\r\n/**\r\n * Ray with xy origin and direction\r\n * @internal\r\n */\r\nexport class Ray2d {\r\n  private _origin: Point2d;\r\n  private _direction: Vector2d;\r\n\r\n  private constructor(origin: Point2d, direction: Vector2d) {\r\n    this._origin = origin;\r\n    this._direction = direction;\r\n  }\r\n  /** Create from 2d `origin` and `target`.\r\n   * * `target - origin` is the direction vector.\r\n   */\r\n  public static createOriginAndTarget(origin: Point2d, target: Point2d): Ray2d {\r\n    return new Ray2d(origin.clone(), origin.vectorTo(target));\r\n  }\r\n  /** Create from (clones of) `origin` point and `direction` vector */\r\n  public static createOriginAndDirection(origin: Point2d, direction: Vector2d): Ray2d {\r\n    return new Ray2d(origin.clone(), direction.clone());\r\n  }\r\n  /** Capture `origin` and `direction` as ray member variables. */\r\n  public static createOriginAndDirectionCapture(origin: Point2d, direction: Vector2d): Ray2d {\r\n    return new Ray2d(origin, direction);\r\n  }\r\n  /** Get the (REFERENCE TO) the ray origin. */\r\n  public get origin() { return this._origin; }\r\n  /** Get the (REFERENCE TO) the ray direction. */\r\n  public get direction() { return this._direction; }\r\n\r\n  /**\r\n   *  Return a ray that is parallel at distance to the left, specified as fraction of the ray's direction vector.\r\n   */\r\n  public parallelRay(leftFraction: number): Ray2d {\r\n    return new Ray2d(this._origin.addForwardLeft(0.0, leftFraction, this._direction), this._direction);\r\n  }\r\n  /** Return a ray with same origin, direction rotated 90 degrees counterclockwise */\r\n  public ccwPerpendicularRay(): Ray2d {\r\n    return new Ray2d(this._origin, this._direction.rotate90CCWXY());\r\n  }\r\n\r\n  /** Return a ray with same origin, direction rotated 90 degrees clockwise */\r\n  public cwPerpendicularRay(): Ray2d {\r\n    return new Ray2d(this._origin, this._direction.rotate90CWXY());\r\n  }\r\n  /** Normalize the direction vector in place. */\r\n  public normalizeDirectionInPlace(defaultX: number = 1, defaultY: number = 0): boolean {\r\n    if (this._direction.normalize(this._direction)) {\r\n      return true;\r\n    } else {\r\n      this._direction.x = defaultX;\r\n      this._direction.y = defaultY;\r\n      // magnitude = 0.0;\r\n      return false;\r\n    }\r\n  }\r\n\r\n  /**\r\n   * Intersect this ray (ASSUMED NORMALIZED) with unbounded line defined by points.\r\n   *  (The normalization assumption affects test for parallel vectors.)\r\n   *  Fraction and dHds passed as number[] to use by reference... Sticking to return of true and false in the case fraction is zero after\r\n   *  a true safe divide\r\n   */\r\n  public intersectUnboundedLine(linePointA: Point2d, linePointB: Point2d, fraction: number[], dHds: number[]): boolean {\r\n    const lineDirection = linePointA.vectorTo(linePointB);\r\n    const vector0 = linePointA.vectorTo(this._origin);\r\n    const h0 = vector0.crossProduct(lineDirection);\r\n    dHds[0] = this._direction.crossProduct(lineDirection);\r\n    // h = h0 + s * dh\r\n    const ff = Geometry.conditionalDivideFraction(-h0, dHds[0]);\r\n    if (ff !== undefined) {\r\n      fraction[0] = ff;\r\n      return true;\r\n    } else {\r\n      fraction[0] = 0.0;\r\n      return false;\r\n    }\r\n  }\r\n\r\n  /** return the ray fraction where point projects to the ray */\r\n  public projectionFraction(point: Point2d): number {\r\n    return this._origin.vectorTo(point).fractionOfProjectionToVector(this._direction);\r\n  }\r\n\r\n  /** return the fraction of projection to the perpendicular ray */\r\n  public perpendicularProjectionFraction(point: Point2d): number {\r\n    const uv = this._direction.crossProduct(this._origin.vectorTo(point));\r\n    const uu = this._direction.magnitudeSquared();\r\n    // Want zero returned if failure case, not undefined\r\n    return Geometry.safeDivideFraction(uv, uu, 0.0);\r\n  }\r\n\r\n  /** Return point from origin plus a scaled vector */\r\n  public fractionToPoint(f: number): Point2d {\r\n    return this._origin.plusScaled(this._direction, f);\r\n  }\r\n}\r\n/**\r\n * Convex hull of points in 2d.\r\n * @internal\r\n */\r\nexport class ConvexPolygon2d {\r\n  // hull points in CCW order, WITHOUT final duplicate...\r\n  // REMARK: In degenerate case with 0,1,or 2 points the array is still there.\r\n  private _hullPoints: Point2d[];\r\n\r\n  constructor(points: Point2d[] | undefined) {\r\n    this._hullPoints = [];\r\n    // Deep copy of points array given\r\n    if (points) {\r\n      for (const point of points) {\r\n        this._hullPoints.push(point);\r\n      }\r\n    }\r\n  }\r\n\r\n  /** Create the hull */\r\n  public static createHull(points: Point2d[]): ConvexPolygon2d {\r\n    return new ConvexPolygon2d(ConvexPolygon2d.computeConvexHull(points));\r\n  }\r\n\r\n  /** Create the hull. First try to use the points as given. */\r\n  public static createHullIsValidCheck(points: Point2d[]) {\r\n    if (ConvexPolygon2d.isValidConvexHull(points))\r\n      return new ConvexPolygon2d(points);\r\n    else\r\n      return new ConvexPolygon2d(ConvexPolygon2d.computeConvexHull(points));\r\n  }\r\n\r\n  /** Return a reference of the hull points. */\r\n  public get points(): Point2d[] {\r\n    return this._hullPoints;\r\n  }\r\n\r\n  /** Test if hull points are a convex, CCW polygon */\r\n  public static isValidConvexHull(points: Point2d[]) {\r\n    if (points.length < 3)\r\n      return false;\r\n    const n = points.length;\r\n    for (let i = 0; i < n; i++) {\r\n      const i1 = (i + 1) % n;\r\n      const i2 = (i + 2) % n;\r\n      if (points[i].crossProductToPoints(points[i1], points[i2]) < 0.0)\r\n        return false;\r\n    }\r\n    return true;\r\n  }\r\n\r\n  /** Return true if the convex hull (to the left of the edges) contains the test point */\r\n  public containsPoint(point: Point2d): boolean {\r\n    let xy0 = this._hullPoints[this._hullPoints.length - 1];\r\n    // double tol = -1.0e-20;  negative tol!!\r\n    for (const i of this._hullPoints) {\r\n      const xy1 = i;\r\n      const c = xy0.crossProductToPoints(xy1, point);\r\n      if (c < 0.0)\r\n        return false;\r\n      xy0 = i;\r\n    }\r\n    return true;\r\n  }\r\n\r\n  /** Return the largest outside. (return 0 if in or on) */\r\n  public distanceOutside(xy: Point2d): number {\r\n    let maxDistance = 0.0;\r\n    const n = this._hullPoints.length;\r\n    let xy0 = this._hullPoints[n - 1];\r\n    // double tol = -1.0e-20;  // negative tol!!\r\n    for (let i = 0; i < n; i++) {\r\n      const xy1 = this._hullPoints[i];\r\n      const c = xy0.crossProductToPoints(xy1, xy);\r\n      if (c < 0.0) {\r\n        const ray = Ray2d.createOriginAndTarget(xy0, xy1);\r\n        const s = ray.projectionFraction(xy);\r\n        let d = 0.0;\r\n        if (s < 0.0)\r\n          d = xy0.distance(xy);\r\n        else if (s > 1.0)\r\n          d = xy1.distance(xy);\r\n        else\r\n          d = xy.distance(ray.fractionToPoint(s));\r\n\r\n        if (d > maxDistance)\r\n          maxDistance = d;\r\n      }\r\n      xy0 = this._hullPoints[i];\r\n    }\r\n    return maxDistance;\r\n  }\r\n\r\n  /** Offset the entire hull (in place) by distance.\r\n   * Returns false if an undefined occurred from normalizing (could occur after changing some hull points already)\r\n   */\r\n  public offsetInPlace(distance: number): boolean {\r\n    const n = this._hullPoints.length;\r\n    if (n >= 3) {\r\n      const hullPoint0 = this._hullPoints[0];\r\n      let edgeA: Vector2d | undefined = this._hullPoints[n - 1].vectorTo(hullPoint0);\r\n      edgeA = edgeA.normalize();\r\n      if (edgeA === undefined) { return false; }\r\n\r\n      let perpA = edgeA.rotate90CWXY();\r\n      let edgeB: Vector2d | undefined;\r\n      let perpB: Vector2d;\r\n      for (let i = 0; i < n; i++) {\r\n        const j = i + 1;\r\n        edgeB = this._hullPoints[i].vectorTo(j < n ? this._hullPoints[j] : hullPoint0);\r\n        edgeB = edgeB.normalize();\r\n        if (edgeB === undefined) { return false; }\r\n\r\n        perpB = edgeB.rotate90CWXY();\r\n        const offsetBisector = Vector2d.createOffsetBisector(perpA, perpB, distance);\r\n        if (offsetBisector === undefined) { return false; }\r\n\r\n        this._hullPoints[i] = this._hullPoints[i].plus(offsetBisector);\r\n        // PerpA takes up reference to perpB, as perpB will die in new iteration\r\n        perpA = perpB;\r\n      }\r\n    }\r\n    return true;\r\n  }\r\n\r\n  /**\r\n   * Return 2 distances bounding the intersection of the ray with a convex hull.\r\n   * ASSUME (for tolerance) the ray has normalized direction vector.\r\n   * Both negative and positive distances along the ray are possible.\r\n   * Returns range with extremities if less than 3 points, distanceA > distanceB, or if cross product < 0\r\n   */\r\n  public clipRay(ray: Ray2d): Range1d {\r\n    let distanceA = - Number.MAX_VALUE;\r\n    let distanceB = Number.MAX_VALUE;\r\n\r\n    const n = this._hullPoints.length;\r\n\r\n    if (n < 3)\r\n      return Range1d.createNull();\r\n\r\n    let xy0 = this._hullPoints[n - 1];\r\n    for (const xy1 of this._hullPoints) {\r\n      const distance: number[] = [];\r\n      const dHds: number[] = [];\r\n      if (ray.intersectUnboundedLine(xy0, xy1, distance, dHds)) {\r\n        if (dHds[0] > 0.0) {\r\n          if (distance[0] < distanceB)\r\n            distanceB = distance[0];\r\n        } else {\r\n          if (distance[0] > distanceA)\r\n            distanceA = distance[0];\r\n        }\r\n        if (distanceA > distanceB)\r\n          return Range1d.createNull();\r\n      } else {\r\n        // ray is parallel to the edge.\r\n        // Any single point out classifies it all . ..\r\n        if (xy0.crossProductToPoints(xy1, ray.origin) < 0.0)\r\n          return Range1d.createNull();\r\n      }\r\n\r\n      // xy1 is reassigned with each new loop\r\n      xy0 = xy1;\r\n    }\r\n    const range = Range1d.createNull();\r\n    range.extendX(distanceA);\r\n    range.extendX(distanceB);\r\n    return range;\r\n  }\r\n\r\n  /** Return the range of (fractional) ray positions for projections of all points from the arrays. */\r\n  public rangeAlongRay(ray: Ray2d): Range1d {\r\n    const range = Range1d.createNull();\r\n    for (const xy1 of this._hullPoints)\r\n      range.extendX(ray.projectionFraction(xy1));\r\n    return range;\r\n  }\r\n\r\n  /** Return the range of (fractional) ray positions for projections of all points from the arrays. */\r\n  public rangePerpendicularToRay(ray: Ray2d): Range1d {\r\n    const range = Range1d.createNull();\r\n    for (const xy1 of this._hullPoints)\r\n      range.extendX(ray.perpendicularProjectionFraction(xy1));\r\n    return range;\r\n  }\r\n\r\n  /** Computes the hull of a convex polygon from points given. Returns the hull as a new Point2d array.\r\n   *  Returns an empty hull if less than 3 points are given.\r\n   */\r\n  public static computeConvexHull(points: Point2d[]): Point2d[] | undefined {\r\n    const hull: Point2d[] = [];\r\n    const n = points.length;\r\n    if (n < 3)\r\n      return undefined;\r\n    // Get deep copy\r\n    const xy1: Point2d[] = points.slice(0, n);\r\n    xy1.sort(Geometry.lexicalXYLessThan);\r\n    hull.push(xy1[0]); // This is sure to stay\r\n    hull.push(xy1[1]); // This one can be removed in loop.\r\n\r\n    // First sweep creates upper hull\r\n    for (let i = 2; i < n; i++) {\r\n      const candidate = xy1[i];\r\n      let top = hull.length - 1;\r\n      while (top > 0 && hull[top - 1].crossProductToPoints(hull[top], candidate) <= 0.0) {\r\n        top--;\r\n        hull.pop();\r\n      }\r\n      hull.push(candidate);\r\n    }\r\n\r\n    // Second sweep creates lower hull right to left\r\n    const i0 = hull.length - 1;\r\n    // xy1.back () is already on stack.\r\n    hull.push(xy1[n - 2]);\r\n    for (let i = n - 2; i-- > 0;) {\r\n      const candidate = xy1[i];\r\n      let top = hull.length - 1;\r\n      while (top > i0 && hull[top - 1].crossProductToPoints(hull[top], candidate) <= 0.0) {\r\n        top--;\r\n        hull.pop();\r\n      }\r\n      if (i > 0) // don't replicate start point!!!\r\n        hull.push(candidate);\r\n    }\r\n\r\n    return hull;\r\n  }\r\n}\r\n"]}