npm - @faicad/faijs - Versions diffs - 0.31.1 → 0.32.3 - Mend

@faicad/faijs 0.31.1 → 0.32.3

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

Files changed (1538) hide show

package/dist/api/brep-mirror/roofFns.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"roofFns.js","sourceRoot":"","sources":["../../../src/api/brep-mirror/roofFns.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAGH,OAAO,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAA;AACrD,OAAO,EAAE,EAAE,EAAE,GAAG,EAAe,MAAM,qBAAqB,CAAA;AAC1D,OAAO,EAAE,WAAW,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAA;AAEhE,OAAO,EAAE,WAAW,EAAE,MAAM,4BAA4B,CAAA;AACxD,OAAO,EAAE,YAAY,EAAE,MAAM,eAAe,CAAA;AAC5C,OAAO,EAAE,uBAAuB,EAAkB,MAAM,oBAAoB,CAAA;AAE5E,MAAM,WAAW,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,OAAO,EAAE,SAAS,CAAC,EAAE,SAAS,EAAE,GAAgB,EAAE,CAAA;AAE/F,8EAA8E;AAC9E,gCAAgC;AAChC,8EAA8E;AAE9E,SAAS,cAAc,CAAC,MAAqC,EAAE,IAAgB;IAC7E,MAAM,KAAK,GAAG,MAAM,CAAC,YAAY,CAAC,IAAI,EAAE,MAAM,CAAC,CAAA;IAC/C,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;QAC1B,MAAM,EAAE,GAAG,MAAM,CAAC,iBAAiB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;QACzC,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAA;IAC7B,CAAC,CAAC,CAAA;IACF,MAAM,KAAK,GAAG,GAAG,CAAC,CAAC,CAAC,CAAA;IACpB,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC,CAAA;IAChC,IACE,GAAG,CAAC,MAAM,GAAG,CAAC;QACd,KAAK,KAAK,SAAS;QACnB,IAAI,KAAK,SAAS;QAClB,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,KAAK;QAClC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,KAAK,EAClC,CAAC;QACD,GAAG,CAAC,GAAG,EAAE,CAAA;IACX,CAAC;IACD,OAAO,GAAG,CAAA;AACZ,CAAC;AAED,uEAAuE;AACvE,SAAS,cAAc,CAAC,KAAa;IACnC,MAAM,IAAI,GAAoC,EAAE,CAAA;IAChD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACnC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;IAC1B,CAAC;IACD,OAAO,IAAI,CAAA;AACb,CAAC;AAED,sEAAsE;AACtE,SAAS,OAAO,CAAC,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU;IACrF,OAAO,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,CAAA;AACtD,CAAC;AAED,kEAAkE;AAClE,SAAS,eAAe,CACtB,EAAU,EACV,EAAU,EACV,EAAU,EACV,EAAU,EACV,EAAU,EACV,EAAU,EACV,EAAU,EACV,EAAU;IAEV,MAAM,EAAE,GAAG,OAAO,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAA;IAC1C,MAAM,EAAE,GAAG,OAAO,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAA;IAC1C,MAAM,EAAE,GAAG,OAAO,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAA;IAC1C,MAAM,MAAM,GAAG,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAA;IACzC,MAAM,MAAM,GAAG,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAA;IACzC,OAAO,CAAC,CAAC,MAAM,IAAI,MAAM,CAAC,CAAA;AAC5B,CAAC;AAED,oEAAoE;AACpE,SAAS,kBAAkB,CAAC,IAAiB;IAC3C,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAA;IACrB,IAAI,CAAC,GAAG,CAAC;QAAE,OAAO,EAAE,CAAA;IACpB,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;IAE/B,IAAI,KAAK,GAAG,CAAC,CAAA;IACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAA;QACjB,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAA;QAC3B,IAAI,CAAC,IAAI,CAAC;YAAE,KAAK,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;IAC5C,CAAC;IACD,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;QACd,MAAM,IAAI,GAAG,kBAAkB,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,OAAO,EAAE,CAAC,CAAA;QACpD,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;IACnE,CAAC;IAED,MAAM,IAAI,GAAoC,EAAE,CAAA;IAChD,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAA;IACjC,MAAM,KAAK,GAAG,CAAC,IAAY,EAAE,IAAY,EAAE,IAAY,EAAW,EAAE;QAClE,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAA;QACpB,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAA;QACpB,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAA;QACpB,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC;YAAE,OAAO,KAAK,CAAA;QAChC,IAAI,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;YAAE,OAAO,KAAK,CAAA;QAC5D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3B,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAA;YACjB,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,IAAI;gBAAE,SAAQ;YAC1D,IAAI,eAAe,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;gBAAE,OAAO,KAAK,CAAA;QAC3E,CAAC;QACD,OAAO,IAAI,CAAA;IACb,CAAC,CAAA;IAED,OAAO,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACtB,IAAI,OAAO,GAAG,KAAK,CAAA;QACnB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,MAAM,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAAA;YACnD,MAAM,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC,CAAA;YACnB,MAAM,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC,CAAA;YACtC,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,KAAK,SAAS;gBAAE,SAAQ;YAC5E,IAAI,KAAK,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC;gBAC5B,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC,CAAA;gBAC7B,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;gBAChB,OAAO,GAAG,IAAI,CAAA;gBACd,MAAK;YACP,CAAC;QACH,CAAC;QACD,IAAI,CAAC,OAAO;YAAE,MAAK;IACrB,CAAC;IACD,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACrB,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,GAAG,GAAG,CAAA;QACrB,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,SAAS;YAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAA;IACjF,CAAC;IACD,OAAO,IAAI,CAAA;AACb,CAAC;AAED,yEAAyE;AACzE,SAAS,qBAAqB,CAC5B,QAAwE,EACxE,QAAgB,EAChB,MAAqC;IAErC,MAAM,QAAQ,GAAiB,EAAE,CAAA;IACjC,KAAK,MAAM,MAAM,IAAI,QAAQ,CAAC,KAAK,EAAE,CAAC;QACpC,MAAM,OAAO,GAAoC,MAAM,CAAC,QAAQ,CAAC,GAAG,CAClE,CAAC,CAAY,EAAE,CAAS,EAA4B,EAAE,CAAC;YACrD,CAAC,CAAC,CAAC;YACH,CAAC,CAAC,CAAC;YACH,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,QAAQ;SACpC,CACF,CAAA;QAED,MAAM,IAAI,GAAG,cAAc,CAAC,OAAO,CAAC,MAAM,CAAC,CAAA;QAE3C,KAAK,MAAM,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC;YAChC,MAAM,EAAE,GAAG,OAAO,CAAC,EAAE,CAAC,CAAA;YACtB,MAAM,EAAE,GAAG,OAAO,CAAC,EAAE,CAAC,CAAA;YACtB,MAAM,EAAE,GAAG,OAAO,CAAC,EAAE,CAAC,CAAA;YACtB,IAAI,CAAC,EAAE,IAAI,CAAC,EAAE,IAAI,CAAC,EAAE;gBAAE,SAAQ;YAE/B,MAAM,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAA;YACzB,MAAM,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAA;YACzB,MAAM,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAA;YACzB,MAAM,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAA;YACzB,MAAM,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAA;YACzB,MAAM,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAA;YACzB,MAAM,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAA;YAChC,MAAM,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAA;YAChC,MAAM,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,CAAA;YAChC,MAAM,MAAM,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAA;YAC1C,IAAI,MAAM,GAAG,KAAK;gBAAE,SAAQ;YAE5B,MAAM,OAAO,GAAG,MAAM,CAAC,YAAY,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAA;YACzI,IAAI,OAAO,KAAK,IAAI;gBAAE,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;QAC9C,CAAC;IACH,CAAC;IACD,OAAO,QAAQ,CAAA;AACjB,CAAC;AAED,8EAA8E;AAC9E,mDAAmD;AACnD,8EAA8E;AAE9E;;;;;GAKG;AACH,MAAM,UAAU,QAAQ,CAAC,GAAG,IAAe;IACzC,MAAM,CAAC,KAAK,EAAE,OAAO,CAAC,GAAG,WAAW,CAAC,IAAI,EAAE,WAAW,CAAC,CAAA;IACvD,MAAM,MAAM,GAAG,UAAU,EAAE,CAAA;IAC3B,MAAM,IAAI,GAAG,YAAY,CAAC,KAAK,CAAC,CAAA;IAChC,MAAM,KAAK,GAAG,CAAE,OAA0C,EAAE,KAAK,IAAI,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,GAAG,CAAC,CAAA;IAC1F,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;IAEhC,IAAI,CAAC;QACH,MAAM,OAAO,GAAG,cAAc,CAAC,MAAM,EAAE,IAAI,CAAC,CAAA;QAC5C,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACvB,OAAO,GAAG,CACR,WAAW,CAAC,aAAa,CAAC,WAAW,EAAE,qDAAqD,CAAC,CAC9F,CAAA;QACH,CAAC;QAED,MAAM,cAAc,GAAG,uBAAuB,CAAC,OAAO,CAAC,CAAA;QACvD,IAAI,CAAC,cAAc,CAAC,EAAE;YAAE,OAAO,cAAc,CAAA;QAC7C,MAAM,QAAQ,GAAG,cAAc,CAAC,KAAK,CAAA;QACrC,IAAI,QAAQ,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAChC,OAAO,GAAG,CACR,WAAW,CAAC,aAAa,CAAC,WAAW,EAAE,iDAAiD,CAAC,CAC1F,CAAA;QACH,CAAC;QAED,MAAM,QAAQ,GAAiB,qBAAqB,CAAC,QAAQ,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAA;QAEhF,mCAAmC;QACnC,KAAK,MAAM,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,IAAI,kBAAkB,CAAC,OAAO,CAAC,EAAE,CAAC;YACvD,MAAM,EAAE,GAAG,OAAO,CAAC,EAAE,CAAC,CAAA;YACtB,MAAM,EAAE,GAAG,OAAO,CAAC,EAAE,CAAC,CAAA;YACtB,MAAM,EAAE,GAAG,OAAO,CAAC,EAAE,CAAC,CAAA;YACtB,IAAI,CAAC,EAAE,IAAI,CAAC,EAAE,IAAI,CAAC,EAAE;gBAAE,SAAQ;YAC/B,MAAM,EAAE,GAA6B,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;YACpD,MAAM,EAAE,GAA6B,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;YACpD,MAAM,EAAE,GAA6B,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;YACpD,MAAM,OAAO,GAAG,MAAM,CAAC,YAAY,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAA;YACzI,IAAI,OAAO,KAAK,IAAI;gBAAE,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;QAC9C,CAAC;QAED,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC1B,OAAO,GAAG,CACR,WAAW,CAAC,aAAa,CAAC,WAAW,EAAE,0CAA0C,CAAC,CACnF,CAAA;QACH,CAAC;QAED,IAAI,CAAC;YACH,MAAM,KAAK,GAAG,MAAM,CAAC,cAAc,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAA;YACnD,MAAM,KAAK,GAAG,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAA;YACpC,IAAI,KAAK,KAAK,KAAK;gBAAE,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAA;YAC1C,OAAO,EAAE,CAAC,KAAK,CAAC,CAAA;QAClB,CAAC;QAAC,OAAO,WAAW,EAAE,CAAC;YACrB,IAAI,CAAC;gBACH,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAA;gBACvC,IAAI,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC;oBAAE,OAAO,EAAE,CAAC,IAAI,CAAC,CAAA;gBACzC,OAAO,GAAG,CACR,WAAW,CAAC,aAAa,CAAC,WAAW,EAAE,qCAAqC,EAAE,WAAW,CAAC,CAC3F,CAAA;YACH,CAAC;YAAC,OAAO,MAAM,EAAE,CAAC;gBAChB,OAAO,GAAG,CAAC,WAAW,CAAC,aAAa,CAAC,WAAW,EAAE,0BAA0B,EAAE,MAAM,CAAC,CAAC,CAAA;YACxF,CAAC;QACH,CAAC;IACH,CAAC;IAAC,OAAO,CAAC,EAAE,CAAC;QACX,MAAM,GAAG,GAAG,CAAC,YAAY,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;QACtD,OAAO,GAAG,CAAC,WAAW,CAAC,aAAa,CAAC,WAAW,EAAE,2BAA2B,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC,CAAA;IACzF,CAAC;AACH,CAAC","sourcesContent":["/**\n * Self-hosted compat-op implementation — roof\n * (core-decouple Phase 3, §5.4; G4).\n *\n * @platform occt\n *\n * 迁移自 brepjs `operations/roofFns.ts`（含 pure-TS straightSkeleton，\n * 见同目录 straightSkeleton.ts）。适配：\n * - getEdges → kernel.getSubShapes(handle, 'edge')\n * - curveStartPoint → kernel.curvePointAtParam(edge, 0)\n * - isValidSolid → kernel.isSolid（sew 兜底路径的闭合校验近似）\n * - Result/BrepError 用 core 面；输出 Result<BrepHandle>\n * 守卫与错误码保持 brepjs：ROOF_FAILED / STRAIGHT_SKELETON_FAILED。\n */\n\nimport type { BrepHandle } from '../../brep/engine/types'\nimport { getBrepApi } from '../../brep/handle-bridge'\nimport { ok, err, type Result } from '../../result/result'\nimport { kernelError, BrepErrorCode } from '../../result/errors'\nimport type { FormClass } from '../internal/dual-form-args'\nimport { resolveArgs } from '../internal/dual-form-args'\nimport { brepHandleOf } from './brepHelpers'\nimport { computeStraightSkeleton, type SkPoint2D } from './straightSkeleton'\n\nconst ROOF_PARAMS = { name: 'roof', params: ['shape', 'options'], formClass: 'A' as FormClass }\n\n// ---------------------------------------------------------------------------\n// Helpers（照抄 brepjs roofFns.ts）\n// ---------------------------------------------------------------------------\n\nfunction extractPolygon(kernel: ReturnType<typeof getBrepApi>, wire: BrepHandle): SkPoint2D[] {\n const edges = kernel.getSubShapes(wire, 'edge')\n const pts = edges.map((e) => {\n const pt = kernel.curvePointAtParam(e, 0)\n return { x: pt.x, y: pt.y }\n })\n const first = pts[0]\n const last = pts[pts.length - 1]\n if (\n pts.length > 1 &&\n first !== undefined &&\n last !== undefined &&\n Math.abs(first.x - last.x) < 1e-10 &&\n Math.abs(first.y - last.y) < 1e-10\n ) {\n pts.pop()\n }\n return pts\n}\n\n/** Fan-triangulate a convex polygon into triangles (index triples). */\nfunction fanTriangulate(count: number): Array<[number, number, number]> {\n const tris: Array<[number, number, number]> = []\n for (let i = 1; i < count - 1; i++) {\n tris.push([0, i, i + 1])\n }\n return tris\n}\n\n/** Signed area cross product for three 2D points (positive = CCW). */\nfunction cross2d(ax: number, ay: number, bx: number, by: number, cx: number, cy: number): number {\n return (bx - ax) * (cy - ay) - (by - ay) * (cx - ax)\n}\n\n/** Check if point (px,py) is strictly inside triangle (a,b,c). */\nfunction pointInTriangle(\n px: number,\n py: number,\n ax: number,\n ay: number,\n bx: number,\n by: number,\n cx: number,\n cy: number,\n): boolean {\n const d1 = cross2d(ax, ay, bx, by, px, py)\n const d2 = cross2d(bx, by, cx, cy, px, py)\n const d3 = cross2d(cx, cy, ax, ay, px, py)\n const hasNeg = d1 < 0 || d2 < 0 || d3 < 0\n const hasPos = d1 > 0 || d2 > 0 || d3 > 0\n return !(hasNeg && hasPos)\n}\n\n/** Ear-clip triangulate a simple polygon（照抄 brepjs，含 CW→CCW 归一）。 */\nfunction earClipTriangulate(poly: SkPoint2D[]): Array<[number, number, number]> {\n const n = poly.length\n if (n < 3) return []\n if (n === 3) return [[0, 1, 2]]\n\n let area2 = 0\n for (let i = 0; i < n; i++) {\n const a = poly[i]\n const b = poly[(i + 1) % n]\n if (a && b) area2 += a.x * b.y - b.x * a.y\n }\n if (area2 < 0) {\n const tris = earClipTriangulate([...poly].reverse())\n return tris.map(([a, b, c]) => [n - 1 - a, n - 1 - b, n - 1 - c])\n }\n\n const tris: Array<[number, number, number]> = []\n const idx = poly.map((_, i) => i)\n const isEar = (prev: number, curr: number, next: number): boolean => {\n const a = poly[prev]\n const b = poly[curr]\n const c = poly[next]\n if (!a || !b || !c) return false\n if (cross2d(a.x, a.y, b.x, b.y, c.x, c.y) <= 0) return false\n for (let j = 0; j < n; j++) {\n const p = poly[j]\n if (!p || j === prev || j === curr || j === next) continue\n if (pointInTriangle(p.x, p.y, a.x, a.y, b.x, b.y, c.x, c.y)) return false\n }\n return true\n }\n\n while (idx.length > 3) {\n let clipped = false\n for (let i = 0; i < idx.length; i++) {\n const prev = idx[(i - 1 + idx.length) % idx.length]\n const curr = idx[i]\n const next = idx[(i + 1) % idx.length]\n if (prev === undefined || curr === undefined || next === undefined) continue\n if (isEar(prev, curr, next)) {\n tris.push([prev, curr, next])\n idx.splice(i, 1)\n clipped = true\n break\n }\n }\n if (!clipped) break\n }\n if (idx.length === 3) {\n const [a, b, c] = idx\n if (a !== undefined && b !== undefined && c !== undefined) tris.push([a, b, c])\n }\n return tris\n}\n\n/** Convert skeleton faces into 3D triangular kernel faces（照抄 brepjs）。 */\nfunction buildSkeletonTriFaces(\n skeleton: { faces: Array<{ vertices: SkPoint2D[]; heights: number[] }> },\n tanAngle: number,\n kernel: ReturnType<typeof getBrepApi>,\n): BrepHandle[] {\n const triFaces: BrepHandle[] = []\n for (const skFace of skeleton.faces) {\n const verts3d: Array<[number, number, number]> = skFace.vertices.map(\n (v: SkPoint2D, i: number): [number, number, number] => [\n v.x,\n v.y,\n (skFace.heights[i] ?? 0) * tanAngle,\n ],\n )\n\n const tris = fanTriangulate(verts3d.length)\n\n for (const [ai, bi, ci] of tris) {\n const va = verts3d[ai]\n const vb = verts3d[bi]\n const vc = verts3d[ci]\n if (!va || !vb || !vc) continue\n\n const abx = vb[0] - va[0]\n const aby = vb[1] - va[1]\n const abz = vb[2] - va[2]\n const acx = vc[0] - va[0]\n const acy = vc[1] - va[1]\n const acz = vc[2] - va[2]\n const nx = aby * acz - abz * acy\n const ny = abz * acx - abx * acz\n const nz = abx * acy - aby * acx\n const areaSq = nx * nx + ny * ny + nz * nz\n if (areaSq < 1e-20) continue\n\n const triFace = kernel.buildTriFace({ x: va[0], y: va[1], z: va[2] }, { x: vb[0], y: vb[1], z: vb[2] }, { x: vc[0], y: vc[1], z: vc[2] })\n if (triFace !== null) triFaces.push(triFace)\n }\n }\n return triFaces\n}\n\n// ---------------------------------------------------------------------------\n// roof — 平面 wire → 直骨架屋顶实体（brepjs roofFns.ts#roof）\n// ---------------------------------------------------------------------------\n\n/**\n * Roof — planar wire to straight-skeleton roof solid (brepjs roofFns.ts#roof).\n *\n * @param args - Resolved arguments (wire, roof options).\n * @returns The generated roof solid as a `BrepHandle`.\n */\nexport function roofBrep(...args: unknown[]): Result<BrepHandle> {\n const [shape, options] = resolveArgs(args, ROOF_PARAMS)\n const kernel = getBrepApi()\n const wire = brepHandleOf(shape)\n const angle = ((options as { angle?: number } | undefined)?.angle ?? 45) * (Math.PI / 180)\n const tanAngle = Math.tan(angle)\n\n try {\n const polygon = extractPolygon(kernel, wire)\n if (polygon.length < 3) {\n return err(\n kernelError(BrepErrorCode.ROOF_FAILED, 'Wire must have at least 3 edges for roof generation'),\n )\n }\n\n const skeletonResult = computeStraightSkeleton(polygon)\n if (!skeletonResult.ok) return skeletonResult\n const skeleton = skeletonResult.value\n if (skeleton.faces.length === 0) {\n return err(\n kernelError(BrepErrorCode.ROOF_FAILED, 'Straight skeleton computation produced no faces'),\n )\n }\n\n const triFaces: BrepHandle[] = buildSkeletonTriFaces(skeleton, tanAngle, kernel)\n\n // Bottom face（z=0，ear-clip 支持凹多边形）\n for (const [ai, bi, ci] of earClipTriangulate(polygon)) {\n const pa = polygon[ai]\n const pb = polygon[bi]\n const pc = polygon[ci]\n if (!pa || !pb || !pc) continue\n const va: [number, number, number] = [pa.x, pa.y, 0]\n const vb: [number, number, number] = [pb.x, pb.y, 0]\n const vc: [number, number, number] = [pc.x, pc.y, 0]\n const triFace = kernel.buildTriFace({ x: va[0], y: va[1], z: va[2] }, { x: vc[0], y: vc[1], z: vc[2] }, { x: vb[0], y: vb[1], z: vb[2] })\n if (triFace !== null) triFaces.push(triFace)\n }\n\n if (triFaces.length === 0) {\n return err(\n kernelError(BrepErrorCode.ROOF_FAILED, 'No valid triangular faces could be built'),\n )\n }\n\n try {\n const solid = kernel.sewAndSolidify(triFaces, 1e-6)\n const fixed = kernel.fixShape(solid)\n if (fixed !== solid) kernel.release(solid)\n return ok(fixed)\n } catch (solidifyErr) {\n try {\n const sewn = kernel.sew(triFaces, 1e-6)\n if (kernel.isSolid(sewn)) return ok(sewn)\n return err(\n kernelError(BrepErrorCode.ROOF_FAILED, 'Sew fallback produced invalid solid', solidifyErr),\n )\n } catch (sewErr) {\n return err(kernelError(BrepErrorCode.ROOF_FAILED, 'Failed to sew roof faces', sewErr))\n }\n }\n } catch (e) {\n const raw = e instanceof Error ? e.message : String(e)\n return err(kernelError(BrepErrorCode.ROOF_FAILED, `Roof generation failed: ${raw}`, e))\n }\n}\n"]}

