three-text 0.4.9 → 0.4.11

package/dist/index.js

@@ -1,5 +1,5 @@
 /*!
- * three-text v0.4.9
+ * three-text v0.4.11
  * Copyright (C) 2025 Countertype LLC
  * 
  * This program is free software: you can redistribute it and/or modify
@@ -2434,102 +2434,17 @@ const globalContourCache = new Cache();
 const globalWordCache = new Cache();
 const globalClusteringCache = new Cache();
 
-var commonjsGlobal = typeof globalThis !== 'undefined' ? globalThis : typeof window !== 'undefined' ? window : typeof global !== 'undefined' ? global : typeof self !== 'undefined' ? self : {};
-
-function getDefaultExportFromCjs (x) {
-	return x && x.__esModule && Object.prototype.hasOwnProperty.call(x, 'default') ? x['default'] : x;
-}
-
-function getAugmentedNamespace(n) {
-  if (n.__esModule) return n;
-  var f = n.default;
-	if (typeof f == "function") {
-		var a = function a () {
-			if (this instanceof a) {
-        return Reflect.construct(f, arguments, this.constructor);
-			}
-			return f.apply(this, arguments);
-		};
-		a.prototype = f.prototype;
-  } else a = {};
-  Object.defineProperty(a, '__esModule', {value: true});
-	Object.keys(n).forEach(function (k) {
-		var d = Object.getOwnPropertyDescriptor(n, k);
-		Object.defineProperty(a, k, d.get ? d : {
-			enumerable: true,
-			get: function () {
-				return n[k];
-			}
-		});
-	});
-	return a;
-}
-
-var libtess_min = {exports: {}};
-
-/*
-
- Copyright 2000, Silicon Graphics, Inc. All Rights Reserved.
- Copyright 2015, Google Inc. All Rights Reserved.
-
- Permission is hereby granted, free of charge, to any person obtaining a copy
- of this software and associated documentation files (the "Software"), to
- deal in the Software without restriction, including without limitation the
- rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
- sell copies of the Software, and to permit persons to whom the Software is
- furnished to do so, subject to the following conditions:
-
- The above copyright notice including the dates of first publication and
- either this permission notice or a reference to http://oss.sgi.com/projects/FreeB/
- shall be included in all copies or substantial portions of the Software.
-
- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
- IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
- FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
- SILICON GRAPHICS, INC. BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
- WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR
- IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
-
- Original Code. The Original Code is: OpenGL Sample Implementation,
- Version 1.2.1, released January 26, 2000, developed by Silicon Graphics,
- Inc. The Original Code is Copyright (c) 1991-2000 Silicon Graphics, Inc.
- Copyright in any portions created by third parties is as indicated
- elsewhere herein. All Rights Reserved.
-*/
-
-(function (module) {
-var n;function t(a,b){return a.b===b.b&&a.a===b.a}function u(a,b){return a.b<b.b||a.b===b.b&&a.a<=b.a}function v(a,b,c){var d=b.b-a.b,e=c.b-b.b;return 0<d+e?d<e?b.a-a.a+d/(d+e)*(a.a-c.a):b.a-c.a+e/(d+e)*(c.a-a.a):0}function x(a,b,c){var d=b.b-a.b,e=c.b-b.b;return 0<d+e?(b.a-c.a)*d+(b.a-a.a)*e:0}function z(a,b){return a.a<b.a||a.a===b.a&&a.b<=b.b}function aa(a,b,c){var d=b.a-a.a,e=c.a-b.a;return 0<d+e?d<e?b.b-a.b+d/(d+e)*(a.b-c.b):b.b-c.b+e/(d+e)*(c.b-a.b):0}
-	function ba(a,b,c){var d=b.a-a.a,e=c.a-b.a;return 0<d+e?(b.b-c.b)*d+(b.b-a.b)*e:0}function ca(a){return u(a.b.a,a.a)}function da(a){return u(a.a,a.b.a)}function A(a,b,c,d){a=0>a?0:a;c=0>c?0:c;return a<=c?0===c?(b+d)/2:b+a/(a+c)*(d-b):d+c/(a+c)*(b-d)}function ea(a){var b=B(a.b);C(b,a.c);C(b.b,a.c);D(b,a.a);return b}function E(a,b){var c=!1,d=!1;a!==b&&(b.a!==a.a&&(d=!0,F(b.a,a.a)),b.d!==a.d&&(c=!0,G(b.d,a.d)),H(b,a),d||(C(b,a.a),a.a.c=a),c||(D(b,a.d),a.d.a=a));}function I(a){var b=a.b,c=!1;a.d!==a.b.d&&(c=!0,G(a.d,a.b.d));a.c===a?F(a.a,null):(a.b.d.a=J(a),a.a.c=a.c,H(a,J(a)),c||D(a,a.d));b.c===b?(F(b.a,null),G(b.d,null)):(a.d.a=J(b),b.a.c=b.c,H(b,J(b)));fa(a);}
-	function K(a){var b=B(a),c=b.b;H(b,a.e);b.a=a.b.a;C(c,b.a);b.d=c.d=a.d;b=b.b;H(a.b,J(a.b));H(a.b,b);a.b.a=b.a;b.b.a.c=b.b;b.b.d=a.b.d;b.f=a.f;b.b.f=a.b.f;return b}function L(a,b){var c=!1,d=B(a),e=d.b;b.d!==a.d&&(c=!0,G(b.d,a.d));H(d,a.e);H(e,b);d.a=a.b.a;e.a=b.a;d.d=e.d=a.d;a.d.a=e;c||D(d,a.d);return d}function B(a){var b=new M,c=new M,d=a.b.h;c.h=d;d.b.h=b;b.h=a;a.b.h=c;b.b=c;b.c=b;b.e=c;c.b=b;c.c=c;return c.e=b}function H(a,b){var c=a.c,d=b.c;c.b.e=b;d.b.e=a;a.c=d;b.c=c;}
-	function C(a,b){var c=b.f,d=new N(b,c);c.e=d;b.f=d;c=d.c=a;do c.a=d,c=c.c;while(c!==a)}function D(a,b){var c=b.d,d=new ga(b,c);c.b=d;b.d=d;d.a=a;d.c=b.c;c=a;do c.d=d,c=c.e;while(c!==a)}function fa(a){var b=a.h;a=a.b.h;b.b.h=a;a.b.h=b;}function F(a,b){var c=a.c,d=c;do d.a=b,d=d.c;while(d!==c);c=a.f;d=a.e;d.f=c;c.e=d;}function G(a,b){var c=a.a,d=c;do d.d=b,d=d.e;while(d!==c);c=a.d;d=a.b;d.d=c;c.b=d;}function ha(a){var b=0;Math.abs(a[1])>Math.abs(a[0])&&(b=1);Math.abs(a[2])>Math.abs(a[b])&&(b=2);return b}var O=4*1E150;function P(a,b){a.f+=b.f;a.b.f+=b.b.f;}function ia(a,b,c){a=a.a;b=b.a;c=c.a;if(b.b.a===a)return c.b.a===a?u(b.a,c.a)?0>=x(c.b.a,b.a,c.a):0<=x(b.b.a,c.a,b.a):0>=x(c.b.a,a,c.a);if(c.b.a===a)return 0<=x(b.b.a,a,b.a);b=v(b.b.a,a,b.a);a=v(c.b.a,a,c.a);return b>=a}function Q(a){a.a.i=null;var b=a.e;b.a.c=b.c;b.c.a=b.a;a.e=null;}function ja(a,b){I(a.a);a.c=!1;a.a=b;b.i=a;}function ka(a){var b=a.a.a;do a=R(a);while(a.a.a===b);a.c&&(b=L(S(a).a.b,a.a.e),ja(a,b),a=R(a));return a}
-	function la(a,b,c){var d=new ma;d.a=c;d.e=na(a.f,b.e,d);return c.i=d}function oa(a,b){switch(a.s){case 100130:return 0!==(b&1);case 100131:return 0!==b;case 100132:return 0<b;case 100133:return 0>b;case 100134:return 2<=b||-2>=b}return !1}function pa(a){var b=a.a,c=b.d;c.c=a.d;c.a=b;Q(a);}function T(a,b,c){a=b;for(b=b.a;a!==c;){a.c=!1;var d=S(a),e=d.a;if(e.a!==b.a){if(!d.c){pa(a);break}e=L(b.c.b,e.b);ja(d,e);}b.c!==e&&(E(J(e),e),E(b,e));pa(a);b=d.a;a=d;}return b}
-	function U(a,b,c,d,e,f){var g=!0;do la(a,b,c.b),c=c.c;while(c!==d);for(null===e&&(e=S(b).a.b.c);;){d=S(b);c=d.a.b;if(c.a!==e.a)break;c.c!==e&&(E(J(c),c),E(J(e),c));d.f=b.f-c.f;d.d=oa(a,d.f);b.b=!0;!g&&qa(a,b)&&(P(c,e),Q(b),I(e));g=!1;b=d;e=c;}b.b=!0;f&&ra(a,b);}function sa(a,b,c,d,e){var f=[b.g[0],b.g[1],b.g[2]];b.d=null;b.d=a.o?a.o(f,c,d,a.c)||null:null;null===b.d&&(e?a.n||(V(a,100156),a.n=!0):b.d=c[0]);}
-	function ta(a,b,c){var d=[null,null,null,null];d[0]=b.a.d;d[1]=c.a.d;sa(a,b.a,d,[.5,.5,0,0],!1);E(b,c);}function ua(a,b,c,d,e){var f=Math.abs(b.b-a.b)+Math.abs(b.a-a.a),g=Math.abs(c.b-a.b)+Math.abs(c.a-a.a),h=e+1;d[e]=.5*g/(f+g);d[h]=.5*f/(f+g);a.g[0]+=d[e]*b.g[0]+d[h]*c.g[0];a.g[1]+=d[e]*b.g[1]+d[h]*c.g[1];a.g[2]+=d[e]*b.g[2]+d[h]*c.g[2];}
-	function qa(a,b){var c=S(b),d=b.a,e=c.a;if(u(d.a,e.a)){if(0<x(e.b.a,d.a,e.a))return !1;if(!t(d.a,e.a))K(e.b),E(d,J(e)),b.b=c.b=!0;else if(d.a!==e.a){var c=a.e,f=d.a.h;if(0<=f){var c=c.b,g=c.d,h=c.e,k=c.c,l=k[f];g[l]=g[c.a];k[g[l]]=l;l<=--c.a&&(1>=l?W(c,l):u(h[g[l>>1]],h[g[l]])?W(c,l):va(c,l));h[f]=null;k[f]=c.b;c.b=f;}else for(c.c[-(f+1)]=null;0<c.a&&null===c.c[c.d[c.a-1]];)--c.a;ta(a,J(e),d);}}else {if(0>x(d.b.a,e.a,d.a))return !1;R(b).b=b.b=!0;K(d.b);E(J(e),d);}return !0}
-	function wa(a,b){var c=S(b),d=b.a,e=c.a,f=d.a,g=e.a,h=d.b.a,k=e.b.a,l=new N;x(h,a.a,f);x(k,a.a,g);if(f===g||Math.min(f.a,h.a)>Math.max(g.a,k.a))return !1;if(u(f,g)){if(0<x(k,f,g))return !1}else if(0>x(h,g,f))return !1;var r=h,p=f,q=k,y=g,m,w;u(r,p)||(m=r,r=p,p=m);u(q,y)||(m=q,q=y,y=m);u(r,q)||(m=r,r=q,q=m,m=p,p=y,y=m);u(q,p)?u(p,y)?(m=v(r,q,p),w=v(q,p,y),0>m+w&&(m=-m,w=-w),l.b=A(m,q.b,w,p.b)):(m=x(r,q,p),w=-x(r,y,p),0>m+w&&(m=-m,w=-w),l.b=A(m,q.b,w,y.b)):l.b=(q.b+p.b)/2;z(r,p)||(m=r,r=p,p=m);z(q,y)||
-	(m=q,q=y,y=m);z(r,q)||(m=r,r=q,q=m,m=p,p=y,y=m);z(q,p)?z(p,y)?(m=aa(r,q,p),w=aa(q,p,y),0>m+w&&(m=-m,w=-w),l.a=A(m,q.a,w,p.a)):(m=ba(r,q,p),w=-ba(r,y,p),0>m+w&&(m=-m,w=-w),l.a=A(m,q.a,w,y.a)):l.a=(q.a+p.a)/2;u(l,a.a)&&(l.b=a.a.b,l.a=a.a.a);r=u(f,g)?f:g;u(r,l)&&(l.b=r.b,l.a=r.a);if(t(l,f)||t(l,g))return qa(a,b),!1;if(!t(h,a.a)&&0<=x(h,a.a,l)||!t(k,a.a)&&0>=x(k,a.a,l)){if(k===a.a)return K(d.b),E(e.b,d),b=ka(b),d=S(b).a,T(a,S(b),c),U(a,b,J(d),d,d,!0),!0;if(h===a.a){K(e.b);E(d.e,J(e));f=c=b;g=f.a.b.a;
-	do f=R(f);while(f.a.b.a===g);b=f;f=S(b).a.b.c;c.a=J(e);e=T(a,c,null);U(a,b,e.c,d.b.c,f,!0);return !0}0<=x(h,a.a,l)&&(R(b).b=b.b=!0,K(d.b),d.a.b=a.a.b,d.a.a=a.a.a);0>=x(k,a.a,l)&&(b.b=c.b=!0,K(e.b),e.a.b=a.a.b,e.a.a=a.a.a);return !1}K(d.b);K(e.b);E(J(e),d);d.a.b=l.b;d.a.a=l.a;d.a.h=xa(a.e,d.a);d=d.a;e=[0,0,0,0];l=[f.d,h.d,g.d,k.d];d.g[0]=d.g[1]=d.g[2]=0;ua(d,f,h,e,0);ua(d,g,k,e,2);sa(a,d,l,e,!0);R(b).b=b.b=c.b=!0;return !1}
-	function ra(a,b){for(var c=S(b);;){for(;c.b;)b=c,c=S(c);if(!b.b&&(c=b,b=R(b),null===b||!b.b))break;b.b=!1;var d=b.a,e=c.a,f;if(f=d.b.a!==e.b.a)a:{f=b;var g=S(f),h=f.a,k=g.a,l=void 0;if(u(h.b.a,k.b.a)){if(0>x(h.b.a,k.b.a,h.a)){f=!1;break a}R(f).b=f.b=!0;l=K(h);E(k.b,l);l.d.c=f.d;}else {if(0<x(k.b.a,h.b.a,k.a)){f=!1;break a}f.b=g.b=!0;l=K(k);E(h.e,k.b);l.b.d.c=f.d;}f=!0;}f&&(c.c?(Q(c),I(e),c=S(b),e=c.a):b.c&&(Q(b),I(d),b=R(c),d=b.a));if(d.a!==e.a)if(d.b.a===e.b.a||b.c||c.c||d.b.a!==a.a&&e.b.a!==a.a)qa(a,
-	b);else if(wa(a,b))break;d.a===e.a&&d.b.a===e.b.a&&(P(e,d),Q(b),I(d),b=R(c));}}
-	function ya(a,b){a.a=b;for(var c=b.c;null===c.i;)if(c=c.c,c===b.c){var c=a,d=b,e=new ma;e.a=d.c.b;var f=c.f,g=f.a;do g=g.a;while(null!==g.b&&!f.c(f.b,e,g.b));var f=g.b,h=S(f),e=f.a,g=h.a;if(0===x(e.b.a,d,e.a))e=f.a,t(e.a,d)||t(e.b.a,d)||(K(e.b),f.c&&(I(e.c),f.c=!1),E(d.c,e),ya(c,d));else {var k=u(g.b.a,e.b.a)?f:h,h=void 0;f.d||k.c?(k===f?h=L(d.c.b,e.e):h=L(g.b.c.b,d.c).b,k.c?ja(k,h):(e=c,f=la(c,f,h),f.f=R(f).f+f.a.f,f.d=oa(e,f.f)),ya(c,d)):U(c,f,d.c,d.c,null,!0);}return}c=ka(c.i);e=S(c);f=e.a;e=T(a,
-	e,null);if(e.c===f){var f=e,e=f.c,g=S(c),h=c.a,k=g.a,l=!1;h.b.a!==k.b.a&&wa(a,c);t(h.a,a.a)&&(E(J(e),h),c=ka(c),e=S(c).a,T(a,S(c),g),l=!0);t(k.a,a.a)&&(E(f,J(k)),f=T(a,g,null),l=!0);l?U(a,c,f.c,e,e,!0):(u(k.a,h.a)?d=J(k):d=h,d=L(f.c.b,d),U(a,c,d,d.c,d.c,!1),d.b.i.c=!0,ra(a,c));}else U(a,c,e.c,f,f,!0);}function za(a,b){var c=new ma,d=ea(a.b);d.a.b=O;d.a.a=b;d.b.a.b=-O;d.b.a.a=b;a.a=d.b.a;c.a=d;c.f=0;c.d=!1;c.c=!1;c.h=!0;c.b=!1;d=a.f;d=na(d,d.a,c);c.e=d;}function Aa(a){this.a=new Ba;this.b=a;this.c=ia;}function na(a,b,c){do b=b.c;while(null!==b.b&&!a.c(a.b,b.b,c));a=new Ba(c,b.a,b);b.a.c=a;return b.a=a}function Ba(a,b,c){this.b=a||null;this.a=b||this;this.c=c||this;}function X(){this.d=Y;this.p=this.b=this.q=null;this.j=[0,0,0];this.s=100130;this.n=!1;this.o=this.a=this.e=this.f=null;this.m=!1;this.c=this.r=this.i=this.k=this.l=this.h=null;}var Y=0;n=X.prototype;n.x=function(){Z(this,Y);};n.B=function(a,b){switch(a){case 100142:return;case 100140:switch(b){case 100130:case 100131:case 100132:case 100133:case 100134:this.s=b;return}break;case 100141:this.m=!!b;return;default:V(this,100900);return}V(this,100901);};
-	n.y=function(a){switch(a){case 100142:return 0;case 100140:return this.s;case 100141:return this.m;default:V(this,100900);}return !1};n.A=function(a,b,c){this.j[0]=a;this.j[1]=b;this.j[2]=c;};
-	n.z=function(a,b){var c=b?b:null;switch(a){case 100100:case 100106:this.h=c;break;case 100104:case 100110:this.l=c;break;case 100101:case 100107:this.k=c;break;case 100102:case 100108:this.i=c;break;case 100103:case 100109:this.p=c;break;case 100105:case 100111:this.o=c;break;case 100112:this.r=c;break;default:V(this,100900);}};
-	n.C=function(a,b){var c=!1,d=[0,0,0];Z(this,2);for(var e=0;3>e;++e){var f=a[e];-1E150>f&&(f=-1E150,c=!0);1E150<f&&(f=1E150,c=!0);d[e]=f;}c&&V(this,100155);c=this.q;null===c?(c=ea(this.b),E(c,c.b)):(K(c),c=c.e);c.a.d=b;c.a.g[0]=d[0];c.a.g[1]=d[1];c.a.g[2]=d[2];c.f=1;c.b.f=-1;this.q=c;};n.u=function(a){Z(this,Y);this.d=1;this.b=new Ca;this.c=a;};n.t=function(){Z(this,1);this.d=2;this.q=null;};n.v=function(){Z(this,2);this.d=1;};
-	n.w=function(){Z(this,1);this.d=Y;var a=this.j[0],b=this.j[1],c=this.j[2],d=!1,e=[a,b,c];if(0===a&&0===b&&0===c){for(var b=[-2*1E150,-2*1E150,-2*1E150],f=[2*1E150,2*1E150,2*1E150],c=[],g=[],d=this.b.c,a=d.e;a!==d;a=a.e)for(var h=0;3>h;++h){var k=a.g[h];k<f[h]&&(f[h]=k,g[h]=a);k>b[h]&&(b[h]=k,c[h]=a);}a=0;b[1]-f[1]>b[0]-f[0]&&(a=1);b[2]-f[2]>b[a]-f[a]&&(a=2);if(f[a]>=b[a])e[0]=0,e[1]=0,e[2]=1;else {b=0;f=g[a];c=c[a];g=[0,0,0];f=[f.g[0]-c.g[0],f.g[1]-c.g[1],f.g[2]-c.g[2]];h=[0,0,0];for(a=d.e;a!==d;a=
-	a.e)h[0]=a.g[0]-c.g[0],h[1]=a.g[1]-c.g[1],h[2]=a.g[2]-c.g[2],g[0]=f[1]*h[2]-f[2]*h[1],g[1]=f[2]*h[0]-f[0]*h[2],g[2]=f[0]*h[1]-f[1]*h[0],k=g[0]*g[0]+g[1]*g[1]+g[2]*g[2],k>b&&(b=k,e[0]=g[0],e[1]=g[1],e[2]=g[2]);0>=b&&(e[0]=e[1]=e[2]=0,e[ha(f)]=1);}d=!0;}g=ha(e);a=this.b.c;b=(g+1)%3;c=(g+2)%3;g=0<e[g]?1:-1;for(e=a.e;e!==a;e=e.e)e.b=e.g[b],e.a=g*e.g[c];if(d){e=0;d=this.b.a;for(a=d.b;a!==d;a=a.b)if(b=a.a,!(0>=b.f)){do e+=(b.a.b-b.b.a.b)*(b.a.a+b.b.a.a),b=b.e;while(b!==a.a)}if(0>e)for(e=this.b.c,d=e.e;d!==
-	e;d=d.e)d.a=-d.a;}this.n=!1;e=this.b.b;for(a=e.h;a!==e;a=d)if(d=a.h,b=a.e,t(a.a,a.b.a)&&a.e.e!==a&&(ta(this,b,a),I(a),a=b,b=a.e),b.e===a){if(b!==a){if(b===d||b===d.b)d=d.h;I(b);}if(a===d||a===d.b)d=d.h;I(a);}this.e=e=new Da;d=this.b.c;for(a=d.e;a!==d;a=a.e)a.h=xa(e,a);Ea(e);this.f=new Aa(this);za(this,-O);for(za(this,O);null!==(e=Fa(this.e));){for(;;){a:if(a=this.e,0===a.a)d=Ga(a.b);else if(d=a.c[a.d[a.a-1]],0!==a.b.a&&(a=Ga(a.b),u(a,d))){d=a;break a}if(null===d||!t(d,e))break;d=Fa(this.e);ta(this,e.c,
-	d.c);}ya(this,e);}this.a=this.f.a.a.b.a.a;for(e=0;null!==(d=this.f.a.a.b);)d.h||++e,Q(d);this.f=null;e=this.e;e.b=null;e.d=null;this.e=e.c=null;e=this.b;for(a=e.a.b;a!==e.a;a=d)d=a.b,a=a.a,a.e.e===a&&(P(a.c,a),I(a));if(!this.n){e=this.b;if(this.m)for(a=e.b.h;a!==e.b;a=d)d=a.h,a.b.d.c!==a.d.c?a.f=a.d.c?1:-1:I(a);else for(a=e.a.b;a!==e.a;a=d)if(d=a.b,a.c){for(a=a.a;u(a.b.a,a.a);a=a.c.b);for(;u(a.a,a.b.a);a=a.e);b=a.c.b;for(c=void 0;a.e!==b;)if(u(a.b.a,b.a)){for(;b.e!==a&&(ca(b.e)||0>=x(b.a,b.b.a,b.e.b.a));)c=
-	L(b.e,b),b=c.b;b=b.c.b;}else {for(;b.e!==a&&(da(a.c.b)||0<=x(a.b.a,a.a,a.c.b.a));)c=L(a,a.c.b),a=c.b;a=a.e;}for(;b.e.e!==a;)c=L(b.e,b),b=c.b;}if(this.h||this.i||this.k||this.l)if(this.m)for(e=this.b,d=e.a.b;d!==e.a;d=d.b){if(d.c){this.h&&this.h(2,this.c);a=d.a;do this.k&&this.k(a.a.d,this.c),a=a.e;while(a!==d.a);this.i&&this.i(this.c);}}else {e=this.b;d=!!this.l;a=!1;b=-1;for(c=e.a.d;c!==e.a;c=c.d)if(c.c){a||(this.h&&this.h(4,this.c),a=!0);g=c.a;do d&&(f=g.b.d.c?0:1,b!==f&&(b=f,this.l&&this.l(!!b,this.c))),
-	this.k&&this.k(g.a.d,this.c),g=g.e;while(g!==c.a)}a&&this.i&&this.i(this.c);}if(this.r){e=this.b;for(a=e.a.b;a!==e.a;a=d)if(d=a.b,!a.c){b=a.a;c=b.e;g=void 0;do g=c,c=g.e,g.d=null,null===g.b.d&&(g.c===g?F(g.a,null):(g.a.c=g.c,H(g,J(g))),f=g.b,f.c===f?F(f.a,null):(f.a.c=f.c,H(f,J(f))),fa(g));while(g!==b);b=a.d;a=a.b;a.d=b;b.b=a;}this.r(this.b);this.c=this.b=null;return}}this.b=this.c=null;};
-	function Z(a,b){if(a.d!==b)for(;a.d!==b;)if(a.d<b)switch(a.d){case Y:V(a,100151);a.u(null);break;case 1:V(a,100152),a.t();}else switch(a.d){case 2:V(a,100154);a.v();break;case 1:V(a,100153),a.w();}}function V(a,b){a.p&&a.p(b,a.c);}function ga(a,b){this.b=a||this;this.d=b||this;this.a=null;this.c=!1;}function M(){this.h=this;this.i=this.d=this.a=this.e=this.c=this.b=null;this.f=0;}function J(a){return a.b.e}function Ca(){this.c=new N;this.a=new ga;this.b=new M;this.d=new M;this.b.b=this.d;this.d.b=this.b;}function N(a,b){this.e=a||this;this.f=b||this;this.d=this.c=null;this.g=[0,0,0];this.h=this.a=this.b=0;}function Da(){this.c=[];this.d=null;this.a=0;this.e=!1;this.b=new Ha;}function Ea(a){a.d=[];for(var b=0;b<a.a;b++)a.d[b]=b;a.d.sort(function(a){return function(b,e){return u(a[b],a[e])?1:-1}}(a.c));a.e=!0;Ia(a.b);}function xa(a,b){if(a.e){var c=a.b,d=++c.a;2*d>c.f&&(c.f*=2,c.c=Ja(c.c,c.f+1));var e;0===c.b?e=d:(e=c.b,c.b=c.c[c.b]);c.e[e]=b;c.c[e]=d;c.d[d]=e;c.h&&va(c,d);return e}c=a.a++;a.c[c]=b;return -(c+1)}
-	function Fa(a){if(0===a.a)return Ka(a.b);var b=a.c[a.d[a.a-1]];if(0!==a.b.a&&u(Ga(a.b),b))return Ka(a.b);do--a.a;while(0<a.a&&null===a.c[a.d[a.a-1]]);return b}function Ha(){this.d=Ja([0],33);this.e=[null,null];this.c=[0,0];this.a=0;this.f=32;this.b=0;this.h=!1;this.d[1]=1;}function Ja(a,b){for(var c=Array(b),d=0;d<a.length;d++)c[d]=a[d];for(;d<b;d++)c[d]=0;return c}function Ia(a){for(var b=a.a;1<=b;--b)W(a,b);a.h=!0;}function Ga(a){return a.e[a.d[1]]}function Ka(a){var b=a.d,c=a.e,d=a.c,e=b[1],f=c[e];0<a.a&&(b[1]=b[a.a],d[b[1]]=1,c[e]=null,d[e]=a.b,a.b=e,0<--a.a&&W(a,1));return f}
-	function W(a,b){for(var c=a.d,d=a.e,e=a.c,f=b,g=c[f];;){var h=f<<1;h<a.a&&u(d[c[h+1]],d[c[h]])&&(h+=1);var k=c[h];if(h>a.a||u(d[g],d[k])){c[f]=g;e[g]=f;break}c[f]=k;e[k]=f;f=h;}}function va(a,b){for(var c=a.d,d=a.e,e=a.c,f=b,g=c[f];;){var h=f>>1,k=c[h];if(0===h||u(d[k],d[g])){c[f]=g;e[g]=f;break}c[f]=k;e[k]=f;f=h;}}function ma(){this.e=this.a=null;this.f=0;this.c=this.b=this.h=this.d=!1;}function S(a){return a.e.c.b}function R(a){return a.e.a.b}commonjsGlobal.libtess={GluTesselator:X,windingRule:{GLU_TESS_WINDING_ODD:100130,GLU_TESS_WINDING_NONZERO:100131,GLU_TESS_WINDING_POSITIVE:100132,GLU_TESS_WINDING_NEGATIVE:100133,GLU_TESS_WINDING_ABS_GEQ_TWO:100134},primitiveType:{GL_LINE_LOOP:2,GL_TRIANGLES:4,GL_TRIANGLE_STRIP:5,GL_TRIANGLE_FAN:6},errorType:{GLU_TESS_MISSING_BEGIN_POLYGON:100151,GLU_TESS_MISSING_END_POLYGON:100153,GLU_TESS_MISSING_BEGIN_CONTOUR:100152,GLU_TESS_MISSING_END_CONTOUR:100154,GLU_TESS_COORD_TOO_LARGE:100155,GLU_TESS_NEED_COMBINE_CALLBACK:100156},
-	gluEnum:{GLU_TESS_MESH:100112,GLU_TESS_TOLERANCE:100142,GLU_TESS_WINDING_RULE:100140,GLU_TESS_BOUNDARY_ONLY:100141,GLU_INVALID_ENUM:100900,GLU_INVALID_VALUE:100901,GLU_TESS_BEGIN:100100,GLU_TESS_VERTEX:100101,GLU_TESS_END:100102,GLU_TESS_ERROR:100103,GLU_TESS_EDGE_FLAG:100104,GLU_TESS_COMBINE:100105,GLU_TESS_BEGIN_DATA:100106,GLU_TESS_VERTEX_DATA:100107,GLU_TESS_END_DATA:100108,GLU_TESS_ERROR_DATA:100109,GLU_TESS_EDGE_FLAG_DATA:100110,GLU_TESS_COMBINE_DATA:100111}};X.prototype.gluDeleteTess=X.prototype.x;
-	X.prototype.gluTessProperty=X.prototype.B;X.prototype.gluGetTessProperty=X.prototype.y;X.prototype.gluTessNormal=X.prototype.A;X.prototype.gluTessCallback=X.prototype.z;X.prototype.gluTessVertex=X.prototype.C;X.prototype.gluTessBeginPolygon=X.prototype.u;X.prototype.gluTessBeginContour=X.prototype.t;X.prototype.gluTessEndContour=X.prototype.v;X.prototype.gluTessEndPolygon=X.prototype.w; { module.exports = commonjsGlobal.libtess; } 
-} (libtess_min));
-
-var libtess_minExports = libtess_min.exports;
+/**
+ * @license
+ * libtess-ts - TypeScript port of the SGI GLU tessellator
+ * Original Code: OpenGL Sample Implementation, Version 1.2.1,
+ *   released January 26, 2000. Copyright (c) 1991-2000 Silicon Graphics, Inc.
+ * Copyright 2012, Google Inc. All Rights Reserved.
+ * Copyright 2026, Countertype LLC. All Rights Reserved.
+ * SGI Free Software License B (Version 2.0)
+ * http://oss.sgi.com/projects/FreeB/
+ */
+function t(t,i){return t.s===i.s&&t.t===i.t}function i(t,i){return i.s>t.s||t.s===i.s&&i.t>=t.t}function s(t,i){return i.t>t.t||t.t===i.t&&i.s>=t.s}function e(t){return i(t.h.i,t.i)}function n(t){return i(t.i,t.h.i)}function h(t,i){return Math.abs(t.s-i.s)+Math.abs(t.t-i.t)}function r(t,i,s){let e=i.s-t.s,n=s.s-i.s;return e+n>0?n>e?i.t-t.t+e/(e+n)*(t.t-s.t):i.t-s.t+n/(e+n)*(s.t-t.t):0}function l(t,i,s){let e=i.s-t.s,n=s.s-i.s;return e+n>0?(i.t-s.t)*e+(i.t-t.t)*n:0}function o(t,i,s){let e=i.t-t.t,n=s.t-i.t;return e+n>0?n>e?i.s-t.s+e/(e+n)*(t.s-s.s):i.s-s.s+n/(e+n)*(s.s-t.s):0}function u(t,i,s){let e=i.t-t.t,n=s.t-i.t;return e+n>0?(i.s-s.s)*e+(i.s-t.s)*n:0}function c(t,i,s,e){return (t=0>t?0:t)>(s=0>s?0:s)?e+s/(t+s)*(i-e):0===s?(i+e)/2:i+t/(t+s)*(e-i)}function a(t,s,e){const n=t.event,h=s.l,o=e.l;return h.h.i===n?o.h.i===n?i(h.i,o.i)?0>=l(o.h.i,h.i,o.i):l(h.h.i,o.i,h.i)>=0:0>=l(o.h.i,n,o.i):o.h.i===n?l(h.h.i,n,h.i)>=0:r(h.h.i,n,h.i)>=r(o.h.i,n,o.i)}function f(t){return t.o}function d(t){return t.next}function w(t,i){t.u+=i.u,t.h.u+=i.h.u;}function E(t,i){i.l.N=null,t._.delete(i);}function N(t,i,s){t.A.delete(i.l),i.I=0,i.l=s,s.N=i;}function _(t,i){let s,e=i.l.i;do{i=d(i);}while(i.l.i===e);return i.I&&(s=t.A.connect(f(i).l.h,i.l.O),N(t,i,s),i=d(i)),i}function A(t){let i=t.l.h.i;do{t=d(t);}while(t.l.h.i===i);return t}function I(t,i,s){const e=new Z;return e.l=s,t._.insertBefore(i,e),e.I=0,e.k=0,e.T=0,s.N=e,e}function g(t,i){switch(t.M){case Y.ODD:return !!(1&i);case Y.NONZERO:return 0!==i;case Y.POSITIVE:return i>0;case Y.NEGATIVE:return 0>i;case Y.ABS_GEQ_TWO:return i>=2||-2>=i}throw Error("Invalid winding rule")}function O(t,i){const s=i.l,e=s.D;e.p=i.p,e.L=s,E(t,i);}function k(t,i,s){let e,n=null,h=i,r=i.l;for(;h!==s;){if(h.I=0,n=f(h),e=n.l,e.i!=r.i){if(!n.I){O(t,h);break}e=t.A.connect(r.C.h,e.h),N(t,n,e);}r.C!==e&&(t.A.splice(e.h.O,e),t.A.splice(r,e)),O(t,h),r=n.l,h=n;}return r}function y(t,i,s,e,n,h){let r,l,o,u,c=1;o=s;do{I(t,i,o.h),o=o.C;}while(o!==e);for(null===n&&(n=f(i).l.h.C),l=i,u=n;r=f(l),o=r.l.h,o.i===u.i;)o.C!==u&&(t.A.splice(o.h.O,o),t.A.splice(u.h.O,o)),r.G=l.G-o.u,r.p=g(t,r.G),l.T=1,!c&&D(t,l)&&(w(o,u),E(t,l),t.A.delete(u)),c=0,l=r,u=o;l.T=1,h&&C(t,l);}function T(t,i,s,e,n){i.data=null,t.R&&(rt[0]=i.coords[0],rt[1]=i.coords[1],rt[2]=i.coords[2],i.data=t.R(rt,s,e,t.m)),null===i.data&&(n?(t.v(100156),t.U=1):i.data=s[0]);}function b(t,i,s){t.R&&(ht[0]=i.i.data,ht[1]=s.i.data,ht[2]=null,ht[3]=null,nt[0]=.5,nt[1]=.5,nt[2]=0,nt[3]=0,T(t,i.i,ht,nt,0)),t.A.splice(i,s);}function M(t,i,s,e,n){let r=h(i,t),l=h(s,t),o=.5*l/(r+l),u=.5*r/(r+l);void 0!==e&&void 0!==n&&(e[n]=o,e[n+1]=u),t.coords[0]+=o*i.coords[0]+u*s.coords[0],t.coords[1]+=o*i.coords[1]+u*s.coords[1],t.coords[2]+=o*i.coords[2]+u*s.coords[2];}function D(i,s){let e=f(s);const n=s.l,h=e.l;if(h.i.s>n.i.s||n.i.s===h.i.s&&h.i.t>=n.i.t){if(l(h.h.i,n.i,h.i)>0)return 0;t(n.i,h.i)?n.i!==h.i&&(i.S.delete(n.i.B),b(i,h.h.O,n)):(i.A.V(h.h),i.A.splice(n,h.h.O),s.T=e.T=1);}else {if(0>l(n.h.i,h.i,n.i))return 0;d(s).T=s.T=1,i.A.V(n.h),i.A.splice(h.h.O,n);}return 1}function p(t,i){let s=f(i);const e=i.l,n=s.l;let h;if(n.h.i.s>e.h.i.s||e.h.i.s===n.h.i.s&&n.h.i.t>=e.h.i.t){if(0>l(e.h.i,n.h.i,e.i))return 0;d(i).T=i.T=1,h=t.A.V(e),t.A.splice(n.h,h),h.D.p=i.p;}else {if(l(n.h.i,e.h.i,n.i)>0)return 0;i.T=s.T=1,h=t.A.V(n),t.A.splice(e.O,n.h),h.h.D.p=i.p;}return 1}function L(e,n){let h=f(n),a=n.l,w=h.l;const E=a.i,N=w.i;let I,g,O=a.h.i,b=w.h.i;const p=st||(st=new X);let L,C;if(E===N)return 0;if(I=Math.min(E.t,O.t),g=Math.max(N.t,b.t),I>g)return 0;if(i(E,N)){if(l(b,E,N)>0)return 0}else if(0>l(O,N,E))return 0;return ((t,e,n,h,a)=>{let f,d,w;i(t,e)||(w=t,t=e,e=w),i(n,h)||(w=n,n=h,h=w),i(t,n)||(w=t,t=n,n=w,w=e,e=h,h=w),i(n,e)?i(e,h)?(f=r(t,n,e),d=r(n,e,h),0>f+d&&(f=-f,d=-d),a.s=c(f,n.s,d,e.s)):(f=l(t,n,e),d=-l(t,h,e),0>f+d&&(f=-f,d=-d),a.s=c(f,n.s,d,h.s)):a.s=.5*(n.s+e.s),s(t,e)||(w=t,t=e,e=w),s(n,h)||(w=n,n=h,h=w),s(t,n)||(w=t,t=n,n=w,w=e,e=h,h=w),s(n,e)?s(e,h)?(f=o(t,n,e),d=o(n,e,h),0>f+d&&(f=-f,d=-d),a.t=c(f,n.t,d,e.t)):(f=u(t,n,e),d=-u(t,h,e),0>f+d&&(f=-f,d=-d),a.t=c(f,n.t,d,h.t)):a.t=.5*(n.t+e.t);})(O,E,b,N,p),(e.event.s>p.s||p.s===e.event.s&&e.event.t>=p.t)&&(p.s=e.event.s,p.t=e.event.t),L=N.s>E.s||E.s===N.s&&N.t>=E.t?E:N,(p.s>L.s||L.s===p.s&&p.t>=L.t)&&(p.s=L.s,p.t=L.t),t(p,E)||t(p,N)?(D(e,n),0):!t(O,e.event)&&l(O,e.event,p)>=0||!t(b,e.event)&&0>=l(b,e.event,p)?b===e.event?(e.A.V(a.h),e.A.splice(w.h,a),a=f(n=_(e,n)).l,k(e,f(n),h),y(e,n,a.h.O,a,a,1),1):O===e.event?(e.A.V(w.h),e.A.splice(a.O,w.h.O),h=n,C=f(n=A(n)).l.h.C,h.l=w.h.O,w=k(e,h,null),y(e,n,w.C,a.h.C,C,1),1):(0>l(O,e.event,p)||(d(n).T=n.T=1,e.A.V(a.h),a.i.s=e.event.s,a.i.t=e.event.t),l(b,e.event,p)>0||(n.T=h.T=1,e.A.V(w.h),w.i.s=e.event.s,w.i.t=e.event.t),0):(e.A.V(a.h),e.A.V(w.h),e.A.splice(w.h.O,a),a.i.s=p.s,a.i.t=p.t,a.i.B=e.S.P(a.i),((t,i,s,e,n,h)=>{nt[0]=0,nt[1]=0,nt[2]=0,nt[3]=0,ht[0]=s.data,ht[1]=e.data,ht[2]=n.data,ht[3]=h.data,i.coords[0]=i.coords[1]=i.coords[2]=0,M(i,s,e,nt,0),M(i,n,h,nt,2),T(t,i,ht,nt,1);})(e,a.i,E,O,N,b),d(n).T=n.T=h.T=1,0)}function C(t,i){let s,e,n=f(i);for(;;){for(;n.T;)i=n,n=f(n);if(!i.T&&(n=i,null===(i=d(i))||!i.T))return;if(i.T=0,s=i.l,e=n.l,s.h.i!==e.h.i&&p(t,i)&&(n.I?(E(t,n),t.A.delete(e),n=f(i),e=n.l):i.I&&(E(t,i),t.A.delete(s),s=(i=d(n)).l)),s.i!==e.i)if(s.h.i===e.h.i||i.I||n.I||s.h.i!==t.event&&e.h.i!==t.event)D(t,i);else if(L(t,i))return;s.i===e.i&&s.h.i===e.h.i&&(w(e,s),E(t,i),t.A.delete(s),i=d(n));}}function G(s,n){let h,r,o,u,c,a;const w=et||(et=new Z);w.l=n.L.h,h=s._.search(w),r=f(h),r&&(u=h.l,c=r.l,0!==l(u.h.i,n,u.i)?(o=i(c.h.i,u.h.i)?h:r,h.p||o.I?(a=o===h?s.A.connect(n.L.h,u.O):s.A.connect(c.h.C.h,n.L).h,o.I?N(s,o,a):((t,i)=>{i.G=d(i).G+i.l.u,i.p=g(t,i.G);})(s,I(s,h,a)),R(s,n)):y(s,h,n.L,n.L,null,1)):((i,s,n)=>{let h,r,l,o,u;if(h=s.l,t(h.i,n))b(i,h,n.L);else {if(!t(h.h.i,n))return i.A.V(h.h),s.I&&(i.A.delete(h.C),s.I=0),i.A.splice(n.L,h),void R(i,n);u=f(s=A(s)),l=u.l.h,r=o=l.C,u.I&&(E(i,u),i.A.delete(l),l=r.h.O),i.A.splice(n.L,l),e(r)||(r=null),y(i,s,l.C,o,r,1);}})(s,h,n));}function R(s,e){s.event=e;let n=e.L;for(;null===n.N;)if(n=n.C,n===e.L)return void G(s,e);let h=_(s,n.N),r=f(h);const l=r.l;let o=k(s,r,null);o.C===l?((s,e,n)=>{let h,r=n.C,l=f(e),o=e.l,u=l.l,c=0;o.h.i!==u.h.i&&L(s,e),t(o.i,s.event)&&(s.A.splice(r.h.O,o),r=f(e=_(s,e)).l,k(s,f(e),l),c=1),t(u.i,s.event)&&(s.A.splice(n,u.h.O),n=k(s,l,null),c=1),c?y(s,e,n.C,r,r,1):(h=i(u.i,o.i)?u.h.O:o,h=s.A.connect(n.C.h,h),y(s,e,h,h.C,h.C,0),h.h.N.I=1,C(s,e));})(s,h,o):y(s,h,o.C,l,l,1);}function m(t,i,s,e){const n=new Z;let h=t.A.F();h.i.s=s,h.i.t=e,h.h.i.s=i,h.h.i.t=e,t.event=h.h.i,n.l=h,n.G=0,n.p=0,n.I=0,n.k=1,n.T=0,t._.P(n);}function v(t,i){const s=t.Y;let e=s.next,n=e.coords[0],h=e.coords[1],r=e.coords[2],l=n,o=h,u=r,c=e,a=e,f=e,d=e,w=e,E=e;for(e=s.next;e!==s;e=e.next){const t=e.coords[0],i=e.coords[1],s=e.coords[2];n>t&&(n=t,c=e),t>l&&(l=t,d=e),h>i&&(h=i,a=e),i>o&&(o=i,w=e),r>s&&(r=s,f=e),s>u&&(u=s,E=e);}let N=0,_=l-n;const A=o-h;let I,g;if(A>_&&(N=1,_=A),u-r>_&&(N=2),0===N){if(n>=l)return i[0]=0,i[1]=0,void(i[2]=1);I=c,g=d;}else if(1===N){if(h>=o)return i[0]=0,i[1]=0,void(i[2]=1);I=a,g=w;}else {if(r>=u)return i[0]=0,i[1]=0,void(i[2]=1);I=f,g=E;}const O=I.coords[0]-g.coords[0],k=I.coords[1]-g.coords[1],y=I.coords[2]-g.coords[2];let T=0;for(e=s.next;e!==s;e=e.next){const t=e.coords[0]-g.coords[0],s=e.coords[1]-g.coords[1],n=e.coords[2]-g.coords[2],h=k*n-y*s,r=y*t-O*n,l=O*s-k*t,o=h*h+r*r+l*l;o>T&&(T=o,i[0]=h,i[1]=r,i[2]=l);}T>0||(i[0]=i[1]=i[2]=0,Math.abs(k)>Math.abs(O)?i[Math.abs(y)>Math.abs(k)?2:1]=1:i[Math.abs(y)>Math.abs(O)?2:0]=1);}function x(t,i){let s,e,n,h=t.j,r=t.Y,l=0;for(s=h.next;s!==h;s=s.next)if(n=s.L,n.u>0)do{l+=(n.i.s-n.h.i.s)*(n.i.t+n.h.i.t),n=n.O;}while(n!==s.L);if(0>l){for(e=r.next;e!==r;e=e.next)e.t=-e.t;i[0]=-i[0],i[1]=-i[1],i[2]=-i[2];}}function U(t,i){let s=0;for(let e=i.j.next;e!==i.j;e=e.next)e.p&&(s||(t.H(4),s=1),B(e,t));s&&t.q();}function S(t,i,s,e){0>i.s*(s.t-e.t)+s.s*(e.t-i.t)+e.s*(i.t-s.t)?(t.W(i.data),t.W(e.data),t.W(s.data)):(t.W(i.data),t.W(s.data),t.W(e.data));}function B(t,s){let e=0,n=t.L;do{ot[e++]=n.i,n=n.O;}while(n!==t.L);if(3>e)return;if(3===e)return void S(s,ot[0],ot[1],ot[2]);(t=>{if(t>ut.length){const i=2*t;ut=new Int8Array(i),ct=new Int32Array(i),at=new Int32Array(i);}})(e);let h=0,r=0;for(let t=1;e>t;t++)i(ot[t],ot[h])||(h=t),i(ot[t],ot[r])&&(r=t);if(h===r)return;let l=0;ct[l]=h,ut[l]=1,l++;let o=(h+1)%e,u=(h+e-1)%e;for(;o!==r||u!==r;){let t;t=o===r?0:u===r?1:!i(ot[o],ot[u]),t?(ct[l]=o,ut[l]=1,l++,o=(o+1)%e):(ct[l]=u,ut[l]=0,l++,u=(u+e-1)%e);}ct[l]=r,ut[l]=1,l++;let c=0;at[c++]=0,at[c++]=1;for(let t=2;l-1>t;t++)if(ut[t]!==ut[at[c-1]]){for(;c>1;){const i=at[--c];S(s,ot[ct[t]],ot[ct[i]],ot[ct[at[c-1]]]);}--c,at[c++]=t-1,at[c++]=t;}else {let i=at[--c];for(;c>0;){const e=ot[ct[t]],n=ot[ct[i]],h=ot[ct[at[c-1]]],r=e.s*(n.t-h.t)+n.s*(h.t-e.t)+h.s*(e.t-n.t);if(!(1===ut[t]?0>=r:r>=0))break;S(s,e,n,h),i=at[--c];}at[c++]=i,at[c++]=t;}for(;c>1;){const t=at[--c];S(s,ot[ct[l-1]],ot[ct[t]],ot[ct[at[c-1]]]);}}function V(t,i){let s;for(let e=t.Z.next;e!==t.Z;e=s)s=e.next,e.h.D.p!==e.D.p?e.u=e.D.p?i:-i:t.delete(e);}function P(t,i){let s=0,e=-1;for(let n=i.j.o;n!==i.j;n=n.o){if(!n.p)continue;s||(t.H(4),s=1);let i=n.L;do{{const s=i.h&&i.h.D&&i.h.D.p?0:1;e!==s&&(e=s,t.K(!!e));}t.W(i.i.data),i=i.O;}while(i!==n.L)}s&&t.q();}function F(t,i){for(let s=i.j.next;s!==i.j;s=s.next){if(!s.p)continue;t.H(2);let i=s.L;do{t.W(i.i.data),i=i.O;}while(i!==s.L);t.q();}}var Y,j,H,z;(t=>{t[t.ODD=0]="ODD",t[t.NONZERO=1]="NONZERO",t[t.POSITIVE=2]="POSITIVE",t[t.NEGATIVE=3]="NEGATIVE",t[t.ABS_GEQ_TWO=4]="ABS_GEQ_TWO";})(Y||(Y={})),(t=>{t[t.X=0]="POLYGONS",t[t.J=1]="CONNECTED_POLYGONS",t[t.$=2]="BOUNDARY_CONTOURS";})(j||(j={})),(t=>{t[t.BEGIN=100100]="BEGIN",t[t.EDGE_FLAG=100104]="EDGE_FLAG",t[t.VERTEX=100101]="VERTEX",t[t.END=100102]="END",t[t.ERROR=100103]="ERROR",t[t.COMBINE=100105]="COMBINE",t[t.BEGIN_DATA=100106]="BEGIN_DATA",t[t.EDGE_FLAG_DATA=100110]="EDGE_FLAG_DATA",t[t.VERTEX_DATA=100107]="VERTEX_DATA",t[t.END_DATA=100108]="END_DATA",t[t.ERROR_DATA=100109]="ERROR_DATA",t[t.COMBINE_DATA=100111]="COMBINE_DATA",t[t.WINDING_RULE=100140]="WINDING_RULE",t[t.BOUNDARY_ONLY=100141]="BOUNDARY_ONLY",t[t.TOLERANCE=100142]="TOLERANCE";})(H||(H={})),(t=>{t[t.tt=100151]="MISSING_BEGIN_POLYGON",t[t.it=100152]="MISSING_BEGIN_CONTOUR",t[t.st=100153]="MISSING_END_POLYGON",t[t.et=100154]="MISSING_END_CONTOUR",t[t.nt=100155]="COORD_TOO_LARGE",t[t.ht=100156]="NEED_COMBINE_CALLBACK";})(z||(z={}));class Z{next;o;l=null;G=0;p=0;k=0;T=0;I=0}class K{next;i;h;C;O;D;N=null;u=0}class X{next;o;L;coords=[0,0,0];s=0;t=0;B=0;data=null}class Q{next;o;L;p=0}class J{Y;j;Z;rt;vertexCount=0;constructor(){const t=new X,i=new Q,s=new K,e=new K;t.next=t.o=t,i.next=i.o=i,s.next=s,s.h=e,e.next=e,e.h=s,this.Y=t,this.j=i,this.Z=s,this.rt=e;}lt(t){const i=new K,s=new K,e=t.h.next;return s.next=e,e.h.next=i,i.next=t,t.h.next=s,i.h=s,i.C=i,i.O=s,i.u=0,i.N=null,s.h=i,s.C=s,s.O=i,s.u=0,s.N=null,i}ot(t,i){const s=t.C,e=i.C;s.h.O=i,e.h.O=t,t.C=e,i.C=s;}ut(t,i,s){const e=t,n=s.o;e.o=n,n.next=e,e.next=s,s.o=e,e.L=i,++this.vertexCount;let h=i;do{h.i=e,h=h.C;}while(h!==i)}ct(t,i,s){const e=t,n=s.o;e.o=n,n.next=e,e.next=s,s.o=e,e.L=i,e.p=s.p;let h=i;do{h.D=e,h=h.O;}while(h!==i)}ft(t){const i=t.next,s=t.h.next;i.h.next=s,s.h.next=i;}dt(t,i){const s=t.L;let e=s;do{e.i=i,e=e.C;}while(e!==s);const n=t.o,h=t.next;h.o=n,n.next=h,--this.vertexCount;}wt(t,i){const s=t.L;let e=s;do{e.D=i,e=e.O;}while(e!==s);const n=t.o,h=t.next;h.o=n,n.next=h;}F(){const t=new X,i=new X,s=new Q,e=this.lt(this.Z);return this.ut(t,e,this.Y),this.ut(i,e.h,this.Y),this.ct(s,e,this.j),e}splice(t,i){let s=0,e=0;if(t!==i){if(i.i!==t.i&&(e=1,this.dt(i.i,t.i)),i.D!==t.D&&(s=1,this.wt(i.D,t.D)),this.ot(i,t),!e){const s=new X;this.ut(s,i,t.i),t.i.L=t;}if(!s){const s=new Q;this.ct(s,i,t.D),t.D.L=t;}}}delete(t){const i=t.h;let s=0;if(t.D!==t.h.D&&(s=1,this.wt(t.D,t.h.D)),t.C===t)this.dt(t.i,null);else if(t.h.D.L=t.h.O,t.i.L=t.C,this.ot(t,t.h.O),!s){const i=new Q;this.ct(i,t,t.D);}i.C===i?(this.dt(i.i,null),this.wt(i.D,null)):(t.D.L=i.h.O,i.i.L=i.C,this.ot(i,i.h.O)),this.ft(t);}Et(t){const i=this.lt(t),s=i.h;this.ot(i,t.O),i.i=t.h.i;const e=new X;return this.ut(e,s,i.i),i.D=s.D=t.D,i}V(t){const i=this.Et(t).h;return this.ot(t.h,t.h.h.O),this.ot(t.h,i),t.h.i=i.i,i.h.i.L=i.h,i.h.D=t.h.D,i.u=t.u,i.h.u=t.h.u,i}connect(t,i){let s=0;const e=this.lt(t),n=e.h;if(i.D!==t.D&&(s=1,this.wt(i.D,t.D)),this.ot(e,t.O),this.ot(n,i),e.i=t.h.i,n.i=i.i,e.D=n.D=t.D,t.D.L=n,!s){const i=new Q;this.ct(i,e,t.D);}return e}Nt(t){const i=t.L;let s,e,n,h,r;e=i.O;do{s=e,e=s.O,s.D=null,s.h.D||(s.C===s?this.dt(s.i,null):(s.i.L=s.C,this.ot(s,s.h.O)),n=s.h,n.C===n?this.dt(n.i,null):(n.i.L=n.C,this.ot(n,n.h.O)),this.ft(s));}while(s!=i);h=t.o,r=t.next,r.o=h,h.next=r;}_t(t){let i=t.L,s=0;do{s++,i=i.O;}while(i!==t.L);return s}check(){}}class ${max=0;At;It;gt;Ot=0;kt=0;size=0;constructor(t){this.max=t,this.At=new Int32Array(t+1),this.It=Array(t+1).fill(null),this.gt=new Int32Array(t+1),this.Ot=0,this.At[1]=1,this.It[1]=null;}reset(t){if(t+1>this.max)this.max=t,this.At=new Int32Array(t+1),this.It=Array(t+1).fill(null),this.gt=new Int32Array(t+1);else {const t=this.It;for(let i=1;this.size>=i;i++)t[i]=null;}this.size=0,this.kt=0,this.Ot=0,this.At[1]=1,this.It[1]=null;}yt(t){const i=this.At,s=this.It,e=this.gt;let n=i[t];for(;;){let h=t<<1;if(h>this.size)break;let r=h,l=i[h];if(this.size>=h+1){const t=i[h+1],e=s[t],n=s[l];(n.s>e.s||e.s===n.s&&n.t>=e.t)&&(r=h+1,l=t);}const o=s[n],u=s[l];if(u.s>o.s||o.s===u.s&&u.t>=o.t)break;i[t]=l,e[l]=t,t=r;}i[t]=n,e[n]=t;}Tt(t){const i=this.At,s=this.It,e=this.gt;let n=i[t];for(;;){const h=t>>1;if(0===h)break;const r=i[h],l=s[r],o=s[n];if(o.s>l.s||l.s===o.s&&o.t>=l.t)break;i[t]=r,e[r]=t,t=h;}i[t]=n,e[n]=t;}init(){for(let t=this.size>>1;t>=1;--t)this.yt(t);this.Ot=1;}bt(){return 0===this.size}min(){return 0===this.size?null:this.It[this.At[1]]}P(t){let i,s;if(i=++this.size,2*i>this.max){this.max*=2;const t=new Int32Array(this.max+1),i=new Int32Array(this.max+1),s=Array(this.max+1).fill(null);t.set(this.At),i.set(this.gt);for(let t=0;this.It.length>t;t++)s[t]=this.It[t];this.At=t,this.gt=i,this.It=s;}return 0===this.kt?s=i:(s=this.kt,this.kt=this.gt[s]),this.At[i]=s,this.gt[s]=i,this.It[s]=t,this.Ot&&this.Tt(i),s}Mt(){const t=this.At,i=this.It,s=this.gt;let e=t[1],n=i[e];return this.size>0&&(t[1]=t[this.size],s[t[1]]=1,i[e]=null,s[e]=this.kt,this.kt=e,--this.size,this.size>0&&this.yt(1)),n}delete(t){const i=this.At,s=this.It,e=this.gt;let n;if(n=e[t],i[n]=i[this.size],e[i[n]]=n,--this.size,this.size>=n)if(n>1){const t=s[i[n>>1]],e=s[i[n]];e.s>t.s||t.s===e.s&&e.t>=t.t?this.yt(n):this.Tt(n);}else this.yt(n);s[t]=null,e[t]=this.kt,this.kt=t;}}class tt{Dt;keys;order=null;size=0;max=0;Ot=0;Lt;constructor(t){this.max=t,this.size=0,this.Ot=0,this.Lt=128>=t,this.Dt=new $(t),this.Lt||(this.keys=Array(t).fill(null));}reset(t){this.Dt.reset(t),this.Lt=128>=t,this.Lt||this.keys&&this.max>=t||(this.keys=Array(t).fill(null)),t>this.max&&(this.max=t),this.size=0,this.Ot=0,this.order=null;}P(t){if(this.Lt||this.Ot)return this.Dt.P(t);const i=this.size;if(++this.size>=this.max){const t=this.max;this.max*=2;const i=Array(this.max).fill(null);for(let s=0;t>s;s++)i[s]=this.keys[s];this.keys=i;}return this.keys[i]=t,-(i+1)}init(){if(this.Lt)return this.Ot=1,this.Dt.init(),1;this.order=Array(this.size);for(let t=0;this.size>t;t++)this.order[t]=t;const t=this.keys;return this.order.sort((i,s)=>{const e=t[i],n=t[s];return n.s>e.s?1:e.s>n.s||e.t>n.t?-1:1}),this.max=this.size,this.Ot=1,this.Dt.init(),1}Mt(){if(this.Lt||0===this.size)return this.Dt.Mt();const t=this.keys[this.order[this.size-1]];if(!this.Dt.bt()){const s=this.Dt.min();if(s&&i(s,t))return this.Dt.Mt()}do{--this.size;}while(this.size>0&&null===this.keys[this.order[this.size-1]]);return t}min(){if(this.Lt||0===this.size)return this.Dt.min();const t=this.keys[this.order[this.size-1]];if(!this.Dt.bt()){const s=this.Dt.min();if(s&&i(s,t))return s}return t}delete(t){0>t?this.keys[-(t+1)]=null:this.Dt.delete(t);}bt(){return (this.Lt||0===this.size)&&this.Dt.bt()}}class it{head=new Z;frame;constructor(t){this.frame=t,this.head.next=this.head,this.head.o=this.head;}min(){return this.head.next}max(){return this.head.o}P(t){return this.insertBefore(this.head,t)}search(t){let i=this.head;do{i=i.next;}while(null!==i.l&&!a(this.frame,t,i));return i}insertBefore(t,i){do{t=t.o;}while(null!==t.l&&!a(this.frame,t,i));return i.next=t.next,t.next.o=i,i.o=t,t.next=i,i}delete(t){t.next.o=t.o,t.o.next=t.next;}}let st=null,et=null;const nt=[0,0,0,0],ht=[null,null,null,null],rt=[0,0,0];class lt{static Ct(t,i){t.u+=i.u,t.h.u+=i.h.u;}static Gt(t,s){let h,r,o;if(h=s.L,h.O===h||h.O.O===h)throw Error("Monotone region has degenerate topology");for(;i(h.h.i,h.i);h=h.C.h);for(;i(h.i,h.h.i);h=h.O);for(r=h.C.h;h.O!==r;)if(i(h.h.i,r.i)){for(;r.O!==h&&(e(r.O)||0>=l(r.i,r.h.i,r.O.h.i));)o=t.connect(r.O,r),r=o.h;r=r.C.h;}else {for(;r.O!==h&&(n(h.C.h)||l(h.h.i,h.i,h.C.h.i)>=0);)o=t.connect(h,h.C.h),h=o.h;h=h.O;}if(r.O===h)throw Error("Monotone region has insufficient vertices");for(;r.O.O!==h;)o=t.connect(r.O,r),r=o.h;return 1}static tessellateInterior(t){let i;for(let s=t.j.next;s!==t.j;s=i)i=s.next,s.p&&lt.Gt(t,s);return 1}}let ot=[],ut=new Int8Array(64),ct=new Int32Array(64),at=new Int32Array(64);var ft;(t=>{t[t.Rt=0]="T_DORMANT",t[t.vt=1]="T_IN_POLYGON",t[t.xt=2]="T_IN_CONTOUR";})(ft||(ft={}));class dt{state=ft.Rt;Ut=null;St=0;Bt=0;Vt=1;Pt=0;Ft=0;Yt=0;jt=0;A;Ht=[0,0,0];zt;qt;Wt;Zt;M=Y.ODD;Kt=Y.ODD;_;S;event;Xt;Qt;Jt;$t;ti;ii;R;si;m=null;U=0;gluTessCallback(t,i){const s=i||null;switch(t){case 100100:case 100106:this.Xt=s;break;case 100104:case 100110:this.$t=s,this.flagBoundary=1;break;case 100101:case 100107:this.Qt=s;break;case 100102:case 100108:this.Jt=s;break;case 100103:this.ti=s;break;case 100109:this.ii=s;break;case 100105:case 100111:this.R=s;break;case 100112:this.si=s;break;default:throw Error("GLU_INVALID_ENUM")}}gluTessProperty(t,i){switch(t){case 100140:{const t=i,s=100130>t?t:t-100130;if(0>s||s>4)throw Error("GLU_INVALID_VALUE");this.Kt=t,this.M=s;break}case 100141:this.ei=!!i;break;case 100142:break;default:throw Error("GLU_INVALID_ENUM")}}gluGetTessProperty(t){switch(t){case 100140:return this.Kt;case 100141:return this.ei;case 100142:return 0;default:throw Error("GLU_INVALID_ENUM")}}gluTessNormal(t,i,s){this.Ht[0]=t,this.Ht[1]=i,this.Ht[2]=s,0===s||t||i||(this.Vt=s>0?1:-1);}H(t){this.Xt&&this.Xt(t,this.m);}W(t){this.Qt&&this.Qt(t,this.m);}q(){this.Jt&&this.Jt(this.m);}K(t){this.$t&&this.$t(t,this.m);}v(t){this.ii?this.ii(t,this.m):this.ti&&this.ti(t);}ni(t){if(this.state!==t)for(;this.state!==t;)t>this.state?this.state===ft.Rt?(this.v(100151),this.gluTessBeginPolygon()):this.state===ft.vt&&(this.v(100152),this.gluTessBeginContour()):this.state===ft.xt?(this.v(100154),this.gluTessEndContour()):this.state===ft.vt&&(this.v(100153),this.gluTessEndPolygon());}ei=0;flagBoundary=0;hi(){const t=this.A,i=t.Y,s=this.Ht[0],e=this.Ht[1],n=this.Ht[2];let h,r;if(this.zt||(this.zt=[0,0,0]),this.qt||(this.qt=[0,0,0]),this.Wt||(this.Wt=[0,0]),this.Zt||(this.Zt=[0,0]),h=this.zt,r=this.qt,this.Bt){h[0]=1,h[1]=0,h[2]=0;const t=n>0?1:-1;return r[0]=0,r[1]=t,r[2]=0,this.Wt[0]=this.Pt,this.Wt[1]=this.Yt,this.Zt[0]=this.Ft,void(this.Zt[1]=this.jt)}if(!this.St&&!s&&!e){let s;h[0]=1,h[1]=0,h[2]=0;let e=0;if(n)s=n>0?1:-1;else {const i=[0,0,0];v(t,i),s=i[2]>0?1:-1,e=1;}r[0]=0,r[1]=s,r[2]=0;let l=i.next,o=l.coords[0],u=l.coords[1]*s;l.s=o,l.t=u;let c=o,a=o,f=u,d=u;for(l=l.next;l!==i;l=l.next)o=l.coords[0],u=l.coords[1]*s,l.s=o,l.t=u,c>o?c=o:o>a&&(a=o),f>u?f=u:u>d&&(d=u);return this.Wt[0]=c,this.Zt[0]=a,void(e?(x(t,this.qt),r[1]!==s?(this.Wt[1]=-d,this.Zt[1]=-f):(this.Wt[1]=f,this.Zt[1]=d)):(this.Wt[1]=f,this.Zt[1]=d))}let l=0;const o=[s,e,n];s||e||n||(v(t,o),l=1);const u=(t=>{let i=0;return Math.abs(t[1])>Math.abs(t[0])&&(i=1),Math.abs(t[2])>Math.abs(t[i])&&(i=2),i})(o);h[u]=0,h[(u+1)%3]=1,h[(u+2)%3]=0,r[u]=0,r[(u+1)%3]=0,r[(u+2)%3]=o[u]>0?1:-1;let c=i.next;c.s=c.coords[0]*h[0]+c.coords[1]*h[1]+c.coords[2]*h[2],c.t=c.coords[0]*r[0]+c.coords[1]*r[1]+c.coords[2]*r[2];let a=c.s,f=c.s,d=c.t,w=c.t;for(c=c.next;c!==i;c=c.next){const t=c.coords[0]*h[0]+c.coords[1]*h[1]+c.coords[2]*h[2],i=c.coords[0]*r[0]+c.coords[1]*r[1]+c.coords[2]*r[2];c.s=t,c.t=i,a>t?a=t:t>f&&(f=t),d>i?d=i:i>w&&(w=i);}l&&x(t,this.qt),l&&r[(u+2)%3]!==(o[u]>0?1:-1)?(this.Wt[0]=a,this.Zt[0]=f,this.Wt[1]=-w,this.Zt[1]=-d):(this.Wt[0]=a,this.Zt[0]=f,this.Wt[1]=d,this.Zt[1]=w);}gluTessBeginPolygon(t){this.ni(ft.Rt),this.state=ft.vt,this.U=0,this.A=new J,this.St=0,this.Bt=0!==this.Ht[2]&&!this.Ht[0]&&!this.Ht[1],this.Pt=1/0,this.Ft=-1/0,this.Yt=1/0,this.jt=-1/0,this.m=t;}gluTessBeginContour(){this.ni(ft.vt),this.state=ft.xt,this.Ut=null;}gluTessVertex(t,i){this.ni(ft.xt);let s=t[0],e=t[1],n=t.length>2?t[2]:0,h=0;-1e150>s?(s=-1e150,h=1):s>1e150&&(s=1e150,h=1),-1e150>e?(e=-1e150,h=1):e>1e150&&(e=1e150,h=1),-1e150>n?(n=-1e150,h=1):n>1e150&&(n=1e150,h=1),h&&this.v(100155);let r=this.Ut;if(null===r?(r=this.A.F(),this.A.splice(r,r.h)):(this.A.V(r),r=r.O),r.i.data=i||null,r.i.coords[0]=s,r.i.coords[1]=e,0!==n?(r.i.coords[2]=n,this.St=1,this.Bt=0):r.i.coords[2]=0,this.Bt){r.i.s=s;const t=e*this.Vt;r.i.t=t,this.Pt>s&&(this.Pt=s),s>this.Ft&&(this.Ft=s),this.Yt>t&&(this.Yt=t),t>this.jt&&(this.jt=t);}r.u=1,r.h.u=-1,this.Ut=r;}gluTessEndContour(){this.ni(ft.xt),this.state=ft.vt;}gluTessEndPolygon(){this.ni(ft.vt),this.state=ft.Rt,this.compute(this.M,void 0,0);const t=this.A;this.U||(this.ei?(V(t,1),F(this,t)):this.flagBoundary?(lt.tessellateInterior(t),P(this,t)):U(this,t)),this.si&&this.si(t),this.A=null,this.Ut=null,this.event=null,this.m=null,this._=null;}gluDeleteTess(){this.ni(ft.Rt);}compute(i=Y.ODD,s,e=0){this.state!==ft.Rt&&this.state===ft.vt&&(this.state=ft.Rt),this.A||(this.A=new J),s&&(this.Ht[0]=s[0],this.Ht[1]=s[1],this.Ht[2]=s[2]),this.M=i,this.hi(),function(i,s=1){let e,n;if((i=>{let s,e,n,h=i.A.Z;for(s=h.next;s!==h;s=e)e=s.next,n=s.O,t(s.i,s.h.i)&&s.O.O!==s&&(b(i,n,s),i.A.delete(s),s=n,n=s.O),n.O===s&&(n!==s&&(n!==e&&n!==e.h||(e=e.next),i.A.delete(n)),s!==e&&s!==e.h||(e=e.next),i.A.delete(s));})(i),!(t=>{let i,s,e,n=t.A.vertexCount+8;for(t.S?(t.S.reset(n),i=t.S):i=t.S=new tt(n),e=t.A.Y,s=e.next;s!==e;s=s.next)s.B=i.P(s);return s!==e?0:(i.init(),1)})(i))return 0;for((t=>{t._=new it(t);let i=t.Zt[0]-t.Wt[0],s=t.Zt[1]-t.Wt[1],e=t.Wt[0]-i,n=t.Zt[0]+i,h=t.Zt[1]+s;m(t,e,n,t.Wt[1]-s),m(t,e,n,h);})(i);null!==(e=i.S.Mt());){for(;n=i.S.min(),null!==n&&t(n,e);)n=i.S.Mt(),b(i,e.L,n.L);R(i,e);}i.event=i._.min().l.i,(t=>{let i;for(;null!==(i=t._.min()).l;)E(t,i);})(i),((t,i)=>{let s,e,n;for(s=i.j.next;s!==i.j;s=e)e=s.next,n=s.L,n.O.O===n&&(w(n.C,n),t.A.delete(n));})(i,i.A),s&&i.A.check();}(this,e);}renderBoundary(){this.A&&(V(this.A,1),F(this,this.A));}renderTriangles(t=0){this.A&&(t?(lt.tessellateInterior(this.A),P(this,this.A)):U(this,this.A));}}
 
 class Tessellator {
     process(paths, removeOverlaps = true, isCFF = false, needsExtrusionContours = true) {
@@ -2744,49 +2659,49 @@ class Tessellator {
         return reversed;
     }
     performTessellation(contours, mode) {
-        const tess = new libtess_minExports.GluTesselator();
-        tess.gluTessProperty(libtess_minExports.gluEnum.GLU_TESS_WINDING_RULE, libtess_minExports.windingRule.GLU_TESS_WINDING_NONZERO);
+        const tess = new dt();
+        tess.gluTessProperty(H.WINDING_RULE, Y.NONZERO);
         const vertices = [];
         const indices = [];
         const contourIndices = [];
         let currentContour = [];
         if (mode === 'boundary') {
-            tess.gluTessProperty(libtess_minExports.gluEnum.GLU_TESS_BOUNDARY_ONLY, true);
+            tess.gluTessProperty(H.BOUNDARY_ONLY, 1);
         }
         if (mode === 'triangles') {
-            tess.gluTessCallback(libtess_minExports.gluEnum.GLU_TESS_VERTEX_DATA, (data) => {
+            tess.gluTessCallback(H.VERTEX_DATA, (data) => {
                 indices.push(data);
             });
         }
         else {
-            tess.gluTessCallback(libtess_minExports.gluEnum.GLU_TESS_BEGIN, () => {
+            tess.gluTessCallback(H.BEGIN, () => {
                 currentContour = [];
             });
-            tess.gluTessCallback(libtess_minExports.gluEnum.GLU_TESS_VERTEX_DATA, (data) => {
+            tess.gluTessCallback(H.VERTEX_DATA, (data) => {
                 currentContour.push(data);
             });
-            tess.gluTessCallback(libtess_minExports.gluEnum.GLU_TESS_END, () => {
+            tess.gluTessCallback(H.END, () => {
                 if (currentContour.length > 0) {
                     contourIndices.push(currentContour);
                 }
             });
         }
-        tess.gluTessCallback(libtess_minExports.gluEnum.GLU_TESS_COMBINE, (coords) => {
+        tess.gluTessCallback(H.COMBINE, (coords) => {
             const idx = vertices.length / 2;
             vertices.push(coords[0], coords[1]);
             return idx;
         });
-        tess.gluTessCallback(libtess_minExports.gluEnum.GLU_TESS_ERROR, (errno) => {
+        tess.gluTessCallback(H.ERROR, (errno) => {
             logger.warn(`libtess error: ${errno}`);
         });
         tess.gluTessNormal(0, 0, 1);
-        tess.gluTessBeginPolygon(null);
+        tess.gluTessBeginPolygon();
         for (const contour of contours) {
             tess.gluTessBeginContour();
             for (let i = 0; i < contour.length; i += 2) {
                 const idx = vertices.length / 2;
                 vertices.push(contour[i], contour[i + 1]);
-                tess.gluTessVertex([contour[i], contour[i + 1], 0], idx);
+                tess.gluTessVertex([contour[i], contour[i + 1]], idx);
             }
             tess.gluTessEndContour();
         }
@@ -3212,117 +3127,33 @@ class BoundaryClusterer {
     }
 }
 
-class MinHeap {
-    constructor(compare) {
-        this.heap = [];
-        this.itemIndex = new Map();
-        this.compare = compare;
-    }
-    insert(value) {
-        const existingIndex = this.itemIndex.get(value);
-        if (existingIndex !== undefined) {
-            // Already exists - update in place
-            this.siftUp(existingIndex);
-            this.siftDown(existingIndex);
-            return;
-        }
-        const index = this.heap.length;
-        this.heap.push(value);
-        this.itemIndex.set(value, index);
-        this.siftUp(index);
-    }
-    extractMin() {
-        const heapLength = this.heap.length;
-        if (!heapLength)
-            return undefined;
-        if (heapLength === 1) {
-            const min = this.heap.pop();
-            this.itemIndex.clear();
-            return min;
-        }
-        const min = this.heap[0];
-        const last = this.heap.pop();
-        this.heap[0] = last;
-        this.itemIndex.delete(min);
-        this.itemIndex.set(last, 0);
-        this.siftDown(0);
-        return min;
-    }
-    update(value) {
-        const index = this.itemIndex.get(value);
-        if (index === undefined) {
-            this.insert(value);
-            return;
-        }
-        // Percolate in both directions - one will terminate immediately
-        this.siftUp(index);
-        this.siftDown(index);
-    }
-    isEmpty() {
-        return !this.heap.length;
-    }
-    swap(i, j) {
-        const itemI = this.heap[i];
-        const itemJ = this.heap[j];
-        this.heap[i] = itemJ;
-        this.heap[j] = itemI;
-        this.itemIndex.set(itemI, j);
-        this.itemIndex.set(itemJ, i);
-    }
-    siftUp(i) {
-        const item = this.heap[i];
-        while (i > 0) {
-            const parentIndex = (i - 1) >> 1; // Bit shift for fast division by 2
-            const parent = this.heap[parentIndex];
-            // Early exit if heap property satisfied
-            if (this.compare(item, parent) >= 0)
-                break;
-            // Move parent down
-            this.heap[i] = parent;
-            this.itemIndex.set(parent, i);
-            i = parentIndex;
-        }
-        this.heap[i] = item;
-        this.itemIndex.set(item, i);
-    }
-    siftDown(i) {
-        const item = this.heap[i];
-        const heapLength = this.heap.length;
-        const halfLength = heapLength >> 1; // Only nodes in first half can have children
-        while (i < halfLength) {
-            const leftIndex = (i << 1) + 1; // Bit shift for fast multiplication by 2
-            const rightIndex = leftIndex + 1;
-            let smallestIndex = i;
-            let smallest = item;
-            const left = this.heap[leftIndex];
-            if (this.compare(left, smallest) < 0) {
-                smallestIndex = leftIndex;
-                smallest = left;
-            }
-            if (rightIndex < heapLength) {
-                const right = this.heap[rightIndex];
-                if (this.compare(right, smallest) < 0) {
-                    smallestIndex = rightIndex;
-                    smallest = right;
-                }
-            }
-            // Early exit if heap property satisfied
-            if (smallestIndex === i)
-                break;
-            // Move smallest child up
-            this.heap[i] = smallest;
-            this.itemIndex.set(smallest, i);
-            i = smallestIndex;
-        }
-        this.heap[i] = item;
-        this.itemIndex.set(item, i);
-    }
-}
-
 const DEFAULT_OPTIMIZATION_CONFIG = {
     enabled: true,
-    areaThreshold: 1.0 // Remove triangles smaller than 1 square font unit
+    areaThreshold: 1.0
 };
+// Scratch buffers reused across calls. Grown on demand, never shrunk
+let _cap = 1024;
+let _px = new Float64Array(_cap);
+let _py = new Float64Array(_cap);
+let _area = new Float64Array(_cap);
+let _prev = new Int32Array(_cap);
+let _next = new Int32Array(_cap);
+let _heap = new Int32Array(_cap);
+let _hpos = new Int32Array(_cap);
+function ensureCap(n) {
+    if (n <= _cap)
+        return;
+    _cap = 1;
+    while (_cap < n)
+        _cap <<= 1;
+    _px = new Float64Array(_cap);
+    _py = new Float64Array(_cap);
+    _area = new Float64Array(_cap);
+    _prev = new Int32Array(_cap);
+    _next = new Int32Array(_cap);
+    _heap = new Int32Array(_cap);
+    _hpos = new Int32Array(_cap);
+}
 class PathOptimizer {
     constructor(config) {
         this.stats = {
@@ -3335,85 +3166,26 @@ class PathOptimizer {
         this.config = config;
     }
     optimizePath(path) {
-        if (path.points.length <= 2) {
-            return path;
-        }
-        if (!this.config.enabled) {
-            return path;
-        }
-        this.stats.originalPointCount += path.points.length;
-        // Most paths are already immutable after collection; avoid copying large point arrays
-        // The optimizers below never mutate the input `points` array
         const points = path.points;
-        if (points.length < 5) {
+        const n = points.length;
+        if (n < 5 || !this.config.enabled) {
+            if (this.config.enabled)
+                this.stats.originalPointCount += n;
             return path;
         }
-        let optimized = points;
-        // Visvalingam-Whyatt simplification
-        optimized = this.simplifyPathVW(optimized, this.config.areaThreshold);
-        if (optimized.length < 3) {
+        this.stats.originalPointCount += n;
+        const removed = simplifyVW(points, n, this.config.areaThreshold);
+        if (removed === 0)
             return path;
+        this.stats.pointsRemovedByVisvalingam += removed;
+        const result = new Array(n - removed);
+        let idx = 0;
+        let out = 0;
+        while (idx >= 0) {
+            result[out++] = points[idx];
+            idx = _next[idx];
         }
-        return {
-            ...path,
-            points: optimized
-        };
-    }
-    // Visvalingam-Whyatt algorithm
-    simplifyPathVW(points, areaThreshold) {
-        if (points.length <= 3)
-            return points;
-        const originalLength = points.length;
-        const minPoints = 3;
-        const pointList = points.map((p, i) => ({
-            index: i,
-            area: Infinity,
-            prev: null,
-            next: null
-        }));
-        for (let i = 0; i < pointList.length; i++) {
-            pointList[i].prev = pointList[i - 1] || null;
-            pointList[i].next = pointList[i + 1] || null;
-        }
-        const heap = new MinHeap((a, b) => a.area - b.area);
-        for (let i = 1; i < pointList.length - 1; i++) {
-            const p = pointList[i];
-            p.area = this.calculateTriangleArea(points[p.prev.index], points[p.index], points[p.next.index]);
-            heap.insert(p);
-        }
-        let remainingPoints = originalLength;
-        while (!heap.isEmpty() && remainingPoints > minPoints) {
-            const p = heap.extractMin();
-            if (!p || p.area > areaThreshold) {
-                break;
-            }
-            if (p.prev)
-                p.prev.next = p.next;
-            if (p.next)
-                p.next.prev = p.prev;
-            remainingPoints--;
-            if (p.prev && p.prev.prev) {
-                p.prev.area = this.calculateTriangleArea(points[p.prev.prev.index], points[p.prev.index], points[p.next.index]);
-                heap.update(p.prev);
-            }
-            if (p.next && p.next.next) {
-                p.next.area = this.calculateTriangleArea(points[p.prev.index], points[p.next.index], points[p.next.next.index]);
-                heap.update(p.next);
-            }
-        }
-        const simplifiedPoints = [];
-        let current = pointList[0];
-        while (current) {
-            simplifiedPoints.push(points[current.index]);
-            current = current.next;
-        }
-        const pointsRemoved = originalLength - simplifiedPoints.length;
-        this.stats.pointsRemovedByVisvalingam += pointsRemoved;
-        return simplifiedPoints;
-    }
-    // Shoelace formula
-    calculateTriangleArea(p1, p2, p3) {
-        return Math.abs((p1.x * (p2.y - p3.y) + p2.x * (p3.y - p1.y) + p3.x * (p1.y - p2.y)) / 2);
+        return { ...path, points: result };
     }
     getStats() {
         return { ...this.stats };
@@ -3425,6 +3197,158 @@ class PathOptimizer {
         };
     }
 }
+// Visvalingam-Whyatt simplification. Iteratively removes the point
+// whose removal causes the smallest change in contour area (measured
+// as the triangle formed with its two neighbors) until all remaining
+// triangles exceed areaThreshold
+//
+// Uses parallel typed arrays for the linked list and a binary min-heap
+// with an index-based position map for O(log n) extract and update.
+// Coordinates are flattened into Float64Array to keep area computation
+// on contiguous memory. Areas are stored as 2x actual (skipping the
+// shoelace /2) and the threshold is doubled to match
+//
+// Returns the number of points removed. The caller reads _next[] to
+// walk the surviving linked list
+function simplifyVW(points, n, areaThreshold) {
+    if (n <= 3)
+        return 0;
+    ensureCap(n);
+    const px = _px;
+    const py = _py;
+    const area = _area;
+    const prev = _prev;
+    const next = _next;
+    const heap = _heap;
+    const hpos = _hpos;
+    // Flatten coordinates and initialize doubly-linked list
+    for (let i = 0; i < n; i++) {
+        const p = points[i];
+        px[i] = p.x;
+        py[i] = p.y;
+        prev[i] = i - 1;
+        next[i] = i + 1;
+    }
+    next[n - 1] = -1;
+    // Compute triangle areas for interior points and seed the heap
+    const heapLen0 = n - 2;
+    area[0] = Infinity;
+    area[n - 1] = Infinity;
+    for (let i = 1; i < n - 1; i++) {
+        area[i] = area2x(px, py, i - 1, i, i + 1);
+        heap[i - 1] = i;
+        hpos[i] = i - 1;
+    }
+    hpos[0] = -1;
+    hpos[n - 1] = -1;
+    // Bottom-up heapify, O(n)
+    let heapLen = heapLen0;
+    for (let i = (heapLen >> 1) - 1; i >= 0; i--) {
+        siftDown(heap, hpos, area, i, heapLen);
+    }
+    const threshold2x = areaThreshold * 2;
+    const maxRemovals = n - 3;
+    let removed = 0;
+    while (heapLen > 0 && removed < maxRemovals) {
+        const minIdx = heap[0];
+        if (area[minIdx] > threshold2x)
+            break;
+        // Extract min
+        heapLen--;
+        if (heapLen > 0) {
+            const last = heap[heapLen];
+            heap[0] = last;
+            hpos[last] = 0;
+            siftDown(heap, hpos, area, 0, heapLen);
+        }
+        hpos[minIdx] = -1;
+        // Unlink
+        const pi = prev[minIdx];
+        const ni = next[minIdx];
+        if (pi >= 0)
+            next[pi] = ni;
+        if (ni >= 0)
+            prev[ni] = pi;
+        removed++;
+        // Recompute prev neighbor's area and update heap position
+        if (pi >= 0 && prev[pi] >= 0) {
+            const oldArea = area[pi];
+            const newArea = area2x(px, py, prev[pi], pi, ni);
+            area[pi] = newArea;
+            const pos = hpos[pi];
+            if (pos >= 0) {
+                if (newArea < oldArea)
+                    siftUp(heap, hpos, area, pos);
+                else if (newArea > oldArea)
+                    siftDown(heap, hpos, area, pos, heapLen);
+            }
+        }
+        // Same for next neighbor
+        if (ni >= 0 && next[ni] >= 0) {
+            const oldArea = area[ni];
+            const newArea = area2x(px, py, pi, ni, next[ni]);
+            area[ni] = newArea;
+            const pos = hpos[ni];
+            if (pos >= 0) {
+                if (newArea < oldArea)
+                    siftUp(heap, hpos, area, pos);
+                else if (newArea > oldArea)
+                    siftDown(heap, hpos, area, pos, heapLen);
+            }
+        }
+    }
+    return removed;
+}
+function siftUp(heap, hpos, area, i) {
+    const idx = heap[i];
+    const val = area[idx];
+    while (i > 0) {
+        const parent = (i - 1) >> 1;
+        const pidx = heap[parent];
+        if (area[pidx] <= val)
+            break;
+        heap[i] = pidx;
+        hpos[pidx] = i;
+        i = parent;
+    }
+    heap[i] = idx;
+    hpos[idx] = i;
+}
+function siftDown(heap, hpos, area, i, len) {
+    const idx = heap[i];
+    const val = area[idx];
+    const half = len >> 1;
+    while (i < half) {
+        let child = (i << 1) + 1;
+        let childIdx = heap[child];
+        let childVal = area[childIdx];
+        const right = child + 1;
+        if (right < len) {
+            const rIdx = heap[right];
+            const rVal = area[rIdx];
+            if (rVal < childVal) {
+                child = right;
+                childIdx = rIdx;
+                childVal = rVal;
+            }
+        }
+        if (childVal >= val)
+            break;
+        heap[i] = childIdx;
+        hpos[childIdx] = i;
+        i = child;
+    }
+    heap[i] = idx;
+    hpos[idx] = i;
+}
+// Doubled triangle area via the shoelace formula. Skipping the /2
+// means callers compare against a doubled threshold instead
+function area2x(px, py, i1, i2, i3) {
+    const v = px[i1] * (py[i2] - py[i3]) +
+        px[i2] * (py[i3] - py[i1]) +
+        px[i3] * (py[i1] - py[i2]);
+    return v < 0 ? -v : v;
+}
 
 /**
  * @license
@@ -3465,23 +3389,314 @@ class PathOptimizer {
  */
 const DEFAULT_CURVE_FIDELITY = {
     distanceTolerance: 0.5,
-    angleTolerance: 0.2 // ~11.5 degrees
+    angleTolerance: 0.2,
+    cuspLimit: 0,
+    collinearityEpsilon: 1e-6,
+    recursionLimit: 16
 };
-const COLLINEARITY_EPSILON = 1e-6;
-const RECURSION_LIMIT = 16;
+const COLLINEARITY_EPSILON = DEFAULT_CURVE_FIDELITY.collinearityEpsilon;
+// Module-level state for the recursive subdivision functions,
+// set from instance config before each polygonize call
+// Output array, reset before each polygonize call
+let _out;
+// Cached tolerance state
+let _distTolSq = 0;
+let _colEps = 0;
+let _maxLvl = 0;
+let _angleTol = 0;
+let _tanAngSq = 0;
+let _cuspLim = 0;
+let _tanCuspSq = 0;
+// Collinearity checks in the recursive core prevent near-duplicate points
+function emit(x, y) {
+    _out.push(new Vec2(x, y));
+}
+// Quadratic recursive subdivision (AGG curve3_div)
+function quadRec(x1, y1, x2, y2, x3, y3, level) {
+    if (level > _maxLvl)
+        return;
+    const x12 = (x1 + x2) * 0.5;
+    const y12 = (y1 + y2) * 0.5;
+    const x23 = (x2 + x3) * 0.5;
+    const y23 = (y2 + y3) * 0.5;
+    const x123 = (x12 + x23) * 0.5;
+    const y123 = (y12 + y23) * 0.5;
+    const dx = x3 - x1;
+    const dy = y3 - y1;
+    let d = Math.abs((x2 - x3) * dy - (y2 - y3) * dx);
+    if (d > _colEps) {
+        if (d * d <= _distTolSq * (dx * dx + dy * dy)) {
+            if (_angleTol > 0) {
+                const v1x = x2 - x1;
+                const v1y = y2 - y1;
+                const v2x = x3 - x2;
+                const v2y = y3 - y2;
+                const cross = v1x * v2y - v1y * v2x;
+                const dot = v1x * v2x + v1y * v2y;
+                if (dot > 0 && cross * cross < _tanAngSq * dot * dot) {
+                    emit(x123, y123);
+                    return;
+                }
+            }
+            else {
+                emit(x123, y123);
+                return;
+            }
+        }
+    }
+    else {
+        let da = dx * dx + dy * dy;
+        if (da === 0) {
+            d = (x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1);
+        }
+        else {
+            d = ((x2 - x1) * dx + (y2 - y1) * dy) / da;
+            if (d > 0 && d < 1)
+                return;
+            if (d <= 0)
+                d = (x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1);
+            else if (d >= 1)
+                d = (x2 - x3) * (x2 - x3) + (y2 - y3) * (y2 - y3);
+            else {
+                const px = x1 + d * dx;
+                const py = y1 + d * dy;
+                d = (x2 - px) * (x2 - px) + (y2 - py) * (y2 - py);
+            }
+        }
+        if (d < _distTolSq) {
+            emit(x2, y2);
+            return;
+        }
+    }
+    const nl = level + 1;
+    quadRec(x1, y1, x12, y12, x123, y123, nl);
+    quadRec(x123, y123, x23, y23, x3, y3, nl);
+}
+// Cubic recursive subdivision (AGG curve4_div)
+// cubicBegin handles level 0, which always subdivides
+function cubicBegin(x1, y1, x2, y2, x3, y3, x4, y4) {
+    const x12 = (x1 + x2) * 0.5;
+    const y12 = (y1 + y2) * 0.5;
+    const x23 = (x2 + x3) * 0.5;
+    const y23 = (y2 + y3) * 0.5;
+    const x34 = (x3 + x4) * 0.5;
+    const y34 = (y3 + y4) * 0.5;
+    const x123 = (x12 + x23) * 0.5;
+    const y123 = (y12 + y23) * 0.5;
+    const x234 = (x23 + x34) * 0.5;
+    const y234 = (y23 + y34) * 0.5;
+    const x1234 = (x123 + x234) * 0.5;
+    const y1234 = (y123 + y234) * 0.5;
+    cubicRec(x1, y1, x12, y12, x123, y123, x1234, y1234, 1);
+    cubicRec(x1234, y1234, x234, y234, x34, y34, x4, y4, 1);
+}
+function cubicRec(x1, y1, x2, y2, x3, y3, x4, y4, level) {
+    if (level > _maxLvl)
+        return;
+    const x12 = (x1 + x2) * 0.5;
+    const y12 = (y1 + y2) * 0.5;
+    const x23 = (x2 + x3) * 0.5;
+    const y23 = (y2 + y3) * 0.5;
+    const x34 = (x3 + x4) * 0.5;
+    const y34 = (y3 + y4) * 0.5;
+    const x123 = (x12 + x23) * 0.5;
+    const y123 = (y12 + y23) * 0.5;
+    const x234 = (x23 + x34) * 0.5;
+    const y234 = (y23 + y34) * 0.5;
+    const x1234 = (x123 + x234) * 0.5;
+    const y1234 = (y123 + y234) * 0.5;
+    const dx = x4 - x1;
+    const dy = y4 - y1;
+    let d2 = Math.abs((x2 - x4) * dy - (y2 - y4) * dx);
+    let d3 = Math.abs((x3 - x4) * dy - (y3 - y4) * dx);
+    const sc = (d2 > _colEps ? 2 : 0) + (d3 > _colEps ? 1 : 0);
+    switch (sc) {
+        case 0: {
+            let k = dx * dx + dy * dy;
+            if (k === 0) {
+                d2 = (x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1);
+                d3 = (x3 - x1) * (x3 - x1) + (y3 - y1) * (y3 - y1);
+            }
+            else {
+                k = 1 / k;
+                let t1 = x2 - x1;
+                let t2 = y2 - y1;
+                d2 = k * (t1 * dx + t2 * dy);
+                t1 = x3 - x1;
+                t2 = y3 - y1;
+                d3 = k * (t1 * dx + t2 * dy);
+                if (d2 > 0 && d2 < 1 && d3 > 0 && d3 < 1)
+                    return;
+                if (d2 <= 0)
+                    d2 = (x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1);
+                else if (d2 >= 1)
+                    d2 = (x2 - x4) * (x2 - x4) + (y2 - y4) * (y2 - y4);
+                else {
+                    const px = x1 + d2 * dx, py = y1 + d2 * dy;
+                    d2 = (x2 - px) * (x2 - px) + (y2 - py) * (y2 - py);
+                }
+                if (d3 <= 0)
+                    d3 = (x3 - x1) * (x3 - x1) + (y3 - y1) * (y3 - y1);
+                else if (d3 >= 1)
+                    d3 = (x3 - x4) * (x3 - x4) + (y3 - y4) * (y3 - y4);
+                else {
+                    const px = x1 + d3 * dx, py = y1 + d3 * dy;
+                    d3 = (x3 - px) * (x3 - px) + (y3 - py) * (y3 - py);
+                }
+            }
+            if (d2 > d3) {
+                if (d2 < _distTolSq) {
+                    emit(x2, y2);
+                    return;
+                }
+            }
+            else {
+                if (d3 < _distTolSq) {
+                    emit(x3, y3);
+                    return;
+                }
+            }
+            break;
+        }
+        case 1:
+            if (d3 * d3 <= _distTolSq * (dx * dx + dy * dy)) {
+                if (_angleTol > 0) {
+                    const v1x = x3 - x2, v1y = y3 - y2;
+                    const v2x = x4 - x3, v2y = y4 - y3;
+                    const cross = v1x * v2y - v1y * v2x;
+                    const dot = v1x * v2x + v1y * v2y;
+                    if (dot > 0 && cross * cross < _tanAngSq * dot * dot) {
+                        emit(x2, y2);
+                        emit(x3, y3);
+                        return;
+                    }
+                    if (_cuspLim > 0 &&
+                        (dot <= 0 || cross * cross > _tanCuspSq * dot * dot)) {
+                        emit(x3, y3);
+                        return;
+                    }
+                }
+                else {
+                    emit(x23, y23);
+                    return;
+                }
+            }
+            break;
+        case 2:
+            if (d2 * d2 <= _distTolSq * (dx * dx + dy * dy)) {
+                if (_angleTol > 0) {
+                    const v1x = x2 - x1, v1y = y2 - y1;
+                    const v2x = x3 - x2, v2y = y3 - y2;
+                    const cross = v1x * v2y - v1y * v2x;
+                    const dot = v1x * v2x + v1y * v2y;
+                    if (dot > 0 && cross * cross < _tanAngSq * dot * dot) {
+                        emit(x2, y2);
+                        emit(x3, y3);
+                        return;
+                    }
+                    if (_cuspLim > 0 &&
+                        (dot <= 0 || cross * cross > _tanCuspSq * dot * dot)) {
+                        emit(x2, y2);
+                        return;
+                    }
+                }
+                else {
+                    emit(x23, y23);
+                    return;
+                }
+            }
+            break;
+        case 3: {
+            if ((d2 + d3) * (d2 + d3) <= _distTolSq * (dx * dx + dy * dy)) {
+                if (_angleTol > 0) {
+                    const a1x = x2 - x1, a1y = y2 - y1;
+                    const a2x = x3 - x2, a2y = y3 - y2;
+                    const c1 = a1x * a2y - a1y * a2x;
+                    const dot1 = a1x * a2x + a1y * a2y;
+                    const b2x = x4 - x3, b2y = y4 - y3;
+                    const c2 = a2x * b2y - a2y * b2x;
+                    const dot2 = a2x * b2x + a2y * b2y;
+                    // Sum of unsigned angles via tangent addition identity
+                    if (dot1 > 0 && dot2 > 0) {
+                        const ac1 = c1 < 0 ? -c1 : c1;
+                        const ac2 = c2 < 0 ? -c2 : c2;
+                        const cc = ac1 * dot2 + ac2 * dot1;
+                        const cd = dot1 * dot2 - ac1 * ac2;
+                        if (cd > 0 && cc * cc < _tanAngSq * cd * cd) {
+                            emit(x23, y23);
+                            return;
+                        }
+                    }
+                    if (_cuspLim > 0) {
+                        if (dot1 <= 0 || c1 * c1 > _tanCuspSq * dot1 * dot1) {
+                            emit(x2, y2);
+                            return;
+                        }
+                        if (dot2 <= 0 || c2 * c2 > _tanCuspSq * dot2 * dot2) {
+                            emit(x3, y3);
+                            return;
+                        }
+                    }
+                }
+                else {
+                    emit(x23, y23);
+                    return;
+                }
+            }
+            break;
+        }
+    }
+    const nl = level + 1;
+    cubicRec(x1, y1, x12, y12, x123, y123, x1234, y1234, nl);
+    cubicRec(x1234, y1234, x234, y234, x34, y34, x4, y4, nl);
+}
 class Polygonizer {
     constructor(curveFidelityConfig) {
         this.curveSteps = null;
+        // Precomputed tolerances
+        this._distTolSq = 0;
+        this._angleTol = 0;
+        this._tanAngSq = 0;
+        this._cuspLim = 0;
+        this._tanCuspSq = 0;
+        this._colEps = 0;
+        this._maxLvl = 0;
         this.curveFidelityConfig = {
             ...DEFAULT_CURVE_FIDELITY,
             ...curveFidelityConfig
         };
+        this.precompute();
     }
     setCurveFidelityConfig(curveFidelityConfig) {
         this.curveFidelityConfig = {
             ...DEFAULT_CURVE_FIDELITY,
             ...curveFidelityConfig
         };
+        this.precompute();
+    }
+    precompute() {
+        const c = this.curveFidelityConfig;
+        const dt = c.distanceTolerance ?? DEFAULT_CURVE_FIDELITY.distanceTolerance;
+        this._distTolSq = dt * dt;
+        this._angleTol = c.angleTolerance ?? DEFAULT_CURVE_FIDELITY.angleTolerance;
+        this._tanAngSq = this._angleTol > 0
+            ? Math.tan(this._angleTol) ** 2 : 0;
+        this._cuspLim = c.cuspLimit ?? 0;
+        this._tanCuspSq = this._cuspLim > 0
+            ? Math.tan(this._cuspLim) ** 2 : 0;
+        this._colEps = c.collinearityEpsilon ?? DEFAULT_CURVE_FIDELITY.collinearityEpsilon;
+        this._maxLvl = c.recursionLimit ?? DEFAULT_CURVE_FIDELITY.recursionLimit;
+    }
+    // Set module-level state from instance tolerances
+    activate() {
+        _distTolSq = this._distTolSq;
+        _angleTol = this._angleTol;
+        _tanAngSq = this._tanAngSq;
+        _cuspLim = this._cuspLim;
+        _tanCuspSq = this._tanCuspSq;
+        _colEps = this._colEps;
+        _maxLvl = this._maxLvl;
+        _out = [];
     }
     // Fixed-step subdivision; overrides adaptive curveFidelity when set
     setCurveSteps(curveSteps) {
@@ -3500,280 +3715,49 @@ class Polygonizer {
         if (this.curveSteps !== null) {
             return this.polygonizeQuadraticFixedSteps(start, control, end, this.curveSteps);
         }
-        const points = [];
-        this.recursiveQuadratic(start.x, start.y, control.x, control.y, end.x, end.y, points);
-        this.addPoint(end.x, end.y, points);
-        return points;
+        this.activate();
+        quadRec(start.x, start.y, control.x, control.y, end.x, end.y, 0);
+        emit(end.x, end.y);
+        return _out;
     }
     polygonizeCubic(start, control1, control2, end) {
         if (this.curveSteps !== null) {
             return this.polygonizeCubicFixedSteps(start, control1, control2, end, this.curveSteps);
         }
-        const points = [];
-        this.recursiveCubic(start.x, start.y, control1.x, control1.y, control2.x, control2.y, end.x, end.y, points);
-        this.addPoint(end.x, end.y, points);
-        return points;
-    }
-    lerp(a, b, t) {
-        return a + (b - a) * t;
+        this.activate();
+        cubicBegin(start.x, start.y, control1.x, control1.y, control2.x, control2.y, end.x, end.y);
+        emit(end.x, end.y);
+        return _out;
     }
     polygonizeQuadraticFixedSteps(start, control, end, steps) {
-        const points = [];
-        // Emit intermediate points; caller already has start
+        this.activate();
         for (let i = 1; i <= steps; i++) {
             const t = i / steps;
-            const x12 = this.lerp(start.x, control.x, t);
-            const y12 = this.lerp(start.y, control.y, t);
-            const x23 = this.lerp(control.x, end.x, t);
-            const y23 = this.lerp(control.y, end.y, t);
-            const x = this.lerp(x12, x23, t);
-            const y = this.lerp(y12, y23, t);
-            this.addPoint(x, y, points);
+            const x12 = start.x + (control.x - start.x) * t;
+            const y12 = start.y + (control.y - start.y) * t;
+            const x23 = control.x + (end.x - control.x) * t;
+            const y23 = control.y + (end.y - control.y) * t;
+            emit(x12 + (x23 - x12) * t, y12 + (y23 - y12) * t);
         }
-        return points;
+        return _out;
     }
     polygonizeCubicFixedSteps(start, control1, control2, end, steps) {
-        const points = [];
-        // Emit intermediate points; caller already has start
+        this.activate();
         for (let i = 1; i <= steps; i++) {
             const t = i / steps;
-            // De Casteljau
-            const x12 = this.lerp(start.x, control1.x, t);
-            const y12 = this.lerp(start.y, control1.y, t);
-            const x23 = this.lerp(control1.x, control2.x, t);
-            const y23 = this.lerp(control1.y, control2.y, t);
-            const x34 = this.lerp(control2.x, end.x, t);
-            const y34 = this.lerp(control2.y, end.y, t);
-            const x123 = this.lerp(x12, x23, t);
-            const y123 = this.lerp(y12, y23, t);
-            const x234 = this.lerp(x23, x34, t);
-            const y234 = this.lerp(y23, y34, t);
-            const x = this.lerp(x123, x234, t);
-            const y = this.lerp(y123, y234, t);
-            this.addPoint(x, y, points);
-        }
-        return points;
-    }
-    recursiveQuadratic(x1, y1, x2, y2, x3, y3, points, level = 0) {
-        if (level > RECURSION_LIMIT)
-            return;
-        // De Casteljau subdivision: split the curve at t=0.5
-        // First calculate midpoints of the two line segments
-        const x12 = (x1 + x2) / 2;
-        const y12 = (y1 + y2) / 2;
-        const x23 = (x2 + x3) / 2;
-        const y23 = (y2 + y3) / 2;
-        // Then find the midpoint of those midpoints - this is the curve point at t=0.5
-        const x123 = (x12 + x23) / 2;
-        const y123 = (y12 + y23) / 2;
-        const dx = x3 - x1;
-        const dy = y3 - y1;
-        const d = Math.abs((x2 - x3) * dy - (y2 - y3) * dx);
-        const baseTolerance = this.curveFidelityConfig.distanceTolerance ??
-            DEFAULT_CURVE_FIDELITY.distanceTolerance;
-        const distanceTolerance = baseTolerance * baseTolerance;
-        if (d > COLLINEARITY_EPSILON) {
-            // Regular case
-            // Recursion terminates when the curve is flat enough (deviation from straight line is within tolerance)
-            if (d * d <= distanceTolerance * (dx * dx + dy * dy)) {
-                // Angle check
-                const angleTolerance = this.curveFidelityConfig.angleTolerance ??
-                    DEFAULT_CURVE_FIDELITY.angleTolerance;
-                if (angleTolerance > 0) {
-                    // Angle between segments (p1->p2) and (p2->p3)
-                    // atan2(cross, dot) avoids computing 2 separate atan2() values
-                    const v1x = x2 - x1;
-                    const v1y = y2 - y1;
-                    const v2x = x3 - x2;
-                    const v2y = y3 - y2;
-                    const da = Math.abs(Math.atan2(v1x * v2y - v1y * v2x, v1x * v2x + v1y * v2y));
-                    if (da < angleTolerance) {
-                        this.addPoint(x2, y2, points);
-                        return;
-                    }
-                }
-                else {
-                    this.addPoint(x2, y2, points);
-                    return;
-                }
-            }
-        }
-        else {
-            // Collinear case
-            const da = dx * dx + dy * dy;
-            if (da === 0) {
-                const d2 = (x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1);
-                if (d2 <= distanceTolerance) {
-                    this.addPoint(x2, y2, points);
-                    return;
-                }
-            }
-            else {
-                const d2 = ((x2 - x1) * dx + (y2 - y1) * dy) / da;
-                if (d2 > 0 && d2 < 1 && d * d <= distanceTolerance * da) {
-                    this.addPoint(x2, y2, points);
-                    return;
-                }
-            }
-        }
-        // Continue subdividing
-        this.recursiveQuadratic(x1, y1, x12, y12, x123, y123, points, level + 1);
-        this.recursiveQuadratic(x123, y123, x23, y23, x3, y3, points, level + 1);
-    }
-    recursiveCubic(x1, y1, x2, y2, x3, y3, x4, y4, points, level = 0) {
-        if (level > RECURSION_LIMIT)
-            return;
-        // De Casteljau subdivision for cubic curves
-        const x12 = (x1 + x2) / 2;
-        const y12 = (y1 + y2) / 2;
-        const x23 = (x2 + x3) / 2;
-        const y23 = (y2 + y3) / 2;
-        const x34 = (x3 + x4) / 2;
-        const y34 = (y3 + y4) / 2;
-        const x123 = (x12 + x23) / 2;
-        const y123 = (y12 + y23) / 2;
-        const x234 = (x23 + x34) / 2;
-        const y234 = (y23 + y34) / 2;
-        const x1234 = (x123 + x234) / 2;
-        const y1234 = (y123 + y234) / 2;
-        const dx = x4 - x1;
-        const dy = y4 - y1;
-        const d2 = Math.abs((x2 - x4) * dy - (y2 - y4) * dx);
-        const d3 = Math.abs((x3 - x4) * dy - (y3 - y4) * dx);
-        const baseTolerance = this.curveFidelityConfig.distanceTolerance ??
-            DEFAULT_CURVE_FIDELITY.distanceTolerance;
-        const distanceTolerance = baseTolerance * baseTolerance;
-        let switchCondition = 0;
-        if (d2 > COLLINEARITY_EPSILON)
-            switchCondition |= 1;
-        if (d3 > COLLINEARITY_EPSILON)
-            switchCondition |= 2;
-        switch (switchCondition) {
-            case 0:
-                // All collinear OR p1==p4
-                const k = dx * dx + dy * dy;
-                if (k === 0) {
-                    const d2_sq = (x2 - x1) * (x2 - x1) + (y2 - y1) * (y2 - y1);
-                    const d3_sq = (x3 - x1) * (x3 - x1) + (y3 - y1) * (y3 - y1);
-                    if (d2_sq <= distanceTolerance && d3_sq <= distanceTolerance) {
-                        this.addPoint(x2, y2, points);
-                        this.addPoint(x3, y3, points);
-                        return;
-                    }
-                }
-                else {
-                    const da1 = ((x2 - x1) * dx + (y2 - y1) * dy) / k;
-                    const da2 = ((x3 - x1) * dx + (y3 - y1) * dy) / k;
-                    if (da1 > 0 &&
-                        da1 < 1 &&
-                        da2 > 0 &&
-                        da2 < 1 &&
-                        (d2 + d3) * (d2 + d3) <= distanceTolerance * k) {
-                        this.addPoint(x2, y2, points);
-                        this.addPoint(x3, y3, points);
-                        return;
-                    }
-                }
-                break;
-            case 1:
-                // p1,p2,p4 are collinear, p3 is not
-                if (d3 * d3 <= distanceTolerance * (dx * dx + dy * dy)) {
-                    const angleTolerance = this.curveFidelityConfig.angleTolerance ??
-                        DEFAULT_CURVE_FIDELITY.angleTolerance;
-                    if (angleTolerance > 0) {
-                        // Angle between segments (p2->p3) and (p3->p4)
-                        const v1x = x3 - x2;
-                        const v1y = y3 - y2;
-                        const v2x = x4 - x3;
-                        const v2y = y4 - y3;
-                        const da1 = Math.abs(Math.atan2(v1x * v2y - v1y * v2x, v1x * v2x + v1y * v2y));
-                        if (da1 < angleTolerance) {
-                            this.addPoint(x2, y2, points);
-                            this.addPoint(x3, y3, points);
-                            return;
-                        }
-                    }
-                    else {
-                        this.addPoint(x2, y2, points);
-                        this.addPoint(x3, y3, points);
-                        return;
-                    }
-                }
-                break;
-            case 2:
-                // p1,p3,p4 are collinear, p2 is not
-                if (d2 * d2 <= distanceTolerance * (dx * dx + dy * dy)) {
-                    const angleTolerance = this.curveFidelityConfig.angleTolerance ??
-                        DEFAULT_CURVE_FIDELITY.angleTolerance;
-                    if (angleTolerance > 0) {
-                        // Angle between segments (p1->p2) and (p2->p3)
-                        const v1x = x2 - x1;
-                        const v1y = y2 - y1;
-                        const v2x = x3 - x2;
-                        const v2y = y3 - y2;
-                        const da1 = Math.abs(Math.atan2(v1x * v2y - v1y * v2x, v1x * v2x + v1y * v2y));
-                        if (da1 < angleTolerance) {
-                            this.addPoint(x2, y2, points);
-                            this.addPoint(x3, y3, points);
-                            return;
-                        }
-                    }
-                    else {
-                        this.addPoint(x2, y2, points);
-                        this.addPoint(x3, y3, points);
-                        return;
-                    }
-                }
-                break;
-            case 3:
-                // Regular case
-                if ((d2 + d3) * (d2 + d3) <= distanceTolerance * (dx * dx + dy * dy)) {
-                    const angleTolerance = this.curveFidelityConfig.angleTolerance ??
-                        DEFAULT_CURVE_FIDELITY.angleTolerance;
-                    if (angleTolerance > 0) {
-                        // da1: angle between (p1->p2) and (p2->p3)
-                        const a1x = x2 - x1;
-                        const a1y = y2 - y1;
-                        const a2x = x3 - x2;
-                        const a2y = y3 - y2;
-                        const da1 = Math.abs(Math.atan2(a1x * a2y - a1y * a2x, a1x * a2x + a1y * a2y));
-                        // da2: angle between (p2->p3) and (p3->p4)
-                        const b1x = a2x;
-                        const b1y = a2y;
-                        const b2x = x4 - x3;
-                        const b2y = y4 - y3;
-                        const da2 = Math.abs(Math.atan2(b1x * b2y - b1y * b2x, b1x * b2x + b1y * b2y));
-                        if (da1 + da2 < angleTolerance) {
-                            this.addPoint(x2, y2, points);
-                            this.addPoint(x3, y3, points);
-                            return;
-                        }
-                    }
-                    else {
-                        this.addPoint(x2, y2, points);
-                        this.addPoint(x3, y3, points);
-                        return;
-                    }
-                }
-                break;
-        }
-        // Continue subdividing
-        this.recursiveCubic(x1, y1, x12, y12, x123, y123, x1234, y1234, points, level + 1);
-        this.recursiveCubic(x1234, y1234, x234, y234, x34, y34, x4, y4, points, level + 1);
-    }
-    addPoint(x, y, points) {
-        const newPoint = new Vec2(x, y);
-        if (points.length === 0) {
-            points.push(newPoint);
-            return;
-        }
-        const lastPoint = points[points.length - 1];
-        const dx = newPoint.x - lastPoint.x;
-        const dy = newPoint.y - lastPoint.y;
-        const distanceSquared = dx * dx + dy * dy;
-        if (distanceSquared > COLLINEARITY_EPSILON * COLLINEARITY_EPSILON) {
-            points.push(newPoint);
-        }
+            const x12 = start.x + (control1.x - start.x) * t;
+            const y12 = start.y + (control1.y - start.y) * t;
+            const x23 = control1.x + (control2.x - control1.x) * t;
+            const y23 = control1.y + (control2.y - control1.y) * t;
+            const x34 = control2.x + (end.x - control2.x) * t;
+            const y34 = control2.y + (end.y - control2.y) * t;
+            const x123 = x12 + (x23 - x12) * t;
+            const y123 = y12 + (y23 - y12) * t;
+            const x234 = x23 + (x34 - x23) * t;
+            const y234 = y23 + (y34 - y23) * t;
+            emit(x123 + (x234 - x123) * t, y123 + (y234 - y123) * t);
+        }
+        return _out;
     }
 }
 
@@ -4862,6 +4846,35 @@ async function loadBinary(filePath) {
     }
 }
 
+function getDefaultExportFromCjs (x) {
+	return x && x.__esModule && Object.prototype.hasOwnProperty.call(x, 'default') ? x['default'] : x;
+}
+
+function getAugmentedNamespace(n) {
+  if (n.__esModule) return n;
+  var f = n.default;
+	if (typeof f == "function") {
+		var a = function a () {
+			if (this instanceof a) {
+        return Reflect.construct(f, arguments, this.constructor);
+			}
+			return f.apply(this, arguments);
+		};
+		a.prototype = f.prototype;
+  } else a = {};
+  Object.defineProperty(a, '__esModule', {value: true});
+	Object.keys(n).forEach(function (k) {
+		var d = Object.getOwnPropertyDescriptor(n, k);
+		Object.defineProperty(a, k, d.get ? d : {
+			enumerable: true,
+			get: function () {
+				return n[k];
+			}
+		});
+	});
+	return a;
+}
+
 var hb = {exports: {}};
 
 var fs = {};