@itwin/core-geometry 5.2.0-dev.8 → 5.2.0

package/lib/cjs/topology/RegularizeFace.js.map

@@ -1 +1 @@
-{"version":3,"file":"RegularizeFace.js","sourceRoot":"","sources":["../../../src/topology/RegularizeFace.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AAEH,mCAAgE;AAChE,uCAA6C;AAE7C;;;GAGG;AACH,MAAa,qBAAqB;IAChC,mDAAmD;IACnD,yDAAyD;IACzD,0CAA0C;IAC1C,8EAA8E;IAC9E,0DAA0D;IACnD,MAAM,CAAC,YAAY,CAAmF;IAC7G,YAAmB,KAAoB;QACrC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;QAClB,IAAI,CAAC,SAAS,GAAG,EAAE,CAAC;QACpB,IAAI,CAAC,WAAW,GAAG,EAAE,CAAC;QACtB,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAC;QACnB,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAC;QACnB,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAC;IACrB,CAAC;IAED;;OAEG;IACI,KAAK,CAAgB;IAC5B,6GAA6G;IACtG,OAAO,CAAa;IAC3B,8GAA8G;IACvG,SAAS,CAAa;IAC7B,2FAA2F;IACpF,QAAQ,CAAa;IAC5B,6FAA6F;IACtF,WAAW,CAAa;IAE/B,kGAAkG;IAC3F,QAAQ,CAAa;IAC5B,oGAAoG;IAC7F,QAAQ,CAAa;IAC5B;;;;OAIG;IACI,+BAA+B,CAAC,QAAkB;QACvD,IAAI,KAAK,GAAG,QAAQ,CAAC;QACrB,IAAI,KAAK,CAAC;QACV,IAAI,KAAK,CAAC;QACV,IAAI,IAAI,CAAC;QACT,IAAI,IAAI,CAAC;QACT,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;QACxB,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;QAC1B,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;QACzB,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;QAC5B,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;QACzB,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;QACzB,GAAG,CAAC;YACF,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;YAC5B,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;YAC5B,IAAI,GAAG,0BAAgB,CAAC,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;YAC3D,IAAI,GAAG,0BAAgB,CAAC,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;YAC3D,IAAI,IAAI,EAAE,CAAC;gBACT,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACzB,IAAI,CAAC,IAAI,EAAE,CAAC;oBACV,IAAI,0BAAgB,CAAC,qBAAqB,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC;wBACjE,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;;wBAE1B,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBAC9B,CAAC;YAEH,CAAC;iBAAM,CAAC,CAAC,aAAa;gBACpB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBAC3B,IAAI,IAAI,EAAE,CAAC;oBACT,IAAI,0BAAgB,CAAC,qBAAqB,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC;wBACjE,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;;wBAE7B,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBAC9B,CAAC;YACH,CAAC;YACD,KAAK,GAAG,KAAK,CAAC;QAChB,CAAC,QAAQ,KAAK,KAAK,QAAQ,EAAE;IAC/B,CAAC;IAED;;;;OAIG;IACI,uCAAuC,CAAC,cAA0B;QACvE,IAAI,KAAK,CAAC;QACV,IAAI,KAAK,CAAC;QACV,IAAI,KAAK,CAAC;QACV,IAAI,IAAI,CAAC;QACT,IAAI,IAAI,CAAC;QACT,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;QACxB,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;QAC1B,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;QACzB,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;QAC5B,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;QACzB,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;QACzB,KAAK,KAAK,IAAI,cAAc,EAAE,CAAC;YAC7B,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;YAC5B,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;YAC5B,IAAI,GAAG,0BAAgB,CAAC,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;YAC3D,IAAI,GAAG,0BAAgB,CAAC,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;YAC3D,IAAI,IAAI,EAAE,CAAC;gBACT,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACzB,IAAI,CAAC,IAAI,EAAE,CAAC;oBACV,IAAI,0BAAgB,CAAC,qBAAqB,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC;wBACjE,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;;wBAE1B,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBAC9B,CAAC;YAEH,CAAC;iBAAM,CAAC,CAAC,aAAa;gBACpB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBAC3B,IAAI,IAAI,EAAE,CAAC;oBACT,IAAI,0BAAgB,CAAC,qBAAqB,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC;wBACjE,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;;wBAE7B,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBAC9B,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAEO,UAAU;QAChB,IAAI,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC;QAAC,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,OAAO,CAAC;QAAC,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC;QAC9E,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC;QAAC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;QAAC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;QAC1E,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC;QAAC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC;QAAC,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;IAClF,CAAC;IAED;;;;;;;;OAQG;IACK,kBAAkB,CAAC,IAAc,EAAE,UAAsB,EAC/D,aAAqB;QACrB,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC;QAClB,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC;QAClB,IAAI,EAAE,CAAC;QACP,IAAI,aAAa,GAAG,MAAM,CAAC,gBAAgB,CAAC;QAC5C,IAAI,MAA4B,CAAC;QACjC,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;YACnC,MAAM,QAAQ,GAAG,SAAS,CAAC,aAAa,CAAC;YACzC,IAAI,SAAS,KAAK,IAAI,IAAI,QAAQ,KAAK,IAAI;gBACzC,SAAS;YACX,0FAA0F;YAC1F,MAAM,MAAM,GAAG,0BAAgB,CAAC,gBAAgB,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;YAClE,MAAM,IAAI,GAAG,0BAAgB,CAAC,gBAAgB,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;YAC/D,mFAAmF;YACnF,IAAI,MAAM,GAAG,IAAI,IAAI,CAAC;gBACpB,SAAS;YACX,MAAM,QAAQ,GAAG,gBAAQ,CAAC,wBAAwB,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC;YAClE,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;gBAC3B,EAAE,GAAG,aAAa,GAAG,CAAC,SAAS,CAAC,WAAW,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC,CAAC;gBAC5D,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,aAAa,EAAE,CAAC;oBACjC,MAAM,GAAG,SAAS,CAAC;oBACnB,aAAa,GAAG,EAAE,CAAC;gBACrB,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;OAKG;IACK,uBAAuB,CAAC,QAAkB,EAAE,aAAmC,EAAE,WAAiC;QACxH,IAAI,WAAW,CAAC;QAEhB,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YACnC,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC;YACpB,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC;YACpB,sCAAsC;YACtC,IAAI,WAAW,KAAK,SAAS,IAAI,0BAAgB,CAAC,gBAAgB,CAAC,MAAM,EAAE,WAAW,CAAC,GAAG,CAAC;gBACzF,SAAS;YACX,iGAAiG;YACjG,IAAI,0BAAgB,CAAC,gBAAgB,CAAC,MAAM,EAAE,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC5D,IAAI,aAAa,EAAE,CAAC;oBAClB,MAAM,QAAQ,GAAG,gBAAQ,CAAC,wBAAwB,CAAC,aAAa,EAAE,EAAE,CAAC,CAAC;oBACtE,IAAI,QAAQ,KAAK,SAAS;wBACxB,SAAS;oBACX,IAAI,EAAE,IAAI,aAAa,CAAC,WAAW,CAAC,QAAQ,CAAC;wBAC3C,SAAS;gBACb,CAAC;gBACD,IAAI,WAAW,EAAE,CAAC;oBAChB,MAAM,QAAQ,GAAG,gBAAQ,CAAC,wBAAwB,CAAC,WAAW,EAAE,EAAE,CAAC,CAAC;oBACpE,IAAI,QAAQ,KAAK,SAAS;wBACxB,SAAS;oBACX,IAAI,WAAW,CAAC,WAAW,CAAC,QAAQ,CAAC,IAAI,EAAE;wBACzC,SAAS;gBACb,CAAC;gBACD,WAAW,GAAG,MAAM,CAAC;YACvB,CAAC;QACH,CAAC;QACD,OAAO,WAAW,CAAC;IACrB,CAAC;IAEO,aAAa,CAAC,OAA6B,EAAE,SAA+B,EAAE,OAA6C;QACjI,IAAI,CAAC,OAAO;YACV,OAAO,SAAS,CAAC;QACnB,IAAI,CAAC,SAAS;YACZ,OAAO,OAAO,CAAC;QACjB,oDAAoD;QACpD,IAAI,OAAO,CAAC,OAAO,EAAE,SAAS,CAAC,GAAG,CAAC;YACjC,OAAO,SAAS,CAAC;QACnB,OAAO,OAAO,CAAC;IACjB,CAAC;IACO,QAAQ;QACd,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,YAAY,EAAE,CAAC;YAC3C,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;YACb,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QACf,CAAC;IACH,CAAC;IACO,gCAAgC,CAAC,IAAc;QACrD,IAAI,SAAS,CAAC;QACd,MAAM,UAAU,GAAG,CAAC,CAAW,EAAE,CAAW,EAAE,EAAE,CAAC,0BAAgB,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACzF,MAAM,UAAU,GAAG,IAAI,CAAC,kBAAkB,CAAC,IAAI,EAAE,IAAI,CAAC,OAAO,EAAE,GAAG,CAAE,CAAC;QACrE,MAAM,YAAY,GAAG,IAAI,CAAC,kBAAkB,CAAC,IAAI,EAAE,IAAI,CAAC,SAAS,EAAE,CAAC,GAAG,CAAE,CAAC;QAC1E,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC,SAAS,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC;QAClE,IAAI,YAAY;YACd,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC,SAAS,EAAE,YAAY,CAAC,aAAa,EAAE,UAAU,CAAC,CAAC;QACpF,MAAM,gBAAgB,GAAG,IAAI,CAAC,uBAAuB,CAAC,IAAI,EAAE,YAAY,EAAE,UAAU,CAAC,CAAC;QACtF,IAAI,gBAAgB,KAAK,SAAS;YAChC,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC,SAAS,EAAE,gBAAgB,EAAE,UAAU,CAAC,CAAC;QAC1E,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,wGAAwG;IAChG,iBAAiB,CAAC,KAAe,EAAE,KAAe;QACxD,IAAI,MAAM,GAAG,KAAK,CAAC;QACnB,GAAG,CAAC;YACF,IAAI,gBAAQ,CAAC,qBAAqB,CAAC,KAAK,EAAE,MAAM,CAAC;gBAC/C,OAAO,MAAM,CAAC;YAChB,MAAM,GAAG,MAAM,CAAC,eAAe,CAAC;QAClC,CAAC,QAAQ,MAAM,KAAK,KAAK,EAAE;QAC3B,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;OAKG;IACK,SAAS,CAAC,KAAe,EAAE,KAAe,EAAE,SAAiB;QACnE,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACtG,MAAM,MAAM,GAAG,IAAI,CAAC,iBAAiB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QACpD,MAAM,MAAM,GAAG,IAAI,CAAC,iBAAiB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QACpD,IAAI,MAAM,KAAK,SAAS,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACjD,gBAAQ,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;YAC9B,gBAAQ,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,QAAQ,CAAC,CAAC;YACvC,KAAK,CAAC,iBAAiB,CAAC,oBAAY,CAAC,gBAAgB,CAAC,CAAC;YACvD,IAAI,qBAAqB,CAAC,YAAY;gBACpC,qBAAqB,CAAC,YAAY,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;YACnF,OAAO,KAAK,CAAC;QACf,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;;;;OAUG;IACK,iBAAiB,CAAC,UAAmB,IAAI,EAAE,YAAqB,IAAI;QAC1E,IAAI,OAAO,EAAE,CAAC;YACZ,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,0BAAgB,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACzE,KAAK,MAAM,UAAU,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;gBAC1C,wFAAwF;gBACxF,IAAI,CAAC,0BAAgB,CAAC,UAAU,CAAC,UAAU,CAAC;oBAC1C,SAAS;gBACX,MAAM,MAAM,GAAG,IAAI,CAAC,gCAAgC,CAAC,UAAU,CAAC,CAAC;gBACjE,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;oBACzB,uHAAuH;oBACvH,IAAI,CAAC,SAAS,CAAC,UAAU,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC;gBACxC,CAAC;YACH,CAAC;QACH,CAAC;QACD,IAAI,SAAS,EAAE,CAAC;YACd,8BAA8B;YAC9B,IAAI,CAAC,QAAQ,EAAE,CAAC;YAChB,yCAAyC;YACzC,IAAI,CAAC,UAAU,EAAE,CAAC;YAClB,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,0BAAgB,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACzE,KAAK,MAAM,UAAU,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;gBAC1C,IAAI,CAAC,0BAAgB,CAAC,UAAU,CAAC,UAAU,CAAC;oBAC1C,SAAS;gBACX,MAAM,MAAM,GAAG,IAAI,CAAC,gCAAgC,CAAC,UAAU,CAAC,CAAC;gBACjE,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;oBACzB,IAAI,CAAC,SAAS,CAAC,UAAU,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC;gBACzC,CAAC;YACH,CAAC;YACD,IAAI,CAAC,QAAQ,EAAE,CAAC;YAChB,IAAI,CAAC,UAAU,EAAE,CAAC;QACpB,CAAC;IACH,CAAC;IAED;;;;;;;;;;OAUG;IACI,cAAc,CAAC,QAAkB,EAAE,UAAmB,IAAI,EAAE,YAAqB,IAAI;QAC1F,IAAI,CAAC,+BAA+B,CAAC,QAAQ,CAAC,CAAC;QAC/C,IAAI,CAAC,iBAAiB,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;IAC7C,CAAC;IAEM,eAAe,CAAC,UAAmB,IAAI,EAAE,YAAqB,IAAI;QACvE,IAAI,CAAC,uCAAuC,CAAC,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;QACtE,IAAI,CAAC,iBAAiB,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;IAC7C,CAAC;IAED,yEAAyE;IAClE,MAAM,CAAC,cAAc,CAAC,IAAc;QACzC,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,IAAI,OAA6B,CAAC;QAClC,IAAI,KAAK,GAAG,IAAI,CAAC;QACjB,GAAG,CAAC;YACF,MAAM,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;YAClC,MAAM,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;YAClC,MAAM,EAAE,GAAG,0BAAgB,CAAC,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;YAC3D,MAAM,EAAE,GAAG,0BAAgB,CAAC,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;YAC3D,IAAI,EAAE,GAAG,EAAE,IAAI,CAAC,EAAE,CAAC;gBACjB,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC;oBACX,MAAM,EAAE,CAAC;oBACT,OAAO,GAAG,KAAK,CAAC;gBAClB,CAAC;gBACD,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC;oBACX,MAAM,EAAE,CAAC;gBACX,CAAC;YACH,CAAC;QACH,CAAC,QAAQ,CAAC,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC,KAAK,IAAI,EAAE;QACjD,OAAO,MAAM,KAAK,CAAC,IAAI,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC;IAC5D,CAAC;IACD;;;;;;OAMG;IACI,MAAM,CAAC,gCAAgC,CAC5C,KAAoB,EACpB,gBAAyB,EACzB,MAAgD,EAChD,WAAmC,EACnC,aAAqC;QACrC,IAAI,WAAW;YACb,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;QACzB,IAAI,aAAa;YACf,aAAa,CAAC,MAAM,GAAG,CAAC,CAAC;QAC3B,MAAM,IAAI,GAAG,oBAAY,CAAC,OAAO,CAAC;QAClC,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;QACtB,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,YAAY,EAAE,CAAC;YACtC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;gBACxB,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;gBAC7B,IAAI,CAAC,gBAAgB,IAAI,IAAI,CAAC,cAAc,EAAE,GAAG,CAAC,EAAE,CAAC;oBACnD,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;oBAC1B,IAAI,IAAI,EAAE,CAAC;wBACT,IAAI,WAAW;4BACb,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBAC3B,CAAC;yBAAM,CAAC;wBACN,IAAI,aAAa;4BACf,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBAC7B,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;CAEF;AAhYD,sDAgYC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n\n/** @packageDocumentation\n * @module Topology\n */\n\nimport { HalfEdge, HalfEdgeGraph, HalfEdgeMask } from \"./Graph\";\nimport { HalfEdgeGraphOps } from \"./Merging\";\n\n/**\n * * Context for regularizing single faces.\n * @internal\n */\nexport class RegularizationContext {\n  // For debugging use ... \"almost always\" undefined.\n  // If defined, it is called with each inserted node pair.\n  // scale will be either plus or minus one.\n  // when it is negative, the node coordinates (both x and y) have been negated.\n  // The call is made after full insertion into vertex loop.\n  public static announceEdge?: (graph: HalfEdgeGraph, nodeA: HalfEdge, nodeB: HalfEdge, scale: number) => void;\n  public constructor(graph: HalfEdgeGraph) {\n    this.graph = graph;\n    this.upEdges = [];\n    this.downEdges = [];\n    this.bottomPeaks = [];\n    this.topPeaks = [];\n    this.localMin = [];\n    this.localMax = [];\n  }\n\n  /**\n   * These are public only for testing.\n   */\n  public graph: HalfEdgeGraph;\n  /** array of edges directed upward.  Turn can be left or right, but is not large enough to be a min or max */\n  public upEdges: HalfEdge[];\n  /** array of edges directed downward, Turn can be left or right, but is not large enough to be a min or max */\n  public downEdges: HalfEdge[];\n  /** Array of edges whose start is an upward peak (right turn, inbound up, outbound down) */\n  public topPeaks: HalfEdge[];\n  /** Array of edges whose start is an downward peak (right turn, inbound down, outbound up) */\n  public bottomPeaks: HalfEdge[];\n\n  /** Array of edges at local minima (left turn, inbound down, outbound up).  Ensuing chain is up */\n  public localMin: HalfEdge[];\n  /** Array of edges at local maxima (left turn, inbound up, outbound down).  Ensuing chain is down */\n  public localMax: HalfEdge[];\n  /**\n   * Collect (and classify) all the edges around a single face.\n   * * The various arrays are collected: upEdges, downEdges, topPeaks, bottomPeaks, upChains, downChains\n   * @param faceSeed face to examine\n   */\n  public collectVerticalEventsAroundFace(faceSeed: HalfEdge) {\n    let nodeA = faceSeed;\n    let nodeB;\n    let nodeC;\n    let abUp;\n    let bcUp;\n    this.upEdges.length = 0;\n    this.downEdges.length = 0;\n    this.topPeaks.length = 0;\n    this.bottomPeaks.length = 0;\n    this.localMin.length = 0;\n    this.localMax.length = 0;\n    do {\n      nodeB = nodeA.faceSuccessor;\n      nodeC = nodeB.faceSuccessor;\n      abUp = HalfEdgeGraphOps.compareNodesYXUp(nodeA, nodeB) < 0;\n      bcUp = HalfEdgeGraphOps.compareNodesYXUp(nodeB, nodeC) < 0;\n      if (abUp) {\n        this.upEdges.push(nodeA);\n        if (!bcUp) {\n          if (HalfEdgeGraphOps.crossProductToTargets(nodeB, nodeA, nodeC) < 0)\n            this.localMax.push(nodeB);\n          else\n            this.topPeaks.push(nodeB);\n        }\n\n      } else { // ab is DOWN\n        this.downEdges.push(nodeA);\n        if (bcUp) {\n          if (HalfEdgeGraphOps.crossProductToTargets(nodeB, nodeA, nodeC) > 0)\n            this.bottomPeaks.push(nodeB);\n          else\n            this.localMin.push(nodeB);\n        }\n      }\n      nodeA = nodeB;\n    } while (nodeA !== faceSeed);\n  }\n\n  /**\n   * Collect (and classify) all the edges in an array.\n   * * The various arrays are collected: upEdges, downEdges, topPeaks, bottomPeaks, upChains, downChains\n   * @param candidateEdges array of edges.\n   */\n  public collectVerticalEventFromEdgesInAndArray(candidateEdges: HalfEdge[]) {\n    let nodeA;\n    let nodeB;\n    let nodeC;\n    let abUp;\n    let bcUp;\n    this.upEdges.length = 0;\n    this.downEdges.length = 0;\n    this.topPeaks.length = 0;\n    this.bottomPeaks.length = 0;\n    this.localMin.length = 0;\n    this.localMax.length = 0;\n    for (nodeA of candidateEdges) {\n      nodeB = nodeA.faceSuccessor;\n      nodeC = nodeB.faceSuccessor;\n      abUp = HalfEdgeGraphOps.compareNodesYXUp(nodeA, nodeB) < 0;\n      bcUp = HalfEdgeGraphOps.compareNodesYXUp(nodeB, nodeC) < 0;\n      if (abUp) {\n        this.upEdges.push(nodeA);\n        if (!bcUp) {\n          if (HalfEdgeGraphOps.crossProductToTargets(nodeB, nodeA, nodeC) < 0)\n            this.localMax.push(nodeB);\n          else\n            this.topPeaks.push(nodeB);\n        }\n\n      } else { // ab is DOWN\n        this.downEdges.push(nodeA);\n        if (bcUp) {\n          if (HalfEdgeGraphOps.crossProductToTargets(nodeB, nodeA, nodeC) > 0)\n            this.bottomPeaks.push(nodeB);\n          else\n            this.localMin.push(nodeB);\n        }\n      }\n    }\n  }\n\n  private swapArrays() {\n    let save = this.downEdges; this.downEdges = this.upEdges; this.upEdges = save;\n    save = this.localMax; this.localMax = this.localMin; this.localMin = save;\n    save = this.topPeaks; this.topPeaks = this.bottomPeaks; this.bottomPeaks = save;\n  }\n\n  /**\n   * Find the edge (among candidates) which is first struck by a \"rightward\" scan from node\n   * * comparisonFunction determines scan sense\n   *   * HalfEdge.compareNodeYXTheta is an upward scan.\n   *   * HalfEdge.compareNodeYXThetaDownward is a downward scan.\n   * @param node\n   * @param candidates Array of nodes to search\n   * @param nodeComparisonFunction function for lexical comparison.\n   */\n  private findTopVisibleEdge(node: HalfEdge, candidates: HalfEdge[],\n    directionSign: number) {\n    const y0 = node.y;\n    const x0 = node.x;\n    let dx;\n    let distanceRight = Number.MAX_SAFE_INTEGER;\n    let result: HalfEdge | undefined;\n    for (const rightBase of candidates) {\n      const rightTop = rightBase.faceSuccessor;\n      if (rightBase === node || rightTop === node)\n        continue;\n      // for horizontal edge cases -- require edges ends to have strict sign change (no zeros!!)\n      const cRight = HalfEdgeGraphOps.compareNodesYXUp(node, rightBase);\n      const cTop = HalfEdgeGraphOps.compareNodesYXUp(node, rightTop);\n      // GeometryCoreTestIO.consoleLog(node.id, rightBase.id, rightTop.id, cRight, cTop);\n      if (cRight * cTop >= 0)\n        continue;\n      const fraction = HalfEdge.horizontalScanFraction01(rightBase, y0);\n      if (fraction !== undefined) {\n        dx = directionSign * (rightBase.fractionToX(fraction) - x0);\n        if (dx > 0 && dx < distanceRight) {\n          result = rightBase;\n          distanceRight = dx;\n        }\n      }\n    }\n    return result;\n  }\n  /**\n   *\n   * @param downPeak a \"bottom\" node where the interior CCW loop has a local min\n   * @param downEdgeStart (optional) node at the start (heading downwards!) of an edge that brackets downPeak on the left.\n   * @param upEdgeStart  (optional) node at the start (heading up!) of the edge that brackets downPeak on the right.\n   */\n  private highestUpPeakConnection(downPeak: HalfEdge, downEdgeStart: HalfEdge | undefined, upEdgeStart: HalfEdge | undefined): HalfEdge | undefined {\n    let highestPeak;\n\n    for (const upPeak of this.topPeaks) {\n      const y0 = upPeak.y;\n      const x0 = upPeak.x;\n      // is upPeak higher than prior upPeak?\n      if (highestPeak !== undefined && HalfEdgeGraphOps.compareNodesYXUp(upPeak, highestPeak) < 0)\n        continue;\n      // is upPeak BELOW downPeak, ABOVE both limit edges lower node, and between limit edge interiors.\n      if (HalfEdgeGraphOps.compareNodesYXUp(upPeak, downPeak) < 0) {\n        if (downEdgeStart) {\n          const fraction = HalfEdge.horizontalScanFraction01(downEdgeStart, y0);\n          if (fraction === undefined)\n            continue;\n          if (x0 <= downEdgeStart.fractionToX(fraction))\n            continue;\n        }\n        if (upEdgeStart) {\n          const fraction = HalfEdge.horizontalScanFraction01(upEdgeStart, y0);\n          if (fraction === undefined)\n            continue;\n          if (upEdgeStart.fractionToX(fraction) <= x0)\n            continue;\n        }\n        highestPeak = upPeak;\n      }\n    }\n    return highestPeak;\n  }\n\n  private updateMaxNode(maxNode: HalfEdge | undefined, candidate: HalfEdge | undefined, compare: (a: HalfEdge, b: HalfEdge) => number): HalfEdge | undefined {\n    if (!maxNode)\n      return candidate;\n    if (!candidate)\n      return maxNode;\n    // both are defined .. look for positive compare ...\n    if (compare(maxNode, candidate) < 0)\n      return candidate;\n    return maxNode;\n  }\n  private negateXY() {\n    for (const node of this.graph.allHalfEdges) {\n      node.x *= -1;\n      node.y *= -1;\n    }\n  }\n  private downwardConnectionFromBottomPeak(node: HalfEdge): HalfEdge | undefined {\n    let connectTo;\n    const upFunction = (a: HalfEdge, b: HalfEdge) => HalfEdgeGraphOps.compareNodesYXUp(a, b);\n    const upEdgeBase = this.findTopVisibleEdge(node, this.upEdges, 1.0)!;\n    const downEdgeBase = this.findTopVisibleEdge(node, this.downEdges, -1.0)!;\n    connectTo = this.updateMaxNode(connectTo, upEdgeBase, upFunction);\n    if (downEdgeBase)\n      connectTo = this.updateMaxNode(connectTo, downEdgeBase.faceSuccessor, upFunction);\n    const upPeakConnection = this.highestUpPeakConnection(node, downEdgeBase, upEdgeBase);\n    if (upPeakConnection !== undefined)\n      connectTo = this.updateMaxNode(connectTo, upPeakConnection, upFunction);\n    return connectTo;\n  }\n  /** Search around the vertex of nodeA for a nodeA1 such that nodeB is visible in the sector at nodeA1 */\n  private findVisibleSector(nodeA: HalfEdge, nodeB: HalfEdge): HalfEdge | undefined {\n    let nodeA1 = nodeA;\n    do {\n      if (HalfEdge.isNodeVisibleInSector(nodeB, nodeA1))\n        return nodeA1;\n      nodeA1 = nodeA1.vertexSuccessor;\n    } while (nodeA1 !== nodeA);\n    return undefined;\n  }\n  /**\n   * Create an edge from (some node around the vertex of) nodeA to (some node around the vertex of) nodeB.\n   * * looking around the vertex for alternate insertion corrects cusp insertion errors.\n   * @param nodeA\n   * @param nodeB\n   */\n  private joinNodes(nodeA: HalfEdge, nodeB: HalfEdge, direction: number): HalfEdge | undefined {\n    const nodeC = this.graph.createEdgeXYZXYZ(nodeA.x, nodeA.y, nodeA.z, 0, nodeB.x, nodeB.y, nodeB.z, 0);\n    const nodeA1 = this.findVisibleSector(nodeA, nodeB);\n    const nodeB1 = this.findVisibleSector(nodeB, nodeA);\n    if (nodeA1 !== undefined && nodeB1 !== undefined) {\n      HalfEdge.pinch(nodeA1, nodeC);\n      HalfEdge.pinch(nodeB1, nodeC.edgeMate);\n      nodeC.setMaskAroundEdge(HalfEdgeMask.REGULARIZED_EDGE);\n      if (RegularizationContext.announceEdge)\n        RegularizationContext.announceEdge(this.graph, nodeC, nodeC.edgeMate, direction);\n      return nodeC;\n    }\n    return undefined;\n  }\n  /**\n   * Regularize a single face.\n   * * Insert edge from any downward interior vertex to something lower\n   * * Insert an edge from each upward interior vertex to something higher.\n   * * The face is split into smaller faces\n   * * Each final face has at most one \"min\" and one \"max\", and is easy to triangulate with a bottom to top sweep.\n   * * Normal usage is to sweep in both directions, i.e. use the default (true,true) for the upSweep and downSweep parameters.\n   * @param faceSeed any representative half edge on the face\n   * @param upSweep true to do the upward sweep.\n   * @param downSweep true to do the downward sweep.\n   */\n  private runRegularization(upSweep: boolean = true, downSweep: boolean = true) {\n    if (upSweep) {\n      this.bottomPeaks.sort((a, b) => HalfEdgeGraphOps.compareNodesYXUp(a, b));\n      for (const bottomPeak of this.bottomPeaks) {\n        // GeometryCoreTestIO.consoleLog(\"SEARCH\", bottomPeak.id, [bottomPeak.x, bottomPeak.y]);\n        if (!HalfEdgeGraphOps.isDownPeak(bottomPeak))\n          continue;\n        const target = this.downwardConnectionFromBottomPeak(bottomPeak);\n        if (target !== undefined) {\n          // GeometryCoreTestIO.consoleLog(\"join\", bottomPeak.id, [bottomPeak.x, bottomPeak.y], target.id, [target.x, target.y]);\n          this.joinNodes(bottomPeak, target, 1);\n        }\n      }\n    }\n    if (downSweep) {\n      // flip the whole graph (ouch)\n      this.negateXY();\n      // swap the various p and down seeds ....\n      this.swapArrays();\n      this.bottomPeaks.sort((a, b) => HalfEdgeGraphOps.compareNodesYXUp(a, b));\n      for (const bottomPeak of this.bottomPeaks) {\n        if (!HalfEdgeGraphOps.isDownPeak(bottomPeak))\n          continue;\n        const target = this.downwardConnectionFromBottomPeak(bottomPeak);\n        if (target !== undefined) {\n          this.joinNodes(bottomPeak, target, -1);\n        }\n      }\n      this.negateXY();\n      this.swapArrays();\n    }\n  }\n\n  /**\n   * Regularize a single face.\n   * * Insert edge from any downward interior vertex to something lower\n   * * Insert an edge from each upward interior vertex to something higher.\n   * * The face is split into smaller faces\n   * * Each final face has at most one \"min\" and one \"max\", and is easy to triangulate with a bottom to top sweep.\n   * * Normal usage is to sweep in both directions, i.e. use the default (true,true) for the upSweep and downSweep parameters.\n   * @param faceSeed any representative half edge on the face\n   * @param upSweep true to do the upward sweep.\n   * @param downSweep true to do the downward sweep.\n   */\n  public regularizeFace(faceSeed: HalfEdge, upSweep: boolean = true, downSweep: boolean = true) {\n    this.collectVerticalEventsAroundFace(faceSeed);\n    this.runRegularization(upSweep, downSweep);\n  }\n\n  public regularizeGraph(upSweep: boolean = true, downSweep: boolean = true) {\n    this.collectVerticalEventFromEdgesInAndArray(this.graph.allHalfEdges);\n    this.runRegularization(upSweep, downSweep);\n  }\n\n  /** test if a single face is monotone;  if so, return its (single) min */\n  public static isMonotoneFace(seed: HalfEdge): HalfEdge | undefined {\n    let numMin = 0;\n    let numMax = 0;\n    let nodeMin: HalfEdge | undefined;\n    let nodeA = seed;\n    do {\n      const nodeB = nodeA.faceSuccessor;\n      const nodeC = nodeB.faceSuccessor;\n      const ab = HalfEdgeGraphOps.compareNodesYXUp(nodeA, nodeB);\n      const bc = HalfEdgeGraphOps.compareNodesYXUp(nodeB, nodeC);\n      if (ab * bc <= 0) {\n        if (ab > 0) {\n          numMin++;\n          nodeMin = nodeB;\n        }\n        if (bc > 0) {\n          numMax++;\n        }\n      }\n    } while ((nodeA = nodeA.faceSuccessor) !== seed);\n    return numMin === 1 && numMax === 1 ? nodeMin : undefined;\n  }\n  /** Return faces filtered by area and test function.\n   * * find one arbitrary representative of each face\n   * * offer the candidate to the mutate function.\n   * * collect results\n   * @param mappedSeeds when filter returns a HalfEdge, collect it here\n   * @param unmappedSeeds when filter does not return a half edge, collect the candidate.\n   */\n  public static collectMappedFaceRepresentatives(\n    graph: HalfEdgeGraph,\n    positiveAreaOnly: boolean,\n    mutate: (seed: HalfEdge) => HalfEdge | undefined,\n    mappedEdges: HalfEdge[] | undefined,\n    unMappedSeeds: HalfEdge[] | undefined) {\n    if (mappedEdges)\n      mappedEdges.length = 0;\n    if (unMappedSeeds)\n      unMappedSeeds.length = 0;\n    const mask = HalfEdgeMask.VISITED;\n    graph.clearMask(mask);\n    for (const seed of graph.allHalfEdges) {\n      if (!seed.getMask(mask)) {\n        seed.setMaskAroundFace(mask);\n        if (!positiveAreaOnly || seed.signedFaceArea() > 0) {\n          const edge = mutate(seed);\n          if (edge) {\n            if (mappedEdges)\n              mappedEdges.push(edge);\n          } else {\n            if (unMappedSeeds)\n              unMappedSeeds.push(seed);\n          }\n        }\n      }\n    }\n  }\n\n}\n"]}
+{"version":3,"file":"RegularizeFace.js","sourceRoot":"","sources":["../../../src/topology/RegularizeFace.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AAEH,mCAAgE;AAChE,uCAA6C;AAE7C;;;GAGG;AACH,MAAa,qBAAqB;IAChC,mDAAmD;IACnD,yDAAyD;IACzD,0CAA0C;IAC1C,8EAA8E;IAC9E,0DAA0D;IACnD,MAAM,CAAC,YAAY,CAAmF;IAC7G,YAAmB,KAAoB;QACrC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;QAClB,IAAI,CAAC,SAAS,GAAG,EAAE,CAAC;QACpB,IAAI,CAAC,WAAW,GAAG,EAAE,CAAC;QACtB,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAC;QACnB,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAC;QACnB,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAC;IACrB,CAAC;IAED;;OAEG;IACI,KAAK,CAAgB;IAC5B,6GAA6G;IACtG,OAAO,CAAa;IAC3B,8GAA8G;IACvG,SAAS,CAAa;IAC7B,2FAA2F;IACpF,QAAQ,CAAa;IAC5B,6FAA6F;IACtF,WAAW,CAAa;IAE/B,kGAAkG;IAC3F,QAAQ,CAAa;IAC5B,oGAAoG;IAC7F,QAAQ,CAAa;IAC5B;;;;OAIG;IACI,+BAA+B,CAAC,QAAkB;QACvD,IAAI,KAAK,GAAG,QAAQ,CAAC;QACrB,IAAI,KAAK,CAAC;QACV,IAAI,KAAK,CAAC;QACV,IAAI,IAAI,CAAC;QACT,IAAI,IAAI,CAAC;QACT,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;QACxB,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;QAC1B,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;QACzB,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;QAC5B,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;QACzB,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;QACzB,GAAG,CAAC;YACF,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;YAC5B,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;YAC5B,IAAI,GAAG,0BAAgB,CAAC,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;YAC3D,IAAI,GAAG,0BAAgB,CAAC,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;YAC3D,IAAI,IAAI,EAAE,CAAC;gBACT,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACzB,IAAI,CAAC,IAAI,EAAE,CAAC;oBACV,IAAI,0BAAgB,CAAC,qBAAqB,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC;wBACjE,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;;wBAE1B,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBAC9B,CAAC;YAEH,CAAC;iBAAM,CAAC,CAAC,aAAa;gBACpB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBAC3B,IAAI,IAAI,EAAE,CAAC;oBACT,IAAI,0BAAgB,CAAC,qBAAqB,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC;wBACjE,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;;wBAE7B,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBAC9B,CAAC;YACH,CAAC;YACD,KAAK,GAAG,KAAK,CAAC;QAChB,CAAC,QAAQ,KAAK,KAAK,QAAQ,EAAE;IAC/B,CAAC;IAED;;;;OAIG;IACI,uCAAuC,CAAC,cAA0B;QACvE,IAAI,KAAK,CAAC;QACV,IAAI,KAAK,CAAC;QACV,IAAI,KAAK,CAAC;QACV,IAAI,IAAI,CAAC;QACT,IAAI,IAAI,CAAC;QACT,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;QACxB,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;QAC1B,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;QACzB,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;QAC5B,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;QACzB,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;QACzB,KAAK,KAAK,IAAI,cAAc,EAAE,CAAC;YAC7B,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;YAC5B,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;YAC5B,IAAI,GAAG,0BAAgB,CAAC,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;YAC3D,IAAI,GAAG,0BAAgB,CAAC,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC;YAC3D,IAAI,IAAI,EAAE,CAAC;gBACT,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACzB,IAAI,CAAC,IAAI,EAAE,CAAC;oBACV,IAAI,0BAAgB,CAAC,qBAAqB,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC;wBACjE,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;;wBAE1B,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBAC9B,CAAC;YAEH,CAAC;iBAAM,CAAC,CAAC,aAAa;gBACpB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBAC3B,IAAI,IAAI,EAAE,CAAC;oBACT,IAAI,0BAAgB,CAAC,qBAAqB,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC;wBACjE,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;;wBAE7B,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBAC9B,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAEO,UAAU;QAChB,IAAI,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC;QAAC,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,OAAO,CAAC;QAAC,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC;QAC9E,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC;QAAC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC;QAAC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;QAC1E,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC;QAAC,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC;QAAC,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;IAClF,CAAC;IAED;;;;;;;;OAQG;IACK,kBAAkB,CAAC,IAAc,EAAE,UAAsB,EAC/D,aAAqB;QACrB,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC;QAClB,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC;QAClB,IAAI,EAAE,CAAC;QACP,IAAI,aAAa,GAAG,MAAM,CAAC,gBAAgB,CAAC;QAC5C,IAAI,MAA4B,CAAC;QACjC,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;YACnC,MAAM,QAAQ,GAAG,SAAS,CAAC,aAAa,CAAC;YACzC,IAAI,SAAS,KAAK,IAAI,IAAI,QAAQ,KAAK,IAAI;gBACzC,SAAS;YACX,0FAA0F;YAC1F,MAAM,MAAM,GAAG,0BAAgB,CAAC,gBAAgB,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;YAClE,MAAM,IAAI,GAAG,0BAAgB,CAAC,gBAAgB,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;YAC/D,mFAAmF;YACnF,IAAI,MAAM,GAAG,IAAI,IAAI,CAAC;gBACpB,SAAS;YACX,MAAM,QAAQ,GAAG,gBAAQ,CAAC,wBAAwB,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC;YAClE,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;gBAC3B,EAAE,GAAG,aAAa,GAAG,CAAC,SAAS,CAAC,WAAW,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC,CAAC;gBAC5D,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,aAAa,EAAE,CAAC;oBACjC,MAAM,GAAG,SAAS,CAAC;oBACnB,aAAa,GAAG,EAAE,CAAC;gBACrB,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD;;;;;OAKG;IACK,uBAAuB,CAAC,QAAkB,EAAE,aAAmC,EAAE,WAAiC;QACxH,IAAI,WAAW,CAAC;QAEhB,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YACnC,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC;YACpB,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC;YACpB,sCAAsC;YACtC,IAAI,WAAW,KAAK,SAAS,IAAI,0BAAgB,CAAC,gBAAgB,CAAC,MAAM,EAAE,WAAW,CAAC,GAAG,CAAC;gBACzF,SAAS;YACX,iGAAiG;YACjG,IAAI,0BAAgB,CAAC,gBAAgB,CAAC,MAAM,EAAE,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC5D,IAAI,aAAa,EAAE,CAAC;oBAClB,MAAM,QAAQ,GAAG,gBAAQ,CAAC,wBAAwB,CAAC,aAAa,EAAE,EAAE,CAAC,CAAC;oBACtE,IAAI,QAAQ,KAAK,SAAS;wBACxB,SAAS;oBACX,IAAI,EAAE,IAAI,aAAa,CAAC,WAAW,CAAC,QAAQ,CAAC;wBAC3C,SAAS;gBACb,CAAC;gBACD,IAAI,WAAW,EAAE,CAAC;oBAChB,MAAM,QAAQ,GAAG,gBAAQ,CAAC,wBAAwB,CAAC,WAAW,EAAE,EAAE,CAAC,CAAC;oBACpE,IAAI,QAAQ,KAAK,SAAS;wBACxB,SAAS;oBACX,IAAI,WAAW,CAAC,WAAW,CAAC,QAAQ,CAAC,IAAI,EAAE;wBACzC,SAAS;gBACb,CAAC;gBACD,WAAW,GAAG,MAAM,CAAC;YACvB,CAAC;QACH,CAAC;QACD,OAAO,WAAW,CAAC;IACrB,CAAC;IAEO,aAAa,CAAC,OAA6B,EAAE,SAA+B,EAAE,OAA6C;QACjI,IAAI,CAAC,OAAO;YACV,OAAO,SAAS,CAAC;QACnB,IAAI,CAAC,SAAS;YACZ,OAAO,OAAO,CAAC;QACjB,oDAAoD;QACpD,IAAI,OAAO,CAAC,OAAO,EAAE,SAAS,CAAC,GAAG,CAAC;YACjC,OAAO,SAAS,CAAC;QACnB,OAAO,OAAO,CAAC;IACjB,CAAC;IACO,QAAQ;QACd,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,YAAY,EAAE,CAAC;YAC3C,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;YACb,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QACf,CAAC;IACH,CAAC;IACO,gCAAgC,CAAC,IAAc;QACrD,IAAI,SAAS,CAAC;QACd,MAAM,UAAU,GAAG,CAAC,CAAW,EAAE,CAAW,EAAE,EAAE,CAAC,0BAAgB,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACzF,MAAM,UAAU,GAAG,IAAI,CAAC,kBAAkB,CAAC,IAAI,EAAE,IAAI,CAAC,OAAO,EAAE,GAAG,CAAE,CAAC;QACrE,MAAM,YAAY,GAAG,IAAI,CAAC,kBAAkB,CAAC,IAAI,EAAE,IAAI,CAAC,SAAS,EAAE,CAAC,GAAG,CAAE,CAAC;QAC1E,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC,SAAS,EAAE,UAAU,EAAE,UAAU,CAAC,CAAC;QAClE,IAAI,YAAY;YACd,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC,SAAS,EAAE,YAAY,CAAC,aAAa,EAAE,UAAU,CAAC,CAAC;QACpF,MAAM,gBAAgB,GAAG,IAAI,CAAC,uBAAuB,CAAC,IAAI,EAAE,YAAY,EAAE,UAAU,CAAC,CAAC;QACtF,IAAI,gBAAgB,KAAK,SAAS;YAChC,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC,SAAS,EAAE,gBAAgB,EAAE,UAAU,CAAC,CAAC;QAC1E,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,wGAAwG;IAChG,iBAAiB,CAAC,KAAe,EAAE,KAAe;QACxD,IAAI,MAAM,GAAG,KAAK,CAAC;QACnB,GAAG,CAAC;YACF,IAAI,gBAAQ,CAAC,qBAAqB,CAAC,KAAK,EAAE,MAAM,CAAC;gBAC/C,OAAO,MAAM,CAAC;YAChB,MAAM,GAAG,MAAM,CAAC,eAAe,CAAC;QAClC,CAAC,QAAQ,MAAM,KAAK,KAAK,EAAE;QAC3B,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;OAKG;IACK,SAAS,CAAC,KAAe,EAAE,KAAe,EAAE,SAAiB;QACnE,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACtG,MAAM,MAAM,GAAG,IAAI,CAAC,iBAAiB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QACpD,MAAM,MAAM,GAAG,IAAI,CAAC,iBAAiB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QACpD,IAAI,MAAM,KAAK,SAAS,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACjD,gBAAQ,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;YAC9B,gBAAQ,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,QAAQ,CAAC,CAAC;YACvC,KAAK,CAAC,iBAAiB,CAAC,oBAAY,CAAC,gBAAgB,CAAC,CAAC;YACvD,IAAI,qBAAqB,CAAC,YAAY;gBACpC,qBAAqB,CAAC,YAAY,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;YACnF,OAAO,KAAK,CAAC;QACf,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD;;;;;;;;;;OAUG;IACK,iBAAiB,CAAC,UAAmB,IAAI,EAAE,YAAqB,IAAI;QAC1E,IAAI,OAAO,EAAE,CAAC;YACZ,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,0BAAgB,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACzE,KAAK,MAAM,UAAU,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;gBAC1C,wFAAwF;gBACxF,IAAI,CAAC,0BAAgB,CAAC,UAAU,CAAC,UAAU,CAAC;oBAC1C,SAAS;gBACX,MAAM,MAAM,GAAG,IAAI,CAAC,gCAAgC,CAAC,UAAU,CAAC,CAAC;gBACjE,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;oBACzB,uHAAuH;oBACvH,IAAI,CAAC,SAAS,CAAC,UAAU,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC;gBACxC,CAAC;YACH,CAAC;QACH,CAAC;QACD,IAAI,SAAS,EAAE,CAAC;YACd,8BAA8B;YAC9B,IAAI,CAAC,QAAQ,EAAE,CAAC;YAChB,yCAAyC;YACzC,IAAI,CAAC,UAAU,EAAE,CAAC;YAClB,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,0BAAgB,CAAC,gBAAgB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;YACzE,KAAK,MAAM,UAAU,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;gBAC1C,IAAI,CAAC,0BAAgB,CAAC,UAAU,CAAC,UAAU,CAAC;oBAC1C,SAAS;gBACX,MAAM,MAAM,GAAG,IAAI,CAAC,gCAAgC,CAAC,UAAU,CAAC,CAAC;gBACjE,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;oBACzB,IAAI,CAAC,SAAS,CAAC,UAAU,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC;gBACzC,CAAC;YACH,CAAC;YACD,IAAI,CAAC,QAAQ,EAAE,CAAC;YAChB,IAAI,CAAC,UAAU,EAAE,CAAC;QACpB,CAAC;IACH,CAAC;IAED;;;;;;;;;;OAUG;IACI,cAAc,CAAC,QAAkB,EAAE,UAAmB,IAAI,EAAE,YAAqB,IAAI;QAC1F,IAAI,CAAC,+BAA+B,CAAC,QAAQ,CAAC,CAAC;QAC/C,IAAI,CAAC,iBAAiB,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;IAC7C,CAAC;IAEM,eAAe,CAAC,UAAmB,IAAI,EAAE,YAAqB,IAAI;QACvE,IAAI,CAAC,uCAAuC,CAAC,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;QACtE,IAAI,CAAC,iBAAiB,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;IAC7C,CAAC;IAED,yEAAyE;IAClE,MAAM,CAAC,cAAc,CAAC,IAAc;QACzC,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,IAAI,OAA6B,CAAC;QAClC,IAAI,KAAK,GAAG,IAAI,CAAC;QACjB,GAAG,CAAC;YACF,MAAM,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;YAClC,MAAM,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC;YAClC,MAAM,EAAE,GAAG,0BAAgB,CAAC,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;YAC3D,MAAM,EAAE,GAAG,0BAAgB,CAAC,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;YAC3D,IAAI,EAAE,GAAG,EAAE,IAAI,CAAC,EAAE,CAAC;gBACjB,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC;oBACX,MAAM,EAAE,CAAC;oBACT,OAAO,GAAG,KAAK,CAAC;gBAClB,CAAC;gBACD,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC;oBACX,MAAM,EAAE,CAAC;gBACX,CAAC;YACH,CAAC;QACH,CAAC,QAAQ,CAAC,KAAK,GAAG,KAAK,CAAC,aAAa,CAAC,KAAK,IAAI,EAAE;QACjD,OAAO,MAAM,KAAK,CAAC,IAAI,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC;IAC5D,CAAC;IACD;;;;;;OAMG;IACI,MAAM,CAAC,gCAAgC,CAC5C,KAAoB,EACpB,gBAAyB,EACzB,MAAgD,EAChD,WAAmC,EACnC,aAAqC;QACrC,IAAI,WAAW;YACb,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC;QACzB,IAAI,aAAa;YACf,aAAa,CAAC,MAAM,GAAG,CAAC,CAAC;QAC3B,MAAM,IAAI,GAAG,oBAAY,CAAC,OAAO,CAAC;QAClC,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;QACtB,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,YAAY,EAAE,CAAC;YACtC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;gBACxB,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;gBAC7B,IAAI,CAAC,gBAAgB,IAAI,IAAI,CAAC,cAAc,EAAE,GAAG,CAAC,EAAE,CAAC;oBACnD,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;oBAC1B,IAAI,IAAI,EAAE,CAAC;wBACT,IAAI,WAAW;4BACb,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBAC3B,CAAC;yBAAM,CAAC;wBACN,IAAI,aAAa;4BACf,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBAC7B,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;CAEF;AAhYD,sDAgYC","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 Topology\r\n */\r\n\r\nimport { HalfEdge, HalfEdgeGraph, HalfEdgeMask } from \"./Graph\";\r\nimport { HalfEdgeGraphOps } from \"./Merging\";\r\n\r\n/**\r\n * * Context for regularizing single faces.\r\n * @internal\r\n */\r\nexport class RegularizationContext {\r\n  // For debugging use ... \"almost always\" undefined.\r\n  // If defined, it is called with each inserted node pair.\r\n  // scale will be either plus or minus one.\r\n  // when it is negative, the node coordinates (both x and y) have been negated.\r\n  // The call is made after full insertion into vertex loop.\r\n  public static announceEdge?: (graph: HalfEdgeGraph, nodeA: HalfEdge, nodeB: HalfEdge, scale: number) => void;\r\n  public constructor(graph: HalfEdgeGraph) {\r\n    this.graph = graph;\r\n    this.upEdges = [];\r\n    this.downEdges = [];\r\n    this.bottomPeaks = [];\r\n    this.topPeaks = [];\r\n    this.localMin = [];\r\n    this.localMax = [];\r\n  }\r\n\r\n  /**\r\n   * These are public only for testing.\r\n   */\r\n  public graph: HalfEdgeGraph;\r\n  /** array of edges directed upward.  Turn can be left or right, but is not large enough to be a min or max */\r\n  public upEdges: HalfEdge[];\r\n  /** array of edges directed downward, Turn can be left or right, but is not large enough to be a min or max */\r\n  public downEdges: HalfEdge[];\r\n  /** Array of edges whose start is an upward peak (right turn, inbound up, outbound down) */\r\n  public topPeaks: HalfEdge[];\r\n  /** Array of edges whose start is an downward peak (right turn, inbound down, outbound up) */\r\n  public bottomPeaks: HalfEdge[];\r\n\r\n  /** Array of edges at local minima (left turn, inbound down, outbound up).  Ensuing chain is up */\r\n  public localMin: HalfEdge[];\r\n  /** Array of edges at local maxima (left turn, inbound up, outbound down).  Ensuing chain is down */\r\n  public localMax: HalfEdge[];\r\n  /**\r\n   * Collect (and classify) all the edges around a single face.\r\n   * * The various arrays are collected: upEdges, downEdges, topPeaks, bottomPeaks, upChains, downChains\r\n   * @param faceSeed face to examine\r\n   */\r\n  public collectVerticalEventsAroundFace(faceSeed: HalfEdge) {\r\n    let nodeA = faceSeed;\r\n    let nodeB;\r\n    let nodeC;\r\n    let abUp;\r\n    let bcUp;\r\n    this.upEdges.length = 0;\r\n    this.downEdges.length = 0;\r\n    this.topPeaks.length = 0;\r\n    this.bottomPeaks.length = 0;\r\n    this.localMin.length = 0;\r\n    this.localMax.length = 0;\r\n    do {\r\n      nodeB = nodeA.faceSuccessor;\r\n      nodeC = nodeB.faceSuccessor;\r\n      abUp = HalfEdgeGraphOps.compareNodesYXUp(nodeA, nodeB) < 0;\r\n      bcUp = HalfEdgeGraphOps.compareNodesYXUp(nodeB, nodeC) < 0;\r\n      if (abUp) {\r\n        this.upEdges.push(nodeA);\r\n        if (!bcUp) {\r\n          if (HalfEdgeGraphOps.crossProductToTargets(nodeB, nodeA, nodeC) < 0)\r\n            this.localMax.push(nodeB);\r\n          else\r\n            this.topPeaks.push(nodeB);\r\n        }\r\n\r\n      } else { // ab is DOWN\r\n        this.downEdges.push(nodeA);\r\n        if (bcUp) {\r\n          if (HalfEdgeGraphOps.crossProductToTargets(nodeB, nodeA, nodeC) > 0)\r\n            this.bottomPeaks.push(nodeB);\r\n          else\r\n            this.localMin.push(nodeB);\r\n        }\r\n      }\r\n      nodeA = nodeB;\r\n    } while (nodeA !== faceSeed);\r\n  }\r\n\r\n  /**\r\n   * Collect (and classify) all the edges in an array.\r\n   * * The various arrays are collected: upEdges, downEdges, topPeaks, bottomPeaks, upChains, downChains\r\n   * @param candidateEdges array of edges.\r\n   */\r\n  public collectVerticalEventFromEdgesInAndArray(candidateEdges: HalfEdge[]) {\r\n    let nodeA;\r\n    let nodeB;\r\n    let nodeC;\r\n    let abUp;\r\n    let bcUp;\r\n    this.upEdges.length = 0;\r\n    this.downEdges.length = 0;\r\n    this.topPeaks.length = 0;\r\n    this.bottomPeaks.length = 0;\r\n    this.localMin.length = 0;\r\n    this.localMax.length = 0;\r\n    for (nodeA of candidateEdges) {\r\n      nodeB = nodeA.faceSuccessor;\r\n      nodeC = nodeB.faceSuccessor;\r\n      abUp = HalfEdgeGraphOps.compareNodesYXUp(nodeA, nodeB) < 0;\r\n      bcUp = HalfEdgeGraphOps.compareNodesYXUp(nodeB, nodeC) < 0;\r\n      if (abUp) {\r\n        this.upEdges.push(nodeA);\r\n        if (!bcUp) {\r\n          if (HalfEdgeGraphOps.crossProductToTargets(nodeB, nodeA, nodeC) < 0)\r\n            this.localMax.push(nodeB);\r\n          else\r\n            this.topPeaks.push(nodeB);\r\n        }\r\n\r\n      } else { // ab is DOWN\r\n        this.downEdges.push(nodeA);\r\n        if (bcUp) {\r\n          if (HalfEdgeGraphOps.crossProductToTargets(nodeB, nodeA, nodeC) > 0)\r\n            this.bottomPeaks.push(nodeB);\r\n          else\r\n            this.localMin.push(nodeB);\r\n        }\r\n      }\r\n    }\r\n  }\r\n\r\n  private swapArrays() {\r\n    let save = this.downEdges; this.downEdges = this.upEdges; this.upEdges = save;\r\n    save = this.localMax; this.localMax = this.localMin; this.localMin = save;\r\n    save = this.topPeaks; this.topPeaks = this.bottomPeaks; this.bottomPeaks = save;\r\n  }\r\n\r\n  /**\r\n   * Find the edge (among candidates) which is first struck by a \"rightward\" scan from node\r\n   * * comparisonFunction determines scan sense\r\n   *   * HalfEdge.compareNodeYXTheta is an upward scan.\r\n   *   * HalfEdge.compareNodeYXThetaDownward is a downward scan.\r\n   * @param node\r\n   * @param candidates Array of nodes to search\r\n   * @param nodeComparisonFunction function for lexical comparison.\r\n   */\r\n  private findTopVisibleEdge(node: HalfEdge, candidates: HalfEdge[],\r\n    directionSign: number) {\r\n    const y0 = node.y;\r\n    const x0 = node.x;\r\n    let dx;\r\n    let distanceRight = Number.MAX_SAFE_INTEGER;\r\n    let result: HalfEdge | undefined;\r\n    for (const rightBase of candidates) {\r\n      const rightTop = rightBase.faceSuccessor;\r\n      if (rightBase === node || rightTop === node)\r\n        continue;\r\n      // for horizontal edge cases -- require edges ends to have strict sign change (no zeros!!)\r\n      const cRight = HalfEdgeGraphOps.compareNodesYXUp(node, rightBase);\r\n      const cTop = HalfEdgeGraphOps.compareNodesYXUp(node, rightTop);\r\n      // GeometryCoreTestIO.consoleLog(node.id, rightBase.id, rightTop.id, cRight, cTop);\r\n      if (cRight * cTop >= 0)\r\n        continue;\r\n      const fraction = HalfEdge.horizontalScanFraction01(rightBase, y0);\r\n      if (fraction !== undefined) {\r\n        dx = directionSign * (rightBase.fractionToX(fraction) - x0);\r\n        if (dx > 0 && dx < distanceRight) {\r\n          result = rightBase;\r\n          distanceRight = dx;\r\n        }\r\n      }\r\n    }\r\n    return result;\r\n  }\r\n  /**\r\n   *\r\n   * @param downPeak a \"bottom\" node where the interior CCW loop has a local min\r\n   * @param downEdgeStart (optional) node at the start (heading downwards!) of an edge that brackets downPeak on the left.\r\n   * @param upEdgeStart  (optional) node at the start (heading up!) of the edge that brackets downPeak on the right.\r\n   */\r\n  private highestUpPeakConnection(downPeak: HalfEdge, downEdgeStart: HalfEdge | undefined, upEdgeStart: HalfEdge | undefined): HalfEdge | undefined {\r\n    let highestPeak;\r\n\r\n    for (const upPeak of this.topPeaks) {\r\n      const y0 = upPeak.y;\r\n      const x0 = upPeak.x;\r\n      // is upPeak higher than prior upPeak?\r\n      if (highestPeak !== undefined && HalfEdgeGraphOps.compareNodesYXUp(upPeak, highestPeak) < 0)\r\n        continue;\r\n      // is upPeak BELOW downPeak, ABOVE both limit edges lower node, and between limit edge interiors.\r\n      if (HalfEdgeGraphOps.compareNodesYXUp(upPeak, downPeak) < 0) {\r\n        if (downEdgeStart) {\r\n          const fraction = HalfEdge.horizontalScanFraction01(downEdgeStart, y0);\r\n          if (fraction === undefined)\r\n            continue;\r\n          if (x0 <= downEdgeStart.fractionToX(fraction))\r\n            continue;\r\n        }\r\n        if (upEdgeStart) {\r\n          const fraction = HalfEdge.horizontalScanFraction01(upEdgeStart, y0);\r\n          if (fraction === undefined)\r\n            continue;\r\n          if (upEdgeStart.fractionToX(fraction) <= x0)\r\n            continue;\r\n        }\r\n        highestPeak = upPeak;\r\n      }\r\n    }\r\n    return highestPeak;\r\n  }\r\n\r\n  private updateMaxNode(maxNode: HalfEdge | undefined, candidate: HalfEdge | undefined, compare: (a: HalfEdge, b: HalfEdge) => number): HalfEdge | undefined {\r\n    if (!maxNode)\r\n      return candidate;\r\n    if (!candidate)\r\n      return maxNode;\r\n    // both are defined .. look for positive compare ...\r\n    if (compare(maxNode, candidate) < 0)\r\n      return candidate;\r\n    return maxNode;\r\n  }\r\n  private negateXY() {\r\n    for (const node of this.graph.allHalfEdges) {\r\n      node.x *= -1;\r\n      node.y *= -1;\r\n    }\r\n  }\r\n  private downwardConnectionFromBottomPeak(node: HalfEdge): HalfEdge | undefined {\r\n    let connectTo;\r\n    const upFunction = (a: HalfEdge, b: HalfEdge) => HalfEdgeGraphOps.compareNodesYXUp(a, b);\r\n    const upEdgeBase = this.findTopVisibleEdge(node, this.upEdges, 1.0)!;\r\n    const downEdgeBase = this.findTopVisibleEdge(node, this.downEdges, -1.0)!;\r\n    connectTo = this.updateMaxNode(connectTo, upEdgeBase, upFunction);\r\n    if (downEdgeBase)\r\n      connectTo = this.updateMaxNode(connectTo, downEdgeBase.faceSuccessor, upFunction);\r\n    const upPeakConnection = this.highestUpPeakConnection(node, downEdgeBase, upEdgeBase);\r\n    if (upPeakConnection !== undefined)\r\n      connectTo = this.updateMaxNode(connectTo, upPeakConnection, upFunction);\r\n    return connectTo;\r\n  }\r\n  /** Search around the vertex of nodeA for a nodeA1 such that nodeB is visible in the sector at nodeA1 */\r\n  private findVisibleSector(nodeA: HalfEdge, nodeB: HalfEdge): HalfEdge | undefined {\r\n    let nodeA1 = nodeA;\r\n    do {\r\n      if (HalfEdge.isNodeVisibleInSector(nodeB, nodeA1))\r\n        return nodeA1;\r\n      nodeA1 = nodeA1.vertexSuccessor;\r\n    } while (nodeA1 !== nodeA);\r\n    return undefined;\r\n  }\r\n  /**\r\n   * Create an edge from (some node around the vertex of) nodeA to (some node around the vertex of) nodeB.\r\n   * * looking around the vertex for alternate insertion corrects cusp insertion errors.\r\n   * @param nodeA\r\n   * @param nodeB\r\n   */\r\n  private joinNodes(nodeA: HalfEdge, nodeB: HalfEdge, direction: number): HalfEdge | undefined {\r\n    const nodeC = this.graph.createEdgeXYZXYZ(nodeA.x, nodeA.y, nodeA.z, 0, nodeB.x, nodeB.y, nodeB.z, 0);\r\n    const nodeA1 = this.findVisibleSector(nodeA, nodeB);\r\n    const nodeB1 = this.findVisibleSector(nodeB, nodeA);\r\n    if (nodeA1 !== undefined && nodeB1 !== undefined) {\r\n      HalfEdge.pinch(nodeA1, nodeC);\r\n      HalfEdge.pinch(nodeB1, nodeC.edgeMate);\r\n      nodeC.setMaskAroundEdge(HalfEdgeMask.REGULARIZED_EDGE);\r\n      if (RegularizationContext.announceEdge)\r\n        RegularizationContext.announceEdge(this.graph, nodeC, nodeC.edgeMate, direction);\r\n      return nodeC;\r\n    }\r\n    return undefined;\r\n  }\r\n  /**\r\n   * Regularize a single face.\r\n   * * Insert edge from any downward interior vertex to something lower\r\n   * * Insert an edge from each upward interior vertex to something higher.\r\n   * * The face is split into smaller faces\r\n   * * Each final face has at most one \"min\" and one \"max\", and is easy to triangulate with a bottom to top sweep.\r\n   * * Normal usage is to sweep in both directions, i.e. use the default (true,true) for the upSweep and downSweep parameters.\r\n   * @param faceSeed any representative half edge on the face\r\n   * @param upSweep true to do the upward sweep.\r\n   * @param downSweep true to do the downward sweep.\r\n   */\r\n  private runRegularization(upSweep: boolean = true, downSweep: boolean = true) {\r\n    if (upSweep) {\r\n      this.bottomPeaks.sort((a, b) => HalfEdgeGraphOps.compareNodesYXUp(a, b));\r\n      for (const bottomPeak of this.bottomPeaks) {\r\n        // GeometryCoreTestIO.consoleLog(\"SEARCH\", bottomPeak.id, [bottomPeak.x, bottomPeak.y]);\r\n        if (!HalfEdgeGraphOps.isDownPeak(bottomPeak))\r\n          continue;\r\n        const target = this.downwardConnectionFromBottomPeak(bottomPeak);\r\n        if (target !== undefined) {\r\n          // GeometryCoreTestIO.consoleLog(\"join\", bottomPeak.id, [bottomPeak.x, bottomPeak.y], target.id, [target.x, target.y]);\r\n          this.joinNodes(bottomPeak, target, 1);\r\n        }\r\n      }\r\n    }\r\n    if (downSweep) {\r\n      // flip the whole graph (ouch)\r\n      this.negateXY();\r\n      // swap the various p and down seeds ....\r\n      this.swapArrays();\r\n      this.bottomPeaks.sort((a, b) => HalfEdgeGraphOps.compareNodesYXUp(a, b));\r\n      for (const bottomPeak of this.bottomPeaks) {\r\n        if (!HalfEdgeGraphOps.isDownPeak(bottomPeak))\r\n          continue;\r\n        const target = this.downwardConnectionFromBottomPeak(bottomPeak);\r\n        if (target !== undefined) {\r\n          this.joinNodes(bottomPeak, target, -1);\r\n        }\r\n      }\r\n      this.negateXY();\r\n      this.swapArrays();\r\n    }\r\n  }\r\n\r\n  /**\r\n   * Regularize a single face.\r\n   * * Insert edge from any downward interior vertex to something lower\r\n   * * Insert an edge from each upward interior vertex to something higher.\r\n   * * The face is split into smaller faces\r\n   * * Each final face has at most one \"min\" and one \"max\", and is easy to triangulate with a bottom to top sweep.\r\n   * * Normal usage is to sweep in both directions, i.e. use the default (true,true) for the upSweep and downSweep parameters.\r\n   * @param faceSeed any representative half edge on the face\r\n   * @param upSweep true to do the upward sweep.\r\n   * @param downSweep true to do the downward sweep.\r\n   */\r\n  public regularizeFace(faceSeed: HalfEdge, upSweep: boolean = true, downSweep: boolean = true) {\r\n    this.collectVerticalEventsAroundFace(faceSeed);\r\n    this.runRegularization(upSweep, downSweep);\r\n  }\r\n\r\n  public regularizeGraph(upSweep: boolean = true, downSweep: boolean = true) {\r\n    this.collectVerticalEventFromEdgesInAndArray(this.graph.allHalfEdges);\r\n    this.runRegularization(upSweep, downSweep);\r\n  }\r\n\r\n  /** test if a single face is monotone;  if so, return its (single) min */\r\n  public static isMonotoneFace(seed: HalfEdge): HalfEdge | undefined {\r\n    let numMin = 0;\r\n    let numMax = 0;\r\n    let nodeMin: HalfEdge | undefined;\r\n    let nodeA = seed;\r\n    do {\r\n      const nodeB = nodeA.faceSuccessor;\r\n      const nodeC = nodeB.faceSuccessor;\r\n      const ab = HalfEdgeGraphOps.compareNodesYXUp(nodeA, nodeB);\r\n      const bc = HalfEdgeGraphOps.compareNodesYXUp(nodeB, nodeC);\r\n      if (ab * bc <= 0) {\r\n        if (ab > 0) {\r\n          numMin++;\r\n          nodeMin = nodeB;\r\n        }\r\n        if (bc > 0) {\r\n          numMax++;\r\n        }\r\n      }\r\n    } while ((nodeA = nodeA.faceSuccessor) !== seed);\r\n    return numMin === 1 && numMax === 1 ? nodeMin : undefined;\r\n  }\r\n  /** Return faces filtered by area and test function.\r\n   * * find one arbitrary representative of each face\r\n   * * offer the candidate to the mutate function.\r\n   * * collect results\r\n   * @param mappedSeeds when filter returns a HalfEdge, collect it here\r\n   * @param unmappedSeeds when filter does not return a half edge, collect the candidate.\r\n   */\r\n  public static collectMappedFaceRepresentatives(\r\n    graph: HalfEdgeGraph,\r\n    positiveAreaOnly: boolean,\r\n    mutate: (seed: HalfEdge) => HalfEdge | undefined,\r\n    mappedEdges: HalfEdge[] | undefined,\r\n    unMappedSeeds: HalfEdge[] | undefined) {\r\n    if (mappedEdges)\r\n      mappedEdges.length = 0;\r\n    if (unMappedSeeds)\r\n      unMappedSeeds.length = 0;\r\n    const mask = HalfEdgeMask.VISITED;\r\n    graph.clearMask(mask);\r\n    for (const seed of graph.allHalfEdges) {\r\n      if (!seed.getMask(mask)) {\r\n        seed.setMaskAroundFace(mask);\r\n        if (!positiveAreaOnly || seed.signedFaceArea() > 0) {\r\n          const edge = mutate(seed);\r\n          if (edge) {\r\n            if (mappedEdges)\r\n              mappedEdges.push(edge);\r\n          } else {\r\n            if (unMappedSeeds)\r\n              unMappedSeeds.push(seed);\r\n          }\r\n        }\r\n      }\r\n    }\r\n  }\r\n\r\n}\r\n"]}

