@itwin/core-geometry 5.1.0-dev.3 → 5.1.0-dev.32

package/lib/esm/polyface/GreedyTriangulationBetweenLineStrings.js.map

@@ -1 +1 @@
-{"version":3,"file":"GreedyTriangulationBetweenLineStrings.js","sourceRoot":"","sources":["../../../src/polyface/GreedyTriangulationBetweenLineStrings.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AACvC,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAE5C,OAAO,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAClE,OAAO,EAAE,4BAA4B,EAAE,MAAM,yCAAyC,CAAC;AAEvF,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAClE,OAAO,EAAE,iBAAiB,EAAE,MAAM,qBAAqB,CAAC;AAExD;;GAEG;AACH;;;GAGG;AACH,MAAM,OAAO,qCAAqC;IAExC,QAAQ,CAAW;IAC3B,YAAoB,WAAmB;QACrC,IAAI,CAAC,YAAY,GAAG,WAAW,CAAC;QAChC,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;QAC9B,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;QAC9B,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC;QACnC,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC;QACnC,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC;QAClC,IAAI,CAAC,OAAO,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC;QACjC,IAAI,CAAC,OAAO,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC;IACnC,CAAC;IAEO,YAAY,CAAS;IAErB,eAAe,CACrB,SAAmB,EACnB,OAAiB,EACjB,IAAc;QACd,IAAI,SAAS,CAAC,UAAU,CAAC,OAAO,CAAC,IAAI,GAAG;YACtC,OAAO,KAAK,CAAC;QACf,MAAM,KAAK,GAAG,SAAS,CAAC,sBAAsB,CAAC,IAAI,CAAC,CAAC;QACrD,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,IAAI,CAAC,YAAY;YAC7C,OAAO,KAAK,CAAC;QACf,OAAO,IAAI,CAAC;IACd,CAAC;IACO,YAAY,CAClB,OAA6B,EAC7B,KAAa,EACb,OAA6B,EAC7B,KAAa,EACb,IAAa,EACb,MAAgB,EAChB,QAAkB,EAClB,IAAa,EACb,MAAgB,EAChB,QAAkB;QAClB,IAAI,KAAK,GAAG,CAAC,GAAG,OAAO,CAAC,MAAM,IAAI,KAAK,GAAG,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;YAC7D,OAAO,CAAC,+BAA+B,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;YACrD,OAAO,CAAC,+BAA+B,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;YACrD,OAAO,CAAC,iBAAiB,CAAC,IAAI,EAAE,KAAK,GAAG,CAAC,EAAE,QAAQ,CAAC,CAAC;YACrD,OAAO,CAAC,iBAAiB,CAAC,IAAI,EAAE,KAAK,GAAG,CAAC,EAAE,QAAQ,CAAC,CAAC;YACrD,QAAQ,CAAC,cAAc,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;YACnD,IAAI,CAAC,QAAQ,CAAC,YAAY,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;YAC7C,IAAI,CAAC,QAAQ,CAAC,YAAY,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;YAC7C,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,OAAO,GAAG,IAAI,CAAC,YAAY;gBACjF,OAAO,IAAI,CAAC;QAChB,CAAC;QACD,OAAO,KAAK,CAAC;IAEf,CAAC;IACD;;;;;;OAMG;IACK,oBAAoB,CAC1B,MAAoC,EACpC,KAAmC,EACnC,QAAgB,EAChB,IAAa,EACb,KAAe,EACf,QAAkB,EAClB,KAAe,EACf,QAAkB;QAClB,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,MAAM,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAE,gCAAgC;QAChF,OAAO,KAAK,CAAC,GAAG,GAAG,MAAM,CAAC,GAAG,EAAE,CAAC;YAC9B,KAAK,CAAC,MAAM,CAAC,iBAAiB,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC/D,IAAI,CAAC,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,QAAQ,EAAE,QAAQ,EAAE,KAAK,CAAC;gBACvD,MAAM;YACR,IAAI,CAAC,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,QAAQ,EAAE,QAAQ,EAAE,KAAK,CAAC;gBACvD,MAAM;YACR,IAAI,KAAK,CAAC,GAAG,GAAG,CAAC,EAAE,CAAC;gBAClB,KAAK,CAAC,MAAM,CAAC,gBAAgB,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,EAAE,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;gBACvE,IAAI,CAAC,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,QAAQ,EAAE,QAAQ,EAAE,KAAK,CAAC;oBACvD,MAAM;YACV,CAAC;YACD,KAAK,CAAC,GAAG,EAAE,CAAC;QACd,CAAC;IACH,CAAC;IAEO,WAAW,CAAqB;IAChC,WAAW,CAAqB;IAEhC,WAAW,CAAqB;IAChC,WAAW,CAAqB;IAEhC,WAAW,CAAqB;IAChC,WAAW,CAAqB;IAChC,aAAa,CAAqB;IAClC,aAAa,CAAqB;IAC1C;;OAEG;IACK,SAAS,CACf,SAAuC,EACvC,SAAuC,EACvC,OAAgD,EAChD,WAAoB,KAAK;QACzB,SAAS,CAAC,WAAW,EAAE,CAAC;QACxB,SAAS,CAAC,WAAW,EAAE,CAAC;QAExB,OAAO,SAAS,CAAC,MAAM,GAAG,CAAC,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAEpD,wCAAwC;YACxC,IAAI,CAAC,WAAW,GAAG,iBAAiB,CAAC,oBAAoB,CAAC,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,EAAE,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;YAC5L,IAAI,CAAC,WAAW,GAAG,iBAAiB,CAAC,oBAAoB,CAAC,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,EAAE,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,EAAE,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;YAChM,IAAI,CAAC,WAAW,GAAG,iBAAiB,CAAC,oBAAoB,CAAC,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,EAAE,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;YAEhM,IAAI,CAAC,WAAW,GAAG,iBAAiB,CAAC,oBAAoB,CAAC,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,EAAE,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;YAC7L,IAAI,CAAC,WAAW,GAAG,iBAAiB,CAAC,oBAAoB,CAAC,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,EAAE,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,EAAE,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;YACjM,IAAI,CAAC,WAAW,GAAG,iBAAiB,CAAC,oBAAoB,CAAC,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,EAAE,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;YACjM,gCAAgC;YAChC,kCAAkC;YAClC,qFAAqF;YACrF,uEAAuE;YACvE,6BAA6B;YAC7B,IAAI,CAAC,aAAa,GAAG,iBAAiB,CAAC,oBAAoB,CAAC,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC;YACpH,IAAI,CAAC,aAAa,GAAG,iBAAiB,CAAC,oBAAoB,CAAC,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC;YACpH,iBAAiB,CAAC,6BAA6B,CAAC,IAAI,CAAC,aAAa,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC;YACxF,2HAA2H;YAC3H,2HAA2H;YAE3H,IAAI,IAAI,CAAC,aAAa,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC;gBAC9B,SAAS,CAAC,YAAY,EAAE,CAAC;gBACzB,OAAO,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;gBAC5B,IAAI,QAAQ;oBACV,OAAO;YACX,CAAC;iBAAM,CAAC;gBACN,SAAS,CAAC,YAAY,EAAE,CAAC;gBACzB,OAAO,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;gBAC5B,IAAI,QAAQ;oBACV,OAAO;YACX,CAAC;QACH,CAAC;QACD,8JAA8J;QAC9J,IAAI,SAAS,CAAC,WAAW,EAAE,CAAC;YAC1B,OAAO,SAAS,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;gBAC7B,IAAI,CAAC,aAAa,GAAG,iBAAiB,CAAC,oBAAoB,CAAC,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,EAAE,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC;gBAChM,gIAAgI;gBAChI,OAAO,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;gBAC5B,SAAS,CAAC,YAAY,EAAE,CAAC;YAC3B,CAAC;QACH,CAAC;QAED,0IAA0I;QAC1I,IAAI,SAAS,CAAC,WAAW,EAAE,CAAC;YAC1B,OAAO,SAAS,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;gBAC7B,IAAI,CAAC,aAAa,GAAG,iBAAiB,CAAC,oBAAoB,CAAC,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,EAAE,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC;gBAChM,+HAA+H;gBAC/H,OAAO,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;gBAC5B,SAAS,CAAC,YAAY,EAAE,CAAC;YAC3B,CAAC;QACH,CAAC;IACH,CAAC;IAEO,KAAK,CAAU;IACf,KAAK,CAAU;IACf,SAAS,CAAW;IACpB,SAAS,CAAW;IACpB,OAAO,CAAW;IAClB,OAAO,CAAW;IAC1B;;;;;OAKG;IACI,aAAa,CAClB,OAA6B,EAC7B,OAA6B,EAC7B,OAAgD;QAChD,mDAAmD;QACnD,IAAI,CAAC,eAAe,CAAC,qBAAqB,CAAC,OAAO,CAAC,EAAE,qBAAqB,CAAC,OAAO,CAAC,EAAE,OAAO,CAAC,CAAC;IAChG,CAAC;IACD;;;;;OAKG;IACK,eAAe,CACrB,OAA6B,EAC7B,OAA6B,EAC7B,OAAgD;QAChD,MAAM,SAAS,GAAG,4BAA4B,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC;QACvE,MAAM,SAAS,GAAG,4BAA4B,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC;QACvE,MAAM,MAAM,GAAG,4BAA4B,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC;QACpE,MAAM,MAAM,GAAG,4BAA4B,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC;QACpE,OAAO,SAAS,CAAC,MAAM,GAAG,CAAC,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC;YACtG,+BAA+B;YAC/B,+BAA+B;YAC/B,IAAI,IAAI,CAAC,YAAY,CAAC,OAAO,EAAE,SAAS,CAAC,KAAK,EAAE,OAAO,EAAE,SAAS,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC;gBAC9J,IAAI,CAAC,oBAAoB,CAAC,SAAS,EAAE,MAAM,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;gBAC1I,IAAI,CAAC,oBAAoB,CAAC,SAAS,EAAE,MAAM,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;gBAC1I,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;gBACxC,SAAS,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;gBAChC,SAAS,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;YAClC,CAAC;iBAAM,IAAI,IAAI,CAAC,YAAY,CAAC,OAAO,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,EAAE,OAAO,EAAE,SAAS,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC;gBACzK,MAAM,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;gBAChE,MAAM,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;gBAChE,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;gBACxC,SAAS,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;gBAChC,SAAS,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;YAClC,CAAC;iBAAM,IAAI,IAAI,CAAC,YAAY,CAAC,OAAO,EAAE,SAAS,CAAC,KAAK,EAAE,OAAO,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC;gBACzK,MAAM,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;gBAChE,MAAM,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;gBAChE,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;gBACxC,SAAS,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;gBAChC,SAAS,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;YAClC,CAAC;iBAAM,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACxD,MAAM,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;gBAChE,MAAM,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;gBAChE,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC;gBAC9C,SAAS,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;gBAChC,SAAS,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;YAClC,CAAC;iBAAM,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAChC,MAAM,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;gBAChE,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;gBAC1B,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;gBACxC,SAAS,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;gBAChC,SAAS,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;YAClC,CAAC;iBAAM,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAChC,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;gBAC1B,MAAM,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;gBAChE,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;gBACxC,SAAS,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;gBAChC,SAAS,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;YAClC,CAAC;YACD;;;;;sBAKU;QACZ,CAAC;QACD,gCAAgC;QAChC,IAAI,CAAC,SAAS,CAAC,SAAS,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;IAChD,CAAC;IACD,+DAA+D;IACxD,MAAM,CAAC,wBAAwB,GAAG,KAAK,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC;IAC1D,MAAM,CAAC,aAAa,CAAC,kBAAyB,IAAI,CAAC,wBAAwB;QAChF,OAAO,IAAI,qCAAqC,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC;IAC5E,CAAC;;AAGH;;;;;GAKG;AACH,SAAS,qBAAqB,CAAC,IAA0B,EAAE,SAAS,GAAG,QAAQ,CAAC,mBAAmB;IACjG,IAAI,aAAa,GAAG,KAAK,CAAC;IAC1B,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;IACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/B,IAAI,IAAI,CAAC,kBAAkB,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAE,IAAI,SAAS,EAAE,CAAC;YACpD,aAAa,GAAG,IAAI,CAAC;YACrB,MAAM;QACR,CAAC;IACH,CAAC;IACD,IAAI,CAAC,aAAa;QAChB,OAAO,IAAI,CAAC;IACd,MAAM,MAAM,GAAG,IAAI,gBAAgB,CAAC,CAAC,CAAC,CAAC;IACvC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,yBAAyB,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,yBAAyB,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,yBAAyB,CAAC,CAAC,CAAC,CAAC,CAAC;IACxH,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,IAAI,IAAI,CAAC,kBAAkB,CAAC,EAAE,EAAE,CAAC,CAAE,GAAG,SAAS,EAAE,CAAC;YAChD,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,yBAAyB,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,yBAAyB,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,yBAAyB,CAAC,CAAC,CAAC,CAAC,CAAC;YACxH,EAAE,GAAG,CAAC,CAAC;QACT,CAAC;IACH,CAAC;IACD,oDAAoD;IACpD,IAAI,IAAI,CAAC,kBAAkB,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAE,IAAI,SAAS,EAAE,CAAC;QACpD,MAAM,CAAC,GAAG,EAAE,CAAC;QACb,MAAM,CAAC,wBAAwB,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IAC7C,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC","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 { Angle } from \"../geometry3d/Angle\";\nimport { BarycentricTriangle } from \"../geometry3d/BarycentricTriangle\";\nimport { GrowableXYZArray } from \"../geometry3d/GrowableXYZArray\";\nimport { IndexedXYZCollectionInterval } from \"../geometry3d/IndexedCollectionInterval\";\nimport { IndexedXYZCollection } from \"../geometry3d/IndexedXYZCollection\";\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\nimport { TriangleCandidate } from \"./TriangleCandidate\";\n\n/** @packageDocumentation\n * @module Polyface\n */\n/**\n * * Context for constructing triangulations between linestrings with dis-similar point counts and distribution.\n * @internal\n */\nexport class GreedyTriangulationBetweenLineStrings {\n\n  private _vector1: Vector3d;\n  private constructor(turnRadians: number) {\n    this._turnRadians = turnRadians;\n    this._xyzA = Point3d.create();\n    this._xyzB = Point3d.create();\n    this._forwardA = Vector3d.create();\n    this._forwardB = Vector3d.create();\n    this._vector1 = Vector3d.create();\n    this._crossA = Vector3d.create();\n    this._crossB = Vector3d.create();\n  }\n\n  private _turnRadians: number;\n\n  private isForwardVector(\n    candidate: Vector3d,\n    forward: Vector3d,\n    perp: Vector3d): boolean {\n    if (candidate.dotProduct(forward) <= 0.0)\n      return false;\n    const theta = candidate.angleFromPerpendicular(perp);\n    if (Math.abs(theta.radians) > this._turnRadians)\n      return false;\n    return true;\n  }\n  private isPlanarBase(\n    pointsA: IndexedXYZCollection,\n    baseA: number,\n    pointsB: IndexedXYZCollection,\n    baseB: number,\n    xyzA: Point3d,\n    crossA: Vector3d,\n    forwardA: Vector3d,\n    xyzB: Point3d,\n    crossB: Vector3d,\n    forwardB: Vector3d): boolean {\n    if (baseA + 1 < pointsA.length && baseB + 1 < pointsB.length) {\n      pointsA.getPoint3dAtUncheckedPointIndex(baseA, xyzA);\n      pointsB.getPoint3dAtUncheckedPointIndex(baseB, xyzB);\n      pointsA.vectorXYAndZIndex(xyzA, baseA + 1, forwardA);\n      pointsB.vectorXYAndZIndex(xyzB, baseB + 1, forwardB);\n      Vector3d.createStartEnd(xyzA, xyzB, this._vector1);\n      this._vector1.crossProduct(forwardA, crossA);\n      this._vector1.crossProduct(forwardB, crossB);\n      if (!xyzA.isAlmostEqual(xyzB) && crossA.angleTo(crossB).radians < this._turnRadians)\n        return true;\n    }\n    return false;\n\n  }\n  /**\n   * Starting at start in source, examine points to see how long they are close to being \"in plane\"\n   * * child interval begins at parent.begin\n   * * child interval end initializes at trialEnd and grows.\n   * * child must be predefined by caller\n   * * Return the accepted interval\n   */\n  private advanceToPlanarLimit(\n    parent: IndexedXYZCollectionInterval,\n    child: IndexedXYZCollectionInterval,\n    trialEnd: number,\n    xyzA: Point3d,\n    perpA: Vector3d,\n    forwardA: Vector3d,\n    perpB: Vector3d,\n    forwardB: Vector3d) {\n    child.setFrom(parent, parent.begin, trialEnd);  // initialize as empty interval.\n    while (child.end < parent.end) {\n      child.points.vectorXYAndZIndex(xyzA, child.end, this._vector1);\n      if (!this.isForwardVector(this._vector1, forwardA, perpA))\n        break;\n      if (!this.isForwardVector(this._vector1, forwardB, perpB))\n        break;\n      if (child.end > 0) {\n        child.points.vectorIndexIndex(child.end - 1, child.end, this._vector1);\n        if (!this.isForwardVector(this._vector1, forwardA, perpA))\n          break;\n      }\n      child.end++;\n    }\n  }\n\n  private _triangleA1?: TriangleCandidate;\n  private _triangleB1?: TriangleCandidate;\n\n  private _triangleA2?: TriangleCandidate;\n  private _triangleB2?: TriangleCandidate;\n\n  private _triangleA3?: TriangleCandidate;\n  private _triangleB3?: TriangleCandidate;\n  private _bestTriangle?: TriangleCandidate;\n  private _workTriangle?: TriangleCandidate;\n  /** evaluate aspect ratios to select heuristically best triangles with given index intervals.\n   * (ASSUME NO DUPLICATES, as in caller.)\n   */\n  private addGreedy(\n    intervalA: IndexedXYZCollectionInterval,\n    intervalB: IndexedXYZCollectionInterval,\n    handler: (triangle: BarycentricTriangle) => void,\n    addOnly1: boolean = false) {\n    intervalA.restrictEnd();\n    intervalB.restrictEnd();\n\n    while (intervalA.length > 1 && intervalB.length > 1) {\n\n      // triangles A1 and B1 are always valid.\n      this._triangleA1 = TriangleCandidate.createFromIndexedXYZ(intervalA.points, intervalA.begin, intervalA.points, intervalA.begin + 1, intervalB.points, intervalB.begin, 1, this._triangleA1);\n      this._triangleA2 = TriangleCandidate.createFromIndexedXYZ(intervalA.points, intervalA.begin + 1, intervalA.points, intervalA.begin + 2, intervalB.points, intervalB.begin, 2, this._triangleA2);\n      this._triangleA3 = TriangleCandidate.createFromIndexedXYZ(intervalA.points, intervalA.begin, intervalA.points, intervalA.begin + 1, intervalB.points, intervalB.begin + 1, 3, this._triangleA3);\n\n      this._triangleB1 = TriangleCandidate.createFromIndexedXYZ(intervalB.points, intervalB.begin + 1, intervalB.points, intervalB.begin, intervalA.points, intervalA.begin, -1, this._triangleB1);\n      this._triangleB2 = TriangleCandidate.createFromIndexedXYZ(intervalB.points, intervalB.begin + 2, intervalB.points, intervalB.begin + 1, intervalA.points, intervalA.begin, -2, this._triangleB2);\n      this._triangleB3 = TriangleCandidate.createFromIndexedXYZ(intervalB.points, intervalB.begin + 1, intervalB.points, intervalB.begin, intervalA.points, intervalA.begin + 1, -3, this._triangleB3);\n      // Look at pairs of 2 triangles.\n      // (each pair begins with 1 or -1)\n      // For each pair find the smallest aspect ratio of its two triangles.  (Small is bad)\n      // Choose the pair where that (smaller aspect ratio of two) is largest.\n      // Advance in that direction.\n      this._bestTriangle = TriangleCandidate.copyWithLowerQuality(this._triangleA1, this._triangleB3, this._bestTriangle);\n      this._workTriangle = TriangleCandidate.copyWithLowerQuality(this._triangleB1, this._triangleA3, this._workTriangle);\n      TriangleCandidate.updateIfOtherHasHigherQuality(this._bestTriangle, this._workTriangle);\n      // TestTriangle::UpdateIfOtherHasLargerAspectRatio (bestTriangle, TestTriangle::MergeAspectRatio (triangleB1, triangleB2));\n      // TestTriangle::UpdateIfOtherHasLargerAspectRatio (bestTriangle, TestTriangle::MergeAspectRatio (triangleA1, triangleA2));\n\n      if (this._bestTriangle.id > 0) {\n        intervalA.advanceBegin();\n        handler(this._bestTriangle);\n        if (addOnly1)\n          return;\n      } else {\n        intervalB.advanceBegin();\n        handler(this._bestTriangle);\n        if (addOnly1)\n          return;\n      }\n    }\n    // sweep in trailing points from either side.  At least one of intervalA.begin, intervalB.begin is at its limit, so only one of these will execute any bodies.\n    if (intervalA.isSingleton) {\n      while (intervalB.length >= 2) {\n        this._workTriangle = TriangleCandidate.createFromIndexedXYZ(intervalB.points, intervalB.begin + 1, intervalB.points, intervalB.begin, intervalA.points, intervalA.begin, 0, this._workTriangle);\n        //  this._workTriangle.scaleFromPointInPlace(this._workTriangle.points[2], 0.95); // crude visualization aid for tracking logic.\n        handler(this._workTriangle);\n        intervalB.advanceBegin();\n      }\n    }\n\n    // sweep in trailing points from either side.  At least one of baseA, baseB is at its limit, so only one of these will execute any bodies.\n    if (intervalB.isSingleton) {\n      while (intervalA.length >= 2) {\n        this._workTriangle = TriangleCandidate.createFromIndexedXYZ(intervalA.points, intervalA.begin, intervalA.points, intervalA.begin + 1, intervalB.points, intervalB.begin, 0, this._workTriangle);\n        // this._workTriangle.scaleFromPointInPlace(this._workTriangle.points[2], 0.95); // crude visualization aid for tracking logic.\n        handler(this._workTriangle);\n        intervalA.advanceBegin();\n      }\n    }\n  }\n\n  private _xyzA: Point3d;\n  private _xyzB: Point3d;\n  private _forwardA: Vector3d;\n  private _forwardB: Vector3d;\n  private _crossA: Vector3d;\n  private _crossB: Vector3d;\n  /**\n   * Working from start to finish, emit triangles with heuristic lookahead to get pleasing matching between the linestrings.\n   * @param pointsA\n   * @param pointsB\n   * @param handler\n   */\n  public emitTriangles(\n    pointsA: IndexedXYZCollection,\n    pointsB: IndexedXYZCollection,\n    handler: (triangle: BarycentricTriangle) => void) {\n    /** Clean up duplicates for the real logic . . . */\n    this.emitTrianglesGo(resolveToNoDuplicates(pointsA), resolveToNoDuplicates(pointsB), handler);\n  }\n  /**\n   * Run triangle logic on inputs with no duplicates.\n   * @param pointsA\n   * @param pointsB\n   * @param handler\n   */\n  private emitTrianglesGo(\n    pointsA: IndexedXYZCollection,\n    pointsB: IndexedXYZCollection,\n    handler: (triangle: BarycentricTriangle) => void) {\n    const intervalA = IndexedXYZCollectionInterval.createComplete(pointsA);\n    const intervalB = IndexedXYZCollectionInterval.createComplete(pointsB);\n    const childA = IndexedXYZCollectionInterval.createComplete(pointsA);\n    const childB = IndexedXYZCollectionInterval.createComplete(pointsB);\n    while (intervalA.length > 0 && intervalB.length > 0 && (intervalA.length > 1 || intervalB.length > 1)) {\n      // const lA = intervalA.length;\n      // const lB = intervalB.length;\n      if (this.isPlanarBase(pointsA, intervalA.begin, pointsB, intervalB.begin, this._xyzA, this._crossA, this._forwardA, this._xyzB, this._crossB, this._forwardB)) {\n        this.advanceToPlanarLimit(intervalA, childA, intervalA.begin + 1, this._xyzA, this._crossA, this._forwardA, this._crossB, this._forwardB);\n        this.advanceToPlanarLimit(intervalB, childB, intervalB.begin + 1, this._xyzB, this._crossB, this._forwardB, this._crossA, this._forwardA);\n        this.addGreedy(childA, childB, handler);\n        intervalA.advanceToTail(childA);\n        intervalB.advanceToTail(childB);\n      } else if (this.isPlanarBase(pointsA, intervalA.begin + 1, pointsB, intervalB.begin, this._xyzA, this._crossA, this._forwardA, this._xyzB, this._crossB, this._forwardB)) {\n        childA.setFrom(intervalA, intervalA.begin, intervalA.begin + 2);\n        childB.setFrom(intervalB, intervalB.begin, intervalB.begin + 1);\n        this.addGreedy(childA, childB, handler);\n        intervalA.advanceToTail(childA);\n        intervalB.advanceToTail(childB);\n      } else if (this.isPlanarBase(pointsA, intervalA.begin, pointsB, intervalB.begin + 1, this._xyzA, this._crossA, this._forwardA, this._xyzB, this._crossB, this._forwardB)) {\n        childA.setFrom(intervalA, intervalA.begin, intervalA.begin + 1);\n        childB.setFrom(intervalB, intervalB.begin, intervalB.begin + 2);\n        this.addGreedy(childA, childB, handler);\n        intervalA.advanceToTail(childA);\n        intervalB.advanceToTail(childB);\n      } else if (intervalA.length > 1 && intervalB.length > 1) {\n        childA.setFrom(intervalA, intervalA.begin, intervalA.begin + 2);\n        childB.setFrom(intervalB, intervalB.begin, intervalB.begin + 2);\n        this.addGreedy(childA, childB, handler, true);\n        intervalA.advanceToHead(childA);\n        intervalB.advanceToHead(childB);\n      } else if (intervalA.length > 1) {\n        childA.setFrom(intervalA, intervalA.begin, intervalA.begin + 2);\n        childB.setFrom(intervalB);\n        this.addGreedy(childA, childB, handler);\n        intervalA.advanceToTail(childA);\n        intervalB.advanceToTail(childB);\n      } else if (intervalB.length > 1) {\n        childA.setFrom(intervalA);\n        childB.setFrom(intervalB, intervalB.begin, intervalB.begin + 2);\n        this.addGreedy(childA, childB, handler);\n        intervalA.advanceToTail(childA);\n        intervalB.advanceToTail(childB);\n      }\n      /*      if (intervalA.length >= lA && intervalB.length >= lB) {\n              // This should not happen == neither one advanced.   Just move ahead in the longer one ..\n              if (intervalA.length > intervalB.length)\n                intervalA.advanceBegin();\n              else intervalB.advanceBegin();\n            } */\n    }\n    // catch everything else blindly\n    this.addGreedy(intervalA, intervalB, handler);\n  }\n  /** Default angle for considering two vectors to be colinear */\n  public static defaultNearColinearAngle = Angle.createDegrees(15);\n  public static createContext(planarTurnAngle: Angle = this.defaultNearColinearAngle) {\n    return new GreedyTriangulationBetweenLineStrings(planarTurnAngle.radians);\n  }\n}\n\n/**\n * * If there are no contiguous duplicated points in `data` return `data` unchanged.\n * * If there are duplicates, compress to a new array.\n * @param data\n * @param tolerance\n */\nfunction resolveToNoDuplicates(data: IndexedXYZCollection, tolerance = Geometry.smallMetricDistance): IndexedXYZCollection {\n  let hasDuplicates = false;\n  const n = data.length;\n  for (let i = 0; i + 1 < n; i++) {\n    if (data.distanceIndexIndex(i, i + 1)! <= tolerance) {\n      hasDuplicates = true;\n      break;\n    }\n  }\n  if (!hasDuplicates)\n    return data;\n  const result = new GrowableXYZArray(n);\n  result.pushXYZ(data.getXAtUncheckedPointIndex(0), data.getYAtUncheckedPointIndex(0), data.getZAtUncheckedPointIndex(0));\n  let i0 = 0;\n  for (let i = 1; i < n; i++) {\n    if (data.distanceIndexIndex(i0, i)! > tolerance) {\n      result.pushXYZ(data.getXAtUncheckedPointIndex(i), data.getYAtUncheckedPointIndex(i), data.getZAtUncheckedPointIndex(i));\n      i0 = i;\n    }\n  }\n  /** enforce exact closure if original was closed. */\n  if (data.distanceIndexIndex(0, n - 1)! <= tolerance) {\n    result.pop();\n    result.pushFromGrowableXYZArray(result, 0);\n  }\n  return result;\n}\n"]}
+{"version":3,"file":"GreedyTriangulationBetweenLineStrings.js","sourceRoot":"","sources":["../../../src/polyface/GreedyTriangulationBetweenLineStrings.ts"],"names":[],"mappings":"AAAA;;;+FAG+F;AAC/F,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AACvC,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAC;AAE5C,OAAO,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAClE,OAAO,EAAE,4BAA4B,EAAE,MAAM,yCAAyC,CAAC;AAEvF,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,MAAM,+BAA+B,CAAC;AAClE,OAAO,EAAE,iBAAiB,EAAE,MAAM,qBAAqB,CAAC;AAExD;;GAEG;AACH;;;GAGG;AACH,MAAM,OAAO,qCAAqC;IAExC,QAAQ,CAAW;IAC3B,YAAoB,WAAmB;QACrC,IAAI,CAAC,YAAY,GAAG,WAAW,CAAC;QAChC,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;QAC9B,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;QAC9B,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC;QACnC,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC;QACnC,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC;QAClC,IAAI,CAAC,OAAO,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC;QACjC,IAAI,CAAC,OAAO,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC;IACnC,CAAC;IAEO,YAAY,CAAS;IAErB,eAAe,CACrB,SAAmB,EACnB,OAAiB,EACjB,IAAc;QACd,IAAI,SAAS,CAAC,UAAU,CAAC,OAAO,CAAC,IAAI,GAAG;YACtC,OAAO,KAAK,CAAC;QACf,MAAM,KAAK,GAAG,SAAS,CAAC,sBAAsB,CAAC,IAAI,CAAC,CAAC;QACrD,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,IAAI,CAAC,YAAY;YAC7C,OAAO,KAAK,CAAC;QACf,OAAO,IAAI,CAAC;IACd,CAAC;IACO,YAAY,CAClB,OAA6B,EAC7B,KAAa,EACb,OAA6B,EAC7B,KAAa,EACb,IAAa,EACb,MAAgB,EAChB,QAAkB,EAClB,IAAa,EACb,MAAgB,EAChB,QAAkB;QAClB,IAAI,KAAK,GAAG,CAAC,GAAG,OAAO,CAAC,MAAM,IAAI,KAAK,GAAG,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC;YAC7D,OAAO,CAAC,+BAA+B,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;YACrD,OAAO,CAAC,+BAA+B,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;YACrD,OAAO,CAAC,iBAAiB,CAAC,IAAI,EAAE,KAAK,GAAG,CAAC,EAAE,QAAQ,CAAC,CAAC;YACrD,OAAO,CAAC,iBAAiB,CAAC,IAAI,EAAE,KAAK,GAAG,CAAC,EAAE,QAAQ,CAAC,CAAC;YACrD,QAAQ,CAAC,cAAc,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;YACnD,IAAI,CAAC,QAAQ,CAAC,YAAY,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;YAC7C,IAAI,CAAC,QAAQ,CAAC,YAAY,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;YAC7C,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,OAAO,GAAG,IAAI,CAAC,YAAY;gBACjF,OAAO,IAAI,CAAC;QAChB,CAAC;QACD,OAAO,KAAK,CAAC;IAEf,CAAC;IACD;;;;;;OAMG;IACK,oBAAoB,CAC1B,MAAoC,EACpC,KAAmC,EACnC,QAAgB,EAChB,IAAa,EACb,KAAe,EACf,QAAkB,EAClB,KAAe,EACf,QAAkB;QAClB,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,MAAM,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAE,gCAAgC;QAChF,OAAO,KAAK,CAAC,GAAG,GAAG,MAAM,CAAC,GAAG,EAAE,CAAC;YAC9B,KAAK,CAAC,MAAM,CAAC,iBAAiB,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC/D,IAAI,CAAC,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,QAAQ,EAAE,QAAQ,EAAE,KAAK,CAAC;gBACvD,MAAM;YACR,IAAI,CAAC,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,QAAQ,EAAE,QAAQ,EAAE,KAAK,CAAC;gBACvD,MAAM;YACR,IAAI,KAAK,CAAC,GAAG,GAAG,CAAC,EAAE,CAAC;gBAClB,KAAK,CAAC,MAAM,CAAC,gBAAgB,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,EAAE,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;gBACvE,IAAI,CAAC,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,QAAQ,EAAE,QAAQ,EAAE,KAAK,CAAC;oBACvD,MAAM;YACV,CAAC;YACD,KAAK,CAAC,GAAG,EAAE,CAAC;QACd,CAAC;IACH,CAAC;IAEO,WAAW,CAAqB;IAChC,WAAW,CAAqB;IAEhC,WAAW,CAAqB;IAChC,WAAW,CAAqB;IAEhC,WAAW,CAAqB;IAChC,WAAW,CAAqB;IAChC,aAAa,CAAqB;IAClC,aAAa,CAAqB;IAC1C;;OAEG;IACK,SAAS,CACf,SAAuC,EACvC,SAAuC,EACvC,OAAgD,EAChD,WAAoB,KAAK;QACzB,SAAS,CAAC,WAAW,EAAE,CAAC;QACxB,SAAS,CAAC,WAAW,EAAE,CAAC;QAExB,OAAO,SAAS,CAAC,MAAM,GAAG,CAAC,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAEpD,wCAAwC;YACxC,IAAI,CAAC,WAAW,GAAG,iBAAiB,CAAC,oBAAoB,CAAC,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,EAAE,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;YAC5L,IAAI,CAAC,WAAW,GAAG,iBAAiB,CAAC,oBAAoB,CAAC,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,EAAE,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,EAAE,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;YAChM,IAAI,CAAC,WAAW,GAAG,iBAAiB,CAAC,oBAAoB,CAAC,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,EAAE,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;YAEhM,IAAI,CAAC,WAAW,GAAG,iBAAiB,CAAC,oBAAoB,CAAC,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,EAAE,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;YAC7L,IAAI,CAAC,WAAW,GAAG,iBAAiB,CAAC,oBAAoB,CAAC,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,EAAE,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,EAAE,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;YACjM,IAAI,CAAC,WAAW,GAAG,iBAAiB,CAAC,oBAAoB,CAAC,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,EAAE,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;YACjM,gCAAgC;YAChC,kCAAkC;YAClC,qFAAqF;YACrF,uEAAuE;YACvE,6BAA6B;YAC7B,IAAI,CAAC,aAAa,GAAG,iBAAiB,CAAC,oBAAoB,CAAC,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC;YACpH,IAAI,CAAC,aAAa,GAAG,iBAAiB,CAAC,oBAAoB,CAAC,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC;YACpH,iBAAiB,CAAC,6BAA6B,CAAC,IAAI,CAAC,aAAa,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC;YACxF,2HAA2H;YAC3H,2HAA2H;YAE3H,IAAI,IAAI,CAAC,aAAa,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC;gBAC9B,SAAS,CAAC,YAAY,EAAE,CAAC;gBACzB,OAAO,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;gBAC5B,IAAI,QAAQ;oBACV,OAAO;YACX,CAAC;iBAAM,CAAC;gBACN,SAAS,CAAC,YAAY,EAAE,CAAC;gBACzB,OAAO,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;gBAC5B,IAAI,QAAQ;oBACV,OAAO;YACX,CAAC;QACH,CAAC;QACD,8JAA8J;QAC9J,IAAI,SAAS,CAAC,WAAW,EAAE,CAAC;YAC1B,OAAO,SAAS,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;gBAC7B,IAAI,CAAC,aAAa,GAAG,iBAAiB,CAAC,oBAAoB,CAAC,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,EAAE,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC;gBAChM,gIAAgI;gBAChI,OAAO,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;gBAC5B,SAAS,CAAC,YAAY,EAAE,CAAC;YAC3B,CAAC;QACH,CAAC;QAED,0IAA0I;QAC1I,IAAI,SAAS,CAAC,WAAW,EAAE,CAAC;YAC1B,OAAO,SAAS,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;gBAC7B,IAAI,CAAC,aAAa,GAAG,iBAAiB,CAAC,oBAAoB,CAAC,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,EAAE,SAAS,CAAC,MAAM,EAAE,SAAS,CAAC,KAAK,EAAE,CAAC,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC;gBAChM,+HAA+H;gBAC/H,OAAO,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;gBAC5B,SAAS,CAAC,YAAY,EAAE,CAAC;YAC3B,CAAC;QACH,CAAC;IACH,CAAC;IAEO,KAAK,CAAU;IACf,KAAK,CAAU;IACf,SAAS,CAAW;IACpB,SAAS,CAAW;IACpB,OAAO,CAAW;IAClB,OAAO,CAAW;IAC1B;;;;;OAKG;IACI,aAAa,CAClB,OAA6B,EAC7B,OAA6B,EAC7B,OAAgD;QAChD,mDAAmD;QACnD,IAAI,CAAC,eAAe,CAAC,qBAAqB,CAAC,OAAO,CAAC,EAAE,qBAAqB,CAAC,OAAO,CAAC,EAAE,OAAO,CAAC,CAAC;IAChG,CAAC;IACD;;;;;OAKG;IACK,eAAe,CACrB,OAA6B,EAC7B,OAA6B,EAC7B,OAAgD;QAChD,MAAM,SAAS,GAAG,4BAA4B,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC;QACvE,MAAM,SAAS,GAAG,4BAA4B,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC;QACvE,MAAM,MAAM,GAAG,4BAA4B,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC;QACpE,MAAM,MAAM,GAAG,4BAA4B,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC;QACpE,OAAO,SAAS,CAAC,MAAM,GAAG,CAAC,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,CAAC;YACtG,+BAA+B;YAC/B,+BAA+B;YAC/B,IAAI,IAAI,CAAC,YAAY,CAAC,OAAO,EAAE,SAAS,CAAC,KAAK,EAAE,OAAO,EAAE,SAAS,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC;gBAC9J,IAAI,CAAC,oBAAoB,CAAC,SAAS,EAAE,MAAM,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;gBAC1I,IAAI,CAAC,oBAAoB,CAAC,SAAS,EAAE,MAAM,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;gBAC1I,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;gBACxC,SAAS,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;gBAChC,SAAS,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;YAClC,CAAC;iBAAM,IAAI,IAAI,CAAC,YAAY,CAAC,OAAO,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,EAAE,OAAO,EAAE,SAAS,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC;gBACzK,MAAM,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;gBAChE,MAAM,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;gBAChE,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;gBACxC,SAAS,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;gBAChC,SAAS,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;YAClC,CAAC;iBAAM,IAAI,IAAI,CAAC,YAAY,CAAC,OAAO,EAAE,SAAS,CAAC,KAAK,EAAE,OAAO,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC;gBACzK,MAAM,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;gBAChE,MAAM,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;gBAChE,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;gBACxC,SAAS,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;gBAChC,SAAS,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;YAClC,CAAC;iBAAM,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACxD,MAAM,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;gBAChE,MAAM,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;gBAChE,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC;gBAC9C,SAAS,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;gBAChC,SAAS,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;YAClC,CAAC;iBAAM,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAChC,MAAM,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;gBAChE,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;gBAC1B,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;gBACxC,SAAS,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;gBAChC,SAAS,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;YAClC,CAAC;iBAAM,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAChC,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;gBAC1B,MAAM,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;gBAChE,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;gBACxC,SAAS,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;gBAChC,SAAS,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;YAClC,CAAC;YACD;;;;;sBAKU;QACZ,CAAC;QACD,gCAAgC;QAChC,IAAI,CAAC,SAAS,CAAC,SAAS,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;IAChD,CAAC;IACD,+DAA+D;IACxD,MAAM,CAAC,wBAAwB,GAAG,KAAK,CAAC,aAAa,CAAC,EAAE,CAAC,CAAC;IAC1D,MAAM,CAAC,aAAa,CAAC,kBAAyB,IAAI,CAAC,wBAAwB;QAChF,OAAO,IAAI,qCAAqC,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC;IAC5E,CAAC;;AAGH;;;;;GAKG;AACH,SAAS,qBAAqB,CAAC,IAA0B,EAAE,SAAS,GAAG,QAAQ,CAAC,mBAAmB;IACjG,IAAI,aAAa,GAAG,KAAK,CAAC;IAC1B,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;IACtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/B,IAAI,IAAI,CAAC,kBAAkB,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAE,IAAI,SAAS,EAAE,CAAC;YACpD,aAAa,GAAG,IAAI,CAAC;YACrB,MAAM;QACR,CAAC;IACH,CAAC;IACD,IAAI,CAAC,aAAa;QAChB,OAAO,IAAI,CAAC;IACd,MAAM,MAAM,GAAG,IAAI,gBAAgB,CAAC,CAAC,CAAC,CAAC;IACvC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,yBAAyB,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,yBAAyB,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,yBAAyB,CAAC,CAAC,CAAC,CAAC,CAAC;IACxH,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,IAAI,IAAI,CAAC,kBAAkB,CAAC,EAAE,EAAE,CAAC,CAAE,GAAG,SAAS,EAAE,CAAC;YAChD,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,yBAAyB,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,yBAAyB,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,yBAAyB,CAAC,CAAC,CAAC,CAAC,CAAC;YACxH,EAAE,GAAG,CAAC,CAAC;QACT,CAAC;IACH,CAAC;IACD,oDAAoD;IACpD,IAAI,IAAI,CAAC,kBAAkB,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAE,IAAI,SAAS,EAAE,CAAC;QACpD,MAAM,CAAC,GAAG,EAAE,CAAC;QACb,MAAM,CAAC,wBAAwB,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IAC7C,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC","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 { Angle } from \"../geometry3d/Angle\";\r\nimport { BarycentricTriangle } from \"../geometry3d/BarycentricTriangle\";\r\nimport { GrowableXYZArray } from \"../geometry3d/GrowableXYZArray\";\r\nimport { IndexedXYZCollectionInterval } from \"../geometry3d/IndexedCollectionInterval\";\r\nimport { IndexedXYZCollection } from \"../geometry3d/IndexedXYZCollection\";\r\nimport { Point3d, Vector3d } from \"../geometry3d/Point3dVector3d\";\r\nimport { TriangleCandidate } from \"./TriangleCandidate\";\r\n\r\n/** @packageDocumentation\r\n * @module Polyface\r\n */\r\n/**\r\n * * Context for constructing triangulations between linestrings with dis-similar point counts and distribution.\r\n * @internal\r\n */\r\nexport class GreedyTriangulationBetweenLineStrings {\r\n\r\n  private _vector1: Vector3d;\r\n  private constructor(turnRadians: number) {\r\n    this._turnRadians = turnRadians;\r\n    this._xyzA = Point3d.create();\r\n    this._xyzB = Point3d.create();\r\n    this._forwardA = Vector3d.create();\r\n    this._forwardB = Vector3d.create();\r\n    this._vector1 = Vector3d.create();\r\n    this._crossA = Vector3d.create();\r\n    this._crossB = Vector3d.create();\r\n  }\r\n\r\n  private _turnRadians: number;\r\n\r\n  private isForwardVector(\r\n    candidate: Vector3d,\r\n    forward: Vector3d,\r\n    perp: Vector3d): boolean {\r\n    if (candidate.dotProduct(forward) <= 0.0)\r\n      return false;\r\n    const theta = candidate.angleFromPerpendicular(perp);\r\n    if (Math.abs(theta.radians) > this._turnRadians)\r\n      return false;\r\n    return true;\r\n  }\r\n  private isPlanarBase(\r\n    pointsA: IndexedXYZCollection,\r\n    baseA: number,\r\n    pointsB: IndexedXYZCollection,\r\n    baseB: number,\r\n    xyzA: Point3d,\r\n    crossA: Vector3d,\r\n    forwardA: Vector3d,\r\n    xyzB: Point3d,\r\n    crossB: Vector3d,\r\n    forwardB: Vector3d): boolean {\r\n    if (baseA + 1 < pointsA.length && baseB + 1 < pointsB.length) {\r\n      pointsA.getPoint3dAtUncheckedPointIndex(baseA, xyzA);\r\n      pointsB.getPoint3dAtUncheckedPointIndex(baseB, xyzB);\r\n      pointsA.vectorXYAndZIndex(xyzA, baseA + 1, forwardA);\r\n      pointsB.vectorXYAndZIndex(xyzB, baseB + 1, forwardB);\r\n      Vector3d.createStartEnd(xyzA, xyzB, this._vector1);\r\n      this._vector1.crossProduct(forwardA, crossA);\r\n      this._vector1.crossProduct(forwardB, crossB);\r\n      if (!xyzA.isAlmostEqual(xyzB) && crossA.angleTo(crossB).radians < this._turnRadians)\r\n        return true;\r\n    }\r\n    return false;\r\n\r\n  }\r\n  /**\r\n   * Starting at start in source, examine points to see how long they are close to being \"in plane\"\r\n   * * child interval begins at parent.begin\r\n   * * child interval end initializes at trialEnd and grows.\r\n   * * child must be predefined by caller\r\n   * * Return the accepted interval\r\n   */\r\n  private advanceToPlanarLimit(\r\n    parent: IndexedXYZCollectionInterval,\r\n    child: IndexedXYZCollectionInterval,\r\n    trialEnd: number,\r\n    xyzA: Point3d,\r\n    perpA: Vector3d,\r\n    forwardA: Vector3d,\r\n    perpB: Vector3d,\r\n    forwardB: Vector3d) {\r\n    child.setFrom(parent, parent.begin, trialEnd);  // initialize as empty interval.\r\n    while (child.end < parent.end) {\r\n      child.points.vectorXYAndZIndex(xyzA, child.end, this._vector1);\r\n      if (!this.isForwardVector(this._vector1, forwardA, perpA))\r\n        break;\r\n      if (!this.isForwardVector(this._vector1, forwardB, perpB))\r\n        break;\r\n      if (child.end > 0) {\r\n        child.points.vectorIndexIndex(child.end - 1, child.end, this._vector1);\r\n        if (!this.isForwardVector(this._vector1, forwardA, perpA))\r\n          break;\r\n      }\r\n      child.end++;\r\n    }\r\n  }\r\n\r\n  private _triangleA1?: TriangleCandidate;\r\n  private _triangleB1?: TriangleCandidate;\r\n\r\n  private _triangleA2?: TriangleCandidate;\r\n  private _triangleB2?: TriangleCandidate;\r\n\r\n  private _triangleA3?: TriangleCandidate;\r\n  private _triangleB3?: TriangleCandidate;\r\n  private _bestTriangle?: TriangleCandidate;\r\n  private _workTriangle?: TriangleCandidate;\r\n  /** evaluate aspect ratios to select heuristically best triangles with given index intervals.\r\n   * (ASSUME NO DUPLICATES, as in caller.)\r\n   */\r\n  private addGreedy(\r\n    intervalA: IndexedXYZCollectionInterval,\r\n    intervalB: IndexedXYZCollectionInterval,\r\n    handler: (triangle: BarycentricTriangle) => void,\r\n    addOnly1: boolean = false) {\r\n    intervalA.restrictEnd();\r\n    intervalB.restrictEnd();\r\n\r\n    while (intervalA.length > 1 && intervalB.length > 1) {\r\n\r\n      // triangles A1 and B1 are always valid.\r\n      this._triangleA1 = TriangleCandidate.createFromIndexedXYZ(intervalA.points, intervalA.begin, intervalA.points, intervalA.begin + 1, intervalB.points, intervalB.begin, 1, this._triangleA1);\r\n      this._triangleA2 = TriangleCandidate.createFromIndexedXYZ(intervalA.points, intervalA.begin + 1, intervalA.points, intervalA.begin + 2, intervalB.points, intervalB.begin, 2, this._triangleA2);\r\n      this._triangleA3 = TriangleCandidate.createFromIndexedXYZ(intervalA.points, intervalA.begin, intervalA.points, intervalA.begin + 1, intervalB.points, intervalB.begin + 1, 3, this._triangleA3);\r\n\r\n      this._triangleB1 = TriangleCandidate.createFromIndexedXYZ(intervalB.points, intervalB.begin + 1, intervalB.points, intervalB.begin, intervalA.points, intervalA.begin, -1, this._triangleB1);\r\n      this._triangleB2 = TriangleCandidate.createFromIndexedXYZ(intervalB.points, intervalB.begin + 2, intervalB.points, intervalB.begin + 1, intervalA.points, intervalA.begin, -2, this._triangleB2);\r\n      this._triangleB3 = TriangleCandidate.createFromIndexedXYZ(intervalB.points, intervalB.begin + 1, intervalB.points, intervalB.begin, intervalA.points, intervalA.begin + 1, -3, this._triangleB3);\r\n      // Look at pairs of 2 triangles.\r\n      // (each pair begins with 1 or -1)\r\n      // For each pair find the smallest aspect ratio of its two triangles.  (Small is bad)\r\n      // Choose the pair where that (smaller aspect ratio of two) is largest.\r\n      // Advance in that direction.\r\n      this._bestTriangle = TriangleCandidate.copyWithLowerQuality(this._triangleA1, this._triangleB3, this._bestTriangle);\r\n      this._workTriangle = TriangleCandidate.copyWithLowerQuality(this._triangleB1, this._triangleA3, this._workTriangle);\r\n      TriangleCandidate.updateIfOtherHasHigherQuality(this._bestTriangle, this._workTriangle);\r\n      // TestTriangle::UpdateIfOtherHasLargerAspectRatio (bestTriangle, TestTriangle::MergeAspectRatio (triangleB1, triangleB2));\r\n      // TestTriangle::UpdateIfOtherHasLargerAspectRatio (bestTriangle, TestTriangle::MergeAspectRatio (triangleA1, triangleA2));\r\n\r\n      if (this._bestTriangle.id > 0) {\r\n        intervalA.advanceBegin();\r\n        handler(this._bestTriangle);\r\n        if (addOnly1)\r\n          return;\r\n      } else {\r\n        intervalB.advanceBegin();\r\n        handler(this._bestTriangle);\r\n        if (addOnly1)\r\n          return;\r\n      }\r\n    }\r\n    // sweep in trailing points from either side.  At least one of intervalA.begin, intervalB.begin is at its limit, so only one of these will execute any bodies.\r\n    if (intervalA.isSingleton) {\r\n      while (intervalB.length >= 2) {\r\n        this._workTriangle = TriangleCandidate.createFromIndexedXYZ(intervalB.points, intervalB.begin + 1, intervalB.points, intervalB.begin, intervalA.points, intervalA.begin, 0, this._workTriangle);\r\n        //  this._workTriangle.scaleFromPointInPlace(this._workTriangle.points[2], 0.95); // crude visualization aid for tracking logic.\r\n        handler(this._workTriangle);\r\n        intervalB.advanceBegin();\r\n      }\r\n    }\r\n\r\n    // sweep in trailing points from either side.  At least one of baseA, baseB is at its limit, so only one of these will execute any bodies.\r\n    if (intervalB.isSingleton) {\r\n      while (intervalA.length >= 2) {\r\n        this._workTriangle = TriangleCandidate.createFromIndexedXYZ(intervalA.points, intervalA.begin, intervalA.points, intervalA.begin + 1, intervalB.points, intervalB.begin, 0, this._workTriangle);\r\n        // this._workTriangle.scaleFromPointInPlace(this._workTriangle.points[2], 0.95); // crude visualization aid for tracking logic.\r\n        handler(this._workTriangle);\r\n        intervalA.advanceBegin();\r\n      }\r\n    }\r\n  }\r\n\r\n  private _xyzA: Point3d;\r\n  private _xyzB: Point3d;\r\n  private _forwardA: Vector3d;\r\n  private _forwardB: Vector3d;\r\n  private _crossA: Vector3d;\r\n  private _crossB: Vector3d;\r\n  /**\r\n   * Working from start to finish, emit triangles with heuristic lookahead to get pleasing matching between the linestrings.\r\n   * @param pointsA\r\n   * @param pointsB\r\n   * @param handler\r\n   */\r\n  public emitTriangles(\r\n    pointsA: IndexedXYZCollection,\r\n    pointsB: IndexedXYZCollection,\r\n    handler: (triangle: BarycentricTriangle) => void) {\r\n    /** Clean up duplicates for the real logic . . . */\r\n    this.emitTrianglesGo(resolveToNoDuplicates(pointsA), resolveToNoDuplicates(pointsB), handler);\r\n  }\r\n  /**\r\n   * Run triangle logic on inputs with no duplicates.\r\n   * @param pointsA\r\n   * @param pointsB\r\n   * @param handler\r\n   */\r\n  private emitTrianglesGo(\r\n    pointsA: IndexedXYZCollection,\r\n    pointsB: IndexedXYZCollection,\r\n    handler: (triangle: BarycentricTriangle) => void) {\r\n    const intervalA = IndexedXYZCollectionInterval.createComplete(pointsA);\r\n    const intervalB = IndexedXYZCollectionInterval.createComplete(pointsB);\r\n    const childA = IndexedXYZCollectionInterval.createComplete(pointsA);\r\n    const childB = IndexedXYZCollectionInterval.createComplete(pointsB);\r\n    while (intervalA.length > 0 && intervalB.length > 0 && (intervalA.length > 1 || intervalB.length > 1)) {\r\n      // const lA = intervalA.length;\r\n      // const lB = intervalB.length;\r\n      if (this.isPlanarBase(pointsA, intervalA.begin, pointsB, intervalB.begin, this._xyzA, this._crossA, this._forwardA, this._xyzB, this._crossB, this._forwardB)) {\r\n        this.advanceToPlanarLimit(intervalA, childA, intervalA.begin + 1, this._xyzA, this._crossA, this._forwardA, this._crossB, this._forwardB);\r\n        this.advanceToPlanarLimit(intervalB, childB, intervalB.begin + 1, this._xyzB, this._crossB, this._forwardB, this._crossA, this._forwardA);\r\n        this.addGreedy(childA, childB, handler);\r\n        intervalA.advanceToTail(childA);\r\n        intervalB.advanceToTail(childB);\r\n      } else if (this.isPlanarBase(pointsA, intervalA.begin + 1, pointsB, intervalB.begin, this._xyzA, this._crossA, this._forwardA, this._xyzB, this._crossB, this._forwardB)) {\r\n        childA.setFrom(intervalA, intervalA.begin, intervalA.begin + 2);\r\n        childB.setFrom(intervalB, intervalB.begin, intervalB.begin + 1);\r\n        this.addGreedy(childA, childB, handler);\r\n        intervalA.advanceToTail(childA);\r\n        intervalB.advanceToTail(childB);\r\n      } else if (this.isPlanarBase(pointsA, intervalA.begin, pointsB, intervalB.begin + 1, this._xyzA, this._crossA, this._forwardA, this._xyzB, this._crossB, this._forwardB)) {\r\n        childA.setFrom(intervalA, intervalA.begin, intervalA.begin + 1);\r\n        childB.setFrom(intervalB, intervalB.begin, intervalB.begin + 2);\r\n        this.addGreedy(childA, childB, handler);\r\n        intervalA.advanceToTail(childA);\r\n        intervalB.advanceToTail(childB);\r\n      } else if (intervalA.length > 1 && intervalB.length > 1) {\r\n        childA.setFrom(intervalA, intervalA.begin, intervalA.begin + 2);\r\n        childB.setFrom(intervalB, intervalB.begin, intervalB.begin + 2);\r\n        this.addGreedy(childA, childB, handler, true);\r\n        intervalA.advanceToHead(childA);\r\n        intervalB.advanceToHead(childB);\r\n      } else if (intervalA.length > 1) {\r\n        childA.setFrom(intervalA, intervalA.begin, intervalA.begin + 2);\r\n        childB.setFrom(intervalB);\r\n        this.addGreedy(childA, childB, handler);\r\n        intervalA.advanceToTail(childA);\r\n        intervalB.advanceToTail(childB);\r\n      } else if (intervalB.length > 1) {\r\n        childA.setFrom(intervalA);\r\n        childB.setFrom(intervalB, intervalB.begin, intervalB.begin + 2);\r\n        this.addGreedy(childA, childB, handler);\r\n        intervalA.advanceToTail(childA);\r\n        intervalB.advanceToTail(childB);\r\n      }\r\n      /*      if (intervalA.length >= lA && intervalB.length >= lB) {\r\n              // This should not happen == neither one advanced.   Just move ahead in the longer one ..\r\n              if (intervalA.length > intervalB.length)\r\n                intervalA.advanceBegin();\r\n              else intervalB.advanceBegin();\r\n            } */\r\n    }\r\n    // catch everything else blindly\r\n    this.addGreedy(intervalA, intervalB, handler);\r\n  }\r\n  /** Default angle for considering two vectors to be colinear */\r\n  public static defaultNearColinearAngle = Angle.createDegrees(15);\r\n  public static createContext(planarTurnAngle: Angle = this.defaultNearColinearAngle) {\r\n    return new GreedyTriangulationBetweenLineStrings(planarTurnAngle.radians);\r\n  }\r\n}\r\n\r\n/**\r\n * * If there are no contiguous duplicated points in `data` return `data` unchanged.\r\n * * If there are duplicates, compress to a new array.\r\n * @param data\r\n * @param tolerance\r\n */\r\nfunction resolveToNoDuplicates(data: IndexedXYZCollection, tolerance = Geometry.smallMetricDistance): IndexedXYZCollection {\r\n  let hasDuplicates = false;\r\n  const n = data.length;\r\n  for (let i = 0; i + 1 < n; i++) {\r\n    if (data.distanceIndexIndex(i, i + 1)! <= tolerance) {\r\n      hasDuplicates = true;\r\n      break;\r\n    }\r\n  }\r\n  if (!hasDuplicates)\r\n    return data;\r\n  const result = new GrowableXYZArray(n);\r\n  result.pushXYZ(data.getXAtUncheckedPointIndex(0), data.getYAtUncheckedPointIndex(0), data.getZAtUncheckedPointIndex(0));\r\n  let i0 = 0;\r\n  for (let i = 1; i < n; i++) {\r\n    if (data.distanceIndexIndex(i0, i)! > tolerance) {\r\n      result.pushXYZ(data.getXAtUncheckedPointIndex(i), data.getYAtUncheckedPointIndex(i), data.getZAtUncheckedPointIndex(i));\r\n      i0 = i;\r\n    }\r\n  }\r\n  /** enforce exact closure if original was closed. */\r\n  if (data.distanceIndexIndex(0, n - 1)! <= tolerance) {\r\n    result.pop();\r\n    result.pushFromGrowableXYZArray(result, 0);\r\n  }\r\n  return result;\r\n}\r\n"]}

