@itwin/core-geometry 5.0.0-dev.32 → 5.0.0-dev.34

package/lib/esm/geometry3d/PolylineCompressionByEdgeOffset.js

@@ -26,6 +26,9 @@ export class PolylineCompressionContext {
         if (point)
             this._dest.push(point);
     }
+    /** work data used by find max deviation */
+    static { this._vector01 = Vector3d.create(); }
+    static { this._vectorQ = Vector3d.create(); }
     /**
      * Return index of max magnitude of cross product of vectors (index to index+1) and (index to index+2)
      * * Return undefined if unable to find a nonzero cross product.
@@ -268,7 +271,4 @@ export class PolylineCompressionContext {
         }
     }
 }
-/** work data used by find max deviation */
-PolylineCompressionContext._vector01 = Vector3d.create();
-PolylineCompressionContext._vectorQ = Vector3d.create();
 //# sourceMappingURL=PolylineCompressionByEdgeOffset.js.map

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

@@ -1 +1 @@
-{"version":3,"file":"PolylineCompressionByEdgeOffset.js","sourceRoot":"","sources":["../../../src/geometry3d/PolylineCompressionByEdgeOffset.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAGvC,OAAO,EAAE,mBAAmB,EAAE,MAAM,uBAAuB,CAAC;AAC5D,OAAO,EAAW,QAAQ,EAAE,MAAM,mBAAmB,CAAC;AAEtD,sBAAsB;AACtB;;GAEG;AACH,MAAM,OAAO,0BAA0B;IACrC;;OAEG;IACH,YAAoB,MAA4B,EAAE,IAAmC,EAAE,SAAiB;QACtG,IAAI,CAAC,iBAAiB,GAAG,SAAS,GAAG,SAAS,CAAC;QAC/C,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;QACtB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;IACpB,CAAC;IAOD;;OAEG;IACK,kBAAkB,CAAC,CAAS;QAClC,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,6BAA6B,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;QACtF,IAAI,KAAK;YACP,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC3B,CAAC;IAID;;;;;OAKG;IACK,sBAAsB,CAAC,MAAc,EAAE,MAAc;QAC3D,IAAI,IAAI,GAAG,GAAG,CAAC;QACf,IAAI,CAAC,CAAC;QACN,IAAI,QAA4B,CAAC;QACjC,KAAK,IAAI,KAAK,GAAG,MAAM,EAAE,KAAK,IAAI,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC;YAClD,MAAM,EAAE,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;YAC3C,MAAM,EAAE,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;YAC/C,MAAM,EAAE,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;YAC/C,IAAI,CAAC,OAAO,CAAC,2BAA2B,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,0BAA0B,CAAC,QAAQ,CAAC,CAAC;YAC1F,CAAC,GAAG,0BAA0B,CAAC,QAAQ,CAAC,gBAAgB,EAAE,CAAC;YAC3D,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC;gBACb,IAAI,GAAG,CAAC,CAAC;gBACT,QAAQ,GAAG,KAAK,CAAC;YACnB,CAAC;QACH,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;;;OAIG;IACK,mBAAmB,CAAC,MAAc,EAAE,MAAc;QACxD,MAAM,EAAE,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QAC5C,MAAM,EAAE,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QAC5C,IAAI,YAAY,GAAG,IAAI,CAAC,iBAAiB,CAAC;QAC1C,IAAI,iBAAiB,CAAC;QACtB,IAAI,SAAS,CAAC;QACd,IAAI,eAAe,CAAC;QACpB,IAAI,CAAC,CAAC;QACN,IAAI,CAAC,CAAC;QACN,IAAI,CAAC,OAAO,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,EAAE,0BAA0B,CAAC,SAAS,CAAE,CAAC;QAC7E,MAAM,WAAW,GAAG,0BAA0B,CAAC,SAAS,CAAC,gBAAgB,EAAE,CAAC;QAC5E,KAAK,IAAI,KAAK,GAAG,MAAM,GAAG,CAAC,EAAE,KAAK,GAAG,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC;YACrD,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;YACpC,IAAI,CAAC,OAAO,CAAC,gBAAgB,CAAC,EAAE,EAAE,CAAC,EAAE,0BAA0B,CAAC,QAAQ,CAAC,CAAC;YAC1E,SAAS,GAAG,0BAA0B,CAAC,SAAS,CAAC,UAAU,CAAC,0BAA0B,CAAC,QAAQ,CAAC,CAAC;YACjG,IAAI,SAAS,IAAI,CAAC,EAAE,CAAC;gBACnB,eAAe,GAAG,0BAA0B,CAAC,QAAQ,CAAC,gBAAgB,EAAE,CAAC;YAC3E,CAAC;iBAAM,IAAI,SAAS,GAAG,WAAW,EAAE,CAAC;gBACnC,IAAI,CAAC,OAAO,CAAC,gBAAgB,CAAC,EAAE,EAAE,CAAC,EAAE,0BAA0B,CAAC,QAAQ,CAAC,CAAC;gBAC1E,eAAe,GAAG,0BAA0B,CAAC,QAAQ,CAAC,gBAAgB,EAAE,CAAC;YAC3E,CAAC;iBAAM,CAAC;gBACN,CAAC,GAAG,SAAS,GAAG,WAAW,CAAC;gBAC5B,eAAe,GAAG,0BAA0B,CAAC,QAAQ,CAAC,gBAAgB,EAAE,GAAG,WAAW,GAAG,CAAC,GAAG,CAAC,CAAC;YACjG,CAAC;YACD,IAAI,eAAe,GAAG,YAAY,EAAE,CAAC;gBACnC,YAAY,GAAG,eAAe,CAAC;gBAC/B,iBAAiB,GAAG,KAAK,CAAC;YAC5B,CAAC;QACH,CAAC;QACD,OAAO,iBAAiB,CAAC;IAC3B,CAAC;IACD;;;;;;OAMG;IACH,oCAAoC;IACpC,iBAAiB;IACT,+BAA+B,CAAC,EAAU,EAAE,EAAU;QAC5D,IAAI,EAAE,KAAK,EAAE,GAAG,CAAC,EAAE,CAAC;YAClB,IAAI,CAAC,kBAAkB,CAAC,EAAE,CAAC,CAAC;YAC5B,OAAO;QACT,CAAC;QACD,MAAM,iBAAiB,GAAG,IAAI,CAAC,mBAAmB,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC3D,IAAI,iBAAiB,KAAK,SAAS,EAAE,CAAC;YACpC,IAAI,CAAC,kBAAkB,CAAC,EAAE,CAAC,CAAC,CAAC,oCAAoC;QACnE,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,+BAA+B,CAAC,EAAE,EAAE,iBAAiB,CAAC,CAAC;YAC5D,IAAI,CAAC,+BAA+B,CAAC,iBAAiB,EAAE,EAAE,CAAC,CAAC;QAC9D,CAAC;IACH,CAAC;IACD,sBAAsB;IACtB;;;;;OAKG;IACI,MAAM,CAAC,gCAAgC,CAAC,MAAiB,EAAE,cAAsB;QACtF,MAAM,OAAO,GAAG,IAAI,mBAAmB,CAAC,MAAM,CAAC,CAAC;QAChD,MAAM,KAAK,GAAG,IAAI,mBAAmB,CAAC,EAAE,CAAC,CAAC;QAC1C,IAAI,CAAC,8BAA8B,CAAC,OAAO,EAAE,KAAK,EAAE,cAAc,CAAC,CAAC;QACpE,OAAO,KAAK,CAAC,IAAI,CAAC;IACpB,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,8BAA8B,CAAC,MAA4B,EAAE,IAAmC,EAAE,cAAsB;QACpI,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;QACxB,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACZ,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,6BAA6B,CAAC,CAAC,CAAE,CAAC,CAAC;YACpD,OAAO;QACT,CAAC;QACD,MAAM,OAAO,GAAG,IAAI,0BAA0B,CAAC,MAAM,EAAE,IAAI,EAAE,cAAc,CAAC,CAAC;QAC7E,4GAA4G;QAC5G,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,IAAI,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC;QACnB,IAAI,CAAC,GAAG,CAAC,IAAI,MAAM,CAAC,kBAAkB,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAE,IAAI,cAAc,EAAE,CAAC;YACpE,8FAA8F;YAC9F,sEAAsE;YACtE,MAAM,oBAAoB,GAAG,OAAO,CAAC,sBAAsB,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;YACtE,IAAI,oBAAoB,KAAK,SAAS,EAAE,CAAC;gBACvC,MAAM,GAAG,oBAAoB,GAAG,CAAC,CAAC;gBAClC,MAAM,GAAG,MAAM,GAAG,CAAC,CAAC;YACtB,CAAC;QACH,CAAC;QACD,OAAO,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC;QACnC,OAAO,CAAC,+BAA+B,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC1D,CAAC;IACD;;OAEG;IACI,MAAM,CAAC,gCAAgC,CAAC,IAAsB,EAAE,UAAkB;QACvF,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QACtB,IAAI,CAAC,GAAG,CAAC;YACP,OAAO;QACT,IAAI,iBAAiB,GAAG,CAAC,CAAC;QAC1B,8BAA8B;QAC9B,IAAI,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC;QACnB,OAAO,MAAM,GAAG,CAAC,IAAI,IAAI,CAAC,kBAAkB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAE,GAAG,UAAU;YAC3E,MAAM,EAAE,CAAC;QACX,IAAI,MAAM,KAAK,CAAC,EAAE,CAAC;YACjB,+BAA+B;YAC/B,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;YAChB,OAAO;QACT,CAAC;QACD,0EAA0E;QAC1E,IAAI,MAAM,GAAG,CAAC,GAAG,CAAC;YAChB,IAAI,CAAC,gBAAgB,CAAC,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,CAAC;QACvC,IAAI,cAAc,GAAG,iBAAiB,GAAG,CAAC,CAAC;QAC3C,OAAO,cAAc,IAAI,MAAM,EAAE,CAAC;YAChC,MAAM,CAAC,GAAG,IAAI,CAAC,kBAAkB,CAAC,iBAAiB,EAAE,cAAc,CAAE,CAAC;YACtE,IAAI,CAAC,IAAI,UAAU,EAAE,CAAC;gBACpB,IAAI,CAAC,gBAAgB,CAAC,cAAc,EAAE,iBAAiB,GAAG,CAAC,CAAC,CAAC;gBAC7D,iBAAiB,EAAE,CAAC;YACtB,CAAC;YACD,cAAc,EAAE,CAAC;QACnB,CAAC;QACD,IAAI,CAAC,MAAM,GAAG,iBAAiB,GAAG,CAAC,CAAC;IACtC,CAAC;IAED;;OAEG;IACI,MAAM,CAAC,kCAAkC,CAAC,IAAsB,EAAE,YAAoB;QAC3F,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QACtB,IAAI,CAAC,GAAG,CAAC;YACP,OAAO;QACT,IAAI,iBAAiB,GAAG,CAAC,CAAC;QAC1B,MAAM,KAAK,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC;QAChC,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC;YAClC,IAAI,CAAC,2BAA2B,CAAC,iBAAiB,EAAE,EAAE,EAAE,EAAE,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC;YACvE,IAAI,GAAG,GAAG,KAAK,CAAC,SAAS,EAAE,GAAG,YAAY,EAAE,CAAC;gBAC3C,IAAI,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,iBAAiB,CAAC,CAAC;YACjD,CAAC;QACH,CAAC;QACD,IAAI,CAAC,gBAAgB,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,iBAAiB,CAAC,CAAC;QAClD,IAAI,CAAC,MAAM,GAAG,iBAAiB,GAAG,CAAC,CAAC;IACtC,CAAC;IAED;;OAEG;IACI,MAAM,CAAC,sCAAsC,CAAC,IAAsB,EAAE,qBAA6B,EAAE,oBAAoB,GAAG,MAAM;QACvI,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QACtB,IAAI,CAAC,GAAG,CAAC;YACP,OAAO;QACT,IAAI,iBAAiB,GAAG,CAAC,CAAC;QAC1B,MAAM,QAAQ,GAAG,0BAA0B,CAAC,SAAS,CAAC;QACtD,MAAM,OAAO,GAAG,0BAA0B,CAAC,QAAQ,CAAC;QACpD,IAAI,eAAe,CAAC;QACpB,MAAM,4BAA4B,GAAG,qBAAqB,GAAG,qBAAqB,CAAC;QACnF,IAAI,WAAW,CAAC;QAChB,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,OAAO,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC;YACxB,IAAI,CAAC,gBAAgB,CAAC,iBAAiB,EAAE,EAAE,GAAG,CAAC,EAAE,QAAQ,CAAC,CAAC;YAC3D,IAAI,CAAC,gBAAgB,CAAC,iBAAiB,EAAE,EAAE,EAAE,OAAO,CAAC,CAAC;YACtD,WAAW,GAAG,QAAQ,CAAC,gBAAgB,EAAE,CAAC;YAC1C,MAAM,CAAC,GAAG,QAAQ,CAAC,yBAAyB,CAAC,OAAO,CAAC,UAAU,CAAC,QAAQ,CAAC,EAAE,WAAW,CAAC,CAAC;YACxF,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;gBACpB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,oBAAoB,EAAE,CAAC;oBAC1C,eAAe,GAAG,0BAA0B,CAAC,QAAQ,CAAC,gBAAgB,EAAE,GAAG,WAAW,GAAG,CAAC,GAAG,CAAC,CAAC;oBAC/F,IAAI,eAAe,IAAI,4BAA4B,EAAE,CAAC;wBACpD,+BAA+B;wBAC/B,IAAI,CAAC,gBAAgB,CAAC,EAAE,GAAG,CAAC,EAAE,EAAE,iBAAiB,CAAC,CAAC;wBACnD,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;wBACZ,SAAS;oBACX,CAAC;gBACH,CAAC;YACH,CAAC;YACD,IAAI,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,iBAAiB,CAAC,CAAC;QACjD,CAAC;QACD,IAAI,EAAE,GAAG,CAAC;YACR,IAAI,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,iBAAiB,CAAC,CAAC;QACjD,IAAI,CAAC,MAAM,GAAG,iBAAiB,GAAG,CAAC,CAAC;IACtC,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,2BAA2B,CAAC,MAAiB,EAAE,uBAA+B,EAAE,sBAA8B;QAC1H,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;QACpC,IAAI,SAAS,IAAI,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,GAAG,uBAAuB,EAAE,CAAC;YACtF,4CAA4C;YAC5C,MAAM,MAAM,GAAG,SAAS,GAAG,CAAC,CAAC;YAC7B,MAAM,MAAM,GAAG,CAAC,CAAC;YACjB,MAAM,MAAM,GAAG,CAAC,CAAC;YACjB,MAAM,OAAO,GAAG,QAAQ,CAAC,cAAc,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;YACxE,MAAM,OAAO,GAAG,QAAQ,CAAC,cAAc,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;YACxE,MAAM,KAAK,GAAG,OAAO,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YAC1C,MAAM,KAAK,GAAG,OAAO,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YAC1C,MAAM,QAAQ,GAAG,QAAQ,CAAC,yBAAyB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;YAClE,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,GAAG,GAAG,IAAI,QAAQ,GAAG,GAAG,EAAE,CAAC;gBAC/D,MAAM,EAAE,GAAG,OAAO,CAAC,gBAAgB,EAAE,GAAG,QAAQ,GAAG,QAAQ,GAAG,KAAK,CAAC;gBACpE,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,sBAAsB,EAAE,CAAC;oBACrD,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC;oBAC3B,MAAM,CAAC,GAAG,EAAE,CAAC;gBACf,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;;AAnPD,2CAA2C;AAC5B,oCAAS,GAAa,QAAQ,CAAC,MAAM,EAAE,CAAC;AACxC,mCAAQ,GAAa,QAAQ,CAAC,MAAM,EAAE,CAAC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\nimport { Geometry } from \"../Geometry\";\nimport { GrowableXYZArray } from \"./GrowableXYZArray\";\nimport { IndexedReadWriteXYZCollection, IndexedXYZCollection } from \"./IndexedXYZCollection\";\nimport { Point3dArrayCarrier } from \"./Point3dArrayCarrier\";\nimport { Point3d, Vector3d } from \"./Point3dVector3d\";\n\n// cspell:word Puecker\n/** context class for Puecker-Douglas polyline compression, viz https://en.wikipedia.org/wiki/Ramer–Douglas–Peucker_algorithm\n * @internal\n */\nexport class PolylineCompressionContext {\n  /** Caller provides source and tolerance.\n   * * pointer to source is retained, but contents of source are never modified.\n   */\n  private constructor(source: IndexedXYZCollection, dest: IndexedReadWriteXYZCollection, tolerance: number) {\n    this._toleranceSquared = tolerance * tolerance;\n    this._source = source;\n    this._dest = dest;\n  }\n  private _source: IndexedXYZCollection;\n\n  private _dest: IndexedReadWriteXYZCollection;\n\n  /** Squared tolerance for equal point. */\n  private _toleranceSquared: number;\n  /** push (clone of) the point at index i from the source to the growing result.\n   * * index is adjusted cyclically to source index range by modulo.\n   */\n  private acceptPointByIndex(i: number) {\n    const point = this._source.getPoint3dAtCheckedPointIndex(this._source.cyclicIndex(i));\n    if (point)\n      this._dest.push(point);\n  }\n  /** work data used by find max deviation */\n  private static _vector01: Vector3d = Vector3d.create();\n  private static _vectorQ: Vector3d = Vector3d.create();\n  /**\n   * Return index of max magnitude of cross product of vectors (index to index+1) and (index to index+2)\n   * * Return undefined if unable to find a nonzero cross product.\n   * @param i0 first cross product central index.\n   * @param i1 last cross product central index.\n   */\n  private indexOfMaxCrossProduct(index0: number, index1: number): number | undefined {\n    let qMax = 0.0;\n    let q;\n    let indexMax: number | undefined;\n    for (let index = index0; index <= index1; index++) {\n      const iA = this._source.cyclicIndex(index);\n      const iB = this._source.cyclicIndex(index + 1);\n      const iC = this._source.cyclicIndex(index + 2);\n      this._source.crossProductIndexIndexIndex(iA, iB, iC, PolylineCompressionContext._vectorQ);\n      q = PolylineCompressionContext._vectorQ.magnitudeSquared();\n      if (q > qMax) {\n        qMax = q;\n        indexMax = index;\n      }\n    }\n    return indexMax;\n  }\n\n  /**\n   * Return interior index where max deviation in excess of tolerance occurs.\n   * @param i0 first index of interval\n   * @param i1 INCLUSIVE final index\n   */\n  private indexOfMaxDeviation(index0: number, index1: number): number | undefined {\n    const i0 = this._source.cyclicIndex(index0);\n    const i1 = this._source.cyclicIndex(index1);\n    let maxDeviation = this._toleranceSquared;\n    let maxDeviationIndex;\n    let numerator;\n    let distanceSquared;\n    let s;\n    let i;\n    this._source.vectorIndexIndex(i0, i1, PolylineCompressionContext._vector01)!;\n    const denominator = PolylineCompressionContext._vector01.magnitudeSquared();\n    for (let index = index0 + 1; index < index1; index++) {\n      i = this._source.cyclicIndex(index);\n      this._source.vectorIndexIndex(i0, i, PolylineCompressionContext._vectorQ);\n      numerator = PolylineCompressionContext._vector01.dotProduct(PolylineCompressionContext._vectorQ);\n      if (numerator <= 0) {\n        distanceSquared = PolylineCompressionContext._vectorQ.magnitudeSquared();\n      } else if (numerator > denominator) {\n        this._source.vectorIndexIndex(i1, i, PolylineCompressionContext._vectorQ);\n        distanceSquared = PolylineCompressionContext._vectorQ.magnitudeSquared();\n      } else {\n        s = numerator / denominator;\n        distanceSquared = PolylineCompressionContext._vectorQ.magnitudeSquared() - denominator * s * s;\n      }\n      if (distanceSquared > maxDeviation) {\n        maxDeviation = distanceSquared;\n        maxDeviationIndex = index;\n      }\n    }\n    return maxDeviationIndex;\n  }\n  /**\n   *\n   * @param i0 first active point index\n   * @param i1 last active point index (INCLUSIVE -- not \"one beyond\")\n   * @param chordTolerance\n   * @param result\n   */\n  // ASSUME index i0 is already saved.\n  // ASSUME point i\n  private recursiveCompressByChordErrorGo(i0: number, i1: number) {\n    if (i1 === i0 + 1) {\n      this.acceptPointByIndex(i1);\n      return;\n    }\n    const distantPointIndex = this.indexOfMaxDeviation(i0, i1);\n    if (distantPointIndex === undefined) {\n      this.acceptPointByIndex(i1); // which compresses out some points.\n    } else {\n      this.recursiveCompressByChordErrorGo(i0, distantPointIndex);\n      this.recursiveCompressByChordErrorGo(distantPointIndex, i1);\n    }\n  }\n  // cspell:word Peucker\n  /**\n   * Return a point array with a subset of the input points.\n   * * This is a global analysis (Douglas-Peucker)\n   * @param source input points.\n   * @param chordTolerance Points less than this distance from a retained edge may be ignored.\n   */\n  public static compressPoint3dArrayByChordError(source: Point3d[], chordTolerance: number): Point3d[] {\n    const source1 = new Point3dArrayCarrier(source);\n    const dest1 = new Point3dArrayCarrier([]);\n    this.compressCollectionByChordError(source1, dest1, chordTolerance);\n    return dest1.data;\n  }\n  /**\n   * * Return a polyline with a subset of the input points.\n   * * This is a global analysis (Douglas-Peucker)\n   * * Global search for vertices that are close to edges between widely separated neighbors.\n   * * Recurses to smaller subsets.\n   * @param source input points\n   * @param dest output points.  Must be different from source.\n   * @param chordTolerance Points less than this distance from a retained edge may be ignored.\n   */\n  public static compressCollectionByChordError(source: IndexedXYZCollection, dest: IndexedReadWriteXYZCollection, chordTolerance: number) {\n    dest.clear();\n    const n = source.length;\n    if (n === 1) {\n      dest.push(source.getPoint3dAtCheckedPointIndex(0)!);\n      return;\n    }\n    const context = new PolylineCompressionContext(source, dest, chordTolerance);\n    // Do compression on inclusive interval from indexA to indexB, with indices interpreted cyclically if closed\n    let indexA = 0;\n    let indexB = n - 1;\n    if (n > 2 && source.distanceIndexIndex(0, n - 1)! <= chordTolerance) {\n      // cyclic data. It is possible that the wrap point itself has to be seen as an internal point.\n      // do the search from point index where there is a large triangle . ..\n      const maxCrossProductIndex = context.indexOfMaxCrossProduct(0, n - 1);\n      if (maxCrossProductIndex !== undefined) {\n        indexA = maxCrossProductIndex + 1;\n        indexB = indexA + n;\n      }\n    }\n    context.acceptPointByIndex(indexA);\n    context.recursiveCompressByChordErrorGo(indexA, indexB);\n  }\n  /** Copy points from source to dest, omitting those too close to predecessor.\n   * * First and last points are always preserved.\n   */\n  public static compressInPlaceByShortEdgeLength(data: GrowableXYZArray, edgeLength: number) {\n    const n = data.length;\n    if (n < 2)\n      return;\n    let lastAcceptedIndex = 0;\n    // back up from final point ..\n    let indexB = n - 1;\n    while (indexB > 0 && data.distanceIndexIndex(indexB - 1, n - 1)! < edgeLength)\n      indexB--;\n    if (indexB === 0) {\n      // Theres only one point there.\n      data.length = 1;\n      return;\n    }\n    // we want the exact bits of the final point even if others were nearby ..\n    if (indexB < n - 1)\n      data.moveIndexToIndex(n - 1, indexB);\n    let candidateIndex = lastAcceptedIndex + 1;\n    while (candidateIndex <= indexB) {\n      const d = data.distanceIndexIndex(lastAcceptedIndex, candidateIndex)!;\n      if (d >= edgeLength) {\n        data.moveIndexToIndex(candidateIndex, lastAcceptedIndex + 1);\n        lastAcceptedIndex++;\n      }\n      candidateIndex++;\n    }\n    data.length = lastAcceptedIndex + 1;\n  }\n\n  /** Copy points from source to dest, omitting those too close to predecessor.\n   * * First and last points are always preserved.\n   */\n  public static compressInPlaceBySmallTriangleArea(data: GrowableXYZArray, triangleArea: number) {\n    const n = data.length;\n    if (n < 3)\n      return;\n    let lastAcceptedIndex = 0;\n    const cross = Vector3d.create();\n    for (let i1 = 1; i1 + 1 < n; i1++) {\n      data.crossProductIndexIndexIndex(lastAcceptedIndex, i1, i1 + 1, cross);\n      if (0.5 * cross.magnitude() > triangleArea) {\n        data.moveIndexToIndex(i1, ++lastAcceptedIndex);\n      }\n    }\n    data.moveIndexToIndex(n - 1, ++lastAcceptedIndex);\n    data.length = lastAcceptedIndex + 1;\n  }\n\n  /** Copy points from source to dest, omitting those too close to edge between neighbors.\n   * * First and last points are always preserved.\n   */\n  public static compressInPlaceByPerpendicularDistance(data: GrowableXYZArray, perpendicularDistance: number, maxExtensionFraction = 1.0001) {\n    const n = data.length;\n    if (n < 3)\n      return;\n    let lastAcceptedIndex = 0;\n    const vector01 = PolylineCompressionContext._vector01;\n    const vectorQ = PolylineCompressionContext._vectorQ;\n    let distanceSquared;\n    const perpendicularDistanceSquared = perpendicularDistance * perpendicularDistance;\n    let denominator;\n    let i1 = 1;\n    for (; i1 + 1 < n; i1++) {\n      data.vectorIndexIndex(lastAcceptedIndex, i1 + 1, vector01);\n      data.vectorIndexIndex(lastAcceptedIndex, i1, vectorQ);\n      denominator = vector01.magnitudeSquared();\n      const s = Geometry.conditionalDivideFraction(vectorQ.dotProduct(vector01), denominator);\n      if (s !== undefined) {\n        if (s >= 0.0 && s <= maxExtensionFraction) {\n          distanceSquared = PolylineCompressionContext._vectorQ.magnitudeSquared() - denominator * s * s;\n          if (distanceSquared <= perpendicularDistanceSquared) {\n            // force accept of point i1+1 .\n            data.moveIndexToIndex(i1 + 1, ++lastAcceptedIndex);\n            i1 = i1 + 1;\n            continue;\n          }\n        }\n      }\n      data.moveIndexToIndex(i1, ++lastAcceptedIndex);\n    }\n    if (i1 < n)\n      data.moveIndexToIndex(i1, ++lastAcceptedIndex);\n    data.length = lastAcceptedIndex + 1;\n  }\n  /**\n   * IF the first and last points are close AND first and last segments are colinear, remove first and last points.  Prior second to last becomes replicated start and end.\n   * * Expected to be called \"last\" after other compressions, so points \"next to\" shared first and last are good to keep.\n   * @param points\n   * @param perpendicularDistance\n   */\n  public static compressColinearWrapInPlace(points: Point3d[], duplicatePointTolerance: number, colinearPointTolerance: number) {\n    const lastIndex = points.length - 1;\n    if (lastIndex >= 3 && points[0].distance(points[lastIndex]) < duplicatePointTolerance) {\n      // indices of 3 points potentially colinear.\n      const indexA = lastIndex - 1;\n      const indexB = 0;\n      const indexC = 1;\n      const vectorU = Vector3d.createStartEnd(points[indexA], points[indexC]);\n      const vectorV = Vector3d.createStartEnd(points[indexA], points[indexB]);\n      const uDotU = vectorU.dotProduct(vectorU);\n      const uDotV = vectorU.dotProduct(vectorV);\n      const fraction = Geometry.conditionalDivideFraction(uDotV, uDotU);\n      if (fraction !== undefined && fraction > 0.0 && fraction < 1.0) {\n        const h2 = vectorV.magnitudeSquared() - fraction * fraction * uDotU;\n        if (Math.sqrt(Math.abs(h2)) < colinearPointTolerance) {\n          points[0] = points[indexA];\n          points.pop();\n        }\n      }\n    }\n  }\n}\n"]}
+{"version":3,"file":"PolylineCompressionByEdgeOffset.js","sourceRoot":"","sources":["../../../src/geometry3d/PolylineCompressionByEdgeOffset.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAGvC,OAAO,EAAE,mBAAmB,EAAE,MAAM,uBAAuB,CAAC;AAC5D,OAAO,EAAW,QAAQ,EAAE,MAAM,mBAAmB,CAAC;AAEtD,sBAAsB;AACtB;;GAEG;AACH,MAAM,OAAO,0BAA0B;IACrC;;OAEG;IACH,YAAoB,MAA4B,EAAE,IAAmC,EAAE,SAAiB;QACtG,IAAI,CAAC,iBAAiB,GAAG,SAAS,GAAG,SAAS,CAAC;QAC/C,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;QACtB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;IACpB,CAAC;IAOD;;OAEG;IACK,kBAAkB,CAAC,CAAS;QAClC,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,6BAA6B,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;QACtF,IAAI,KAAK;YACP,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC3B,CAAC;IACD,2CAA2C;aAC5B,cAAS,GAAa,QAAQ,CAAC,MAAM,EAAE,CAAC;aACxC,aAAQ,GAAa,QAAQ,CAAC,MAAM,EAAE,CAAC;IACtD;;;;;OAKG;IACK,sBAAsB,CAAC,MAAc,EAAE,MAAc;QAC3D,IAAI,IAAI,GAAG,GAAG,CAAC;QACf,IAAI,CAAC,CAAC;QACN,IAAI,QAA4B,CAAC;QACjC,KAAK,IAAI,KAAK,GAAG,MAAM,EAAE,KAAK,IAAI,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC;YAClD,MAAM,EAAE,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;YAC3C,MAAM,EAAE,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;YAC/C,MAAM,EAAE,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;YAC/C,IAAI,CAAC,OAAO,CAAC,2BAA2B,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,0BAA0B,CAAC,QAAQ,CAAC,CAAC;YAC1F,CAAC,GAAG,0BAA0B,CAAC,QAAQ,CAAC,gBAAgB,EAAE,CAAC;YAC3D,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC;gBACb,IAAI,GAAG,CAAC,CAAC;gBACT,QAAQ,GAAG,KAAK,CAAC;YACnB,CAAC;QACH,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;IAED;;;;OAIG;IACK,mBAAmB,CAAC,MAAc,EAAE,MAAc;QACxD,MAAM,EAAE,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QAC5C,MAAM,EAAE,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;QAC5C,IAAI,YAAY,GAAG,IAAI,CAAC,iBAAiB,CAAC;QAC1C,IAAI,iBAAiB,CAAC;QACtB,IAAI,SAAS,CAAC;QACd,IAAI,eAAe,CAAC;QACpB,IAAI,CAAC,CAAC;QACN,IAAI,CAAC,CAAC;QACN,IAAI,CAAC,OAAO,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,EAAE,0BAA0B,CAAC,SAAS,CAAE,CAAC;QAC7E,MAAM,WAAW,GAAG,0BAA0B,CAAC,SAAS,CAAC,gBAAgB,EAAE,CAAC;QAC5E,KAAK,IAAI,KAAK,GAAG,MAAM,GAAG,CAAC,EAAE,KAAK,GAAG,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC;YACrD,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;YACpC,IAAI,CAAC,OAAO,CAAC,gBAAgB,CAAC,EAAE,EAAE,CAAC,EAAE,0BAA0B,CAAC,QAAQ,CAAC,CAAC;YAC1E,SAAS,GAAG,0BAA0B,CAAC,SAAS,CAAC,UAAU,CAAC,0BAA0B,CAAC,QAAQ,CAAC,CAAC;YACjG,IAAI,SAAS,IAAI,CAAC,EAAE,CAAC;gBACnB,eAAe,GAAG,0BAA0B,CAAC,QAAQ,CAAC,gBAAgB,EAAE,CAAC;YAC3E,CAAC;iBAAM,IAAI,SAAS,GAAG,WAAW,EAAE,CAAC;gBACnC,IAAI,CAAC,OAAO,CAAC,gBAAgB,CAAC,EAAE,EAAE,CAAC,EAAE,0BAA0B,CAAC,QAAQ,CAAC,CAAC;gBAC1E,eAAe,GAAG,0BAA0B,CAAC,QAAQ,CAAC,gBAAgB,EAAE,CAAC;YAC3E,CAAC;iBAAM,CAAC;gBACN,CAAC,GAAG,SAAS,GAAG,WAAW,CAAC;gBAC5B,eAAe,GAAG,0BAA0B,CAAC,QAAQ,CAAC,gBAAgB,EAAE,GAAG,WAAW,GAAG,CAAC,GAAG,CAAC,CAAC;YACjG,CAAC;YACD,IAAI,eAAe,GAAG,YAAY,EAAE,CAAC;gBACnC,YAAY,GAAG,eAAe,CAAC;gBAC/B,iBAAiB,GAAG,KAAK,CAAC;YAC5B,CAAC;QACH,CAAC;QACD,OAAO,iBAAiB,CAAC;IAC3B,CAAC;IACD;;;;;;OAMG;IACH,oCAAoC;IACpC,iBAAiB;IACT,+BAA+B,CAAC,EAAU,EAAE,EAAU;QAC5D,IAAI,EAAE,KAAK,EAAE,GAAG,CAAC,EAAE,CAAC;YAClB,IAAI,CAAC,kBAAkB,CAAC,EAAE,CAAC,CAAC;YAC5B,OAAO;QACT,CAAC;QACD,MAAM,iBAAiB,GAAG,IAAI,CAAC,mBAAmB,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC3D,IAAI,iBAAiB,KAAK,SAAS,EAAE,CAAC;YACpC,IAAI,CAAC,kBAAkB,CAAC,EAAE,CAAC,CAAC,CAAC,oCAAoC;QACnE,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,+BAA+B,CAAC,EAAE,EAAE,iBAAiB,CAAC,CAAC;YAC5D,IAAI,CAAC,+BAA+B,CAAC,iBAAiB,EAAE,EAAE,CAAC,CAAC;QAC9D,CAAC;IACH,CAAC;IACD,sBAAsB;IACtB;;;;;OAKG;IACI,MAAM,CAAC,gCAAgC,CAAC,MAAiB,EAAE,cAAsB;QACtF,MAAM,OAAO,GAAG,IAAI,mBAAmB,CAAC,MAAM,CAAC,CAAC;QAChD,MAAM,KAAK,GAAG,IAAI,mBAAmB,CAAC,EAAE,CAAC,CAAC;QAC1C,IAAI,CAAC,8BAA8B,CAAC,OAAO,EAAE,KAAK,EAAE,cAAc,CAAC,CAAC;QACpE,OAAO,KAAK,CAAC,IAAI,CAAC;IACpB,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,8BAA8B,CAAC,MAA4B,EAAE,IAAmC,EAAE,cAAsB;QACpI,IAAI,CAAC,KAAK,EAAE,CAAC;QACb,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;QACxB,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACZ,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,6BAA6B,CAAC,CAAC,CAAE,CAAC,CAAC;YACpD,OAAO;QACT,CAAC;QACD,MAAM,OAAO,GAAG,IAAI,0BAA0B,CAAC,MAAM,EAAE,IAAI,EAAE,cAAc,CAAC,CAAC;QAC7E,4GAA4G;QAC5G,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,IAAI,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC;QACnB,IAAI,CAAC,GAAG,CAAC,IAAI,MAAM,CAAC,kBAAkB,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAE,IAAI,cAAc,EAAE,CAAC;YACpE,8FAA8F;YAC9F,sEAAsE;YACtE,MAAM,oBAAoB,GAAG,OAAO,CAAC,sBAAsB,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;YACtE,IAAI,oBAAoB,KAAK,SAAS,EAAE,CAAC;gBACvC,MAAM,GAAG,oBAAoB,GAAG,CAAC,CAAC;gBAClC,MAAM,GAAG,MAAM,GAAG,CAAC,CAAC;YACtB,CAAC;QACH,CAAC;QACD,OAAO,CAAC,kBAAkB,CAAC,MAAM,CAAC,CAAC;QACnC,OAAO,CAAC,+BAA+B,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC1D,CAAC;IACD;;OAEG;IACI,MAAM,CAAC,gCAAgC,CAAC,IAAsB,EAAE,UAAkB;QACvF,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QACtB,IAAI,CAAC,GAAG,CAAC;YACP,OAAO;QACT,IAAI,iBAAiB,GAAG,CAAC,CAAC;QAC1B,8BAA8B;QAC9B,IAAI,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC;QACnB,OAAO,MAAM,GAAG,CAAC,IAAI,IAAI,CAAC,kBAAkB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAE,GAAG,UAAU;YAC3E,MAAM,EAAE,CAAC;QACX,IAAI,MAAM,KAAK,CAAC,EAAE,CAAC;YACjB,+BAA+B;YAC/B,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;YAChB,OAAO;QACT,CAAC;QACD,0EAA0E;QAC1E,IAAI,MAAM,GAAG,CAAC,GAAG,CAAC;YAChB,IAAI,CAAC,gBAAgB,CAAC,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,CAAC;QACvC,IAAI,cAAc,GAAG,iBAAiB,GAAG,CAAC,CAAC;QAC3C,OAAO,cAAc,IAAI,MAAM,EAAE,CAAC;YAChC,MAAM,CAAC,GAAG,IAAI,CAAC,kBAAkB,CAAC,iBAAiB,EAAE,cAAc,CAAE,CAAC;YACtE,IAAI,CAAC,IAAI,UAAU,EAAE,CAAC;gBACpB,IAAI,CAAC,gBAAgB,CAAC,cAAc,EAAE,iBAAiB,GAAG,CAAC,CAAC,CAAC;gBAC7D,iBAAiB,EAAE,CAAC;YACtB,CAAC;YACD,cAAc,EAAE,CAAC;QACnB,CAAC;QACD,IAAI,CAAC,MAAM,GAAG,iBAAiB,GAAG,CAAC,CAAC;IACtC,CAAC;IAED;;OAEG;IACI,MAAM,CAAC,kCAAkC,CAAC,IAAsB,EAAE,YAAoB;QAC3F,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QACtB,IAAI,CAAC,GAAG,CAAC;YACP,OAAO;QACT,IAAI,iBAAiB,GAAG,CAAC,CAAC;QAC1B,MAAM,KAAK,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC;QAChC,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC;YAClC,IAAI,CAAC,2BAA2B,CAAC,iBAAiB,EAAE,EAAE,EAAE,EAAE,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC;YACvE,IAAI,GAAG,GAAG,KAAK,CAAC,SAAS,EAAE,GAAG,YAAY,EAAE,CAAC;gBAC3C,IAAI,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,iBAAiB,CAAC,CAAC;YACjD,CAAC;QACH,CAAC;QACD,IAAI,CAAC,gBAAgB,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,iBAAiB,CAAC,CAAC;QAClD,IAAI,CAAC,MAAM,GAAG,iBAAiB,GAAG,CAAC,CAAC;IACtC,CAAC;IAED;;OAEG;IACI,MAAM,CAAC,sCAAsC,CAAC,IAAsB,EAAE,qBAA6B,EAAE,oBAAoB,GAAG,MAAM;QACvI,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QACtB,IAAI,CAAC,GAAG,CAAC;YACP,OAAO;QACT,IAAI,iBAAiB,GAAG,CAAC,CAAC;QAC1B,MAAM,QAAQ,GAAG,0BAA0B,CAAC,SAAS,CAAC;QACtD,MAAM,OAAO,GAAG,0BAA0B,CAAC,QAAQ,CAAC;QACpD,IAAI,eAAe,CAAC;QACpB,MAAM,4BAA4B,GAAG,qBAAqB,GAAG,qBAAqB,CAAC;QACnF,IAAI,WAAW,CAAC;QAChB,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,OAAO,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC;YACxB,IAAI,CAAC,gBAAgB,CAAC,iBAAiB,EAAE,EAAE,GAAG,CAAC,EAAE,QAAQ,CAAC,CAAC;YAC3D,IAAI,CAAC,gBAAgB,CAAC,iBAAiB,EAAE,EAAE,EAAE,OAAO,CAAC,CAAC;YACtD,WAAW,GAAG,QAAQ,CAAC,gBAAgB,EAAE,CAAC;YAC1C,MAAM,CAAC,GAAG,QAAQ,CAAC,yBAAyB,CAAC,OAAO,CAAC,UAAU,CAAC,QAAQ,CAAC,EAAE,WAAW,CAAC,CAAC;YACxF,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;gBACpB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,oBAAoB,EAAE,CAAC;oBAC1C,eAAe,GAAG,0BAA0B,CAAC,QAAQ,CAAC,gBAAgB,EAAE,GAAG,WAAW,GAAG,CAAC,GAAG,CAAC,CAAC;oBAC/F,IAAI,eAAe,IAAI,4BAA4B,EAAE,CAAC;wBACpD,+BAA+B;wBAC/B,IAAI,CAAC,gBAAgB,CAAC,EAAE,GAAG,CAAC,EAAE,EAAE,iBAAiB,CAAC,CAAC;wBACnD,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;wBACZ,SAAS;oBACX,CAAC;gBACH,CAAC;YACH,CAAC;YACD,IAAI,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,iBAAiB,CAAC,CAAC;QACjD,CAAC;QACD,IAAI,EAAE,GAAG,CAAC;YACR,IAAI,CAAC,gBAAgB,CAAC,EAAE,EAAE,EAAE,iBAAiB,CAAC,CAAC;QACjD,IAAI,CAAC,MAAM,GAAG,iBAAiB,GAAG,CAAC,CAAC;IACtC,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,2BAA2B,CAAC,MAAiB,EAAE,uBAA+B,EAAE,sBAA8B;QAC1H,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;QACpC,IAAI,SAAS,IAAI,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,GAAG,uBAAuB,EAAE,CAAC;YACtF,4CAA4C;YAC5C,MAAM,MAAM,GAAG,SAAS,GAAG,CAAC,CAAC;YAC7B,MAAM,MAAM,GAAG,CAAC,CAAC;YACjB,MAAM,MAAM,GAAG,CAAC,CAAC;YACjB,MAAM,OAAO,GAAG,QAAQ,CAAC,cAAc,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;YACxE,MAAM,OAAO,GAAG,QAAQ,CAAC,cAAc,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;YACxE,MAAM,KAAK,GAAG,OAAO,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YAC1C,MAAM,KAAK,GAAG,OAAO,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YAC1C,MAAM,QAAQ,GAAG,QAAQ,CAAC,yBAAyB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;YAClE,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,GAAG,GAAG,IAAI,QAAQ,GAAG,GAAG,EAAE,CAAC;gBAC/D,MAAM,EAAE,GAAG,OAAO,CAAC,gBAAgB,EAAE,GAAG,QAAQ,GAAG,QAAQ,GAAG,KAAK,CAAC;gBACpE,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,sBAAsB,EAAE,CAAC;oBACrD,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC;oBAC3B,MAAM,CAAC,GAAG,EAAE,CAAC;gBACf,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\nimport { Geometry } from \"../Geometry\";\nimport { GrowableXYZArray } from \"./GrowableXYZArray\";\nimport { IndexedReadWriteXYZCollection, IndexedXYZCollection } from \"./IndexedXYZCollection\";\nimport { Point3dArrayCarrier } from \"./Point3dArrayCarrier\";\nimport { Point3d, Vector3d } from \"./Point3dVector3d\";\n\n// cspell:word Puecker\n/** context class for Puecker-Douglas polyline compression, viz https://en.wikipedia.org/wiki/Ramer–Douglas–Peucker_algorithm\n * @internal\n */\nexport class PolylineCompressionContext {\n  /** Caller provides source and tolerance.\n   * * pointer to source is retained, but contents of source are never modified.\n   */\n  private constructor(source: IndexedXYZCollection, dest: IndexedReadWriteXYZCollection, tolerance: number) {\n    this._toleranceSquared = tolerance * tolerance;\n    this._source = source;\n    this._dest = dest;\n  }\n  private _source: IndexedXYZCollection;\n\n  private _dest: IndexedReadWriteXYZCollection;\n\n  /** Squared tolerance for equal point. */\n  private _toleranceSquared: number;\n  /** push (clone of) the point at index i from the source to the growing result.\n   * * index is adjusted cyclically to source index range by modulo.\n   */\n  private acceptPointByIndex(i: number) {\n    const point = this._source.getPoint3dAtCheckedPointIndex(this._source.cyclicIndex(i));\n    if (point)\n      this._dest.push(point);\n  }\n  /** work data used by find max deviation */\n  private static _vector01: Vector3d = Vector3d.create();\n  private static _vectorQ: Vector3d = Vector3d.create();\n  /**\n   * Return index of max magnitude of cross product of vectors (index to index+1) and (index to index+2)\n   * * Return undefined if unable to find a nonzero cross product.\n   * @param i0 first cross product central index.\n   * @param i1 last cross product central index.\n   */\n  private indexOfMaxCrossProduct(index0: number, index1: number): number | undefined {\n    let qMax = 0.0;\n    let q;\n    let indexMax: number | undefined;\n    for (let index = index0; index <= index1; index++) {\n      const iA = this._source.cyclicIndex(index);\n      const iB = this._source.cyclicIndex(index + 1);\n      const iC = this._source.cyclicIndex(index + 2);\n      this._source.crossProductIndexIndexIndex(iA, iB, iC, PolylineCompressionContext._vectorQ);\n      q = PolylineCompressionContext._vectorQ.magnitudeSquared();\n      if (q > qMax) {\n        qMax = q;\n        indexMax = index;\n      }\n    }\n    return indexMax;\n  }\n\n  /**\n   * Return interior index where max deviation in excess of tolerance occurs.\n   * @param i0 first index of interval\n   * @param i1 INCLUSIVE final index\n   */\n  private indexOfMaxDeviation(index0: number, index1: number): number | undefined {\n    const i0 = this._source.cyclicIndex(index0);\n    const i1 = this._source.cyclicIndex(index1);\n    let maxDeviation = this._toleranceSquared;\n    let maxDeviationIndex;\n    let numerator;\n    let distanceSquared;\n    let s;\n    let i;\n    this._source.vectorIndexIndex(i0, i1, PolylineCompressionContext._vector01)!;\n    const denominator = PolylineCompressionContext._vector01.magnitudeSquared();\n    for (let index = index0 + 1; index < index1; index++) {\n      i = this._source.cyclicIndex(index);\n      this._source.vectorIndexIndex(i0, i, PolylineCompressionContext._vectorQ);\n      numerator = PolylineCompressionContext._vector01.dotProduct(PolylineCompressionContext._vectorQ);\n      if (numerator <= 0) {\n        distanceSquared = PolylineCompressionContext._vectorQ.magnitudeSquared();\n      } else if (numerator > denominator) {\n        this._source.vectorIndexIndex(i1, i, PolylineCompressionContext._vectorQ);\n        distanceSquared = PolylineCompressionContext._vectorQ.magnitudeSquared();\n      } else {\n        s = numerator / denominator;\n        distanceSquared = PolylineCompressionContext._vectorQ.magnitudeSquared() - denominator * s * s;\n      }\n      if (distanceSquared > maxDeviation) {\n        maxDeviation = distanceSquared;\n        maxDeviationIndex = index;\n      }\n    }\n    return maxDeviationIndex;\n  }\n  /**\n   *\n   * @param i0 first active point index\n   * @param i1 last active point index (INCLUSIVE -- not \"one beyond\")\n   * @param chordTolerance\n   * @param result\n   */\n  // ASSUME index i0 is already saved.\n  // ASSUME point i\n  private recursiveCompressByChordErrorGo(i0: number, i1: number) {\n    if (i1 === i0 + 1) {\n      this.acceptPointByIndex(i1);\n      return;\n    }\n    const distantPointIndex = this.indexOfMaxDeviation(i0, i1);\n    if (distantPointIndex === undefined) {\n      this.acceptPointByIndex(i1); // which compresses out some points.\n    } else {\n      this.recursiveCompressByChordErrorGo(i0, distantPointIndex);\n      this.recursiveCompressByChordErrorGo(distantPointIndex, i1);\n    }\n  }\n  // cspell:word Peucker\n  /**\n   * Return a point array with a subset of the input points.\n   * * This is a global analysis (Douglas-Peucker)\n   * @param source input points.\n   * @param chordTolerance Points less than this distance from a retained edge may be ignored.\n   */\n  public static compressPoint3dArrayByChordError(source: Point3d[], chordTolerance: number): Point3d[] {\n    const source1 = new Point3dArrayCarrier(source);\n    const dest1 = new Point3dArrayCarrier([]);\n    this.compressCollectionByChordError(source1, dest1, chordTolerance);\n    return dest1.data;\n  }\n  /**\n   * * Return a polyline with a subset of the input points.\n   * * This is a global analysis (Douglas-Peucker)\n   * * Global search for vertices that are close to edges between widely separated neighbors.\n   * * Recurses to smaller subsets.\n   * @param source input points\n   * @param dest output points.  Must be different from source.\n   * @param chordTolerance Points less than this distance from a retained edge may be ignored.\n   */\n  public static compressCollectionByChordError(source: IndexedXYZCollection, dest: IndexedReadWriteXYZCollection, chordTolerance: number) {\n    dest.clear();\n    const n = source.length;\n    if (n === 1) {\n      dest.push(source.getPoint3dAtCheckedPointIndex(0)!);\n      return;\n    }\n    const context = new PolylineCompressionContext(source, dest, chordTolerance);\n    // Do compression on inclusive interval from indexA to indexB, with indices interpreted cyclically if closed\n    let indexA = 0;\n    let indexB = n - 1;\n    if (n > 2 && source.distanceIndexIndex(0, n - 1)! <= chordTolerance) {\n      // cyclic data. It is possible that the wrap point itself has to be seen as an internal point.\n      // do the search from point index where there is a large triangle . ..\n      const maxCrossProductIndex = context.indexOfMaxCrossProduct(0, n - 1);\n      if (maxCrossProductIndex !== undefined) {\n        indexA = maxCrossProductIndex + 1;\n        indexB = indexA + n;\n      }\n    }\n    context.acceptPointByIndex(indexA);\n    context.recursiveCompressByChordErrorGo(indexA, indexB);\n  }\n  /** Copy points from source to dest, omitting those too close to predecessor.\n   * * First and last points are always preserved.\n   */\n  public static compressInPlaceByShortEdgeLength(data: GrowableXYZArray, edgeLength: number) {\n    const n = data.length;\n    if (n < 2)\n      return;\n    let lastAcceptedIndex = 0;\n    // back up from final point ..\n    let indexB = n - 1;\n    while (indexB > 0 && data.distanceIndexIndex(indexB - 1, n - 1)! < edgeLength)\n      indexB--;\n    if (indexB === 0) {\n      // Theres only one point there.\n      data.length = 1;\n      return;\n    }\n    // we want the exact bits of the final point even if others were nearby ..\n    if (indexB < n - 1)\n      data.moveIndexToIndex(n - 1, indexB);\n    let candidateIndex = lastAcceptedIndex + 1;\n    while (candidateIndex <= indexB) {\n      const d = data.distanceIndexIndex(lastAcceptedIndex, candidateIndex)!;\n      if (d >= edgeLength) {\n        data.moveIndexToIndex(candidateIndex, lastAcceptedIndex + 1);\n        lastAcceptedIndex++;\n      }\n      candidateIndex++;\n    }\n    data.length = lastAcceptedIndex + 1;\n  }\n\n  /** Copy points from source to dest, omitting those too close to predecessor.\n   * * First and last points are always preserved.\n   */\n  public static compressInPlaceBySmallTriangleArea(data: GrowableXYZArray, triangleArea: number) {\n    const n = data.length;\n    if (n < 3)\n      return;\n    let lastAcceptedIndex = 0;\n    const cross = Vector3d.create();\n    for (let i1 = 1; i1 + 1 < n; i1++) {\n      data.crossProductIndexIndexIndex(lastAcceptedIndex, i1, i1 + 1, cross);\n      if (0.5 * cross.magnitude() > triangleArea) {\n        data.moveIndexToIndex(i1, ++lastAcceptedIndex);\n      }\n    }\n    data.moveIndexToIndex(n - 1, ++lastAcceptedIndex);\n    data.length = lastAcceptedIndex + 1;\n  }\n\n  /** Copy points from source to dest, omitting those too close to edge between neighbors.\n   * * First and last points are always preserved.\n   */\n  public static compressInPlaceByPerpendicularDistance(data: GrowableXYZArray, perpendicularDistance: number, maxExtensionFraction = 1.0001) {\n    const n = data.length;\n    if (n < 3)\n      return;\n    let lastAcceptedIndex = 0;\n    const vector01 = PolylineCompressionContext._vector01;\n    const vectorQ = PolylineCompressionContext._vectorQ;\n    let distanceSquared;\n    const perpendicularDistanceSquared = perpendicularDistance * perpendicularDistance;\n    let denominator;\n    let i1 = 1;\n    for (; i1 + 1 < n; i1++) {\n      data.vectorIndexIndex(lastAcceptedIndex, i1 + 1, vector01);\n      data.vectorIndexIndex(lastAcceptedIndex, i1, vectorQ);\n      denominator = vector01.magnitudeSquared();\n      const s = Geometry.conditionalDivideFraction(vectorQ.dotProduct(vector01), denominator);\n      if (s !== undefined) {\n        if (s >= 0.0 && s <= maxExtensionFraction) {\n          distanceSquared = PolylineCompressionContext._vectorQ.magnitudeSquared() - denominator * s * s;\n          if (distanceSquared <= perpendicularDistanceSquared) {\n            // force accept of point i1+1 .\n            data.moveIndexToIndex(i1 + 1, ++lastAcceptedIndex);\n            i1 = i1 + 1;\n            continue;\n          }\n        }\n      }\n      data.moveIndexToIndex(i1, ++lastAcceptedIndex);\n    }\n    if (i1 < n)\n      data.moveIndexToIndex(i1, ++lastAcceptedIndex);\n    data.length = lastAcceptedIndex + 1;\n  }\n  /**\n   * IF the first and last points are close AND first and last segments are colinear, remove first and last points.  Prior second to last becomes replicated start and end.\n   * * Expected to be called \"last\" after other compressions, so points \"next to\" shared first and last are good to keep.\n   * @param points\n   * @param perpendicularDistance\n   */\n  public static compressColinearWrapInPlace(points: Point3d[], duplicatePointTolerance: number, colinearPointTolerance: number) {\n    const lastIndex = points.length - 1;\n    if (lastIndex >= 3 && points[0].distance(points[lastIndex]) < duplicatePointTolerance) {\n      // indices of 3 points potentially colinear.\n      const indexA = lastIndex - 1;\n      const indexB = 0;\n      const indexC = 1;\n      const vectorU = Vector3d.createStartEnd(points[indexA], points[indexC]);\n      const vectorV = Vector3d.createStartEnd(points[indexA], points[indexB]);\n      const uDotU = vectorU.dotProduct(vectorU);\n      const uDotV = vectorU.dotProduct(vectorV);\n      const fraction = Geometry.conditionalDivideFraction(uDotV, uDotU);\n      if (fraction !== undefined && fraction > 0.0 && fraction < 1.0) {\n        const h2 = vectorV.magnitudeSquared() - fraction * fraction * uDotU;\n        if (Math.sqrt(Math.abs(h2)) < colinearPointTolerance) {\n          points[0] = points[indexA];\n          points.pop();\n        }\n      }\n    }\n  }\n}\n"]}

package/lib/esm/geometry3d/Range.js

@@ -18,6 +18,10 @@ import { Transform } from "./Transform";
  * @public
  */
 export class RangeBase {
+    /** Number considered impossibly large possibly for a coordinate in a range. */
+    static { this._EXTREME_POSITIVE = 1.0e200; }
+    /** Number considered to be impossibly negative for a coordinate in a range. */
+    static { this._EXTREME_NEGATIVE = -1.0e200; }
     /** Return 0 if high<= low, otherwise `1/(high-low)` for use in fractionalizing */
     static npcScaleFactor(low, high) {
         return (high <= low) ? 0.0 : 1.0 / (high - low);
@@ -80,10 +84,6 @@ export class RangeBase {
         return q > 0 ? factor * q : defaultValue;
     }
 }
-/** Number considered impossibly large possibly for a coordinate in a range. */
-RangeBase._EXTREME_POSITIVE = 1.0e200;
-/** Number considered to be impossibly negative for a coordinate in a range. */
-RangeBase._EXTREME_NEGATIVE = -1.0e200;
 /**
  * Axis aligned range in 3D.
  * * member `low` contains minimum coordinate of range box