package/lib/cjs/topology/SignedDataSummary.js.map

@@ -1 +1 @@
-{"version":3,"file":"SignedDataSummary.js","sourceRoot":"","sources":["../../../src/topology/SignedDataSummary.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AACH;;;;GAIG;AACH,MAAa,iBAAiB;IAC5B,sCAAsC;IAC/B,WAAW,CAAS;IAC3B,qCAAqC;IAC9B,WAAW,CAAS;IAC3B,kCAAkC;IAC3B,WAAW,CAAS;IAC3B,qCAAqC;IAC9B,WAAW,CAAS;IAC3B,iCAAiC;IAC1B,OAAO,CAAS;IACvB,wDAAwD;IACjD,mBAAmB,CAAK;IAC/B,qDAAqD;IAC9C,mBAAmB,CAAK;IACxB,oBAAoB,CAAS;IAC7B,oBAAoB,CAAS;IACpC,wCAAwC;IACjC,iBAAiB,CAAO;IAC/B,gCAAgC;IACzB,aAAa,CAAO;IAC3B,oCAAoC;IAC7B,iBAAiB,CAAO;IAC/B,gDAAgD;IAChD,YAAmB,YAAqB;QACtC,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW,GAAG,GAAG,CAAC;QAC1C,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,OAAO,GAAG,GAAG,CAAC;QACzD,IAAI,CAAC,oBAAoB,GAAG,IAAI,CAAC,oBAAoB,GAAG,GAAG,CAAC;QAC5D,IAAI,YAAY,EAAE,CAAC;YACjB,IAAI,CAAC,iBAAiB,GAAG,EAAE,CAAC;YAC5B,IAAI,CAAC,iBAAiB,GAAG,EAAE,CAAC;YAC5B,IAAI,CAAC,aAAa,GAAG,EAAE,CAAC;QAC1B,CAAC;IACH,CAAC;IACD,8CAA8C;IACvC,YAAY,CAAC,IAAO,EAAE,IAAY;QACvC,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;YACb,IAAI,CAAC,WAAW,EAAE,CAAC;YACnB,IAAI,CAAC,WAAW,IAAI,IAAI,CAAC;YACzB,IAAI,IAAI,CAAC,iBAAiB;gBACxB,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACpC,IAAI,IAAI,GAAG,IAAI,CAAC,oBAAoB,EAAE,CAAC;gBACrC,IAAI,CAAC,oBAAoB,GAAG,IAAI,CAAC;gBACjC,IAAI,CAAC,mBAAmB,GAAG,IAAI,CAAC;YAClC,CAAC;QACH,CAAC;aAAM,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;YACpB,IAAI,CAAC,WAAW,EAAE,CAAC;YACnB,IAAI,CAAC,WAAW,IAAI,IAAI,CAAC;YACzB,IAAI,IAAI,CAAC,iBAAiB;gBACxB,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACpC,IAAI,IAAI,GAAG,IAAI,CAAC,oBAAoB,EAAE,CAAC;gBACrC,IAAI,CAAC,oBAAoB,GAAG,IAAI,CAAC;gBACjC,IAAI,CAAC,mBAAmB,GAAG,IAAI,CAAC;YAClC,CAAC;QACH,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,OAAO,EAAE,CAAC;YACf,IAAI,IAAI,CAAC,aAAa;gBACpB,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClC,CAAC;IACH,CAAC;CACF;AA5DD,8CA4DC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n\n/** @packageDocumentation\n * @module Topology\n */\n/**\n * Class to accumulate statistics about a stream of signed numbers with tag items.\n * * All sums, counts, extrema, and item values are initialized to zero in the constructor.\n * * Each call to `announceItem(item, value)` updates the various sums, counts, and extrema.\n */\nexport class SignedDataSummary<T> {\n  /** Sum of all positive area items. */\n  public positiveSum: number;\n  /** Number of positive area items. */\n  public numPositive: number;\n  /** Sum of negative area items. */\n  public negativeSum: number;\n  /** Number of negative area items. */\n  public numNegative: number;\n  /** Number of zero area items. */\n  public numZero: number;\n  /** The tag item item with the largest positive data. */\n  public largestPositiveItem?: T;\n  /** The tag item item with the most negative data. */\n  public largestNegativeItem?: T;\n  public largestPositiveValue: number;\n  public largestNegativeValue: number;\n  /** Array of all negative area items. */\n  public negativeItemArray?: T[];\n  /** Array of zero area items. */\n  public zeroItemArray?: T[];\n  /** Array of positive area items. */\n  public positiveItemArray?: T[];\n  /** Setup with zero sums and optional arrays. */\n  public constructor(createArrays: boolean) {\n    this.positiveSum = this.negativeSum = 0.0;\n    this.numPositive = this.numNegative = this.numZero = 0.0;\n    this.largestPositiveValue = this.largestNegativeValue = 0.0;\n    if (createArrays) {\n      this.negativeItemArray = [];\n      this.positiveItemArray = [];\n      this.zeroItemArray = [];\n    }\n  }\n  /** Update with an item and its data value. */\n  public announceItem(item: T, data: number) {\n    if (data < 0) {\n      this.numNegative++;\n      this.negativeSum += data;\n      if (this.negativeItemArray)\n        this.negativeItemArray.push(item);\n      if (data < this.largestNegativeValue) {\n        this.largestNegativeValue = data;\n        this.largestNegativeItem = item;\n      }\n    } else if (data > 0) {\n      this.numPositive++;\n      this.positiveSum += data;\n      if (this.positiveItemArray)\n        this.positiveItemArray.push(item);\n      if (data > this.largestPositiveValue) {\n        this.largestPositiveValue = data;\n        this.largestPositiveItem = item;\n      }\n    } else {\n      this.numZero++;\n      if (this.zeroItemArray)\n        this.zeroItemArray.push(item);\n    }\n  }\n}\n"]}
+{"version":3,"file":"SignedDataSummary.js","sourceRoot":"","sources":["../../../src/topology/SignedDataSummary.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AACH;;;;GAIG;AACH,MAAa,iBAAiB;IAC5B,sCAAsC;IAC/B,WAAW,CAAS;IAC3B,qCAAqC;IAC9B,WAAW,CAAS;IAC3B,kCAAkC;IAC3B,WAAW,CAAS;IAC3B,qCAAqC;IAC9B,WAAW,CAAS;IAC3B,iCAAiC;IAC1B,OAAO,CAAS;IACvB,wDAAwD;IACjD,mBAAmB,CAAK;IAC/B,qDAAqD;IAC9C,mBAAmB,CAAK;IACxB,oBAAoB,CAAS;IAC7B,oBAAoB,CAAS;IACpC,wCAAwC;IACjC,iBAAiB,CAAO;IAC/B,gCAAgC;IACzB,aAAa,CAAO;IAC3B,oCAAoC;IAC7B,iBAAiB,CAAO;IAC/B,gDAAgD;IAChD,YAAmB,YAAqB;QACtC,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW,GAAG,GAAG,CAAC;QAC1C,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,OAAO,GAAG,GAAG,CAAC;QACzD,IAAI,CAAC,oBAAoB,GAAG,IAAI,CAAC,oBAAoB,GAAG,GAAG,CAAC;QAC5D,IAAI,YAAY,EAAE,CAAC;YACjB,IAAI,CAAC,iBAAiB,GAAG,EAAE,CAAC;YAC5B,IAAI,CAAC,iBAAiB,GAAG,EAAE,CAAC;YAC5B,IAAI,CAAC,aAAa,GAAG,EAAE,CAAC;QAC1B,CAAC;IACH,CAAC;IACD,8CAA8C;IACvC,YAAY,CAAC,IAAO,EAAE,IAAY;QACvC,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;YACb,IAAI,CAAC,WAAW,EAAE,CAAC;YACnB,IAAI,CAAC,WAAW,IAAI,IAAI,CAAC;YACzB,IAAI,IAAI,CAAC,iBAAiB;gBACxB,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACpC,IAAI,IAAI,GAAG,IAAI,CAAC,oBAAoB,EAAE,CAAC;gBACrC,IAAI,CAAC,oBAAoB,GAAG,IAAI,CAAC;gBACjC,IAAI,CAAC,mBAAmB,GAAG,IAAI,CAAC;YAClC,CAAC;QACH,CAAC;aAAM,IAAI,IAAI,GAAG,CAAC,EAAE,CAAC;YACpB,IAAI,CAAC,WAAW,EAAE,CAAC;YACnB,IAAI,CAAC,WAAW,IAAI,IAAI,CAAC;YACzB,IAAI,IAAI,CAAC,iBAAiB;gBACxB,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACpC,IAAI,IAAI,GAAG,IAAI,CAAC,oBAAoB,EAAE,CAAC;gBACrC,IAAI,CAAC,oBAAoB,GAAG,IAAI,CAAC;gBACjC,IAAI,CAAC,mBAAmB,GAAG,IAAI,CAAC;YAClC,CAAC;QACH,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,OAAO,EAAE,CAAC;YACf,IAAI,IAAI,CAAC,aAAa;gBACpB,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAClC,CAAC;IACH,CAAC;CACF;AA5DD,8CA4DC","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 Topology\r\n */\r\n/**\r\n * Class to accumulate statistics about a stream of signed numbers with tag items.\r\n * * All sums, counts, extrema, and item values are initialized to zero in the constructor.\r\n * * Each call to `announceItem(item, value)` updates the various sums, counts, and extrema.\r\n */\r\nexport class SignedDataSummary<T> {\r\n  /** Sum of all positive area items. */\r\n  public positiveSum: number;\r\n  /** Number of positive area items. */\r\n  public numPositive: number;\r\n  /** Sum of negative area items. */\r\n  public negativeSum: number;\r\n  /** Number of negative area items. */\r\n  public numNegative: number;\r\n  /** Number of zero area items. */\r\n  public numZero: number;\r\n  /** The tag item item with the largest positive data. */\r\n  public largestPositiveItem?: T;\r\n  /** The tag item item with the most negative data. */\r\n  public largestNegativeItem?: T;\r\n  public largestPositiveValue: number;\r\n  public largestNegativeValue: number;\r\n  /** Array of all negative area items. */\r\n  public negativeItemArray?: T[];\r\n  /** Array of zero area items. */\r\n  public zeroItemArray?: T[];\r\n  /** Array of positive area items. */\r\n  public positiveItemArray?: T[];\r\n  /** Setup with zero sums and optional arrays. */\r\n  public constructor(createArrays: boolean) {\r\n    this.positiveSum = this.negativeSum = 0.0;\r\n    this.numPositive = this.numNegative = this.numZero = 0.0;\r\n    this.largestPositiveValue = this.largestNegativeValue = 0.0;\r\n    if (createArrays) {\r\n      this.negativeItemArray = [];\r\n      this.positiveItemArray = [];\r\n      this.zeroItemArray = [];\r\n    }\r\n  }\r\n  /** Update with an item and its data value. */\r\n  public announceItem(item: T, data: number) {\r\n    if (data < 0) {\r\n      this.numNegative++;\r\n      this.negativeSum += data;\r\n      if (this.negativeItemArray)\r\n        this.negativeItemArray.push(item);\r\n      if (data < this.largestNegativeValue) {\r\n        this.largestNegativeValue = data;\r\n        this.largestNegativeItem = item;\r\n      }\r\n    } else if (data > 0) {\r\n      this.numPositive++;\r\n      this.positiveSum += data;\r\n      if (this.positiveItemArray)\r\n        this.positiveItemArray.push(item);\r\n      if (data > this.largestPositiveValue) {\r\n        this.largestPositiveValue = data;\r\n        this.largestPositiveItem = item;\r\n      }\r\n    } else {\r\n      this.numZero++;\r\n      if (this.zeroItemArray)\r\n        this.zeroItemArray.push(item);\r\n    }\r\n  }\r\n}\r\n"]}

