@itwin/core-geometry 5.0.0-dev.2 → 5.0.0-dev.20

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

@@ -30,6 +30,7 @@ export declare class PolylineOps {
      * * This is a local search, with a single pass over the data.
      * @param source input points
      * @param maxEdgeLength
+     * @see [[GrowableXYZArray.cloneCompressed]]
      */
     static compressShortEdges(source: Point3d[] | IndexedXYZCollection, maxEdgeLength: number): Point3d[];
     /**
@@ -77,13 +78,15 @@ export declare class PolylineOps {
     static removeClosurePoint(data: Point3d[] | Point3d[][]): void;
     /** Create an array of planes.
      * * First plane has origin at first centerline point, with unit normal directed at the next point.
-     * * Intermediate planes have origin at intermediate points, with unit normals computed from the average of unit vectors along the incoming and outgoing segments.
+     * * Intermediate planes have origin at intermediate points, with unit normals computed from the average of unit vectors
+     *   along the incoming and outgoing segments.
      * * Last plane has origin at last centerline point, with unit normal directed from previous point.
      * * All sets of adjacent coincident points are reduced to a single point.
      *    * Hence the output array may have fewer points than the centerline.
-     * * If there are one or fewer distinct input points, the return is undefined
-     * @param centerline points to reside in output planes
-     * @param wrapIfPhysicallyClosed if true and the first and last centerline points are the same, then the first and last output planes are averaged and equated (cloned).
+     * * If there are one or fewer distinct input points, the return is undefined.
+     * @param centerline points to reside in output planes.
+     * @param wrapIfPhysicallyClosed if true and the first and last centerline points are the same, then the first and last
+     * output planes are averaged and equated (cloned). Default false.
      */
     static createBisectorPlanesForDistinctPoints(centerline: IndexedXYZCollection | Point3d[], wrapIfPhysicallyClosed?: boolean): Plane3dByOriginAndUnitNormal[] | undefined;
     private static _workSegmentA?;

package/lib/esm/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;;;;;OAKG;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;;;;;;;;;OASG;WACW,qCAAqC,CAAC,UAAU,EAAE,oBAAoB,GAAG,OAAO,EAAE,EAAE,sBAAsB,GAAE,OAAe,GAAG,4BAA4B,EAAE,GAAG,SAAS;IA2CtL,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;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;;;;;;OAMG;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;;;;;;;;;;;OAWG;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"}

package/lib/esm/geometry3d/PolylineOps.js

@@ -47,6 +47,7 @@ export class PolylineOps {
      * * This is a local search, with a single pass over the data.
      * @param source input points
      * @param maxEdgeLength
+     * @see [[GrowableXYZArray.cloneCompressed]]
      */
     static compressShortEdges(source, maxEdgeLength) {
         const dest = GrowableXYZArray.create(source);
@@ -218,13 +219,15 @@ export class PolylineOps {
     }
     /** Create an array of planes.
      * * First plane has origin at first centerline point, with unit normal directed at the next point.
-     * * Intermediate planes have origin at intermediate points, with unit normals computed from the average of unit vectors along the incoming and outgoing segments.
+     * * Intermediate planes have origin at intermediate points, with unit normals computed from the average of unit vectors
+     *   along the incoming and outgoing segments.
      * * Last plane has origin at last centerline point, with unit normal directed from previous point.
      * * All sets of adjacent coincident points are reduced to a single point.
      *    * Hence the output array may have fewer points than the centerline.
-     * * If there are one or fewer distinct input points, the return is undefined
-     * @param centerline points to reside in output planes
-     * @param wrapIfPhysicallyClosed if true and the first and last centerline points are the same, then the first and last output planes are averaged and equated (cloned).
+     * * If there are one or fewer distinct input points, the return is undefined.
+     * @param centerline points to reside in output planes.
+     * @param wrapIfPhysicallyClosed if true and the first and last centerline points are the same, then the first and last
+     * output planes are averaged and equated (cloned). Default false.
      */
     static createBisectorPlanesForDistinctPoints(centerline, wrapIfPhysicallyClosed = false) {
         const packedPoints = PolylineOps.compressShortEdges(centerline, 2.0 * Geometry.smallMetricDistance); // double the tolerance to ensure normalized vectors exist.

package/lib/esm/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,OAAO,EAAE,eAAe,EAAE,kBAAkB,EAA+B,MAAM,0BAA0B,CAAC;AAE5G,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AACvD,OAAO,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AACrD,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AACvC,OAAO,EAAE,gBAAgB,EAAE,MAAM,oBAAoB,CAAC;AAEtD,OAAO,EAAE,4BAA4B,EAAE,MAAM,gCAAgC,CAAC;AAC9E,OAAO,EAAE,mBAAmB,EAAE,MAAM,uBAAuB,CAAC;AAC5D,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,mBAAmB,CAAC;AACtD,OAAO,EAAE,0BAA0B,EAAE,MAAM,mCAAmC,CAAC;AAC/E,OAAO,EAAE,OAAO,EAAE,MAAM,SAAS,CAAC;AAElC,sBAAsB;AACtB;;;GAGG;AACH,MAAM,OAAO,WAAW;IACtB;;;OAGG;IACI,MAAM,CAAC,eAAe,CAAC,MAAiB;QAC7C,MAAM,KAAK,GAAG,OAAO,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,0BAA0B,CAAC,gCAAgC,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC;IAC7F,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,kBAAkB,CAAC,MAAwC,EAAE,aAAqB;QAC9F,MAAM,IAAI,GAAG,gBAAgB,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC7C,0BAA0B,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,gBAAgB,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC7C,0BAA0B,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,gBAAgB,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,0BAA0B,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,QAAQ,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,OAAO,IAAI,EAAE,YAAY,OAAO,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,OAAO,IAAI,EAAE,YAAY,OAAO,IAAI,EAAE,CAAC,aAAa,CAAC,EAAE,CAAC,EAAE,CAAC;YAC1E,IAAkB,CAAC,GAAG,EAAE,CAAC;QAC5B,CAAC;IACH,CAAC;IACD;;;;;;;;;OASG;IACI,MAAM,CAAC,qCAAqC,CAAC,UAA4C,EAAE,yBAAkC,KAAK;QACvI,MAAM,YAAY,GAAG,WAAW,CAAC,kBAAkB,CAAC,UAAU,EAAE,GAAG,GAAG,QAAQ,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,QAAQ,CAAC,wBAAwB,CAAC,MAAM,EAAE,MAAM,CAAE,CAAC;QAClE,MAAM,cAAc,GAAG,4BAA4B,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAE,CAAC;QAC5E,MAAM,cAAc,GAAG,4BAA4B,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,QAAQ,CAAC,wBAAwB,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;YAChF,0GAA0G;YAC1G,IAAI,SAAS,KAAK,4BAA4B,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,4BAA4B,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,4BAA4B,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,QAAQ,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,4BAA4B,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,4BAA4B,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;IAKD;;;;;;;;;;;;;;;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,mBAAmB,CAAC,OAAO,CAAC,CAAC;QAC7C,IAAI,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC;YACxB,OAAO,GAAG,IAAI,mBAAmB,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,eAAe,CAAC,IAAI,EAAE,eAAe,CAAC,IAAI,CAAC,CAAC;QAChE,MAAM,UAAU,GAAG,CAAC,eAAe,CAAC,IAAI,EAAE,eAAe,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,eAAe,CAAC,IAAI,CAAC;YACnD,IAAI,YAAY,KAAK,CAAC;gBACpB,SAAS,CAAC,CAAC,CAAC,GAAG,kBAAkB,CAAC,mDAAmD,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;iBAChG,IAAI,YAAY,KAAK,WAAW,GAAG,CAAC;gBACvC,SAAS,CAAC,CAAC,CAAC,GAAG,kBAAkB,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,aAAa,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,aAAa,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,YAAY,CAAC,0BAA0B,CAAC,MAAM,CAAC,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,SAAS,EAAE,YAAY,CAAC,CAAC;wBACtG,YAAY,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","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @packageDocumentation\r\n * @module CartesianGeometry\r\n */\r\n\r\nimport { CurveExtendMode, CurveExtendOptions, VariantCurveExtendParameter } from \"../curve/CurveExtendMode\";\r\nimport { CurveLocationDetailPair } from \"../curve/CurveLocationDetail\";\r\nimport { LineSegment3d } from \"../curve/LineSegment3d\";\r\nimport { LineString3d } from \"../curve/LineString3d\";\r\nimport { Geometry } from \"../Geometry\";\r\nimport { GrowableXYZArray } from \"./GrowableXYZArray\";\r\nimport { IndexedXYZCollection } from \"./IndexedXYZCollection\";\r\nimport { Plane3dByOriginAndUnitNormal } from \"./Plane3dByOriginAndUnitNormal\";\r\nimport { Point3dArrayCarrier } from \"./Point3dArrayCarrier\";\r\nimport { Point3d, Vector3d } from \"./Point3dVector3d\";\r\nimport { PolylineCompressionContext } from \"./PolylineCompressionByEdgeOffset\";\r\nimport { Range1d } from \"./Range\";\r\n\r\n// cspell:word Puecker\r\n/**\r\n * PolylineOps is a collection of static methods operating on polylines.\r\n * @public\r\n */\r\nexport class PolylineOps {\r\n  /**\r\n   * Return a Range1d with the shortest and longest edge lengths of the polyline.\r\n   * @param points points to examine.\r\n   */\r\n  public static edgeLengthRange(points: Point3d[]): Range1d {\r\n    const range = Range1d.createNull();\r\n    for (let i = 1; i < points.length; i++) {\r\n      range.extendX(points[i - 1].distance(points[i]));\r\n    }\r\n    return range;\r\n  }\r\n  /**\r\n   * Return a simplified subset of given points.\r\n   * * Points are removed by the Douglas-Puecker algorithm, viz https://en.wikipedia.org/wiki/Ramer–Douglas–Peucker_algorithm\r\n   * * This is a global search, with multiple passes over the data.\r\n   * @param source\r\n   * @param chordTolerance\r\n   */\r\n  public static compressByChordError(source: Point3d[], chordTolerance: number): Point3d[] {\r\n    return PolylineCompressionContext.compressPoint3dArrayByChordError(source, chordTolerance);\r\n  }\r\n  /**\r\n   * Return a simplified subset of given points, omitting points if very close to their neighbors.\r\n   * * This is a local search, with a single pass over the data.\r\n   * @param source input points\r\n   * @param maxEdgeLength\r\n   */\r\n  public static compressShortEdges(source: Point3d[] | IndexedXYZCollection, maxEdgeLength: number): Point3d[] {\r\n    const dest = GrowableXYZArray.create(source);\r\n    PolylineCompressionContext.compressInPlaceByShortEdgeLength(dest, maxEdgeLength);\r\n    return dest.getPoint3dArray();\r\n  }\r\n  /**\r\n   * Return a simplified subset of given points, omitting points of the triangle with adjacent points is small.\r\n   * * This is a local search, with a single pass over the data.\r\n   * @param source input points\r\n   * @param maxEdgeLength\r\n   */\r\n  public static compressSmallTriangles(source: Point3d[], maxTriangleArea: number): Point3d[] {\r\n    const dest = GrowableXYZArray.create(source);\r\n    PolylineCompressionContext.compressInPlaceBySmallTriangleArea(dest, maxTriangleArea);\r\n    return dest.getPoint3dArray();\r\n  }\r\n\r\n  /**\r\n   * Return a simplified subset of given points, omitting points if close to the edge between neighboring points before and after\r\n   * * This is a local search, with a single pass over the data for each pass.\r\n   * @param source input points\r\n   * @param maxDistance omit points if this close to edge between points before and after\r\n   * @param numPass max number of times to run the filter.  numPass=2 is observed to behave well.\r\n   *\r\n   */\r\n  public static compressByPerpendicularDistance(source: Point3d[], maxDistance: number, numPass: number = 2): Point3d[] {\r\n    const dest = GrowableXYZArray.create(source);\r\n    let num0 = dest.length;\r\n    for (let pass = 0; pass < numPass; pass++) {\r\n      PolylineCompressionContext.compressInPlaceByPerpendicularDistance(dest, maxDistance);\r\n      const num1 = dest.length;\r\n      if (num1 === num0)\r\n        break;\r\n      num0 = num1;\r\n    }\r\n    return dest.getPoint3dArray();\r\n  }\r\n  private static squaredDistanceToInterpolatedPoint(pointQ: Point3d, point0: Point3d, fraction: number, point1: Point3d): number {\r\n    const g = 1.0 - fraction;\r\n    const dx = pointQ.x - (g * point0.x + fraction * point1.x);\r\n    const dy = pointQ.y - (g * point0.y + fraction * point1.y);\r\n    const dz = pointQ.z - (g * point0.z + fraction * point1.z);\r\n    return dx * dx + dy * dy + dz * dz;\r\n  }\r\n  /**\r\n   * test if either\r\n   *   * points[indexA] matches pointQ\r\n   *   * line from points[indexA] to points[indexB] overlaps points[indexA] to pointQ\r\n   * @param points\r\n   * @param pointQ\r\n   * @param tolerance\r\n   */\r\n  private static isDanglerConfiguration(points: Point3d[], indexA: number, indexB: number, pointQ: Point3d, squaredDistanceTolerance: number): boolean {\r\n    if (indexA < 0 || indexA >= points.length)\r\n      return false;\r\n    const pointA = points[indexA];\r\n    // simple point match ...\r\n    const d2Q = pointA.distanceSquared(pointQ);\r\n    if (d2Q <= squaredDistanceTolerance)\r\n      return true;\r\n    if (indexB < 0 || indexB >= points.length)\r\n      return false;\r\n    const pointB = points[indexB];\r\n    // The expensive test .. does newPoint double back to an interior or extrapolation of the final dest segment?\r\n    //\r\n    // or pointQ\r\n    const dot = pointA.dotVectorsToTargets(pointB, pointQ);\r\n    // simple case -- pointB..pointA..pointQ continues forward\r\n    if (dot <= 0.0)\r\n      return false;\r\n    const d2B = pointA.distanceSquared(pointB);\r\n    let distanceSquared;\r\n    if (d2Q >= d2B) {\r\n      //                        pointB----------------------------------->>>>>>> pointA\r\n      //          pointQ<<<<---------------------------------------------------------\r\n      const fraction = dot / d2Q; // safe to divide because of earlier d2Q test.\r\n      distanceSquared = this.squaredDistanceToInterpolatedPoint(pointB, pointA, fraction, pointQ);\r\n    } else {\r\n      //           pointB----------------------------------->>>>>>> pointA\r\n      //                         pointQ<<<<----------------------\r\n      const fraction = dot / d2B;\r\n      distanceSquared = this.squaredDistanceToInterpolatedPoint(pointQ, pointA, fraction, pointB);\r\n    }\r\n    return distanceSquared < squaredDistanceTolerance;\r\n  }\r\n  /**\r\n     * Return a simplified subset of given points, omitting points on \"danglers\" that depart and return on a single path.\r\n     * @param source input points\r\n     * @param closed if true, an edge returning to point 0 is implied even if final point does not match.\r\n     * @param tolerance tolerance for near-zero distance.\r\n     */\r\n  public static compressDanglers(source: Point3d[], closed: boolean = false, tolerance: number = Geometry.smallMetricDistance): Point3d[] {\r\n    let n = source.length;\r\n    const squaredDistanceTolerance = tolerance * tolerance;\r\n    if (closed)\r\n      while (n > 1 && source[n - 1].distanceSquared(source[0]) <= squaredDistanceTolerance)\r\n        n--;\r\n    const dest = [];\r\n    dest.push(source[0].clone());\r\n    for (let i = 1; i < n; i++) {\r\n      const newPoint = source[i];\r\n      while (this.isDanglerConfiguration(dest, dest.length - 1, dest.length - 2, newPoint, squaredDistanceTolerance))\r\n        dest.pop();\r\n      dest.push(newPoint.clone());\r\n    }\r\n    if (closed) {\r\n      // No purge moving backwards.   Last point\r\n      let leftIndex = 0;\r\n      let rightIndex = dest.length - 1;\r\n      while (rightIndex > leftIndex + 2) {\r\n        if (this.isDanglerConfiguration(dest, leftIndex, leftIndex + 1, dest[rightIndex], squaredDistanceTolerance)) {\r\n          leftIndex++;\r\n        } else if (this.isDanglerConfiguration(dest, rightIndex, rightIndex - 1, dest[leftIndex], squaredDistanceTolerance)) {\r\n          rightIndex--;\r\n        } else {\r\n          break;\r\n        }\r\n      }\r\n      if (rightIndex + 1 < dest.length)\r\n        dest.length = rightIndex + 1;\r\n      if (leftIndex > 0) {\r\n        dest.splice(0, leftIndex);\r\n      }\r\n    }\r\n    return dest;\r\n  }\r\n  /**\r\n   * Add closure points to a polyline or array of polylines\r\n   * @param data points.\r\n   */\r\n  public static addClosurePoint(data: Point3d[] | Point3d[][]) {\r\n    if (data.length === 0)\r\n      return;\r\n    const q0 = data[0];\r\n    if (Array.isArray(q0)) {\r\n      for (const child of data) {\r\n        if (Array.isArray(child))\r\n          this.addClosurePoint(child);\r\n      }\r\n      return;\r\n    }\r\n    const q1 = data[data.length - 1];\r\n    if (q0 instanceof Point3d && q1 instanceof Point3d && !q0.isAlmostEqual(q1)) {\r\n      (data as Point3d[]).push(q0.clone());\r\n    }\r\n  }\r\n  /**\r\n   * Remove closure points of a polyline or array of polylines\r\n   * @param data points.\r\n   */\r\n  public static removeClosurePoint(data: Point3d[] | Point3d[][]) {\r\n    if (data.length === 0)\r\n      return;\r\n    const q0 = data[0];\r\n    if (Array.isArray(q0)) {\r\n      for (const child of data) {\r\n        if (Array.isArray(child))\r\n          this.removeClosurePoint(child);\r\n      }\r\n      return;\r\n    }\r\n    const q1 = data[data.length - 1];\r\n    if (q0 instanceof Point3d && q1 instanceof Point3d && q0.isAlmostEqual(q1)) {\r\n      (data as Point3d[]).pop();\r\n    }\r\n  }\r\n  /** Create an array of planes.\r\n   * * First plane has origin at first centerline point, with unit normal directed at the next point.\r\n   * * Intermediate planes have origin at intermediate points, with unit normals computed from the average of unit vectors along the incoming and outgoing segments.\r\n   * * Last plane has origin at last centerline point, with unit normal directed from previous point.\r\n   * * All sets of adjacent coincident points are reduced to a single point.\r\n   *    * Hence the output array may have fewer points than the centerline.\r\n   * * If there are one or fewer distinct input points, the return is undefined\r\n   * @param centerline points to reside in output planes\r\n   * @param wrapIfPhysicallyClosed if true and the first and last centerline points are the same, then the first and last output planes are averaged and equated (cloned).\r\n   */\r\n  public static createBisectorPlanesForDistinctPoints(centerline: IndexedXYZCollection | Point3d[], wrapIfPhysicallyClosed: boolean = false): Plane3dByOriginAndUnitNormal[] | undefined {\r\n    const packedPoints = PolylineOps.compressShortEdges(centerline, 2.0 * Geometry.smallMetricDistance);  // double the tolerance to ensure normalized vectors exist.\r\n    if (packedPoints.length < 2)\r\n      return undefined;\r\n    const bisectorPlanes: Plane3dByOriginAndUnitNormal[] = [];\r\n    const point0 = packedPoints[0];\r\n    const point1 = packedPoints[1];\r\n    const unit01 = Vector3d.createNormalizedStartEnd(point0, point1)!;\r\n    const perpendicular0 = Plane3dByOriginAndUnitNormal.create(point0, unit01)!;\r\n    const perpendicular1 = Plane3dByOriginAndUnitNormal.createXYPlane();\r\n    // FIRST point gets simple perpendicular\r\n    bisectorPlanes.push(perpendicular0.clone());\r\n    // Each intermediate point gets average of adjacent perpendiculars\r\n    for (let i = 1; i + 1 < packedPoints.length; i++) {\r\n      Vector3d.createNormalizedStartEnd(packedPoints[i], packedPoints[i + 1], unit01);\r\n      // remark: the prior pack should ensure the normalization is ok.  But if it fails, we ignore this point...\r\n      if (undefined !== Plane3dByOriginAndUnitNormal.create(packedPoints[i], unit01, perpendicular1)) {\r\n        const newBisectorNormal = perpendicular0.getNormalRef().interpolate(0.5, perpendicular1.getNormalRef());\r\n        const newBisectorPlane = Plane3dByOriginAndUnitNormal.create(packedPoints[i], newBisectorNormal);\r\n        if (undefined !== newBisectorPlane)\r\n          bisectorPlanes.push(newBisectorPlane);\r\n        perpendicular0.setFrom(perpendicular1);\r\n      }\r\n    }\r\n    // LAST point gets simple perpendicular inherited from last pass\r\n    bisectorPlanes.push(Plane3dByOriginAndUnitNormal.create(packedPoints[packedPoints.length - 1], perpendicular0.getNormalRef())!);\r\n    // reset end planes to their average plane, but leave them alone if the closure point is a cusp\r\n    const lastIndex = bisectorPlanes.length - 1;\r\n    if (lastIndex > 0 && wrapIfPhysicallyClosed) {\r\n      const firstPlane = bisectorPlanes[0];\r\n      const lastPlane = bisectorPlanes[lastIndex];\r\n      if (Geometry.isSamePoint3d(firstPlane.getOriginRef(), lastPlane.getOriginRef())) {\r\n        const newBisectorNormal = firstPlane.getNormalRef().plus(lastPlane.getNormalRef()); // could be zero vector at a cusp\r\n        const newBisectorPlane = Plane3dByOriginAndUnitNormal.create(firstPlane.getOriginRef(), newBisectorNormal);\r\n        if (undefined !== newBisectorPlane) {\r\n          bisectorPlanes[0] = newBisectorPlane;\r\n          bisectorPlanes[lastIndex] = Plane3dByOriginAndUnitNormal.create(lastPlane.getOriginRef(), newBisectorNormal)!;\r\n        }\r\n      }\r\n    }\r\n    return bisectorPlanes.length > 1 ? bisectorPlanes : undefined;\r\n  }\r\n\r\n  private static _workSegmentA?: LineSegment3d;\r\n  private static _workSegmentB?: LineSegment3d;\r\n  private static _workLocalDetailPair?: CurveLocationDetailPair;\r\n  /**\r\n   * Find smallest distance between polylines.\r\n   * * For polylines with many points, it is more efficient to use [[LineString3dRangeTreeContext.searchForClosestApproach]].\r\n   * @param pointsA first polyline\r\n   * @param extendA how to extend polylineA forward/backward\r\n   * @param pointsB second polyline\r\n   * @param extendB how to extend polylineB forward/backward\r\n   * @param dMax largest approach distance to consider\r\n   * @param result optional pre-allocated object to populate and return\r\n   * @returns pair of details, one for each polyline, with field values:\r\n   * * `a` is the closest approach distance\r\n   * * `point` is the point of closest approach\r\n   * * `fraction` is the global polyline fraction\r\n   * * `childDetail.a` is the segment index\r\n   * * `childDetail.fraction` is the local segment fraction\r\n   */\r\n  public static closestApproach(\r\n    pointsA: Point3d[] | IndexedXYZCollection,\r\n    extendA: VariantCurveExtendParameter,\r\n    pointsB: Point3d[] | IndexedXYZCollection,\r\n    extendB: VariantCurveExtendParameter,\r\n    dMax: number = Number.MAX_VALUE,\r\n    result?: CurveLocationDetailPair,\r\n  ): CurveLocationDetailPair | undefined {\r\n    if (Array.isArray(pointsA))\r\n      pointsA = new Point3dArrayCarrier(pointsA);\r\n    if (Array.isArray(pointsB))\r\n      pointsB = new Point3dArrayCarrier(pointsB);\r\n    let dMin = dMax;\r\n    let foundMin = false;\r\n    const numSegmentA = pointsA.length - 1;\r\n    const numSegmentB = pointsB.length - 1;\r\n    const extendSegA = [CurveExtendMode.None, CurveExtendMode.None];\r\n    const extendSegB = [CurveExtendMode.None, CurveExtendMode.None];\r\n    // lambda to set extension for first and last segment of a polyline\r\n    const convertExtend = (extendOut: CurveExtendMode[], extendIn: VariantCurveExtendParameter, segmentIndex: number, numSegments: number) => {\r\n      extendOut[0] = extendOut[1] = CurveExtendMode.None;\r\n      if (segmentIndex === 0)\r\n        extendOut[0] = CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extendIn, 0);\r\n      else if (segmentIndex === numSegments - 1)\r\n        extendOut[1] = CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extendIn, 1);\r\n    };\r\n    // lambda to extract LineSegment3d from polyline\r\n    const fillSegment = (points: IndexedXYZCollection, index: number, segment: LineSegment3d | undefined): LineSegment3d => {\r\n      if (segment === undefined)\r\n        return LineSegment3d.createCapture(points.getPoint3dAtUncheckedPointIndex(index), points.getPoint3dAtUncheckedPointIndex(index + 1));\r\n      points.getPoint3dAtUncheckedPointIndex(index, segment.point0Ref);\r\n      points.getPoint3dAtUncheckedPointIndex(index + 1, segment.point1Ref);\r\n      return segment;\r\n    };\r\n    // just test the segments\r\n    for (let indexA = 0; indexA < numSegmentA; indexA++) {\r\n      this._workSegmentA = fillSegment(pointsA, indexA, this._workSegmentA);\r\n      convertExtend(extendSegA, extendA, indexA, numSegmentA);\r\n      for (let indexB = 0; indexB < numSegmentB; indexB++) {\r\n        this._workSegmentB = fillSegment(pointsB, indexB, this._workSegmentB);\r\n        convertExtend(extendSegB, extendB, indexB, numSegmentB);\r\n        if (undefined !== (this._workLocalDetailPair = LineSegment3d.closestApproach(this._workSegmentA, extendSegA, this._workSegmentB, extendSegB, this._workLocalDetailPair))) {\r\n          const d = this._workLocalDetailPair.detailA.a;\r\n          if (d < dMin) {\r\n            const childDetailA = result?.detailA.childDetail; // save and reuse\r\n            const childDetailB = result?.detailB.childDetail;\r\n            result = this._workLocalDetailPair.clone(result); // overwrite previous result\r\n            LineString3d.convertLocalToGlobalDetail(result.detailA, indexA, numSegmentA, undefined, childDetailA);\r\n            LineString3d.convertLocalToGlobalDetail(result.detailB, indexB, numSegmentB, undefined, childDetailB);\r\n            if (result.detailA.childDetail && result.detailB.childDetail)\r\n              result.detailA.childDetail.curve = result.detailB.childDetail.curve = undefined; // no CurvePrimitives survive in output\r\n            dMin = d;\r\n            foundMin = true;\r\n          }\r\n        }\r\n      }\r\n    }\r\n    return foundMin ? result : undefined;\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"PolylineOps.js","sourceRoot":"","sources":["../../../src/geometry3d/PolylineOps.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH,OAAO,EAAE,eAAe,EAAE,kBAAkB,EAA+B,MAAM,0BAA0B,CAAC;AAE5G,OAAO,EAAE,aAAa,EAAE,MAAM,wBAAwB,CAAC;AACvD,OAAO,EAAE,YAAY,EAAE,MAAM,uBAAuB,CAAC;AACrD,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AACvC,OAAO,EAAE,gBAAgB,EAAE,MAAM,oBAAoB,CAAC;AAEtD,OAAO,EAAE,4BAA4B,EAAE,MAAM,gCAAgC,CAAC;AAC9E,OAAO,EAAE,mBAAmB,EAAE,MAAM,uBAAuB,CAAC;AAC5D,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,mBAAmB,CAAC;AACtD,OAAO,EAAE,0BAA0B,EAAE,MAAM,mCAAmC,CAAC;AAC/E,OAAO,EAAE,OAAO,EAAE,MAAM,SAAS,CAAC;AAElC,sBAAsB;AACtB;;;GAGG;AACH,MAAM,OAAO,WAAW;IACtB;;;OAGG;IACI,MAAM,CAAC,eAAe,CAAC,MAAiB;QAC7C,MAAM,KAAK,GAAG,OAAO,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,0BAA0B,CAAC,gCAAgC,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC;IAC7F,CAAC;IACD;;;;;;OAMG;IACI,MAAM,CAAC,kBAAkB,CAAC,MAAwC,EAAE,aAAqB;QAC9F,MAAM,IAAI,GAAG,gBAAgB,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC7C,0BAA0B,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,gBAAgB,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAC7C,0BAA0B,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,gBAAgB,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,0BAA0B,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,QAAQ,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,OAAO,IAAI,EAAE,YAAY,OAAO,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,OAAO,IAAI,EAAE,YAAY,OAAO,IAAI,EAAE,CAAC,aAAa,CAAC,EAAE,CAAC,EAAE,CAAC;YAC1E,IAAkB,CAAC,GAAG,EAAE,CAAC;QAC5B,CAAC;IACH,CAAC;IACD;;;;;;;;;;;OAWG;IACI,MAAM,CAAC,qCAAqC,CACjD,UAA4C,EAAE,yBAAkC,KAAK;QAErF,MAAM,YAAY,GAAG,WAAW,CAAC,kBAAkB,CAAC,UAAU,EAAE,GAAG,GAAG,QAAQ,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,QAAQ,CAAC,wBAAwB,CAAC,MAAM,EAAE,MAAM,CAAE,CAAC;QAClE,MAAM,cAAc,GAAG,4BAA4B,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAE,CAAC;QAC5E,MAAM,cAAc,GAAG,4BAA4B,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,QAAQ,CAAC,wBAAwB,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;YAChF,0GAA0G;YAC1G,IAAI,SAAS,KAAK,4BAA4B,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,4BAA4B,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,4BAA4B,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,QAAQ,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,4BAA4B,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,4BAA4B,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;IAKD;;;;;;;;;;;;;;;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,mBAAmB,CAAC,OAAO,CAAC,CAAC;QAC7C,IAAI,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC;YACxB,OAAO,GAAG,IAAI,mBAAmB,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,eAAe,CAAC,IAAI,EAAE,eAAe,CAAC,IAAI,CAAC,CAAC;QAChE,MAAM,UAAU,GAAG,CAAC,eAAe,CAAC,IAAI,EAAE,eAAe,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,eAAe,CAAC,IAAI,CAAC;YACnD,IAAI,YAAY,KAAK,CAAC;gBACpB,SAAS,CAAC,CAAC,CAAC,GAAG,kBAAkB,CAAC,mDAAmD,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;iBAChG,IAAI,YAAY,KAAK,WAAW,GAAG,CAAC;gBACvC,SAAS,CAAC,CAAC,CAAC,GAAG,kBAAkB,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,aAAa,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,aAAa,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,YAAY,CAAC,0BAA0B,CAAC,MAAM,CAAC,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,SAAS,EAAE,YAAY,CAAC,CAAC;wBACtG,YAAY,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","sourcesContent":["/*---------------------------------------------------------------------------------------------\r\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\r\n* See LICENSE.md in the project root for license terms and full copyright notice.\r\n*--------------------------------------------------------------------------------------------*/\r\n/** @packageDocumentation\r\n * @module CartesianGeometry\r\n */\r\n\r\nimport { CurveExtendMode, CurveExtendOptions, VariantCurveExtendParameter } from \"../curve/CurveExtendMode\";\r\nimport { CurveLocationDetailPair } from \"../curve/CurveLocationDetail\";\r\nimport { LineSegment3d } from \"../curve/LineSegment3d\";\r\nimport { LineString3d } from \"../curve/LineString3d\";\r\nimport { Geometry } from \"../Geometry\";\r\nimport { GrowableXYZArray } from \"./GrowableXYZArray\";\r\nimport { IndexedXYZCollection } from \"./IndexedXYZCollection\";\r\nimport { Plane3dByOriginAndUnitNormal } from \"./Plane3dByOriginAndUnitNormal\";\r\nimport { Point3dArrayCarrier } from \"./Point3dArrayCarrier\";\r\nimport { Point3d, Vector3d } from \"./Point3dVector3d\";\r\nimport { PolylineCompressionContext } from \"./PolylineCompressionByEdgeOffset\";\r\nimport { Range1d } from \"./Range\";\r\n\r\n// cspell:word Puecker\r\n/**\r\n * PolylineOps is a collection of static methods operating on polylines.\r\n * @public\r\n */\r\nexport class PolylineOps {\r\n  /**\r\n   * Return a Range1d with the shortest and longest edge lengths of the polyline.\r\n   * @param points points to examine.\r\n   */\r\n  public static edgeLengthRange(points: Point3d[]): Range1d {\r\n    const range = Range1d.createNull();\r\n    for (let i = 1; i < points.length; i++) {\r\n      range.extendX(points[i - 1].distance(points[i]));\r\n    }\r\n    return range;\r\n  }\r\n  /**\r\n   * Return a simplified subset of given points.\r\n   * * Points are removed by the Douglas-Puecker algorithm, viz https://en.wikipedia.org/wiki/Ramer–Douglas–Peucker_algorithm\r\n   * * This is a global search, with multiple passes over the data.\r\n   * @param source\r\n   * @param chordTolerance\r\n   */\r\n  public static compressByChordError(source: Point3d[], chordTolerance: number): Point3d[] {\r\n    return PolylineCompressionContext.compressPoint3dArrayByChordError(source, chordTolerance);\r\n  }\r\n  /**\r\n   * Return a simplified subset of given points, omitting points if very close to their neighbors.\r\n   * * This is a local search, with a single pass over the data.\r\n   * @param source input points\r\n   * @param maxEdgeLength\r\n   * @see [[GrowableXYZArray.cloneCompressed]]\r\n   */\r\n  public static compressShortEdges(source: Point3d[] | IndexedXYZCollection, maxEdgeLength: number): Point3d[] {\r\n    const dest = GrowableXYZArray.create(source);\r\n    PolylineCompressionContext.compressInPlaceByShortEdgeLength(dest, maxEdgeLength);\r\n    return dest.getPoint3dArray();\r\n  }\r\n  /**\r\n   * Return a simplified subset of given points, omitting points of the triangle with adjacent points is small.\r\n   * * This is a local search, with a single pass over the data.\r\n   * @param source input points\r\n   * @param maxEdgeLength\r\n   */\r\n  public static compressSmallTriangles(source: Point3d[], maxTriangleArea: number): Point3d[] {\r\n    const dest = GrowableXYZArray.create(source);\r\n    PolylineCompressionContext.compressInPlaceBySmallTriangleArea(dest, maxTriangleArea);\r\n    return dest.getPoint3dArray();\r\n  }\r\n\r\n  /**\r\n   * Return a simplified subset of given points, omitting points if close to the edge between neighboring points before and after\r\n   * * This is a local search, with a single pass over the data for each pass.\r\n   * @param source input points\r\n   * @param maxDistance omit points if this close to edge between points before and after\r\n   * @param numPass max number of times to run the filter.  numPass=2 is observed to behave well.\r\n   *\r\n   */\r\n  public static compressByPerpendicularDistance(source: Point3d[], maxDistance: number, numPass: number = 2): Point3d[] {\r\n    const dest = GrowableXYZArray.create(source);\r\n    let num0 = dest.length;\r\n    for (let pass = 0; pass < numPass; pass++) {\r\n      PolylineCompressionContext.compressInPlaceByPerpendicularDistance(dest, maxDistance);\r\n      const num1 = dest.length;\r\n      if (num1 === num0)\r\n        break;\r\n      num0 = num1;\r\n    }\r\n    return dest.getPoint3dArray();\r\n  }\r\n  private static squaredDistanceToInterpolatedPoint(pointQ: Point3d, point0: Point3d, fraction: number, point1: Point3d): number {\r\n    const g = 1.0 - fraction;\r\n    const dx = pointQ.x - (g * point0.x + fraction * point1.x);\r\n    const dy = pointQ.y - (g * point0.y + fraction * point1.y);\r\n    const dz = pointQ.z - (g * point0.z + fraction * point1.z);\r\n    return dx * dx + dy * dy + dz * dz;\r\n  }\r\n  /**\r\n   * test if either\r\n   *   * points[indexA] matches pointQ\r\n   *   * line from points[indexA] to points[indexB] overlaps points[indexA] to pointQ\r\n   * @param points\r\n   * @param pointQ\r\n   * @param tolerance\r\n   */\r\n  private static isDanglerConfiguration(points: Point3d[], indexA: number, indexB: number, pointQ: Point3d, squaredDistanceTolerance: number): boolean {\r\n    if (indexA < 0 || indexA >= points.length)\r\n      return false;\r\n    const pointA = points[indexA];\r\n    // simple point match ...\r\n    const d2Q = pointA.distanceSquared(pointQ);\r\n    if (d2Q <= squaredDistanceTolerance)\r\n      return true;\r\n    if (indexB < 0 || indexB >= points.length)\r\n      return false;\r\n    const pointB = points[indexB];\r\n    // The expensive test .. does newPoint double back to an interior or extrapolation of the final dest segment?\r\n    //\r\n    // or pointQ\r\n    const dot = pointA.dotVectorsToTargets(pointB, pointQ);\r\n    // simple case -- pointB..pointA..pointQ continues forward\r\n    if (dot <= 0.0)\r\n      return false;\r\n    const d2B = pointA.distanceSquared(pointB);\r\n    let distanceSquared;\r\n    if (d2Q >= d2B) {\r\n      //                        pointB----------------------------------->>>>>>> pointA\r\n      //          pointQ<<<<---------------------------------------------------------\r\n      const fraction = dot / d2Q; // safe to divide because of earlier d2Q test.\r\n      distanceSquared = this.squaredDistanceToInterpolatedPoint(pointB, pointA, fraction, pointQ);\r\n    } else {\r\n      //           pointB----------------------------------->>>>>>> pointA\r\n      //                         pointQ<<<<----------------------\r\n      const fraction = dot / d2B;\r\n      distanceSquared = this.squaredDistanceToInterpolatedPoint(pointQ, pointA, fraction, pointB);\r\n    }\r\n    return distanceSquared < squaredDistanceTolerance;\r\n  }\r\n  /**\r\n     * Return a simplified subset of given points, omitting points on \"danglers\" that depart and return on a single path.\r\n     * @param source input points\r\n     * @param closed if true, an edge returning to point 0 is implied even if final point does not match.\r\n     * @param tolerance tolerance for near-zero distance.\r\n     */\r\n  public static compressDanglers(source: Point3d[], closed: boolean = false, tolerance: number = Geometry.smallMetricDistance): Point3d[] {\r\n    let n = source.length;\r\n    const squaredDistanceTolerance = tolerance * tolerance;\r\n    if (closed)\r\n      while (n > 1 && source[n - 1].distanceSquared(source[0]) <= squaredDistanceTolerance)\r\n        n--;\r\n    const dest = [];\r\n    dest.push(source[0].clone());\r\n    for (let i = 1; i < n; i++) {\r\n      const newPoint = source[i];\r\n      while (this.isDanglerConfiguration(dest, dest.length - 1, dest.length - 2, newPoint, squaredDistanceTolerance))\r\n        dest.pop();\r\n      dest.push(newPoint.clone());\r\n    }\r\n    if (closed) {\r\n      // No purge moving backwards.   Last point\r\n      let leftIndex = 0;\r\n      let rightIndex = dest.length - 1;\r\n      while (rightIndex > leftIndex + 2) {\r\n        if (this.isDanglerConfiguration(dest, leftIndex, leftIndex + 1, dest[rightIndex], squaredDistanceTolerance)) {\r\n          leftIndex++;\r\n        } else if (this.isDanglerConfiguration(dest, rightIndex, rightIndex - 1, dest[leftIndex], squaredDistanceTolerance)) {\r\n          rightIndex--;\r\n        } else {\r\n          break;\r\n        }\r\n      }\r\n      if (rightIndex + 1 < dest.length)\r\n        dest.length = rightIndex + 1;\r\n      if (leftIndex > 0) {\r\n        dest.splice(0, leftIndex);\r\n      }\r\n    }\r\n    return dest;\r\n  }\r\n  /**\r\n   * Add closure points to a polyline or array of polylines\r\n   * @param data points.\r\n   */\r\n  public static addClosurePoint(data: Point3d[] | Point3d[][]) {\r\n    if (data.length === 0)\r\n      return;\r\n    const q0 = data[0];\r\n    if (Array.isArray(q0)) {\r\n      for (const child of data) {\r\n        if (Array.isArray(child))\r\n          this.addClosurePoint(child);\r\n      }\r\n      return;\r\n    }\r\n    const q1 = data[data.length - 1];\r\n    if (q0 instanceof Point3d && q1 instanceof Point3d && !q0.isAlmostEqual(q1)) {\r\n      (data as Point3d[]).push(q0.clone());\r\n    }\r\n  }\r\n  /**\r\n   * Remove closure points of a polyline or array of polylines\r\n   * @param data points.\r\n   */\r\n  public static removeClosurePoint(data: Point3d[] | Point3d[][]) {\r\n    if (data.length === 0)\r\n      return;\r\n    const q0 = data[0];\r\n    if (Array.isArray(q0)) {\r\n      for (const child of data) {\r\n        if (Array.isArray(child))\r\n          this.removeClosurePoint(child);\r\n      }\r\n      return;\r\n    }\r\n    const q1 = data[data.length - 1];\r\n    if (q0 instanceof Point3d && q1 instanceof Point3d && q0.isAlmostEqual(q1)) {\r\n      (data as Point3d[]).pop();\r\n    }\r\n  }\r\n  /** Create an array of planes.\r\n   * * First plane has origin at first centerline point, with unit normal directed at the next point.\r\n   * * Intermediate planes have origin at intermediate points, with unit normals computed from the average of unit vectors\r\n   *   along the incoming and outgoing segments.\r\n   * * Last plane has origin at last centerline point, with unit normal directed from previous point.\r\n   * * All sets of adjacent coincident points are reduced to a single point.\r\n   *    * Hence the output array may have fewer points than the centerline.\r\n   * * If there are one or fewer distinct input points, the return is undefined.\r\n   * @param centerline points to reside in output planes.\r\n   * @param wrapIfPhysicallyClosed if true and the first and last centerline points are the same, then the first and last\r\n   * output planes are averaged and equated (cloned). Default false.\r\n   */\r\n  public static createBisectorPlanesForDistinctPoints(\r\n    centerline: IndexedXYZCollection | Point3d[], wrapIfPhysicallyClosed: boolean = false,\r\n  ): Plane3dByOriginAndUnitNormal[] | undefined {\r\n    const packedPoints = PolylineOps.compressShortEdges(centerline, 2.0 * Geometry.smallMetricDistance);  // double the tolerance to ensure normalized vectors exist.\r\n    if (packedPoints.length < 2)\r\n      return undefined;\r\n    const bisectorPlanes: Plane3dByOriginAndUnitNormal[] = [];\r\n    const point0 = packedPoints[0];\r\n    const point1 = packedPoints[1];\r\n    const unit01 = Vector3d.createNormalizedStartEnd(point0, point1)!;\r\n    const perpendicular0 = Plane3dByOriginAndUnitNormal.create(point0, unit01)!;\r\n    const perpendicular1 = Plane3dByOriginAndUnitNormal.createXYPlane();\r\n    // FIRST point gets simple perpendicular\r\n    bisectorPlanes.push(perpendicular0.clone());\r\n    // Each intermediate point gets average of adjacent perpendiculars\r\n    for (let i = 1; i + 1 < packedPoints.length; i++) {\r\n      Vector3d.createNormalizedStartEnd(packedPoints[i], packedPoints[i + 1], unit01);\r\n      // remark: the prior pack should ensure the normalization is ok.  But if it fails, we ignore this point...\r\n      if (undefined !== Plane3dByOriginAndUnitNormal.create(packedPoints[i], unit01, perpendicular1)) {\r\n        const newBisectorNormal = perpendicular0.getNormalRef().interpolate(0.5, perpendicular1.getNormalRef());\r\n        const newBisectorPlane = Plane3dByOriginAndUnitNormal.create(packedPoints[i], newBisectorNormal);\r\n        if (undefined !== newBisectorPlane)\r\n          bisectorPlanes.push(newBisectorPlane);\r\n        perpendicular0.setFrom(perpendicular1);\r\n      }\r\n    }\r\n    // LAST point gets simple perpendicular inherited from last pass\r\n    bisectorPlanes.push(Plane3dByOriginAndUnitNormal.create(packedPoints[packedPoints.length - 1], perpendicular0.getNormalRef())!);\r\n    // reset end planes to their average plane, but leave them alone if the closure point is a cusp\r\n    const lastIndex = bisectorPlanes.length - 1;\r\n    if (lastIndex > 0 && wrapIfPhysicallyClosed) {\r\n      const firstPlane = bisectorPlanes[0];\r\n      const lastPlane = bisectorPlanes[lastIndex];\r\n      if (Geometry.isSamePoint3d(firstPlane.getOriginRef(), lastPlane.getOriginRef())) {\r\n        const newBisectorNormal = firstPlane.getNormalRef().plus(lastPlane.getNormalRef()); // could be zero vector at a cusp\r\n        const newBisectorPlane = Plane3dByOriginAndUnitNormal.create(firstPlane.getOriginRef(), newBisectorNormal);\r\n        if (undefined !== newBisectorPlane) {\r\n          bisectorPlanes[0] = newBisectorPlane;\r\n          bisectorPlanes[lastIndex] = Plane3dByOriginAndUnitNormal.create(lastPlane.getOriginRef(), newBisectorNormal)!;\r\n        }\r\n      }\r\n    }\r\n    return bisectorPlanes.length > 1 ? bisectorPlanes : undefined;\r\n  }\r\n\r\n  private static _workSegmentA?: LineSegment3d;\r\n  private static _workSegmentB?: LineSegment3d;\r\n  private static _workLocalDetailPair?: CurveLocationDetailPair;\r\n  /**\r\n   * Find smallest distance between polylines.\r\n   * * For polylines with many points, it is more efficient to use [[LineString3dRangeTreeContext.searchForClosestApproach]].\r\n   * @param pointsA first polyline\r\n   * @param extendA how to extend polylineA forward/backward\r\n   * @param pointsB second polyline\r\n   * @param extendB how to extend polylineB forward/backward\r\n   * @param dMax largest approach distance to consider\r\n   * @param result optional pre-allocated object to populate and return\r\n   * @returns pair of details, one for each polyline, with field values:\r\n   * * `a` is the closest approach distance\r\n   * * `point` is the point of closest approach\r\n   * * `fraction` is the global polyline fraction\r\n   * * `childDetail.a` is the segment index\r\n   * * `childDetail.fraction` is the local segment fraction\r\n   */\r\n  public static closestApproach(\r\n    pointsA: Point3d[] | IndexedXYZCollection,\r\n    extendA: VariantCurveExtendParameter,\r\n    pointsB: Point3d[] | IndexedXYZCollection,\r\n    extendB: VariantCurveExtendParameter,\r\n    dMax: number = Number.MAX_VALUE,\r\n    result?: CurveLocationDetailPair,\r\n  ): CurveLocationDetailPair | undefined {\r\n    if (Array.isArray(pointsA))\r\n      pointsA = new Point3dArrayCarrier(pointsA);\r\n    if (Array.isArray(pointsB))\r\n      pointsB = new Point3dArrayCarrier(pointsB);\r\n    let dMin = dMax;\r\n    let foundMin = false;\r\n    const numSegmentA = pointsA.length - 1;\r\n    const numSegmentB = pointsB.length - 1;\r\n    const extendSegA = [CurveExtendMode.None, CurveExtendMode.None];\r\n    const extendSegB = [CurveExtendMode.None, CurveExtendMode.None];\r\n    // lambda to set extension for first and last segment of a polyline\r\n    const convertExtend = (extendOut: CurveExtendMode[], extendIn: VariantCurveExtendParameter, segmentIndex: number, numSegments: number) => {\r\n      extendOut[0] = extendOut[1] = CurveExtendMode.None;\r\n      if (segmentIndex === 0)\r\n        extendOut[0] = CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extendIn, 0);\r\n      else if (segmentIndex === numSegments - 1)\r\n        extendOut[1] = CurveExtendOptions.resolveVariantCurveExtendParameterToCurveExtendMode(extendIn, 1);\r\n    };\r\n    // lambda to extract LineSegment3d from polyline\r\n    const fillSegment = (points: IndexedXYZCollection, index: number, segment: LineSegment3d | undefined): LineSegment3d => {\r\n      if (segment === undefined)\r\n        return LineSegment3d.createCapture(points.getPoint3dAtUncheckedPointIndex(index), points.getPoint3dAtUncheckedPointIndex(index + 1));\r\n      points.getPoint3dAtUncheckedPointIndex(index, segment.point0Ref);\r\n      points.getPoint3dAtUncheckedPointIndex(index + 1, segment.point1Ref);\r\n      return segment;\r\n    };\r\n    // just test the segments\r\n    for (let indexA = 0; indexA < numSegmentA; indexA++) {\r\n      this._workSegmentA = fillSegment(pointsA, indexA, this._workSegmentA);\r\n      convertExtend(extendSegA, extendA, indexA, numSegmentA);\r\n      for (let indexB = 0; indexB < numSegmentB; indexB++) {\r\n        this._workSegmentB = fillSegment(pointsB, indexB, this._workSegmentB);\r\n        convertExtend(extendSegB, extendB, indexB, numSegmentB);\r\n        if (undefined !== (this._workLocalDetailPair = LineSegment3d.closestApproach(this._workSegmentA, extendSegA, this._workSegmentB, extendSegB, this._workLocalDetailPair))) {\r\n          const d = this._workLocalDetailPair.detailA.a;\r\n          if (d < dMin) {\r\n            const childDetailA = result?.detailA.childDetail; // save and reuse\r\n            const childDetailB = result?.detailB.childDetail;\r\n            result = this._workLocalDetailPair.clone(result); // overwrite previous result\r\n            LineString3d.convertLocalToGlobalDetail(result.detailA, indexA, numSegmentA, undefined, childDetailA);\r\n            LineString3d.convertLocalToGlobalDetail(result.detailB, indexB, numSegmentB, undefined, childDetailB);\r\n            if (result.detailA.childDetail && result.detailB.childDetail)\r\n              result.detailA.childDetail.curve = result.detailB.childDetail.curve = undefined; // no CurvePrimitives survive in output\r\n            dMin = d;\r\n            foundMin = true;\r\n          }\r\n        }\r\n      }\r\n    }\r\n    return foundMin ? result : undefined;\r\n  }\r\n}\r\n"]}

package/lib/esm/geometry4d/MomentData.d.ts

@@ -10,135 +10,137 @@ import { Matrix4d } from "./Matrix4d";
  *   * origin = local origin used as moments are summed.
  *   * sums = array of summed moments.
  *     * The [i,j] entry of the sums is a summed or integrated moment for product of axis i and j.
- *       * axes 0,1,2 are x,y,z
+ *       * axes 0,1,2 are x,y,z.
  *         * e.g. entry [0,1] is summed product xy
  *       * axis 3 is "w", which is 1 in sums.
- *         * e.g. entry 03 is summed x
- *    * In this level,
+ *         * e.g. entry 03 is summed x.
+ *    * In this level:
  *        * the `absoluteQuantity` member is undefined.
  *        * the `localToWorldMap` and `radiiOfGyration` are created by have undefined contents.
- *  * Second level: after a call to inertiaProductsToPrincipalAxes, the `localToWorldMap`, `absoluteQuantity` and `radiiOfGyration` are filled in.
+ *  * Second level: after a call to inertiaProductsToPrincipalAxes, the `localToWorldMap`, `absoluteQuantity` and
+ *    `radiiOfGyration` are filled in.
  * @public
  */
 export declare class MomentData {
     /** Origin used for sums. */
     origin: Point3d;
-    /** flag to request deferred origin setup. */
+    /** Flag to request deferred origin setup. */
     needOrigin: boolean;
-    /** Moment sums.
+    /**
+     * Moment sums.
      * * Set to zero at initialization and if requested later.
      * * Accumulated during data entry phase.
      */
     sums: Matrix4d;
-    /** the mapping between principal and world system.
+    /**
+     * The mapping between principal and world system.
      * * This set up with its inverse already constructed.
      */
     localToWorldMap: Transform;
-    /** Return the lower-right (3,3) entry in the sums.
-     * * This is the quantity (i.e. length, area, or volume) summed
+    private static _vectorA?;
+    private static _vectorB?;
+    private static _vectorC?;
+    private _point0;
+    private _point1;
+    /**
+     * Return the lower-right (3,3) entry in the sums.
+     * * This is the quantity (i.e. length, area, or volume) summed.
      */
     get quantitySum(): number;
-    /** Return a scale factor to make these sums match the target orientation sign.
+    /**
+     * Return a scale factor to make these sums match the target orientation sign.
      * * 1.0 if `this.quantitySum` has the same sign as `targetSign`.
      * * -1.0 if `this.quantitySum` has the opposite sign from `targetSign`
      */
     signFactor(targetSign: number): number;
-    /**
-     *  If `this.needOrigin` flag is set, copy `origin` to `this.origin` and clear the flag.
-     *
-     */
+    /** If `this.needOrigin` flag is set, copy `origin` to `this.origin` and clear the flag. */
     setOriginIfNeeded(origin: Point3d): void;
-    /**
-     *  If `this.needOrigin` flag is set, copy `origin` to `this.origin` and clear the flag.
-     *
-     */
+    /** If `this.needOrigin` flag is set, copy `origin` to `this.origin` and clear the flag. */
     setOriginFromGrowableXYZArrayIfNeeded(points: GrowableXYZArray): void;
-    /**
-     *  If `this.needOrigin` flag is set, copy `origin` to `this.origin` and clear the flag.
-     *
-     */
+    /** If `this.needOrigin` flag is set, copy `origin` to `this.origin` and clear the flag. */
     setOriginXYZIfNeeded(x: number, y: number, z: number): void;
-    /** radii of gyration (square roots of principal second moments)
-     */
+    /** Radii of gyration (square roots of principal second moments). */
     radiusOfGyration: Vector3d;
-    /** principal quantity (e.g. length, area, or volume).  This is undefined in raw moments, and becomes defined by
-     *
+    /**
+     * Principal quantity (e.g. length, area, or volume). This is undefined in raw moments, and becomes defined by
+     * inertiaProductsToPrincipalAxes.
      */
     absoluteQuantity?: number;
+    /** Constructor. */
     private constructor();
-    /** Create moments with optional origin.
-     * * origin and needOrigin are quirky.
+    /**
+     * Create moments with optional origin.
+     * * Origin and needOrigin are quirky.
      *   * (undefined, true) sets up to use first incoming point as origin.
-     *   * (origin) sets up to use that durable origin, set needsOrigin flag false
-     *   * (origin, true) the "true" is meaningless
-     *   * (undefined, false) makes 000 the durable origin
+     *   * (origin) sets up to use that durable origin, set needsOrigin flag false.
+     *   * (origin, true) the "true" is meaningless.
+     *   * (undefined, false) makes 000 the durable origin.
     */
     static create(origin?: Point3d | undefined, needOrigin?: boolean): MomentData;
     /**
-     * Return the formal tensor of integrated values `[yy+zz,xy,xz][yx,xx+zz,yz][zx,xy,xx+yy]`
-     * @param products matrix of (integrated) `[xx,xy,xz][yx,yy,yz][zx,xy,zz]`
+     * Return the formal tensor of integrated values `[yy+zz,xy,xz][yx,xx+zz,yz][zx,xy,xx+yy]`.
+     * @param products matrix of (integrated) `[xx,xy,xz][yx,yy,yz][zx,xy,zz]`.
      */
     static momentTensorFromInertiaProducts(products: Matrix3d): Matrix3d;
     /** Sort the columns of the matrix for increasing moments. */
     static sortColumnsForIncreasingMoments(axes: Matrix3d, moments: Vector3d): void;
     /**
      * Return the principal moment data for an array of points.
-     * @param points array of points
+     * @param points array of points.
      */
     static pointsToPrincipalAxes(points: Point3d[]): MomentData | undefined;
     /**
-     * Compute principal axes from inertial products
-     * * The radii of gyration are sorted smallest to largest
-     * * Hence x axis is long direction
-     * * Hence planar data generates large moment as Z
+     * Compute principal axes from inertial products.
+     * * The radii of gyration are sorted smallest to largest.
+     * * Hence x axis is long direction.
+     * * Hence planar data generates large moment as Z.
      * @param origin The origin used for the inertia products.
-     * @param inertiaProducts The inertia products -- sums or integrals of [xx,xy,xz,xw; yx,yy, yz,yw; zx,zy,zz,zw; wx,wy,wz,w]
+     * @param inertiaProducts The inertia products: sums or integrals of [xx,xy,xz,xw; yx,yy, yz,yw; zx,zy,zz,zw; wx,wy,wz,w].
      */
     static inertiaProductsToPrincipalAxes(origin: XYZ, inertiaProducts: Matrix4d): MomentData | undefined;
     /**
-     * Test for match among selected members as they exist after `inertiaProductsToPrincipalAxes`
-     * * The members considered are
-     *   * origin of local to world map (i.e. centroid)
-     *   * radius of gyration
+     * Test for match among selected members as they exist after `inertiaProductsToPrincipalAxes`.
+     * * The members considered are:
+     *   * origin of local to world map (i.e. centroid),
+     *   * radius of gyration,
      *   * axes of localToWorldMap.
      * * Axis direction tests allow these quirks:
      *   * opposite orientation is considered matched.
      * * Full xyz symmetry: If x,y,z radii are matched, axes are not tested.
-     * * Symmetry in xy plane: If x and y radii are matched, the x and y axes area allowed to spin freely.  Only Z direction is tested.
+     * * Symmetry in xy plane: If x and y radii are matched, the x and y axes area allowed to spin freely. Only Z direction
+     *   is tested.
      * * If either or both are undefined, returns false.
-     * @param dataA first set of moments
-     * @param dataB second set of moments
+     * @param dataA first set of moments.
+     * @param dataB second set of moments.
      */
     static areEquivalentPrincipalAxes(dataA: MomentData | undefined, dataB: MomentData | undefined): boolean;
     /** Clear the MomentData sums to zero, and establish a new origin. */
     clearSums(origin?: Point3d): void;
     /** Accumulate products-of-components for given points. */
     accumulatePointMomentsFromOrigin(points: Point3d[]): void;
-    /** revise the accumulated sums to be "around the centroid" */
+    /** Revise the accumulated sums to be "around the centroid". */
     shiftOriginAndSumsToCentroidOfSums(): boolean;
-    /** revise the accumulated sums
+    /**
+     * Revise the accumulated sums.
      * * add ax,ay,ax to the origin coordinates.
      * * apply the negative translation to the sums.
     */
     shiftOriginAndSumsByXYZ(ax: number, ay: number, az: number): void;
-    /** revise the accumulated sums so they are based at a specified origin. */
+    /** Revise the accumulated sums so they are based at a specified origin. */
     shiftOriginAndSumsToNewOrigin(newOrigin: XYAndZ): void;
-    private static _vectorA?;
-    private static _vectorB?;
-    private static _vectorC?;
-    /** compute moments of a triangle from the origin to the given line.
+    /**
+     * Compute moments of a triangle from the origin to the given line.
      * Accumulate them to this.sums.
      * * If `pointA` is undefined, use `this.origin` as pointA.
      * * If `this.needOrigin` is set, pointB is used
     */
     accumulateTriangleMomentsXY(pointA: XAndY | undefined, pointB: XAndY, pointC: XAndY): void;
-    /** add scaled outer product of (4d, unit weight) point to this.sums */
+    /** Add scaled outer product of (4d, unit weight) point to this.sums. */
     accumulateScaledOuterProduct(point: XYAndZ, scaleFactor: number): void;
     /** Accumulate wire moment integral from pointA to pointB */
     accumulateLineMomentsXYZ(pointA: Point3d, pointB: Point3d): void;
-    private _point0;
-    private _point1;
-    /** compute moments of triangles from a base point to the given linestring.
+    /**
+     * Compute moments of triangles from a base point to the given linestring.
      * Accumulate them to this.sums.
      * * If `pointA` is undefined, use `this.origin` as pointA.
      * * If `this.needOrigin` is set, the first point of the array is captured as local origin for subsequent sums.
@@ -147,34 +149,31 @@ export declare class MomentData {
     accumulateTriangleToLineStringMomentsXY(sweepBase: XAndY | undefined, points: GrowableXYZArray): void;
     /**
      * * Assemble XX, YY, XY products into a full matrix form [xx,xy,0,0; xy,yy,0,0;0,0,0,0;0,0,0,1].
-     * * Sandwich this between transforms with columns [vectorU, vectorV, 0000, origin].  (Column weights 0001) (only xy parts of vectors)
+     * * Sandwich this between transforms with columns [vectorU, vectorV, 0000, origin].  (Column weights 0001) (only xy
+     *   parts of vectors).
      * * scale by detJ for the xy-only determinant of the vectors.
      * @param productXX
      * @param productXY
      * @param productYY
-     * @param area Area in caller's system
-     * @param origin Caller's origin
-     * @param vectorU Caller's U axis (not necessarily unit)
-     * @param vectorV Caller's V axis (not necessarily unit)
+     * @param area Area in caller's system.
+     * @param origin Caller's origin.
+     * @param vectorU Caller's U axis (not necessarily unit).
+     * @param vectorV Caller's V axis (not necessarily unit).
      */
     accumulateXYProductsInCentroidalFrame(productXX: number, productXY: number, productYY: number, area: number, origin: XAndY, vectorU: XAndY, vectorV: XAndY): void;
     /**
      * Accumulate sums from other moments.
-     * * scale by given scaleFactor (e.g. sign to correct orientation)
-     * * pull the origin from `other` if `this` needs an origin.
-     * *
+     * * Scale by given scaleFactor (e.g. sign to correct orientation).
+     * * Pull the origin from `other` if `this` needs an origin.
      */
     accumulateProducts(other: MomentData, scale: number): void;
     /**
-   * Accumulate sums from Matrix4d and origin.
-   * * scale by given scaleFactor (e.g. sign to correct orientation)
-   * * trap the origin if `this` needs an origin.
-   * *
-   */
-    accumulateProductsFromOrigin(origin: Point3d, products: Matrix4d, scale: number): void;
-    /**
-     * Convert to a json data object with:
+     * Accumulate sums from Matrix4d and origin.
+     * * Scale by given scaleFactor (e.g. sign to correct orientation).
+     * * Trap the origin if `this` needs an origin.
      */
+    accumulateProductsFromOrigin(origin: Point3d, products: Matrix4d, scale: number): void;
+    /** Convert to a json data object. */
     toJSON(): any;
 }
 //# sourceMappingURL=MomentData.d.ts.map

package/lib/esm/geometry4d/MomentData.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"MomentData.d.ts","sourceRoot":"","sources":["../../../src/geometry4d/MomentData.ts"],"names":[],"mappings":"AAaA,OAAO,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAClE,OAAO,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AAClD,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,GAAG,EAAE,MAAM,+BAA+B,CAAC;AACvE,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACpD,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,wBAAwB,CAAC;AACvD,OAAO,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAGtC;;;;;;;;;;;;;;;GAeG;AACH,qBAAa,UAAU;IACrB,4BAA4B;IACrB,MAAM,EAAE,OAAO,CAAC;IACvB,6CAA6C;IACtC,UAAU,EAAE,OAAO,CAAC;IAC3B;;;OAGG;IACI,IAAI,EAAE,QAAQ,CAAC;IACtB;;OAEG;IACI,eAAe,EAAE,SAAS,CAAC;IAClC;;OAEG;IACH,IAAW,WAAW,IAAI,MAAM,CAAiC;IACjE;;;OAGG;IACI,UAAU,CAAC,UAAU,EAAE,MAAM,GAAG,MAAM;IAI7C;;;OAGG;IACI,iBAAiB,CAAC,MAAM,EAAE,OAAO;IAMxC;;;OAGG;IACI,qCAAqC,CAAC,MAAM,EAAE,gBAAgB;IAOrE;;;OAGG;IACI,oBAAoB,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM;IAO3D;OACG;IACI,gBAAgB,EAAE,QAAQ,CAAC;IAClC;;OAEG;IACI,gBAAgB,CAAC,EAAE,MAAM,CAAC;IAEjC,OAAO;IASP;;;;;;MAME;WACY,MAAM,CAAC,MAAM,CAAC,EAAE,OAAO,GAAG,SAAS,EAAE,UAAU,GAAE,OAAe,GAAG,UAAU;IAS3F;;;OAGG;WACW,+BAA+B,CAAC,QAAQ,EAAE,QAAQ,GAAG,QAAQ;IAM3E,6DAA6D;WAC/C,+BAA+B,CAAC,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ;IAqB/E;;;OAGG;WACW,qBAAqB,CAAC,MAAM,EAAE,OAAO,EAAE,GAAG,UAAU,GAAG,SAAS;IAQ9E;;;;;;;OAOG;WACW,8BAA8B,CAAC,MAAM,EAAE,GAAG,EAAE,eAAe,EAAE,QAAQ,GAAG,UAAU,GAAG,SAAS;IA0B5G;;;;;;;;;;;;;OAaG;WACW,0BAA0B,CAAC,KAAK,EAAE,UAAU,GAAG,SAAS,EAAE,KAAK,EAAE,UAAU,GAAG,SAAS,GAAG,OAAO;IAgC/G,qEAAqE;IAC9D,SAAS,CAAC,MAAM,CAAC,EAAE,OAAO;IAOjC,0DAA0D;IACnD,gCAAgC,CAAC,MAAM,EAAE,OAAO,EAAE;IASzD,8DAA8D;IACvD,kCAAkC,IAAI,OAAO;IASpD;;;MAGE;IACK,uBAAuB,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM;IAIjE,2EAA2E;IACpE,6BAA6B,CAAC,SAAS,EAAE,MAAM;IAGtD,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAU;IAClC,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAU;IAClC,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAU;IAElC;;;;MAIE;IACK,2BAA2B,CAAC,MAAM,EAAE,KAAK,GAAG,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK;IA+B1F,uEAAuE;IAChE,4BAA4B,CAAC,KAAK,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM;IAKtE,4DAA4D;IACrD,wBAAwB,CAAC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO;IAiBhE,OAAO,CAAC,OAAO,CAAoB;IACnC,OAAO,CAAC,OAAO,CAAoB;IACnC;;;;;OAKG;IACI,uCAAuC,CAAC,SAAS,EAAE,KAAK,GAAG,SAAS,EAAE,MAAM,EAAE,gBAAgB;IAYrG;;;;;;;;;;;OAWG;IACI,qCAAqC,CAAC,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAChH,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK;IAgB/C;;;;;OAKG;IACI,kBAAkB,CAAC,KAAK,EAAE,UAAU,EAAE,KAAK,EAAE,MAAM;IAK1D;;;;;KAKC;IACM,4BAA4B,CAAC,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM;IAItF;;OAEG;IACI,MAAM,IAAI,GAAG;CAQrB"}
+{"version":3,"file":"MomentData.d.ts","sourceRoot":"","sources":["../../../src/geometry4d/MomentData.ts"],"names":[],"mappings":"AAaA,OAAO,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAClE,OAAO,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AAClD,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,GAAG,EAAE,MAAM,+BAA+B,CAAC;AACvE,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACpD,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,wBAAwB,CAAC;AACvD,OAAO,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAGtC;;;;;;;;;;;;;;;;GAgBG;AACH,qBAAa,UAAU;IACrB,4BAA4B;IACrB,MAAM,EAAE,OAAO,CAAC;IACvB,6CAA6C;IACtC,UAAU,EAAE,OAAO,CAAC;IAC3B;;;;OAIG;IACI,IAAI,EAAE,QAAQ,CAAC;IACtB;;;OAGG;IACI,eAAe,EAAE,SAAS,CAAC;IAElC,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAU;IAClC,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAU;IAClC,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAU;IAClC,OAAO,CAAC,OAAO,CAAoB;IACnC,OAAO,CAAC,OAAO,CAAoB;IACnC;;;OAGG;IACH,IAAW,WAAW,IAAI,MAAM,CAE/B;IACD;;;;OAIG;IACI,UAAU,CAAC,UAAU,EAAE,MAAM,GAAG,MAAM;IAG7C,2FAA2F;IACpF,iBAAiB,CAAC,MAAM,EAAE,OAAO;IAMxC,2FAA2F;IACpF,qCAAqC,CAAC,MAAM,EAAE,gBAAgB;IAMrE,2FAA2F;IACpF,oBAAoB,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM;IAM3D,oEAAoE;IAC7D,gBAAgB,EAAE,QAAQ,CAAC;IAClC;;;OAGG;IACI,gBAAgB,CAAC,EAAE,MAAM,CAAC;IACjC,mBAAmB;IACnB,OAAO;IASP;;;;;;;MAOE;WACY,MAAM,CAAC,MAAM,CAAC,EAAE,OAAO,GAAG,SAAS,EAAE,UAAU,GAAE,OAAe,GAAG,UAAU;IAS3F;;;OAGG;WACW,+BAA+B,CAAC,QAAQ,EAAE,QAAQ,GAAG,QAAQ;IAM3E,6DAA6D;WAC/C,+BAA+B,CAAC,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ;IAoB/E;;;OAGG;WACW,qBAAqB,CAAC,MAAM,EAAE,OAAO,EAAE,GAAG,UAAU,GAAG,SAAS;IAQ9E;;;;;;;OAOG;WACW,8BAA8B,CAAC,MAAM,EAAE,GAAG,EAAE,eAAe,EAAE,QAAQ,GAAG,UAAU,GAAG,SAAS;IA0B5G;;;;;;;;;;;;;;OAcG;WACW,0BAA0B,CAAC,KAAK,EAAE,UAAU,GAAG,SAAS,EAAE,KAAK,EAAE,UAAU,GAAG,SAAS,GAAG,OAAO;IAgC/G,qEAAqE;IAC9D,SAAS,CAAC,MAAM,CAAC,EAAE,OAAO;IAOjC,0DAA0D;IACnD,gCAAgC,CAAC,MAAM,EAAE,OAAO,EAAE;IAUzD,+DAA+D;IACxD,kCAAkC,IAAI,OAAO;IASpD;;;;MAIE;IACK,uBAAuB,CAAC,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,MAAM;IAIjE,2EAA2E;IACpE,6BAA6B,CAAC,SAAS,EAAE,MAAM;IAGtD;;;;;MAKE;IACK,2BAA2B,CAAC,MAAM,EAAE,KAAK,GAAG,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK;IA8B1F,wEAAwE;IACjE,4BAA4B,CAAC,KAAK,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM;IAOtE,4DAA4D;IACrD,wBAAwB,CAAC,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO;IAmBhE;;;;;;OAMG;IACI,uCAAuC,CAAC,SAAS,EAAE,KAAK,GAAG,SAAS,EAAE,MAAM,EAAE,gBAAgB;IAWrG;;;;;;;;;;;;OAYG;IACI,qCAAqC,CAC1C,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EACvD,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK;IAmB7D;;;;OAIG;IACI,kBAAkB,CAAC,KAAK,EAAE,UAAU,EAAE,KAAK,EAAE,MAAM;IAO1D;;;;OAIG;IACI,4BAA4B,CAAC,MAAM,EAAE,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM;IAMtF,qCAAqC;IAC9B,MAAM,IAAI,GAAG;CAQrB"}