@itwin/core-geometry 5.2.0 → 5.2.1

package/lib/cjs/curve/CurveOps.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"CurveOps.d.ts","sourceRoot":"","sources":["../../../src/curve/CurveOps.ts"],"names":[],"mappings":"AAWA,OAAO,EAAE,0BAA0B,EAAE,MAAM,oCAAoC,CAAC;AAEhF,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AAC9C,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAC5C,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACpD,OAAO,EAAe,eAAe,EAAE,MAAM,mBAAmB,CAAC;AACjE,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAClD,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,cAAc,CAAC;AAIlD,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAC9C,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAC9B,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAChD,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAC9B,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAE9C;;;GAGG;AACH,MAAM,WAAW,qBAAqB;IACpC,oIAAoI;IACpI,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,0EAA0E;IAC1E,UAAU,CAAC,EAAE,OAAO,CAAC;IACrB,iJAAiJ;IACjJ,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB,gIAAgI;IAChI,YAAY,CAAC,EAAE,SAAS,CAAC;IACzB,sGAAsG;IACtG,WAAW,CAAC,EAAE,KAAK,CAAC;CACrB;AAEH;;;GAGG;AACH,qBAAa,QAAQ;IACnB,8GAA8G;WAChG,UAAU,CAAC,MAAM,EAAE,QAAQ,GAAG,QAAQ,EAAE,GAAG,MAAM;IAY/D,mIAAmI;WACrH,WAAW,CAAC,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,QAAQ,GAAG,QAAQ,EAAE,EAAE,SAAS,CAAC,EAAE,SAAS,GAAG,OAAO;IASxG;;;;;;;OAOG;WACW,eAAe,CAAC,MAAM,EAAE,QAAQ,GAAG,QAAQ,EAAE,GAAG,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,GAAG,MAAM;IAuBpH;;;;;;;;;OASG;WACW,gCAAgC,CAAC,SAAS,EAAE,QAAQ,EAAE,EAAE,cAAc,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,GAAG;QAAE,aAAa,EAAE,QAAQ,EAAE,CAAC;QAAC,cAAc,EAAE,QAAQ,EAAE,CAAC;QAAC,MAAM,CAAC,EAAE,QAAQ,CAAA;KAAE;IAgBjM;;;;;OAKG;WACW,sBAAsB,CAAC,MAAM,EAAE,IAAI,GAAG,IAAI,EAAE,uBAAuB,EAAE,MAAM,GAAG,aAAa,GAAG,eAAe,GAAG,SAAS;IAGvI;;;;OAIG;WACW,6BAA6B,CAAC,KAAK,EAAE,cAAc,EAAE,uBAAuB,EAAE,MAAM,GAAG,aAAa,GAAG,cAAc,GAAG,cAAc,EAAE,GAAG,SAAS;IAGlK;;;;;;;OAOG;WACW,aAAa,CAAC,SAAS,EAAE,QAAQ,EAAE,EAAE,YAAY,GAAE,MAAqC,EAAE,cAAc,CAAC,EAAE,MAAM,GAAG,QAAQ,GAAG,SAAS;IAOtJ;;;;;;;;OAQG;WACW,2BAA2B,CAAC,SAAS,EAAE,QAAQ,EAAE,EAAE,aAAa,EAAE,CAAC,WAAW,EAAE,YAAY,KAAK,IAAI,EAAE,aAAa,CAAC,EAAE,aAAa,EAAE,YAAY,GAAE,MAAqC,EAAE,eAAe,CAAC,EAAE,MAAM;IAOjO;;;;;;OAMG;WACW,iBAAiB,CAAC,MAAM,EAAE,QAAQ,GAAG,0BAA0B,EAAE,UAAU,EAAE,OAAO,EAAE,YAAY,CAAC,EAAE,SAAS,GAAG,OAAO;IAetI;;;;;;;;;;;OAWG;WACW,QAAQ,CAAC,MAAM,EAAE,QAAQ,GAAG,0BAA0B,EAAE,OAAO,CAAC,EAAE,qBAAqB,GAAG,SAAS,GAAG,SAAS;IAQ7H;;;;;;;;OAQG;WACW,UAAU,CAAC,MAAM,EAAE,QAAQ,GAAG,0BAA0B,EAAE,OAAO,CAAC,EAAE,qBAAqB,GAAG,KAAK,GAAG,SAAS;CAyC5H"}
+{"version":3,"file":"CurveOps.d.ts","sourceRoot":"","sources":["../../../src/curve/CurveOps.ts"],"names":[],"mappings":"AAWA,OAAO,EAAE,0BAA0B,EAAE,MAAM,oCAAoC,CAAC;AAEhF,OAAO,EAAE,OAAO,EAAE,MAAM,qBAAqB,CAAC;AAC9C,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAC5C,OAAO,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AACpD,OAAO,EAAe,eAAe,EAAE,MAAM,mBAAmB,CAAC;AACjE,OAAO,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAClD,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,cAAc,CAAC;AAIlD,OAAO,EAAE,YAAY,EAAE,MAAM,gBAAgB,CAAC;AAC9C,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAC9B,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAChD,OAAO,EAAE,IAAI,EAAE,MAAM,QAAQ,CAAC;AAC9B,OAAO,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAC;AAE9C;;;GAGG;AACH,MAAM,WAAW,qBAAqB;IACpC,oIAAoI;IACpI,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,0EAA0E;IAC1E,UAAU,CAAC,EAAE,OAAO,CAAC;IACrB,iJAAiJ;IACjJ,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB,gIAAgI;IAChI,YAAY,CAAC,EAAE,SAAS,CAAC;IACzB,sGAAsG;IACtG,WAAW,CAAC,EAAE,KAAK,CAAC;CACrB;AAEH;;;GAGG;AACH,qBAAa,QAAQ;IACnB,8GAA8G;WAChG,UAAU,CAAC,MAAM,EAAE,QAAQ,GAAG,QAAQ,EAAE,GAAG,MAAM;IAY/D,mIAAmI;WACrH,WAAW,CAAC,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,QAAQ,GAAG,QAAQ,EAAE,EAAE,SAAS,CAAC,EAAE,SAAS,GAAG,OAAO;IASxG;;;;;;;OAOG;WACW,eAAe,CAAC,MAAM,EAAE,QAAQ,GAAG,QAAQ,EAAE,GAAG,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,GAAG,MAAM;IAuBpH;;;;;;;;;OASG;WACW,gCAAgC,CAAC,SAAS,EAAE,QAAQ,EAAE,EAAE,cAAc,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,GAAG;QAAE,aAAa,EAAE,QAAQ,EAAE,CAAC;QAAC,cAAc,EAAE,QAAQ,EAAE,CAAC;QAAC,MAAM,CAAC,EAAE,QAAQ,CAAA;KAAE;IAgBjM;;;;;OAKG;WACW,sBAAsB,CAAC,MAAM,EAAE,IAAI,GAAG,IAAI,EAAE,uBAAuB,EAAE,MAAM,GAAG,aAAa,GAAG,eAAe,GAAG,SAAS;IAGvI;;;;OAIG;WACW,6BAA6B,CAAC,KAAK,EAAE,cAAc,EAAE,uBAAuB,EAAE,MAAM,GAAG,aAAa,GAAG,cAAc,GAAG,cAAc,EAAE,GAAG,SAAS;IAGlK;;;;;;;OAOG;WACW,aAAa,CAAC,SAAS,EAAE,QAAQ,EAAE,EAAE,YAAY,GAAE,MAAqC,EAAE,cAAc,CAAC,EAAE,MAAM,GAAG,QAAQ,GAAG,SAAS;IAOtJ;;;;;;;;OAQG;WACW,2BAA2B,CAAC,SAAS,EAAE,QAAQ,EAAE,EAAE,aAAa,EAAE,CAAC,WAAW,EAAE,YAAY,KAAK,IAAI,EAAE,aAAa,CAAC,EAAE,aAAa,EAAE,YAAY,GAAE,MAAqC,EAAE,eAAe,CAAC,EAAE,MAAM;IAOjO;;;;;;OAMG;WACW,iBAAiB,CAAC,MAAM,EAAE,QAAQ,GAAG,0BAA0B,EAAE,UAAU,EAAE,OAAO,EAAE,YAAY,CAAC,EAAE,SAAS,GAAG,OAAO;IAetI;;;;;;;;;;OAUG;WACW,QAAQ,CAAC,MAAM,EAAE,QAAQ,GAAG,0BAA0B,EAAE,OAAO,CAAC,EAAE,qBAAqB,GAAG,SAAS,GAAG,SAAS;IAQ7H;;;;;;OAMG;WACW,UAAU,CAAC,MAAM,EAAE,QAAQ,GAAG,0BAA0B,EAAE,OAAO,CAAC,EAAE,qBAAqB,GAAG,KAAK,GAAG,SAAS;CAyC5H"}

package/lib/cjs/curve/CurveOps.js

