@itwin/core-geometry 4.1.0-dev.8 → 4.1.0-dev.81

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

@@ -1,6 +1,8 @@
 /** @packageDocumentation
  * @module CartesianGeometry
  */
+import { IndexedXYZCollection } from "./IndexedXYZCollection";
+import { Plane3dByOriginAndUnitNormal } from "./Plane3dByOriginAndUnitNormal";
 import { Point3d } from "./Point3dVector3d";
 import { Range1d } from "./Range";
 /**
@@ -27,7 +29,7 @@ export declare class PolylineOps {
      * @param source input points
      * @param maxEdgeLength
      */
-    static compressShortEdges(source: Point3d[], maxEdgeLength: number): Point3d[];
+    static compressShortEdges(source: Point3d[] | IndexedXYZCollection, maxEdgeLength: number): Point3d[];
     /**
      * Return a simplified subset of given points, omitting points of the triangle with adjacent points is small.
      * * This is a local search, with a single pass over the data.
@@ -57,6 +59,8 @@ export declare class PolylineOps {
     /**
        * Return a simplified subset of given points, omitting points on "danglers" that depart and return on a single path.
        * @param source input points
+       * @param closed if true, an edge returning to point 0 is implied even if final point does not match.
+       * @param tolerance tolerance for near-zero distance.
        */
     static compressDanglers(source: Point3d[], closed?: boolean, tolerance?: number): Point3d[];
     /**
@@ -69,5 +73,16 @@ export declare class PolylineOps {
      * @param data points.
      */
     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.
+     * * 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).
+     */
+    static createBisectorPlanesForDistinctPoints(centerline: IndexedXYZCollection | Point3d[], wrapIfPhysicallyClosed?: boolean): Plane3dByOriginAndUnitNormal[] | undefined;
 }
 //# 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;AAIH,OAAO,EAAE,OAAO,EAAE,MAAM,mBAAmB,CAAC;AAE5C,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,EAAE,aAAa,EAAE,MAAM,GAAG,OAAO,EAAE;IAKrF;;;;;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;IAiCvC;;;SAGK;WACY,gBAAgB,CAAC,MAAM,EAAE,OAAO,EAAE,EAAE,MAAM,GAAE,OAAe,EAAE,SAAS,GAAE,MAAqC,GAAG,OAAO,EAAE;IAmCxI;;;OAGG;WACY,eAAe,CAAC,IAAI,EAAE,OAAO,EAAE,GAAG,OAAO,EAAE,EAAE;IAgB5D;;;OAGG;WACY,kBAAkB,CAAC,IAAI,EAAE,OAAO,EAAE,GAAG,OAAO,EAAE,EAAE;CAgBhE"}
+{"version":3,"file":"PolylineOps.d.ts","sourceRoot":"","sources":["../../../src/geometry3d/PolylineOps.ts"],"names":[],"mappings":"AAIA;;GAEG;AAIH,OAAO,EAAE,oBAAoB,EAAE,MAAM,wBAAwB,CAAC;AAC9D,OAAO,EAAE,4BAA4B,EAAE,MAAM,gCAAgC,CAAC;AAC9E,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;CA2CvL"}

package/lib/cjs/geometry3d/PolylineOps.js

@@ -10,6 +10,7 @@ Object.defineProperty(exports, "__esModule", { value: true });
 exports.PolylineOps = void 0;
 const Geometry_1 = require("../Geometry");
 const GrowableXYZArray_1 = require("./GrowableXYZArray");
+const Plane3dByOriginAndUnitNormal_1 = require("./Plane3dByOriginAndUnitNormal");
 const Point3dVector3d_1 = require("./Point3dVector3d");
 const PolylineCompressionByEdgeOffset_1 = require("./PolylineCompressionByEdgeOffset");
 const Range_1 = require("./Range");
