npm - @itwin/core-geometry - Versions diffs - 5.2.0-dev.25 → 5.2.0-dev.28 - Mend

@itwin/core-geometry 5.2.0-dev.25 → 5.2.0-dev.28

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (495) hide show

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

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

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

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