package/lib/cjs/topology/SpaceTriangulation.js.map

@@ -1 +1 @@
-{"version":3,"file":"SpaceTriangulation.js","sourceRoot":"","sources":["../../../src/topology/SpaceTriangulation.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AAEH,wDAAqD;AACrD,0CAAuC;AAEvC,6DAA0D;AAC1D,yDAAoD;AACpD,2DAAsD;AAGtD;;;GAGG;AACH,MAAa,yBAAyB;IAEpC;;;;;;;;;OASG;IACI,MAAM,CAAC,wBAAwB,CAAC,MAAe,EAAE,MAAe,EAAE,MAAe;QACpF,MAAM,YAAY,GAAG,MAAM,CAAC,oBAAoB,CAAE,MAAM,EAAE,MAAM,CAAC,CAAC;QAClE,MAAM,IAAI,GAAG,GAAG,GAAG,YAAY,CAAC,SAAS,EAAG,CAAC;QAC7C,MAAM,iBAAiB,GAAG,MAAM,CAAC,eAAe,CAAE,MAAM,CAAC,GAAG,MAAM,CAAC,eAAe,CAAE,MAAM,CAAC,GAAG,MAAM,CAAC,eAAe,CAAE,MAAM,CAAC,CAAC;QAC9H,OAAO,mBAAQ,CAAC,kBAAkB,CAAE,IAAI,EAAE,iBAAiB,EAAE,GAAG,CAAC,CAAC;IACtE,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,4BAA4B,CAAC,MAAe,EAAE,MAAe,EAAE,MAAe,EAAE,MAAe;QAC3G,MAAM,IAAI,GAAG,IAAI,CAAC,wBAAwB,CAAE,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;QACpE,MAAM,IAAI,GAAG,IAAI,CAAC,wBAAwB,CAAE,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;QACpE,OAAO,IAAI,CAAC,GAAG,CAAE,IAAI,EAAE,IAAI,CAAC,CAAC;IAC/B,CAAC;IACD,qJAAqJ;IAC9I,MAAM,CAAC,uBAAuB,CAAC,MAAiB,EAAE,wBAA0D;QACjH,MAAM,OAAO,GAAG,uBAAU,CAAC,UAAU,CAAE,MAAM,CAAC,CAAC;QAC/C,MAAM,SAAS,GAAgB,EAAE,CAAC;QAClC,MAAM,QAAQ,GAAG,MAAM,CAAC,KAAK,EAAG,CAAC;QACjC,yBAAW,CAAC,kBAAkB,CAAE,QAAQ,CAAC,CAAC;QAC1C,sCAAsC;QACtC,gCAAgC;QAChC,OAAM,QAAQ,CAAC,MAAM,GAAG,CAAC,GAAE,CAAC;YAC1B,uHAAuH;YACvH,IAAI,SAAS,GAAG,CAAC,GAAG,CAAC;YACrB,IAAI,eAAe,GAAG,CAAC,CAAC;YACxB,IAAI,EAAE,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;YAC7B,IAAI,EAAE,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;YAC7B,IAAI,EAAE,CAAC;YACP,KAAK,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,QAAQ,CAAC,MAAM,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAC,CAAC;gBACzD,MAAM,KAAK,GAAG,IAAI,CAAC,wBAAwB,CAAE,QAAQ,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;gBACvF,MAAM,OAAO,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC,oBAAoB,CAAE,QAAQ,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;gBAC/E,IAAI,OAAO,CAAC,UAAU,CAAE,OAAO,CAAC,GAAG,CAAC,IAAI,KAAK,GAAG,SAAS,EAAC,CAAC;oBACzD,SAAS,GAAG,KAAK,CAAC;oBAClB,eAAe,GAAG,EAAE,CAAC;gBACvB,CAAC;YACH,CAAC;YACD,IAAI,SAAS,IAAI,GAAG;gBAClB,OAAO,KAAK,CAAC;YACf,4BAA4B;YAC5B,EAAE,GAAG,eAAe,CAAC;YACrB,EAAE,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC;YAChC,EAAE,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC;YAChC,MAAM,CAAC,GAAG,EAAE,CAAC;YACb,CAAC,CAAC,IAAI,CAAE,QAAQ,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;YAClD,0BAA0B;YAC1B,QAAQ,CAAC,MAAM,CAAE,EAAE,EAAE,CAAC,CAAC,CAAC;YACxB,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACpB,CAAC;QACD,wBAAwB,CAAE,MAAM,EAAE,SAAS,CAAC,CAAC;QAC7C,OAAO,IAAI,CAAC;IACd,CAAC;IAEO,MAAM,CAAC,8BAA8B,CAAC,MAAiB,EAAE,wBAA0D,EACzH,YAAgC;QAChC,MAAM,CAAC,GAAG,2BAAY,CAAC,kBAAkB,CAAE,MAAM,CAAC,CAAC;QACrD,IAAI,YAAY,KAAK,SAAS,IAAI,2BAAY,CAAC,cAAc,CAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC,GAAG,YAAY;YAC1F,OAAO,KAAK,CAAC;QACjB,IAAI,CAAC,GAAG,CAAC;YACP,OAAO,KAAK,CAAC;QACf,IAAI,CAAC,KAAK,CAAC,EAAC,CAAC;YACX,IAAI,IAAI,CAAC,wBAAwB,CAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;gBACvE,OAAO,KAAK,CAAC;YACf,2BAA2B;YAC3B,wBAAwB,CAAE,MAAM,EAAE,CAAC,MAAM,CAAC,KAAK,EAAG,CAAC,CAAC,CAAC;YACrD,OAAO,IAAI,CAAC;QACd,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,EAAC,CAAC;YACX,MAAM,GAAG,GAAG,IAAI,CAAC,4BAA4B,CAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3F,MAAM,GAAG,GAAG,IAAI,CAAC,4BAA4B,CAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3F,IAAI,GAAG,KAAK,GAAG,IAAI,GAAG,KAAK,GAAG;gBAC5B,OAAO,KAAK,CAAC;YACf,4DAA4D;YAC5D,IAAI,GAAG,GAAG,GAAG,EAAC,CAAC;gBACb,wBAAwB,CAAE,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC1G,OAAO,IAAI,CAAC;YACd,CAAC;iBAAM,CAAC;gBACN,wBAAwB,CAAE,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC1G,OAAO,IAAI,CAAC;YACd,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC,uBAAuB,CAAE,MAAM,EAAE,wBAAwB,CAAC,CAAC;IACvE,CAAC;IACD;;;;;;;OAOG;IACI,MAAM,CAAC,4BAA4B,CAAC,IAA+B,EACxE,wBAA0D,EAC1D,YAAqB;QACrB,IAAI,IAAI,YAAY,2BAAY;YAC9B,OAAO,IAAI,CAAC,8BAA8B,CAAE,IAAI,CAAC,MAAM,EAAE,wBAAwB,EAAE,YAAY,CAAC,CAAC;QACjG,6BAA6B;QAC/B,OAAO,IAAI,CAAC,8BAA8B,CAAE,IAAI,EAAE,wBAAwB,EAAE,YAAY,CAAC,CAAC;IAC5F,CAAC;CAEF;AAtHD,8DAsHC","sourcesContent":["/*---------------------------------------------------------------------------------------------\n* Copyright (c) Bentley Systems, Incorporated. All rights reserved.\n* See LICENSE.md in the project root for license terms and full copyright notice.\n*--------------------------------------------------------------------------------------------*/\n\n/** @packageDocumentation\n * @module Topology\n */\n\nimport { LineString3d } from \"../curve/LineString3d\";\nimport { Geometry } from \"../Geometry\";\nimport { Point3d } from \"../geometry3d/Point3dVector3d\";\nimport { Point3dArray } from \"../geometry3d/PointHelpers\";\nimport {PolygonOps} from \"../geometry3d/PolygonOps\";\nimport {PolylineOps} from \"../geometry3d/PolylineOps\";\ntype AnnounceLoopAndTrianglesFunction = (loop: Point3d[], triangles: Point3d[][]) => void;\n\n/**\n * Class with static methods to triangulate various forms of possibly non-planar polygons.\n * @public\n */\nexport class SpacePolygonTriangulation {\n\n  /**\n   * * Return a number which is:\n   *   * 0 for collapsed (zero area) triangle\n   *   * positive for non-zero area\n   *   * larger is \"better\"\n   * * Specifically, return (if well defined) the area divided by summed squares of edge lengths.\n   * @param point0\n   * @param point1\n   * @param point2\n   */\n  public static spaceTriangleAspectRatio(point0: Point3d, point1: Point3d, point2: Point3d): number {\n      const crossProduct = point0.crossProductToPoints (point1, point2);\n      const area = 0.5 * crossProduct.magnitude ();\n      const summedEdgeSquares = point0.distanceSquared (point1) + point1.distanceSquared (point2) + point2.distanceSquared (point0);\n      return Geometry.safeDivideFraction (area, summedEdgeSquares, 0.0);\n  }\n  /**\n   * * Treat a space quad as two triangles with interior diagonal from point0 to point2\n   * * Return the smaller of the aspect ratios of the two triangles.\n   * * The quad edges proceed in the order [point0, point1, point2, point3]\n   * @param point0 first point of quad\n   * @param point1 second point of quad (diagonally opposite of point3)\n   * @param point2 third point (diagonally opposite point0)\n   * @param point3 fourth point\n   */\n  public static spaceQuadDiagonalAspectRatio(point0: Point3d, point1: Point3d, point2: Point3d, point3: Point3d): number{\n    const q012 = this.spaceTriangleAspectRatio (point0, point1, point2);\n    const q023 = this.spaceTriangleAspectRatio (point0, point2, point3);\n    return Math.max (q012, q023);\n  }\n  /** \"Triangulate\" by cutting of the ear with best aspect ratio.  Reject if successive normals have negative dot product with PolygonOps.AreaNormal */\n  public static triangulateGreedyEarCut(points: Point3d[], announceLoopAndTriangles: AnnounceLoopAndTrianglesFunction): boolean{\n    const normalA = PolygonOps.areaNormal (points);\n    const triangles: Point3d[][] = [];\n    const myPoints = points.slice ();\n    PolylineOps.removeClosurePoint (myPoints);\n    // first pass deals with entire array.\n    // each pass lops off one point.\n    for (;myPoints.length > 2;){\n      // Find the ear candidate whose cross product vector has largest dot product (large area, best alignment with overall).\n      let bestRatio = -1.0;\n      let bestRatioIndex0 = 0;\n      let i0 = myPoints.length - 2;\n      let i1 = myPoints.length - 1;\n      let i2;\n      for (i2 = 0; i2 < myPoints.length; i0 = i1, i1 = i2, i2++){\n        const ratio = this.spaceTriangleAspectRatio (myPoints[i0], myPoints[i1], myPoints[i2]);\n        const normalB = myPoints[i0].crossProductToPoints (myPoints[i1], myPoints[i2]);\n        if (normalB.dotProduct (normalA) > 0 && ratio > bestRatio){\n          bestRatio = ratio;\n          bestRatioIndex0 = i0;\n        }\n      }\n      if (bestRatio <= 0.0)\n        return false;\n      // add the ear to the result\n      i0 = bestRatioIndex0;\n      i1 = (i0 + 1) % myPoints.length;\n      i2 = (i1 + 1) % myPoints.length;\n      const t = [];\n      t.push (myPoints[i0], myPoints[i1], myPoints[i2]);\n      // remove the middle point\n      myPoints.splice (i1, 1);\n      triangles.push(t);\n    }\n    announceLoopAndTriangles (points, triangles);\n    return true;\n  }\n\n  private static triangulateSimplestSpaceLoopGo(points: Point3d[], announceLoopAndTriangles: AnnounceLoopAndTrianglesFunction,\n    maxPerimeter: number | undefined): boolean{\n    const n = Point3dArray.countNonDuplicates (points);\n  if (maxPerimeter !== undefined && Point3dArray.sumEdgeLengths (points, true, n) > maxPerimeter)\n      return false;\n  if (n < 3)\n    return false;\n  if (n === 3){\n    if (this.spaceTriangleAspectRatio (points[0], points[1], points[2]) === 0)\n      return false;\n    // already a triangle . . .\n    announceLoopAndTriangles (points, [points.slice ()]);\n    return true;\n  }\n  if (n === 4){\n    const d02 = this.spaceQuadDiagonalAspectRatio (points[0], points[1], points[2], points[3]);\n    const d13 = this.spaceQuadDiagonalAspectRatio (points[1], points[2], points[3], points[0]);\n    if (d02 === 0.0 && d13 === 0.0)\n      return false;\n    // announce the two triangles with better aspect ratios ....\n    if (d02 > d13){\n      announceLoopAndTriangles (points, [[points[0], points[1], points[2]], [points[2], points[3], points[0]]]);\n      return true;\n    } else {\n      announceLoopAndTriangles (points, [[points[0], points[1], points[3]], [points[3], points[1], points[2]]]);\n      return true;\n    }\n  }\n  return this.triangulateGreedyEarCut (points, announceLoopAndTriangles);\n  }\n  /**\n   * * Emit triangles for a (possibly non-planar) loop for various simple cases:\n   *    * only 3 points: just emit that triangle.\n   *    * only 4 points: split across a diagonal, choosing the one with better aspect ratios of its two triangles.\n   * * BUT\n   *    * do not complete the triangulation if perimeter is larger than maxPerimeter (i.e. only consider small areas)\n   * * Hence it is expected that the caller will use this as the first attempt, possibly followed by calls to other more adventurous methods.\n   */\n  public static triangulateSimplestSpaceLoop(loop: Point3d [] | LineString3d,\n    announceLoopAndTriangles: AnnounceLoopAndTrianglesFunction,\n    maxPerimeter?: number): boolean{\n    if (loop instanceof LineString3d)\n      return this.triangulateSimplestSpaceLoopGo (loop.points, announceLoopAndTriangles, maxPerimeter);\n      // (array case by exhaustion)\n    return this.triangulateSimplestSpaceLoopGo (loop, announceLoopAndTriangles, maxPerimeter);\n  }\n\n}\n"]}
+{"version":3,"file":"SpaceTriangulation.js","sourceRoot":"","sources":["../../../src/topology/SpaceTriangulation.ts"],"names":[],"mappings":";AAAA;;;+FAG+F;;;AAE/F;;GAEG;AAEH,wDAAqD;AACrD,0CAAuC;AAEvC,6DAA0D;AAC1D,yDAAoD;AACpD,2DAAsD;AAGtD;;;GAGG;AACH,MAAa,yBAAyB;IAEpC;;;;;;;;;OASG;IACI,MAAM,CAAC,wBAAwB,CAAC,MAAe,EAAE,MAAe,EAAE,MAAe;QACpF,MAAM,YAAY,GAAG,MAAM,CAAC,oBAAoB,CAAE,MAAM,EAAE,MAAM,CAAC,CAAC;QAClE,MAAM,IAAI,GAAG,GAAG,GAAG,YAAY,CAAC,SAAS,EAAG,CAAC;QAC7C,MAAM,iBAAiB,GAAG,MAAM,CAAC,eAAe,CAAE,MAAM,CAAC,GAAG,MAAM,CAAC,eAAe,CAAE,MAAM,CAAC,GAAG,MAAM,CAAC,eAAe,CAAE,MAAM,CAAC,CAAC;QAC9H,OAAO,mBAAQ,CAAC,kBAAkB,CAAE,IAAI,EAAE,iBAAiB,EAAE,GAAG,CAAC,CAAC;IACtE,CAAC;IACD;;;;;;;;OAQG;IACI,MAAM,CAAC,4BAA4B,CAAC,MAAe,EAAE,MAAe,EAAE,MAAe,EAAE,MAAe;QAC3G,MAAM,IAAI,GAAG,IAAI,CAAC,wBAAwB,CAAE,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;QACpE,MAAM,IAAI,GAAG,IAAI,CAAC,wBAAwB,CAAE,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;QACpE,OAAO,IAAI,CAAC,GAAG,CAAE,IAAI,EAAE,IAAI,CAAC,CAAC;IAC/B,CAAC;IACD,qJAAqJ;IAC9I,MAAM,CAAC,uBAAuB,CAAC,MAAiB,EAAE,wBAA0D;QACjH,MAAM,OAAO,GAAG,uBAAU,CAAC,UAAU,CAAE,MAAM,CAAC,CAAC;QAC/C,MAAM,SAAS,GAAgB,EAAE,CAAC;QAClC,MAAM,QAAQ,GAAG,MAAM,CAAC,KAAK,EAAG,CAAC;QACjC,yBAAW,CAAC,kBAAkB,CAAE,QAAQ,CAAC,CAAC;QAC1C,sCAAsC;QACtC,gCAAgC;QAChC,OAAM,QAAQ,CAAC,MAAM,GAAG,CAAC,GAAE,CAAC;YAC1B,uHAAuH;YACvH,IAAI,SAAS,GAAG,CAAC,GAAG,CAAC;YACrB,IAAI,eAAe,GAAG,CAAC,CAAC;YACxB,IAAI,EAAE,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;YAC7B,IAAI,EAAE,GAAG,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC;YAC7B,IAAI,EAAE,CAAC;YACP,KAAK,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,QAAQ,CAAC,MAAM,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,EAAE,EAAC,CAAC;gBACzD,MAAM,KAAK,GAAG,IAAI,CAAC,wBAAwB,CAAE,QAAQ,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;gBACvF,MAAM,OAAO,GAAG,QAAQ,CAAC,EAAE,CAAC,CAAC,oBAAoB,CAAE,QAAQ,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;gBAC/E,IAAI,OAAO,CAAC,UAAU,CAAE,OAAO,CAAC,GAAG,CAAC,IAAI,KAAK,GAAG,SAAS,EAAC,CAAC;oBACzD,SAAS,GAAG,KAAK,CAAC;oBAClB,eAAe,GAAG,EAAE,CAAC;gBACvB,CAAC;YACH,CAAC;YACD,IAAI,SAAS,IAAI,GAAG;gBAClB,OAAO,KAAK,CAAC;YACf,4BAA4B;YAC5B,EAAE,GAAG,eAAe,CAAC;YACrB,EAAE,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC;YAChC,EAAE,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC;YAChC,MAAM,CAAC,GAAG,EAAE,CAAC;YACb,CAAC,CAAC,IAAI,CAAE,QAAQ,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;YAClD,0BAA0B;YAC1B,QAAQ,CAAC,MAAM,CAAE,EAAE,EAAE,CAAC,CAAC,CAAC;YACxB,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACpB,CAAC;QACD,wBAAwB,CAAE,MAAM,EAAE,SAAS,CAAC,CAAC;QAC7C,OAAO,IAAI,CAAC;IACd,CAAC;IAEO,MAAM,CAAC,8BAA8B,CAAC,MAAiB,EAAE,wBAA0D,EACzH,YAAgC;QAChC,MAAM,CAAC,GAAG,2BAAY,CAAC,kBAAkB,CAAE,MAAM,CAAC,CAAC;QACrD,IAAI,YAAY,KAAK,SAAS,IAAI,2BAAY,CAAC,cAAc,CAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC,GAAG,YAAY;YAC1F,OAAO,KAAK,CAAC;QACjB,IAAI,CAAC,GAAG,CAAC;YACP,OAAO,KAAK,CAAC;QACf,IAAI,CAAC,KAAK,CAAC,EAAC,CAAC;YACX,IAAI,IAAI,CAAC,wBAAwB,CAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;gBACvE,OAAO,KAAK,CAAC;YACf,2BAA2B;YAC3B,wBAAwB,CAAE,MAAM,EAAE,CAAC,MAAM,CAAC,KAAK,EAAG,CAAC,CAAC,CAAC;YACrD,OAAO,IAAI,CAAC;QACd,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,EAAC,CAAC;YACX,MAAM,GAAG,GAAG,IAAI,CAAC,4BAA4B,CAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3F,MAAM,GAAG,GAAG,IAAI,CAAC,4BAA4B,CAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YAC3F,IAAI,GAAG,KAAK,GAAG,IAAI,GAAG,KAAK,GAAG;gBAC5B,OAAO,KAAK,CAAC;YACf,4DAA4D;YAC5D,IAAI,GAAG,GAAG,GAAG,EAAC,CAAC;gBACb,wBAAwB,CAAE,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC1G,OAAO,IAAI,CAAC;YACd,CAAC;iBAAM,CAAC;gBACN,wBAAwB,CAAE,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC1G,OAAO,IAAI,CAAC;YACd,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC,uBAAuB,CAAE,MAAM,EAAE,wBAAwB,CAAC,CAAC;IACvE,CAAC;IACD;;;;;;;OAOG;IACI,MAAM,CAAC,4BAA4B,CAAC,IAA+B,EACxE,wBAA0D,EAC1D,YAAqB;QACrB,IAAI,IAAI,YAAY,2BAAY;YAC9B,OAAO,IAAI,CAAC,8BAA8B,CAAE,IAAI,CAAC,MAAM,EAAE,wBAAwB,EAAE,YAAY,CAAC,CAAC;QACjG,6BAA6B;QAC/B,OAAO,IAAI,CAAC,8BAA8B,CAAE,IAAI,EAAE,wBAAwB,EAAE,YAAY,CAAC,CAAC;IAC5F,CAAC;CAEF;AAtHD,8DAsHC","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 Topology\r\n */\r\n\r\nimport { LineString3d } from \"../curve/LineString3d\";\r\nimport { Geometry } from \"../Geometry\";\r\nimport { Point3d } from \"../geometry3d/Point3dVector3d\";\r\nimport { Point3dArray } from \"../geometry3d/PointHelpers\";\r\nimport {PolygonOps} from \"../geometry3d/PolygonOps\";\r\nimport {PolylineOps} from \"../geometry3d/PolylineOps\";\r\ntype AnnounceLoopAndTrianglesFunction = (loop: Point3d[], triangles: Point3d[][]) => void;\r\n\r\n/**\r\n * Class with static methods to triangulate various forms of possibly non-planar polygons.\r\n * @public\r\n */\r\nexport class SpacePolygonTriangulation {\r\n\r\n  /**\r\n   * * Return a number which is:\r\n   *   * 0 for collapsed (zero area) triangle\r\n   *   * positive for non-zero area\r\n   *   * larger is \"better\"\r\n   * * Specifically, return (if well defined) the area divided by summed squares of edge lengths.\r\n   * @param point0\r\n   * @param point1\r\n   * @param point2\r\n   */\r\n  public static spaceTriangleAspectRatio(point0: Point3d, point1: Point3d, point2: Point3d): number {\r\n      const crossProduct = point0.crossProductToPoints (point1, point2);\r\n      const area = 0.5 * crossProduct.magnitude ();\r\n      const summedEdgeSquares = point0.distanceSquared (point1) + point1.distanceSquared (point2) + point2.distanceSquared (point0);\r\n      return Geometry.safeDivideFraction (area, summedEdgeSquares, 0.0);\r\n  }\r\n  /**\r\n   * * Treat a space quad as two triangles with interior diagonal from point0 to point2\r\n   * * Return the smaller of the aspect ratios of the two triangles.\r\n   * * The quad edges proceed in the order [point0, point1, point2, point3]\r\n   * @param point0 first point of quad\r\n   * @param point1 second point of quad (diagonally opposite of point3)\r\n   * @param point2 third point (diagonally opposite point0)\r\n   * @param point3 fourth point\r\n   */\r\n  public static spaceQuadDiagonalAspectRatio(point0: Point3d, point1: Point3d, point2: Point3d, point3: Point3d): number{\r\n    const q012 = this.spaceTriangleAspectRatio (point0, point1, point2);\r\n    const q023 = this.spaceTriangleAspectRatio (point0, point2, point3);\r\n    return Math.max (q012, q023);\r\n  }\r\n  /** \"Triangulate\" by cutting of the ear with best aspect ratio.  Reject if successive normals have negative dot product with PolygonOps.AreaNormal */\r\n  public static triangulateGreedyEarCut(points: Point3d[], announceLoopAndTriangles: AnnounceLoopAndTrianglesFunction): boolean{\r\n    const normalA = PolygonOps.areaNormal (points);\r\n    const triangles: Point3d[][] = [];\r\n    const myPoints = points.slice ();\r\n    PolylineOps.removeClosurePoint (myPoints);\r\n    // first pass deals with entire array.\r\n    // each pass lops off one point.\r\n    for (;myPoints.length > 2;){\r\n      // Find the ear candidate whose cross product vector has largest dot product (large area, best alignment with overall).\r\n      let bestRatio = -1.0;\r\n      let bestRatioIndex0 = 0;\r\n      let i0 = myPoints.length - 2;\r\n      let i1 = myPoints.length - 1;\r\n      let i2;\r\n      for (i2 = 0; i2 < myPoints.length; i0 = i1, i1 = i2, i2++){\r\n        const ratio = this.spaceTriangleAspectRatio (myPoints[i0], myPoints[i1], myPoints[i2]);\r\n        const normalB = myPoints[i0].crossProductToPoints (myPoints[i1], myPoints[i2]);\r\n        if (normalB.dotProduct (normalA) > 0 && ratio > bestRatio){\r\n          bestRatio = ratio;\r\n          bestRatioIndex0 = i0;\r\n        }\r\n      }\r\n      if (bestRatio <= 0.0)\r\n        return false;\r\n      // add the ear to the result\r\n      i0 = bestRatioIndex0;\r\n      i1 = (i0 + 1) % myPoints.length;\r\n      i2 = (i1 + 1) % myPoints.length;\r\n      const t = [];\r\n      t.push (myPoints[i0], myPoints[i1], myPoints[i2]);\r\n      // remove the middle point\r\n      myPoints.splice (i1, 1);\r\n      triangles.push(t);\r\n    }\r\n    announceLoopAndTriangles (points, triangles);\r\n    return true;\r\n  }\r\n\r\n  private static triangulateSimplestSpaceLoopGo(points: Point3d[], announceLoopAndTriangles: AnnounceLoopAndTrianglesFunction,\r\n    maxPerimeter: number | undefined): boolean{\r\n    const n = Point3dArray.countNonDuplicates (points);\r\n  if (maxPerimeter !== undefined && Point3dArray.sumEdgeLengths (points, true, n) > maxPerimeter)\r\n      return false;\r\n  if (n < 3)\r\n    return false;\r\n  if (n === 3){\r\n    if (this.spaceTriangleAspectRatio (points[0], points[1], points[2]) === 0)\r\n      return false;\r\n    // already a triangle . . .\r\n    announceLoopAndTriangles (points, [points.slice ()]);\r\n    return true;\r\n  }\r\n  if (n === 4){\r\n    const d02 = this.spaceQuadDiagonalAspectRatio (points[0], points[1], points[2], points[3]);\r\n    const d13 = this.spaceQuadDiagonalAspectRatio (points[1], points[2], points[3], points[0]);\r\n    if (d02 === 0.0 && d13 === 0.0)\r\n      return false;\r\n    // announce the two triangles with better aspect ratios ....\r\n    if (d02 > d13){\r\n      announceLoopAndTriangles (points, [[points[0], points[1], points[2]], [points[2], points[3], points[0]]]);\r\n      return true;\r\n    } else {\r\n      announceLoopAndTriangles (points, [[points[0], points[1], points[3]], [points[3], points[1], points[2]]]);\r\n      return true;\r\n    }\r\n  }\r\n  return this.triangulateGreedyEarCut (points, announceLoopAndTriangles);\r\n  }\r\n  /**\r\n   * * Emit triangles for a (possibly non-planar) loop for various simple cases:\r\n   *    * only 3 points: just emit that triangle.\r\n   *    * only 4 points: split across a diagonal, choosing the one with better aspect ratios of its two triangles.\r\n   * * BUT\r\n   *    * do not complete the triangulation if perimeter is larger than maxPerimeter (i.e. only consider small areas)\r\n   * * Hence it is expected that the caller will use this as the first attempt, possibly followed by calls to other more adventurous methods.\r\n   */\r\n  public static triangulateSimplestSpaceLoop(loop: Point3d [] | LineString3d,\r\n    announceLoopAndTriangles: AnnounceLoopAndTrianglesFunction,\r\n    maxPerimeter?: number): boolean{\r\n    if (loop instanceof LineString3d)\r\n      return this.triangulateSimplestSpaceLoopGo (loop.points, announceLoopAndTriangles, maxPerimeter);\r\n      // (array case by exhaustion)\r\n    return this.triangulateSimplestSpaceLoopGo (loop, announceLoopAndTriangles, maxPerimeter);\r\n  }\r\n\r\n}\r\n"]}

