plotboilerplate 1.23.2 → 1.23.3

package/src/esm/utils/algorithms/splitPolygonToNonIntersecting.js.map

@@ -1 +1 @@
-{"version":3,"file":"splitPolygonToNonIntersecting.js","sourceRoot":"","sources":["../../../ts/utils/algorithms/splitPolygonToNonIntersecting.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,EAAE,IAAI,EAAE,MAAM,YAAY,CAAC;AAClC,OAAO,EAAE,MAAM,EAAE,MAAM,cAAc,CAAC;AAStC;;;;;;;;;;;;;;;GAeG;AACH,MAAM,CAAC,MAAM,6BAA6B,GAAG,CAAC,GAAG,EAAE;IAE/C;;;OAGG;IACH,MAAM,6BAA6B,GAAG,CAAE,QAAsB,EACzD,QAAgB,EAA0B,EAAE;QACpD,IAAI,OAAO,QAAQ,KAAK,WAAW;YAC/B,QAAQ,GAAG,EAAE,CAAC;QAClB,OAAO,8BAA8B,CAAE,QAAQ,EAAE,QAAQ,CAAE,CAAC;IACzD,CAAC,CAAC;IAGF,MAAM,8BAA8B,GAAG,CAAE,QAAsB,EACzD,QAAe,EAA0B,EAAE;QACpD,IAAI,QAAQ,IAAI,CAAC,EAAG,CAAC;YACjB,wBAAwB;YACxB,OAAO,CAAE,QAAQ,CAAE,CAAC;QACxB,CAAC;QAED,IAAI,QAAQ,CAAC,MAAM,IAAI,CAAC,EAAG,CAAC;YACxB,4BAA4B;YAC5B,OAAO,CAAE,QAAQ,CAAE,CAAC;QACxB,CAAC;QAED,MAAM,CAAC,GAAW,QAAQ,CAAC,MAAM,CAAC;QAClC,MAAM,KAAK,GAAU,IAAI,IAAI,CAAE,IAAI,MAAM,EAAE,EAAE,IAAI,MAAM,EAAE,CAAE,CAAC;QAC5D,MAAM,KAAK,GAAU,IAAI,IAAI,CAAE,IAAI,MAAM,EAAE,EAAE,IAAI,MAAM,EAAE,CAAE,CAAC;QAC5D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAG,CAAC;YACxC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAE,QAAQ,CAAC,CAAC,CAAC,CAAE,CAAC;YAC3B,KAAK,CAAC,CAAC,CAAC,GAAG,CAAE,QAAQ,CAAC,CAAC,CAAC,GAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC;YACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAG,CAAC;gBAC/C,0DAA0D;gBAC1D,kBAAkB;gBAClB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAC,CAAC;uBAC3B,CAAC,CAAC,IAAE,CAAC,IAAE,CAAC,GAAC,CAAC,IAAE,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,IAAE,CAAC,IAAE,CAAC,GAAC,CAAC,IAAE,QAAQ,CAAC,MAAM,CAAC;oBAC/D,SAAS;gBACb,KAAK,CAAC,CAAC,CAAC,GAAG,CAAE,QAAQ,CAAC,CAAC,CAAC,CAAE,CAAC;gBAC3B,KAAK,CAAC,CAAC,CAAC,GAAG,CAAE,QAAQ,CAAC,CAAC,CAAC,GAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC;gBAEnC,MAAM,iBAAiB,GAAsB,KAAK,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;gBACvE,IAAI,iBAAiB,IAAI,KAAK,CAAC,QAAQ,CAAC,iBAAiB,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,iBAAiB,CAAC,EAAG,CAAC;oBAE/F,4BAA4B;oBAC5B,MAAM,KAAK,GAAY,cAAc,CAAE,QAAQ,EAAE,CAAC,EAAE,CAAC,EAAE,iBAAiB,CAAE,CAAC;oBAE3E,wBAAwB;oBACxB,MAAM,WAAW,GACpB,8BAA8B,CAAE,KAAK,CAAC,CAAC,CAAC,EAAE,QAAQ,GAAC,CAAC,CAAE,CAAC;oBACpD,MAAM,YAAY,GACrB,8BAA8B,CAAE,KAAK,CAAC,CAAC,CAAC,EAAE,QAAQ,GAAC,CAAC,CAAE,CAAC;oBAEpD,OAAO,WAAW,CAAC,MAAM,CAAE,YAAY,CAAE,CAAC;gBAC9C,CAAC;YACE,CAAC;QACL,CAAC;QAED,yBAAyB;QACzB,0CAA0C;QAC1C,kCAAkC;QAClC,OAAO,CAAE,QAAQ,CAAE,CAAC;IACjB,CAAC,CAAC;IAGF,uDAAuD;IACvD,MAAM,cAAc,GAAG,CAAE,QAAsB,EAC3C,UAAiB,EACjB,UAAiB,EACjB,iBAAwB,EAAY,EAAE;QAC7C,MAAM,KAAK,GAAmB,EAAE,CAAC;QACjC,IAAI,MAAM,GAAmB,EAAE,CAAC;QAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAG,CAAC;YACxC,IAAI,CAAC,IAAI,UAAU;gBACtB,KAAK,CAAC,IAAI,CAAE,QAAQ,CAAC,CAAC,CAAC,CAAE,CAAC;YAEvB,IAAI,CAAC,IAAI,UAAU,EAAI,CAAC;gBAC3B,KAAK,CAAC,IAAI,CAAE,iBAAiB,CAAE,CAAC;gBAChC,MAAM,CAAC,IAAI,CAAE,iBAAiB,CAAE,CAAC,CAAC,WAAW;YAC1C,CAAC;YAED,IAAI,CAAC,GAAG,UAAU,IAAI,CAAC,IAAI,UAAU;gBACxC,MAAM,CAAC,IAAI,CAAE,QAAQ,CAAC,CAAC,CAAC,CAAE,CAAC;YAExB,IAAI,CAAC,GAAG,UAAU;gBACrB,KAAK,CAAC,IAAI,CAAE,QAAQ,CAAC,CAAC,CAAC,CAAE,CAAC;QAE3B,CAAC;QAED,OAAO,CAAE,KAAK,EAAE,MAAM,CAAE,CAAC;IACtB,CAAC,CAAC;IAEF,OAAO,6BAA6B,CAAC;AACzC,CAAC,CAAC,EAAE,CAAC"}
+{"version":3,"file":"splitPolygonToNonIntersecting.js","sourceRoot":"","sources":["../../../ts/utils/algorithms/splitPolygonToNonIntersecting.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,EAAE,IAAI,EAAE,MAAM,YAAY,CAAC;AAClC,OAAO,EAAE,MAAM,EAAE,MAAM,cAAc,CAAC;AAOtC;;;;;;;;;;;;;;;GAeG;AACH,MAAM,CAAC,MAAM,6BAA6B,GAAG,CAAC,GAAG,EAAE;IACjD;;;OAGG;IACH,MAAM,6BAA6B,GAAG,CACpC,QAAuB,EACvB,QAAiB,EACjB,gBAA0B,EACJ,EAAE;QACxB,IAAI,OAAO,QAAQ,KAAK,WAAW;YAAE,QAAQ,GAAG,EAAE,CAAC;QACnD,OAAO,8BAA8B,CAAC,QAAQ,EAAE,QAAQ,EAAE,gBAAgB,CAAC,CAAC;IAC9E,CAAC,CAAC;IAEF,MAAM,8BAA8B,GAAG,CACrC,QAAuB,EACvB,QAAgB,EAChB,gBAA0B,EACJ,EAAE;QACxB,IAAI,QAAQ,IAAI,CAAC,EAAE,CAAC;YAClB,wBAAwB;YACxB,OAAO,CAAC,QAAQ,CAAC,CAAC;QACpB,CAAC;QAED,IAAI,QAAQ,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC;YACzB,4BAA4B;YAC5B,OAAO,CAAC,QAAQ,CAAC,CAAC;QACpB,CAAC;QAED,MAAM,CAAC,GAAW,QAAQ,CAAC,MAAM,CAAC;QAClC,MAAM,KAAK,GAAS,IAAI,IAAI,CAAC,IAAI,MAAM,EAAE,EAAE,IAAI,MAAM,EAAE,CAAC,CAAC;QACzD,MAAM,KAAK,GAAS,IAAI,IAAI,CAAC,IAAI,MAAM,EAAE,EAAE,IAAI,MAAM,EAAE,CAAC,CAAC;QACzD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;YACzB,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACnC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzC,0DAA0D;gBAC1D,kBAAkB;gBAClB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,QAAQ,CAAC,MAAM,CAAC;oBACpH,SAAS;gBACX,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;gBACzB,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBAEnC,MAAM,iBAAiB,GAAkB,KAAK,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC;gBACnE,IACE,iBAAiB;oBACjB,KAAK,CAAC,QAAQ,CAAC,iBAAiB,EAAE,gBAAgB,CAAC;oBACnD,KAAK,CAAC,QAAQ,CAAC,iBAAiB,EAAE,gBAAgB,CAAC,EACnD,CAAC;oBACD,4BAA4B;oBAC5B,MAAM,KAAK,GAAW,cAAc,CAAC,QAAQ,EAAE,CAAC,EAAE,CAAC,EAAE,iBAAiB,CAAC,CAAC;oBAExE,wBAAwB;oBACxB,MAAM,WAAW,GAAyB,8BAA8B,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,QAAQ,GAAG,CAAC,EAAE,gBAAgB,CAAC,CAAC;oBACnH,MAAM,YAAY,GAAyB,8BAA8B,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,QAAQ,GAAG,CAAC,EAAE,gBAAgB,CAAC,CAAC;oBAEpH,OAAO,WAAW,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;gBAC1C,CAAC;YACH,CAAC;QACH,CAAC;QAED,yBAAyB;QACzB,0CAA0C;QAC1C,kCAAkC;QAClC,OAAO,CAAC,QAAQ,CAAC,CAAC;IACpB,CAAC,CAAC;IAEF,uDAAuD;IACvD,MAAM,cAAc,GAAG,CAAC,QAAuB,EAAE,UAAkB,EAAE,UAAkB,EAAE,iBAAyB,EAAU,EAAE;QAC5H,MAAM,KAAK,GAAkB,EAAE,CAAC;QAChC,IAAI,MAAM,GAAkB,EAAE,CAAC;QAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,IAAI,CAAC,IAAI,UAAU;gBAAE,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;YAE7C,IAAI,CAAC,IAAI,UAAU,EAAE,CAAC;gBACpB,KAAK,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC;gBAC9B,MAAM,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,WAAW;YAC7C,CAAC;YAED,IAAI,CAAC,GAAG,UAAU,IAAI,CAAC,IAAI,UAAU;gBAAE,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;YAEhE,IAAI,CAAC,GAAG,UAAU;gBAAE,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9C,CAAC;QAED,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IACzB,CAAC,CAAC;IAEF,OAAO,6BAA6B,CAAC;AACvC,CAAC,CAAC,EAAE,CAAC"}

package/src/esm/utils/detectDarkMode.js.map

@@ -1 +1 @@
-{"version":3,"file":"detectDarkMode.js","sourceRoot":"","sources":["../../ts/utils/detectDarkMode.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAIH,MAAM,CAAC,MAAM,cAAc,GAAG,CAAC,GAA4B,EAAE,EAAE;IAC7D,oBAAoB;IACpB,IAAI,OAAO,GAAG,KAAK,WAAW,IAAI,GAAG,CAAC,cAAc,CAAC,UAAU,CAAC,IAAI,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;QACpF,iFAAiF;QACjF,MAAM,aAAa,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC;QACpD,IAAI,aAAa,KAAK,IAAI,EAAE,CAAC;YAC3B,OAAO,aAAa,CAAC;QACvB,CAAC;IACH,CAAC;IACD,IAAI,UAAU,CAAC,UAAU,IAAI,UAAU,CAAC,UAAU,CAAC,8BAA8B,CAAC,CAAC,OAAO,EAAE,CAAC;QAC3F,sBAAsB;QACtB,OAAO,IAAI,CAAC;IACd,CAAC;IACD,6BAA6B;IAC7B,MAAM,KAAK,GAAG,IAAI,IAAI,EAAE,CAAC,QAAQ,EAAE,CAAC;IACpC,MAAM,SAAS,GAAG,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,EAAE,CAAC;IAC1C,OAAO,CAAC,SAAS,CAAC;AACpB,CAAC,CAAC"}
+{"version":3,"file":"detectDarkMode.js","sourceRoot":"","sources":["../../ts/utils/detectDarkMode.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,MAAM,CAAC,MAAM,cAAc,GAAG,CAAC,GAA4B,EAAW,EAAE;IACtE,oBAAoB;IACpB,IAAI,OAAO,GAAG,KAAK,WAAW,IAAI,GAAG,CAAC,cAAc,CAAC,UAAU,CAAC,IAAI,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;QACpF,iFAAiF;QACjF,MAAM,aAAa,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC;QACpD,IAAI,aAAa,KAAK,IAAI,EAAE,CAAC;YAC3B,OAAO,aAAa,CAAC;QACvB,CAAC;IACH,CAAC;IACD,IAAI,UAAU,CAAC,UAAU,IAAI,UAAU,CAAC,UAAU,CAAC,8BAA8B,CAAC,CAAC,OAAO,EAAE,CAAC;QAC3F,sBAAsB;QACtB,OAAO,IAAI,CAAC;IACd,CAAC;IACD,6BAA6B;IAC7B,MAAM,KAAK,GAAG,IAAI,IAAI,EAAE,CAAC,QAAQ,EAAE,CAAC;IACpC,MAAM,SAAS,GAAG,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,EAAE,CAAC;IAC1C,OAAO,CAAC,SAAS,CAAC;AACpB,CAAC,CAAC"}

package/src/esm/utils/dom/guiSizeToggler.d.ts

@@ -5,7 +5,8 @@
  * @date     2021-12-13
  * @modified 2022-01-10
  * @modified 2024-06-25 Ported to typescript and moved to utils/dom (was located inside demos before).
- * @version  1.1.0
+ * @modified 2024-10-02 Added a transition time.
+ * @version  1.1.1
  */
 import { GUI } from "../../interfaces/externals";
 interface ITogglerConfig {

package/src/esm/utils/dom/guiSizeToggler.js

@@ -5,7 +5,8 @@
  * @date     2021-12-13
  * @modified 2022-01-10
  * @modified 2024-06-25 Ported to typescript and moved to utils/dom (was located inside demos before).
- * @version  1.1.0
+ * @modified 2024-10-02 Added a transition time.
+ * @version  1.1.1
  */
 /**
  * @param {GUI} gui - The GUI (compatible with dat.gui and lil-gui).
@@ -28,7 +29,8 @@ const applyGuiSize = (gui, guiDoubleSize, cssProps) => {
         gui.domElement.style["transform"] = transform + "scale(1.0)";
     }
 };
-export const guiSizeToggler /* gst */ = (gui, config, cssProps) => {
+export const guiSizeToggler = (gui, config, cssProps) => {
+    gui.domElement.style["transition"] = "transform 0.5s";
     return {
         update: function () {
             applyGuiSize(gui, Boolean(config.guiDoubleSize), cssProps);

package/src/esm/utils/dom/guiSizeToggler.js.map

@@ -1 +1 @@
-{"version":3,"file":"guiSizeToggler.js","sourceRoot":"","sources":["../../../ts/utils/dom/guiSizeToggler.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAQH;;;;GAIG;AACH,MAAM,YAAY,GAAG,CAAC,GAAQ,EAAE,aAAsB,EAAE,QAAgC,EAAE,EAAE;IAC1F,IAAI,QAAQ,IAAI,QAAQ,CAAC,cAAc,CAAC,iBAAiB,CAAC,EAAE,CAAC;QAC3D,GAAG,CAAC,UAAU,CAAC,KAAK,CAAC,kBAAkB,CAAC,GAAG,QAAQ,CAAC,iBAAiB,CAAC,CAAC;IACzE,CAAC;SAAM,CAAC;QACN,GAAG,CAAC,UAAU,CAAC,KAAK,CAAC,kBAAkB,CAAC,GAAG,SAAS,CAAC;IACvD,CAAC;IAED,MAAM,SAAS,GAAG,QAAQ,IAAI,QAAQ,CAAC,cAAc,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,WAAW,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;IAEtG,OAAO,CAAC,GAAG,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;IACpC,IAAI,aAAa,EAAE,CAAC;QAClB,GAAG,CAAC,UAAU,CAAC,KAAK,CAAC,WAAW,CAAC,GAAG,SAAS,GAAG,YAAY,CAAC;IAC/D,CAAC;SAAM,CAAC;QACN,GAAG,CAAC,UAAU,CAAC,KAAK,CAAC,WAAW,CAAC,GAAG,SAAS,GAAG,YAAY,CAAC;IAC/D,CAAC;AACH,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,cAAc,CAAC,SAAS,GAAG,CAAC,GAAQ,EAAE,MAAsB,EAAE,QAAgC,EAAE,EAAE;IAC7G,OAAO;QACL,MAAM,EAAE;YACN,YAAY,CAAC,GAAG,EAAE,OAAO,CAAC,MAAM,CAAC,aAAa,CAAC,EAAE,QAAQ,CAAC,CAAC;QAC7D,CAAC;KACF,CAAC;AACJ,CAAC,CAAC"}
+{"version":3,"file":"guiSizeToggler.js","sourceRoot":"","sources":["../../../ts/utils/dom/guiSizeToggler.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAQH;;;;GAIG;AACH,MAAM,YAAY,GAAG,CAAC,GAAQ,EAAE,aAAsB,EAAE,QAAgC,EAAE,EAAE;IAC1F,IAAI,QAAQ,IAAI,QAAQ,CAAC,cAAc,CAAC,iBAAiB,CAAC,EAAE,CAAC;QAC3D,GAAG,CAAC,UAAU,CAAC,KAAK,CAAC,kBAAkB,CAAC,GAAG,QAAQ,CAAC,iBAAiB,CAAC,CAAC;IACzE,CAAC;SAAM,CAAC;QACN,GAAG,CAAC,UAAU,CAAC,KAAK,CAAC,kBAAkB,CAAC,GAAG,SAAS,CAAC;IACvD,CAAC;IAED,MAAM,SAAS,GAAG,QAAQ,IAAI,QAAQ,CAAC,cAAc,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,WAAW,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;IAEtG,OAAO,CAAC,GAAG,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;IACpC,IAAI,aAAa,EAAE,CAAC;QAClB,GAAG,CAAC,UAAU,CAAC,KAAK,CAAC,WAAW,CAAC,GAAG,SAAS,GAAG,YAAY,CAAC;IAC/D,CAAC;SAAM,CAAC;QACN,GAAG,CAAC,UAAU,CAAC,KAAK,CAAC,WAAW,CAAC,GAAG,SAAS,GAAG,YAAY,CAAC;IAC/D,CAAC;AACH,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,cAAc,GAAG,CAAC,GAAQ,EAAE,MAAsB,EAAE,QAAgC,EAAE,EAAE;IACnG,GAAG,CAAC,UAAU,CAAC,KAAK,CAAC,YAAY,CAAC,GAAG,gBAAgB,CAAC;IACtD,OAAO;QACL,MAAM,EAAE;YACN,YAAY,CAAC,GAAG,EAAE,OAAO,CAAC,MAAM,CAAC,aAAa,CAAC,EAAE,QAAQ,CAAC,CAAC;QAC7D,CAAC;KACF,CAAC;AACJ,CAAC,CAAC"}

package/src/ts/PlotBoilerplate.ts

@@ -85,8 +85,9 @@
  * @modified 2023-09-29 Adding proper dicionary key and value types to the params of `PlotBoilerplate.utils.safeMergeByKeys` (was `object` before).
  * @modified 2024-07-08 Adding `PlotBoilerplate.getGUI()` to retrieve the GUI instance.
  * @modified 2024-08-25 Extending main class `PlotBoilerplate` optional param `isBackdropFiltersEnabled`.
+ * @modified 2024-12-02 Adding the `triggerRedraw` to the `removeAll` method.
  *
- * @version  1.19.0
+ * @version  1.20.0
  *
  * @file PlotBoilerplate
  * @fileoverview The main class.
@@ -1032,16 +1033,19 @@ export class PlotBoilerplate {
    *
    * @method removeAll
    * @param {boolean=false} keepVertices
+   * @param {boolean=true} triggerRedraw - By default this method triggers the redraw routine; passing `false` will suppress redrawing.
    * @instance
    * @memberof PlotBoilerplate
    * @return {void}
    */
-  removeAll(keepVertices?: boolean) {
+  removeAll(keepVertices?: boolean, triggerRedraw?: boolean) {
     this.drawables = [];
     if (!Boolean(keepVertices)) {
       this.vertices = [];
     }
-    this.redraw();
+    if (triggerRedraw || typeof triggerRedraw === "undefined") {
+      this.redraw();
+    }
   }
 
   /**

package/src/ts/Polygon.ts

@@ -28,7 +28,11 @@
  * @modified 2023-09-25 Added the `Polygon.lineIntersections(Line,boolean)` function.
  * @modified 2023-09-29 Added the `Polygon.closestLineIntersection(Line,boolean)` function.
  * @modified 2023-11-24 Added the `Polygon.containsPolygon(Polygon)' function.
- * @version 1.12.0
+ * @modified 2024-10-12 Added the `getEdgeAt` method.
+ * @modified 2024-10-30 Added the `getEdges` method.
+ * @modified 2024-12-02 Added the `elimitateColinearEdges` method.
+ * @modified 2025-02-12 Added the `containsVerts` method to test multiple vertices for containment.
+ * @version 1.14.0
  *
  * @file Polygon
  * @public
@@ -37,9 +41,11 @@
 import { BezierPath } from "./BezierPath";
 import { Bounds } from "./Bounds";
 import { Line } from "./Line";
+import { Triangle } from "./Triangle";
 import { UIDGenerator } from "./UIDGenerator";
 import { VertTuple } from "./VertTuple";
 import { Vertex } from "./Vertex";
+import { geomutils } from "./geomutils";
 import { XYCoords, SVGSerializable, UID } from "./interfaces";
 
 /**
@@ -103,7 +109,9 @@ export class Polygon implements SVGSerializable {
    **/
   constructor(vertices?: Array<Vertex>, isOpen?: boolean) {
     this.uid = UIDGenerator.next();
-    if (typeof vertices == "undefined") vertices = [];
+    if (typeof vertices == "undefined") {
+      vertices = [];
+    }
     this.vertices = vertices;
     this.isOpen = isOpen || false;
   }
@@ -111,7 +119,7 @@ export class Polygon implements SVGSerializable {
   /**
    * Add a vertex to the end of the `vertices` array.
    *
-   * @method addVert
+   * @method addVertex
    * @param {Vertex} vert - The vertex to add.
    * @instance
    * @memberof Polygon
@@ -120,6 +128,117 @@ export class Polygon implements SVGSerializable {
     this.vertices.push(vert);
   }
 
+  /**
+   * Add a vertex at a particular position of the `vertices` array.
+   *
+   * @method addVertexAt
+   * @param {Vertex} vert - The vertex to add.
+   * @param {number} index - The position to add the vertex at. Will be handled modulo.
+   * @instance
+   * @memberof Polygon
+   **/
+  addVertexAt(vert: Vertex, index: number): void {
+    // var moduloIndex = index % (this.vertices.length + 1);
+    this.vertices.splice(index, 0, vert);
+  }
+
+  /**
+   * Get a new instance of the line at the given start index. The returned line will consist
+   * of the vertex at `vertIndex` and `vertIndex+1` (will be handled modulo).
+   *
+   * @method getEdgeAt
+   * @param {number} vertIndex - The vertex index of the line to start.
+   * @instance
+   * @memberof Polygon
+   * @return {Line}
+   **/
+  getEdgeAt(vertIndex: number): Line {
+    return new Line(this.getVertexAt(vertIndex), this.getVertexAt(vertIndex + 1));
+  }
+
+  /**
+   * Converts this polygon into a sequence of lines. Please note that each time
+   * this method is called new lines are created. The underlying line vertices are no clones
+   * (instances).
+   *
+   * @method getEdges
+   * @instance
+   * @memberof Polygon
+   * @return {Array<Line>}
+   */
+  getEdges(): Array<Line> {
+    const lines: Array<Line> = [];
+    for (var i = 0; i + 1 < this.vertices.length; i++) {
+      // var line = this.getLineAt(i).clone();
+      lines.push(this.getEdgeAt(i));
+    }
+    if (!this.isOpen && this.vertices.length > 0) {
+      lines.push(this.getEdgeAt(this.vertices.length - 1));
+    }
+    return lines;
+  }
+
+  /**
+   * Checks if the angle at the given polygon vertex (index) is acute. Please not that this is
+   * only working for clockwise polygons. If this polygon is not clockwise please use the
+   * `isClockwise` method and reverse polygon vertices if needed.
+   *
+   * @method isAngleAcute
+   * @instance
+   * @memberof Polygon
+   * @param {number} vertIndex - The index of the polygon vertex to check.
+   * @returns {boolean} `true` is angle is acute, `false` is obtuse.
+   */
+  getInnerAngleAt(vertIndex: number): number {
+    const p2: Vertex = this.vertices[vertIndex];
+    const p1: Vertex = this.vertices[(vertIndex + this.vertices.length - 1) % this.vertices.length].clone();
+    const p3: Vertex = this.vertices[(vertIndex + 1) % this.vertices.length].clone();
+
+    // See
+    //    https://math.stackexchange.com/questions/149959/how-to-find-the-interior-angle-of-an-irregular-pentagon-or-polygon
+    // π−arccos((P2−P1)⋅(P3−P2)|P2−P1||P3−P2|)
+
+    // Check if triangle is acute (will be used later)
+    // Acute angles and obtuse angles need to be handled differently.
+    const isAcute: boolean = this.isAngleAcute(vertIndex);
+
+    // Differences
+    const zero: Vertex = new Vertex(0, 0);
+    const p2mp1: Vertex = new Vertex(p2.x - p1.x, p2.y - p1.y);
+    const p3mp2: Vertex = new Vertex(p3.x - p2.x, p3.y - p2.y);
+    const p2mp1_len: number = zero.distance(p2mp1);
+    const p3mp2_len: number = zero.distance(p3mp2);
+
+    // Dot products
+    const dotProduct: number = geomutils.dotProduct(p2mp1, p3mp2);
+    const lengthProduct: number = p2mp1_len * p3mp2_len;
+    if (isAcute) {
+      return Math.PI - Math.acos(dotProduct / lengthProduct);
+    } else {
+      return Math.PI + Math.acos(dotProduct / lengthProduct);
+    }
+  }
+
+  /**
+   * Checks if the angle at the given polygon vertex (index) is acute.
+   *
+   * @method isAngleAcute
+   * @instance
+   * @memberof Polygon
+   * @param {number} vertIndex - The index of the polygon vertex to check.
+   * @returns {boolean} `true` is angle is acute, `false` is obtuse.
+   */
+  isAngleAcute(vertIndex: number): boolean {
+    const A: Vertex = this.vertices[(vertIndex + this.vertices.length - 1) % this.vertices.length].clone();
+    const B: Vertex = this.vertices[vertIndex];
+    const C: Vertex = this.vertices[(vertIndex + 1) % this.vertices.length].clone();
+
+    // Find local winding number for triangle A B C
+    const windingNumber: number = Triangle.utils.determinant(A, B, C);
+    // console.log("vertIndex", vertIndex, "windingNumber", windingNumber);
+    return windingNumber < 0;
+  }
+
   /**
    * Get the polygon vertex at the given position (index).
    *
@@ -130,15 +249,18 @@ export class Polygon implements SVGSerializable {
    *  - getVertexAt( vertices.length + k ) == getVertexAt( k )
    *  - getVertexAt( -k )                  == getVertexAt( vertices.length -k )
    *
-   * @metho getVertexAt
+   * @method getVertexAt
    * @param {number} index - The index of the desired vertex.
    * @instance
    * @memberof Polygon
    * @return {Vertex} At the given index.
    **/
   getVertexAt(index: number): Vertex {
-    if (index < 0) return this.vertices[this.vertices.length - (Math.abs(index) % this.vertices.length)];
-    else return this.vertices[index % this.vertices.length];
+    if (index < 0) {
+      return this.vertices[this.vertices.length - (Math.abs(index) % this.vertices.length)];
+    } else {
+      return this.vertices[index % this.vertices.length];
+    }
   }
 
   /**
@@ -164,7 +286,7 @@ export class Polygon implements SVGSerializable {
    *    https://stackoverflow.com/questions/22521982/check-if-point-inside-a-polygon
    *
    * @method containsVert
-   * @param {XYCoords} vert - The vertex to check. The new x-component.
+   * @param {XYCoords} vert - The vertex to check.
    * @return {boolean} True if the passed vertex is inside this polygon. The polygon is considered closed.
    * @instance
    * @memberof Polygon
@@ -185,6 +307,21 @@ export class Polygon implements SVGSerializable {
     return inside;
   }
 
+  /**
+   * Check if all given vertices are inside this polygon.<br>
+   * <br>
+   * This method just uses the `Polygon.containsVert` method.
+   *
+   * @method containsVerts
+   * @param {XYCoords[]} verts - The vertices to check.
+   * @return {boolean} True if all passed vertices are inside this polygon. The polygon is considered closed.
+   * @instance
+   * @memberof Polygon
+   **/
+  containsVerts(verts: XYCoords[]): boolean {
+    return verts.every((vert: XYCoords) => this.containsVert(vert));
+  }
+
   /**
    * Check if the passed polygon is completly contained inside this polygon.
    *
@@ -250,7 +387,8 @@ export class Polygon implements SVGSerializable {
    * @return {boolean}
    */
   isClockwise(): boolean {
-    return Polygon.utils.signedArea(this.vertices) < 0;
+    // return Polygon.utils.signedArea(this.vertices) < 0;
+    return Polygon.utils.isClockwise(this.vertices);
   }
 
   /**
@@ -311,6 +449,29 @@ export class Polygon implements SVGSerializable {
     return this;
   }
 
+  /**
+   * Get the mean `center` of this polygon by calculating the mean value of all vertices.
+   *
+   * Mean: (v[0] + v[1] + ... v[n-1]) / n
+   *
+   * @method getMeanCenter
+   * @instance
+   * @memberof Polygon
+   * @return {Vertex|null} `null` is no vertices are available.
+   */
+  getMeanCenter() {
+    if (this.vertices.length === 0) {
+      return null;
+    }
+    const center = this.vertices[0].clone();
+    for (var i = 1; i < this.vertices.length; i++) {
+      center.add(this.vertices[i]);
+    }
+    center.x /= this.vertices.length;
+    center.y /= this.vertices.length;
+    return center;
+  }
+
   /**
    * Get all line intersections with this polygon.
    *
@@ -460,6 +621,9 @@ export class Polygon implements SVGSerializable {
   /**
    * Create a deep copy of this polygon.
    *
+   * @method clone
+   * @instance
+   * @memberof Polygon
    * @return {Polygon} The cloned polygon.
    */
   clone(): Polygon {
@@ -469,6 +633,57 @@ export class Polygon implements SVGSerializable {
     );
   }
 
+  /**
+   * Create a new polygon without colinear adjacent edges. This method does not midify the current polygon
+   * but creates a new one.
+   *
+   * Please note that this method does NOT create deep clones of the vertices. Use Polygon.clone() if you need to.
+   *
+   * Please also note that the `tolerance` may become really large here, as the denominator of two closely
+   * parallel lines is usually pretty large. See the demo `57-eliminate-colinear-polygon-edges` to get
+   * an impression of how denominators work.
+   *
+   * @method elimitateColinearEdges
+   * @instance
+   * @memberof Polygon
+   * @param {number?} tolerance - (default is 1.0) The epsilon to detect co-linear edges.
+   * @return {Polygon} A new polygon without co-linear adjacent edges – respective the given epsilon.
+   */
+  elimitateColinearEdges(tolerance?: number): Polygon {
+    const eps: number = typeof tolerance === "undefined" ? 1.0 : tolerance;
+    const verts: Array<Vertex> = this.vertices.slice(); // Creates a shallow copy
+    let i: number = 0;
+    var lineA: Line = new Line(new Vertex(), new Vertex());
+    var lineB: Line = new Line(new Vertex(), new Vertex());
+    while (i + 1 < verts.length && verts.length > 2) {
+      const vertA = verts[i];
+      const vertB = verts[(i + 1) % verts.length];
+      lineA.a = vertA;
+      lineA.b = vertB;
+      lineB.a = vertB;
+      let areColinear: boolean = false;
+      let j = i + 2;
+      do {
+        let vertC: Vertex = verts[j % verts.length];
+        lineB.b = vertC;
+        areColinear = lineA.colinear(lineB, eps);
+        // console.log("are colinear?", i, i + 1, j, areColinear);
+        if (areColinear) {
+          j++;
+        }
+      } while (areColinear);
+      // Now j points to the first vertex that's NOT colinear to the current lineA
+      // -> delete all vertices in between
+      if (j - i > 2) {
+        // Means: there have been 'colinear vertices' in between
+        // console.log("Splice", "i", i, "j", j, i + 1, j - i - 1);
+        verts.splice(i + 1, j - i - 2);
+      }
+      i++;
+    }
+    return new Polygon(verts, this.isOpen);
+  }
+
   /**
    * Convert this polygon to a sequence of quadratic Bézier curves.<br>
    * <br>
@@ -572,7 +787,9 @@ export class Polygon implements SVGSerializable {
    **/
   toCubicBezierSVGString(threshold: number): string {
     var qdata: Array<Vertex> = this.toCubicBezierData(threshold);
-    if (qdata.length == 0) return "";
+    if (qdata.length == 0) {
+      return "";
+    }
     var buffer = ["M " + qdata[0].x + " " + qdata[0].y];
     for (var i = 1; i < qdata.length; i += 3) {
       buffer.push(
@@ -650,6 +867,10 @@ export class Polygon implements SVGSerializable {
       return Math.abs(total);
     },
 
+    isClockwise(vertices: Array<XYCoords>): boolean {
+      return Polygon.utils.signedArea(vertices) < 0;
+    },
+
     /**
      * Calulate the signed polyon area by interpreting the polygon as a matrix
      * and calculating its determinant.

package/src/ts/Triangle.ts

@@ -21,7 +21,9 @@
  * @modified  2021-01-22 Always updating circumcircle when retieving it.
  * @modified  2022-02-02 Added the `destroy` method.
  * @modified  2022-02-02 Cleared the `Triangle.toSVGString` function (deprecated). Use `drawutilssvg` instead.
- * @version   2.6.0
+ * @modified  2024-11-22 Added static utility function Triangle.utils.determinant; adapted method `determinant`.
+ * @modified  2024-11-22 Changing visibility of `Triangle.utils` from `private` to `public`.
+ * @version   2.8.0
  *
  * @file Triangle
  * @fileoverview A simple triangle class: three vertices.
@@ -35,7 +37,7 @@ import { Polygon } from "./Polygon";
 import { UIDGenerator } from "./UIDGenerator";
 import { Vertex } from "./Vertex";
 import { geomutils } from "./geomutils";
-import { SVGSerializable, UID } from "./interfaces";
+import { SVGSerializable, UID, XYCoords } from "./interfaces";
 
 /**
  * @classdesc A triangle class for triangulations.
@@ -374,7 +376,8 @@ export class Triangle implements SVGSerializable {
    */
   determinant(): number {
     // (b.y - a.y)*(c.x - b.x) - (c.y - b.y)*(b.x - a.x);
-    return (this.b.y - this.a.y) * (this.c.x - this.b.x) - (this.c.y - this.b.y) * (this.b.x - this.a.x);
+    // return (this.b.y - this.a.y) * (this.c.x - this.b.x) - (this.c.y - this.b.y) * (this.b.x - this.a.x);
+    return Triangle.utils.determinant(this.a, this.b, this.c);
   }
 
   /**
@@ -464,7 +467,7 @@ export class Triangle implements SVGSerializable {
     this.isDestroyed = true;
   }
 
-  private static utils = {
+  public static utils = {
     // Used in the bounds() function.
     max3(a: number, b: number, c: number): number {
       return a >= b && a >= c ? a : b >= a && b >= c ? b : c;
@@ -500,6 +503,17 @@ export class Triangle implements SVGSerializable {
       var t: number = (1 / (2 * area)) * (p0x * p1y - p0y * p1x + (p0y - p1y) * px + (p1x - p0x) * py);
 
       return s > 0 && t > 0 && 1 - s - t > 0;
+    },
+
+    /**
+     * Calculate the determinant of the three vertices a, b and c (in this order).
+     * @param {XYCords} a - The first vertex.
+     * @param {XYCords} b - The first vertex.
+     * @param {XYCords} c - The first vertex.
+     * @returns {nmber}
+     */
+    determinant(a: XYCoords, b: XYCoords, c: XYCoords): number {
+      return (b.y - a.y) * (c.x - b.x) - (c.y - b.y) * (b.x - a.x);
     }
   };
 }

package/src/ts/VertTuple.ts

@@ -10,7 +10,10 @@
  * @modified 2021-01-20 Added UID.
  * @modified 2022-02-02 Added the `destroy` method.
  * @modified 2023-09-29 Fixed a calculation error in the VertTuple.hasPoint() function; distance measure was broken!
- * @version 1.2.1
+ * @modified 2024-09-10 Chaging the first param of `pointDistance` from `Vertex` to less strict type `XYCoords`. This should not break anything.
+ * @modified 2024-09-10 Adding the optional `epsilon` param to the `hasPoint` method.
+ * @modified 2024-12-02 Added the `epsilon` param to the `colinear` method. Default is 1.0e-6.
+ * @version 1.3.0
  */
 
 import { Vertex } from "./Vertex";
@@ -234,12 +237,13 @@ export class VertTuple<T extends VertTuple<T>> {
    *
    * @method colinear
    * @param {VertTuple} line
+   * @param {epsilon?=1.0e-6} epsilon - The epsilon to use (default is 1.0e-6).
    * @instance
    * @memberof VertTuple
    * @return true if both lines are co-linear.
    */
-  colinear(line: VertTuple<T>): boolean {
-    return Math.abs(this.denominator(line)) < Vertex.EPSILON;
+  colinear(line: VertTuple<T>, epsilon?: number): boolean {
+    return Math.abs(this.denominator(line)) < (typeof epsilon === "undefined" ? Vertex.EPSILON : epsilon);
   }
 
   /**
@@ -269,20 +273,21 @@ export class VertTuple<T extends VertTuple<T>> {
    * that point is located between point `a` and `b`.
    *
    * @method hasPoint
-   * @param {Vertex} point The point to check.
-   * @param {boolean=} insideBoundsOnly If set to to true (default=false) the point must be between start and end point of the line.
+   * @param {Vertex} point - The point to check.
+   * @param {boolean=} insideBoundsOnly - [optional] If set to to true (default=false) the point must be between start and end point of the line.
+   * @param {number=Vertex.EPSILON} epsilon - [optional] A tolerance.
    * @return {boolean} True if the given point is on this line.
    * @instance
    * @memberof VertTuple
    */
-  hasPoint(point: XYCoords, insideBoundsOnly?: boolean): boolean {
+  hasPoint(point: XYCoords, insideBoundsOnly?: boolean, epsilon?: number): boolean {
     const t: number = this.getClosestT(point);
     // Compare to pointDistance?
     const distance: number = Math.sqrt(VertTuple.vtutils.dist2(point, this.vertAt(t)));
     if (typeof insideBoundsOnly !== "undefined" && insideBoundsOnly) {
-      return distance < Vertex.EPSILON && t >= 0 && t <= 1;
+      return distance < (epsilon ?? Vertex.EPSILON) && t >= 0 && t <= 1;
     } else {
-      return distance < Vertex.EPSILON; // t >= 0 && t <= 1;
+      return distance < (epsilon ?? Vertex.EPSILON); // t >= 0 && t <= 1;
     }
   }
 
@@ -304,12 +309,12 @@ export class VertTuple<T extends VertTuple<T>> {
    * The the minimal distance between this line and the specified point.
    *
    * @method pointDistance
-   * @param {Vertex} p The point (vertex) to measre the distance to.
+   * @param {XYCoords} p The point (vertex) to measre the distance to.
    * @return {number} The absolute minimal distance.
    * @instance
    * @memberof VertTuple
    **/
-  pointDistance(p: Vertex): number {
+  pointDistance(p: XYCoords): number {
     // Taken From:
     // https://stackoverflow.com/questions/849211/shortest-distance-between-a-point-and-a-line-segment
     return Math.sqrt(VertTuple.vtutils.dist2(p, this.vertAt(this.getClosestT(p))));

package/src/ts/Vertex.ts

@@ -32,7 +32,8 @@
  * @modified 2023-09-29 Downgraded types for the `Vertex.utils.buildArrowHead` function (replacing Vertex params by more generic XYCoords type).
  * @modified 2023-09-29 Added the `Vertex.abs()` method as it seems useful.
  * @modified 2024-03-08 Added the optional `precision` param to the `toString` method.
- * @version  2.9.0
+ * @modified 2024-12-17 Outsourced the euclidean distance calculation of `Vertex.distance` to `geomutils.dist4`.
+ * @version  2.9.1
  *
  * @file Vertex
  * @public
@@ -42,6 +43,7 @@ import { IVertexAttr, VertexAttr } from "./VertexAttr";
 import { UIDGenerator } from "./UIDGenerator";
 import { VertexListeners } from "./VertexListeners";
 import { XYCoords, SVGSerializable, UID } from "./interfaces";
+import { geomutils } from "./geomutils";
 
 /**
  * @classdesc A vertex is a pair of two numbers.<br>
@@ -430,7 +432,8 @@ export class Vertex implements XYCoords, SVGSerializable {
    * @memberof Vertex
    **/
   distance(vert: XYCoords): number {
-    return Math.sqrt(Math.pow(vert.x - this.x, 2) + Math.pow(vert.y - this.y, 2));
+    // return Math.sqrt(Math.pow(vert.x - this.x, 2) + Math.pow(vert.y - this.y, 2));
+    return geomutils.dist4(this.x, this.y, vert.x, vert.y);
   }
 
   /**

package/src/ts/draw.ts

@@ -56,6 +56,7 @@
  * @modified 2023-09-29 Added the `lineDashes` attribute.
  * @modified 2023-09-30 Adding `strokeOptions` param to these draw function: line, arrow, cubicBezierArrow, cubicBezier, cubicBezierPath, circle, circleArc, ellipse, square, rect, polygon, polyline.
  * @modified 2023-10-07 Adding the optional `arrowHeadBasePositionBuffer` param to the arrowHead(...) method.
+ * @modified 2024-09-13 Remoed the scaling of `lineWidth` in the `polygon` and `polyline` methods. This makes no sense here and doesn't match up with the behavior of other line functions.
  * @version  1.13.0
  **/
 
@@ -1209,7 +1210,7 @@ export class drawutils implements DrawLib<void> {
     this.ctx.save();
     this.applyStrokeOpts(strokeOptions);
     this.ctx.beginPath();
-    this.ctx.lineWidth = (lineWidth || 1.0) * this.scale.x;
+    this.ctx.lineWidth = lineWidth || 1.0;
     this.ctx.moveTo(this.offset.x + vertices[0].x * this.scale.x, this.offset.y + vertices[0].y * this.scale.y);
     for (var i = 0; i < vertices.length; i++) {
       this.ctx.lineTo(this.offset.x + vertices[i].x * this.scale.x, this.offset.y + vertices[i].y * this.scale.y);

package/src/ts/drawutilssvg.ts

@@ -1288,6 +1288,35 @@ export class drawutilssvg implements DrawLib<void | SVGElement> {
    * @memberof drawutilssvg
    */
   grid(center: XYCoords, width: number, height: number, sizeX: number, sizeY: number, color: string) {
+    // console.log("grid");
+    // const node: SVGElement = this.makeNode("pattern");
+    // var patternId = "pattern_id_" + Math.floor(Math.random() * 65365);
+    // node.setAttribute("id", patternId);
+    // node.setAttribute("viewBox", `0,0,${sizeX},${sizeY}`);
+    // node.setAttribute("width", `${sizeX}`);
+    // node.setAttribute("height", `${sizeX}`);
+
+    // var pattern: SVGElement = this.makeNode("path");
+    // const d: SVGPathParams = [];
+    // d.push("M", sizeX / 2.0, 0);
+    // d.push("L", sizeX / 2.0, sizeY);
+    // d.push("M", 0, sizeY / 2.0);
+    // d.push("L", sizeX, sizeY / 2.0);
+    // node.setAttribute("d", d.join(" "));
+
+    // this.bufferedNodeDefs.append(pattern);
+
+    // const fillNode: SVGElement = this.makeNode("rect");
+    // // For some strange reason SVG rotation transforms use degrees instead of radians
+    // // Note that the background does not scale with the zoom level (always covers full element)
+    // fillNode.setAttribute("x", "0");
+    // fillNode.setAttribute("y", "0");
+    // fillNode.setAttribute("width", `${this.canvasSize.width}`);
+    // fillNode.setAttribute("height", `${this.canvasSize.height}`);
+    // fillNode.setAttribute("fill", `url(#${patternId})`);
+
+    // return this._bindFillDraw(fillNode, "grid", "red", 1);
+
     const node: SVGElement = this.makeNode("path");
     const d: SVGPathParams = [];