package/dist/api/brep-mirror/straightSkeleton.d.ts DELETED Viewed

@@ -1,36 +0,0 @@
-/**
- * Pure TypeScript straight skeleton algorithm for simple polygons.
- * No kernel dependency — operates on 2D point arrays.
- */
-import type { Result } from '../../result/result.js';
-/** A 2D polygon point used as skeleton input. */
-export interface SkPoint2D {
-    readonly x: number;
-    readonly y: number;
-}
-/** A skeleton node: 2D position plus elevation height. */
-export interface SkeletonNode {
-    readonly x: number;
-    readonly y: number;
-    readonly height: number;
-}
-/** A skeleton face: its vertex loop with the matching per-vertex heights. */
-export interface SkeletonFace {
-    readonly vertices: SkPoint2D[];
-    readonly heights: number[];
-}
-/** A complete straight skeleton: nodes and faces. */
-export interface StraightSkeleton {
-    readonly nodes: SkeletonNode[];
-    readonly faces: SkeletonFace[];
-}
-/**
- * Compute the straight skeleton of a simple polygon.
- * The polygon vertices must define a simple (non-self-intersecting) polygon.
- * They will be reordered to CCW if necessary.
- *
- * @param polygon - The input polygon vertices.
- * @returns The computed straight skeleton.
- */
-export declare function computeStraightSkeleton(polygon: SkPoint2D[]): Result<StraightSkeleton>;
-//# sourceMappingURL=straightSkeleton.d.ts.map