@@ -186,8 +186,7 @@ class CurveOps {
     /**
      * Check whether or not the curves are planar, and if so, return a localToWorld frame.
      * @param curves input geometry: curves or points.
-     * @param tolerance optional maximum allowable planar deviation, default [[Geometry.smallMetricDistance]].
-     * @param result optional pre-allocated object to populate and return.
+     * @param options bundle of options.
      * @returns localToWorld frame `T` for coplanar curves, or undefined if they are not coplanar.
      * `T` satisfies:
      * * `T.origin` is in the plane.
@@ -207,9 +206,7 @@ class CurveOps {
      * Check whether or not the curves lie in a straight line, and if so, return a colinear ray.
      * * This test does not take curve traversal or point order into account.
      * @param curves input geometry: curves or points.
-     * @param xyOnly whether to ignore z-coordinates of input geometry.
-     * @param tolerance optional maximum allowable linear deviation, default [[Geometry.smallMetricDistance]].
-     * @param result optional pre-allocated object to populate and return.
+     * @param options bundle of options.
      * @returns ray colinear with input, or undefined if input is not colinear.
      */
     static isColinear(curves, options) {

package/lib/cjs/curve/CurveOps.js.map

@@ -1 +1 @@
-{"version":3,"file":"CurveOps.js","sourceRoot":"","sources":["../../../src/curve/CurveOps.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AAEH,0CAAkD;AAClD,6DAA0D;AAE1D,mEAAyD;AACzD,+CAA8C;AAC9C,+CAA4C;AAC5C,uDAAoD;AACpD,uDAAiE;AACjE,qDAAkD;AAElD,mDAAgD;AAChD,gFAA6E;AAC7E,kFAAsF;AAEtF,iCAA8B;AAE9B,iCAA8B;AAoB9B;;;GAGG;AACH,MAAa,QAAQ;IACnB,8GAA8G;IACvG,MAAM,CAAC,UAAU,CAAC,MAA6B;QACpD,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,MAAM,YAAY,+BAAc,EAAE,CAAC;YACrC,KAAK,IAAI,MAAM,CAAC,WAAW,EAAE,CAAC;QAChC,CAAC;aAAM,IAAI,MAAM,YAAY,iCAAe,EAAE,CAAC;YAC7C,KAAK,IAAI,MAAM,CAAC,UAAU,EAAE,CAAC;QAC/B,CAAC;aAAM,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;YACjC,KAAK,MAAM,KAAK,IAAI,MAAM;gBACxB,KAAK,IAAI,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QACpC,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,mIAAmI;IAC5H,MAAM,CAAC,WAAW,CAAC,KAAc,EAAE,MAA6B,EAAE,SAAqB;QAC5F,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;YAC1B,KAAK,MAAM,KAAK,IAAI,MAAM;gBACxB,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;QAC9C,CAAC;aAAM,CAAC;YACN,MAAM,CAAC,WAAW,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;QACvC,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;;OAOG;IACI,MAAM,CAAC,eAAe,CAAC,MAAyC,EAAE,MAAc,EAAE,MAAkB;QACzG,IAAI,aAAa,GAAG,CAAC,CAAC;QACtB,IAAI,MAAM,YAAY,+BAAc,EAAE,CAAC;YACrC,MAAM,OAAO,GAAG,kDAA2B,CAAC,sBAAsB,CAAC,WAAI,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC,CAAC;YAChG,IAAI,OAAO,EAAE,CAAC;gBACZ,aAAa,IAAI,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;gBAC1C,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACvB,CAAC;QACH,CAAC;aAAM,IAAI,MAAM,YAAY,WAAI,IAAI,MAAM,YAAY,WAAI,EAAE,CAAC;YAC5D,MAAM,OAAO,GAAG,kDAA2B,CAAC,sBAAsB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;YACnF,IAAI,OAAO,EAAE,CAAC;gBACZ,aAAa,IAAI,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;gBAC1C,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACvB,CAAC;QACH,CAAC;aAAM,IAAI,MAAM,YAAY,6BAAW,EAAE,CAAC;YACzC,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,QAAQ;gBAC7B,aAAa,IAAI,IAAI,CAAC,eAAe,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;QAC7D,CAAC;aAAM,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;YACjC,KAAK,MAAM,CAAC,IAAI,MAAM;gBACpB,aAAa,IAAI,IAAI,CAAC,eAAe,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;QAC7D,CAAC;QACD,OAAO,aAAa,CAAC;IACvB,CAAC;IACD;;;;;;;;;OASG;IACI,MAAM,CAAC,gCAAgC,CAAC,SAAqB,EAAE,cAAsB,EAAE,YAAoB;QAChH,MAAM,SAAS,GAAG,IAAI,yCAAmB,CAAC,YAAY,EAAE,YAAY,CAAC,CAAC;QACtE,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;YAC1B,SAAS,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC5B,CAAC;QACD,MAAM,MAAM,GAAG,SAAS,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QAC1C,MAAM,SAAS,GAAsB,EAAE,CAAC;QACxC,MAAM,SAAS,GAAsB,EAAE,CAAC;QACxC,MAAM,aAAa,GAAG,QAAQ,CAAC,eAAe,CAAC,MAAM,EAAE,cAAc,EAAE,SAAS,CAAC,CAAC;QAClF,MAAM,aAAa,GAAG,QAAQ,CAAC,eAAe,CAAC,MAAM,EAAE,CAAC,cAAc,EAAE,SAAS,CAAC,CAAC;QACnF,IAAI,aAAa,GAAG,aAAa,EAAE,CAAC;YAClC,OAAO,EAAE,cAAc,EAAE,SAAS,EAAE,aAAa,EAAE,SAAS,EAAE,MAAM,EAAE,CAAC;QACzE,CAAC;aAAM,CAAC;YACN,OAAO,EAAE,aAAa,EAAE,SAAS,EAAE,cAAc,EAAE,SAAS,EAAE,MAAM,EAAE,CAAC;QACzE,CAAC;IACH,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,sBAAsB,CAAC,MAAmB,EAAE,uBAA+C;QACvG,OAAO,kDAA2B,CAAC,sBAAsB,CAAC,MAAM,EAAE,uBAAuB,CAAC,CAAC;IAC7F,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,6BAA6B,CAAC,KAAqB,EAAE,uBAA+C;QAChH,OAAO,kDAA2B,CAAC,6BAA6B,CAAC,KAAK,EAAE,uBAAuB,CAAC,CAAC;IACnG,CAAC;IACD;;;;;;;OAOG;IACI,MAAM,CAAC,aAAa,CAAC,SAAqB,EAAE,eAAuB,mBAAQ,CAAC,mBAAmB,EAAE,cAAuB;QAC7H,MAAM,SAAS,GAAG,IAAI,yCAAmB,CAAC,YAAY,EAAE,cAAc,CAAC,CAAC;QACxE,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;YAC1B,SAAS,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC5B,CAAC;QACD,OAAO,SAAS,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;IACpC,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,2BAA2B,CAAC,SAAqB,EAAE,aAAkD,EAAE,aAA6B,EAAE,eAAuB,mBAAQ,CAAC,mBAAmB,EAAE,eAAwB;QAC/N,MAAM,SAAS,GAAG,IAAI,yCAAmB,CAAC,YAAY,CAAC,CAAC,CAAC,gCAAgC;QACzF,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;YAC1B,SAAS,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC5B,CAAC;QACD,SAAS,CAAC,4BAA4B,CAAC,aAAa,EAAE,aAAa,CAAC,CAAC;IACvE,CAAC;IACD;;;;;;OAMG;IACI,MAAM,CAAC,iBAAiB,CAAC,MAA6C,EAAE,UAAmB,EAAE,YAAwB;QAC1H,MAAM,WAAW,GAAU,CAAC,MAAM,CAAC,CAAC;QACpC,IAAI,YAAY;YACd,WAAW,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QACjC,YAAY,GAAG,2BAAY,CAAC,sBAAsB,CAAC,0BAAQ,CAAC,KAAK,EAAE,EAAE,GAAG,WAAW,CAAC,CAAC;QACrF,IAAI,CAAC,YAAY;YACf,OAAO,KAAK,CAAC;QACf,MAAM,YAAY,GAAG,YAAY,CAAC,OAAO,EAAE,CAAC;QAC5C,UAAU,CAAC,OAAO,EAAE,CAAC;QACrB,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM,YAAY,6BAAa,CAAC;YAC7D,eAAO,CAAC,qBAAqB,CAAC,MAAM,EAAE,YAAY,EAAE,UAAU,CAAC,CAAC;;YAEhE,IAAI,CAAC,WAAW,CAAC,UAAU,EAAE,MAAM,EAAE,YAAY,CAAC,CAAC;QACrD,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;;;;;;;;;;OAWG;IACI,MAAM,CAAC,QAAQ,CAAC,MAA6C,EAAE,OAA+B;QACnG,MAAM,UAAU,GAAG,eAAO,CAAC,MAAM,EAAE,CAAC;QACpC,MAAM,YAAY,GAAG,OAAO,EAAE,YAAY,IAAI,qBAAS,CAAC,cAAc,EAAE,CAAC;QACzE,IAAI,CAAC,IAAI,CAAC,iBAAiB,CAAC,MAAM,EAAE,UAAU,EAAE,YAAY,CAAC;YAC3D,OAAO,SAAS,CAAC;QACnB,MAAM,WAAW,GAAG,OAAO,EAAE,YAAY,IAAI,mBAAQ,CAAC,mBAAmB,CAAC;QAC1E,OAAO,CAAC,UAAU,CAAC,OAAO,EAAE,IAAI,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,SAAS,CAAC;IACpF,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,UAAU,CAAC,MAA6C,EAAE,OAA+B;QACrG,MAAM,UAAU,GAAG,eAAO,CAAC,MAAM,EAAE,CAAC;QACpC,MAAM,YAAY,GAAG,OAAO,EAAE,YAAY,IAAI,qBAAS,CAAC,cAAc,EAAE,CAAC;QACzE,IAAI,CAAC,IAAI,CAAC,iBAAiB,CAAC,MAAM,EAAE,UAAU,EAAE,YAAY,CAAC;YAC3D,OAAO,SAAS,CAAC;QACnB,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,YAAY,IAAI,mBAAQ,CAAC,mBAAmB,CAAC,CAAC;QACpF,IAAI,UAAU,CAAC,OAAO,EAAE,GAAG,WAAW;YACpC,OAAO,SAAS,CAAC,CAAC,aAAa;QAEjC,MAAM,GAAG,GAAG,OAAO,EAAE,WAAW,IAAI,aAAK,CAAC,UAAU,EAAE,CAAC;QACvD,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;QAExC,MAAM,OAAO,GAAG,UAAU,CAAC,OAAO,EAAE,CAAC;QACrC,MAAM,OAAO,GAAG,UAAU,CAAC,OAAO,EAAE,CAAC;QACrC,IAAI,OAAO,IAAI,WAAW,IAAI,OAAO,IAAI,WAAW,EAAE,CAAC;YACrD,GAAG,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC;YACxB,OAAO,GAAG,CAAC,CAAC,mCAAmC;QACjD,CAAC;QACD,IAAI,OAAO,IAAI,WAAW,EAAE,CAAC;YAC3B,YAAY,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YAC3C,OAAO,GAAG,CAAC,CAAC,oCAAoC;QAClD,CAAC;QACD,IAAI,OAAO,IAAI,WAAW,EAAE,CAAC;YAC3B,YAAY,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YAC3C,OAAO,GAAG,CAAC,CAAC,oCAAoC;QAClD,CAAC;QACD,IAAI,CAAC,OAAO,EAAE,UAAU;YACtB,OAAO,SAAS,CAAC,CAAC,eAAe;QAEnC,MAAM,cAAc,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,eAAe,IAAI,mBAAQ,CAAC,iBAAiB,CAAC,CAAC;QACxF,MAAM,sBAAsB,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,MAAM,CAAC,YAAY,CAAC,oBAAS,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAChG,IAAI,sBAAsB,GAAG,cAAc,EAAE,2CAA2C;YACtF,OAAO,SAAS,CAAC,CAAC,kBAAkB;QAEtC,IAAI,OAAO,GAAG,OAAO;YACnB,YAAY,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;;YAE3C,YAAY,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QAC7C,GAAG,CAAC,SAAS,CAAC,CAAC,GAAG,GAAG,CAAC;QACtB,OAAO,GAAG,CAAC,CAAC,kCAAkC;IAChD,CAAC;CACF;AA7ND,4BA6NC","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\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\n\r\nimport { AxisIndex, Geometry } from \"../Geometry\";\r\nimport { FrameBuilder } from \"../geometry3d/FrameBuilder\";\r\nimport { MultiLineStringDataVariant } from \"../geometry3d/IndexedXYZCollection\";\r\nimport { Vector3d } from \"../geometry3d/Point3dVector3d\";\r\nimport { Range3d } from \"../geometry3d/Range\";\r\nimport { Ray3d } from \"../geometry3d/Ray3d\";\r\nimport { Transform } from \"../geometry3d/Transform\";\r\nimport { BagOfCurves, CurveCollection } from \"./CurveCollection\";\r\nimport { CurvePrimitive } from \"./CurvePrimitive\";\r\nimport { AnyChain, AnyCurve } from \"./CurveTypes\";\r\nimport { GeometryQuery } from \"./GeometryQuery\";\r\nimport { MultiChainCollector } from \"./internalContexts/MultiChainCollector\";\r\nimport { CurveChainWireOffsetContext } from \"./internalContexts/PolygonOffsetContext\";\r\nimport { LineString3d } from \"./LineString3d\";\r\nimport { Loop } from \"./Loop\";\r\nimport { OffsetOptions } from \"./OffsetOptions\";\r\nimport { Path } from \"./Path\";\r\nimport { StrokeOptions } from \"./StrokeOptions\";\r\n\r\n  /**\r\n   * Options bundle for use in [[CurveOps.isPlanar]] and [[CurveOps.isColinear]].\r\n   * @public\r\n   */\r\n  export interface PlanarColinearOptions {\r\n    /** Maximum allowable distance that geometry can deviate from planarity/colinearity. Default is [[Geometry.smallMetricDistance]]. */\r\n    maxDeviation?: number;\r\n    /** Whether colinearity test ignores z-coordinates. Default is `false`. */\r\n    xyColinear?: boolean;\r\n    /** Radian tolerance for xy-colinearity, measuring maximum angular deviation from a vertical plane. Default is [[Geometry.smallAngleRadians]]. */\r\n    radianTolerance?: number;\r\n    /** Pre-allocated object to populate with the computed plane-to-world transformation and return when planarity test succeeds. */\r\n    localToWorld?: Transform;\r\n    /** Pre-allocated object to populate with the computed line and return when colinear test succeeds. */\r\n    colinearRay?: Ray3d;\r\n  }\r\n\r\n/**\r\n * Static methods for miscellaneous curve operations.\r\n * @public\r\n */\r\nexport class CurveOps {\r\n  /** Recursively sum curve lengths, allowing CurvePrimitive, CurveCollection, or array of such at any level. */\r\n  public static sumLengths(curves: AnyCurve | AnyCurve[]): number {\r\n    let mySum = 0;\r\n    if (curves instanceof CurvePrimitive) {\r\n      mySum += curves.curveLength();\r\n    } else if (curves instanceof CurveCollection) {\r\n      mySum += curves.sumLengths();\r\n    } else if (Array.isArray(curves)) {\r\n      for (const data1 of curves)\r\n        mySum += this.sumLengths(data1);\r\n    }\r\n    return mySum;\r\n  }\r\n  /** Recursively extend the range by each curve's range, allowing CurvePrimitive, CurveCollection, or array of such at any level. */\r\n  public static extendRange(range: Range3d, curves: AnyCurve | AnyCurve[], transform?: Transform): Range3d {\r\n    if (Array.isArray(curves)) {\r\n      for (const data1 of curves)\r\n        this.extendRange(range, data1, transform);\r\n    } else {\r\n      curves.extendRange(range, transform);\r\n    }\r\n    return range;\r\n  }\r\n  /**\r\n   * Construct a separate xy-offset for each input curve.\r\n   * * For best offset results, the inputs should be parallel to the xy-plane.\r\n   * @param curves input curve(s), z-coordinates ignored. Only curves of type [[AnyChain]] are handled.\r\n   * @param offset offset distance (positive to left of curve, negative to right)\r\n   * @param result array to collect offset curves\r\n   * @returns summed length of offset curves\r\n   */\r\n  public static appendXYOffsets(curves: AnyCurve | AnyCurve[] | undefined, offset: number, result: AnyCurve[]): number {\r\n    let summedLengths = 0;\r\n    if (curves instanceof CurvePrimitive) {\r\n      const resultA = CurveChainWireOffsetContext.constructCurveXYOffset(Path.create(curves), offset);\r\n      if (resultA) {\r\n        summedLengths += this.sumLengths(resultA);\r\n        result.push(resultA);\r\n      }\r\n    } else if (curves instanceof Loop || curves instanceof Path) {\r\n      const resultA = CurveChainWireOffsetContext.constructCurveXYOffset(curves, offset);\r\n      if (resultA) {\r\n        summedLengths += this.sumLengths(resultA);\r\n        result.push(resultA);\r\n      }\r\n    } else if (curves instanceof BagOfCurves) {\r\n      for (const q of curves.children)\r\n        summedLengths += this.appendXYOffsets(q, offset, result);\r\n    } else if (Array.isArray(curves)) {\r\n      for (const q of curves)\r\n        summedLengths += this.appendXYOffsets(q, offset, result);\r\n    }\r\n    return summedLengths;\r\n  }\r\n  /**\r\n   * Restructure curve fragments as Paths and Loops, and construct xy-offsets of the chains.\r\n   * * If the inputs do not form Loop(s), the classification of offsets is suspect.\r\n   * * For best offset results, the inputs should be parallel to the xy-plane.\r\n   * * Chain formation is dependent upon input fragment order, as a greedy algorithm is employed.\r\n   * @param fragments fragments to be chained and offset\r\n   * @param offsetDistance offset distance, applied to both sides of each fragment to produce inside and outside xy-offset curves.\r\n   * @param gapTolerance distance to be treated as \"effectively zero\" when joining head-to-tail\r\n   * @returns object with named chains, insideOffsets, outsideOffsets\r\n   */\r\n  public static collectInsideAndOutsideXYOffsets(fragments: AnyCurve[], offsetDistance: number, gapTolerance: number): { insideOffsets: AnyCurve[], outsideOffsets: AnyCurve[], chains?: AnyChain } {\r\n    const collector = new MultiChainCollector(gapTolerance, gapTolerance);\r\n    for (const s of fragments) {\r\n      collector.captureCurve(s);\r\n    }\r\n    const chains = collector.grabResult(true);\r\n    const myOffsetA: CurveCollection[] = [];\r\n    const myOffsetB: CurveCollection[] = [];\r\n    const offsetLengthA = CurveOps.appendXYOffsets(chains, offsetDistance, myOffsetA);\r\n    const offsetLengthB = CurveOps.appendXYOffsets(chains, -offsetDistance, myOffsetB);\r\n    if (offsetLengthA > offsetLengthB) {\r\n      return { outsideOffsets: myOffsetA, insideOffsets: myOffsetB, chains };\r\n    } else {\r\n      return { insideOffsets: myOffsetA, outsideOffsets: myOffsetB, chains };\r\n    }\r\n  }\r\n  /**\r\n   * Construct curves that are offset from a Path or Loop as viewed in xy-plane (ignoring z).\r\n   * * The construction will remove \"some\" local effects of features smaller than the offset distance, but will not detect self intersection among widely separated edges.\r\n   * @param curves base curves.\r\n   * @param offsetDistanceOrOptions offset distance (positive to left of curve, negative to right) or options object.\r\n   */\r\n  public static constructCurveXYOffset(curves: Path | Loop, offsetDistanceOrOptions: number | OffsetOptions): CurveCollection | undefined {\r\n    return CurveChainWireOffsetContext.constructCurveXYOffset(curves, offsetDistanceOrOptions);\r\n  }\r\n  /**\r\n   * Create the offset of a single curve primitive as viewed in the xy-plane (ignoring z).\r\n   * @param curve primitive to offset\r\n   * @param offsetDistanceOrOptions offset distance (positive to left of curve, negative to right) or options object\r\n   */\r\n  public static createSingleOffsetPrimitiveXY(curve: CurvePrimitive, offsetDistanceOrOptions: number | OffsetOptions): CurvePrimitive | CurvePrimitive[] | undefined {\r\n    return CurveChainWireOffsetContext.createSingleOffsetPrimitiveXY(curve, offsetDistanceOrOptions);\r\n  }\r\n  /**\r\n   * Restructure curve fragments as Paths and Loops.\r\n   * * Chain formation is dependent upon input fragment order, as a greedy algorithm is employed.\r\n   * @param fragments fragments to be chained\r\n   * @param gapTolerance distance to be treated as \"effectively zero\" when assembling fragments head-to-tail\r\n   * @param planeTolerance tolerance for considering a closed chain to be planar. If undefined, only create Path. If defined, create Loops for closed chains within tolerance of a plane.\r\n   * @returns chains, possibly wrapped in a [[BagOfCurves]].\r\n   */\r\n  public static collectChains(fragments: AnyCurve[], gapTolerance: number = Geometry.smallMetricDistance, planeTolerance?: number): AnyChain | undefined {\r\n    const collector = new MultiChainCollector(gapTolerance, planeTolerance);\r\n    for (const s of fragments) {\r\n      collector.captureCurve(s);\r\n    }\r\n    return collector.grabResult(true);\r\n  }\r\n  /**\r\n   * Restructure curve fragments, to be stroked and passed into the callback.\r\n   * * Chain formation is dependent upon input fragment order, as a greedy algorithm is employed.\r\n   * @param fragments fragments to be chained and stroked\r\n   * @param announceChain callback to process each stroked Path and Loop\r\n   * @param strokeOptions options for stroking the chains\r\n   * @param gapTolerance distance to be treated as \"effectively zero\" when assembling fragments head-to-tail. Also used for removing duplicate points in the stroked chains.\r\n   * @param _planeTolerance unused, pass undefined\r\n   */\r\n  public static collectChainsAsLineString3d(fragments: AnyCurve[], announceChain: (chainPoints: LineString3d) => void, strokeOptions?: StrokeOptions, gapTolerance: number = Geometry.smallMetricDistance, _planeTolerance?: number) {\r\n    const collector = new MultiChainCollector(gapTolerance); // no planarity tolerance needed\r\n    for (const s of fragments) {\r\n      collector.captureCurve(s);\r\n    }\r\n    collector.announceChainsAsLineString3d(announceChain, strokeOptions);\r\n  }\r\n  /**\r\n   * Compute the range of the curves in the local coordinates of a constructed localToWorld frame.\r\n   * @param curves input geometry: curves or points.\r\n   * @param localRange pre-allocated object to populate with the computed local range.\r\n   * @param localToWorld optional pre-allocated object to populate with the computed frame.\r\n   * @returns whether the frame was successfully computed.\r\n   */\r\n  public static computeLocalRange(curves: AnyCurve | MultiLineStringDataVariant, localRange: Range3d, localToWorld?: Transform): boolean {\r\n    const builderData: any[] = [curves];\r\n    if (localToWorld)\r\n      builderData.push(localToWorld);\r\n    localToWorld = FrameBuilder.createRightHandedFrame(Vector3d.unitZ(), ...builderData);\r\n    if (!localToWorld)\r\n      return false;\r\n    const worldToLocal = localToWorld.inverse();\r\n    localRange.setNull();\r\n    if (Array.isArray(curves) || !(curves instanceof GeometryQuery))\r\n      Range3d.createFromVariantData(curves, worldToLocal, localRange);\r\n    else\r\n      this.extendRange(localRange, curves, worldToLocal);\r\n    return true;\r\n  }\r\n  /**\r\n   * Check whether or not the curves are planar, and if so, return a localToWorld frame.\r\n   * @param curves input geometry: curves or points.\r\n   * @param tolerance optional maximum allowable planar deviation, default [[Geometry.smallMetricDistance]].\r\n   * @param result optional pre-allocated object to populate and return.\r\n   * @returns localToWorld frame `T` for coplanar curves, or undefined if they are not coplanar.\r\n   * `T` satisfies:\r\n   * * `T.origin` is in the plane.\r\n   * * `T.matrix.columnZ()` is the plane unit normal (or its negative).\r\n   * * `T.matrix.isRigid()` returns true.\r\n   * * `T.inverse()` is worldToLocal; apply to input geometry to rotate it into the xy-plane.\r\n   */\r\n  public static isPlanar(curves: AnyCurve | MultiLineStringDataVariant, options?: PlanarColinearOptions): Transform | undefined {\r\n    const localRange = Range3d.create();\r\n    const localToWorld = options?.localToWorld ?? Transform.createIdentity();\r\n    if (!this.computeLocalRange(curves, localRange, localToWorld))\r\n      return undefined;\r\n    const maxAltitude = options?.maxDeviation ?? Geometry.smallMetricDistance;\r\n    return (localRange.zLength() <= Math.abs(maxAltitude)) ? localToWorld : undefined;\r\n  }\r\n  /**\r\n   * Check whether or not the curves lie in a straight line, and if so, return a colinear ray.\r\n   * * This test does not take curve traversal or point order into account.\r\n   * @param curves input geometry: curves or points.\r\n   * @param xyOnly whether to ignore z-coordinates of input geometry.\r\n   * @param tolerance optional maximum allowable linear deviation, default [[Geometry.smallMetricDistance]].\r\n   * @param result optional pre-allocated object to populate and return.\r\n   * @returns ray colinear with input, or undefined if input is not colinear.\r\n   */\r\n  public static isColinear(curves: AnyCurve | MultiLineStringDataVariant, options?: PlanarColinearOptions): Ray3d | undefined {\r\n    const localRange = Range3d.create();\r\n    const localToWorld = options?.localToWorld ?? Transform.createIdentity();\r\n    if (!this.computeLocalRange(curves, localRange, localToWorld))\r\n      return undefined;\r\n    const maxAltitude = Math.abs(options?.maxDeviation ?? Geometry.smallMetricDistance);\r\n    if (localRange.zLength() > maxAltitude)\r\n      return undefined; // non-planar\r\n\r\n    const ray = options?.colinearRay ?? Ray3d.createZero();\r\n    ray.origin.setFrom(localToWorld.origin);\r\n\r\n    const xLength = localRange.xLength();\r\n    const yLength = localRange.yLength();\r\n    if (xLength <= maxAltitude && yLength <= maxAltitude) {\r\n      ray.direction.setZero();\r\n      return ray; // the input is essentially a point\r\n    }\r\n    if (yLength <= maxAltitude) {\r\n      localToWorld.matrix.columnX(ray.direction);\r\n      return ray; // the input lies along local x-axis\r\n    }\r\n    if (xLength <= maxAltitude) {\r\n      localToWorld.matrix.columnY(ray.direction);\r\n      return ray; // the input lies along local y-axis\r\n    }\r\n    if (!options?.xyColinear)\r\n      return undefined; // non-colinear\r\n\r\n    const angleTolerance = Math.abs(options?.radianTolerance ?? Geometry.smallAngleRadians);\r\n    const verticalPlaneDeviation = Math.abs(localToWorld.matrix.columnDotXYZ(AxisIndex.Z, 0, 0, 1));\r\n    if (verticalPlaneDeviation > angleTolerance) // cos(t + pi/2) = -sin(t) ~ -t for small t\r\n      return undefined; // non-xy-colinear\r\n\r\n    if (xLength > yLength)\r\n      localToWorld.matrix.columnX(ray.direction);\r\n    else\r\n      localToWorld.matrix.columnY(ray.direction);\r\n    ray.direction.z = 0.0;\r\n    return ray; // xy-colinear (plane is vertical)\r\n  }\r\n}\r\n"]}
+{"version":3,"file":"CurveOps.js","sourceRoot":"","sources":["../../../src/curve/CurveOps.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AAEH,0CAAkD;AAClD,6DAA0D;AAE1D,mEAAyD;AACzD,+CAA8C;AAC9C,+CAA4C;AAC5C,uDAAoD;AACpD,uDAAiE;AACjE,qDAAkD;AAElD,mDAAgD;AAChD,gFAA6E;AAC7E,kFAAsF;AAEtF,iCAA8B;AAE9B,iCAA8B;AAoB9B;;;GAGG;AACH,MAAa,QAAQ;IACnB,8GAA8G;IACvG,MAAM,CAAC,UAAU,CAAC,MAA6B;QACpD,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,MAAM,YAAY,+BAAc,EAAE,CAAC;YACrC,KAAK,IAAI,MAAM,CAAC,WAAW,EAAE,CAAC;QAChC,CAAC;aAAM,IAAI,MAAM,YAAY,iCAAe,EAAE,CAAC;YAC7C,KAAK,IAAI,MAAM,CAAC,UAAU,EAAE,CAAC;QAC/B,CAAC;aAAM,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;YACjC,KAAK,MAAM,KAAK,IAAI,MAAM;gBACxB,KAAK,IAAI,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QACpC,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,mIAAmI;IAC5H,MAAM,CAAC,WAAW,CAAC,KAAc,EAAE,MAA6B,EAAE,SAAqB;QAC5F,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;YAC1B,KAAK,MAAM,KAAK,IAAI,MAAM;gBACxB,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;QAC9C,CAAC;aAAM,CAAC;YACN,MAAM,CAAC,WAAW,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;QACvC,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD;;;;;;;OAOG;IACI,MAAM,CAAC,eAAe,CAAC,MAAyC,EAAE,MAAc,EAAE,MAAkB;QACzG,IAAI,aAAa,GAAG,CAAC,CAAC;QACtB,IAAI,MAAM,YAAY,+BAAc,EAAE,CAAC;YACrC,MAAM,OAAO,GAAG,kDAA2B,CAAC,sBAAsB,CAAC,WAAI,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC,CAAC;YAChG,IAAI,OAAO,EAAE,CAAC;gBACZ,aAAa,IAAI,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;gBAC1C,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACvB,CAAC;QACH,CAAC;aAAM,IAAI,MAAM,YAAY,WAAI,IAAI,MAAM,YAAY,WAAI,EAAE,CAAC;YAC5D,MAAM,OAAO,GAAG,kDAA2B,CAAC,sBAAsB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;YACnF,IAAI,OAAO,EAAE,CAAC;gBACZ,aAAa,IAAI,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;gBAC1C,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACvB,CAAC;QACH,CAAC;aAAM,IAAI,MAAM,YAAY,6BAAW,EAAE,CAAC;YACzC,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,QAAQ;gBAC7B,aAAa,IAAI,IAAI,CAAC,eAAe,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;QAC7D,CAAC;aAAM,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;YACjC,KAAK,MAAM,CAAC,IAAI,MAAM;gBACpB,aAAa,IAAI,IAAI,CAAC,eAAe,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;QAC7D,CAAC;QACD,OAAO,aAAa,CAAC;IACvB,CAAC;IACD;;;;;;;;;OASG;IACI,MAAM,CAAC,gCAAgC,CAAC,SAAqB,EAAE,cAAsB,EAAE,YAAoB;QAChH,MAAM,SAAS,GAAG,IAAI,yCAAmB,CAAC,YAAY,EAAE,YAAY,CAAC,CAAC;QACtE,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;YAC1B,SAAS,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC5B,CAAC;QACD,MAAM,MAAM,GAAG,SAAS,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QAC1C,MAAM,SAAS,GAAsB,EAAE,CAAC;QACxC,MAAM,SAAS,GAAsB,EAAE,CAAC;QACxC,MAAM,aAAa,GAAG,QAAQ,CAAC,eAAe,CAAC,MAAM,EAAE,cAAc,EAAE,SAAS,CAAC,CAAC;QAClF,MAAM,aAAa,GAAG,QAAQ,CAAC,eAAe,CAAC,MAAM,EAAE,CAAC,cAAc,EAAE,SAAS,CAAC,CAAC;QACnF,IAAI,aAAa,GAAG,aAAa,EAAE,CAAC;YAClC,OAAO,EAAE,cAAc,EAAE,SAAS,EAAE,aAAa,EAAE,SAAS,EAAE,MAAM,EAAE,CAAC;QACzE,CAAC;aAAM,CAAC;YACN,OAAO,EAAE,aAAa,EAAE,SAAS,EAAE,cAAc,EAAE,SAAS,EAAE,MAAM,EAAE,CAAC;QACzE,CAAC;IACH,CAAC;IACD;;;;;OAKG;IACI,MAAM,CAAC,sBAAsB,CAAC,MAAmB,EAAE,uBAA+C;QACvG,OAAO,kDAA2B,CAAC,sBAAsB,CAAC,MAAM,EAAE,uBAAuB,CAAC,CAAC;IAC7F,CAAC;IACD;;;;OAIG;IACI,MAAM,CAAC,6BAA6B,CAAC,KAAqB,EAAE,uBAA+C;QAChH,OAAO,kDAA2B,CAAC,6BAA6B,CAAC,KAAK,EAAE,uBAAuB,CAAC,CAAC;IACnG,CAAC;IACD;;;;;;;OAOG;IACI,MAAM,CAAC,aAAa,CAAC,SAAqB,EAAE,eAAuB,mBAAQ,CAAC,mBAAmB,EAAE,cAAuB;QAC7H,MAAM,SAAS,GAAG,IAAI,yCAAmB,CAAC,YAAY,EAAE,cAAc,CAAC,CAAC;QACxE,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;YAC1B,SAAS,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC5B,CAAC;QACD,OAAO,SAAS,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;IACpC,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,2BAA2B,CAAC,SAAqB,EAAE,aAAkD,EAAE,aAA6B,EAAE,eAAuB,mBAAQ,CAAC,mBAAmB,EAAE,eAAwB;QAC/N,MAAM,SAAS,GAAG,IAAI,yCAAmB,CAAC,YAAY,CAAC,CAAC,CAAC,gCAAgC;QACzF,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;YAC1B,SAAS,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC5B,CAAC;QACD,SAAS,CAAC,4BAA4B,CAAC,aAAa,EAAE,aAAa,CAAC,CAAC;IACvE,CAAC;IACD;;;;;;OAMG;IACI,MAAM,CAAC,iBAAiB,CAAC,MAA6C,EAAE,UAAmB,EAAE,YAAwB;QAC1H,MAAM,WAAW,GAAU,CAAC,MAAM,CAAC,CAAC;QACpC,IAAI,YAAY;YACd,WAAW,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QACjC,YAAY,GAAG,2BAAY,CAAC,sBAAsB,CAAC,0BAAQ,CAAC,KAAK,EAAE,EAAE,GAAG,WAAW,CAAC,CAAC;QACrF,IAAI,CAAC,YAAY;YACf,OAAO,KAAK,CAAC;QACf,MAAM,YAAY,GAAG,YAAY,CAAC,OAAO,EAAE,CAAC;QAC5C,UAAU,CAAC,OAAO,EAAE,CAAC;QACrB,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM,YAAY,6BAAa,CAAC;YAC7D,eAAO,CAAC,qBAAqB,CAAC,MAAM,EAAE,YAAY,EAAE,UAAU,CAAC,CAAC;;YAEhE,IAAI,CAAC,WAAW,CAAC,UAAU,EAAE,MAAM,EAAE,YAAY,CAAC,CAAC;QACrD,OAAO,IAAI,CAAC;IACd,CAAC;IACD;;;;;;;;;;OAUG;IACI,MAAM,CAAC,QAAQ,CAAC,MAA6C,EAAE,OAA+B;QACnG,MAAM,UAAU,GAAG,eAAO,CAAC,MAAM,EAAE,CAAC;QACpC,MAAM,YAAY,GAAG,OAAO,EAAE,YAAY,IAAI,qBAAS,CAAC,cAAc,EAAE,CAAC;QACzE,IAAI,CAAC,IAAI,CAAC,iBAAiB,CAAC,MAAM,EAAE,UAAU,EAAE,YAAY,CAAC;YAC3D,OAAO,SAAS,CAAC;QACnB,MAAM,WAAW,GAAG,OAAO,EAAE,YAAY,IAAI,mBAAQ,CAAC,mBAAmB,CAAC;QAC1E,OAAO,CAAC,UAAU,CAAC,OAAO,EAAE,IAAI,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,SAAS,CAAC;IACpF,CAAC;IACD;;;;;;OAMG;IACI,MAAM,CAAC,UAAU,CAAC,MAA6C,EAAE,OAA+B;QACrG,MAAM,UAAU,GAAG,eAAO,CAAC,MAAM,EAAE,CAAC;QACpC,MAAM,YAAY,GAAG,OAAO,EAAE,YAAY,IAAI,qBAAS,CAAC,cAAc,EAAE,CAAC;QACzE,IAAI,CAAC,IAAI,CAAC,iBAAiB,CAAC,MAAM,EAAE,UAAU,EAAE,YAAY,CAAC;YAC3D,OAAO,SAAS,CAAC;QACnB,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,YAAY,IAAI,mBAAQ,CAAC,mBAAmB,CAAC,CAAC;QACpF,IAAI,UAAU,CAAC,OAAO,EAAE,GAAG,WAAW;YACpC,OAAO,SAAS,CAAC,CAAC,aAAa;QAEjC,MAAM,GAAG,GAAG,OAAO,EAAE,WAAW,IAAI,aAAK,CAAC,UAAU,EAAE,CAAC;QACvD,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;QAExC,MAAM,OAAO,GAAG,UAAU,CAAC,OAAO,EAAE,CAAC;QACrC,MAAM,OAAO,GAAG,UAAU,CAAC,OAAO,EAAE,CAAC;QACrC,IAAI,OAAO,IAAI,WAAW,IAAI,OAAO,IAAI,WAAW,EAAE,CAAC;YACrD,GAAG,CAAC,SAAS,CAAC,OAAO,EAAE,CAAC;YACxB,OAAO,GAAG,CAAC,CAAC,mCAAmC;QACjD,CAAC;QACD,IAAI,OAAO,IAAI,WAAW,EAAE,CAAC;YAC3B,YAAY,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YAC3C,OAAO,GAAG,CAAC,CAAC,oCAAoC;QAClD,CAAC;QACD,IAAI,OAAO,IAAI,WAAW,EAAE,CAAC;YAC3B,YAAY,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YAC3C,OAAO,GAAG,CAAC,CAAC,oCAAoC;QAClD,CAAC;QACD,IAAI,CAAC,OAAO,EAAE,UAAU;YACtB,OAAO,SAAS,CAAC,CAAC,eAAe;QAEnC,MAAM,cAAc,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,eAAe,IAAI,mBAAQ,CAAC,iBAAiB,CAAC,CAAC;QACxF,MAAM,sBAAsB,GAAG,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,MAAM,CAAC,YAAY,CAAC,oBAAS,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QAChG,IAAI,sBAAsB,GAAG,cAAc,EAAE,2CAA2C;YACtF,OAAO,SAAS,CAAC,CAAC,kBAAkB;QAEtC,IAAI,OAAO,GAAG,OAAO;YACnB,YAAY,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;;YAE3C,YAAY,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QAC7C,GAAG,CAAC,SAAS,CAAC,CAAC,GAAG,GAAG,CAAC;QACtB,OAAO,GAAG,CAAC,CAAC,kCAAkC;IAChD,CAAC;CACF;AA1ND,4BA0NC","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\r\n/** @packageDocumentation\r\n * @module Curve\r\n */\r\n\r\nimport { AxisIndex, Geometry } from \"../Geometry\";\r\nimport { FrameBuilder } from \"../geometry3d/FrameBuilder\";\r\nimport { MultiLineStringDataVariant } from \"../geometry3d/IndexedXYZCollection\";\r\nimport { Vector3d } from \"../geometry3d/Point3dVector3d\";\r\nimport { Range3d } from \"../geometry3d/Range\";\r\nimport { Ray3d } from \"../geometry3d/Ray3d\";\r\nimport { Transform } from \"../geometry3d/Transform\";\r\nimport { BagOfCurves, CurveCollection } from \"./CurveCollection\";\r\nimport { CurvePrimitive } from \"./CurvePrimitive\";\r\nimport { AnyChain, AnyCurve } from \"./CurveTypes\";\r\nimport { GeometryQuery } from \"./GeometryQuery\";\r\nimport { MultiChainCollector } from \"./internalContexts/MultiChainCollector\";\r\nimport { CurveChainWireOffsetContext } from \"./internalContexts/PolygonOffsetContext\";\r\nimport { LineString3d } from \"./LineString3d\";\r\nimport { Loop } from \"./Loop\";\r\nimport { OffsetOptions } from \"./OffsetOptions\";\r\nimport { Path } from \"./Path\";\r\nimport { StrokeOptions } from \"./StrokeOptions\";\r\n\r\n  /**\r\n   * Options bundle for use in [[CurveOps.isPlanar]] and [[CurveOps.isColinear]].\r\n   * @public\r\n   */\r\n  export interface PlanarColinearOptions {\r\n    /** Maximum allowable distance that geometry can deviate from planarity/colinearity. Default is [[Geometry.smallMetricDistance]]. */\r\n    maxDeviation?: number;\r\n    /** Whether colinearity test ignores z-coordinates. Default is `false`. */\r\n    xyColinear?: boolean;\r\n    /** Radian tolerance for xy-colinearity, measuring maximum angular deviation from a vertical plane. Default is [[Geometry.smallAngleRadians]]. */\r\n    radianTolerance?: number;\r\n    /** Pre-allocated object to populate with the computed plane-to-world transformation and return when planarity test succeeds. */\r\n    localToWorld?: Transform;\r\n    /** Pre-allocated object to populate with the computed line and return when colinear test succeeds. */\r\n    colinearRay?: Ray3d;\r\n  }\r\n\r\n/**\r\n * Static methods for miscellaneous curve operations.\r\n * @public\r\n */\r\nexport class CurveOps {\r\n  /** Recursively sum curve lengths, allowing CurvePrimitive, CurveCollection, or array of such at any level. */\r\n  public static sumLengths(curves: AnyCurve | AnyCurve[]): number {\r\n    let mySum = 0;\r\n    if (curves instanceof CurvePrimitive) {\r\n      mySum += curves.curveLength();\r\n    } else if (curves instanceof CurveCollection) {\r\n      mySum += curves.sumLengths();\r\n    } else if (Array.isArray(curves)) {\r\n      for (const data1 of curves)\r\n        mySum += this.sumLengths(data1);\r\n    }\r\n    return mySum;\r\n  }\r\n  /** Recursively extend the range by each curve's range, allowing CurvePrimitive, CurveCollection, or array of such at any level. */\r\n  public static extendRange(range: Range3d, curves: AnyCurve | AnyCurve[], transform?: Transform): Range3d {\r\n    if (Array.isArray(curves)) {\r\n      for (const data1 of curves)\r\n        this.extendRange(range, data1, transform);\r\n    } else {\r\n      curves.extendRange(range, transform);\r\n    }\r\n    return range;\r\n  }\r\n  /**\r\n   * Construct a separate xy-offset for each input curve.\r\n   * * For best offset results, the inputs should be parallel to the xy-plane.\r\n   * @param curves input curve(s), z-coordinates ignored. Only curves of type [[AnyChain]] are handled.\r\n   * @param offset offset distance (positive to left of curve, negative to right)\r\n   * @param result array to collect offset curves\r\n   * @returns summed length of offset curves\r\n   */\r\n  public static appendXYOffsets(curves: AnyCurve | AnyCurve[] | undefined, offset: number, result: AnyCurve[]): number {\r\n    let summedLengths = 0;\r\n    if (curves instanceof CurvePrimitive) {\r\n      const resultA = CurveChainWireOffsetContext.constructCurveXYOffset(Path.create(curves), offset);\r\n      if (resultA) {\r\n        summedLengths += this.sumLengths(resultA);\r\n        result.push(resultA);\r\n      }\r\n    } else if (curves instanceof Loop || curves instanceof Path) {\r\n      const resultA = CurveChainWireOffsetContext.constructCurveXYOffset(curves, offset);\r\n      if (resultA) {\r\n        summedLengths += this.sumLengths(resultA);\r\n        result.push(resultA);\r\n      }\r\n    } else if (curves instanceof BagOfCurves) {\r\n      for (const q of curves.children)\r\n        summedLengths += this.appendXYOffsets(q, offset, result);\r\n    } else if (Array.isArray(curves)) {\r\n      for (const q of curves)\r\n        summedLengths += this.appendXYOffsets(q, offset, result);\r\n    }\r\n    return summedLengths;\r\n  }\r\n  /**\r\n   * Restructure curve fragments as Paths and Loops, and construct xy-offsets of the chains.\r\n   * * If the inputs do not form Loop(s), the classification of offsets is suspect.\r\n   * * For best offset results, the inputs should be parallel to the xy-plane.\r\n   * * Chain formation is dependent upon input fragment order, as a greedy algorithm is employed.\r\n   * @param fragments fragments to be chained and offset\r\n   * @param offsetDistance offset distance, applied to both sides of each fragment to produce inside and outside xy-offset curves.\r\n   * @param gapTolerance distance to be treated as \"effectively zero\" when joining head-to-tail\r\n   * @returns object with named chains, insideOffsets, outsideOffsets\r\n   */\r\n  public static collectInsideAndOutsideXYOffsets(fragments: AnyCurve[], offsetDistance: number, gapTolerance: number): { insideOffsets: AnyCurve[], outsideOffsets: AnyCurve[], chains?: AnyChain } {\r\n    const collector = new MultiChainCollector(gapTolerance, gapTolerance);\r\n    for (const s of fragments) {\r\n      collector.captureCurve(s);\r\n    }\r\n    const chains = collector.grabResult(true);\r\n    const myOffsetA: CurveCollection[] = [];\r\n    const myOffsetB: CurveCollection[] = [];\r\n    const offsetLengthA = CurveOps.appendXYOffsets(chains, offsetDistance, myOffsetA);\r\n    const offsetLengthB = CurveOps.appendXYOffsets(chains, -offsetDistance, myOffsetB);\r\n    if (offsetLengthA > offsetLengthB) {\r\n      return { outsideOffsets: myOffsetA, insideOffsets: myOffsetB, chains };\r\n    } else {\r\n      return { insideOffsets: myOffsetA, outsideOffsets: myOffsetB, chains };\r\n    }\r\n  }\r\n  /**\r\n   * Construct curves that are offset from a Path or Loop as viewed in xy-plane (ignoring z).\r\n   * * The construction will remove \"some\" local effects of features smaller than the offset distance, but will not detect self intersection among widely separated edges.\r\n   * @param curves base curves.\r\n   * @param offsetDistanceOrOptions offset distance (positive to left of curve, negative to right) or options object.\r\n   */\r\n  public static constructCurveXYOffset(curves: Path | Loop, offsetDistanceOrOptions: number | OffsetOptions): CurveCollection | undefined {\r\n    return CurveChainWireOffsetContext.constructCurveXYOffset(curves, offsetDistanceOrOptions);\r\n  }\r\n  /**\r\n   * Create the offset of a single curve primitive as viewed in the xy-plane (ignoring z).\r\n   * @param curve primitive to offset\r\n   * @param offsetDistanceOrOptions offset distance (positive to left of curve, negative to right) or options object\r\n   */\r\n  public static createSingleOffsetPrimitiveXY(curve: CurvePrimitive, offsetDistanceOrOptions: number | OffsetOptions): CurvePrimitive | CurvePrimitive[] | undefined {\r\n    return CurveChainWireOffsetContext.createSingleOffsetPrimitiveXY(curve, offsetDistanceOrOptions);\r\n  }\r\n  /**\r\n   * Restructure curve fragments as Paths and Loops.\r\n   * * Chain formation is dependent upon input fragment order, as a greedy algorithm is employed.\r\n   * @param fragments fragments to be chained\r\n   * @param gapTolerance distance to be treated as \"effectively zero\" when assembling fragments head-to-tail\r\n   * @param planeTolerance tolerance for considering a closed chain to be planar. If undefined, only create Path. If defined, create Loops for closed chains within tolerance of a plane.\r\n   * @returns chains, possibly wrapped in a [[BagOfCurves]].\r\n   */\r\n  public static collectChains(fragments: AnyCurve[], gapTolerance: number = Geometry.smallMetricDistance, planeTolerance?: number): AnyChain | undefined {\r\n    const collector = new MultiChainCollector(gapTolerance, planeTolerance);\r\n    for (const s of fragments) {\r\n      collector.captureCurve(s);\r\n    }\r\n    return collector.grabResult(true);\r\n  }\r\n  /**\r\n   * Restructure curve fragments, to be stroked and passed into the callback.\r\n   * * Chain formation is dependent upon input fragment order, as a greedy algorithm is employed.\r\n   * @param fragments fragments to be chained and stroked\r\n   * @param announceChain callback to process each stroked Path and Loop\r\n   * @param strokeOptions options for stroking the chains\r\n   * @param gapTolerance distance to be treated as \"effectively zero\" when assembling fragments head-to-tail. Also used for removing duplicate points in the stroked chains.\r\n   * @param _planeTolerance unused, pass undefined\r\n   */\r\n  public static collectChainsAsLineString3d(fragments: AnyCurve[], announceChain: (chainPoints: LineString3d) => void, strokeOptions?: StrokeOptions, gapTolerance: number = Geometry.smallMetricDistance, _planeTolerance?: number) {\r\n    const collector = new MultiChainCollector(gapTolerance); // no planarity tolerance needed\r\n    for (const s of fragments) {\r\n      collector.captureCurve(s);\r\n    }\r\n    collector.announceChainsAsLineString3d(announceChain, strokeOptions);\r\n  }\r\n  /**\r\n   * Compute the range of the curves in the local coordinates of a constructed localToWorld frame.\r\n   * @param curves input geometry: curves or points.\r\n   * @param localRange pre-allocated object to populate with the computed local range.\r\n   * @param localToWorld optional pre-allocated object to populate with the computed frame.\r\n   * @returns whether the frame was successfully computed.\r\n   */\r\n  public static computeLocalRange(curves: AnyCurve | MultiLineStringDataVariant, localRange: Range3d, localToWorld?: Transform): boolean {\r\n    const builderData: any[] = [curves];\r\n    if (localToWorld)\r\n      builderData.push(localToWorld);\r\n    localToWorld = FrameBuilder.createRightHandedFrame(Vector3d.unitZ(), ...builderData);\r\n    if (!localToWorld)\r\n      return false;\r\n    const worldToLocal = localToWorld.inverse();\r\n    localRange.setNull();\r\n    if (Array.isArray(curves) || !(curves instanceof GeometryQuery))\r\n      Range3d.createFromVariantData(curves, worldToLocal, localRange);\r\n    else\r\n      this.extendRange(localRange, curves, worldToLocal);\r\n    return true;\r\n  }\r\n  /**\r\n   * Check whether or not the curves are planar, and if so, return a localToWorld frame.\r\n   * @param curves input geometry: curves or points.\r\n   * @param options bundle of options.\r\n   * @returns localToWorld frame `T` for coplanar curves, or undefined if they are not coplanar.\r\n   * `T` satisfies:\r\n   * * `T.origin` is in the plane.\r\n   * * `T.matrix.columnZ()` is the plane unit normal (or its negative).\r\n   * * `T.matrix.isRigid()` returns true.\r\n   * * `T.inverse()` is worldToLocal; apply to input geometry to rotate it into the xy-plane.\r\n   */\r\n  public static isPlanar(curves: AnyCurve | MultiLineStringDataVariant, options?: PlanarColinearOptions): Transform | undefined {\r\n    const localRange = Range3d.create();\r\n    const localToWorld = options?.localToWorld ?? Transform.createIdentity();\r\n    if (!this.computeLocalRange(curves, localRange, localToWorld))\r\n      return undefined;\r\n    const maxAltitude = options?.maxDeviation ?? Geometry.smallMetricDistance;\r\n    return (localRange.zLength() <= Math.abs(maxAltitude)) ? localToWorld : undefined;\r\n  }\r\n  /**\r\n   * Check whether or not the curves lie in a straight line, and if so, return a colinear ray.\r\n   * * This test does not take curve traversal or point order into account.\r\n   * @param curves input geometry: curves or points.\r\n   * @param options bundle of options.\r\n   * @returns ray colinear with input, or undefined if input is not colinear.\r\n   */\r\n  public static isColinear(curves: AnyCurve | MultiLineStringDataVariant, options?: PlanarColinearOptions): Ray3d | undefined {\r\n    const localRange = Range3d.create();\r\n    const localToWorld = options?.localToWorld ?? Transform.createIdentity();\r\n    if (!this.computeLocalRange(curves, localRange, localToWorld))\r\n      return undefined;\r\n    const maxAltitude = Math.abs(options?.maxDeviation ?? Geometry.smallMetricDistance);\r\n    if (localRange.zLength() > maxAltitude)\r\n      return undefined; // non-planar\r\n\r\n    const ray = options?.colinearRay ?? Ray3d.createZero();\r\n    ray.origin.setFrom(localToWorld.origin);\r\n\r\n    const xLength = localRange.xLength();\r\n    const yLength = localRange.yLength();\r\n    if (xLength <= maxAltitude && yLength <= maxAltitude) {\r\n      ray.direction.setZero();\r\n      return ray; // the input is essentially a point\r\n    }\r\n    if (yLength <= maxAltitude) {\r\n      localToWorld.matrix.columnX(ray.direction);\r\n      return ray; // the input lies along local x-axis\r\n    }\r\n    if (xLength <= maxAltitude) {\r\n      localToWorld.matrix.columnY(ray.direction);\r\n      return ray; // the input lies along local y-axis\r\n    }\r\n    if (!options?.xyColinear)\r\n      return undefined; // non-colinear\r\n\r\n    const angleTolerance = Math.abs(options?.radianTolerance ?? Geometry.smallAngleRadians);\r\n    const verticalPlaneDeviation = Math.abs(localToWorld.matrix.columnDotXYZ(AxisIndex.Z, 0, 0, 1));\r\n    if (verticalPlaneDeviation > angleTolerance) // cos(t + pi/2) = -sin(t) ~ -t for small t\r\n      return undefined; // non-xy-colinear\r\n\r\n    if (xLength > yLength)\r\n      localToWorld.matrix.columnX(ray.direction);\r\n    else\r\n      localToWorld.matrix.columnY(ray.direction);\r\n    ray.direction.z = 0.0;\r\n    return ray; // xy-colinear (plane is vertical)\r\n  }\r\n}\r\n"]}

package/lib/cjs/curve/Query/PlanarSubdivision.d.ts

@@ -8,20 +8,28 @@ import { ParityRegion } from "../ParityRegion";
  */
 export declare class PlanarSubdivision {
     /**
-     * Create a graph from an array of curves, and an array of the curves' precomputed intersections.
-     * Z-coordinates are ignored.
+     * Create a graph from curves and precomputed intersections.
+     * * Z-coordinates are ignored.
+     * @param primitives input curves
+     * @param allPairs array of curve-curve xy-intersections
+     * @param mergeTolerance optional distance tolerance for clustering vertices. Default value is [[Geometry.smallMetricDistance]].
      */
     static assembleHalfEdgeGraph(primitives: CurvePrimitive[], allPairs: CurveLocationDetailPair[], mergeTolerance?: number): HalfEdgeGraph;
     /**
-     * Create a pair of mated half edges referencing an interval of a primitive.
-     * * no action if start and end points are identical.
+     * Filter for trivial curve fragment: fast computation if line segment; otherwise clip, flatten, and measure.
+     * * Different metrics are employed for expedience.
+    */
+    private static isCurveTrivialXY;
+    /**
+     * Create a pair of mated half edges referencing a non-trivial interval of a primitive.
      * @param graph containing graph
      * @param p the curve
      * @param point0 start point
      * @param fraction0 starting fraction
      * @param point1 end point
      * @param fraction1 end fraction
-     * @returns end point and fraction, or start point and fraction if no action
+     * @param mergeTolerance optional maximum xy-length of a trivial edge
+     * @returns end point and fraction
      */
     private static addHalfEdge;
     /**
@@ -39,27 +47,54 @@ export declare class PlanarSubdivision {
     /**
      * Create a [[Loop]] for the given face or super face.
      * @param face a node in the face loop, or an array of HalfEdges that comprise a loop (e.g., a super face).
-     * @param announce optional callback invoked on each edge/curve of the face/Loop.
-     * @param compress whether to consolidate adjacent curves in the output Loop (default `false`).
-     * If `announce` is provided, no compression is performed, as edges and curves would no longer be in 1-1 correspondence.
-     * @param closureTol absolute xy-distance for confirming the returned Loop is closed (default [[Geometry.smallMetricDistance]]).
+     * @param options bundle of options.
      * @returns the Loop, or `undefined` if it is not closed within xy-tolerance.
      */
-    static createLoopInFace(face: HalfEdge | HalfEdge[], announce?: (he: HalfEdge, curve: CurvePrimitive, loop: Loop) => void, compress?: boolean, closureTol?: number): Loop | undefined;
+    static createLoopInFace(face: HalfEdge | HalfEdge[], options?: PlanarSubdivision.CreateRegionInFaceOptions): Loop | undefined;
     /**
      * Create a [[Loop]] or [[ParityRegion]] for the given face.
      * * A ParityRegion is created for a split-washer type face by removing bridge edges.
      * @param face a node in the face loop.
-     * @param bridgeMask mask preset on bridge edges (default is `HalfEdgeMask.BRIDGE_EDGE`).
-     * @param visitMask mask to use for visiting edges in the face loop (default is `HalfEdgeMask.VISITED`).
-     * @param closureTol absolute xy-distance for confirming the returned Loop is closed (default [[Geometry.smallMetricDistance]]).
-     * @returns the Loop or ParityRegion, or `undefined` if one could not be computed
+     * @param options bundle of options.
+     * @returns the Loop or ParityRegion, or `undefined` if one could not be computed.
      */
-    static createLoopOrParityRegionInFace(face: HalfEdge, bridgeMask?: HalfEdgeMask, visitMask?: HalfEdgeMask, closureTol?: number): Loop | ParityRegion | undefined;
+    static createLoopOrParityRegionInFace(face: HalfEdge, options?: PlanarSubdivision.CreateRegionInFaceOptions): Loop | ParityRegion | undefined;
     /** Return true if there are only two edges in the face loop, and their start curvatures are the same. */
     private static isNullFace;
     /** Look across edge mates (possibly several) for a non-null mate face. */
     private static getNonNullEdgeMate;
     static collectSignedLoopSetsInHalfEdgeGraph(graph: HalfEdgeGraph, zeroAreaTolerance?: number): SignedLoops[];
 }
+/**
+ * @internal
+*/
+export declare namespace PlanarSubdivision {
+    /** Options bundle for [[PlanarSubdivision.createLoopInFace]] and [[PlanarSubdivision.createLoopOrParityRegionInFace]]. */
+    interface CreateRegionInFaceOptions {
+        /**
+         * Optional callback invoked on each `edge` before its `curve` is added to `loop`.
+         * * Note that if a [[ParityRegion]] is being constructed, `curve` and `loop` may subsequently be reversed.
+         */
+        announceEdge?: (edge: HalfEdge, curve: CurvePrimitive, loop: Loop) => void;
+        /**
+         * Whether to consolidate adjacent curves in an output [[Loop]]. Default value is `false`.
+         * * If `announce` is defined, no compression is performed, as edges and curves would no longer be in 1-1 correspondence.
+         */
+        compress?: boolean;
+        /** Absolute xy-distance for confirming a returned Loop is closed. Default value is [[Geometry.smallMetricDistance]]. */
+        closureTol?: number;
+        /**
+         * Mask preset on bridge edges. Default value is `HalfEdgeMask.BRIDGE_EDGE`.
+         * * This mask is used to distinguish a split-washer type face, which can result in a [[ParityRegion]].
+         */
+        bridgeMask?: HalfEdgeMask;
+        /** Mask to use for visiting edges when creating a [[ParityRegion]] from a split-washer type face. Default value is `HalfEdgeMask.VISITED`. */
+        visitMask?: HalfEdgeMask;
+        /**
+         * Optional z-coordinate for the result region.
+         * * If undefined, graph z-coordinates are used, but this may result in a non-planar region if the graph is not planar!
+         */
+        z?: number;
+    }
+}
 //# sourceMappingURL=PlanarSubdivision.d.ts.map

package/lib/cjs/curve/Query/PlanarSubdivision.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"PlanarSubdivision.d.ts","sourceRoot":"","sources":["../../../../src/curve/Query/PlanarSubdivision.ts"],"names":[],"mappings":"AAOA,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,sBAAsB,CAAC;AAI7E,OAAO,EAAuB,uBAAuB,EAAE,MAAM,wBAAwB,CAAC;AACtF,OAAO,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AAInD,OAAO,EAAE,IAAI,EAAsB,WAAW,EAAE,MAAM,SAAS,CAAC;AAChE,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAyE/C;;GAEG;AACH,qBAAa,iBAAiB;IAC5B;;;OAGG;WACW,qBAAqB,CACjC,UAAU,EAAE,cAAc,EAAE,EAC5B,QAAQ,EAAE,uBAAuB,EAAE,EACnC,cAAc,GAAE,MAAqC,GACpD,aAAa;IA2ChB;;;;;;;;;;OAUG;IACH,OAAO,CAAC,MAAM,CAAC,WAAW;IAwB1B;;;;;;OAMG;WACW,iBAAiB,CAC7B,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,WAAW,EAAE,iBAAiB,GAAE,MAAgB,EAAE,YAAY,CAAC,EAAE,OAAO,GAC7F,MAAM;IAeT,sDAAsD;IACtD,OAAO,CAAC,MAAM,CAAC,uBAAuB;IAUtC,kDAAkD;IAClD,OAAO,CAAC,MAAM,CAAC,iBAAiB;IAShC;;;;;;;;OAQG;WACW,gBAAgB,CAC5B,IAAI,EAAE,QAAQ,GAAG,QAAQ,EAAE,EAC3B,QAAQ,CAAC,EAAE,CAAC,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,cAAc,EAAE,IAAI,EAAE,IAAI,KAAK,IAAI,EACpE,QAAQ,GAAE,OAAe,EACzB,UAAU,GAAE,MAAqC,GAChD,IAAI,GAAG,SAAS;IAyBnB;;;;;;;;OAQG;WACW,8BAA8B,CAC1C,IAAI,EAAE,QAAQ,EACd,UAAU,GAAE,YAAuC,EACnD,SAAS,GAAE,YAAmC,EAC9C,UAAU,GAAE,MAAqC,GAChD,IAAI,GAAG,YAAY,GAAG,SAAS;IAiClC,yGAAyG;IACzG,OAAO,CAAC,MAAM,CAAC,UAAU;IAWzB,0EAA0E;IAC1E,OAAO,CAAC,MAAM,CAAC,kBAAkB;WAWnB,oCAAoC,CAAC,KAAK,EAAE,aAAa,EAAE,iBAAiB,GAAE,MAAgB,GAAG,WAAW,EAAE;CAmC7H"}
+{"version":3,"file":"PlanarSubdivision.d.ts","sourceRoot":"","sources":["../../../../src/curve/Query/PlanarSubdivision.ts"],"names":[],"mappings":"AAQA,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,sBAAsB,CAAC;AAI7E,OAAO,EAAuB,uBAAuB,EAAE,MAAM,wBAAwB,CAAC;AACtF,OAAO,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC;AAInD,OAAO,EAAE,IAAI,EAAsB,WAAW,EAAE,MAAM,SAAS,CAAC;AAChE,OAAO,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AA6F/C;;GAEG;AACH,qBAAa,iBAAiB;IAC5B;;;;;;OAMG;WACW,qBAAqB,CACjC,UAAU,EAAE,cAAc,EAAE,EAC5B,QAAQ,EAAE,uBAAuB,EAAE,EACnC,cAAc,GAAE,MAAqC,GACpD,aAAa;IA4ChB;;;MAGE;IACF,OAAO,CAAC,MAAM,CAAC,gBAAgB;IAW/B;;;;;;;;;;OAUG;IACH,OAAO,CAAC,MAAM,CAAC,WAAW;IAwB1B;;;;;;OAMG;WACW,iBAAiB,CAC7B,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,WAAW,EAAE,iBAAiB,GAAE,MAAgB,EAAE,YAAY,CAAC,EAAE,OAAO,GAC7F,MAAM;IAeT,sDAAsD;IACtD,OAAO,CAAC,MAAM,CAAC,uBAAuB;IAUtC,kDAAkD;IAClD,OAAO,CAAC,MAAM,CAAC,iBAAiB;IAYhC;;;;;OAKG;WACW,gBAAgB,CAAC,IAAI,EAAE,QAAQ,GAAG,QAAQ,EAAE,EAAE,OAAO,CAAC,EAAE,iBAAiB,CAAC,yBAAyB,GAAG,IAAI,GAAG,SAAS;IAwBpI;;;;;;OAMG;WACW,8BAA8B,CAAC,IAAI,EAAE,QAAQ,EAAE,OAAO,CAAC,EAAE,iBAAiB,CAAC,yBAAyB,GAAG,IAAI,GAAG,YAAY,GAAG,SAAS;IAqCpJ,yGAAyG;IACzG,OAAO,CAAC,MAAM,CAAC,UAAU;IAWzB,0EAA0E;IAC1E,OAAO,CAAC,MAAM,CAAC,kBAAkB;WAWnB,oCAAoC,CAAC,KAAK,EAAE,aAAa,EAAE,iBAAiB,GAAE,MAAgB,GAAG,WAAW,EAAE;CAkC7H;AAED;;EAEE;AACF,yBAAiB,iBAAiB,CAAC;IACjC,0HAA0H;IAC1H,UAAiB,yBAAyB;QACxC;;;WAGG;QACH,YAAY,CAAC,EAAE,CAAC,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,cAAc,EAAE,IAAI,EAAE,IAAI,KAAK,IAAI,CAAC;QAC3E;;;WAGG;QACH,QAAQ,CAAC,EAAE,OAAO,CAAC;QACnB,wHAAwH;QACxH,UAAU,CAAC,EAAE,MAAM,CAAC;QACpB;;;WAGG;QACH,UAAU,CAAC,EAAE,YAAY,CAAC;QAC1B,8IAA8I;QAC9I,SAAS,CAAC,EAAE,YAAY,CAAC;QACzB;;;WAGG;QACH,CAAC,CAAC,EAAE,MAAM,CAAC;KACZ;CACF"}

package/lib/cjs/curve/Query/PlanarSubdivision.js

@@ -7,6 +7,7 @@ exports.PlanarSubdivision = void 0;
 *--------------------------------------------------------------------------------------------*/
 const core_bentley_1 = require("@itwin/core-bentley");
 const Geometry_1 = require("../../Geometry");
+const Transform_1 = require("../../geometry3d/Transform");
 const Graph_1 = require("../../topology/Graph");
 const HalfEdgeGraphSearch_1 = require("../../topology/HalfEdgeGraphSearch");
 const Merging_1 = require("../../topology/Merging");
@@ -21,6 +22,25 @@ const RegionOpsClassificationSweeps_1 = require("../RegionOpsClassificationSweep
 /** @packageDocumentation
  * @module Curve
  */
+function computeSortAngle(curve, fraction, reverse) {
+    const ray = curve.fractionToPointAndDerivative(fraction);
+    const s = reverse ? -1.0 : 1.0;
+    return Math.atan2(s * ray.direction.y, s * ray.direction.x);
+}
+function getFractionOnCurve(pair, curve) {
+    if (pair.detailA.curve === curve)
+        return pair.detailA.fraction;
+    if (pair.detailB.curve === curve)
+        return pair.detailB.fraction;
+    return undefined;
+}
+function getDetailOnCurve(pair, curve) {
+    if (pair.detailA.curve === curve)
+        return pair.detailA;
+    if (pair.detailB.curve === curve)
+        return pair.detailB;
+    return undefined;
+}
 class MapCurvePrimitiveToCurveLocationDetailPairArray {
     primitiveToPair = new Map();
     // index assigned to this primitive (for debugging)
@@ -83,8 +103,11 @@ class MapCurvePrimitiveToCurveLocationDetailPairArray {
  */
 class PlanarSubdivision {
     /**
-     * Create a graph from an array of curves, and an array of the curves' precomputed intersections.
-     * Z-coordinates are ignored.
+     * Create a graph from curves and precomputed intersections.
+     * * Z-coordinates are ignored.
+     * @param primitives input curves
+     * @param allPairs array of curve-curve xy-intersections
+     * @param mergeTolerance optional distance tolerance for clustering vertices. Default value is [[Geometry.smallMetricDistance]].
      */
     static assembleHalfEdgeGraph(primitives, allPairs, mergeTolerance = Geometry_1.Geometry.smallMetricDistance) {
         // map from key CurvePrimitive to CurveLocationDetailPair
@@ -130,31 +153,45 @@ class PlanarSubdivision {
         return graph;
     }
     /**
-     * Create a pair of mated half edges referencing an interval of a primitive.
-     * * no action if start and end points are identical.
+     * Filter for trivial curve fragment: fast computation if line segment; otherwise clip, flatten, and measure.
+     * * Different metrics are employed for expedience.
+    */
+    static isCurveTrivialXY(p, point0, fraction0, point1, fraction1, mergeTolerance) {
+        if (Geometry_1.Geometry.isSmallRelative(fraction0 - fraction1))
+            return true;
+        if (!(p instanceof LineSegment3d_1.LineSegment3d)) {
+            const p0 = p.clonePartialCurve(fraction0, fraction1);
+            if (p0?.tryTransformInPlace(Transform_1.Transform.createRowValues(1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0))) // flatten
+                return p0.curveLength() <= mergeTolerance; // Euclidean
+        }
+        return point0.isAlmostEqualXY(point1, mergeTolerance); // Manhattan
+    }
+    /**
+     * Create a pair of mated half edges referencing a non-trivial interval of a primitive.
      * @param graph containing graph
      * @param p the curve
      * @param point0 start point
      * @param fraction0 starting fraction
      * @param point1 end point
      * @param fraction1 end fraction
-     * @returns end point and fraction, or start point and fraction if no action
+     * @param mergeTolerance optional maximum xy-length of a trivial edge
+     * @returns end point and fraction
      */
     static addHalfEdge(graph, p, point0, fraction0, point1, fraction1, mergeTolerance = Geometry_1.Geometry.smallMetricDistance) {
-        if (point0.isAlmostEqualXY(point1, mergeTolerance))
-            return { point: point0, fraction: fraction0 };
-        const halfEdge = graph.createEdgeXYAndZ(point0, 0, point1, 0);
-        if (p.parent && p.parent instanceof RegionOpsClassificationSweeps_1.RegionGroupMember && p.parent.parentGroup.groupOpType === RegionOpsClassificationSweeps_1.RegionGroupOpType.NonBounding)
-            halfEdge.setMaskAroundEdge(Graph_1.HalfEdgeMask.BRIDGE_EDGE);
-        const detail01 = CurveLocationDetail_1.CurveLocationDetail.createCurveEvaluatedFractionFraction(p, fraction0, fraction1);
-        const mate = halfEdge.edgeMate;
-        halfEdge.edgeTag = detail01;
-        halfEdge.sortData = 1.0;
-        mate.edgeTag = detail01;
-        mate.sortData = -1.0;
-        halfEdge.sortAngle = sortAngle(p, fraction0, false);
-        mate.sortAngle = sortAngle(p, fraction1, true);
-        return { point: point1, fraction: fraction1 };
+        if (!this.isCurveTrivialXY(p, point0, fraction0, point1, fraction1, mergeTolerance)) {
+            const halfEdge = graph.createEdgeXYAndZ(point0, 0, point1, 0);
+            if (p.parent && p.parent instanceof RegionOpsClassificationSweeps_1.RegionGroupMember && p.parent.parentGroup.groupOpType === RegionOpsClassificationSweeps_1.RegionGroupOpType.NonBounding)
+                halfEdge.setMaskAroundEdge(Graph_1.HalfEdgeMask.BRIDGE_EDGE);
+            const detail01 = CurveLocationDetail_1.CurveLocationDetail.createCurveEvaluatedFractionFraction(p, fraction0, fraction1);
+            const mate = halfEdge.edgeMate;
+            halfEdge.edgeTag = detail01;
+            halfEdge.sortData = 1.0;
+            mate.edgeTag = detail01;
+            mate.sortData = -1.0;
+            halfEdge.sortAngle = computeSortAngle(p, fraction0, false);
+            mate.sortAngle = computeSortAngle(p, fraction1, true);
+        }
+        return { point: point1, fraction: fraction1 }; // where the next curve fragment starts
     }
     /**
      * Based on computed (and toleranced) area, push the loop (pointer) onto the appropriate array of positive, negative,
@@ -190,32 +227,31 @@ class PlanarSubdivision {
         return undefined;
     }
     /** Create the geometry for a topological edge. */
-    static createCurveInEdge(edge) {
+    static createCurveInEdge(edge, z) {
+        let result;
         const info = this.extractGeometryFromEdge(edge);
-        if (info) {
-            if (info.reversed)
-                return info.detail.curve.clonePartialCurve(info.detail.fraction1, info.detail.fraction);
-            return info.detail.curve.clonePartialCurve(info.detail.fraction, info.detail.fraction1);
+        if (info && info.detail.curve && info.detail.fraction1) {
+            const f0 = info.reversed ? info.detail.fraction1 : info.detail.fraction;
+            const f1 = info.reversed ? info.detail.fraction : info.detail.fraction1;
+            result = info.detail.curve.clonePartialCurve(f0, f1);
+            if (result && z !== undefined)
+                result.tryTransformInPlace(Transform_1.Transform.createRowValues(1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, z));
         }
-        return undefined;
+        return result;
     }
     /**
      * Create a [[Loop]] for the given face or super face.
      * @param face a node in the face loop, or an array of HalfEdges that comprise a loop (e.g., a super face).
-     * @param announce optional callback invoked on each edge/curve of the face/Loop.
-     * @param compress whether to consolidate adjacent curves in the output Loop (default `false`).
-     * If `announce` is provided, no compression is performed, as edges and curves would no longer be in 1-1 correspondence.
-     * @param closureTol absolute xy-distance for confirming the returned Loop is closed (default [[Geometry.smallMetricDistance]]).
+     * @param options bundle of options.
      * @returns the Loop, or `undefined` if it is not closed within xy-tolerance.
      */
-    static createLoopInFace(face, announce, compress = false, closureTol = Geometry_1.Geometry.smallMetricDistance) {
-        if (announce)
-            compress = false;
+    static createLoopInFace(face, options) {
+        const consolidate = options?.announceEdge ? false : options?.compress ?? false; // can't compress if announcing
         const loop = Loop_1.Loop.create();
-        const addEdgeCurve = (he) => {
-            const curve = this.createCurveInEdge(he);
+        const addEdgeCurve = (edge) => {
+            const curve = this.createCurveInEdge(edge, options?.z);
             if (curve) {
-                announce?.(he, curve, loop);
+                options?.announceEdge?.(edge, curve, loop);
                 loop.tryAddChild(curve);
             }
         };
@@ -223,12 +259,12 @@ class PlanarSubdivision {
             face.forEach(addEdgeCurve);
         else
             face.announceEdgesInFace(addEdgeCurve);
-        if (compress) {
-            const options = new RegionOps_1.ConsolidateAdjacentCurvePrimitivesOptions();
-            options.consolidateLoopSeam = true;
-            RegionOps_1.RegionOps.consolidateAdjacentPrimitives(loop, options);
+        if (consolidate) {
+            const consolidateOptions = new RegionOps_1.ConsolidateAdjacentCurvePrimitivesOptions();
+            consolidateOptions.consolidateLoopSeam = true;
+            RegionOps_1.RegionOps.consolidateAdjacentPrimitives(loop, consolidateOptions);
         }
-        if (loop.isPhysicallyClosedCurve(closureTol, true))
+        if (loop.isPhysicallyClosedCurve(options?.closureTol, true))
             return loop;
         (0, core_bentley_1.assert)(() => false, "face is not physically closed");
         return undefined;
@@ -237,17 +273,19 @@ class PlanarSubdivision {
      * Create a [[Loop]] or [[ParityRegion]] for the given face.
      * * A ParityRegion is created for a split-washer type face by removing bridge edges.
      * @param face a node in the face loop.
-     * @param bridgeMask mask preset on bridge edges (default is `HalfEdgeMask.BRIDGE_EDGE`).
-     * @param visitMask mask to use for visiting edges in the face loop (default is `HalfEdgeMask.VISITED`).
-     * @param closureTol absolute xy-distance for confirming the returned Loop is closed (default [[Geometry.smallMetricDistance]]).
-     * @returns the Loop or ParityRegion, or `undefined` if one could not be computed
+     * @param options bundle of options.
+     * @returns the Loop or ParityRegion, or `undefined` if one could not be computed.
      */
-    static createLoopOrParityRegionInFace(face, bridgeMask = Graph_1.HalfEdgeMask.BRIDGE_EDGE, visitMask = Graph_1.HalfEdgeMask.VISITED, closureTol = Geometry_1.Geometry.smallMetricDistance) {
+    static createLoopOrParityRegionInFace(face, options) {
         let region;
-        if (face.isSplitWasherFace(bridgeMask)) {
+        const visitMask = options?.visitMask ?? Graph_1.HalfEdgeMask.VISITED;
+        const bridgeMask = options?.bridgeMask ?? Graph_1.HalfEdgeMask.BRIDGE_EDGE;
+        let startBridgeEdge;
+        // is it a split-washer face?
+        if (face.isSplitWasherFace(bridgeMask) && (startBridgeEdge = face.findMaskAroundFace(bridgeMask, true))) {
             const loops = [];
             const loopEdges = [];
-            const bridgeStack = [face.findMaskAroundFace(bridgeMask, true)];
+            const bridgeStack = [startBridgeEdge];
             const announceEdge = (he) => { he.setMask(visitMask); loopEdges.push(he); };
             const announceBridge = (he) => { if (!he.isMaskSet(visitMask))
                 bridgeStack.push(he); };
@@ -261,7 +299,7 @@ class PlanarSubdivision {
                         continue;
                     loopEdges.length = 0;
                     if (loopSeed.announceEdgesInSuperFace(bridgeMask, announceEdge, announceBridge)) {
-                        const loop = this.createLoopInFace(loopEdges, undefined, true, closureTol);
+                        const loop = this.createLoopInFace(loopEdges, options);
                         if (loop) {
                             loops.push(loop);
                             continue;
@@ -273,7 +311,7 @@ class PlanarSubdivision {
             region = RegionOps_1.RegionOps.simplifyRegion(region);
         }
         else {
-            region = this.createLoopInFace(face, undefined, true, closureTol);
+            region = this.createLoopInFace(face, options);
         }
         return (region && (region instanceof Loop_1.Loop || region instanceof ParityRegion_1.ParityRegion)) ? region : undefined;
     }
@@ -310,24 +348,23 @@ class PlanarSubdivision {
             const edges = [];
             for (const faceSeed of faceSeeds) {
                 const isNullFace = this.isNullFace(faceSeed);
-                const loop = this.createLoopInFace(faceSeed, (he, curveC, loopC) => {
-                    if (!isNullFace) {
-                        const mate = this.getNonNullEdgeMate(graph, he);
-                        if (mate !== undefined) {
-                            const e = edgeMap.get(mate);
-                            if (e === undefined) {
-                                // Record this as loopA,edgeA of a shared edge to be completed later from the other side of the edge
-                                const e1 = new Loop_1.LoopCurveLoopCurve(loopC, curveC, undefined, undefined);
-                                edgeMap.set(he, e1);
-                            }
-                            else if (e instanceof Loop_1.LoopCurveLoopCurve) {
-                                e.setB(loopC, curveC);
-                                edges.push(e);
-                                edgeMap.delete(mate);
-                            }
+                const announceEdge = isNullFace ? undefined : (he, curveC, loopC) => {
+                    const mate = this.getNonNullEdgeMate(graph, he);
+                    if (mate !== undefined) {
+                        const e = edgeMap.get(mate);
+                        if (e === undefined) {
+                            // Record this as loopA,edgeA of a shared edge to be completed later from the other side of the edge
+                            const e1 = new Loop_1.LoopCurveLoopCurve(loopC, curveC, undefined, undefined);
+                            edgeMap.set(he, e1);
+                        }
+                        else if (e instanceof Loop_1.LoopCurveLoopCurve) {
+                            e.setB(loopC, curveC);
+                            edges.push(e);
+                            edgeMap.delete(mate);
                         }
                     }
-                });
+                };
+                const loop = this.createLoopInFace(faceSeed, { announceEdge });
                 if (loop)
                     this.collectSignedLoop(loop, componentAreas, zeroAreaTolerance, isNullFace);
             }
@@ -339,23 +376,4 @@ class PlanarSubdivision {
     }
 }
 exports.PlanarSubdivision = PlanarSubdivision;
-function sortAngle(curve, fraction, reverse) {
-    const ray = curve.fractionToPointAndDerivative(fraction);
-    const s = reverse ? -1.0 : 1.0;
-    return Math.atan2(s * ray.direction.y, s * ray.direction.x);
-}
-function getFractionOnCurve(pair, curve) {
-    if (pair.detailA.curve === curve)
-        return pair.detailA.fraction;
-    if (pair.detailB.curve === curve)
-        return pair.detailB.fraction;
-    return undefined;
-}
-function getDetailOnCurve(pair, curve) {
-    if (pair.detailA.curve === curve)
-        return pair.detailA;
-    if (pair.detailB.curve === curve)
-        return pair.detailB;
-    return undefined;
-}
 //# sourceMappingURL=PlanarSubdivision.js.map