@@ -134,6 +135,8 @@ class PolylineOps {
     /**
        * Return a simplified subset of given points, omitting points on "danglers" that depart and return on a single path.
        * @param source input points
+       * @param closed if true, an edge returning to point 0 is implied even if final point does not match.
+       * @param tolerance tolerance for near-zero distance.
        */
     static compressDanglers(source, closed = false, tolerance = Geometry_1.Geometry.smallMetricDistance) {
         let n = source.length;
@@ -212,6 +215,58 @@ class PolylineOps {
             data.pop();
         }
     }
+    /** 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.
+     * * 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).
+     */
+    static createBisectorPlanesForDistinctPoints(centerline, wrapIfPhysicallyClosed = false) {
+        const packedPoints = PolylineOps.compressShortEdges(centerline, 2.0 * Geometry_1.Geometry.smallMetricDistance); // double the tolerance to ensure normalized vectors exist.
+        if (packedPoints.length < 2)
+            return undefined;
+        const bisectorPlanes = [];
+        const point0 = packedPoints[0];
+        const point1 = packedPoints[1];
+        const unit01 = Point3dVector3d_1.Vector3d.createNormalizedStartEnd(point0, point1);
+        const perpendicular0 = Plane3dByOriginAndUnitNormal_1.Plane3dByOriginAndUnitNormal.create(point0, unit01);
+        const perpendicular1 = Plane3dByOriginAndUnitNormal_1.Plane3dByOriginAndUnitNormal.createXYPlane();
+        // FIRST point gets simple perpendicular
+        bisectorPlanes.push(perpendicular0.clone());
+        // Each intermediate point gets average of adjacent perpendiculars
+        for (let i = 1; i + 1 < packedPoints.length; i++) {
+            Point3dVector3d_1.Vector3d.createNormalizedStartEnd(packedPoints[i], packedPoints[i + 1], unit01);
+            // remark: the prior pack should ensure the normalization is ok.  But if it fails, we ignore this point...
+            if (undefined !== Plane3dByOriginAndUnitNormal_1.Plane3dByOriginAndUnitNormal.create(packedPoints[i], unit01, perpendicular1)) {
+                const newBisectorNormal = perpendicular0.getNormalRef().interpolate(0.5, perpendicular1.getNormalRef());
+                const newBisectorPlane = Plane3dByOriginAndUnitNormal_1.Plane3dByOriginAndUnitNormal.create(packedPoints[i], newBisectorNormal);
+                if (undefined !== newBisectorPlane)
+                    bisectorPlanes.push(newBisectorPlane);
+                perpendicular0.setFrom(perpendicular1);
+            }
+        }
+        // LAST point gets simple perpendicular inherited from last pass
+        bisectorPlanes.push(Plane3dByOriginAndUnitNormal_1.Plane3dByOriginAndUnitNormal.create(packedPoints[packedPoints.length - 1], perpendicular0.getNormalRef()));
+        // reset end planes to their average plane, but leave them alone if the closure point is a cusp
+        const lastIndex = bisectorPlanes.length - 1;
+        if (lastIndex > 0 && wrapIfPhysicallyClosed) {
+            const firstPlane = bisectorPlanes[0];
+            const lastPlane = bisectorPlanes[lastIndex];
+            if (Geometry_1.Geometry.isSamePoint3d(firstPlane.getOriginRef(), lastPlane.getOriginRef())) {
+                const newBisectorNormal = firstPlane.getNormalRef().plus(lastPlane.getNormalRef()); // could be zero vector at a cusp
+                const newBisectorPlane = Plane3dByOriginAndUnitNormal_1.Plane3dByOriginAndUnitNormal.create(firstPlane.getOriginRef(), newBisectorNormal);
+                if (undefined !== newBisectorPlane) {
+                    bisectorPlanes[0] = newBisectorPlane;
+                    bisectorPlanes[lastIndex] = Plane3dByOriginAndUnitNormal_1.Plane3dByOriginAndUnitNormal.create(lastPlane.getOriginRef(), newBisectorNormal);
+                }
+            }
+        }
+        return bisectorPlanes.length > 1 ? bisectorPlanes : undefined;
+    }
 }
 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,0CAAuC;AACvC,yDAAsD;AACtD,uDAA4C;AAC5C,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;YACtC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SAClD;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;;;;;OAKG;IACI,MAAM,CAAC,kBAAkB,CAAC,MAAiB,EAAE,aAAqB;QACvE,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;YACzC,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;SACb;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,EAAC,MAAe,EAAE,wBAAgC;QACvI,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;YAChB,iFAAiF;YACjF,+EAA+E;YAC7E,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;SAC7F;aAAM;YACL,oEAAoE;YACpE,2DAA2D;YAC3D,MAAM,QAAQ,GAAG,GAAG,GAAG,GAAG,CAAC;YAC7B,eAAe,GAAG,IAAI,CAAC,kCAAkC,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;SAC3F;QACD,OAAO,eAAe,GAAG,wBAAwB,CAAC;IACpD,CAAC;IACH;;;SAGK;IACK,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;YACT,OAAO,CAAC,GAAG,CAAC,IAAI,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,wBAAwB;gBAChF,CAAC,EAAE,CAAC;QACT,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,EAAC;YACzB,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;SAC7B;QACD,IAAI,MAAM,EAAE;YACV,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;gBACjC,IAAI,IAAI,CAAC,sBAAsB,CAAC,IAAI,EAAE,SAAS,EAAE,SAAS,GAAG,CAAC,EAAE,IAAI,CAAC,UAAU,CAAC,EAAE,wBAAwB,CAAC,EAAE;oBAC3G,SAAS,EAAE,CAAC;iBACb;qBAAM,IAAI,IAAI,CAAC,sBAAsB,CAAC,IAAI,EAAE,UAAU,EAAE,UAAU,GAAG,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,EAAE,wBAAwB,CAAC,EAAE;oBACnH,UAAU,EAAE,CAAC;iBACd;qBAAM;oBACL,MAAM;iBACP;aACF;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;gBACjB,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;aAC3B;SACF;QACD,OAAO,IAAI,CAAC;IACf,CAAC;IACD;;;OAGG;IACK,MAAM,CAAC,eAAe,CAAC,IAA6B;QAC1D,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;YACrB,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE;gBACxB,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;oBACtB,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC;aAC/B;YACD,OAAO;SACR;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,CAAE,EAAE,CAAC,EAAE;YAC3E,IAAkB,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,CAAC;SACtC;IACH,CAAC;IACD;;;OAGG;IACK,MAAM,CAAC,kBAAkB,CAAC,IAA6B;QAC7D,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;YACrB,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE;gBACxB,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;oBACtB,IAAI,CAAC,kBAAkB,CAAC,KAAK,CAAC,CAAC;aAClC;YACD,OAAO;SACR;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,CAAE,EAAE,CAAC,EAAE;YAC1E,IAAkB,CAAC,GAAG,EAAG,CAAC;SAC5B;IACD,CAAC;CACJ;AAhMD,kCAgMC","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 { Geometry } from \"../Geometry\";\r\nimport { GrowableXYZArray } from \"./GrowableXYZArray\";\r\nimport { Point3d } 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[], 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   */\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 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}\r\n"]}
