@itwin/core-geometry 5.2.0-dev.8 → 5.3.0-dev.1

package/lib/cjs/geometry3d/PolylineCompressionByEdgeOffset.d.ts

@@ -46,8 +46,11 @@ export declare class PolylineCompressionContext {
      * * This is a global analysis (Douglas-Peucker)
      * @param source input points.
      * @param chordTolerance Points less than this distance from a retained edge may be ignored.
+     * Default is [[Geometry.smallMetricDistance]].
+     * @param keepSeam whether to preserve the endpoints of physically closed input.
+     * Default is false, meaning the input points are treated cyclically, allowing removal of the seam.
      */
-    static compressPoint3dArrayByChordError(source: Point3d[], chordTolerance: number): Point3d[];
+    static compressPoint3dArrayByChordError(source: Point3d[], chordTolerance?: number, keepSeam?: boolean): Point3d[];
     /**
      * * Return a polyline with a subset of the input points.
      * * This is a global analysis (Douglas-Peucker)
@@ -56,8 +59,11 @@ export declare class PolylineCompressionContext {
      * @param source input points
      * @param dest output points.  Must be different from source.
      * @param chordTolerance Points less than this distance from a retained edge may be ignored.
+     * Default is [[Geometry.smallMetricDistance]].
+     * @param keepSeam whether to preserve the endpoints of physically closed input.
+     * Default is false, meaning the input points are treated cyclically, allowing removal of the seam.
      */
-    static compressCollectionByChordError(source: IndexedXYZCollection, dest: IndexedReadWriteXYZCollection, chordTolerance: number): void;
+    static compressCollectionByChordError(source: IndexedXYZCollection, dest: IndexedReadWriteXYZCollection, chordTolerance?: number, keepSeam?: boolean): void;
     /**
      * Return a simplified subset of given points, omitting a point if very close to its predecessor.
      * * This is a local search, with a single pass over the data.

package/lib/cjs/geometry3d/PolylineCompressionByEdgeOffset.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"PolylineCompressionByEdgeOffset.d.ts","sourceRoot":"","sources":["../../../src/geometry3d/PolylineCompressionByEdgeOffset.ts"],"names":[],"mappings":"AAKA,OAAO,EAAE,gBAAgB,EAAE,MAAM,oBAAoB,CAAC;AACtD,OAAO,EAAE,6BAA6B,EAAE,oBAAoB,EAAE,MAAM,wBAAwB,CAAC;AAE7F,OAAO,EAAE,OAAO,EAAY,MAAM,mBAAmB,CAAC;AAGtD;;GAEG;AACH,qBAAa,0BAA0B;IACrC;;OAEG;IACH,OAAO;IAKP,OAAO,CAAC,OAAO,CAAuB;IAEtC,OAAO,CAAC,KAAK,CAAgC;IAE7C,yCAAyC;IACzC,OAAO,CAAC,iBAAiB,CAAS;IAClC;;OAEG;IACH,OAAO,CAAC,kBAAkB;IAK1B,2CAA2C;IAC3C,OAAO,CAAC,MAAM,CAAC,SAAS,CAA+B;IACvD,OAAO,CAAC,MAAM,CAAC,QAAQ,CAA+B;IACtD;;;;;OAKG;IACH,OAAO,CAAC,sBAAsB;IAkB9B;;;;OAIG;IACH,OAAO,CAAC,mBAAmB;IA+B3B;;;;;;OAMG;IAGH,OAAO,CAAC,+BAA+B;IAcvC;;;;;OAKG;WACW,gCAAgC,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,cAAc,EAAE,MAAM,GAAG,OAAO,EAAE;IAMpG;;;;;;;;OAQG;WACW,8BAA8B,CAAC,MAAM,EAAE,oBAAoB,EAAE,IAAI,EAAE,6BAA6B,EAAE,cAAc,EAAE,MAAM;IAuBtI;;;;;;OAMG;WACW,gCAAgC,CAAC,IAAI,EAAE,gBAAgB,EAAE,aAAa,EAAE,MAAM;IA6B5F;;;;;OAKG;WACW,kCAAkC,CAAC,IAAI,EAAE,gBAAgB,EAAE,eAAe,EAAE,MAAM;IAgBhG;;OAEG;WACW,sCAAsC,CAAC,IAAI,EAAE,gBAAgB,EAAE,qBAAqB,EAAE,MAAM,EAAE,oBAAoB,SAAS;IAiCzI;;;;;OAKG;WACW,2BAA2B,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,uBAAuB,EAAE,MAAM,EAAE,sBAAsB,EAAE,MAAM;CAqB7H"}
+{"version":3,"file":"PolylineCompressionByEdgeOffset.d.ts","sourceRoot":"","sources":["../../../src/geometry3d/PolylineCompressionByEdgeOffset.ts"],"names":[],"mappings":"AAKA,OAAO,EAAE,gBAAgB,EAAE,MAAM,oBAAoB,CAAC;AACtD,OAAO,EAAE,6BAA6B,EAAE,oBAAoB,EAAE,MAAM,wBAAwB,CAAC;AAE7F,OAAO,EAAE,OAAO,EAAY,MAAM,mBAAmB,CAAC;AAGtD;;GAEG;AACH,qBAAa,0BAA0B;IACrC;;OAEG;IACH,OAAO;IAKP,OAAO,CAAC,OAAO,CAAuB;IAEtC,OAAO,CAAC,KAAK,CAAgC;IAE7C,yCAAyC;IACzC,OAAO,CAAC,iBAAiB,CAAS;IAClC;;OAEG;IACH,OAAO,CAAC,kBAAkB;IAK1B,2CAA2C;IAC3C,OAAO,CAAC,MAAM,CAAC,SAAS,CAA+B;IACvD,OAAO,CAAC,MAAM,CAAC,QAAQ,CAA+B;IACtD;;;;;OAKG;IACH,OAAO,CAAC,sBAAsB;IAkB9B;;;;OAIG;IACH,OAAO,CAAC,mBAAmB;IA+B3B;;;;;;OAMG;IAGH,OAAO,CAAC,+BAA+B;IAcvC;;;;;;;;OAQG;WACW,gCAAgC,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,cAAc,GAAE,MAAqC,EAAE,QAAQ,GAAE,OAAe,GAAG,OAAO,EAAE;IAM9J;;;;;;;;;;;OAWG;WACW,8BAA8B,CAAC,MAAM,EAAE,oBAAoB,EAAE,IAAI,EAAE,6BAA6B,EAAE,cAAc,GAAE,MAAqC,EAAE,QAAQ,GAAE,OAAe;IAuBhM;;;;;;OAMG;WACW,gCAAgC,CAAC,IAAI,EAAE,gBAAgB,EAAE,aAAa,EAAE,MAAM;IA6B5F;;;;;OAKG;WACW,kCAAkC,CAAC,IAAI,EAAE,gBAAgB,EAAE,eAAe,EAAE,MAAM;IAgBhG;;OAEG;WACW,sCAAsC,CAAC,IAAI,EAAE,gBAAgB,EAAE,qBAAqB,EAAE,MAAM,EAAE,oBAAoB,SAAS;IAiCzI;;;;;OAKG;WACW,2BAA2B,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,uBAAuB,EAAE,MAAM,EAAE,sBAAsB,EAAE,MAAM;CAqB7H"}

package/lib/cjs/geometry3d/PolylineCompressionByEdgeOffset.js

@@ -126,11 +126,14 @@ class PolylineCompressionContext {
      * * This is a global analysis (Douglas-Peucker)
      * @param source input points.
      * @param chordTolerance Points less than this distance from a retained edge may be ignored.
+     * Default is [[Geometry.smallMetricDistance]].
+     * @param keepSeam whether to preserve the endpoints of physically closed input.
+     * Default is false, meaning the input points are treated cyclically, allowing removal of the seam.
      */
-    static compressPoint3dArrayByChordError(source, chordTolerance) {
+    static compressPoint3dArrayByChordError(source, chordTolerance = Geometry_1.Geometry.smallMetricDistance, keepSeam = false) {
         const source1 = new Point3dArrayCarrier_1.Point3dArrayCarrier(source);
         const dest1 = new Point3dArrayCarrier_1.Point3dArrayCarrier([]);
-        this.compressCollectionByChordError(source1, dest1, chordTolerance);
+        this.compressCollectionByChordError(source1, dest1, chordTolerance, keepSeam);
         return dest1.data;
     }
     /**
@@ -141,8 +144,11 @@ class PolylineCompressionContext {
      * @param source input points
      * @param dest output points.  Must be different from source.
      * @param chordTolerance Points less than this distance from a retained edge may be ignored.
+     * Default is [[Geometry.smallMetricDistance]].
+     * @param keepSeam whether to preserve the endpoints of physically closed input.
+     * Default is false, meaning the input points are treated cyclically, allowing removal of the seam.
      */
-    static compressCollectionByChordError(source, dest, chordTolerance) {
+    static compressCollectionByChordError(source, dest, chordTolerance = Geometry_1.Geometry.smallMetricDistance, keepSeam = false) {
         dest.clear();
         const n = source.length;
         if (n === 1) {
@@ -153,7 +159,7 @@ class PolylineCompressionContext {
         // Do compression on inclusive interval from indexA to indexB, with indices interpreted cyclically if closed
         let indexA = 0;
         let indexB = n - 1;
-        if (n > 2 && source.distanceIndexIndex(0, n - 1) <= chordTolerance) {
+        if (n > 2 && !keepSeam && source.distanceIndexIndex(0, n - 1) <= chordTolerance) {
             // cyclic data. It is possible that the wrap point itself has to be seen as an internal point.
             // do the search from point index where there is a large triangle . ..
             const maxCrossProductIndex = context.indexOfMaxCrossProduct(0, n - 1);

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

@@ -1 +1 @@
-{"version":3,"file":"PolylineCompressionByEdgeOffset.js","sourceRoot":"","sources":["../../../src/geometry3d/PolylineCompressionByEdgeOffset.ts"],"names":[],"mappings":";;;AAAA;;;+FAG+F;AAC/F,0CAAuC;AAGvC,+DAA4D;AAC5D,uDAAsD;AAEtD,sBAAsB;AACtB;;GAEG;AACH,MAAa,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;IACO,OAAO,CAAuB;IAE9B,KAAK,CAAgC;IAE7C,yCAAyC;IACjC,iBAAiB,CAAS;IAClC;;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;IACnC,MAAM,CAAC,SAAS,GAAa,0BAAQ,CAAC,MAAM,EAAE,CAAC;IAC/C,MAAM,CAAC,QAAQ,GAAa,0BAAQ,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,yCAAmB,CAAC,MAAM,CAAC,CAAC;QAChD,MAAM,KAAK,GAAG,IAAI,yCAAmB,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;;;;;;OAMG;IACI,MAAM,CAAC,gCAAgC,CAAC,IAAsB,EAAE,aAAqB;QAC1F,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,IAAI,aAAa;YAC/E,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,GAAG,aAAa,EAAE,CAAC;gBACtB,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;;;;;OAKG;IACI,MAAM,CAAC,kCAAkC,CAAC,IAAsB,EAAE,eAAuB;QAC9F,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QACtB,IAAI,CAAC,GAAG,CAAC;YACP,OAAO;QACT,IAAI,iBAAiB,GAAG,CAAC,CAAC;QAC1B,MAAM,KAAK,GAAG,0BAAQ,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,eAAe,EAAE,CAAC;gBAC9C,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,mBAAQ,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,0BAAQ,CAAC,cAAc,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;YACxE,MAAM,OAAO,GAAG,0BAAQ,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,mBAAQ,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;;AAjRH,gEAkRC","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  /**\n   * Return a simplified subset of given points, omitting a point if very close to its predecessor.\n   * * This is a local search, with a single pass over the data.\n   * * First and last points are always retained.\n   * @param data input points\n   * @param maxEdgeLength length of largest edge to be compressed out\n   */\n  public static compressInPlaceByShortEdgeLength(data: GrowableXYZArray, maxEdgeLength: 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)! <= maxEdgeLength)\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 > maxEdgeLength) {\n        data.moveIndexToIndex(candidateIndex, lastAcceptedIndex + 1);\n        lastAcceptedIndex++;\n      }\n      candidateIndex++;\n    }\n    data.length = lastAcceptedIndex + 1;\n  }\n\n  /**\n   * Return a simplified subset of given points, omitting the middle of three successive points if the triangle they form is small.\n   * * This is a local search, with a single pass over the data.\n   * @param data input points\n   * @param maxTriangleArea area of largest triangle to compress\n   */\n  public static compressInPlaceBySmallTriangleArea(data: GrowableXYZArray, maxTriangleArea: 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() > maxTriangleArea) {\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,0CAAuC;AAGvC,+DAA4D;AAC5D,uDAAsD;AAEtD,sBAAsB;AACtB;;GAEG;AACH,MAAa,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;IACO,OAAO,CAAuB;IAE9B,KAAK,CAAgC;IAE7C,yCAAyC;IACjC,iBAAiB,CAAS;IAClC;;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;IACnC,MAAM,CAAC,SAAS,GAAa,0BAAQ,CAAC,MAAM,EAAE,CAAC;IAC/C,MAAM,CAAC,QAAQ,GAAa,0BAAQ,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;;;;;;;;OAQG;IACI,MAAM,CAAC,gCAAgC,CAAC,MAAiB,EAAE,iBAAyB,mBAAQ,CAAC,mBAAmB,EAAE,WAAoB,KAAK;QAChJ,MAAM,OAAO,GAAG,IAAI,yCAAmB,CAAC,MAAM,CAAC,CAAC;QAChD,MAAM,KAAK,GAAG,IAAI,yCAAmB,CAAC,EAAE,CAAC,CAAC;QAC1C,IAAI,CAAC,8BAA8B,CAAC,OAAO,EAAE,KAAK,EAAE,cAAc,EAAE,QAAQ,CAAC,CAAC;QAC9E,OAAO,KAAK,CAAC,IAAI,CAAC;IACpB,CAAC;IACD;;;;;;;;;;;OAWG;IACI,MAAM,CAAC,8BAA8B,CAAC,MAA4B,EAAE,IAAmC,EAAE,iBAAyB,mBAAQ,CAAC,mBAAmB,EAAE,WAAoB,KAAK;QAC9L,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,CAAC,QAAQ,IAAI,MAAM,CAAC,kBAAkB,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAE,IAAI,cAAc,EAAE,CAAC;YACjF,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;;;;;;OAMG;IACI,MAAM,CAAC,gCAAgC,CAAC,IAAsB,EAAE,aAAqB;QAC1F,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,IAAI,aAAa;YAC/E,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,GAAG,aAAa,EAAE,CAAC;gBACtB,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;;;;;OAKG;IACI,MAAM,CAAC,kCAAkC,CAAC,IAAsB,EAAE,eAAuB;QAC9F,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QACtB,IAAI,CAAC,GAAG,CAAC;YACP,OAAO;QACT,IAAI,iBAAiB,GAAG,CAAC,CAAC;QAC1B,MAAM,KAAK,GAAG,0BAAQ,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,eAAe,EAAE,CAAC;gBAC9C,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,mBAAQ,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,0BAAQ,CAAC,cAAc,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;YACxE,MAAM,OAAO,GAAG,0BAAQ,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,mBAAQ,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;;AAvRH,gEAwRC","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   * Default is [[Geometry.smallMetricDistance]].\n   * @param keepSeam whether to preserve the endpoints of physically closed input.\n   * Default is false, meaning the input points are treated cyclically, allowing removal of the seam.\n   */\n  public static compressPoint3dArrayByChordError(source: Point3d[], chordTolerance: number = Geometry.smallMetricDistance, keepSeam: boolean = false): Point3d[] {\n    const source1 = new Point3dArrayCarrier(source);\n    const dest1 = new Point3dArrayCarrier([]);\n    this.compressCollectionByChordError(source1, dest1, chordTolerance, keepSeam);\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   * Default is [[Geometry.smallMetricDistance]].\n   * @param keepSeam whether to preserve the endpoints of physically closed input.\n   * Default is false, meaning the input points are treated cyclically, allowing removal of the seam.\n   */\n  public static compressCollectionByChordError(source: IndexedXYZCollection, dest: IndexedReadWriteXYZCollection, chordTolerance: number = Geometry.smallMetricDistance, keepSeam: boolean = false) {\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 && !keepSeam && 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  /**\n   * Return a simplified subset of given points, omitting a point if very close to its predecessor.\n   * * This is a local search, with a single pass over the data.\n   * * First and last points are always retained.\n   * @param data input points\n   * @param maxEdgeLength length of largest edge to be compressed out\n   */\n  public static compressInPlaceByShortEdgeLength(data: GrowableXYZArray, maxEdgeLength: 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)! <= maxEdgeLength)\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 > maxEdgeLength) {\n        data.moveIndexToIndex(candidateIndex, lastAcceptedIndex + 1);\n        lastAcceptedIndex++;\n      }\n      candidateIndex++;\n    }\n    data.length = lastAcceptedIndex + 1;\n  }\n\n  /**\n   * Return a simplified subset of given points, omitting the middle of three successive points if the triangle they form is small.\n   * * This is a local search, with a single pass over the data.\n   * @param data input points\n   * @param maxTriangleArea area of largest triangle to compress\n   */\n  public static compressInPlaceBySmallTriangleArea(data: GrowableXYZArray, maxTriangleArea: 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() > maxTriangleArea) {\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/cjs/geometry3d/PolylineOps.d.ts

@@ -21,10 +21,13 @@ export declare class PolylineOps {
      * Return a simplified subset of given points.
      * * Points are removed by the Douglas-Puecker algorithm, viz https://en.wikipedia.org/wiki/Ramer–Douglas–Peucker_algorithm
      * * This is a global search, with multiple passes over the data.
-     * @param source
-     * @param chordTolerance
+     * @param source input points.
+     * @param chordTolerance Points less than this distance from a retained edge may be ignored.
+     * Default is [[Geometry.smallMetricDistance]].
+     * @param keepSeam whether to preserve the endpoints of physically closed input.
+     * Default is false, meaning physically closed input points are treated cyclically, allowing removal of the seam.
      */
-    static compressByChordError(source: Point3d[], chordTolerance: number): Point3d[];
+    static compressByChordError(source: Point3d[], chordTolerance?: number, keepSeam?: boolean): Point3d[];
     /**
      * Return a simplified subset of given points, omitting a point if very close to its predecessor.
      * * This is a local search, with a single pass over the data.
@@ -111,5 +114,13 @@ export declare class PolylineOps {
      * * `childDetail.fraction` is the local segment fraction
      */
     static closestApproach(pointsA: Point3d[] | IndexedXYZCollection, extendA: VariantCurveExtendParameter, pointsB: Point3d[] | IndexedXYZCollection, extendB: VariantCurveExtendParameter, dMax?: number, result?: CurveLocationDetailPair): CurveLocationDetailPair | undefined;
+    /**
+     * Checks if all points are colinear.
+     * * This test does not take point order into account.
+     * @param points array of points to check.
+     * @param distanceTol tolerance for co-linearity check, default is Geometry.smallMetricDistance.
+     * @param xyOnly if true, only XY coordinates are used for the check, ignoring z coordinate.
+     */
+    static isColinear(points: Point3d[], distanceTol?: number, xyOnly?: boolean): boolean;
 }
 //# sourceMappingURL=PolylineOps.d.ts.map

package/lib/cjs/geometry3d/PolylineOps.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"PolylineOps.d.ts","sourceRoot":"","sources":["../../../src/geometry3d/PolylineOps.ts"],"names":[],"mappings":"AAIA;;GAEG;AAEH,OAAO,EAAuC,2BAA2B,EAAE,MAAM,0BAA0B,CAAC;AAC5G,OAAO,EAAE,uBAAuB,EAAE,MAAM,8BAA8B,CAAC;AAKvE,OAAO,EAAE,oBAAoB,EAAE,MAAM,wBAAwB,CAAC;AAC9D,OAAO,EAAE,4BAA4B,EAAE,MAAM,gCAAgC,CAAC;AAE9E,OAAO,EAAE,OAAO,EAAY,MAAM,mBAAmB,CAAC;AAEtD,OAAO,EAAE,OAAO,EAAE,MAAM,SAAS,CAAC;AAGlC;;;GAGG;AACH,qBAAa,WAAW;IACtB;;;OAGG;WACW,eAAe,CAAC,MAAM,EAAE,OAAO,EAAE,GAAG,OAAO;IAOzD;;;;;;OAMG;WACW,oBAAoB,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,cAAc,EAAE,MAAM,GAAG,OAAO,EAAE;IAGxF;;;;;;;OAOG;WACW,kBAAkB,CAAC,MAAM,EAAE,OAAO,EAAE,GAAG,oBAAoB,EAAE,aAAa,EAAE,MAAM,GAAG,OAAO,EAAE;IAK5G;;;;;OAKG;WACW,sBAAsB,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,eAAe,EAAE,MAAM,GAAG,OAAO,EAAE;IAM3F;;;;;;;OAOG;WACW,+BAA+B,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,WAAW,EAAE,MAAM,EAAE,OAAO,GAAE,MAAU,GAAG,OAAO,EAAE;IAYrH,OAAO,CAAC,MAAM,CAAC,kCAAkC;IAOjD;;;;;;;OAOG;IACH,OAAO,CAAC,MAAM,CAAC,sBAAsB;IAiCrC;;;;;SAKK;WACS,gBAAgB,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,MAAM,GAAE,OAAe,EAAE,SAAS,GAAE,MAAqC,GAAG,OAAO,EAAE;IAmCvI;;;OAGG;WACW,eAAe,CAAC,IAAI,EAAE,OAAO,EAAE,GAAG,OAAO,EAAE,EAAE;IAgB3D;;;OAGG;WACW,kBAAkB,CAAC,IAAI,EAAE,OAAO,EAAE,GAAG,OAAO,EAAE,EAAE;IAgB9D;;;;;;;;;;;;OAYG;WACW,qCAAqC,CACjD,UAAU,EAAE,oBAAoB,GAAG,OAAO,EAAE,EAAE,sBAAsB,GAAE,OAAe,GACpF,4BAA4B,EAAE,GAAG,SAAS;IA2C7C,OAAO,CAAC,MAAM,CAAC,aAAa,CAAC,CAAgB;IAC7C,OAAO,CAAC,MAAM,CAAC,aAAa,CAAC,CAAgB;IAC7C,OAAO,CAAC,MAAM,CAAC,oBAAoB,CAAC,CAA0B;IAC9D;;;;;;;;;;;;;;;OAeG;WACW,eAAe,CAC3B,OAAO,EAAE,OAAO,EAAE,GAAG,oBAAoB,EACzC,OAAO,EAAE,2BAA2B,EACpC,OAAO,EAAE,OAAO,EAAE,GAAG,oBAAoB,EACzC,OAAO,EAAE,2BAA2B,EACpC,IAAI,GAAE,MAAyB,EAC/B,MAAM,CAAC,EAAE,uBAAuB,GAC/B,uBAAuB,GAAG,SAAS;CAoDvC"}
+{"version":3,"file":"PolylineOps.d.ts","sourceRoot":"","sources":["../../../src/geometry3d/PolylineOps.ts"],"names":[],"mappings":"AAIA;;GAEG;AAEH,OAAO,EAAuC,2BAA2B,EAAE,MAAM,0BAA0B,CAAC;AAC5G,OAAO,EAAE,uBAAuB,EAAE,MAAM,8BAA8B,CAAC;AAMvE,OAAO,EAAE,oBAAoB,EAAE,MAAM,wBAAwB,CAAC;AAC9D,OAAO,EAAE,4BAA4B,EAAE,MAAM,gCAAgC,CAAC;AAE9E,OAAO,EAAE,OAAO,EAAY,MAAM,mBAAmB,CAAC;AAEtD,OAAO,EAAE,OAAO,EAAE,MAAM,SAAS,CAAC;AAGlC;;;GAGG;AACH,qBAAa,WAAW;IACtB;;;OAGG;WACW,eAAe,CAAC,MAAM,EAAE,OAAO,EAAE,GAAG,OAAO;IAOzD;;;;;;;;;OASG;WACW,oBAAoB,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,cAAc,GAAE,MAAqC,EAAE,QAAQ,GAAE,OAAe,GAAG,OAAO,EAAE;IAGlJ;;;;;;;OAOG;WACW,kBAAkB,CAAC,MAAM,EAAE,OAAO,EAAE,GAAG,oBAAoB,EAAE,aAAa,EAAE,MAAM,GAAG,OAAO,EAAE;IAK5G;;;;;OAKG;WACW,sBAAsB,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,eAAe,EAAE,MAAM,GAAG,OAAO,EAAE;IAM3F;;;;;;;OAOG;WACW,+BAA+B,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,WAAW,EAAE,MAAM,EAAE,OAAO,GAAE,MAAU,GAAG,OAAO,EAAE;IAYrH,OAAO,CAAC,MAAM,CAAC,kCAAkC;IAOjD;;;;;;;OAOG;IACH,OAAO,CAAC,MAAM,CAAC,sBAAsB;IAiCrC;;;;;SAKK;WACS,gBAAgB,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,MAAM,GAAE,OAAe,EAAE,SAAS,GAAE,MAAqC,GAAG,OAAO,EAAE;IAmCvI;;;OAGG;WACW,eAAe,CAAC,IAAI,EAAE,OAAO,EAAE,GAAG,OAAO,EAAE,EAAE;IAgB3D;;;OAGG;WACW,kBAAkB,CAAC,IAAI,EAAE,OAAO,EAAE,GAAG,OAAO,EAAE,EAAE;IAgB9D;;;;;;;;;;;;OAYG;WACW,qCAAqC,CACjD,UAAU,EAAE,oBAAoB,GAAG,OAAO,EAAE,EAAE,sBAAsB,GAAE,OAAe,GACpF,4BAA4B,EAAE,GAAG,SAAS;IA2C7C,OAAO,CAAC,MAAM,CAAC,aAAa,CAAC,CAAgB;IAC7C,OAAO,CAAC,MAAM,CAAC,aAAa,CAAC,CAAgB;IAC7C,OAAO,CAAC,MAAM,CAAC,oBAAoB,CAAC,CAA0B;IAC9D;;;;;;;;;;;;;;;OAeG;WACW,eAAe,CAC3B,OAAO,EAAE,OAAO,EAAE,GAAG,oBAAoB,EACzC,OAAO,EAAE,2BAA2B,EACpC,OAAO,EAAE,OAAO,EAAE,GAAG,oBAAoB,EACzC,OAAO,EAAE,2BAA2B,EACpC,IAAI,GAAE,MAAyB,EAC/B,MAAM,CAAC,EAAE,uBAAuB,GAC/B,uBAAuB,GAAG,SAAS;IAoDtC;;;;;;OAMG;WACW,UAAU,CACtB,MAAM,EAAE,OAAO,EAAE,EAAE,WAAW,GAAE,MAAqC,EAAE,MAAM,GAAE,OAAe,GAC7F,OAAO;CAKX"}

package/lib/cjs/geometry3d/PolylineOps.js

@@ -9,6 +9,7 @@
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.PolylineOps = void 0;
 const CurveExtendMode_1 = require("../curve/CurveExtendMode");
+const CurveOps_1 = require("../curve/CurveOps");
 const LineSegment3d_1 = require("../curve/LineSegment3d");
 const LineString3d_1 = require("../curve/LineString3d");
 const Geometry_1 = require("../Geometry");
@@ -39,11 +40,14 @@ class PolylineOps {
      * Return a simplified subset of given points.
      * * Points are removed by the Douglas-Puecker algorithm, viz https://en.wikipedia.org/wiki/Ramer–Douglas–Peucker_algorithm
      * * This is a global search, with multiple passes over the data.
-     * @param source
-     * @param chordTolerance
+     * @param source input points.
+     * @param chordTolerance Points less than this distance from a retained edge may be ignored.
+     * Default is [[Geometry.smallMetricDistance]].
+     * @param keepSeam whether to preserve the endpoints of physically closed input.
+     * Default is false, meaning physically closed input points are treated cyclically, allowing removal of the seam.
      */
-    static compressByChordError(source, chordTolerance) {
-        return PolylineCompressionByEdgeOffset_1.PolylineCompressionContext.compressPoint3dArrayByChordError(source, chordTolerance);
+    static compressByChordError(source, chordTolerance = Geometry_1.Geometry.smallMetricDistance, keepSeam = false) {
+        return PolylineCompressionByEdgeOffset_1.PolylineCompressionContext.compressPoint3dArrayByChordError(source, chordTolerance, keepSeam);
     }
     /**
      * Return a simplified subset of given points, omitting a point if very close to its predecessor.
@@ -347,6 +351,18 @@ class PolylineOps {
         }
         return foundMin ? result : undefined;
     }
+    /**
+     * Checks if all points are colinear.
+     * * This test does not take point order into account.
+     * @param points array of points to check.
+     * @param distanceTol tolerance for co-linearity check, default is Geometry.smallMetricDistance.
+     * @param xyOnly if true, only XY coordinates are used for the check, ignoring z coordinate.
+     */
+    static isColinear(points, distanceTol = Geometry_1.Geometry.smallMetricDistance, xyOnly = false) {
+        if (points.length < 3)
+            return true;
+        return undefined !== CurveOps_1.CurveOps.isColinear(points, { maxDeviation: distanceTol, xyColinear: xyOnly });
+    }
 }
 exports.PolylineOps = PolylineOps;
 //# sourceMappingURL=PolylineOps.js.map

package/lib/cjs/geometry3d/PolylineOps.js.map

@@ -1 +1 @@
-{"version":3,"file":"PolylineOps.js","sourceRoot":"","sources":["../../../src/geometry3d/PolylineOps.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,8DAA4G;AAE5G,0DAAuD;AACvD,wDAAqD;AACrD,0CAAuC;AACvC,yDAAsD;AAEtD,iFAA8E;AAC9E,+DAA4D;AAC5D,uDAAsD;AACtD,uFAA+E;AAC/E,mCAAkC;AAElC,sBAAsB;AACtB;;;GAGG;AACH,MAAa,WAAW;IACtB;;;OAGG;IACI,MAAM,CAAC,eAAe,CAAC,MAAiB;QAC7C,MAAM,KAAK,GAAG,eAAO,CAAC,UAAU,EAAE,CAAC;QACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACnD,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;OAMG;IACI,MAAM,CAAC,oBAAoB,CAAC,MAAiB,EAAE,cAAsB;QAC1E,OAAO,4DAA0B,CAAC,gCAAgC,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC;IAC7F,CAAC;IACD;;;;;;;OAOG;IACI,MAAM,CAAC,kBAAkB,CAAC,MAAwC,EAAE,aAAqB;QAC9F,MAAM,IAAI,GAAG,mCAAgB,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC7C,4DAA0B,CAAC,gCAAgC,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC;QACjF,OAAO,IAAI,CAAC,eAAe,EAAE,CAAC;IAChC,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,sBAAsB,CAAC,MAAiB,EAAE,eAAuB;QAC7E,MAAM,IAAI,GAAG,mCAAgB,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC7C,4DAA0B,CAAC,kCAAkC,CAAC,IAAI,EAAE,eAAe,CAAC,CAAC;QACrF,OAAO,IAAI,CAAC,eAAe,EAAE,CAAC;IAChC,CAAC;IAED;;;;;;;OAOG;IACI,MAAM,CAAC,+BAA+B,CAAC,MAAiB,EAAE,WAAmB,EAAE,UAAkB,CAAC;QACvG,MAAM,IAAI,GAAG,mCAAgB,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC7C,IAAI,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC;QACvB,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,OAAO,EAAE,IAAI,EAAE,EAAE,CAAC;YAC1C,4DAA0B,CAAC,sCAAsC,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;YACrF,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC;YACzB,IAAI,IAAI,KAAK,IAAI;gBACf,MAAM;YACR,IAAI,GAAG,IAAI,CAAC;QACd,CAAC;QACD,OAAO,IAAI,CAAC,eAAe,EAAE,CAAC;IAChC,CAAC;IACO,MAAM,CAAC,kCAAkC,CAAC,MAAe,EAAE,MAAe,EAAE,QAAgB,EAAE,MAAe;QACnH,MAAM,CAAC,GAAG,GAAG,GAAG,QAAQ,CAAC;QACzB,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,QAAQ,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QAC3D,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,QAAQ,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QAC3D,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,QAAQ,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QAC3D,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;IACrC,CAAC;IACD;;;;;;;OAOG;IACK,MAAM,CAAC,sBAAsB,CAAC,MAAiB,EAAE,MAAc,EAAE,MAAc,EAAE,MAAe,EAAE,wBAAgC;QACxI,IAAI,MAAM,GAAG,CAAC,IAAI,MAAM,IAAI,MAAM,CAAC,MAAM;YACvC,OAAO,KAAK,CAAC;QACf,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC;QAC9B,yBAAyB;QACzB,MAAM,GAAG,GAAG,MAAM,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;QAC3C,IAAI,GAAG,IAAI,wBAAwB;YACjC,OAAO,IAAI,CAAC;QACd,IAAI,MAAM,GAAG,CAAC,IAAI,MAAM,IAAI,MAAM,CAAC,MAAM;YACvC,OAAO,KAAK,CAAC;QACf,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC;QAC9B,6GAA6G;QAC7G,EAAE;QACF,YAAY;QACZ,MAAM,GAAG,GAAG,MAAM,CAAC,mBAAmB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QACvD,0DAA0D;QAC1D,IAAI,GAAG,IAAI,GAAG;YACZ,OAAO,KAAK,CAAC;QACf,MAAM,GAAG,GAAG,MAAM,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;QAC3C,IAAI,eAAe,CAAC;QACpB,IAAI,GAAG,IAAI,GAAG,EAAE,CAAC;YACf,iFAAiF;YACjF,+EAA+E;YAC/E,MAAM,QAAQ,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,8CAA8C;YAC1E,eAAe,GAAG,IAAI,CAAC,kCAAkC,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;QAC9F,CAAC;aAAM,CAAC;YACN,oEAAoE;YACpE,2DAA2D;YAC3D,MAAM,QAAQ,GAAG,GAAG,GAAG,GAAG,CAAC;YAC3B,eAAe,GAAG,IAAI,CAAC,kCAAkC,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;QAC9F,CAAC;QACD,OAAO,eAAe,GAAG,wBAAwB,CAAC;IACpD,CAAC;IACD;;;;;SAKK;IACE,MAAM,CAAC,gBAAgB,CAAC,MAAiB,EAAE,SAAkB,KAAK,EAAE,YAAoB,mBAAQ,CAAC,mBAAmB;QACzH,IAAI,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;QACtB,MAAM,wBAAwB,GAAG,SAAS,GAAG,SAAS,CAAC;QACvD,IAAI,MAAM;YACR,OAAO,CAAC,GAAG,CAAC,IAAI,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,wBAAwB;gBAClF,CAAC,EAAE,CAAC;QACR,MAAM,IAAI,GAAG,EAAE,CAAC;QAChB,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;QAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,QAAQ,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YAC3B,OAAO,IAAI,CAAC,sBAAsB,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,QAAQ,EAAE,wBAAwB,CAAC;gBAC5G,IAAI,CAAC,GAAG,EAAE,CAAC;YACb,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC;QAC9B,CAAC;QACD,IAAI,MAAM,EAAE,CAAC;YACX,0CAA0C;YAC1C,IAAI,SAAS,GAAG,CAAC,CAAC;YAClB,IAAI,UAAU,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;YACjC,OAAO,UAAU,GAAG,SAAS,GAAG,CAAC,EAAE,CAAC;gBAClC,IAAI,IAAI,CAAC,sBAAsB,CAAC,IAAI,EAAE,SAAS,EAAE,SAAS,GAAG,CAAC,EAAE,IAAI,CAAC,UAAU,CAAC,EAAE,wBAAwB,CAAC,EAAE,CAAC;oBAC5G,SAAS,EAAE,CAAC;gBACd,CAAC;qBAAM,IAAI,IAAI,CAAC,sBAAsB,CAAC,IAAI,EAAE,UAAU,EAAE,UAAU,GAAG,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,EAAE,wBAAwB,CAAC,EAAE,CAAC;oBACpH,UAAU,EAAE,CAAC;gBACf,CAAC;qBAAM,CAAC;oBACN,MAAM;gBACR,CAAC;YACH,CAAC;YACD,IAAI,UAAU,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM;gBAC9B,IAAI,CAAC,MAAM,GAAG,UAAU,GAAG,CAAC,CAAC;YAC/B,IAAI,SAAS,GAAG,CAAC,EAAE,CAAC;gBAClB,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;YAC5B,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,eAAe,CAAC,IAA6B;QACzD,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;YACnB,OAAO;QACT,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACnB,IAAI,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC;YACtB,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;gBACzB,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;oBACtB,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC;YAChC,CAAC;YACD,OAAO;QACT,CAAC;QACD,MAAM,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACjC,IAAI,EAAE,YAAY,yBAAO,IAAI,EAAE,YAAY,yBAAO,IAAI,CAAC,EAAE,CAAC,aAAa,CAAC,EAAE,CAAC,EAAE,CAAC;YAC3E,IAAkB,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,CAAC;QACvC,CAAC;IACH,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,kBAAkB,CAAC,IAA6B;QAC5D,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;YACnB,OAAO;QACT,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACnB,IAAI,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC;YACtB,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;gBACzB,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;oBACtB,IAAI,CAAC,kBAAkB,CAAC,KAAK,CAAC,CAAC;YACnC,CAAC;YACD,OAAO;QACT,CAAC;QACD,MAAM,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACjC,IAAI,EAAE,YAAY,yBAAO,IAAI,EAAE,YAAY,yBAAO,IAAI,EAAE,CAAC,aAAa,CAAC,EAAE,CAAC,EAAE,CAAC;YAC1E,IAAkB,CAAC,GAAG,EAAE,CAAC;QAC5B,CAAC;IACH,CAAC;IACD;;;;;;;;;;;;OAYG;IACI,MAAM,CAAC,qCAAqC,CACjD,UAA4C,EAAE,yBAAkC,KAAK;QAErF,MAAM,YAAY,GAAG,WAAW,CAAC,kBAAkB,CAAC,UAAU,EAAE,GAAG,GAAG,mBAAQ,CAAC,mBAAmB,CAAC,CAAC,CAAE,2DAA2D;QACjK,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC;YACzB,OAAO,SAAS,CAAC;QACnB,MAAM,cAAc,GAAmC,EAAE,CAAC;QAC1D,MAAM,MAAM,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;QAC/B,MAAM,MAAM,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;QAC/B,MAAM,MAAM,GAAG,0BAAQ,CAAC,wBAAwB,CAAC,MAAM,EAAE,MAAM,CAAE,CAAC;QAClE,MAAM,cAAc,GAAG,2DAA4B,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAE,CAAC;QAC5E,MAAM,cAAc,GAAG,2DAA4B,CAAC,aAAa,EAAE,CAAC;QACpE,wCAAwC;QACxC,cAAc,CAAC,IAAI,CAAC,cAAc,CAAC,KAAK,EAAE,CAAC,CAAC;QAC5C,kEAAkE;QAClE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACjD,0BAAQ,CAAC,wBAAwB,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;YAChF,0GAA0G;YAC1G,IAAI,SAAS,KAAK,2DAA4B,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,cAAc,CAAC,EAAE,CAAC;gBAC/F,MAAM,iBAAiB,GAAG,cAAc,CAAC,YAAY,EAAE,CAAC,WAAW,CAAC,GAAG,EAAE,cAAc,CAAC,YAAY,EAAE,CAAC,CAAC;gBACxG,MAAM,gBAAgB,GAAG,2DAA4B,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,iBAAiB,CAAC,CAAC;gBACjG,IAAI,SAAS,KAAK,gBAAgB;oBAChC,cAAc,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC;gBACxC,cAAc,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC;YACzC,CAAC;QACH,CAAC;QACD,gEAAgE;QAChE,cAAc,CAAC,IAAI,CAAC,2DAA4B,CAAC,MAAM,CAAC,YAAY,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,cAAc,CAAC,YAAY,EAAE,CAAE,CAAC,CAAC;QAChI,+FAA+F;QAC/F,MAAM,SAAS,GAAG,cAAc,CAAC,MAAM,GAAG,CAAC,CAAC;QAC5C,IAAI,SAAS,GAAG,CAAC,IAAI,sBAAsB,EAAE,CAAC;YAC5C,MAAM,UAAU,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;YACrC,MAAM,SAAS,GAAG,cAAc,CAAC,SAAS,CAAC,CAAC;YAC5C,IAAI,mBAAQ,CAAC,aAAa,CAAC,UAAU,CAAC,YAAY,EAAE,EAAE,SAAS,CAAC,YAAY,EAAE,CAAC,EAAE,CAAC;gBAChF,MAAM,iBAAiB,GAAG,UAAU,CAAC,YAAY,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,YAAY,EAAE,CAAC,CAAC,CAAC,iCAAiC;gBACrH,MAAM,gBAAgB,GAAG,2DAA4B,CAAC,MAAM,CAAC,UAAU,CAAC,YAAY,EAAE,EAAE,iBAAiB,CAAC,CAAC;gBAC3G,IAAI,SAAS,KAAK,gBAAgB,EAAE,CAAC;oBACnC,cAAc,CAAC,CAAC,CAAC,GAAG,gBAAgB,CAAC;oBACrC,cAAc,CAAC,SAAS,CAAC,GAAG,2DAA4B,CAAC,MAAM,CAAC,SAAS,CAAC,YAAY,EAAE,EAAE,iBAAiB,CAAE,CAAC;gBAChH,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,cAAc,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,SAAS,CAAC;IAChE,CAAC;IAEO,MAAM,CAAC,aAAa,CAAiB;IACrC,MAAM,CAAC,aAAa,CAAiB;IACrC,MAAM,CAAC,oBAAoB,CAA2B;IAC9D;;;;;;;;;;;;;;;OAeG;IACI,MAAM,CAAC,eAAe,CAC3B,OAAyC,EACzC,OAAoC,EACpC,OAAyC,EACzC,OAAoC,EACpC,OAAe,MAAM,CAAC,SAAS,EAC/B,MAAgC;QAEhC,IAAI,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC;YACxB,OAAO,GAAG,IAAI,yCAAmB,CAAC,OAAO,CAAC,CAAC;QAC7C,IAAI,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC;YACxB,OAAO,GAAG,IAAI,yCAAmB,CAAC,OAAO,CAAC,CAAC;QAC7C,IAAI,IAAI,GAAG,IAAI,CAAC;QAChB,IAAI,QAAQ,GAAG,KAAK,CAAC;QACrB,MAAM,WAAW,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;QACvC,MAAM,WAAW,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;QACvC,MAAM,UAAU,GAAG,CAAC,iCAAe,CAAC,IAAI,EAAE,iCAAe,CAAC,IAAI,CAAC,CAAC;QAChE,MAAM,UAAU,GAAG,CAAC,iCAAe,CAAC,IAAI,EAAE,iCAAe,CAAC,IAAI,CAAC,CAAC;QAChE,mEAAmE;QACnE,MAAM,aAAa,GAAG,CAAC,SAA4B,EAAE,QAAqC,EAAE,YAAoB,EAAE,WAAmB,EAAE,EAAE;YACvI,SAAS,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,GAAG,iCAAe,CAAC,IAAI,CAAC;YACnD,IAAI,YAAY,KAAK,CAAC;gBACpB,SAAS,CAAC,CAAC,CAAC,GAAG,oCAAkB,CAAC,mDAAmD,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;iBAChG,IAAI,YAAY,KAAK,WAAW,GAAG,CAAC;gBACvC,SAAS,CAAC,CAAC,CAAC,GAAG,oCAAkB,CAAC,mDAAmD,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;QACvG,CAAC,CAAC;QACF,gDAAgD;QAChD,MAAM,WAAW,GAAG,CAAC,MAA4B,EAAE,KAAa,EAAE,OAAkC,EAAiB,EAAE;YACrH,IAAI,OAAO,KAAK,SAAS;gBACvB,OAAO,6BAAa,CAAC,aAAa,CAAC,MAAM,CAAC,+BAA+B,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC,+BAA+B,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC;YACvI,MAAM,CAAC,+BAA+B,CAAC,KAAK,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC;YACjE,MAAM,CAAC,+BAA+B,CAAC,KAAK,GAAG,CAAC,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC;YACrE,OAAO,OAAO,CAAC;QACjB,CAAC,CAAC;QACF,yBAAyB;QACzB,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,WAAW,EAAE,MAAM,EAAE,EAAE,CAAC;YACpD,IAAI,CAAC,aAAa,GAAG,WAAW,CAAC,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC;YACtE,aAAa,CAAC,UAAU,EAAE,OAAO,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC;YACxD,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,WAAW,EAAE,MAAM,EAAE,EAAE,CAAC;gBACpD,IAAI,CAAC,aAAa,GAAG,WAAW,CAAC,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC;gBACtE,aAAa,CAAC,UAAU,EAAE,OAAO,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC;gBACxD,IAAI,SAAS,KAAK,CAAC,IAAI,CAAC,oBAAoB,GAAG,6BAAa,CAAC,eAAe,CAAC,IAAI,CAAC,aAAa,EAAE,UAAU,EAAE,IAAI,CAAC,aAAa,EAAE,UAAU,EAAE,IAAI,CAAC,oBAAoB,CAAC,CAAC,EAAE,CAAC;oBACzK,MAAM,CAAC,GAAG,IAAI,CAAC,oBAAoB,CAAC,OAAO,CAAC,CAAC,CAAC;oBAC9C,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC;wBACb,MAAM,YAAY,GAAG,MAAM,EAAE,OAAO,CAAC,WAAW,CAAC,CAAC,iBAAiB;wBACnE,MAAM,YAAY,GAAG,MAAM,EAAE,OAAO,CAAC,WAAW,CAAC;wBACjD,MAAM,GAAG,IAAI,CAAC,oBAAoB,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,4BAA4B;wBAC9E,2BAAY,CAAC,0BAA0B,CAAC,MAAM,CAAC,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,SAAS,EAAE,YAAY,CAAC,CAAC;wBACtG,2BAAY,CAAC,0BAA0B,CAAC,MAAM,CAAC,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,SAAS,EAAE,YAAY,CAAC,CAAC;wBACtG,IAAI,MAAM,CAAC,OAAO,CAAC,WAAW,IAAI,MAAM,CAAC,OAAO,CAAC,WAAW;4BAC1D,MAAM,CAAC,OAAO,CAAC,WAAW,CAAC,KAAK,GAAG,MAAM,CAAC,OAAO,CAAC,WAAW,CAAC,KAAK,GAAG,SAAS,CAAC,CAAC,uCAAuC;wBAC1H,IAAI,GAAG,CAAC,CAAC;wBACT,QAAQ,GAAG,IAAI,CAAC;oBAClB,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC;IACvC,CAAC;CACF;AA5UD,kCA4UC","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*--------------------------------------------------------------------------------------------*/\n/** @packageDocumentation\n * @module CartesianGeometry\n */\n\nimport { CurveExtendMode, CurveExtendOptions, VariantCurveExtendParameter } from \"../curve/CurveExtendMode\";\nimport { CurveLocationDetailPair } from \"../curve/CurveLocationDetail\";\nimport { LineSegment3d } from \"../curve/LineSegment3d\";\nimport { LineString3d } from \"../curve/LineString3d\";\nimport { Geometry } from \"../Geometry\";\nimport { GrowableXYZArray } from \"./GrowableXYZArray\";\nimport { IndexedXYZCollection } from \"./IndexedXYZCollection\";\nimport { Plane3dByOriginAndUnitNormal } from \"./Plane3dByOriginAndUnitNormal\";\nimport { Point3dArrayCarrier } from \"./Point3dArrayCarrier\";\nimport { Point3d, Vector3d } from \"./Point3dVector3d\";\nimport { PolylineCompressionContext } from \"./PolylineCompressionByEdgeOffset\";\nimport { Range1d } from \"./Range\";\n\n// cspell:word Puecker\n/**\n * PolylineOps is a collection of static methods operating on polylines.\n * @public\n */\nexport class PolylineOps {\n  /**\n   * Return a Range1d with the shortest and longest edge lengths of the polyline.\n   * @param points points to examine.\n   */\n  public static edgeLengthRange(points: Point3d[]): Range1d {\n    const range = Range1d.createNull();\n    for (let i = 1; i < points.length; i++) {\n      range.extendX(points[i - 1].distance(points[i]));\n    }\n    return range;\n  }\n  /**\n   * Return a simplified subset of given points.\n   * * Points are removed by the Douglas-Puecker algorithm, viz https://en.wikipedia.org/wiki/Ramer–Douglas–Peucker_algorithm\n   * * This is a global search, with multiple passes over the data.\n   * @param source\n   * @param chordTolerance\n   */\n  public static compressByChordError(source: Point3d[], chordTolerance: number): Point3d[] {\n    return PolylineCompressionContext.compressPoint3dArrayByChordError(source, chordTolerance);\n  }\n  /**\n   * Return a simplified subset of given points, omitting a point if very close to its predecessor.\n   * * This is a local search, with a single pass over the data.\n   * * First and last points are always retained.\n   * @param source input points\n   * @param maxEdgeLength length of largest edge to be compressed out\n   * @see [[GrowableXYZArray.cloneCompressed]]\n   */\n  public static compressShortEdges(source: Point3d[] | IndexedXYZCollection, maxEdgeLength: number): Point3d[] {\n    const dest = GrowableXYZArray.create(source);\n    PolylineCompressionContext.compressInPlaceByShortEdgeLength(dest, maxEdgeLength);\n    return dest.getPoint3dArray();\n  }\n  /**\n   * Return a simplified subset of given points, omitting the middle of three successive points if the triangle they form is small.\n   * * This is a local search, with a single pass over the data.\n   * @param source input points\n   * @param maxTriangleArea area of largest triangle to compress\n   */\n  public static compressSmallTriangles(source: Point3d[], maxTriangleArea: number): Point3d[] {\n    const dest = GrowableXYZArray.create(source);\n    PolylineCompressionContext.compressInPlaceBySmallTriangleArea(dest, maxTriangleArea);\n    return dest.getPoint3dArray();\n  }\n\n  /**\n   * Return a simplified subset of given points, omitting points if close to the edge between neighboring points before and after\n   * * This is a local search, with a single pass over the data for each pass.\n   * @param source input points\n   * @param maxDistance omit points if this close to edge between points before and after\n   * @param numPass max number of times to run the filter.  numPass=2 is observed to behave well.\n   *\n   */\n  public static compressByPerpendicularDistance(source: Point3d[], maxDistance: number, numPass: number = 2): Point3d[] {\n    const dest = GrowableXYZArray.create(source);\n    let num0 = dest.length;\n    for (let pass = 0; pass < numPass; pass++) {\n      PolylineCompressionContext.compressInPlaceByPerpendicularDistance(dest, maxDistance);\n      const num1 = dest.length;\n      if (num1 === num0)\n        break;\n      num0 = num1;\n    }\n    return dest.getPoint3dArray();\n  }\n  private static squaredDistanceToInterpolatedPoint(pointQ: Point3d, point0: Point3d, fraction: number, point1: Point3d): number {\n    const g = 1.0 - fraction;\n    const dx = pointQ.x - (g * point0.x + fraction * point1.x);\n    const dy = pointQ.y - (g * point0.y + fraction * point1.y);\n    const dz = pointQ.z - (g * point0.z + fraction * point1.z);\n    return dx * dx + dy * dy + dz * dz;\n  }\n  /**\n   * test if either\n   *   * points[indexA] matches pointQ\n   *   * line from points[indexA] to points[indexB] overlaps points[indexA] to pointQ\n   * @param points\n   * @param pointQ\n   * @param tolerance\n   */\n  private static isDanglerConfiguration(points: Point3d[], indexA: number, indexB: number, pointQ: Point3d, squaredDistanceTolerance: number): boolean {\n    if (indexA < 0 || indexA >= points.length)\n      return false;\n    const pointA = points[indexA];\n    // simple point match ...\n    const d2Q = pointA.distanceSquared(pointQ);\n    if (d2Q <= squaredDistanceTolerance)\n      return true;\n    if (indexB < 0 || indexB >= points.length)\n      return false;\n    const pointB = points[indexB];\n    // The expensive test .. does newPoint double back to an interior or extrapolation of the final dest segment?\n    //\n    // or pointQ\n    const dot = pointA.dotVectorsToTargets(pointB, pointQ);\n    // simple case -- pointB..pointA..pointQ continues forward\n    if (dot <= 0.0)\n      return false;\n    const d2B = pointA.distanceSquared(pointB);\n    let distanceSquared;\n    if (d2Q >= d2B) {\n      //                        pointB----------------------------------->>>>>>> pointA\n      //          pointQ<<<<---------------------------------------------------------\n      const fraction = dot / d2Q; // safe to divide because of earlier d2Q test.\n      distanceSquared = this.squaredDistanceToInterpolatedPoint(pointB, pointA, fraction, pointQ);\n    } else {\n      //           pointB----------------------------------->>>>>>> pointA\n      //                         pointQ<<<<----------------------\n      const fraction = dot / d2B;\n      distanceSquared = this.squaredDistanceToInterpolatedPoint(pointQ, pointA, fraction, pointB);\n    }\n    return distanceSquared < squaredDistanceTolerance;\n  }\n  /**\n     * Return a simplified subset of given points, omitting points on \"danglers\" that depart and return on a single path.\n     * @param source input points\n     * @param closed if true, an edge returning to point 0 is implied even if final point does not match.\n     * @param tolerance tolerance for near-zero distance.\n     */\n  public static compressDanglers(source: Point3d[], closed: boolean = false, tolerance: number = Geometry.smallMetricDistance): Point3d[] {\n    let n = source.length;\n    const squaredDistanceTolerance = tolerance * tolerance;\n    if (closed)\n      while (n > 1 && source[n - 1].distanceSquared(source[0]) <= squaredDistanceTolerance)\n        n--;\n    const dest = [];\n    dest.push(source[0].clone());\n    for (let i = 1; i < n; i++) {\n      const newPoint = source[i];\n      while (this.isDanglerConfiguration(dest, dest.length - 1, dest.length - 2, newPoint, squaredDistanceTolerance))\n        dest.pop();\n      dest.push(newPoint.clone());\n    }\n    if (closed) {\n      // No purge moving backwards.   Last point\n      let leftIndex = 0;\n      let rightIndex = dest.length - 1;\n      while (rightIndex > leftIndex + 2) {\n        if (this.isDanglerConfiguration(dest, leftIndex, leftIndex + 1, dest[rightIndex], squaredDistanceTolerance)) {\n          leftIndex++;\n        } else if (this.isDanglerConfiguration(dest, rightIndex, rightIndex - 1, dest[leftIndex], squaredDistanceTolerance)) {\n          rightIndex--;\n        } else {\n          break;\n        }\n      }\n      if (rightIndex + 1 < dest.length)\n        dest.length = rightIndex + 1;\n      if (leftIndex > 0) {\n        dest.splice(0, leftIndex);\n      }\n    }\n    return dest;\n  }\n  /**\n   * Add closure points to a polyline or array of polylines\n   * @param data points.\n   */\n  public static addClosurePoint(data: Point3d[] | Point3d[][]) {\n    if (data.length === 0)\n      return;\n    const q0 = data[0];\n    if (Array.isArray(q0)) {\n      for (const child of data) {\n        if (Array.isArray(child))\n          this.addClosurePoint(child);\n      }\n      return;\n    }\n    const q1 = data[data.length - 1];\n    if (q0 instanceof Point3d && q1 instanceof Point3d && !q0.isAlmostEqual(q1)) {\n      (data as Point3d[]).push(q0.clone());\n    }\n  }\n  /**\n   * Remove closure points of a polyline or array of polylines\n   * @param data points.\n   */\n  public static removeClosurePoint(data: Point3d[] | Point3d[][]) {\n    if (data.length === 0)\n      return;\n    const q0 = data[0];\n    if (Array.isArray(q0)) {\n      for (const child of data) {\n        if (Array.isArray(child))\n          this.removeClosurePoint(child);\n      }\n      return;\n    }\n    const q1 = data[data.length - 1];\n    if (q0 instanceof Point3d && q1 instanceof Point3d && q0.isAlmostEqual(q1)) {\n      (data as Point3d[]).pop();\n    }\n  }\n  /**\n   * Create an array of planes.\n   * * First plane has origin at first centerline point, with unit normal directed at the next point.\n   * * Intermediate planes have origin at intermediate points, with unit normals computed from the average of unit vectors\n   *   along the incoming and outgoing segments.\n   * * Last plane has origin at last centerline point, with unit normal directed from previous point.\n   * * All sets of adjacent coincident points are reduced to a single point.\n   *    * Hence the output array may have fewer points than the centerline.\n   * * If there are one or fewer distinct input points, the return is undefined.\n   * @param centerline points to reside in output planes.\n   * @param wrapIfPhysicallyClosed if true and the first and last centerline points are the same, then the first and last\n   * output planes are averaged and equated (cloned). Default false.\n   */\n  public static createBisectorPlanesForDistinctPoints(\n    centerline: IndexedXYZCollection | Point3d[], wrapIfPhysicallyClosed: boolean = false,\n  ): Plane3dByOriginAndUnitNormal[] | undefined {\n    const packedPoints = PolylineOps.compressShortEdges(centerline, 2.0 * Geometry.smallMetricDistance);  // double the tolerance to ensure normalized vectors exist.\n    if (packedPoints.length < 2)\n      return undefined;\n    const bisectorPlanes: Plane3dByOriginAndUnitNormal[] = [];\n    const point0 = packedPoints[0];\n    const point1 = packedPoints[1];\n    const unit01 = Vector3d.createNormalizedStartEnd(point0, point1)!;\n    const perpendicular0 = Plane3dByOriginAndUnitNormal.create(point0, unit01)!;\n    const perpendicular1 = Plane3dByOriginAndUnitNormal.createXYPlane();\n    // FIRST point gets simple perpendicular\n    bisectorPlanes.push(perpendicular0.clone());\n    // Each intermediate point gets average of adjacent perpendiculars\n    for (let i = 1; i + 1 < packedPoints.length; i++) {\n      Vector3d.createNormalizedStartEnd(packedPoints[i], packedPoints[i + 1], unit01);\n      // remark: the prior pack should ensure the normalization is ok.  But if it fails, we ignore this point...\n      if (undefined !== Plane3dByOriginAndUnitNormal.create(packedPoints[i], unit01, perpendicular1)) {\n        const newBisectorNormal = perpendicular0.getNormalRef().interpolate(0.5, perpendicular1.getNormalRef());\n        const newBisectorPlane = Plane3dByOriginAndUnitNormal.create(packedPoints[i], newBisectorNormal);\n        if (undefined !== newBisectorPlane)\n          bisectorPlanes.push(newBisectorPlane);\n        perpendicular0.setFrom(perpendicular1);\n      }\n    }\n    // LAST point gets simple perpendicular inherited from last pass\n    bisectorPlanes.push(Plane3dByOriginAndUnitNormal.create(packedPoints[packedPoints.length - 1], perpendicular0.getNormalRef())!);\n    // reset end planes to their average plane, but leave them alone if the closure point is a cusp\n    const lastIndex = bisectorPlanes.length - 1;\n    if (lastIndex > 0 && wrapIfPhysicallyClosed) {\n      const firstPlane = bisectorPlanes[0];\n      const lastPlane = bisectorPlanes[lastIndex];\n      if (Geometry.isSamePoint3d(firstPlane.getOriginRef(), lastPlane.getOriginRef())) {\n        const newBisectorNormal = firstPlane.getNormalRef().plus(lastPlane.getNormalRef()); // could be zero vector at a cusp\n        const newBisectorPlane = Plane3dByOriginAndUnitNormal.create(firstPlane.getOriginRef(), newBisectorNormal);\n        if (undefined !== newBisectorPlane) {\n          bisectorPlanes[0] = newBisectorPlane;\n          bisectorPlanes[lastIndex] = Plane3dByOriginAndUnitNormal.create(lastPlane.getOriginRef(), newBisectorNormal)!;\n        }\n      }\n    }\n    return bisectorPlanes.length > 1 ? bisectorPlanes : undefined;\n  }\n\n  private static _workSegmentA?: LineSegment3d;\n  private static _workSegmentB?: LineSegment3d;\n  private static _workLocalDetailPair?: CurveLocationDetailPair;\n  /**\n   * Find smallest distance between polylines.\n   * * For polylines with many points, it is more efficient to use [[LineString3dRangeTreeContext.searchForClosestApproach]].\n   * @param pointsA first polyline\n   * @param extendA how to extend polylineA forward/backward\n   * @param pointsB second polyline\n   * @param extendB how to extend polylineB forward/backward\n   * @param dMax largest approach distance to consider\n   * @param result optional pre-allocated object to populate and return\n   * @returns pair of details, one for each polyline, with field values:\n   * * `a` is the closest approach distance\n   * * `point` is the point of closest approach\n   * * `fraction` is the global polyline fraction\n   * * `childDetail.a` is the segment index\n   * * `childDetail.fraction` is the local segment fraction\n   */\n  public static closestApproach(\n    pointsA: Point3d[] | IndexedXYZCollection,\n    extendA: VariantCurveExtendParameter,\n    pointsB: Point3d[] | IndexedXYZCollection,\n    extendB: VariantCurveExtendParameter,\n    dMax: number = Number.MAX_VALUE,\n    result?: CurveLocationDetailPair,\n  ): CurveLocationDetailPair | undefined {\n    if (Array.isArray(pointsA))\n      pointsA = new Point3dArrayCarrier(pointsA);\n    if (Array.isArray(pointsB))\n      pointsB = new Point3dArrayCarrier(pointsB);\n    let dMin = dMax;\n    let foundMin = false;\n    const numSegmentA = pointsA.length - 1;\n    const numSegmentB = pointsB.length - 1;\n    const extendSegA = [CurveExtendMode.None, CurveExtendMode.None];\n    const extendSegB = [CurveExtendMode.None, CurveExtendMode.None];\n    // lambda to set extension for first and last segment of a polyline\n    const convertExtend = (extendOut: CurveExtendMode[], extendIn: VariantCurveExtendParameter, segmentIndex: number, numSegments: number) => {\n      extendOut[0] = extendOut[1] = CurveExtendMode.None;\n      if (segmentIndex === 0)\n        extendOut[0] = CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extendIn, 0);\n      else if (segmentIndex === numSegments - 1)\n        extendOut[1] = CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extendIn, 1);\n    };\n    // lambda to extract LineSegment3d from polyline\n    const fillSegment = (points: IndexedXYZCollection, index: number, segment: LineSegment3d | undefined): LineSegment3d => {\n      if (segment === undefined)\n        return LineSegment3d.createCapture(points.getPoint3dAtUncheckedPointIndex(index), points.getPoint3dAtUncheckedPointIndex(index + 1));\n      points.getPoint3dAtUncheckedPointIndex(index, segment.point0Ref);\n      points.getPoint3dAtUncheckedPointIndex(index + 1, segment.point1Ref);\n      return segment;\n    };\n    // just test the segments\n    for (let indexA = 0; indexA < numSegmentA; indexA++) {\n      this._workSegmentA = fillSegment(pointsA, indexA, this._workSegmentA);\n      convertExtend(extendSegA, extendA, indexA, numSegmentA);\n      for (let indexB = 0; indexB < numSegmentB; indexB++) {\n        this._workSegmentB = fillSegment(pointsB, indexB, this._workSegmentB);\n        convertExtend(extendSegB, extendB, indexB, numSegmentB);\n        if (undefined !== (this._workLocalDetailPair = LineSegment3d.closestApproach(this._workSegmentA, extendSegA, this._workSegmentB, extendSegB, this._workLocalDetailPair))) {\n          const d = this._workLocalDetailPair.detailA.a;\n          if (d < dMin) {\n            const childDetailA = result?.detailA.childDetail; // save and reuse\n            const childDetailB = result?.detailB.childDetail;\n            result = this._workLocalDetailPair.clone(result); // overwrite previous result\n            LineString3d.convertLocalToGlobalDetail(result.detailA, indexA, numSegmentA, undefined, childDetailA);\n            LineString3d.convertLocalToGlobalDetail(result.detailB, indexB, numSegmentB, undefined, childDetailB);\n            if (result.detailA.childDetail && result.detailB.childDetail)\n              result.detailA.childDetail.curve = result.detailB.childDetail.curve = undefined; // no CurvePrimitives survive in output\n            dMin = d;\n            foundMin = true;\n          }\n        }\n      }\n    }\n    return foundMin ? result : undefined;\n  }\n}\n"]}
+{"version":3,"file":"PolylineOps.js","sourceRoot":"","sources":["../../../src/geometry3d/PolylineOps.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,8DAA4G;AAE5G,gDAA6C;AAC7C,0DAAuD;AACvD,wDAAqD;AACrD,0CAAuC;AACvC,yDAAsD;AAEtD,iFAA8E;AAC9E,+DAA4D;AAC5D,uDAAsD;AACtD,uFAA+E;AAC/E,mCAAkC;AAElC,sBAAsB;AACtB;;;GAGG;AACH,MAAa,WAAW;IACtB;;;OAGG;IACI,MAAM,CAAC,eAAe,CAAC,MAAiB;QAC7C,MAAM,KAAK,GAAG,eAAO,CAAC,UAAU,EAAE,CAAC;QACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACnD,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;;;;OASG;IACI,MAAM,CAAC,oBAAoB,CAAC,MAAiB,EAAE,iBAAyB,mBAAQ,CAAC,mBAAmB,EAAE,WAAoB,KAAK;QACpI,OAAO,4DAA0B,CAAC,gCAAgC,CAAC,MAAM,EAAE,cAAc,EAAE,QAAQ,CAAC,CAAC;IACvG,CAAC;IACD;;;;;;;OAOG;IACI,MAAM,CAAC,kBAAkB,CAAC,MAAwC,EAAE,aAAqB;QAC9F,MAAM,IAAI,GAAG,mCAAgB,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC7C,4DAA0B,CAAC,gCAAgC,CAAC,IAAI,EAAE,aAAa,CAAC,CAAC;QACjF,OAAO,IAAI,CAAC,eAAe,EAAE,CAAC;IAChC,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,sBAAsB,CAAC,MAAiB,EAAE,eAAuB;QAC7E,MAAM,IAAI,GAAG,mCAAgB,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC7C,4DAA0B,CAAC,kCAAkC,CAAC,IAAI,EAAE,eAAe,CAAC,CAAC;QACrF,OAAO,IAAI,CAAC,eAAe,EAAE,CAAC;IAChC,CAAC;IAED;;;;;;;OAOG;IACI,MAAM,CAAC,+BAA+B,CAAC,MAAiB,EAAE,WAAmB,EAAE,UAAkB,CAAC;QACvG,MAAM,IAAI,GAAG,mCAAgB,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC7C,IAAI,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC;QACvB,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,OAAO,EAAE,IAAI,EAAE,EAAE,CAAC;YAC1C,4DAA0B,CAAC,sCAAsC,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;YACrF,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC;YACzB,IAAI,IAAI,KAAK,IAAI;gBACf,MAAM;YACR,IAAI,GAAG,IAAI,CAAC;QACd,CAAC;QACD,OAAO,IAAI,CAAC,eAAe,EAAE,CAAC;IAChC,CAAC;IACO,MAAM,CAAC,kCAAkC,CAAC,MAAe,EAAE,MAAe,EAAE,QAAgB,EAAE,MAAe;QACnH,MAAM,CAAC,GAAG,GAAG,GAAG,QAAQ,CAAC;QACzB,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,QAAQ,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QAC3D,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,QAAQ,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QAC3D,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,QAAQ,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QAC3D,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;IACrC,CAAC;IACD;;;;;;;OAOG;IACK,MAAM,CAAC,sBAAsB,CAAC,MAAiB,EAAE,MAAc,EAAE,MAAc,EAAE,MAAe,EAAE,wBAAgC;QACxI,IAAI,MAAM,GAAG,CAAC,IAAI,MAAM,IAAI,MAAM,CAAC,MAAM;YACvC,OAAO,KAAK,CAAC;QACf,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC;QAC9B,yBAAyB;QACzB,MAAM,GAAG,GAAG,MAAM,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;QAC3C,IAAI,GAAG,IAAI,wBAAwB;YACjC,OAAO,IAAI,CAAC;QACd,IAAI,MAAM,GAAG,CAAC,IAAI,MAAM,IAAI,MAAM,CAAC,MAAM;YACvC,OAAO,KAAK,CAAC;QACf,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC;QAC9B,6GAA6G;QAC7G,EAAE;QACF,YAAY;QACZ,MAAM,GAAG,GAAG,MAAM,CAAC,mBAAmB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QACvD,0DAA0D;QAC1D,IAAI,GAAG,IAAI,GAAG;YACZ,OAAO,KAAK,CAAC;QACf,MAAM,GAAG,GAAG,MAAM,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;QAC3C,IAAI,eAAe,CAAC;QACpB,IAAI,GAAG,IAAI,GAAG,EAAE,CAAC;YACf,iFAAiF;YACjF,+EAA+E;YAC/E,MAAM,QAAQ,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,8CAA8C;YAC1E,eAAe,GAAG,IAAI,CAAC,kCAAkC,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;QAC9F,CAAC;aAAM,CAAC;YACN,oEAAoE;YACpE,2DAA2D;YAC3D,MAAM,QAAQ,GAAG,GAAG,GAAG,GAAG,CAAC;YAC3B,eAAe,GAAG,IAAI,CAAC,kCAAkC,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;QAC9F,CAAC;QACD,OAAO,eAAe,GAAG,wBAAwB,CAAC;IACpD,CAAC;IACD;;;;;SAKK;IACE,MAAM,CAAC,gBAAgB,CAAC,MAAiB,EAAE,SAAkB,KAAK,EAAE,YAAoB,mBAAQ,CAAC,mBAAmB;QACzH,IAAI,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;QACtB,MAAM,wBAAwB,GAAG,SAAS,GAAG,SAAS,CAAC;QACvD,IAAI,MAAM;YACR,OAAO,CAAC,GAAG,CAAC,IAAI,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,wBAAwB;gBAClF,CAAC,EAAE,CAAC;QACR,MAAM,IAAI,GAAG,EAAE,CAAC;QAChB,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;QAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,QAAQ,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YAC3B,OAAO,IAAI,CAAC,sBAAsB,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,QAAQ,EAAE,wBAAwB,CAAC;gBAC5G,IAAI,CAAC,GAAG,EAAE,CAAC;YACb,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC;QAC9B,CAAC;QACD,IAAI,MAAM,EAAE,CAAC;YACX,0CAA0C;YAC1C,IAAI,SAAS,GAAG,CAAC,CAAC;YAClB,IAAI,UAAU,GAAG,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;YACjC,OAAO,UAAU,GAAG,SAAS,GAAG,CAAC,EAAE,CAAC;gBAClC,IAAI,IAAI,CAAC,sBAAsB,CAAC,IAAI,EAAE,SAAS,EAAE,SAAS,GAAG,CAAC,EAAE,IAAI,CAAC,UAAU,CAAC,EAAE,wBAAwB,CAAC,EAAE,CAAC;oBAC5G,SAAS,EAAE,CAAC;gBACd,CAAC;qBAAM,IAAI,IAAI,CAAC,sBAAsB,CAAC,IAAI,EAAE,UAAU,EAAE,UAAU,GAAG,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,EAAE,wBAAwB,CAAC,EAAE,CAAC;oBACpH,UAAU,EAAE,CAAC;gBACf,CAAC;qBAAM,CAAC;oBACN,MAAM;gBACR,CAAC;YACH,CAAC;YACD,IAAI,UAAU,GAAG,CAAC,GAAG,IAAI,CAAC,MAAM;gBAC9B,IAAI,CAAC,MAAM,GAAG,UAAU,GAAG,CAAC,CAAC;YAC/B,IAAI,SAAS,GAAG,CAAC,EAAE,CAAC;gBAClB,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;YAC5B,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,eAAe,CAAC,IAA6B;QACzD,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;YACnB,OAAO;QACT,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACnB,IAAI,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC;YACtB,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;gBACzB,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;oBACtB,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC;YAChC,CAAC;YACD,OAAO;QACT,CAAC;QACD,MAAM,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACjC,IAAI,EAAE,YAAY,yBAAO,IAAI,EAAE,YAAY,yBAAO,IAAI,CAAC,EAAE,CAAC,aAAa,CAAC,EAAE,CAAC,EAAE,CAAC;YAC3E,IAAkB,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,CAAC;QACvC,CAAC;IACH,CAAC;IACD;;;OAGG;IACI,MAAM,CAAC,kBAAkB,CAAC,IAA6B;QAC5D,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;YACnB,OAAO;QACT,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;QACnB,IAAI,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC;YACtB,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;gBACzB,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;oBACtB,IAAI,CAAC,kBAAkB,CAAC,KAAK,CAAC,CAAC;YACnC,CAAC;YACD,OAAO;QACT,CAAC;QACD,MAAM,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACjC,IAAI,EAAE,YAAY,yBAAO,IAAI,EAAE,YAAY,yBAAO,IAAI,EAAE,CAAC,aAAa,CAAC,EAAE,CAAC,EAAE,CAAC;YAC1E,IAAkB,CAAC,GAAG,EAAE,CAAC;QAC5B,CAAC;IACH,CAAC;IACD;;;;;;;;;;;;OAYG;IACI,MAAM,CAAC,qCAAqC,CACjD,UAA4C,EAAE,yBAAkC,KAAK;QAErF,MAAM,YAAY,GAAG,WAAW,CAAC,kBAAkB,CAAC,UAAU,EAAE,GAAG,GAAG,mBAAQ,CAAC,mBAAmB,CAAC,CAAC,CAAE,2DAA2D;QACjK,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC;YACzB,OAAO,SAAS,CAAC;QACnB,MAAM,cAAc,GAAmC,EAAE,CAAC;QAC1D,MAAM,MAAM,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;QAC/B,MAAM,MAAM,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;QAC/B,MAAM,MAAM,GAAG,0BAAQ,CAAC,wBAAwB,CAAC,MAAM,EAAE,MAAM,CAAE,CAAC;QAClE,MAAM,cAAc,GAAG,2DAA4B,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAE,CAAC;QAC5E,MAAM,cAAc,GAAG,2DAA4B,CAAC,aAAa,EAAE,CAAC;QACpE,wCAAwC;QACxC,cAAc,CAAC,IAAI,CAAC,cAAc,CAAC,KAAK,EAAE,CAAC,CAAC;QAC5C,kEAAkE;QAClE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACjD,0BAAQ,CAAC,wBAAwB,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;YAChF,0GAA0G;YAC1G,IAAI,SAAS,KAAK,2DAA4B,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,cAAc,CAAC,EAAE,CAAC;gBAC/F,MAAM,iBAAiB,GAAG,cAAc,CAAC,YAAY,EAAE,CAAC,WAAW,CAAC,GAAG,EAAE,cAAc,CAAC,YAAY,EAAE,CAAC,CAAC;gBACxG,MAAM,gBAAgB,GAAG,2DAA4B,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,iBAAiB,CAAC,CAAC;gBACjG,IAAI,SAAS,KAAK,gBAAgB;oBAChC,cAAc,CAAC,IAAI,CAAC,gBAAgB,CAAC,CAAC;gBACxC,cAAc,CAAC,OAAO,CAAC,cAAc,CAAC,CAAC;YACzC,CAAC;QACH,CAAC;QACD,gEAAgE;QAChE,cAAc,CAAC,IAAI,CAAC,2DAA4B,CAAC,MAAM,CAAC,YAAY,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,cAAc,CAAC,YAAY,EAAE,CAAE,CAAC,CAAC;QAChI,+FAA+F;QAC/F,MAAM,SAAS,GAAG,cAAc,CAAC,MAAM,GAAG,CAAC,CAAC;QAC5C,IAAI,SAAS,GAAG,CAAC,IAAI,sBAAsB,EAAE,CAAC;YAC5C,MAAM,UAAU,GAAG,cAAc,CAAC,CAAC,CAAC,CAAC;YACrC,MAAM,SAAS,GAAG,cAAc,CAAC,SAAS,CAAC,CAAC;YAC5C,IAAI,mBAAQ,CAAC,aAAa,CAAC,UAAU,CAAC,YAAY,EAAE,EAAE,SAAS,CAAC,YAAY,EAAE,CAAC,EAAE,CAAC;gBAChF,MAAM,iBAAiB,GAAG,UAAU,CAAC,YAAY,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,YAAY,EAAE,CAAC,CAAC,CAAC,iCAAiC;gBACrH,MAAM,gBAAgB,GAAG,2DAA4B,CAAC,MAAM,CAAC,UAAU,CAAC,YAAY,EAAE,EAAE,iBAAiB,CAAC,CAAC;gBAC3G,IAAI,SAAS,KAAK,gBAAgB,EAAE,CAAC;oBACnC,cAAc,CAAC,CAAC,CAAC,GAAG,gBAAgB,CAAC;oBACrC,cAAc,CAAC,SAAS,CAAC,GAAG,2DAA4B,CAAC,MAAM,CAAC,SAAS,CAAC,YAAY,EAAE,EAAE,iBAAiB,CAAE,CAAC;gBAChH,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,cAAc,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,SAAS,CAAC;IAChE,CAAC;IAEO,MAAM,CAAC,aAAa,CAAiB;IACrC,MAAM,CAAC,aAAa,CAAiB;IACrC,MAAM,CAAC,oBAAoB,CAA2B;IAC9D;;;;;;;;;;;;;;;OAeG;IACI,MAAM,CAAC,eAAe,CAC3B,OAAyC,EACzC,OAAoC,EACpC,OAAyC,EACzC,OAAoC,EACpC,OAAe,MAAM,CAAC,SAAS,EAC/B,MAAgC;QAEhC,IAAI,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC;YACxB,OAAO,GAAG,IAAI,yCAAmB,CAAC,OAAO,CAAC,CAAC;QAC7C,IAAI,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC;YACxB,OAAO,GAAG,IAAI,yCAAmB,CAAC,OAAO,CAAC,CAAC;QAC7C,IAAI,IAAI,GAAG,IAAI,CAAC;QAChB,IAAI,QAAQ,GAAG,KAAK,CAAC;QACrB,MAAM,WAAW,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;QACvC,MAAM,WAAW,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;QACvC,MAAM,UAAU,GAAG,CAAC,iCAAe,CAAC,IAAI,EAAE,iCAAe,CAAC,IAAI,CAAC,CAAC;QAChE,MAAM,UAAU,GAAG,CAAC,iCAAe,CAAC,IAAI,EAAE,iCAAe,CAAC,IAAI,CAAC,CAAC;QAChE,mEAAmE;QACnE,MAAM,aAAa,GAAG,CAAC,SAA4B,EAAE,QAAqC,EAAE,YAAoB,EAAE,WAAmB,EAAE,EAAE;YACvI,SAAS,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,GAAG,iCAAe,CAAC,IAAI,CAAC;YACnD,IAAI,YAAY,KAAK,CAAC;gBACpB,SAAS,CAAC,CAAC,CAAC,GAAG,oCAAkB,CAAC,mDAAmD,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;iBAChG,IAAI,YAAY,KAAK,WAAW,GAAG,CAAC;gBACvC,SAAS,CAAC,CAAC,CAAC,GAAG,oCAAkB,CAAC,mDAAmD,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;QACvG,CAAC,CAAC;QACF,gDAAgD;QAChD,MAAM,WAAW,GAAG,CAAC,MAA4B,EAAE,KAAa,EAAE,OAAkC,EAAiB,EAAE;YACrH,IAAI,OAAO,KAAK,SAAS;gBACvB,OAAO,6BAAa,CAAC,aAAa,CAAC,MAAM,CAAC,+BAA+B,CAAC,KAAK,CAAC,EAAE,MAAM,CAAC,+BAA+B,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC;YACvI,MAAM,CAAC,+BAA+B,CAAC,KAAK,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC;YACjE,MAAM,CAAC,+BAA+B,CAAC,KAAK,GAAG,CAAC,EAAE,OAAO,CAAC,SAAS,CAAC,CAAC;YACrE,OAAO,OAAO,CAAC;QACjB,CAAC,CAAC;QACF,yBAAyB;QACzB,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,WAAW,EAAE,MAAM,EAAE,EAAE,CAAC;YACpD,IAAI,CAAC,aAAa,GAAG,WAAW,CAAC,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC;YACtE,aAAa,CAAC,UAAU,EAAE,OAAO,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC;YACxD,KAAK,IAAI,MAAM,GAAG,CAAC,EAAE,MAAM,GAAG,WAAW,EAAE,MAAM,EAAE,EAAE,CAAC;gBACpD,IAAI,CAAC,aAAa,GAAG,WAAW,CAAC,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC;gBACtE,aAAa,CAAC,UAAU,EAAE,OAAO,EAAE,MAAM,EAAE,WAAW,CAAC,CAAC;gBACxD,IAAI,SAAS,KAAK,CAAC,IAAI,CAAC,oBAAoB,GAAG,6BAAa,CAAC,eAAe,CAAC,IAAI,CAAC,aAAa,EAAE,UAAU,EAAE,IAAI,CAAC,aAAa,EAAE,UAAU,EAAE,IAAI,CAAC,oBAAoB,CAAC,CAAC,EAAE,CAAC;oBACzK,MAAM,CAAC,GAAG,IAAI,CAAC,oBAAoB,CAAC,OAAO,CAAC,CAAC,CAAC;oBAC9C,IAAI,CAAC,GAAG,IAAI,EAAE,CAAC;wBACb,MAAM,YAAY,GAAG,MAAM,EAAE,OAAO,CAAC,WAAW,CAAC,CAAC,iBAAiB;wBACnE,MAAM,YAAY,GAAG,MAAM,EAAE,OAAO,CAAC,WAAW,CAAC;wBACjD,MAAM,GAAG,IAAI,CAAC,oBAAoB,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,4BAA4B;wBAC9E,2BAAY,CAAC,0BAA0B,CAAC,MAAM,CAAC,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,SAAS,EAAE,YAAY,CAAC,CAAC;wBACtG,2BAAY,CAAC,0BAA0B,CAAC,MAAM,CAAC,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,SAAS,EAAE,YAAY,CAAC,CAAC;wBACtG,IAAI,MAAM,CAAC,OAAO,CAAC,WAAW,IAAI,MAAM,CAAC,OAAO,CAAC,WAAW;4BAC1D,MAAM,CAAC,OAAO,CAAC,WAAW,CAAC,KAAK,GAAG,MAAM,CAAC,OAAO,CAAC,WAAW,CAAC,KAAK,GAAG,SAAS,CAAC,CAAC,uCAAuC;wBAC1H,IAAI,GAAG,CAAC,CAAC;wBACT,QAAQ,GAAG,IAAI,CAAC;oBAClB,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC;IACvC,CAAC;IACD;;;;;;OAMG;IACI,MAAM,CAAC,UAAU,CACtB,MAAiB,EAAE,cAAsB,mBAAQ,CAAC,mBAAmB,EAAE,SAAkB,KAAK;QAE9F,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC;YACnB,OAAO,IAAI,CAAC;QACd,OAAO,SAAS,KAAK,mBAAQ,CAAC,UAAU,CAAC,MAAM,EAAE,EAAE,YAAY,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,EAAE,CAAC,CAAC;IACtG,CAAC;CACF;AA7VD,kCA6VC","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*--------------------------------------------------------------------------------------------*/\n/** @packageDocumentation\n * @module CartesianGeometry\n */\n\nimport { CurveExtendMode, CurveExtendOptions, VariantCurveExtendParameter } from \"../curve/CurveExtendMode\";\nimport { CurveLocationDetailPair } from \"../curve/CurveLocationDetail\";\nimport { CurveOps } from \"../curve/CurveOps\";\nimport { LineSegment3d } from \"../curve/LineSegment3d\";\nimport { LineString3d } from \"../curve/LineString3d\";\nimport { Geometry } from \"../Geometry\";\nimport { GrowableXYZArray } from \"./GrowableXYZArray\";\nimport { IndexedXYZCollection } from \"./IndexedXYZCollection\";\nimport { Plane3dByOriginAndUnitNormal } from \"./Plane3dByOriginAndUnitNormal\";\nimport { Point3dArrayCarrier } from \"./Point3dArrayCarrier\";\nimport { Point3d, Vector3d } from \"./Point3dVector3d\";\nimport { PolylineCompressionContext } from \"./PolylineCompressionByEdgeOffset\";\nimport { Range1d } from \"./Range\";\n\n// cspell:word Puecker\n/**\n * PolylineOps is a collection of static methods operating on polylines.\n * @public\n */\nexport class PolylineOps {\n  /**\n   * Return a Range1d with the shortest and longest edge lengths of the polyline.\n   * @param points points to examine.\n   */\n  public static edgeLengthRange(points: Point3d[]): Range1d {\n    const range = Range1d.createNull();\n    for (let i = 1; i < points.length; i++) {\n      range.extendX(points[i - 1].distance(points[i]));\n    }\n    return range;\n  }\n  /**\n   * Return a simplified subset of given points.\n   * * Points are removed by the Douglas-Puecker algorithm, viz https://en.wikipedia.org/wiki/Ramer–Douglas–Peucker_algorithm\n   * * This is a global search, with multiple passes over the data.\n   * @param source input points.\n   * @param chordTolerance Points less than this distance from a retained edge may be ignored.\n   * Default is [[Geometry.smallMetricDistance]].\n   * @param keepSeam whether to preserve the endpoints of physically closed input.\n   * Default is false, meaning physically closed input points are treated cyclically, allowing removal of the seam.\n   */\n  public static compressByChordError(source: Point3d[], chordTolerance: number = Geometry.smallMetricDistance, keepSeam: boolean = false): Point3d[] {\n    return PolylineCompressionContext.compressPoint3dArrayByChordError(source, chordTolerance, keepSeam);\n  }\n  /**\n   * Return a simplified subset of given points, omitting a point if very close to its predecessor.\n   * * This is a local search, with a single pass over the data.\n   * * First and last points are always retained.\n   * @param source input points\n   * @param maxEdgeLength length of largest edge to be compressed out\n   * @see [[GrowableXYZArray.cloneCompressed]]\n   */\n  public static compressShortEdges(source: Point3d[] | IndexedXYZCollection, maxEdgeLength: number): Point3d[] {\n    const dest = GrowableXYZArray.create(source);\n    PolylineCompressionContext.compressInPlaceByShortEdgeLength(dest, maxEdgeLength);\n    return dest.getPoint3dArray();\n  }\n  /**\n   * Return a simplified subset of given points, omitting the middle of three successive points if the triangle they form is small.\n   * * This is a local search, with a single pass over the data.\n   * @param source input points\n   * @param maxTriangleArea area of largest triangle to compress\n   */\n  public static compressSmallTriangles(source: Point3d[], maxTriangleArea: number): Point3d[] {\n    const dest = GrowableXYZArray.create(source);\n    PolylineCompressionContext.compressInPlaceBySmallTriangleArea(dest, maxTriangleArea);\n    return dest.getPoint3dArray();\n  }\n\n  /**\n   * Return a simplified subset of given points, omitting points if close to the edge between neighboring points before and after\n   * * This is a local search, with a single pass over the data for each pass.\n   * @param source input points\n   * @param maxDistance omit points if this close to edge between points before and after\n   * @param numPass max number of times to run the filter.  numPass=2 is observed to behave well.\n   *\n   */\n  public static compressByPerpendicularDistance(source: Point3d[], maxDistance: number, numPass: number = 2): Point3d[] {\n    const dest = GrowableXYZArray.create(source);\n    let num0 = dest.length;\n    for (let pass = 0; pass < numPass; pass++) {\n      PolylineCompressionContext.compressInPlaceByPerpendicularDistance(dest, maxDistance);\n      const num1 = dest.length;\n      if (num1 === num0)\n        break;\n      num0 = num1;\n    }\n    return dest.getPoint3dArray();\n  }\n  private static squaredDistanceToInterpolatedPoint(pointQ: Point3d, point0: Point3d, fraction: number, point1: Point3d): number {\n    const g = 1.0 - fraction;\n    const dx = pointQ.x - (g * point0.x + fraction * point1.x);\n    const dy = pointQ.y - (g * point0.y + fraction * point1.y);\n    const dz = pointQ.z - (g * point0.z + fraction * point1.z);\n    return dx * dx + dy * dy + dz * dz;\n  }\n  /**\n   * test if either\n   *   * points[indexA] matches pointQ\n   *   * line from points[indexA] to points[indexB] overlaps points[indexA] to pointQ\n   * @param points\n   * @param pointQ\n   * @param tolerance\n   */\n  private static isDanglerConfiguration(points: Point3d[], indexA: number, indexB: number, pointQ: Point3d, squaredDistanceTolerance: number): boolean {\n    if (indexA < 0 || indexA >= points.length)\n      return false;\n    const pointA = points[indexA];\n    // simple point match ...\n    const d2Q = pointA.distanceSquared(pointQ);\n    if (d2Q <= squaredDistanceTolerance)\n      return true;\n    if (indexB < 0 || indexB >= points.length)\n      return false;\n    const pointB = points[indexB];\n    // The expensive test .. does newPoint double back to an interior or extrapolation of the final dest segment?\n    //\n    // or pointQ\n    const dot = pointA.dotVectorsToTargets(pointB, pointQ);\n    // simple case -- pointB..pointA..pointQ continues forward\n    if (dot <= 0.0)\n      return false;\n    const d2B = pointA.distanceSquared(pointB);\n    let distanceSquared;\n    if (d2Q >= d2B) {\n      //                        pointB----------------------------------->>>>>>> pointA\n      //          pointQ<<<<---------------------------------------------------------\n      const fraction = dot / d2Q; // safe to divide because of earlier d2Q test.\n      distanceSquared = this.squaredDistanceToInterpolatedPoint(pointB, pointA, fraction, pointQ);\n    } else {\n      //           pointB----------------------------------->>>>>>> pointA\n      //                         pointQ<<<<----------------------\n      const fraction = dot / d2B;\n      distanceSquared = this.squaredDistanceToInterpolatedPoint(pointQ, pointA, fraction, pointB);\n    }\n    return distanceSquared < squaredDistanceTolerance;\n  }\n  /**\n     * Return a simplified subset of given points, omitting points on \"danglers\" that depart and return on a single path.\n     * @param source input points\n     * @param closed if true, an edge returning to point 0 is implied even if final point does not match.\n     * @param tolerance tolerance for near-zero distance.\n     */\n  public static compressDanglers(source: Point3d[], closed: boolean = false, tolerance: number = Geometry.smallMetricDistance): Point3d[] {\n    let n = source.length;\n    const squaredDistanceTolerance = tolerance * tolerance;\n    if (closed)\n      while (n > 1 && source[n - 1].distanceSquared(source[0]) <= squaredDistanceTolerance)\n        n--;\n    const dest = [];\n    dest.push(source[0].clone());\n    for (let i = 1; i < n; i++) {\n      const newPoint = source[i];\n      while (this.isDanglerConfiguration(dest, dest.length - 1, dest.length - 2, newPoint, squaredDistanceTolerance))\n        dest.pop();\n      dest.push(newPoint.clone());\n    }\n    if (closed) {\n      // No purge moving backwards.   Last point\n      let leftIndex = 0;\n      let rightIndex = dest.length - 1;\n      while (rightIndex > leftIndex + 2) {\n        if (this.isDanglerConfiguration(dest, leftIndex, leftIndex + 1, dest[rightIndex], squaredDistanceTolerance)) {\n          leftIndex++;\n        } else if (this.isDanglerConfiguration(dest, rightIndex, rightIndex - 1, dest[leftIndex], squaredDistanceTolerance)) {\n          rightIndex--;\n        } else {\n          break;\n        }\n      }\n      if (rightIndex + 1 < dest.length)\n        dest.length = rightIndex + 1;\n      if (leftIndex > 0) {\n        dest.splice(0, leftIndex);\n      }\n    }\n    return dest;\n  }\n  /**\n   * Add closure points to a polyline or array of polylines\n   * @param data points.\n   */\n  public static addClosurePoint(data: Point3d[] | Point3d[][]) {\n    if (data.length === 0)\n      return;\n    const q0 = data[0];\n    if (Array.isArray(q0)) {\n      for (const child of data) {\n        if (Array.isArray(child))\n          this.addClosurePoint(child);\n      }\n      return;\n    }\n    const q1 = data[data.length - 1];\n    if (q0 instanceof Point3d && q1 instanceof Point3d && !q0.isAlmostEqual(q1)) {\n      (data as Point3d[]).push(q0.clone());\n    }\n  }\n  /**\n   * Remove closure points of a polyline or array of polylines\n   * @param data points.\n   */\n  public static removeClosurePoint(data: Point3d[] | Point3d[][]) {\n    if (data.length === 0)\n      return;\n    const q0 = data[0];\n    if (Array.isArray(q0)) {\n      for (const child of data) {\n        if (Array.isArray(child))\n          this.removeClosurePoint(child);\n      }\n      return;\n    }\n    const q1 = data[data.length - 1];\n    if (q0 instanceof Point3d && q1 instanceof Point3d && q0.isAlmostEqual(q1)) {\n      (data as Point3d[]).pop();\n    }\n  }\n  /**\n   * Create an array of planes.\n   * * First plane has origin at first centerline point, with unit normal directed at the next point.\n   * * Intermediate planes have origin at intermediate points, with unit normals computed from the average of unit vectors\n   *   along the incoming and outgoing segments.\n   * * Last plane has origin at last centerline point, with unit normal directed from previous point.\n   * * All sets of adjacent coincident points are reduced to a single point.\n   *    * Hence the output array may have fewer points than the centerline.\n   * * If there are one or fewer distinct input points, the return is undefined.\n   * @param centerline points to reside in output planes.\n   * @param wrapIfPhysicallyClosed if true and the first and last centerline points are the same, then the first and last\n   * output planes are averaged and equated (cloned). Default false.\n   */\n  public static createBisectorPlanesForDistinctPoints(\n    centerline: IndexedXYZCollection | Point3d[], wrapIfPhysicallyClosed: boolean = false,\n  ): Plane3dByOriginAndUnitNormal[] | undefined {\n    const packedPoints = PolylineOps.compressShortEdges(centerline, 2.0 * Geometry.smallMetricDistance);  // double the tolerance to ensure normalized vectors exist.\n    if (packedPoints.length < 2)\n      return undefined;\n    const bisectorPlanes: Plane3dByOriginAndUnitNormal[] = [];\n    const point0 = packedPoints[0];\n    const point1 = packedPoints[1];\n    const unit01 = Vector3d.createNormalizedStartEnd(point0, point1)!;\n    const perpendicular0 = Plane3dByOriginAndUnitNormal.create(point0, unit01)!;\n    const perpendicular1 = Plane3dByOriginAndUnitNormal.createXYPlane();\n    // FIRST point gets simple perpendicular\n    bisectorPlanes.push(perpendicular0.clone());\n    // Each intermediate point gets average of adjacent perpendiculars\n    for (let i = 1; i + 1 < packedPoints.length; i++) {\n      Vector3d.createNormalizedStartEnd(packedPoints[i], packedPoints[i + 1], unit01);\n      // remark: the prior pack should ensure the normalization is ok.  But if it fails, we ignore this point...\n      if (undefined !== Plane3dByOriginAndUnitNormal.create(packedPoints[i], unit01, perpendicular1)) {\n        const newBisectorNormal = perpendicular0.getNormalRef().interpolate(0.5, perpendicular1.getNormalRef());\n        const newBisectorPlane = Plane3dByOriginAndUnitNormal.create(packedPoints[i], newBisectorNormal);\n        if (undefined !== newBisectorPlane)\n          bisectorPlanes.push(newBisectorPlane);\n        perpendicular0.setFrom(perpendicular1);\n      }\n    }\n    // LAST point gets simple perpendicular inherited from last pass\n    bisectorPlanes.push(Plane3dByOriginAndUnitNormal.create(packedPoints[packedPoints.length - 1], perpendicular0.getNormalRef())!);\n    // reset end planes to their average plane, but leave them alone if the closure point is a cusp\n    const lastIndex = bisectorPlanes.length - 1;\n    if (lastIndex > 0 && wrapIfPhysicallyClosed) {\n      const firstPlane = bisectorPlanes[0];\n      const lastPlane = bisectorPlanes[lastIndex];\n      if (Geometry.isSamePoint3d(firstPlane.getOriginRef(), lastPlane.getOriginRef())) {\n        const newBisectorNormal = firstPlane.getNormalRef().plus(lastPlane.getNormalRef()); // could be zero vector at a cusp\n        const newBisectorPlane = Plane3dByOriginAndUnitNormal.create(firstPlane.getOriginRef(), newBisectorNormal);\n        if (undefined !== newBisectorPlane) {\n          bisectorPlanes[0] = newBisectorPlane;\n          bisectorPlanes[lastIndex] = Plane3dByOriginAndUnitNormal.create(lastPlane.getOriginRef(), newBisectorNormal)!;\n        }\n      }\n    }\n    return bisectorPlanes.length > 1 ? bisectorPlanes : undefined;\n  }\n\n  private static _workSegmentA?: LineSegment3d;\n  private static _workSegmentB?: LineSegment3d;\n  private static _workLocalDetailPair?: CurveLocationDetailPair;\n  /**\n   * Find smallest distance between polylines.\n   * * For polylines with many points, it is more efficient to use [[LineString3dRangeTreeContext.searchForClosestApproach]].\n   * @param pointsA first polyline\n   * @param extendA how to extend polylineA forward/backward\n   * @param pointsB second polyline\n   * @param extendB how to extend polylineB forward/backward\n   * @param dMax largest approach distance to consider\n   * @param result optional pre-allocated object to populate and return\n   * @returns pair of details, one for each polyline, with field values:\n   * * `a` is the closest approach distance\n   * * `point` is the point of closest approach\n   * * `fraction` is the global polyline fraction\n   * * `childDetail.a` is the segment index\n   * * `childDetail.fraction` is the local segment fraction\n   */\n  public static closestApproach(\n    pointsA: Point3d[] | IndexedXYZCollection,\n    extendA: VariantCurveExtendParameter,\n    pointsB: Point3d[] | IndexedXYZCollection,\n    extendB: VariantCurveExtendParameter,\n    dMax: number = Number.MAX_VALUE,\n    result?: CurveLocationDetailPair,\n  ): CurveLocationDetailPair | undefined {\n    if (Array.isArray(pointsA))\n      pointsA = new Point3dArrayCarrier(pointsA);\n    if (Array.isArray(pointsB))\n      pointsB = new Point3dArrayCarrier(pointsB);\n    let dMin = dMax;\n    let foundMin = false;\n    const numSegmentA = pointsA.length - 1;\n    const numSegmentB = pointsB.length - 1;\n    const extendSegA = [CurveExtendMode.None, CurveExtendMode.None];\n    const extendSegB = [CurveExtendMode.None, CurveExtendMode.None];\n    // lambda to set extension for first and last segment of a polyline\n    const convertExtend = (extendOut: CurveExtendMode[], extendIn: VariantCurveExtendParameter, segmentIndex: number, numSegments: number) => {\n      extendOut[0] = extendOut[1] = CurveExtendMode.None;\n      if (segmentIndex === 0)\n        extendOut[0] = CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extendIn, 0);\n      else if (segmentIndex === numSegments - 1)\n        extendOut[1] = CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extendIn, 1);\n    };\n    // lambda to extract LineSegment3d from polyline\n    const fillSegment = (points: IndexedXYZCollection, index: number, segment: LineSegment3d | undefined): LineSegment3d => {\n      if (segment === undefined)\n        return LineSegment3d.createCapture(points.getPoint3dAtUncheckedPointIndex(index), points.getPoint3dAtUncheckedPointIndex(index + 1));\n      points.getPoint3dAtUncheckedPointIndex(index, segment.point0Ref);\n      points.getPoint3dAtUncheckedPointIndex(index + 1, segment.point1Ref);\n      return segment;\n    };\n    // just test the segments\n    for (let indexA = 0; indexA < numSegmentA; indexA++) {\n      this._workSegmentA = fillSegment(pointsA, indexA, this._workSegmentA);\n      convertExtend(extendSegA, extendA, indexA, numSegmentA);\n      for (let indexB = 0; indexB < numSegmentB; indexB++) {\n        this._workSegmentB = fillSegment(pointsB, indexB, this._workSegmentB);\n        convertExtend(extendSegB, extendB, indexB, numSegmentB);\n        if (undefined !== (this._workLocalDetailPair = LineSegment3d.closestApproach(this._workSegmentA, extendSegA, this._workSegmentB, extendSegB, this._workLocalDetailPair))) {\n          const d = this._workLocalDetailPair.detailA.a;\n          if (d < dMin) {\n            const childDetailA = result?.detailA.childDetail; // save and reuse\n            const childDetailB = result?.detailB.childDetail;\n            result = this._workLocalDetailPair.clone(result); // overwrite previous result\n            LineString3d.convertLocalToGlobalDetail(result.detailA, indexA, numSegmentA, undefined, childDetailA);\n            LineString3d.convertLocalToGlobalDetail(result.detailB, indexB, numSegmentB, undefined, childDetailB);\n            if (result.detailA.childDetail && result.detailB.childDetail)\n              result.detailA.childDetail.curve = result.detailB.childDetail.curve = undefined; // no CurvePrimitives survive in output\n            dMin = d;\n            foundMin = true;\n          }\n        }\n      }\n    }\n    return foundMin ? result : undefined;\n  }\n  /**\n   * Checks if all points are colinear.\n   * * This test does not take point order into account.\n   * @param points array of points to check.\n   * @param distanceTol tolerance for co-linearity check, default is Geometry.smallMetricDistance.\n   * @param xyOnly if true, only XY coordinates are used for the check, ignoring z coordinate.\n   */\n  public static isColinear(\n    points: Point3d[], distanceTol: number = Geometry.smallMetricDistance, xyOnly: boolean = false,\n  ): boolean {\n    if (points.length < 3)\n      return true;\n    return undefined !== CurveOps.isColinear(points, { maxDeviation: distanceTol, xyColinear: xyOnly });\n  }\n}\n"]}

package/lib/cjs/geometry3d/Range.d.ts

@@ -22,9 +22,9 @@ export declare abstract class RangeBase {
     /** Return true if x is outside the range `[_EXTREME_NEGATIVE, _EXTREME_POSITIVE]' */
     static isExtremeValue(x: number): boolean;
     /** Return true if any x or y or z is outside the range `[_EXTREME_NEGATIVE, _EXTREME_POSITIVE]' */
-    static isExtremePoint3d(xyz: Point3d): boolean;
+    static isExtremePoint3d(xyz: XYAndZ): boolean;
     /** Return true if either of x,y is outside the range `[_EXTREME_NEGATIVE, _EXTREME_POSITIVE]' */
-    static isExtremePoint2d(xy: Point2d): boolean;
+    static isExtremePoint2d(xy: XAndY): boolean;
     /**
      * Return the min absolute distance from any point of `[lowA,highA]' to any point of `[lowB,highB]'.
      * * Both low,high pairs have order expectations:  The condition `high < low` means null interval.
@@ -114,17 +114,17 @@ export declare class Range3d extends RangeBase implements LowAndHighXYZ, BeJSONF
     /** Return a range initialized to have no content. */
     static createNull<T extends Range3d>(result?: T): T;
     /** Extend (modify in place) so that the range is large enough to include the supplied points. */
-    extend(...point: Point3d[]): void;
+    extend(...point: XYAndZ[]): void;
     /** Return a range large enough to include the supplied points. If no points are given, the range is a null range */
-    static create(...point: Point3d[]): Range3d;
+    static create(...point: XYAndZ[]): Range3d;
     /** Create a range from freely structured MultiLineStringDataVariant. */
-    static createFromVariantData(data: MultiLineStringDataVariant): Range3d;
+    static createFromVariantData(data: MultiLineStringDataVariant, transform?: Transform, result?: Range3d): Range3d;
     /** Create a Range3d enclosing the transformed points. */
-    static createTransformed<T extends Range3d>(transform: Transform, ...point: Point3d[]): T;
+    static createTransformed<T extends Range3d>(transform: Transform, ...point: XYAndZ[]): T;
     /** Create a Range3d enclosing the transformed points. */
-    static createTransformedArray<T extends Range3d>(transform: Transform, points: Point3d[] | GrowableXYZArray): T;
+    static createTransformedArray<T extends Range3d>(transform: Transform, points: XYAndZ[] | GrowableXYZArray): T;
     /** Create a Range3d enclosing the points after inverse transform. */
-    static createInverseTransformedArray<T extends Range3d>(transform: Transform, points: Point3d[] | GrowableXYZArray): T;
+    static createInverseTransformedArray<T extends Range3d>(transform: Transform, points: XYAndZ[] | GrowableXYZArray): T;
     /** Set the range to be a single point supplied as x,y,z values */
     setXYZ(x: number, y: number, z: number): void;
     /** Create a single point range */
@@ -136,11 +136,11 @@ export declare class Range3d extends RangeBase implements LowAndHighXYZ, BeJSONF
     /** Creates a 3d range from a 2d range's low and high members, setting the corresponding z values to the value given. */
     static createRange2d<T extends Range3d>(range: Range2d, z?: number, result?: T): T;
     /** Create a range around an array of points. */
-    static createArray<T extends Range3d>(points: Point3d[], result?: T): T;
+    static createArray<T extends Range3d>(points: XYAndZ[], result?: T): T;
     /** Extend a range around an array of points (optionally transformed) */
-    extendArray(points: Point3d[] | GrowableXYZArray, transform?: Transform): void;
+    extendArray(points: XYAndZ[] | GrowableXYZArray, transform?: Transform): void;
     /** Extend a range around an array of points (optionally transformed) */
-    extendInverseTransformedArray(points: Point3d[] | GrowableXYZArray, transform: Transform): void;
+    extendInverseTransformedArray(points: XYAndZ[] | GrowableXYZArray, transform: Transform): void;
     /** Multiply the point x,y,z by transform and use the coordinate to extend this range. */
     extendTransformedXYZ(transform: Transform, x: number, y: number, z: number): void;
     /** Multiply the point x,y,z,w by transform and use the coordinate to extend this range. */
@@ -209,7 +209,7 @@ export declare class Range3d extends RangeBase implements LowAndHighXYZ, BeJSONF
      * * returns undefined if the range is null.
      * * returns undefined if any direction (x,y,z) has zero length
      */
-    worldToLocal(point: Point3d, result?: Point3d): Point3d | undefined;
+    worldToLocal(point: XYAndZ, result?: Point3d): Point3d | undefined;
     /**
      * Return fractional coordinates of point within the range.
      * * returns undefined if the range is null.
@@ -255,9 +255,9 @@ export declare class Range3d extends RangeBase implements LowAndHighXYZ, BeJSONF
     /** Test if a point given as x,y is within the range (ignoring z of range). */
     containsXY(x: number, y: number): boolean;
     /** Test if a point is within the range. */
-    containsPoint(point: Point3d): boolean;
+    containsPoint(point: XYAndZ): boolean;
     /** Test if the x,y coordinates of a point are within the range. */
-    containsPointXY(point: Point3d): boolean;
+    containsPointXY(point: XYAndZ): boolean;
     /** Test of other range is within this range */
     containsRange(other: Range3d): boolean;
     /**
@@ -272,14 +272,18 @@ export declare class Range3d extends RangeBase implements LowAndHighXYZ, BeJSONF
      * @param margin optional signed distance by which to expand/shrink `other` in all xy-directions.
      */
     intersectsRangeXY(other: Range3d, margin?: number): boolean;
-    /** Return 0 if the point is within the range, otherwise the distance to the closest face or corner */
+    /** Return 0 if the point is within the range, otherwise the distance to the closest face or corner. */
     distanceToPoint(point: XYAndZ): number;
+    /** Return 0 if the point's xy-coordinates are within the range, otherwise the xy-distance to the closest face or corner. */
+    distanceToPointXY(point: XAndY): number;
     /** Returns 0 if the ranges have any overlap, otherwise the shortest absolute distance from one to the other. */
     distanceToRange(other: Range3d): number;
+    /** Returns 0 if the ranges have any xy-overlap, otherwise the shortest absolute xy-distance from one to the other. */
+    distanceToRangeXY(other: Range3d): number;
     /** Expand this range to include the given point. */
     extendXYZ(x: number, y: number, z: number): void;
     /** Expand this range by a point interpolated between given points. */
-    extendInterpolated(xyz0: Point3d, fraction: number, xyz1: Point3d): void;
+    extendInterpolated(xyz0: XYAndZ, fraction: number, xyz1: XYAndZ): void;
     /** Expand this range to include the x-coordinate. */
     extendXOnly(x: number): void;
     /** Expand this range to include the y-coordinate. */
@@ -291,9 +295,9 @@ export declare class Range3d extends RangeBase implements LowAndHighXYZ, BeJSONF
     /** Expand this range by distances a (weighted and possibly signed) in all directions */
     extendXYZW(x: number, y: number, z: number, w: number): void;
     /** Expand this range to include an optionally transformed point. */
-    extendPoint(point: Point3d, transform?: Transform): void;
+    extendPoint(point: XYAndZ, transform?: Transform): void;
     /** Expand this range to include a transformed point. */
-    extendTransformedPoint(transform: Transform, point: Point3d): void;
+    extendTransformedPoint(transform: Transform, point: XYAndZ): void;
     /** Expand this range to include a range. */
     extendRange(other: LowAndHighXYZ): void;
     /**
@@ -490,22 +494,20 @@ export declare class Range1d extends RangeBase {
      */
     expandInPlace(delta: number): void;
     /**
-     * Clip this range to a linear half space condition
-     * * if `limitA > limitB` the limit space is empty
-     *   * make this range null
-     *   * return false;
-     * * otherwise (i.e `limitA <= limitB`)
-     *   * solve `a + u * f = limitA' and `a + u * f = limitA`
-     *   * if unable to solve (i.e. u near zero), `a` alone determines whether to (a) leave this interval unchanged or
-     * (b) reduce to nothing.
-     *   * the `f` values are an interval in the space of this `Range1d`
-     *   * restrict the range to that interval (i.e intersect existing (low,high) with the fraction interval.
-     *   * return true if the range is non-null after the clip.
+     * Clip this range to a linear half space condition.
+     * * If `limitA > limitB` the limit space is empty:
+     *   * Make this range null.
+     *   * Return `false`.
+     * * Otherwise for `limitA <= limitB`:
+     *   * Solve `a + u * fA = limitA` and `a + u * fB = limitB`.
+     *   * If unable to solve (i.e. u near zero), `a` alone determines whether to leave this interval unchanged or reduce to null.
+     *   * Form an interval from the solution `{fA, fB}`.
+     *   * Clip this instance to the solution interval.
+     *   * Return `true` if the range is non-null after the clip.
      * @param a constant of linear map
      * @param u coefficient of linear map
      * @param limitA crossing value, assumed in range relation with limitB
      * @param limitB crossing value, assumed in range relation with limitB
-     * @param limitIsHigh true if the limit is an upper limit on mapped values.
      */
     clipLinearMapToInterval(a: number, u: number, limitA: number, limitB: number): boolean;
 }
@@ -573,7 +575,7 @@ export declare class Range2d extends RangeBase implements LowAndHighXY {
     /** Create a box with 2 pairs of xy candidates. If any direction has order flip, create null. */
     static createXYXYOrCorrectToNull<T extends Range2d>(xA: number, yA: number, xB: number, yB: number, result?: T): T;
     /** Create a range around an array of points. */
-    static createArray<T extends Range2d>(points: Point2d[], result?: T): T;
+    static createArray<T extends Range2d>(points: XAndY[], result?: T): T;
     /** Test if the box has high<low for any of x,y, condition. Note that a range around a single point is NOT null. */
     get isNull(): boolean;
     /**
@@ -663,6 +665,6 @@ export declare class Range2d extends RangeBase implements LowAndHighXY {
      * * returns undefined if the range is null.
      * * returns undefined if any direction (x,y) has zero length
      */
-    worldToLocal(point: Point2d, result?: Point2d): Point2d | undefined;
+    worldToLocal(point: XAndY, result?: Point2d): Point2d | undefined;
 }
 //# sourceMappingURL=Range.d.ts.map