package/dist/api/brep-mirror/straightSkeleton.d.ts.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"straightSkeleton.d.ts","sourceRoot":"","sources":["../../../src/api/brep-mirror/straightSkeleton.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,qBAAqB,CAAA;AAQjD,iDAAiD;AACjD,MAAM,WAAW,SAAS;IACxB,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;IACnB,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;CACpB;AAED,0DAA0D;AAC1D,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;IACnB,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;IACnB,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;CACzB;AAED,6EAA6E;AAC7E,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,QAAQ,EAAE,SAAS,EAAE,CAAC;IAC/B,QAAQ,CAAC,OAAO,EAAE,MAAM,EAAE,CAAC;CAC5B;AAED,qDAAqD;AACrD,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,KAAK,EAAE,YAAY,EAAE,CAAC;IAC/B,QAAQ,CAAC,KAAK,EAAE,YAAY,EAAE,CAAC;CAChC;AAiRD;;;;;;;GAOG;AACH,wBAAgB,uBAAuB,CAAC,OAAO,EAAE,SAAS,EAAE,GAAG,MAAM,CAAC,gBAAgB,CAAC,CAgBtF"}

package/dist/api/brep-mirror/straightSkeleton.js DELETED Viewed

@@ -1,443 +0,0 @@
-/**
- * Pure TypeScript straight skeleton algorithm for simple polygons.
- * No kernel dependency — operates on 2D point arrays.
- */
-import { ok, err } from '../../result/result.js';
-import { computationError, BrepErrorCode } from '../../result/errors.js';
-// ---------------------------------------------------------------------------
-// Geometry helpers
-// ---------------------------------------------------------------------------
-const EPS = 1e-10;
-function cross2(ax, ay, bx, by) {
-    return ax * by - ay * bx;
-}
-function dot2(ax, ay, bx, by) {
-    return ax * bx + ay * by;
-}
-function len2(x, y) {
-    return Math.sqrt(x * x + y * y);
-}
-/** Safe polygon access with modular index. */
-function polyAt(poly, i) {
-    const idx = ((i % poly.length) + poly.length) % poly.length;
-    const p = poly[idx];
-    if (!p)
-        throw new Error(`Invalid polygon index ${i} for length ${poly.length}`);
-    return p;
-}
-/** Ensure polygon is in CCW order. Returns a new array if reversed. */
-function ensureCCW(poly) {
-    let area = 0;
-    for (let i = 0; i < poly.length; i++) {
-        const cur = polyAt(poly, i);
-        const nxt = polyAt(poly, i + 1);
-        area += cur.x * nxt.y - nxt.x * cur.y;
-    }
-    if (area < 0)
-        return [...poly].reverse();
-    return poly;
-}
-/** Compute unit bisector direction pointing inward for vertex at index i. */
-function bisector(poly, i) {
-    const prev = polyAt(poly, i - 1);
-    const cur = polyAt(poly, i);
-    const next = polyAt(poly, i + 1);
-    const e1x = cur.x - prev.x;
-    const e1y = cur.y - prev.y;
-    const e1l = len2(e1x, e1y);
-    const e2x = next.x - cur.x;
-    const e2y = next.y - cur.y;
-    const e2l = len2(e2x, e2y);
-    if (e1l < EPS || e2l < EPS)
-        return { dx: 0, dy: 0 };
-    const n1x = -e1y / e1l;
-    const n1y = e1x / e1l;
-    const n2x = -e2y / e2l;
-    const n2y = e2x / e2l;
-    let bx = n1x + n2x;
-    let by = n1y + n2y;
-    const bl = len2(bx, by);
-    if (bl < EPS) {
-        return { dx: n1x, dy: n1y };
-    }
-    bx /= bl;
-    by /= bl;
-    const cosHalf = dot2(bx, by, n1x, n1y);
-    const speed = Math.abs(cosHalf) > EPS ? 1.0 / cosHalf : 1.0;
-    return { dx: bx * speed, dy: by * speed };
-}
-/** Is a LAV node reflex based on current LAV positions? */
-function isLavNodeReflex(node) {
-    if (!node.prev || !node.next)
-        return false;
-    return (cross2(node.x - node.prev.x, node.y - node.prev.y, node.next.x - node.x, node.next.y - node.y) <
-        -EPS);
-}
-function createLav(poly) {
-    const nodes = poly.map((p, i) => {
-        const b = bisector(poly, i);
-        return {
-            x: p.x,
-            y: p.y,
-            bx: b.dx,
-            by: b.dy,
-            origIdx: i,
-            prev: null,
-            next: null,
-            active: true,
-        };
-    });
-    for (let i = 0; i < nodes.length; i++) {
-        const node = nodes[i];
-        const prevNode = nodes[(i - 1 + nodes.length) % nodes.length];
-        const nextNode = nodes[(i + 1) % nodes.length];
-        if (node && prevNode && nextNode) {
-            node.prev = prevNode;
-            node.next = nextNode;
-        }
-    }
-    return nodes;
-}
-/** Deactivate a chain of nodes starting from `start`. */
-function deactivateNodes(start, count) {
-    let cur = start;
-    for (let i = 0; i < count; i++) {
-        if (!cur)
-            break;
-        cur.active = false;
-        cur = cur.next;
-    }
-}
-/** Count active nodes reachable from a starting node. */
-function lavSize(start) {
-    let count = 1;
-    // eslint-disable-next-line @typescript-eslint/no-non-null-assertion -- circular linked list: prev/next non-null after construction
-    let cur = start.next;
-    while (cur !== start) {
-        count++;
-        // eslint-disable-next-line @typescript-eslint/no-non-null-assertion -- circular linked list traversal
-        cur = cur.next;
-        if (count > 10000)
-            break;
-    }
-    return count;
-}
-/** Time at which two moving bisectors from nodeA and nodeB intersect. */
-function bisectorIntersectTime(a, b) {
-    const ddx = a.bx - b.bx;
-    const ddy = a.by - b.by;
-    const dxp = b.x - a.x;
-    const dyp = b.y - a.y;
-    if (Math.abs(ddx) < EPS && Math.abs(ddy) < EPS)
-        return null;
-    let t;
-    if (Math.abs(ddx) > Math.abs(ddy)) {
-        t = dxp / ddx;
-    }
-    else {
-        t = dyp / ddy;
-    }
-    if (t < EPS)
-        return null;
-    // Verify the other equation
-    const otherDd = Math.abs(ddx) > Math.abs(ddy) ? ddy : ddx;
-    const otherDp = Math.abs(ddx) > Math.abs(ddy) ? dyp : dxp;
-    if (Math.abs(otherDd) > EPS) {
-        const t2 = otherDp / otherDd;
-        if (Math.abs(t - t2) > 1e-4 * Math.max(1, Math.abs(t)))
-            return null;
-    }
-    return t;
-}
-/** Compute ray-segment intersection time for split events. */
-function raySplitTime(node, eA, eB) {
-    const edx = eB.x - eA.x;
-    const edy = eB.y - eA.y;
-    const el = len2(edx, edy);
-    if (el < EPS)
-        return null;
-    const enx = -edy / el;
-    const eny = edx / el;
-    const d0 = (node.x - eA.x) * enx + (node.y - eA.y) * eny;
-    const relBx = node.bx - (eA.bx + eB.bx) / 2;
-    const relBy = node.by - (eA.by + eB.by) / 2;
-    const dRate = relBx * enx + relBy * eny;
-    if (Math.abs(dRate) < EPS)
-        return null;
-    const t = -d0 / dRate;
-    if (t < EPS)
-        return null;
-    const px = node.x + t * node.bx;
-    const py = node.y + t * node.by;
-    const ax = eA.x + t * eA.bx;
-    const ay = eA.y + t * eA.by;
-    const bxx = eB.x + t * eB.bx;
-    const byy = eB.y + t * eB.by;
-    const segDx = bxx - ax;
-    const segDy = byy - ay;
-    const segL = len2(segDx, segDy);
-    if (segL < EPS)
-        return t;
-    const s = dot2(px - ax, py - ay, segDx, segDy) / (segL * segL);
-    if (s < -0.01 || s > 1.01)
-        return null;
-    return t;
-}
-function computeEvents(lavNodes) {
-    const events = [];
-    for (const node of lavNodes) {
-        if (!node.active || !node.next)
-            continue;
-        const t = bisectorIntersectTime(node, node.next);
-        if (t !== null && t > EPS) {
-            const x = node.x + t * node.bx;
-            const y = node.y + t * node.by;
-            events.push({ time: t, x, y, nodeA: node, nodeB: node.next, type: 'edge' });
-        }
-        if (isLavNodeReflex(node)) {
-            // eslint-disable-next-line @typescript-eslint/no-non-null-assertion -- circular linked list traversal
-            let cur = node.next.next;
-            let count = 0;
-            while (cur !== node.prev && cur !== node && count < 1000) {
-                // eslint-disable-next-line @typescript-eslint/no-non-null-assertion -- circular linked list traversal
-                const st = raySplitTime(node, cur, cur.next);
-                if (st !== null && st > EPS) {
-                    const x = node.x + st * node.bx;
-                    const y = node.y + st * node.by;
-                    events.push({ time: st, x, y, nodeA: node, nodeB: cur, type: 'split' });
-                }
-                // eslint-disable-next-line @typescript-eslint/no-non-null-assertion -- circular linked list traversal
-                cur = cur.next;
-                count++;
-            }
-        }
-    }
-    events.sort((a, b) => a.time - b.time);
-    return events;
-}
-// ---------------------------------------------------------------------------
-// Main algorithm
-// ---------------------------------------------------------------------------
-/**
- * Compute the straight skeleton of a simple polygon.
- * The polygon vertices must define a simple (non-self-intersecting) polygon.
- * They will be reordered to CCW if necessary.
- *
- * @param polygon - The input polygon vertices.
- * @returns The computed straight skeleton.
- */
-export function computeStraightSkeleton(polygon) {
-    if (polygon.length < 3) {
-        return ok({ nodes: [], faces: [] });
-    }
-    try {
-        return ok(computeStraightSkeletonImpl(polygon));
-    }
-    catch (e) {
-        return err(computationError(BrepErrorCode.STRAIGHT_SKELETON_FAILED, e instanceof Error ? e.message : String(e), e));
-    }
-}
-/** Internal implementation — may throw on degenerate polygon indices. */
-function computeStraightSkeletonImpl(polygon) {
-    const poly = ensureCCW(polygon);
-    const n = poly.length;
-    const skeletonNodes = [];
-    const vertexToSkelNodes = Array.from({ length: n }, () => []);
-    const lavNodes = createLav(poly);
-    let iterations = 0;
-    const maxIter = n * n * 2;
-    while (iterations < maxIter) {
-        iterations++;
-        const activeStart = lavNodes.find((nd) => nd.active);
-        if (!activeStart)
-            break;
-        const sz = lavSize(activeStart);
-        if (sz <= 3) {
-            if (sz === 3) {
-                const a = activeStart;
-                // eslint-disable-next-line @typescript-eslint/no-non-null-assertion -- circular linked list: 3-node LAV guaranteed non-null
-                const b = a.next;
-                // eslint-disable-next-line @typescript-eslint/no-non-null-assertion -- circular linked list: 3-node LAV guaranteed non-null
-                const c = b.next;
-                const t = bisectorIntersectTime(a, b);
-                const time = t !== null && t > EPS ? t : 0;
-                const mx = (a.x + b.x + c.x) / 3 + (time * (a.bx + b.bx + c.bx)) / 3;
-                const my = (a.y + b.y + c.y) / 3 + (time * (a.by + b.by + c.by)) / 3;
-                const nodeIdx = skeletonNodes.length;
-                skeletonNodes.push({ x: mx, y: my, height: time });
-                const aNodes = vertexToSkelNodes[a.origIdx];
-                const bNodes = vertexToSkelNodes[b.origIdx];
-                const cNodes = vertexToSkelNodes[c.origIdx];
-                if (aNodes)
-                    aNodes.push(nodeIdx);
-                if (bNodes)
-                    bNodes.push(nodeIdx);
-                if (cNodes)
-                    cNodes.push(nodeIdx);
-                a.active = false;
-                b.active = false;
-                c.active = false;
-            }
-            else {
-                deactivateNodes(activeStart, sz);
-            }
-            continue;
-        }
-        const activeNodes = lavNodes.filter((nd) => nd.active);
-        const events = computeEvents(activeNodes);
-        if (events.length === 0) {
-            for (const nd of activeNodes) {
-                nd.active = false;
-            }
-            break;
-        }
-        const ev = events[0];
-        if (!ev)
-            break;
-        if (ev.type === 'edge') {
-            const a = ev.nodeA;
-            const b = ev.nodeB;
-            if (!a.active || !b.active)
-                continue;
-            const nodeIdx = skeletonNodes.length;
-            skeletonNodes.push({ x: ev.x, y: ev.y, height: ev.time });
-            const aNodes = vertexToSkelNodes[a.origIdx];
-            const bNodes = vertexToSkelNodes[b.origIdx];
-            if (aNodes)
-                aNodes.push(nodeIdx);
-            if (bNodes)
-                bNodes.push(nodeIdx);
-            a.x = ev.x;
-            a.y = ev.y;
-            a.next = b.next;
-            // eslint-disable-next-line @typescript-eslint/no-non-null-assertion -- circular linked list: b.next non-null in active LAV
-            b.next.prev = a;
-            b.active = false;
-            const lavPoly = [];
-            let cur = a;
-            do {
-                lavPoly.push({ x: cur.x, y: cur.y });
-                // eslint-disable-next-line @typescript-eslint/no-non-null-assertion -- circular linked list traversal
-                cur = cur.next;
-            } while (cur !== a);
-            const bDir = bisector(lavPoly, 0);
-            a.bx = bDir.dx;
-            a.by = bDir.dy;
-        }
-        else {
-            // Split event: reflex vertex `a` reaches opposite edge (nodeB, nodeB.next)
-            // Must split the LAV into two independent sub-LAVs
-            const a = ev.nodeA;
-            const b = ev.nodeB; // start of the opposite edge
-            if (!a.active || !b.active)
-                continue;
-            const nodeIdx = skeletonNodes.length;
-            skeletonNodes.push({ x: ev.x, y: ev.y, height: ev.time });
-            const aNodes = vertexToSkelNodes[a.origIdx];
-            if (aNodes)
-                aNodes.push(nodeIdx);
-            const bNodes = vertexToSkelNodes[b.origIdx];
-            if (bNodes)
-                bNodes.push(nodeIdx);
-            // Create a copy of `a` at the split point for the second sub-LAV
-            const aCopy = {
-                x: ev.x,
-                y: ev.y,
-                bx: 0,
-                by: 0,
-                origIdx: a.origIdx,
-                prev: null,
-                next: null,
-                active: true,
-            };
-            lavNodes.push(aCopy);
-            // Move `a` to the split point
-            a.x = ev.x;
-            a.y = ev.y;
-            // Rewire: LAV 1 runs a -> b.next -> ... -> a.prev -> a
-            // Rewire: LAV 2 runs aCopy -> a.next -> ... -> b -> aCopy
-            // eslint-disable-next-line @typescript-eslint/no-non-null-assertion -- circular linked list: active nodes have non-null prev/next
-            const aNext = a.next;
-            // eslint-disable-next-line @typescript-eslint/no-non-null-assertion -- circular linked list: active nodes have non-null prev/next
-            const bNext = b.next;
-            // LAV 1: a connects to b.next on the forward side
-            a.next = bNext;
-            bNext.prev = a;
-            // LAV 2: aCopy connects to a's old next on the forward side, b on the back
-            aCopy.next = aNext;
-            aNext.prev = aCopy;
-            aCopy.prev = b;
-            b.next = aCopy;
-            // Recompute bisectors for both split-point nodes
-            const buildLavPoly = (start) => {
-                const poly = [];
-                let c = start;
-                do {
-                    poly.push({ x: c.x, y: c.y });
-                    // eslint-disable-next-line @typescript-eslint/no-non-null-assertion -- circular linked list traversal
-                    c = c.next;
-                } while (c !== start);
-                return poly;
-            };
-            const lav1Poly = buildLavPoly(a);
-            const bDir1 = bisector(lav1Poly, 0);
-            a.bx = bDir1.dx;
-            a.by = bDir1.dy;
-            const lav2Poly = buildLavPoly(aCopy);
-            const bDir2 = bisector(lav2Poly, 0);
-            aCopy.bx = bDir2.dx;
-            aCopy.by = bDir2.dy;
-        }
-    }
-    // Build faces: one face per original edge
-    const faces = [];
-    for (let i = 0; i < n; i++) {
-        const j = (i + 1) % n;
-        const pi = polyAt(poly, i);
-        const pj = polyAt(poly, j);
-        const faceVerts = [pi, pj];
-        const faceHeights = [0, 0];
-        const jNodes = vertexToSkelNodes[j];
-        const iNodes = vertexToSkelNodes[i];
-        if (jNodes) {
-            for (const ni of jNodes) {
-                const sn = skeletonNodes[ni];
-                if (sn) {
-                    faceVerts.push({ x: sn.x, y: sn.y });
-                    faceHeights.push(sn.height);
-                }
-            }
-        }
-        if (iNodes) {
-            for (let k = iNodes.length - 1; k >= 0; k--) {
-                const idx = iNodes[k];
-                if (idx === undefined)
-                    continue;
-                const sn = skeletonNodes[idx];
-                if (!sn)
-                    continue;
-                const lastVert = faceVerts[faceVerts.length - 1];
-                if (!lastVert)
-                    continue;
-                const dist = len2(sn.x - lastVert.x, sn.y - lastVert.y);
-                if (dist > EPS) {
-                    faceVerts.push({ x: sn.x, y: sn.y });
-                    faceHeights.push(sn.height);
-                }
-            }
-        }
-        if (faceVerts.length >= 3) {
-            faces.push({ vertices: faceVerts, heights: faceHeights });
-        }
-    }
-    // Deduplicate skeleton nodes
-    const uniqueNodes = [];
-    for (const sn of skeletonNodes) {
-        const exists = uniqueNodes.some((un) => Math.abs(un.x - sn.x) < 0.01 && Math.abs(un.y - sn.y) < 0.01);
-        if (!exists) {
-            uniqueNodes.push(sn);
-        }
-    }
-    return { nodes: uniqueNodes, faces };
-}
-//# sourceMappingURL=straightSkeleton.js.map