+{"version":3,"file":"PolylineOps.js","sourceRoot":"","sources":["../../../src/geometry3d/PolylineOps.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;AAC/F;;GAEG;;;AAEH,0CAAuC;AACvC,yDAAsD;AAEtD,iFAA8E;AAC9E,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;YACtC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;SAClD;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;;;;;OAKG;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;YACzC,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;SACb;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;YACd,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;SAC7F;aAAM;YACL,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;SAC7F;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;YAC1B,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;SAC7B;QACD,IAAI,MAAM,EAAE;YACV,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;gBACjC,IAAI,IAAI,CAAC,sBAAsB,CAAC,IAAI,EAAE,SAAS,EAAE,SAAS,GAAG,CAAC,EAAE,IAAI,CAAC,UAAU,CAAC,EAAE,wBAAwB,CAAC,EAAE;oBAC3G,SAAS,EAAE,CAAC;iBACb;qBAAM,IAAI,IAAI,CAAC,sBAAsB,CAAC,IAAI,EAAE,UAAU,EAAE,UAAU,GAAG,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,EAAE,wBAAwB,CAAC,EAAE;oBACnH,UAAU,EAAE,CAAC;iBACd;qBAAM;oBACL,MAAM;iBACP;aACF;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;gBACjB,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;aAC3B;SACF;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;YACrB,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE;gBACxB,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;oBACtB,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC;aAC/B;YACD,OAAO;SACR;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;YAC1E,IAAkB,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,CAAC;SACtC;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;YACrB,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE;gBACxB,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;oBACtB,IAAI,CAAC,kBAAkB,CAAC,KAAK,CAAC,CAAC;aAClC;YACD,OAAO;SACR;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;YACzE,IAAkB,CAAC,GAAG,EAAE,CAAC;SAC3B;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,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;YAChD,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;gBAC9F,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;aACxC;SACF;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;YAC3C,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;gBAC/E,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;oBAClC,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;iBAC/G;aACF;SACF;QACD,OAAO,cAAc,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,SAAS,CAAC;IAChE,CAAC;CAEF;AAvPD,kCAuPC","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 { Geometry } from \"../Geometry\";\r\nimport { GrowableXYZArray } from \"./GrowableXYZArray\";\r\nimport { IndexedXYZCollection } from \"./IndexedXYZCollection\";\r\nimport { Plane3dByOriginAndUnitNormal } from \"./Plane3dByOriginAndUnitNormal\";\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 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}\r\n"]}