package/lib/esm/polyface/IndexedEdgeMatcher.d.ts

@@ -2,60 +2,76 @@
  * @module Polyface
  */
 /**
- * * For boundary sorting, an edge is a (packed!) Float64Array.
- * * Fixed entry positions are:
- *   * [0] is start vertex index (in CCW order around its facet)
- *   * [1] is end vertex index (in CCW order around its facet)
- *   * [2] is facet index (or another number to associate with this edge).
+ * Represent an [[IndexedPolyface]] edge as:
+ * * vertex start index and vertex end index (CCW order around its facet)
+ * * an additional number to associate with the edge (e.g., facet index)
+ * @public
  */
-export declare class SortableEdge extends Float64Array {
+export declare class SortableEdge {
+    private _v;
+    private _a;
+    /** Constructor. */
+    constructor(startVertex: number, endVertex: number, facetIndex: number);
+    /** Clone the edge. */
+    clone(): SortableEdge;
     /** Return the vertex index that appears first in the order stored.  */
-    get vertexIndexA(): number;
+    get startVertex(): number;
     /** Return the vertex index that appears second in the order stored.  */
-    get vertexIndexB(): number;
+    get endVertex(): number;
     /**
      * Return the facet index.
      * * This value is carried along during matching. Typically it is a facet index, but it does not have to be.
      */
     get facetIndex(): number;
-    /** return true if vertexIndexA is less than vertexIndexB. */
+    /** return true if `startVertex` is less than `endVertex`. */
     get isLowHigh(): boolean;
     /** Return the vertex index with lower numeric value. */
-    get lowVertexIndex(): number;
+    get lowVertex(): number;
     /** Return the vertex index with higher numeric value. */
-    get highVertexIndex(): number;
-    /** Return true if the vertices edgeA and edgeB are the same vertex indices in opposite order. */
+    get highVertex(): number;
+    /** Return true if edgeA and edgeB traverse the same edge in the same direction. */
+    private static areSameEdge;
+    /** Return true if edgeA and edgeB traverse the same edge in opposite directions. */
     static areDirectedPartners(edgeA: SortableEdge, edgeB: SortableEdge): boolean;
-    /** Return true if the vertices edgeA and edgeB are the same vertex indices with no consideration of order. */
+    /** Return true if edgeA and edgeB traverse the same edge in the same or opposite directions. */
     static areUndirectedPartners(edgeA: SortableEdge, edgeB: SortableEdge): boolean;
     /**
-     * Return numeric relationship of edgeA and edgeB:
-     * * 1 if they share start and end in the same order.
-     * * -1 if they share start and end in reversed order.
+     * Return numeric identifier for the relationship between edgeA and edgeB:
+     * * 1 if they share start and end vertex indices in the same order.
+     * * -1 if they share start and end vertex indices in reversed order.
      * * 0 otherwise.
      */
     static relativeOrientation(edgeA: SortableEdge, edgeB: SortableEdge): number;
+    /** Whether the start and end vertex indices are equal. */
     get isNullEdge(): boolean;
     /**
      * Lexical comparison of two edges.
-     * * If the edges have the same vertex pair (in same or opposite order) they will end up adjacent in a sort.
-     * * If the edges have 0 or 1 shared vertex indices, the one with lowest low comes first.
+     * * If the edges have the same vertex index pair (in same or opposite order) they will end up adjacent in a sort.
      * @param edgeA first edge
      * @param edgeB second edge
      */
     static lessThan(edgeA: SortableEdge, edgeB: SortableEdge): number;
-    constructor(vertexA: number, vertexB: number, facetIndex: number);
+    /** Return the edge data as a JSON array. */
     toJSON(): any;
+    /** Return the edge cluster in JSON format.  */
     static clusterToJSON(data: SortableEdgeCluster): any;
+    /** Return the edge cluster array in JSON format. */
     static clusterArrayToJSON(data: SortableEdgeCluster[]): any[];
 }
+/**
+ * Union type for a single [[SortableEdge]] or a (matched) array of them.
+ * @public
+ */
 export type SortableEdgeCluster = SortableEdge | SortableEdge[];
 /**
- * An IndexedEdgeMatcher carries an array of edge start & end indices for sorting and subsequent analyses
- * (such as testing for closed mesh).
+ * An IndexedEdgeMatcher carries an array of edge start and end indices for sorting and subsequent analyses,
+ * such as testing for closed mesh.
+ * @public
  */
 export declare class IndexedEdgeMatcher {
+    /** The array of edges to be sorted. */
     edges: SortableEdge[];
+    /** Constructor. Call [[addEdge]] or [[addPath]] to populate `edges`. */
     constructor();
     /**
      * Push a new edge.
@@ -66,32 +82,31 @@ export declare class IndexedEdgeMatcher {
      */
     addEdge(vertexA: number, vertexB: number, facetIndex: number): SortableEdge;
     /**
-     * Push edges all around a facet, returning to vertexArray[0].
-     * @param vertexArray array of vertex indices around facet
-     * @param facetIndex value to carry along during matching
+     * Push edges along a path.
+     * * Typically used to add edges around a facet.
+     * @param vertexIndices array of vertex indices along an open or closed path.
+     * @param facetIndex value to set on each edge pushed.
      * @param closeLoop true to add an edge from last to first vertex.
      */
-    addPath(vertexArray: number[], facetIndex: number, closeLoop?: boolean): void;
-    /** Sort the edge index array. */
+    addPath(vertexIndices: number[], facetIndex: number, closeLoop: boolean): void;
+    /** Sort the edges. */
     sort(): void;
     /** Create a single or compound SortableEdgeCluster in dest. */
     private collectSortableEdgeCluster;
     /**
-     * Sort the edges, and look for three categories of paired edges:
-     * * caller must allocate all result arrays of interest.
-     * * Any combination of the result arrays may be `undefined`, indicating that category is to be ignored.
-     * * Any combination of the result arrays may be aliased as the same target, in which case those to categories are
+     * Sort the edges, and collect up to four categories of edges: manifold pairs, singletons, null edges,
+     * and everything else.
+     * * Caller should allocate arrays of interest.
+     * * Any combination of the arrays may be `undefined`, indicating that category is to be ignored.
+     * * Any combination of the arrays may be aliased as the same target, in which case the aliased categories are
      * merged into the target.
-     * * For instance, to ignore manifold pairs and collect all others (singleton, null, and other) as a single array
-     * `allOther`, create `const allOther = []` as an empty array and call
-     * `sortAndCollectClusters (undefined, allOther, allOther, allOther);`
-     * @param manifoldPairs optional array to receive pairs of properly mated SortableEdgePairs, i.e. simple interior
-     * edges adjacent to two facets in opposing directions.
-     * @param singletons optional array to receive edges that are simple boundary edges.
-     * @param nullEdges optional array to receive arrays of null edges (same start and end vertex)
-     * @param allOtherClusters optional array to receive arrays in which all the edges are partners in an undirected sense
-     * but not a simple directed pair.
+     * * For instance, to ignore manifold pairs and collect all other edges in a single array:
+     * `const foo = []; matcher.sortAndCollectClusters(undefined, foo, foo, foo);`
+     * @param manifoldPairs array to receive pairs of properly mated edges, i.e. mesh interior edges.
+     * @param singletons array to receive edges that have no partner, i.e., mesh boundary edges.
+     * @param nullEdges array to receive arrays of matched null edges, for which start === end vertex index.
+     * @param allOtherClusters array to receive arrays of edges that are partners in an undirected, non-manifold sense.
      */
-    sortAndCollectClusters(manifoldPairs: SortableEdgeCluster[] | undefined, singletons?: SortableEdgeCluster[], nullEdges?: SortableEdgeCluster[], allOtherClusters?: SortableEdgeCluster[]): void;
+    sortAndCollectClusters(manifoldPairs?: SortableEdgeCluster[], singletons?: SortableEdgeCluster[], nullEdges?: SortableEdgeCluster[], allOtherClusters?: SortableEdgeCluster[]): void;
 }
 //# sourceMappingURL=IndexedEdgeMatcher.d.ts.map

package/lib/esm/polyface/IndexedEdgeMatcher.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"IndexedEdgeMatcher.d.ts","sourceRoot":"","sources":["../../../src/polyface/IndexedEdgeMatcher.ts"],"names":[],"mappings":"AAKA;;GAEG;AAEH;;;;;;GAMG;AACH,qBAAa,YAAa,SAAQ,YAAY;IAC5C,uEAAuE;IACvE,IAAW,YAAY,IAAI,MAAM,CAEhC;IACD,wEAAwE;IACxE,IAAW,YAAY,IAAI,MAAM,CAEhC;IACD;;;OAGG;IACH,IAAW,UAAU,IAAI,MAAM,CAE9B;IACD,6DAA6D;IAC7D,IAAW,SAAS,IAAI,OAAO,CAE9B;IACD,wDAAwD;IACxD,IAAW,cAAc,IAAI,MAAM,CAElC;IACD,yDAAyD;IACzD,IAAW,eAAe,IAAI,MAAM,CAEnC;IACD,iGAAiG;WACnF,mBAAmB,CAAC,KAAK,EAAE,YAAY,EAAE,KAAK,EAAE,YAAY,GAAG,OAAO;IAGpF,8GAA8G;WAChG,qBAAqB,CAAC,KAAK,EAAE,YAAY,EAAE,KAAK,EAAE,YAAY,GAAG,OAAO;IAGtF;;;;;OAKG;WACW,mBAAmB,CAAC,KAAK,EAAE,YAAY,EAAE,KAAK,EAAE,YAAY,GAAG,MAAM;IAMnF,IAAW,UAAU,IAAI,OAAO,CAE/B;IACD;;;;;;OAMG;WACW,QAAQ,CAAC,KAAK,EAAE,YAAY,EAAE,KAAK,EAAE,YAAY,GAAG,MAAM;gBAiBrD,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM;IAMhE,MAAM,IAAI,GAAG;WAGN,aAAa,CAAC,IAAI,EAAE,mBAAmB,GAAG,GAAG;WAM7C,kBAAkB,CAAC,IAAI,EAAE,mBAAmB,EAAE;CAM7D;AACD,MAAM,MAAM,mBAAmB,GAAG,YAAY,GAAG,YAAY,EAAE,CAAC;AAChE;;;GAGG;AACH,qBAAa,kBAAkB;IACtB,KAAK,EAAE,YAAY,EAAE,CAAC;;IAK7B;;;;;;OAMG;IACI,OAAO,CAAC,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,GAAG,YAAY;IAKlF;;;;;OAKG;IACI,OAAO,CAAC,WAAW,EAAE,MAAM,EAAE,EAAE,UAAU,EAAE,MAAM,EAAE,SAAS,GAAE,OAAc;IASnF,iCAAiC;IAC1B,IAAI;IAGX,+DAA+D;IAC/D,OAAO,CAAC,0BAA0B;IAYlC;;;;;;;;;;;;;;;OAeG;IACI,sBAAsB,CAC3B,aAAa,EAAE,mBAAmB,EAAE,GAAG,SAAS,EAChD,UAAU,CAAC,EAAE,mBAAmB,EAAE,EAClC,SAAS,CAAC,EAAE,mBAAmB,EAAE,EACjC,gBAAgB,CAAC,EAAE,mBAAmB,EAAE,GACvC,IAAI;CA0BR"}
+{"version":3,"file":"IndexedEdgeMatcher.d.ts","sourceRoot":"","sources":["../../../src/polyface/IndexedEdgeMatcher.ts"],"names":[],"mappings":"AAKA;;GAEG;AAEH;;;;;GAKG;AACH,qBAAa,YAAY;IACvB,OAAO,CAAC,EAAE,CAAW;IACrB,OAAO,CAAC,EAAE,CAAS;IAEnB,mBAAmB;gBACA,WAAW,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM;IAI7E,sBAAsB;IACf,KAAK,IAAI,YAAY;IAG5B,uEAAuE;IACvE,IAAW,WAAW,IAAI,MAAM,CAE/B;IACD,wEAAwE;IACxE,IAAW,SAAS,IAAI,MAAM,CAE7B;IACD;;;OAGG;IACH,IAAW,UAAU,IAAI,MAAM,CAE9B;IACD,6DAA6D;IAC7D,IAAW,SAAS,IAAI,OAAO,CAE9B;IACD,wDAAwD;IACxD,IAAW,SAAS,IAAI,MAAM,CAE7B;IACD,yDAAyD;IACzD,IAAW,UAAU,IAAI,MAAM,CAE9B;IACD,mFAAmF;IACnF,OAAO,CAAC,MAAM,CAAC,WAAW;IAG1B,oFAAoF;WACtE,mBAAmB,CAAC,KAAK,EAAE,YAAY,EAAE,KAAK,EAAE,YAAY,GAAG,OAAO;IAGpF,gGAAgG;WAClF,qBAAqB,CAAC,KAAK,EAAE,YAAY,EAAE,KAAK,EAAE,YAAY,GAAG,OAAO;IAGtF;;;;;OAKG;WACW,mBAAmB,CAAC,KAAK,EAAE,YAAY,EAAE,KAAK,EAAE,YAAY,GAAG,MAAM;IAOnF,0DAA0D;IAC1D,IAAW,UAAU,IAAI,OAAO,CAE/B;IACD;;;;;OAKG;WACW,QAAQ,CAAC,KAAK,EAAE,YAAY,EAAE,KAAK,EAAE,YAAY,GAAG,MAAM;IAiBxE,4CAA4C;IACrC,MAAM,IAAI,GAAG;IAGpB,+CAA+C;WACjC,aAAa,CAAC,IAAI,EAAE,mBAAmB,GAAG,GAAG;IAO3D,oDAAoD;WACtC,kBAAkB,CAAC,IAAI,EAAE,mBAAmB,EAAE;CAM7D;AAED;;;GAGG;AACH,MAAM,MAAM,mBAAmB,GAAG,YAAY,GAAG,YAAY,EAAE,CAAC;AAEhE;;;;GAIG;AACH,qBAAa,kBAAkB;IAC7B,uCAAuC;IAChC,KAAK,EAAE,YAAY,EAAE,CAAC;IAC7B,wEAAwE;;IAIxE;;;;;;OAMG;IACI,OAAO,CAAC,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,GAAG,YAAY;IAKlF;;;;;;OAMG;IACI,OAAO,CAAC,aAAa,EAAE,MAAM,EAAE,EAAE,UAAU,EAAE,MAAM,EAAE,SAAS,EAAE,OAAO;IAS9E,sBAAsB;IACf,IAAI;IAGX,+DAA+D;IAC/D,OAAO,CAAC,0BAA0B;IAYlC;;;;;;;;;;;;;OAaG;IACI,sBAAsB,CAC3B,aAAa,CAAC,EAAE,mBAAmB,EAAE,EACrC,UAAU,CAAC,EAAE,mBAAmB,EAAE,EAClC,SAAS,CAAC,EAAE,mBAAmB,EAAE,EACjC,gBAAgB,CAAC,EAAE,mBAAmB,EAAE,GACvC,IAAI;CA6BR"}