package/dist/api/brep-mirror/straightSkeleton.js.map DELETED Viewed

@@ -1 +0,0 @@

- {"version":3,"file":"straightSkeleton.js","sourceRoot":"","sources":["../../../src/api/brep-mirror/straightSkeleton.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAGH,OAAO,EAAE,EAAE,EAAE,GAAG,EAAE,MAAM,qBAAqB,CAAA;AAC7C,OAAO,EAAE,gBAAgB,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAA;AA+BrE,8EAA8E;AAC9E,mBAAmB;AACnB,8EAA8E;AAE9E,MAAM,GAAG,GAAG,KAAK,CAAC;AAElB,SAAS,MAAM,CAAC,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU;IAC5D,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;AAC3B,CAAC;AAED,SAAS,IAAI,CAAC,EAAU,EAAE,EAAU,EAAE,EAAU,EAAE,EAAU;IAC1D,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC;AAC3B,CAAC;AAED,SAAS,IAAI,CAAC,CAAS,EAAE,CAAS;IAChC,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;AAClC,CAAC;AAED,8CAA8C;AAC9C,SAAS,MAAM,CAAC,IAAiB,EAAE,CAAS;IAC1C,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;IAC5D,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC;IACpB,IAAI,CAAC,CAAC;QAAE,MAAM,IAAI,KAAK,CAAC,yBAAyB,CAAC,eAAe,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;IAChF,OAAO,CAAC,CAAC;AACX,CAAC;AAED,uEAAuE;AACvE,SAAS,SAAS,CAAC,IAAiB;IAClC,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,MAAM,GAAG,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAC5B,MAAM,GAAG,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QAChC,IAAI,IAAI,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;IACxC,CAAC;IACD,IAAI,IAAI,GAAG,CAAC;QAAE,OAAO,CAAC,GAAG,IAAI,CAAC,CAAC,OAAO,EAAE,CAAC;IACzC,OAAO,IAAI,CAAC;AACd,CAAC;AAED,6EAA6E;AAC7E,SAAS,QAAQ,CAAC,IAAiB,EAAE,CAAS;IAC5C,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;IACjC,MAAM,GAAG,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IAC5B,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;IAEjC,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;IAC3B,MAAM,GAAG,GAAG,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;IAC3B,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IAC3B,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;IAC3B,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;IAC3B,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IAE3B,IAAI,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG;QAAE,OAAO,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC;IAEpD,MAAM,GAAG,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC;IACvB,MAAM,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;IACtB,MAAM,GAAG,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC;IACvB,MAAM,GAAG,GAAG,GAAG,GAAG,GAAG,CAAC;IAEtB,IAAI,EAAE,GAAG,GAAG,GAAG,GAAG,CAAC;IACnB,IAAI,EAAE,GAAG,GAAG,GAAG,GAAG,CAAC;IACnB,MAAM,EAAE,GAAG,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAExB,IAAI,EAAE,GAAG,GAAG,EAAE,CAAC;QACb,OAAO,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,CAAC;IAC9B,CAAC;IAED,EAAE,IAAI,EAAE,CAAC;IACT,EAAE,IAAI,EAAE,CAAC;IAET,MAAM,OAAO,GAAG,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;IACvC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC;IAE5D,OAAO,EAAE,EAAE,EAAE,EAAE,GAAG,KAAK,EAAE,EAAE,EAAE,EAAE,GAAG,KAAK,EAAE,CAAC;AAC5C,CAAC;AAiBD,2DAA2D;AAC3D,SAAS,eAAe,CAAC,IAAa;IACpC,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI;QAAE,OAAO,KAAK,CAAC;IAC3C,OAAO,CACL,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;QAC9F,CAAC,GAAG,CACL,CAAC;AACJ,CAAC;AAED,SAAS,SAAS,CAAC,IAAiB;IAClC,MAAM,KAAK,GAAc,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACzC,MAAM,CAAC,GAAG,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAC5B,OAAO;YACL,CAAC,EAAE,CAAC,CAAC,CAAC;YACN,CAAC,EAAE,CAAC,CAAC,CAAC;YACN,EAAE,EAAE,CAAC,CAAC,EAAE;YACR,EAAE,EAAE,CAAC,CAAC,EAAE;YACR,OAAO,EAAE,CAAC;YACV,IAAI,EAAE,IAAI;YACV,IAAI,EAAE,IAAI;YACV,MAAM,EAAE,IAAI;SACb,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACtB,MAAM,QAAQ,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC;QAC9D,MAAM,QAAQ,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC;QAC/C,IAAI,IAAI,IAAI,QAAQ,IAAI,QAAQ,EAAE,CAAC;YACjC,IAAI,CAAC,IAAI,GAAG,QAAQ,CAAC;YACrB,IAAI,CAAC,IAAI,GAAG,QAAQ,CAAC;QACvB,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED,yDAAyD;AACzD,SAAS,eAAe,CAAC,KAAqB,EAAE,KAAa;IAC3D,IAAI,GAAG,GAAG,KAAK,CAAC;IAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/B,IAAI,CAAC,GAAG;YAAE,MAAM;QAChB,GAAG,CAAC,MAAM,GAAG,KAAK,CAAC;QACnB,GAAG,GAAG,GAAG,CAAC,IAAI,CAAC;IACjB,CAAC;AACH,CAAC;AAED,yDAAyD;AACzD,SAAS,OAAO,CAAC,KAAc;IAC7B,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,mIAAmI;IACnI,IAAI,GAAG,GAAG,KAAK,CAAC,IAAK,CAAC;IACtB,OAAO,GAAG,KAAK,KAAK,EAAE,CAAC;QACrB,KAAK,EAAE,CAAC;QACR,sGAAsG;QACtG,GAAG,GAAG,GAAG,CAAC,IAAK,CAAC;QAChB,IAAI,KAAK,GAAG,KAAK;YAAE,MAAM;IAC3B,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAeD,yEAAyE;AACzE,SAAS,qBAAqB,CAAC,CAAU,EAAE,CAAU;IACnD,MAAM,GAAG,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC;IACxB,MAAM,GAAG,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC;IACxB,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACtB,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAEtB,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,GAAG,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,GAAG;QAAE,OAAO,IAAI,CAAC;IAE5D,IAAI,CAAS,CAAC;IACd,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;QAClC,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC;IAChB,CAAC;SAAM,CAAC;QACN,CAAC,GAAG,GAAG,GAAG,GAAG,CAAC;IAChB,CAAC;IAED,IAAI,CAAC,GAAG,GAAG;QAAE,OAAO,IAAI,CAAC;IAEzB,4BAA4B;IAC5B,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;IAC1D,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;IAC1D,IAAI,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,GAAG,EAAE,CAAC;QAC5B,MAAM,EAAE,GAAG,OAAO,GAAG,OAAO,CAAC;QAC7B,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAAE,OAAO,IAAI,CAAC;IACtE,CAAC;IAED,OAAO,CAAC,CAAC;AACX,CAAC;AAED,8DAA8D;AAC9D,SAAS,YAAY,CAAC,IAAa,EAAE,EAAW,EAAE,EAAW;IAC3D,MAAM,GAAG,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IACxB,MAAM,GAAG,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IACxB,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IAC1B,IAAI,EAAE,GAAG,GAAG;QAAE,OAAO,IAAI,CAAC;IAE1B,MAAM,GAAG,GAAG,CAAC,GAAG,GAAG,EAAE,CAAC;IACtB,MAAM,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC;IAErB,MAAM,EAAE,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;IACzD,MAAM,KAAK,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;IAC5C,MAAM,KAAK,GAAG,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;IAC5C,MAAM,KAAK,GAAG,KAAK,GAAG,GAAG,GAAG,KAAK,GAAG,GAAG,CAAC;IAExC,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,GAAG;QAAE,OAAO,IAAI,CAAC;IAEvC,MAAM,CAAC,GAAG,CAAC,EAAE,GAAG,KAAK,CAAC;IACtB,IAAI,CAAC,GAAG,GAAG;QAAE,OAAO,IAAI,CAAC;IAEzB,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC;IAChC,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC;IAChC,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC;IAC5B,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC;IAC5B,MAAM,GAAG,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC;IAC7B,MAAM,GAAG,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC;IAE7B,MAAM,KAAK,GAAG,GAAG,GAAG,EAAE,CAAC;IACvB,MAAM,KAAK,GAAG,GAAG,GAAG,EAAE,CAAC;IACvB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IAChC,IAAI,IAAI,GAAG,GAAG;QAAE,OAAO,CAAC,CAAC;IAEzB,MAAM,CAAC,GAAG,IAAI,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC;IAC/D,IAAI,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,GAAG,IAAI;QAAE,OAAO,IAAI,CAAC;IAEvC,OAAO,CAAC,CAAC;AACX,CAAC;AAED,SAAS,aAAa,CAAC,QAAmB;IACxC,MAAM,MAAM,GAAc,EAAE,CAAC;IAE7B,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;QAC5B,IAAI,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,IAAI;YAAE,SAAS;QAEzC,MAAM,CAAC,GAAG,qBAAqB,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QACjD,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,GAAG,GAAG,EAAE,CAAC;YAC1B,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC;YAC/B,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC;YAC/B,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC;QAC9E,CAAC;QAED,IAAI,eAAe,CAAC,IAAI,CAAC,EAAE,CAAC;YAC1B,sGAAsG;YACtG,IAAI,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,IAAK,CAAC;YAC1B,IAAI,KAAK,GAAG,CAAC,CAAC;YACd,OAAO,GAAG,KAAK,IAAI,CAAC,IAAI,IAAI,GAAG,KAAK,IAAI,IAAI,KAAK,GAAG,IAAI,EAAE,CAAC;gBACzD,sGAAsG;gBACtG,MAAM,EAAE,GAAG,YAAY,CAAC,IAAI,EAAE,GAAG,EAAE,GAAG,CAAC,IAAK,CAAC,CAAC;gBAC9C,IAAI,EAAE,KAAK,IAAI,IAAI,EAAE,GAAG,GAAG,EAAE,CAAC;oBAC5B,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC;oBAChC,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC;oBAChC,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC;gBAC1E,CAAC;gBACD,sGAAsG;gBACtG,GAAG,GAAG,GAAG,CAAC,IAAK,CAAC;gBAChB,KAAK,EAAE,CAAC;YACV,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;IACvC,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,8EAA8E;AAC9E,iBAAiB;AACjB,8EAA8E;AAE9E;;;;;;;GAOG;AACH,MAAM,UAAU,uBAAuB,CAAC,OAAoB;IAC1D,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACvB,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,CAAC;IACtC,CAAC;IAED,IAAI,CAAC;QACH,OAAO,EAAE,CAAC,2BAA2B,CAAC,OAAO,CAAC,CAAC,CAAC;IAClD,CAAC;IAAC,OAAO,CAAU,EAAE,CAAC;QACpB,OAAO,GAAG,CACR,gBAAgB,CACd,aAAa,CAAC,wBAAwB,EACtC,CAAC,YAAY,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAC1C,CAAC,CACF,CACF,CAAC;IACJ,CAAC;AACH,CAAC;AAED,yEAAyE;AACzE,SAAS,2BAA2B,CAAC,OAAoB;IACvD,MAAM,IAAI,GAAG,SAAS,CAAC,OAAO,CAAC,CAAC;IAChC,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;IAEtB,MAAM,aAAa,GAAmB,EAAE,CAAC;IACzC,MAAM,iBAAiB,GAAe,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;IAE1E,MAAM,QAAQ,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;IACjC,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,MAAM,OAAO,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAE1B,OAAO,UAAU,GAAG,OAAO,EAAE,CAAC;QAC5B,UAAU,EAAE,CAAC;QAEb,MAAM,WAAW,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC;QACrD,IAAI,CAAC,WAAW;YAAE,MAAM;QAExB,MAAM,EAAE,GAAG,OAAO,CAAC,WAAW,CAAC,CAAC;QAChC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC;YACZ,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;gBACb,MAAM,CAAC,GAAG,WAAW,CAAC;gBACtB,4HAA4H;gBAC5H,MAAM,CAAC,GAAG,CAAC,CAAC,IAAK,CAAC;gBAClB,4HAA4H;gBAC5H,MAAM,CAAC,GAAG,CAAC,CAAC,IAAK,CAAC;gBAElB,MAAM,CAAC,GAAG,qBAAqB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACtC,MAAM,IAAI,GAAG,CAAC,KAAK,IAAI,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC3C,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;gBACrE,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;gBAErE,MAAM,OAAO,GAAG,aAAa,CAAC,MAAM,CAAC;gBACrC,aAAa,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC;gBAEnD,MAAM,MAAM,GAAG,iBAAiB,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;gBAC5C,MAAM,MAAM,GAAG,iBAAiB,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;gBAC5C,MAAM,MAAM,GAAG,iBAAiB,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;gBAC5C,IAAI,MAAM;oBAAE,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBACjC,IAAI,MAAM;oBAAE,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBACjC,IAAI,MAAM;oBAAE,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBAEjC,CAAC,CAAC,MAAM,GAAG,KAAK,CAAC;gBACjB,CAAC,CAAC,MAAM,GAAG,KAAK,CAAC;gBACjB,CAAC,CAAC,MAAM,GAAG,KAAK,CAAC;YACnB,CAAC;iBAAM,CAAC;gBACN,eAAe,CAAC,WAAW,EAAE,EAAE,CAAC,CAAC;YACnC,CAAC;YACD,SAAS;QACX,CAAC;QAED,MAAM,WAAW,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC;QACvD,MAAM,MAAM,GAAG,aAAa,CAAC,WAAW,CAAC,CAAC;QAE1C,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACxB,KAAK,MAAM,EAAE,IAAI,WAAW,EAAE,CAAC;gBAC7B,EAAE,CAAC,MAAM,GAAG,KAAK,CAAC;YACpB,CAAC;YACD,MAAM;QACR,CAAC;QAED,MAAM,EAAE,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;QACrB,IAAI,CAAC,EAAE;YAAE,MAAM;QAEf,IAAI,EAAE,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;YACvB,MAAM,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC;YACnB,MAAM,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC;YAEnB,IAAI,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,MAAM;gBAAE,SAAS;YAErC,MAAM,OAAO,GAAG,aAAa,CAAC,MAAM,CAAC;YACrC,aAAa,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC;YAE1D,MAAM,MAAM,GAAG,iBAAiB,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;YAC5C,MAAM,MAAM,GAAG,iBAAiB,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;YAC5C,IAAI,MAAM;gBAAE,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACjC,IAAI,MAAM;gBAAE,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAEjC,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;YACX,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;YAEX,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC;YAChB,2HAA2H;YAC3H,CAAC,CAAC,IAAK,CAAC,IAAI,GAAG,CAAC,CAAC;YACjB,CAAC,CAAC,MAAM,GAAG,KAAK,CAAC;YAEjB,MAAM,OAAO,GAAgB,EAAE,CAAC;YAChC,IAAI,GAAG,GAAG,CAAC,CAAC;YACZ,GAAG,CAAC;gBACF,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC;gBACrC,sGAAsG;gBACtG,GAAG,GAAG,GAAG,CAAC,IAAK,CAAC;YAClB,CAAC,QAAQ,GAAG,KAAK,CAAC,EAAE;YAEpB,MAAM,IAAI,GAAG,QAAQ,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;YAClC,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC;YACf,CAAC,CAAC,EAAE,GAAG,IAAI,CAAC,EAAE,CAAC;QACjB,CAAC;aAAM,CAAC;YACN,2EAA2E;YAC3E,mDAAmD;YACnD,MAAM,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC;YACnB,MAAM,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,6BAA6B;YACjD,IAAI,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,MAAM;gBAAE,SAAS;YAErC,MAAM,OAAO,GAAG,aAAa,CAAC,MAAM,CAAC;YACrC,aAAa,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC;YAC1D,MAAM,MAAM,GAAG,iBAAiB,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;YAC5C,IAAI,MAAM;gBAAE,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACjC,MAAM,MAAM,GAAG,iBAAiB,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;YAC5C,IAAI,MAAM;gBAAE,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAEjC,iEAAiE;YACjE,MAAM,KAAK,GAAY;gBACrB,CAAC,EAAE,EAAE,CAAC,CAAC;gBACP,CAAC,EAAE,EAAE,CAAC,CAAC;gBACP,EAAE,EAAE,CAAC;gBACL,EAAE,EAAE,CAAC;gBACL,OAAO,EAAE,CAAC,CAAC,OAAO;gBAClB,IAAI,EAAE,IAAI;gBACV,IAAI,EAAE,IAAI;gBACV,MAAM,EAAE,IAAI;aACb,CAAC;YACF,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAErB,8BAA8B;YAC9B,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;YACX,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;YAEX,uDAAuD;YACvD,0DAA0D;YAC1D,kIAAkI;YAClI,MAAM,KAAK,GAAG,CAAC,CAAC,IAAK,CAAC;YACtB,kIAAkI;YAClI,MAAM,KAAK,GAAG,CAAC,CAAC,IAAK,CAAC;YAEtB,kDAAkD;YAClD,CAAC,CAAC,IAAI,GAAG,KAAK,CAAC;YACf,KAAK,CAAC,IAAI,GAAG,CAAC,CAAC;YAEf,2EAA2E;YAC3E,KAAK,CAAC,IAAI,GAAG,KAAK,CAAC;YACnB,KAAK,CAAC,IAAI,GAAG,KAAK,CAAC;YACnB,KAAK,CAAC,IAAI,GAAG,CAAC,CAAC;YACf,CAAC,CAAC,IAAI,GAAG,KAAK,CAAC;YAEf,iDAAiD;YACjD,MAAM,YAAY,GAAG,CAAC,KAAc,EAAe,EAAE;gBACnD,MAAM,IAAI,GAAgB,EAAE,CAAC;gBAC7B,IAAI,CAAC,GAAG,KAAK,CAAC;gBACd,GAAG,CAAC;oBACF,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;oBAC9B,sGAAsG;oBACtG,CAAC,GAAG,CAAC,CAAC,IAAK,CAAC;gBACd,CAAC,QAAQ,CAAC,KAAK,KAAK,EAAE;gBACtB,OAAO,IAAI,CAAC;YACd,CAAC,CAAC;YAEF,MAAM,QAAQ,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,KAAK,GAAG,QAAQ,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;YACpC,CAAC,CAAC,EAAE,GAAG,KAAK,CAAC,EAAE,CAAC;YAChB,CAAC,CAAC,EAAE,GAAG,KAAK,CAAC,EAAE,CAAC;YAEhB,MAAM,QAAQ,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC;YACrC,MAAM,KAAK,GAAG,QAAQ,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;YACpC,KAAK,CAAC,EAAE,GAAG,KAAK,CAAC,EAAE,CAAC;YACpB,KAAK,CAAC,EAAE,GAAG,KAAK,CAAC,EAAE,CAAC;QACtB,CAAC;IACH,CAAC;IAED,0CAA0C;IAC1C,MAAM,KAAK,GAAmB,EAAE,CAAC;IAEjC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QACtB,MAAM,EAAE,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAC3B,MAAM,EAAE,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAC3B,MAAM,SAAS,GAAgB,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACxC,MAAM,WAAW,GAAa,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAErC,MAAM,MAAM,GAAG,iBAAiB,CAAC,CAAC,CAAC,CAAC;QACpC,MAAM,MAAM,GAAG,iBAAiB,CAAC,CAAC,CAAC,CAAC;QAEpC,IAAI,MAAM,EAAE,CAAC;YACX,KAAK,MAAM,EAAE,IAAI,MAAM,EAAE,CAAC;gBACxB,MAAM,EAAE,GAAG,aAAa,CAAC,EAAE,CAAC,CAAC;gBAC7B,IAAI,EAAE,EAAE,CAAC;oBACP,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;oBACrC,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC;gBAC9B,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,MAAM,EAAE,CAAC;YACX,KAAK,IAAI,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC5C,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;gBACtB,IAAI,GAAG,KAAK,SAAS;oBAAE,SAAS;gBAChC,MAAM,EAAE,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC;gBAC9B,IAAI,CAAC,EAAE;oBAAE,SAAS;gBAClB,MAAM,QAAQ,GAAG,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;gBACjD,IAAI,CAAC,QAAQ;oBAAE,SAAS;gBACxB,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;gBACxD,IAAI,IAAI,GAAG,GAAG,EAAE,CAAC;oBACf,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;oBACrC,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC;gBAC9B,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,SAAS,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;YAC1B,KAAK,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,SAAS,EAAE,OAAO,EAAE,WAAW,EAAE,CAAC,CAAC;QAC5D,CAAC;IACH,CAAC;IAED,6BAA6B;IAC7B,MAAM,WAAW,GAAmB,EAAE,CAAC;IACvC,KAAK,MAAM,EAAE,IAAI,aAAa,EAAE,CAAC;QAC/B,MAAM,MAAM,GAAG,WAAW,CAAC,IAAI,CAC7B,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CACrE,CAAC;QACF,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACvB,CAAC;IACH,CAAC;IAED,OAAO,EAAE,KAAK,EAAE,WAAW,EAAE,KAAK,EAAE,CAAC;AACvC,CAAC","sourcesContent":["/**\n * Pure TypeScript straight skeleton algorithm for simple polygons.\n * No kernel dependency — operates on 2D point arrays.\n */\n\nimport type { Result } from '../../result/result'\nimport { ok, err } from '../../result/result'\nimport { computationError, BrepErrorCode } from '../../result/errors'\n\n// ---------------------------------------------------------------------------\n// Types\n// ---------------------------------------------------------------------------\n\n/** A 2D polygon point used as skeleton input. */\nexport interface SkPoint2D {\n readonly x: number;\n readonly y: number;\n}\n\n/** A skeleton node: 2D position plus elevation height. */\nexport interface SkeletonNode {\n readonly x: number;\n readonly y: number;\n readonly height: number;\n}\n\n/** A skeleton face: its vertex loop with the matching per-vertex heights. */\nexport interface SkeletonFace {\n readonly vertices: SkPoint2D[];\n readonly heights: number[];\n}\n\n/** A complete straight skeleton: nodes and faces. */\nexport interface StraightSkeleton {\n readonly nodes: SkeletonNode[];\n readonly faces: SkeletonFace[];\n}\n\n// ---------------------------------------------------------------------------\n// Geometry helpers\n// ---------------------------------------------------------------------------\n\nconst EPS = 1e-10;\n\nfunction cross2(ax: number, ay: number, bx: number, by: number): number {\n return ax * by - ay * bx;\n}\n\nfunction dot2(ax: number, ay: number, bx: number, by: number): number {\n return ax * bx + ay * by;\n}\n\nfunction len2(x: number, y: number): number {\n return Math.sqrt(x * x + y * y);\n}\n\n/** Safe polygon access with modular index. */\nfunction polyAt(poly: SkPoint2D[], i: number): SkPoint2D {\n const idx = ((i % poly.length) + poly.length) % poly.length;\n const p = poly[idx];\n if (!p) throw new Error(`Invalid polygon index ${i} for length ${poly.length}`);\n return p;\n}\n\n/** Ensure polygon is in CCW order. Returns a new array if reversed. */\nfunction ensureCCW(poly: SkPoint2D[]): SkPoint2D[] {\n let area = 0;\n for (let i = 0; i < poly.length; i++) {\n const cur = polyAt(poly, i);\n const nxt = polyAt(poly, i + 1);\n area += cur.x * nxt.y - nxt.x * cur.y;\n }\n if (area < 0) return [...poly].reverse();\n return poly;\n}\n\n/** Compute unit bisector direction pointing inward for vertex at index i. */\nfunction bisector(poly: SkPoint2D[], i: number): { dx: number; dy: number } {\n const prev = polyAt(poly, i - 1);\n const cur = polyAt(poly, i);\n const next = polyAt(poly, i + 1);\n\n const e1x = cur.x - prev.x;\n const e1y = cur.y - prev.y;\n const e1l = len2(e1x, e1y);\n const e2x = next.x - cur.x;\n const e2y = next.y - cur.y;\n const e2l = len2(e2x, e2y);\n\n if (e1l < EPS || e2l < EPS) return { dx: 0, dy: 0 };\n\n const n1x = -e1y / e1l;\n const n1y = e1x / e1l;\n const n2x = -e2y / e2l;\n const n2y = e2x / e2l;\n\n let bx = n1x + n2x;\n let by = n1y + n2y;\n const bl = len2(bx, by);\n\n if (bl < EPS) {\n return { dx: n1x, dy: n1y };\n }\n\n bx /= bl;\n by /= bl;\n\n const cosHalf = dot2(bx, by, n1x, n1y);\n const speed = Math.abs(cosHalf) > EPS ? 1.0 / cosHalf : 1.0;\n\n return { dx: bx * speed, dy: by * speed };\n}\n\n// ---------------------------------------------------------------------------\n// LAV (List of Active Vertices)\n// ---------------------------------------------------------------------------\n\ninterface LavNode {\n x: number;\n y: number;\n bx: number;\n by: number;\n origIdx: number;\n prev: LavNode | null;\n next: LavNode | null;\n active: boolean;\n}\n\n/** Is a LAV node reflex based on current LAV positions? */\nfunction isLavNodeReflex(node: LavNode): boolean {\n if (!node.prev || !node.next) return false;\n return (\n cross2(node.x - node.prev.x, node.y - node.prev.y, node.next.x - node.x, node.next.y - node.y) <\n -EPS\n );\n}\n\nfunction createLav(poly: SkPoint2D[]): LavNode[] {\n const nodes: LavNode[] = poly.map((p, i) => {\n const b = bisector(poly, i);\n return {\n x: p.x,\n y: p.y,\n bx: b.dx,\n by: b.dy,\n origIdx: i,\n prev: null,\n next: null,\n active: true,\n };\n });\n\n for (let i = 0; i < nodes.length; i++) {\n const node = nodes[i];\n const prevNode = nodes[(i - 1 + nodes.length) % nodes.length];\n const nextNode = nodes[(i + 1) % nodes.length];\n if (node && prevNode && nextNode) {\n node.prev = prevNode;\n node.next = nextNode;\n }\n }\n\n return nodes;\n}\n\n/** Deactivate a chain of nodes starting from `start`. */\nfunction deactivateNodes(start: LavNode | null, count: number): void {\n let cur = start;\n for (let i = 0; i < count; i++) {\n if (!cur) break;\n cur.active = false;\n cur = cur.next;\n }\n}\n\n/** Count active nodes reachable from a starting node. */\nfunction lavSize(start: LavNode): number {\n let count = 1;\n // eslint-disable-next-line @typescript-eslint/no-non-null-assertion -- circular linked list: prev/next non-null after construction\n let cur = start.next!;\n while (cur !== start) {\n count++;\n // eslint-disable-next-line @typescript-eslint/no-non-null-assertion -- circular linked list traversal\n cur = cur.next!;\n if (count > 10000) break;\n }\n return count;\n}\n\n// ---------------------------------------------------------------------------\n// Event computation\n// ---------------------------------------------------------------------------\n\ninterface SkEvent {\n time: number;\n x: number;\n y: number;\n nodeA: LavNode;\n nodeB: LavNode;\n type: 'edge' | 'split';\n}\n\n/** Time at which two moving bisectors from nodeA and nodeB intersect. */\nfunction bisectorIntersectTime(a: LavNode, b: LavNode): number | null {\n const ddx = a.bx - b.bx;\n const ddy = a.by - b.by;\n const dxp = b.x - a.x;\n const dyp = b.y - a.y;\n\n if (Math.abs(ddx) < EPS && Math.abs(ddy) < EPS) return null;\n\n let t: number;\n if (Math.abs(ddx) > Math.abs(ddy)) {\n t = dxp / ddx;\n } else {\n t = dyp / ddy;\n }\n\n if (t < EPS) return null;\n\n // Verify the other equation\n const otherDd = Math.abs(ddx) > Math.abs(ddy) ? ddy : ddx;\n const otherDp = Math.abs(ddx) > Math.abs(ddy) ? dyp : dxp;\n if (Math.abs(otherDd) > EPS) {\n const t2 = otherDp / otherDd;\n if (Math.abs(t - t2) > 1e-4 * Math.max(1, Math.abs(t))) return null;\n }\n\n return t;\n}\n\n/** Compute ray-segment intersection time for split events. */\nfunction raySplitTime(node: LavNode, eA: LavNode, eB: LavNode): number | null {\n const edx = eB.x - eA.x;\n const edy = eB.y - eA.y;\n const el = len2(edx, edy);\n if (el < EPS) return null;\n\n const enx = -edy / el;\n const eny = edx / el;\n\n const d0 = (node.x - eA.x) * enx + (node.y - eA.y) * eny;\n const relBx = node.bx - (eA.bx + eB.bx) / 2;\n const relBy = node.by - (eA.by + eB.by) / 2;\n const dRate = relBx * enx + relBy * eny;\n\n if (Math.abs(dRate) < EPS) return null;\n\n const t = -d0 / dRate;\n if (t < EPS) return null;\n\n const px = node.x + t * node.bx;\n const py = node.y + t * node.by;\n const ax = eA.x + t * eA.bx;\n const ay = eA.y + t * eA.by;\n const bxx = eB.x + t * eB.bx;\n const byy = eB.y + t * eB.by;\n\n const segDx = bxx - ax;\n const segDy = byy - ay;\n const segL = len2(segDx, segDy);\n if (segL < EPS) return t;\n\n const s = dot2(px - ax, py - ay, segDx, segDy) / (segL * segL);\n if (s < -0.01 || s > 1.01) return null;\n\n return t;\n}\n\nfunction computeEvents(lavNodes: LavNode[]): SkEvent[] {\n const events: SkEvent[] = [];\n\n for (const node of lavNodes) {\n if (!node.active || !node.next) continue;\n\n const t = bisectorIntersectTime(node, node.next);\n if (t !== null && t > EPS) {\n const x = node.x + t * node.bx;\n const y = node.y + t * node.by;\n events.push({ time: t, x, y, nodeA: node, nodeB: node.next, type: 'edge' });\n }\n\n if (isLavNodeReflex(node)) {\n // eslint-disable-next-line @typescript-eslint/no-non-null-assertion -- circular linked list traversal\n let cur = node.next.next!;\n let count = 0;\n while (cur !== node.prev && cur !== node && count < 1000) {\n // eslint-disable-next-line @typescript-eslint/no-non-null-assertion -- circular linked list traversal\n const st = raySplitTime(node, cur, cur.next!);\n if (st !== null && st > EPS) {\n const x = node.x + st * node.bx;\n const y = node.y + st * node.by;\n events.push({ time: st, x, y, nodeA: node, nodeB: cur, type: 'split' });\n }\n // eslint-disable-next-line @typescript-eslint/no-non-null-assertion -- circular linked list traversal\n cur = cur.next!;\n count++;\n }\n }\n }\n\n events.sort((a, b) => a.time - b.time);\n return events;\n}\n\n// ---------------------------------------------------------------------------\n// Main algorithm\n// ---------------------------------------------------------------------------\n\n/**\n * Compute the straight skeleton of a simple polygon.\n * The polygon vertices must define a simple (non-self-intersecting) polygon.\n * They will be reordered to CCW if necessary.\n *\n * @param polygon - The input polygon vertices.\n * @returns The computed straight skeleton.\n */\nexport function computeStraightSkeleton(polygon: SkPoint2D[]): Result<StraightSkeleton> {\n if (polygon.length < 3) {\n return ok({ nodes: [], faces: [] });\n }\n\n try {\n return ok(computeStraightSkeletonImpl(polygon));\n } catch (e: unknown) {\n return err(\n computationError(\n BrepErrorCode.STRAIGHT_SKELETON_FAILED,\n e instanceof Error ? e.message : String(e),\n e\n )\n );\n }\n}\n\n/** Internal implementation — may throw on degenerate polygon indices. */\nfunction computeStraightSkeletonImpl(polygon: SkPoint2D[]): StraightSkeleton {\n const poly = ensureCCW(polygon);\n const n = poly.length;\n\n const skeletonNodes: SkeletonNode[] = [];\n const vertexToSkelNodes: number[][] = Array.from({ length: n }, () => []);\n\n const lavNodes = createLav(poly);\n let iterations = 0;\n const maxIter = n * n * 2;\n\n while (iterations < maxIter) {\n iterations++;\n\n const activeStart = lavNodes.find((nd) => nd.active);\n if (!activeStart) break;\n\n const sz = lavSize(activeStart);\n if (sz <= 3) {\n if (sz === 3) {\n const a = activeStart;\n // eslint-disable-next-line @typescript-eslint/no-non-null-assertion -- circular linked list: 3-node LAV guaranteed non-null\n const b = a.next!;\n // eslint-disable-next-line @typescript-eslint/no-non-null-assertion -- circular linked list: 3-node LAV guaranteed non-null\n const c = b.next!;\n\n const t = bisectorIntersectTime(a, b);\n const time = t !== null && t > EPS ? t : 0;\n const mx = (a.x + b.x + c.x) / 3 + (time * (a.bx + b.bx + c.bx)) / 3;\n const my = (a.y + b.y + c.y) / 3 + (time * (a.by + b.by + c.by)) / 3;\n\n const nodeIdx = skeletonNodes.length;\n skeletonNodes.push({ x: mx, y: my, height: time });\n\n const aNodes = vertexToSkelNodes[a.origIdx];\n const bNodes = vertexToSkelNodes[b.origIdx];\n const cNodes = vertexToSkelNodes[c.origIdx];\n if (aNodes) aNodes.push(nodeIdx);\n if (bNodes) bNodes.push(nodeIdx);\n if (cNodes) cNodes.push(nodeIdx);\n\n a.active = false;\n b.active = false;\n c.active = false;\n } else {\n deactivateNodes(activeStart, sz);\n }\n continue;\n }\n\n const activeNodes = lavNodes.filter((nd) => nd.active);\n const events = computeEvents(activeNodes);\n\n if (events.length === 0) {\n for (const nd of activeNodes) {\n nd.active = false;\n }\n break;\n }\n\n const ev = events[0];\n if (!ev) break;\n\n if (ev.type === 'edge') {\n const a = ev.nodeA;\n const b = ev.nodeB;\n\n if (!a.active || !b.active) continue;\n\n const nodeIdx = skeletonNodes.length;\n skeletonNodes.push({ x: ev.x, y: ev.y, height: ev.time });\n\n const aNodes = vertexToSkelNodes[a.origIdx];\n const bNodes = vertexToSkelNodes[b.origIdx];\n if (aNodes) aNodes.push(nodeIdx);\n if (bNodes) bNodes.push(nodeIdx);\n\n a.x = ev.x;\n a.y = ev.y;\n\n a.next = b.next;\n // eslint-disable-next-line @typescript-eslint/no-non-null-assertion -- circular linked list: b.next non-null in active LAV\n b.next!.prev = a;\n b.active = false;\n\n const lavPoly: SkPoint2D[] = [];\n let cur = a;\n do {\n lavPoly.push({ x: cur.x, y: cur.y });\n // eslint-disable-next-line @typescript-eslint/no-non-null-assertion -- circular linked list traversal\n cur = cur.next!;\n } while (cur !== a);\n\n const bDir = bisector(lavPoly, 0);\n a.bx = bDir.dx;\n a.by = bDir.dy;\n } else {\n // Split event: reflex vertex `a` reaches opposite edge (nodeB, nodeB.next)\n // Must split the LAV into two independent sub-LAVs\n const a = ev.nodeA;\n const b = ev.nodeB; // start of the opposite edge\n if (!a.active || !b.active) continue;\n\n const nodeIdx = skeletonNodes.length;\n skeletonNodes.push({ x: ev.x, y: ev.y, height: ev.time });\n const aNodes = vertexToSkelNodes[a.origIdx];\n if (aNodes) aNodes.push(nodeIdx);\n const bNodes = vertexToSkelNodes[b.origIdx];\n if (bNodes) bNodes.push(nodeIdx);\n\n // Create a copy of `a` at the split point for the second sub-LAV\n const aCopy: LavNode = {\n x: ev.x,\n y: ev.y,\n bx: 0,\n by: 0,\n origIdx: a.origIdx,\n prev: null,\n next: null,\n active: true,\n };\n lavNodes.push(aCopy);\n\n // Move `a` to the split point\n a.x = ev.x;\n a.y = ev.y;\n\n // Rewire: LAV 1 runs a -> b.next -> ... -> a.prev -> a\n // Rewire: LAV 2 runs aCopy -> a.next -> ... -> b -> aCopy\n // eslint-disable-next-line @typescript-eslint/no-non-null-assertion -- circular linked list: active nodes have non-null prev/next\n const aNext = a.next!;\n // eslint-disable-next-line @typescript-eslint/no-non-null-assertion -- circular linked list: active nodes have non-null prev/next\n const bNext = b.next!;\n\n // LAV 1: a connects to b.next on the forward side\n a.next = bNext;\n bNext.prev = a;\n\n // LAV 2: aCopy connects to a's old next on the forward side, b on the back\n aCopy.next = aNext;\n aNext.prev = aCopy;\n aCopy.prev = b;\n b.next = aCopy;\n\n // Recompute bisectors for both split-point nodes\n const buildLavPoly = (start: LavNode): SkPoint2D[] => {\n const poly: SkPoint2D[] = [];\n let c = start;\n do {\n poly.push({ x: c.x, y: c.y });\n // eslint-disable-next-line @typescript-eslint/no-non-null-assertion -- circular linked list traversal\n c = c.next!;\n } while (c !== start);\n return poly;\n };\n\n const lav1Poly = buildLavPoly(a);\n const bDir1 = bisector(lav1Poly, 0);\n a.bx = bDir1.dx;\n a.by = bDir1.dy;\n\n const lav2Poly = buildLavPoly(aCopy);\n const bDir2 = bisector(lav2Poly, 0);\n aCopy.bx = bDir2.dx;\n aCopy.by = bDir2.dy;\n }\n }\n\n // Build faces: one face per original edge\n const faces: SkeletonFace[] = [];\n\n for (let i = 0; i < n; i++) {\n const j = (i + 1) % n;\n const pi = polyAt(poly, i);\n const pj = polyAt(poly, j);\n const faceVerts: SkPoint2D[] = [pi, pj];\n const faceHeights: number[] = [0, 0];\n\n const jNodes = vertexToSkelNodes[j];\n const iNodes = vertexToSkelNodes[i];\n\n if (jNodes) {\n for (const ni of jNodes) {\n const sn = skeletonNodes[ni];\n if (sn) {\n faceVerts.push({ x: sn.x, y: sn.y });\n faceHeights.push(sn.height);\n }\n }\n }\n\n if (iNodes) {\n for (let k = iNodes.length - 1; k >= 0; k--) {\n const idx = iNodes[k];\n if (idx === undefined) continue;\n const sn = skeletonNodes[idx];\n if (!sn) continue;\n const lastVert = faceVerts[faceVerts.length - 1];\n if (!lastVert) continue;\n const dist = len2(sn.x - lastVert.x, sn.y - lastVert.y);\n if (dist > EPS) {\n faceVerts.push({ x: sn.x, y: sn.y });\n faceHeights.push(sn.height);\n }\n }\n }\n\n if (faceVerts.length >= 3) {\n faces.push({ vertices: faceVerts, heights: faceHeights });\n }\n }\n\n // Deduplicate skeleton nodes\n const uniqueNodes: SkeletonNode[] = [];\n for (const sn of skeletonNodes) {\n const exists = uniqueNodes.some(\n (un) => Math.abs(un.x - sn.x) < 0.01 && Math.abs(un.y - sn.y) < 0.01\n );\n if (!exists) {\n uniqueNodes.push(sn);\n }\n }\n\n return { nodes: uniqueNodes, faces };\n}\n"]}

package/dist/api/brep-mirror/sweepFns.d.ts DELETED Viewed

@@ -1,55 +0,0 @@
-/**
- * Self-hosted compat-op implementations — extrude/revolve/sweep family
- * (core-decouple Phase 3, §5.4; G3).
- *
- * @platform occt
- *
- * Semantics mirror brepjs `operations/{api,extrudeFns,sweepFns}.ts`:
- *  - `extrudeBrep` — height: number → [0,0,h]; Vec3 → as-is. EXTRUDE_ZERO_VECTOR guard.
- *  - `revolveBrep` — options { at, axis, angle(radians, default 2π) }; REVOLUTION_NOT_3D.
- *  - `sweepBrep` — config.mode 'simple' → simplePipe; default → sweepPipeShell(frenet).
- *    shellMode / law / auxiliarySpine / support / correction configs are not
- *    supported after selfhosting (cad 面取手写 api/sweep.ts，shell 元组不暴露 §2.4①).
- *  - `complexExtrudeBrep` / `twistExtrudeBrep` — linear / helix spine built on
- *    occt-wasm makeLineEdge+makeWire / makeHelixWire, then sweepPipeShell.
- *    ExtrusionProfile scaling law is not supported (brepjs buildLawFromProfile
- *    has no L1 equivalent); non-undefined profile → LAW_UNSUPPORTED error.
- */
-import type { BrepHandle } from '../../brep/engine/types.js';
-import { type Result } from '../../result/result.js';
-/**
- * Extrude a face along a vector/height (brepjs api.js#extrude + extrudeFns.ts#extrude).
- *
- * @param args - Resolved arguments (face, height or extrusion vector).
- * @returns The extruded solid as a `BrepHandle`.
- */
-export declare function extrudeBrep(...args: unknown[]): Result<BrepHandle>;
-/**
- * Revolve a face around an axis (brepjs api.js#revolve; angle in radians, default 2π).
- *
- * @param args - Resolved arguments (face, revolve options).
- * @returns The revolved solid as a `BrepHandle`.
- */
-export declare function revolveBrep(...args: unknown[]): Result<BrepHandle>;
-/**
- * Sweep a profile along a spine (brepjs sweepFns.ts#sweep).
- *
- * @param args - Resolved arguments (wire, spine, config, shellMode).
- * @returns The swept solid as a `BrepHandle`.
- */
-export declare function sweepBrep(...args: unknown[]): Result<BrepHandle>;
-/**
- * Extrude a wire along a normal (brepjs sweepFns.ts#complexExtrude).
- *
- * @param args - Resolved arguments (wire, center, normal, profile).
- * @returns The extruded solid as a `BrepHandle`.
- */
-export declare function complexExtrudeBrep(...args: unknown[]): Result<BrepHandle>;
-/**
- * Extrude a wire along a helical path (brepjs sweepFns.ts#twistExtrude).
- *
- * @param args - Resolved arguments (wire, angleDegrees, center, normal, profile).
- * @returns The twisted extrusion as a `BrepHandle`.
- */
-export declare function twistExtrudeBrep(...args: unknown[]): Result<BrepHandle>;
-//# sourceMappingURL=sweepFns.d.ts.map