package/lib/cjs/topology/Triangulation.d.ts

@@ -5,6 +5,7 @@ import { MarkedEdgeSet } from "./HalfEdgeMarkSet";
 import { InsertedVertexZOptions } from "./InsertAndRetriangulateContext";
 /**
  * Static methods for triangulating polygons and points.
+ * * Tolerances and tolerance usage are currently inconsistent, and not exposed to callers.
  * * @internal
  */
 export declare class Triangulator {
@@ -39,13 +40,12 @@ export declare class Triangulator {
      */
     static flipTrianglesInEdgeSet(graph: HalfEdgeGraph, edgeSet: MarkedEdgeSet): number;
     /**
-     * Create a graph from an xy-triangulation of the given points.
+     * Create a graph from an xy-triangulation of the given points. The triangulation is Delaunay.
      * * The outer boundary of the graph is the xy-convex hull of the points; it is marked `HalfEdgeMask.EXTERIOR`.
-     * @param points the points to triangulate
+     * @param points the points to triangulate.
      * @param zRule optional rule for updating the z-coordinate of an existing vertex when an xy-duplicate point is
      * inserted into the graph. Default is `InsertedVertexZOptions.ReplaceIfLarger`.
-     * @param pointTolerance optional xy-distance tolerance for equating vertices. Default is
-     * `Geometry.smallMetricDistance`.
+     * @param pointTolerance optional xy-distance tolerance for equating vertices. Default is `Geometry.smallMetricDistance`.
      */
     static createTriangulatedGraphFromPoints(points: Point3d[], zRule?: InsertedVertexZOptions, pointTolerance?: number): HalfEdgeGraph | undefined;
     /**
@@ -68,12 +68,14 @@ export declare class Triangulator {
      * * A random node is checked for each face; if it has the `HalfEdgeMask.EXTERIOR` mask, the face is ignored.
      * @param useLocalCoords whether to transform each face into local coords before triangulating.
      * This is useful if the graph has z-coordinates.
+     * @param noFlips if false (default) perform edge-flipping after each ear cut for better aspect ratio.
+     * Ignored if `useLocalCoords` is true, in which case flipping is not performed to avoid out-of-plane effects.
      * @returns whether all indicated faces were triangulated successfully
      * @see [[triangulateAllPositiveAreaFaces]]
      */
-    static triangulateAllInteriorFaces(graph: HalfEdgeGraph, useLocalCoords?: boolean): boolean;
+    static triangulateAllInteriorFaces(graph: HalfEdgeGraph, useLocalCoords?: boolean, noFlips?: boolean): boolean;
     /**
-     * Triangulate the polygon made up of by a series of points.
+     * Triangulate the polygon made up of by a series of points. The triangulation is Delaunay.
      * * The loop may be either CCW or CW -- CCW order will be used for triangles.
      * * To triangulate a polygon with holes, use createTriangulatedGraphFromLoops.
      */
@@ -139,14 +141,15 @@ export declare class Triangulator {
     /**
      * Perform 0, 1, or more edge flips to improve aspect ratio just behind an ear that was just cut.
      * @param ear the triangle corner which just served as the ear node.
-     * @returns the node at the back corner after flipping."appropriately positioned" node for the usual advance to ear.faceSuccessor.edgeMate.faceSuccessor.
+     * @returns the node at the back corner after flipping, "appropriately positioned" for the usual advance to `ear.faceSuccessor.edgeMate.faceSuccessor`.
      */
     private static doPostCutFlips;
     /**
      * Main ear slicing loop which triangulates the face starting at `ear`.
      * @param graph containing graph to receive new edges
      * @param ear sector at which to start triangulation of the containing face.
-     * @param noFlips if false (default) perform edge-flipping after each ear cut for better aspect ratio. Pass true if your graph isn't planar.
+     * @param noFlips if false (default) perform edge-flipping after each ear cut for better aspect ratio.
+     * Pass true if your graph isn't planar; otherwise, an edge can be flipped out of plane if the neighboring triangle is non-coplanar.
      */
     private static triangulateSingleFace;
     /** @internal  */
@@ -202,7 +205,7 @@ export declare class Triangulator {
     private static findHoleBridge;
     private static getLeftmost;
     /**
-     * Check if a point lies within a triangle.
+     * Check if a point lies within or on a triangle.
      * * In other words, the areas of the 3 triangles formed by an edge of abc and p all have zero or positive area.
      */
     private static pointInTriangle;
@@ -213,8 +216,7 @@ export declare class Triangulator {
      * (This originates in classic earcut code.)
     */
     private static signedCWTriangleArea;
-    /** signed area of a triangle, with small positive corrected to zero by relTol
-    */
+    /** signed area of a triangle, with small positive corrected to zero by relTol */
     private static signedTolerancedCCWTriangleArea;
     /** check if two points are equal */
     private static isAlmostEqualXAndYXY;

package/lib/cjs/topology/Triangulation.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"Triangulation.d.ts","sourceRoot":"","sources":["../../../src/topology/Triangulation.ts"],"names":[],"mappings":"AAYA,OAAO,EAAwB,qBAAqB,EAAE,0BAA0B,EAAE,MAAM,oCAAoC,CAAC;AAE7H,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AAMxD,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AAChE,OAAO,EAAE,aAAa,EAAE,MAAM,mBAAmB,CAAC;AAClD,OAAO,EAAiC,sBAAsB,EAAE,MAAM,iCAAiC,CAAC;AAExG;;;GAGG;AACH,qBAAa,YAAY;IAEvB;;;;OAIG;IACH,OAAO,CAAC,MAAM,CAAC,wBAAwB;IAiBvC;;;;;;;;;;OAUG;WACW,8CAA8C,CAAC,KAAK,EAAE,QAAQ,GAAG,OAAO;IAqDtF;;;;OAIG;WACW,aAAa,CAAC,KAAK,EAAE,aAAa,GAAG,MAAM;IASzD;;;;OAIG;WACW,sBAAsB,CAAC,KAAK,EAAE,aAAa,EAAE,OAAO,EAAE,aAAa,GAAG,MAAM;IA6B1F;;;;;;;;OAQG;WACW,iCAAiC,CAC7C,MAAM,EAAE,OAAO,EAAE,EACjB,KAAK,GAAE,sBAA+D,EACtE,cAAc,GAAE,MAAqC,GACpD,aAAa,GAAG,SAAS;IAqB5B;;;;;OAKG;WACW,gCAAgC,CAAC,KAAK,EAAE,qBAAqB,EAAE,GAAG,aAAa,GAAG,SAAS;IA+CzG;;;;;OAKG;WACW,+BAA+B,CAAC,KAAK,EAAE,aAAa,GAAG,OAAO;IAc5E,OAAO,CAAC,MAAM,CAAC,cAAc,CAAC,CAAY;IAE1C;;;;;;;OAOG;WACW,2BAA2B,CAAC,KAAK,EAAE,aAAa,EAAE,cAAc,CAAC,EAAE,OAAO,GAAG,OAAO;IA+BlG;;;;OAIG;WACW,qCAAqC,CAAC,IAAI,EAAE,qBAAqB,GAAG,aAAa,GAAG,SAAS;IAW3G;;;;;OAKG;IACH,OAAO,CAAC,MAAM,CAAC,iBAAiB;IAkBhC,oEAAoE;IACpE,OAAO,CAAC,MAAM,CAAC,kBAAkB;IA2BjC;;;OAGG;WACW,mCAAmC,CAAC,KAAK,EAAE,aAAa,EAAE,IAAI,EAAE,qBAAqB,GAAG,QAAQ,GAAG,SAAS;IAgB1H;;;;;;OAMG;WACW,iCAAiC,CAAC,KAAK,EAAE,aAAa,EAAE,IAAI,EAAE,0BAA0B,EAAE,EAAE,GAAE,MAAU,GAAG,QAAQ,EAAE;IAMnI;;;;;;;OAOG;IACH,OAAO,CAAC,MAAM,CAAC,wBAAwB;IAwBvC;;;;;;OAMG;WACW,6BAA6B,CACzC,KAAK,EAAE,aAAa,EAAE,IAAI,EAAE,qBAAqB,EAAE,sBAAsB,EAAE,OAAO,EAAE,YAAY,EAAE,OAAO,GACxG,QAAQ,GAAG,SAAS;IAMvB;;;;;;;;OAQG;WACW,qCAAqC,CAAC,KAAK,EAAE,aAAa,EAAE,IAAI,EAAE,qBAAqB,EAAE,sBAAsB,EAAE,OAAO,EACpI,gBAAgB,EAAE,YAAY,EAC9B,gBAAgB,EAAE,YAAY,GAAG,QAAQ,GAAG,SAAS;IAKvD;;;;;;OAMG;IACH,OAAO,CAAC,MAAM,CAAC,kBAAkB;IAWjC,OAAO,CAAC,MAAM,CAAC,kBAAkB;IAYjC;;;;OAIG;IACH,OAAO,CAAC,MAAM,CAAC,cAAc;IAwC7B;;;;;OAKG;IACH,OAAO,CAAC,MAAM,CAAC,qBAAqB;IAkEpC,iBAAiB;IACjB,OAAO,CAAC,MAAM,CAAC,WAAW,CAA4B;IACtD,gBAAgB;IAChB,OAAO,CAAC,MAAM,CAAC,wBAAwB,CAAS;IAEhD;;;;mBAIe;WACD,eAAe,IAAI,aAAa,GAAG,SAAS;IAM1D;;;;mBAIe;WACD,aAAa,CAAC,KAAK,EAAE,aAAa,GAAG,SAAS;IAC5D;;;;;;;;;mBASe;WACD,+BAA+B,CAAC,KAAK,EAAE,OAAO;IAK5D;;;OAGG;IACH,OAAO,CAAC,MAAM,CAAC,oBAAoB;IAOnC,OAAO,CAAC,MAAM,CAAC,aAAa,CAAwB;IACpD,OAAO,CAAC,MAAM,CAAC,SAAS,CAAwB;IAChD,OAAO,CAAC,MAAM,CAAC,UAAU,CAAwB;IACjD,OAAO,CAAC,MAAM,CAAC,OAAO,CAIpB;IACF,yEAAyE;IACzE,OAAO,CAAC,MAAM,CAAC,KAAK;IA0DpB;;OAEG;IACH,OAAO,CAAC,MAAM,CAAC,0BAA0B;IAYzC,mEAAmE;IACnE,OAAO,CAAC,MAAM,CAAC,QAAQ;IAIvB,2FAA2F;IAC3F,OAAO,CAAC,MAAM,CAAC,aAAa;IAQ5B;;;OAGG;IACH,OAAO,CAAC,MAAM,CAAC,cAAc;IA+D7B,OAAO,CAAC,MAAM,CAAC,WAAW;IAW1B;;;OAGG;IACH,OAAO,CAAC,MAAM,CAAC,eAAe;IAK9B,6DAA6D;IAC7D,OAAO,CAAC,MAAM,CAAC,cAAc;IAK7B;;;MAGE;IACF,OAAO,CAAC,MAAM,CAAC,oBAAoB;IAInC;MACE;IACF,OAAO,CAAC,MAAM,CAAC,+BAA+B;IAe9C,oCAAoC;IACpC,OAAO,CAAC,MAAM,CAAC,oBAAoB;IAInC,iDAAiD;IACjD,OAAO,CAAC,MAAM,CAAC,aAAa;IAM5B;;;;;;OAMG;IACH,OAAO,CAAC,MAAM,CAAC,SAAS;IAWxB;;;OAGG;WACW,6BAA6B,CAAC,KAAK,EAAE,aAAa,EAAE,KAAK,EAAE,QAAQ,GAAG,OAAO;CAuI5F"}
+{"version":3,"file":"Triangulation.d.ts","sourceRoot":"","sources":["../../../src/topology/Triangulation.ts"],"names":[],"mappings":"AAYA,OAAO,EAAwB,qBAAqB,EAAE,0BAA0B,EAAE,MAAM,oCAAoC,CAAC;AAE7H,OAAO,EAAE,OAAO,EAAE,MAAM,+BAA+B,CAAC;AAMxD,OAAO,EAAE,QAAQ,EAAE,aAAa,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AAChE,OAAO,EAAE,aAAa,EAAE,MAAM,mBAAmB,CAAC;AAClD,OAAO,EAAiC,sBAAsB,EAAE,MAAM,iCAAiC,CAAC;AAExG;;;;GAIG;AACH,qBAAa,YAAY;IAEvB;;;;OAIG;IACH,OAAO,CAAC,MAAM,CAAC,wBAAwB;IAiBvC;;;;;;;;;;OAUG;WACW,8CAA8C,CAAC,KAAK,EAAE,QAAQ,GAAG,OAAO;IAqDtF;;;;OAIG;WACW,aAAa,CAAC,KAAK,EAAE,aAAa,GAAG,MAAM;IASzD;;;;OAIG;WACW,sBAAsB,CAAC,KAAK,EAAE,aAAa,EAAE,OAAO,EAAE,aAAa,GAAG,MAAM;IA6B1F;;;;;;;OAOG;WACW,iCAAiC,CAC7C,MAAM,EAAE,OAAO,EAAE,EACjB,KAAK,GAAE,sBAA+D,EACtE,cAAc,GAAE,MAAqC,GACpD,aAAa,GAAG,SAAS;IAqB5B;;;;;OAKG;WACW,gCAAgC,CAAC,KAAK,EAAE,qBAAqB,EAAE,GAAG,aAAa,GAAG,SAAS;IA+CzG;;;;;OAKG;WACW,+BAA+B,CAAC,KAAK,EAAE,aAAa,GAAG,OAAO;IAc5E,OAAO,CAAC,MAAM,CAAC,cAAc,CAAC,CAAY;IAE1C;;;;;;;;;OASG;WACW,2BAA2B,CAAC,KAAK,EAAE,aAAa,EAAE,cAAc,CAAC,EAAE,OAAO,EAAE,OAAO,CAAC,EAAE,OAAO,GAAG,OAAO;IA+BrH;;;;OAIG;WACW,qCAAqC,CAAC,IAAI,EAAE,qBAAqB,GAAG,aAAa,GAAG,SAAS;IAW3G;;;;;OAKG;IACH,OAAO,CAAC,MAAM,CAAC,iBAAiB;IAkBhC,oEAAoE;IACpE,OAAO,CAAC,MAAM,CAAC,kBAAkB;IA2BjC;;;OAGG;WACW,mCAAmC,CAAC,KAAK,EAAE,aAAa,EAAE,IAAI,EAAE,qBAAqB,GAAG,QAAQ,GAAG,SAAS;IAgB1H;;;;;;OAMG;WACW,iCAAiC,CAAC,KAAK,EAAE,aAAa,EAAE,IAAI,EAAE,0BAA0B,EAAE,EAAE,GAAE,MAAU,GAAG,QAAQ,EAAE;IAMnI;;;;;;;OAOG;IACH,OAAO,CAAC,MAAM,CAAC,wBAAwB;IAwBvC;;;;;;OAMG;WACW,6BAA6B,CACzC,KAAK,EAAE,aAAa,EAAE,IAAI,EAAE,qBAAqB,EAAE,sBAAsB,EAAE,OAAO,EAAE,YAAY,EAAE,OAAO,GACxG,QAAQ,GAAG,SAAS;IAUvB;;;;;;;;OAQG;WACW,qCAAqC,CAAC,KAAK,EAAE,aAAa,EAAE,IAAI,EAAE,qBAAqB,EAAE,sBAAsB,EAAE,OAAO,EACpI,gBAAgB,EAAE,YAAY,EAC9B,gBAAgB,EAAE,YAAY,GAAG,QAAQ,GAAG,SAAS;IAKvD;;;;;;OAMG;IACH,OAAO,CAAC,MAAM,CAAC,kBAAkB;IAWjC,OAAO,CAAC,MAAM,CAAC,kBAAkB;IAYjC;;;;OAIG;IACH,OAAO,CAAC,MAAM,CAAC,cAAc;IA0C7B;;;;;;OAMG;IACH,OAAO,CAAC,MAAM,CAAC,qBAAqB;IAkEpC,iBAAiB;IACjB,OAAO,CAAC,MAAM,CAAC,WAAW,CAA4B;IACtD,gBAAgB;IAChB,OAAO,CAAC,MAAM,CAAC,wBAAwB,CAAS;IAEhD;;;;mBAIe;WACD,eAAe,IAAI,aAAa,GAAG,SAAS;IAM1D;;;;mBAIe;WACD,aAAa,CAAC,KAAK,EAAE,aAAa,GAAG,SAAS;IAC5D;;;;;;;;;mBASe;WACD,+BAA+B,CAAC,KAAK,EAAE,OAAO;IAK5D;;;OAGG;IACH,OAAO,CAAC,MAAM,CAAC,oBAAoB;IAOnC,OAAO,CAAC,MAAM,CAAC,aAAa,CAAwB;IACpD,OAAO,CAAC,MAAM,CAAC,SAAS,CAAwB;IAChD,OAAO,CAAC,MAAM,CAAC,UAAU,CAAwB;IACjD,OAAO,CAAC,MAAM,CAAC,OAAO,CAIpB;IACF,yEAAyE;IACzE,OAAO,CAAC,MAAM,CAAC,KAAK;IA0DpB;;OAEG;IACH,OAAO,CAAC,MAAM,CAAC,0BAA0B;IAYzC,mEAAmE;IACnE,OAAO,CAAC,MAAM,CAAC,QAAQ;IAIvB,2FAA2F;IAC3F,OAAO,CAAC,MAAM,CAAC,aAAa;IAQ5B;;;OAGG;IACH,OAAO,CAAC,MAAM,CAAC,cAAc;IA+D7B,OAAO,CAAC,MAAM,CAAC,WAAW;IAW1B;;;OAGG;IACH,OAAO,CAAC,MAAM,CAAC,eAAe;IAK9B,6DAA6D;IAC7D,OAAO,CAAC,MAAM,CAAC,cAAc;IAK7B;;;MAGE;IACF,OAAO,CAAC,MAAM,CAAC,oBAAoB;IAInC,iFAAiF;IACjF,OAAO,CAAC,MAAM,CAAC,+BAA+B;IAe9C,oCAAoC;IACpC,OAAO,CAAC,MAAM,CAAC,oBAAoB;IAInC,iDAAiD;IACjD,OAAO,CAAC,MAAM,CAAC,aAAa;IAM5B;;;;;;OAMG;IACH,OAAO,CAAC,MAAM,CAAC,SAAS;IAWxB;;;OAGG;WACW,6BAA6B,CAAC,KAAK,EAAE,aAAa,EAAE,KAAK,EAAE,QAAQ,GAAG,OAAO;CAuI5F"}

package/lib/cjs/topology/Triangulation.js

@@ -22,6 +22,7 @@ const HalfEdgeMarkSet_1 = require("./HalfEdgeMarkSet");
 const InsertAndRetriangulateContext_1 = require("./InsertAndRetriangulateContext");
 /**
  * Static methods for triangulating polygons and points.
+ * * Tolerances and tolerance usage are currently inconsistent, and not exposed to callers.
  * * @internal
  */
 class Triangulator {
@@ -150,13 +151,12 @@ class Triangulator {
         return numFlip;
     }
     /**
-     * Create a graph from an xy-triangulation of the given points.
+     * Create a graph from an xy-triangulation of the given points. The triangulation is Delaunay.
      * * The outer boundary of the graph is the xy-convex hull of the points; it is marked `HalfEdgeMask.EXTERIOR`.
-     * @param points the points to triangulate
+     * @param points the points to triangulate.
      * @param zRule optional rule for updating the z-coordinate of an existing vertex when an xy-duplicate point is
      * inserted into the graph. Default is `InsertedVertexZOptions.ReplaceIfLarger`.
-     * @param pointTolerance optional xy-distance tolerance for equating vertices. Default is
-     * `Geometry.smallMetricDistance`.
+     * @param pointTolerance optional xy-distance tolerance for equating vertices. Default is `Geometry.smallMetricDistance`.
      */
     static createTriangulatedGraphFromPoints(points, zRule = InsertAndRetriangulateContext_1.InsertedVertexZOptions.ReplaceIfLarger, pointTolerance = Geometry_1.Geometry.smallMetricDistance) {
         if (points.length < 3)
@@ -256,12 +256,15 @@ class Triangulator {
      * * A random node is checked for each face; if it has the `HalfEdgeMask.EXTERIOR` mask, the face is ignored.
      * @param useLocalCoords whether to transform each face into local coords before triangulating.
      * This is useful if the graph has z-coordinates.
+     * @param noFlips if false (default) perform edge-flipping after each ear cut for better aspect ratio.
+     * Ignored if `useLocalCoords` is true, in which case flipping is not performed to avoid out-of-plane effects.
      * @returns whether all indicated faces were triangulated successfully
      * @see [[triangulateAllPositiveAreaFaces]]
      */
-    static triangulateAllInteriorFaces(graph, useLocalCoords) {
+    static triangulateAllInteriorFaces(graph, useLocalCoords, noFlips) {
         const seeds = graph.collectFaceLoops();
         const visited = useLocalCoords ? graph.grabMask() : Graph_1.HalfEdgeMask.NULL_MASK;
+        noFlips = useLocalCoords || noFlips; // don't flip if using local coords
         let localToWorld;
         let nodes;
         let nodeCount = 0;
@@ -276,8 +279,7 @@ class Triangulator {
                     localToWorld = this._workTransform = FrameBuilder_1.FrameBuilder.createRightHandedLocalToWorld(nodes, this._workTransform);
                     localToWorld?.multiplyInversePoint3dArrayInPlace(nodes);
                 }
-                // don't flip triangles if using local coords; an edge of this face can be flipped out of plane if the neighboring triangle is non-coplanar.
-                if (!Triangulator.triangulateSingleFace(graph, face, useLocalCoords))
+                if (!Triangulator.triangulateSingleFace(graph, face, noFlips))
                     numFail++;
                 if (localToWorld && nodes) {
                     for (let iNewNode = nodeCount; iNewNode < graph.countNodes(); ++iNewNode)
@@ -290,7 +292,7 @@ class Triangulator {
         return numFail === 0;
     }
     /**
-     * Triangulate the polygon made up of by a series of points.
+     * Triangulate the polygon made up of by a series of points. The triangulation is Delaunay.
      * * The loop may be either CCW or CW -- CCW order will be used for triangles.
      * * To triangulate a polygon with holes, use createTriangulatedGraphFromLoops.
      */
@@ -475,31 +477,32 @@ class Triangulator {
     /**
      * Perform 0, 1, or more edge flips to improve aspect ratio just behind an ear that was just cut.
      * @param ear the triangle corner which just served as the ear node.
-     * @returns the node at the back corner after flipping."appropriately positioned" node for the usual advance to ear.faceSuccessor.edgeMate.faceSuccessor.
+     * @returns the node at the back corner after flipping, "appropriately positioned" for the usual advance to `ear.faceSuccessor.edgeMate.faceSuccessor`.
      */
     static doPostCutFlips(ear) {
-        //    B is the ear -- inside a (probably newly created) triangle ABC
-        //    CA is the recently added cut edge.
-        //    AB is the candidate to be flipped.
-        //    triangle B1 A1 D is on the other side of AB
-        //    The condition for flipping is:
-        //           ! both triangles must be TRIANGULATED_NODE_MASK
-        //           ! circumcircle condition flags D as in the circle of ABC
-        //     after flip, node A moves to the vertex of D, and is the effective "ear",  with the cap edge C A1
-        //      after flip, consider the A1 D (whose nodes are A1 and flipped A!!!)
+        // B0 is at the ear vertex, inside ear triangle T = A0 B0 C.
+        // C is the recently cut edge added to form the ear cap.
+        // A0/B1 is the quad diagonal edge candidate to be flipped.
+        // Triangle T' = B1 A1 D1 is on the other side of the quad diagonal.
+        // The conditions for flipping are:
+        //   * both triangles T, T' must be masked with TRIANGULATED_FACE
+        //   * the Delaunay circumcircle condition flags the vertex at D1 as in the circumcircle of T
+        // After flip, node A0 becomes D1.vertexSuccessor, and is the effective "ear", with (same) cap edge C.
+        // The next quad diagonal edge candidate to consider in the loop is A1/D0.
         //
-        //                           *                                 *
-        //                       . C0|                             . / |
-        //                  .        |                        .  C0 /B1|
-        //               .           |                     .       /v  |
-        //           .              ^|                 .          /    |
-        //       .  A0 ---->       B0|             .            /     ^|
-        //   *=======================*   -->   * A1            /     B0*
-        //     \ A1     <----   B1/              \            /     /
-        //       \             /                   \        /    /
-        //         \         /                       \    ^/ D1/
-        //           \  D1 /                           \A0/  /
-        //              *                                 *
+        //                         *                                 *
+        //                     .  C|                             . / |
+        //                  .      |                          .  C/B1|
+        //              .          |                      .      /   |
+        //          .              |                  .         /    |
+        //      .  A0  ---->     B0|              .            /     |
+        //   *=====================*    -->    * A1           /   B0 *
+        //    \ A1     <----  B1 /              \            /     /
+        //      \              /                  \         /    /
+        //        \          /                      \      /   /
+        //          \      /                          \ A0/D1/
+        //         D0 \D1/                           D0 \/ /
+        //             *                                 *
         let b0 = ear;
         let a0 = b0.facePredecessor;
         let b1 = a0.edgeMate;
@@ -513,6 +516,7 @@ class Triangulator {
             b0 = a0;
             a0 = b0.facePredecessor;
             b1 = a0.edgeMate;
+            // Move to next quad with diagonal a0/b1
         }
         return b0;
     }
@@ -520,7 +524,8 @@ class Triangulator {
      * Main ear slicing loop which triangulates the face starting at `ear`.
      * @param graph containing graph to receive new edges
      * @param ear sector at which to start triangulation of the containing face.
-     * @param noFlips if false (default) perform edge-flipping after each ear cut for better aspect ratio. Pass true if your graph isn't planar.
+     * @param noFlips if false (default) perform edge-flipping after each ear cut for better aspect ratio.
+     * Pass true if your graph isn't planar; otherwise, an edge can be flipped out of plane if the neighboring triangle is non-coplanar.
      */
     static triangulateSingleFace(graph, ear, noFlips = false) {
         if (!ear) {
@@ -548,7 +553,7 @@ class Triangulator {
             // The earcut algorithm does not support self intersections, however we do handle the re-entrant triangle
             // case by pinching a bridge/hole into existence when vertices i and i+3 live in the same face loop, but not
             // the same vertex loop. Earcut whittles larger faces down into triangles, so this is the only case needed.
-            if (Geometry_1.Geometry.isAlmostEqualXAndY(next2, pred) && !next2.findAroundVertex(pred)) {
+            if (Triangulator.isAlmostEqualXAndYXY(next2, pred.x, pred.y) && !next2.findAroundVertex(pred)) {
                 const next3 = next2.faceSuccessor;
                 const hasBridgeEdgeOrHoleInside = this.nodeInTriangle(pred, ear, next, next3);
                 if (hasBridgeEdgeOrHoleInside) {
@@ -631,7 +636,7 @@ class Triangulator {
     static findAroundOrAtVertex(a, b) {
         if (a.findAroundVertex(b))
             return true;
-        return Geometry_1.Geometry.isAlmostEqualXAndY(a, b);
+        return Triangulator.isAlmostEqualXAndYXY(a, b.x, b.y);
     }
     // for reuse over all calls to isEar ....
     static _edgeInterval = Range_1.Range1d.createNull();
@@ -798,7 +803,7 @@ class Triangulator {
         return leftmost;
     }
     /**
-     * Check if a point lies within a triangle.
+     * Check if a point lies within or on a triangle.
      * * In other words, the areas of the 3 triangles formed by an edge of abc and p all have zero or positive area.
      */
     static pointInTriangle(ax, ay, bx, by, cx, cy, px, py) {
@@ -819,8 +824,7 @@ class Triangulator {
     static signedCWTriangleArea(p, q, r) {
         return 0.5 * ((q.y - p.y) * (r.x - q.x) - (q.x - p.x) * (r.y - q.y));
     }
-    /** signed area of a triangle, with small positive corrected to zero by relTol
-    */
+    /** signed area of a triangle, with small positive corrected to zero by relTol */
     static signedTolerancedCCWTriangleArea(p, q, r, relTol = 1.0e-12) {
         const ux = q.x - p.x;
         const uy = q.y - p.y;