package/lib/esm/polyface/IndexedEdgeMatcher.js

@@ -6,97 +6,107 @@
  * @module Polyface
  */
 /**
- * * For boundary sorting, an edge is a (packed!) Float64Array.
- * * Fixed entry positions are:
- *   * [0] is start vertex index (in CCW order around its facet)
- *   * [1] is end vertex index (in CCW order around its facet)
- *   * [2] is facet index (or another number to associate with this edge).
+ * Represent an [[IndexedPolyface]] edge as:
+ * * vertex start index and vertex end index (CCW order around its facet)
+ * * an additional number to associate with the edge (e.g., facet index)
+ * @public
  */
-export class SortableEdge extends Float64Array {
+export class SortableEdge {
+    _v;
+    _a;
+    /** Constructor. */
+    constructor(startVertex, endVertex, facetIndex) {
+        this._v = [startVertex, endVertex];
+        this._a = facetIndex;
+    }
+    /** Clone the edge. */
+    clone() {
+        return new SortableEdge(this._v[0], this._v[1], this._a);
+    }
     /** Return the vertex index that appears first in the order stored.  */
-    get vertexIndexA() {
-        return this[0];
+    get startVertex() {
+        return this._v[0];
     }
     /** Return the vertex index that appears second in the order stored.  */
-    get vertexIndexB() {
-        return this[1];
+    get endVertex() {
+        return this._v[1];
     }
     /**
      * Return the facet index.
      * * This value is carried along during matching. Typically it is a facet index, but it does not have to be.
      */
     get facetIndex() {
-        return this[2];
+        return this._a;
     }
-    /** return true if vertexIndexA is less than vertexIndexB. */
+    /** return true if `startVertex` is less than `endVertex`. */
     get isLowHigh() {
-        return this[0] < this[1];
+        return this._v[0] < this._v[1];
     }
     /** Return the vertex index with lower numeric value. */
-    get lowVertexIndex() {
-        return this[0] < this[1] ? this[0] : this[1];
+    get lowVertex() {
+        return this.isLowHigh ? this._v[0] : this._v[1];
     }
     /** Return the vertex index with higher numeric value. */
-    get highVertexIndex() {
-        return this[0] > this[1] ? this[0] : this[1];
+    get highVertex() {
+        return this.isLowHigh ? this._v[1] : this._v[0];
+    }
+    /** Return true if edgeA and edgeB traverse the same edge in the same direction. */
+    static areSameEdge(edgeA, edgeB) {
+        return edgeA._v[0] === edgeB._v[0] && edgeA._v[1] === edgeB._v[1];
     }
-    /** Return true if the vertices edgeA and edgeB are the same vertex indices in opposite order. */
+    /** Return true if edgeA and edgeB traverse the same edge in opposite directions. */
     static areDirectedPartners(edgeA, edgeB) {
-        return edgeA[0] === edgeB[1] && edgeA[1] === edgeB[0];
+        return edgeA._v[0] === edgeB._v[1] && edgeA._v[1] === edgeB._v[0];
     }
-    /** Return true if the vertices edgeA and edgeB are the same vertex indices with no consideration of order. */
+    /** Return true if edgeA and edgeB traverse the same edge in the same or opposite directions. */
     static areUndirectedPartners(edgeA, edgeB) {
-        return (edgeA[0] === edgeB[0] && edgeA[1] === edgeB[1]) || ((edgeA[0] === edgeB[1] && edgeA[1] === edgeB[0]));
+        return this.areSameEdge(edgeA, edgeB) || this.areDirectedPartners(edgeA, edgeB);
     }
     /**
-     * Return numeric relationship of edgeA and edgeB:
-     * * 1 if they share start and end in the same order.
-     * * -1 if they share start and end in reversed order.
+     * Return numeric identifier for the relationship between edgeA and edgeB:
+     * * 1 if they share start and end vertex indices in the same order.
+     * * -1 if they share start and end vertex indices in reversed order.
      * * 0 otherwise.
      */
     static relativeOrientation(edgeA, edgeB) {
-        if (edgeA[0] === edgeB[0] && edgeA[1] === edgeB[1])
+        if (this.areSameEdge(edgeA, edgeB))
             return 1;
-        if (edgeA[0] === edgeB[1] && edgeA[1] === edgeB[0])
+        if (this.areDirectedPartners(edgeA, edgeB))
             return -1;
         return 0;
     }
+    /** Whether the start and end vertex indices are equal. */
     get isNullEdge() {
-        return this[0] === this[1];
+        return this._v[0] === this._v[1];
     }
     /**
      * Lexical comparison of two edges.
-     * * If the edges have the same vertex pair (in same or opposite order) they will end up adjacent in a sort.
-     * * If the edges have 0 or 1 shared vertex indices, the one with lowest low comes first.
+     * * If the edges have the same vertex index pair (in same or opposite order) they will end up adjacent in a sort.
      * @param edgeA first edge
      * @param edgeB second edge
      */
     static lessThan(edgeA, edgeB) {
         // primary compare is based on indirect indices
-        const lowA = edgeA.lowVertexIndex;
-        const lowB = edgeB.lowVertexIndex;
+        const lowA = edgeA.lowVertex;
+        const lowB = edgeB.lowVertex;
         if (lowA < lowB)
             return -1;
         if (lowB < lowA)
             return 1;
-        const highA = edgeA.highVertexIndex;
-        const highB = edgeB.highVertexIndex;
+        const highA = edgeA.highVertex;
+        const highB = edgeB.highVertex;
         if (highA < highB)
             return -1;
         if (highB < highA)
             return 1;
         // undirected indices match ... use directed vertexIndexA
-        return edgeA.vertexIndexA - edgeB.vertexIndexA;
-    }
-    constructor(vertexA, vertexB, facetIndex) {
-        super(3);
-        this[0] = vertexA;
-        this[1] = vertexB;
-        this[2] = facetIndex;
+        return edgeA.startVertex - edgeB.startVertex;
     }
+    /** Return the edge data as a JSON array. */
     toJSON() {
-        return [this[0], this[1], this[2]];
+        return [this._v[0], this._v[1], this._a];
     }
+    /** Return the edge cluster in JSON format.  */
     static clusterToJSON(data) {
         if (data instanceof SortableEdge)
             return data.toJSON();
@@ -104,6 +114,7 @@ export class SortableEdge extends Float64Array {
         for (const edge of data)
             result.push(edge.toJSON());
     }
+    /** Return the edge cluster array in JSON format. */
     static clusterArrayToJSON(data) {
         const result = [];
         for (const cluster of data)
@@ -112,11 +123,14 @@ export class SortableEdge extends Float64Array {
     }
 }
 /**
- * An IndexedEdgeMatcher carries an array of edge start & end indices for sorting and subsequent analyses
- * (such as testing for closed mesh).
+ * An IndexedEdgeMatcher carries an array of edge start and end indices for sorting and subsequent analyses,
+ * such as testing for closed mesh.
+ * @public
  */
 export class IndexedEdgeMatcher {
+    /** The array of edges to be sorted. */
     edges;
+    /** Constructor. Call [[addEdge]] or [[addPath]] to populate `edges`. */
     constructor() {
         this.edges = [];
     }
@@ -133,22 +147,22 @@ export class IndexedEdgeMatcher {
         return edge;
     }
     /**
-     * Push edges all around a facet, returning to vertexArray[0].
-     * @param vertexArray array of vertex indices around facet
-     * @param facetIndex value to carry along during matching
+     * Push edges along a path.
+     * * Typically used to add edges around a facet.
+     * @param vertexIndices array of vertex indices along an open or closed path.
+     * @param facetIndex value to set on each edge pushed.
      * @param closeLoop true to add an edge from last to first vertex.
      */
-    addPath(vertexArray, facetIndex, closeLoop = true) {
-        if (vertexArray.length === 0)
+    addPath(vertexIndices, facetIndex, closeLoop) {
+        if (vertexIndices.length === 0)
             return;
-        const m = vertexArray.length - 1;
-        for (let i = 0; i < m; i++) {
-            this.addEdge(vertexArray[i], vertexArray[i + 1], facetIndex);
-        }
+        const m = vertexIndices.length - 1;
+        for (let i = 0; i < m; i++)
+            this.addEdge(vertexIndices[i], vertexIndices[i + 1], facetIndex);
         if (closeLoop)
-            this.addEdge(vertexArray[m], vertexArray[0], facetIndex);
+            this.addEdge(vertexIndices[m], vertexIndices[0], facetIndex);
     }
-    /** Sort the edge index array. */
+    /** Sort the edges. */
     sort() {
         this.edges.sort((edgeA, edgeB) => SortableEdge.lessThan(edgeA, edgeB));
     }
@@ -167,20 +181,18 @@ export class IndexedEdgeMatcher {
         }
     }
     /**
-     * Sort the edges, and look for three categories of paired edges:
-     * * caller must allocate all result arrays of interest.
-     * * Any combination of the result arrays may be `undefined`, indicating that category is to be ignored.
-     * * Any combination of the result arrays may be aliased as the same target, in which case those to categories are
+     * Sort the edges, and collect up to four categories of edges: manifold pairs, singletons, null edges,
+     * and everything else.
+     * * Caller should allocate arrays of interest.
+     * * Any combination of the arrays may be `undefined`, indicating that category is to be ignored.
+     * * Any combination of the arrays may be aliased as the same target, in which case the aliased categories are
      * merged into the target.
-     * * For instance, to ignore manifold pairs and collect all others (singleton, null, and other) as a single array
-     * `allOther`, create `const allOther = []` as an empty array and call
-     * `sortAndCollectClusters (undefined, allOther, allOther, allOther);`
-     * @param manifoldPairs optional array to receive pairs of properly mated SortableEdgePairs, i.e. simple interior
-     * edges adjacent to two facets in opposing directions.
-     * @param singletons optional array to receive edges that are simple boundary edges.
-     * @param nullEdges optional array to receive arrays of null edges (same start and end vertex)
-     * @param allOtherClusters optional array to receive arrays in which all the edges are partners in an undirected sense
-     * but not a simple directed pair.
+     * * For instance, to ignore manifold pairs and collect all other edges in a single array:
+     * `const foo = []; matcher.sortAndCollectClusters(undefined, foo, foo, foo);`
+     * @param manifoldPairs array to receive pairs of properly mated edges, i.e. mesh interior edges.
+     * @param singletons array to receive edges that have no partner, i.e., mesh boundary edges.
+     * @param nullEdges array to receive arrays of matched null edges, for which start === end vertex index.
+     * @param allOtherClusters array to receive arrays of edges that are partners in an undirected, non-manifold sense.
      */
     sortAndCollectClusters(manifoldPairs, singletons, nullEdges, allOtherClusters) {
         this.sort();
@@ -201,18 +213,14 @@ export class IndexedEdgeMatcher {
                 SortableEdge.areUndirectedPartners(baseEdge, this.edges[index1]); index1++) {
                 clusterLength++;
             }
-            if (this.edges[index0].isNullEdge) {
+            if (this.edges[index0].isNullEdge)
                 this.collectSortableEdgeCluster(index0, index0 + clusterLength, nullEdges);
-            }
-            else if (clusterLength === 2 && SortableEdge.areDirectedPartners(baseEdge, this.edges[index0 + 1])) {
+            else if (clusterLength === 2 && SortableEdge.areDirectedPartners(baseEdge, this.edges[index0 + 1]))
                 this.collectSortableEdgeCluster(index0, index0 + clusterLength, manifoldPairs);
-            }
-            else if (clusterLength === 1) {
+            else if (clusterLength === 1)
                 this.collectSortableEdgeCluster(index0, index0 + 1, singletons);
-            }
-            else {
+            else
                 this.collectSortableEdgeCluster(index0, index0 + clusterLength, allOtherClusters);
-            }
         }
     }
 }