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

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

@@ -0,0 +1,63 @@
+/** @packageDocumentation
+ * @module CartesianGeometry
+ */
+import { Point3d } from "./Point3dVector3d";
+import { Range1d } from "./Range";
+/**
+ * PolylineOps is a collection of static methods operating on polylines.
+ * @public
+ */
+export declare class PolylineOps {
+    /**
+     * Return a Range1d with the shortest and longest edge lengths of the polyline.
+     * @param points points to examine.
+     */
+    static edgeLengthRange(points: Point3d[]): Range1d;
+    /**
+     * Return a simplified subset of given points.
+     * * Points are removed by the Douglas-Puecker algorithm, viz https://en.wikipedia.org/wiki/Ramer–Douglas–Peucker_algorithm
+     * * This is a global search, with multiple passes over the data.
+     * @param source
+     * @param chordTolerance
+     */
+    static compressByChordError(source: Point3d[], chordTolerance: number): Point3d[];
+    /**
+     * Return a simplified subset of given points, omitting points if very close to their neighbors.
+     * * This is a local search, with a single pass over the data.
+     * @param source input points
+     * @param maxEdgeLength
+     */
+    static compressShortEdges(source: Point3d[], 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.
+     * @param source input points
+     * @param maxEdgeLength
+     */
+    static compressSmallTriangles(source: Point3d[], maxTriangleArea: number): Point3d[];
+    /**
+     * Return a simplified subset of given points, omitting points if close to the edge between neighboring points before and after
+     * * This is a local search, with a single pass over the data for each pass.
+     * @param source input points
+     * @param maxDistance omit points if this close to edge between points before and after
+     * @param numPass max number of times to run the filter.  numPass=2 is observed to behave well.
+     *
+     */
+    static compressByPerpendicularDistance(source: Point3d[], maxDistance: number, numPass?: number): Point3d[];
+    private static squaredDistanceToInterpolatedPoint;
+    /**
+     * test if either
+     *   * points[indexA] matches pointQ
+     *   * line from points[indexA] to points[indexB] overlaps points[indexA] to pointQ
+     * @param points
+     * @param pointQ
+     * @param tolerance
+     */
+    private static isDanglerConfiguration;
+    /**
+       * Return a simplified subset of given points, omitting points on "danglers" that depart and return on a single path.
+       * @param source input points
+       */
+    static compressDanglers(source: Point3d[], closed?: boolean, tolerance?: number): Point3d[];
+}
+//# sourceMappingURL=PolylineOps.d.ts.map

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

@@ -0,0 +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;CAoCzI"}

package/lib/esm/geometry3d/PolylineOps.js

@@ -0,0 +1,172 @@
+/*---------------------------------------------------------------------------------------------
+* Copyright (c) Bentley Systems, Incorporated. All rights reserved.
+* See LICENSE.md in the project root for license terms and full copyright notice.
+*--------------------------------------------------------------------------------------------*/
+/** @packageDocumentation
+ * @module CartesianGeometry
+ */
+import { Geometry } from "../Geometry";
+import { GrowableXYZArray } from "./GrowableXYZArray";
+import { PolylineCompressionContext } from "./PolylineCompressionByEdgeOffset";
+import { Range1d } from "./Range";
+// cspell:word Puecker
+/**
+ * PolylineOps is a collection of static methods operating on polylines.
+ * @public
+ */
+export class PolylineOps {
+    /**
+     * Return a Range1d with the shortest and longest edge lengths of the polyline.
+     * @param points points to examine.
+     */
+    static edgeLengthRange(points) {
+        const range = Range1d.createNull();
+        for (let i = 1; i < points.length; i++) {
+            range.extendX(points[i - 1].distance(points[i]));
+        }
+        return range;
+    }
+    /**
+     * Return a simplified subset of given points.
+     * * Points are removed by the Douglas-Puecker algorithm, viz https://en.wikipedia.org/wiki/Ramer–Douglas–Peucker_algorithm
+     * * This is a global search, with multiple passes over the data.
+     * @param source
+     * @param chordTolerance
+     */
+    static compressByChordError(source, chordTolerance) {
+        return PolylineCompressionContext.compressPoint3dArrayByChordError(source, chordTolerance);
+    }
+    /**
+     * Return a simplified subset of given points, omitting points if very close to their neighbors.
+     * * This is a local search, with a single pass over the data.
+     * @param source input points
+     * @param maxEdgeLength
+     */
+    static compressShortEdges(source, maxEdgeLength) {
+        const dest = GrowableXYZArray.create(source);
+        PolylineCompressionContext.compressInPlaceByShortEdgeLength(dest, maxEdgeLength);
+        return dest.getPoint3dArray();
+    }
+    /**
+     * 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.
+     * @param source input points
+     * @param maxEdgeLength
+     */
+    static compressSmallTriangles(source, maxTriangleArea) {
+        const dest = GrowableXYZArray.create(source);
+        PolylineCompressionContext.compressInPlaceBySmallTriangleArea(dest, maxTriangleArea);
+        return dest.getPoint3dArray();
+    }
+    /**
+     * Return a simplified subset of given points, omitting points if close to the edge between neighboring points before and after
+     * * This is a local search, with a single pass over the data for each pass.
+     * @param source input points
+     * @param maxDistance omit points if this close to edge between points before and after
+     * @param numPass max number of times to run the filter.  numPass=2 is observed to behave well.
+     *
+     */
+    static compressByPerpendicularDistance(source, maxDistance, numPass = 2) {
+        const dest = GrowableXYZArray.create(source);
+        let num0 = dest.length;
+        for (let pass = 0; pass < numPass; pass++) {
+            PolylineCompressionContext.compressInPlaceByPerpendicularDistance(dest, maxDistance);
+            const num1 = dest.length;
+            if (num1 === num0)
+                break;
+            num0 = num1;
+        }
+        return dest.getPoint3dArray();
+    }
+    static squaredDistanceToInterpolatedPoint(pointQ, point0, fraction, point1) {
+        const g = 1.0 - fraction;
+        const dx = pointQ.x - (g * point0.x + fraction * point1.x);
+        const dy = pointQ.y - (g * point0.y + fraction * point1.y);
+        const dz = pointQ.z - (g * point0.z + fraction * point1.z);
+        return dx * dx + dy * dy + dz * dz;
+    }
+    /**
+     * test if either
+     *   * points[indexA] matches pointQ
+     *   * line from points[indexA] to points[indexB] overlaps points[indexA] to pointQ
+     * @param points
+     * @param pointQ
+     * @param tolerance
+     */
+    static isDanglerConfiguration(points, indexA, indexB, pointQ, squaredDistanceTolerance) {
+        if (indexA < 0 || indexA >= points.length)
+            return false;
+        const pointA = points[indexA];
+        // simple point match ...
+        const d2Q = pointA.distanceSquared(pointQ);
+        if (d2Q <= squaredDistanceTolerance)
+            return true;
+        if (indexB < 0 || indexB >= points.length)
+            return false;
+        const pointB = points[indexB];
+        // The expensive test .. does newPoint double back to an interior or extrapolation of the final dest segment?
+        //
+        // or pointQ
+        const dot = pointA.dotVectorsToTargets(pointB, pointQ);
+        // simple case -- pointB..pointA..pointQ continues forward
+        if (dot <= 0.0)
+            return false;
+        const d2B = pointA.distanceSquared(pointB);
+        let distanceSquared;
+        if (d2Q >= d2B) {
+            //                        pointB----------------------------------->>>>>>> pointA
+            //          pointQ<<<<---------------------------------------------------------
+            const fraction = dot / d2Q; // safe to divide because of earlier d2Q test.
+            distanceSquared = this.squaredDistanceToInterpolatedPoint(pointB, pointA, fraction, pointQ);
+        }
+        else {
+            //           pointB----------------------------------->>>>>>> pointA
+            //                         pointQ<<<<----------------------
+            const fraction = dot / d2B;
+            distanceSquared = this.squaredDistanceToInterpolatedPoint(pointQ, pointA, fraction, pointB);
+        }
+        return distanceSquared < squaredDistanceTolerance;
+    }
+    /**
+       * Return a simplified subset of given points, omitting points on "danglers" that depart and return on a single path.
+       * @param source input points
+       */
+    static compressDanglers(source, closed = false, tolerance = Geometry.smallMetricDistance) {
+        let n = source.length;
+        const squaredDistanceTolerance = tolerance * tolerance;
+        if (closed)
+            while (n > 1 && source[n - 1].distanceSquared(source[0]) <= squaredDistanceTolerance)
+                n--;
+        const dest = [];
+        dest.push(source[0].clone());
+        for (let i = 1; i < n; i++) {
+            const newPoint = source[i];
+            while (this.isDanglerConfiguration(dest, dest.length - 1, dest.length - 2, newPoint, squaredDistanceTolerance))
+                dest.pop();
+            dest.push(newPoint.clone());
+        }
+        if (closed) {
+            // No purge moving backwards.   Last point
+            let leftIndex = 0;
+            let rightIndex = dest.length - 1;
+            while (rightIndex > leftIndex + 2) {
+                if (this.isDanglerConfiguration(dest, leftIndex, leftIndex + 1, dest[rightIndex], squaredDistanceTolerance)) {
+                    leftIndex++;
+                }
+                else if (this.isDanglerConfiguration(dest, rightIndex, rightIndex - 1, dest[leftIndex], squaredDistanceTolerance)) {
+                    rightIndex--;
+                }
+                else {
+                    break;
+                }
+            }
+            if (rightIndex + 1 < dest.length)
+                dest.length = rightIndex + 1;
+            if (leftIndex > 0) {
+                dest.splice(0, leftIndex);
+            }
+        }
+        return dest;
+    }
+}
+//# sourceMappingURL=PolylineOps.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"PolylineOps.js","sourceRoot":"","sources":["../../../src/geometry3d/PolylineOps.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F;;GAEG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AACvC,OAAO,EAAE,gBAAgB,EAAE,MAAM,oBAAoB,CAAC;AAEtD,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;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,0BAA0B,CAAC,gCAAgC,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC;IAC7F,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,kBAAkB,CAAC,MAAiB,EAAE,aAAqB;QACvE,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;YACzC,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;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,QAAQ,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;CAEF","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}\r\n"]}