three-text 0.2.3 → 0.2.5

package/dist/index.cjs

@@ -1,5 +1,5 @@
 /*!
- * three-text v0.2.3
+ * three-text v0.2.5
  * Copyright (C) 2025 Countertype LLC
  * 
  * This program is free software: you can redistribute it and/or modify
@@ -1190,12 +1190,9 @@ class TextMeasurer {
         const letterSpacingInFontUnits = letterSpacing * loadedFont.upem;
         // Calculate total advance width with letter spacing
         let totalWidth = 0;
-        glyphInfos.forEach((glyph, index) => {
+        glyphInfos.forEach((glyph) => {
             totalWidth += glyph.ax;
-            // Spaces measured alone need letter spacing to match final rendering
-            const isLastChar = index === glyphInfos.length - 1;
-            const isSingleSpace = text === ' ' || text === '  ' || /^\s+$/.test(text);
-            if (letterSpacingInFontUnits !== 0 && (!isLastChar || isSingleSpace)) {
+            if (letterSpacingInFontUnits !== 0) {
                 totalWidth += letterSpacingInFontUnits;
             }
         });
@@ -1250,7 +1247,7 @@ class TextLayout {
                     originalEnd: currentIndex + line.length - 1,
                     xOffset: 0
                 });
-                currentIndex += line.length + 1; // +1 for the newline character
+                currentIndex += line.length + 1;
             }
         }
         return { lines };
@@ -1271,7 +1268,7 @@ class TextLayout {
                 offset = width - planeBounds.max.x;
             }
             if (offset !== 0) {
-                // Translate vertices directly
+                // Translate vertices
                 for (let i = 0; i < vertices.length; i += 3) {
                     vertices[i] += offset;
                 }
@@ -1989,2066 +1986,102 @@ class Box3 {
     }
 }
 
-var WINDING;
-(function (WINDING) {
-    WINDING[WINDING["ODD"] = 0] = "ODD";
-    WINDING[WINDING["NONZERO"] = 1] = "NONZERO";
-    WINDING[WINDING["POSITIVE"] = 2] = "POSITIVE";
-    WINDING[WINDING["NEGATIVE"] = 3] = "NEGATIVE";
-    WINDING[WINDING["ABS_GEQ_TWO"] = 4] = "ABS_GEQ_TWO";
-})(WINDING || (WINDING = {}));
-var ELEMENT;
-(function (ELEMENT) {
-    ELEMENT[ELEMENT["POLYGONS"] = 0] = "POLYGONS";
-    ELEMENT[ELEMENT["CONNECTED_POLYGONS"] = 1] = "CONNECTED_POLYGONS";
-    ELEMENT[ELEMENT["BOUNDARY_CONTOURS"] = 2] = "BOUNDARY_CONTOURS";
-})(ELEMENT || (ELEMENT = {}));
+var commonjsGlobal = typeof globalThis !== 'undefined' ? globalThis : typeof window !== 'undefined' ? window : typeof global !== 'undefined' ? global : typeof self !== 'undefined' ? self : {};
 
-function assert(cond, message) {
-    if (!cond) {
-        throw message || "Assertion Failed!";
-    }
+function getDefaultExportFromCjs (x) {
+	return x && x.__esModule && Object.prototype.hasOwnProperty.call(x, 'default') ? x['default'] : x;
 }
 
-var Geom = (function () {
-    function Geom() {
-    }
-    Geom.vertEq = function (u, v) {
-        return u.s === v.s && u.t === v.t;
-    };
-    Geom.vertLeq = function (u, v) {
-        return u.s < v.s || (u.s === v.s && u.t <= v.t);
-    };
-    Geom.transLeq = function (u, v) {
-        return u.t < v.t || (u.t === v.t && u.s <= v.s);
-    };
-    Geom.edgeGoesLeft = function (e) {
-        return Geom.vertLeq(e.Dst, e.Org);
-    };
-    Geom.edgeGoesRight = function (e) {
-        return Geom.vertLeq(e.Org, e.Dst);
-    };
-    Geom.vertL1dist = function (u, v) {
-        return Math.abs(u.s - v.s) + Math.abs(u.t - v.t);
-    };
-    Geom.edgeEval = function (u, v, w) {
-        assert(Geom.vertLeq(u, v) && Geom.vertLeq(v, w));
-        var gapL = v.s - u.s;
-        var gapR = w.s - v.s;
-        if (gapL + gapR > 0.0) {
-            if (gapL < gapR) {
-                return v.t - u.t + (u.t - w.t) * (gapL / (gapL + gapR));
-            }
-            else {
-                return v.t - w.t + (w.t - u.t) * (gapR / (gapL + gapR));
-            }
-        }
-        return 0.0;
-    };
-    Geom.edgeSign = function (u, v, w) {
-        assert(Geom.vertLeq(u, v) && Geom.vertLeq(v, w));
-        var gapL = v.s - u.s;
-        var gapR = w.s - v.s;
-        if (gapL + gapR > 0.0) {
-            return (v.t - w.t) * gapL + (v.t - u.t) * gapR;
-        }
-        return 0.0;
-    };
-    Geom.transEval = function (u, v, w) {
-        assert(Geom.transLeq(u, v) && Geom.transLeq(v, w));
-        var gapL = v.t - u.t;
-        var gapR = w.t - v.t;
-        if (gapL + gapR > 0.0) {
-            if (gapL < gapR) {
-                return v.s - u.s + (u.s - w.s) * (gapL / (gapL + gapR));
-            }
-            else {
-                return v.s - w.s + (w.s - u.s) * (gapR / (gapL + gapR));
-            }
-        }
-        return 0.0;
-    };
-    Geom.transSign = function (u, v, w) {
-        assert(Geom.transLeq(u, v) && Geom.transLeq(v, w));
-        var gapL = v.t - u.t;
-        var gapR = w.t - v.t;
-        if (gapL + gapR > 0.0) {
-            return (v.s - w.s) * gapL + (v.s - u.s) * gapR;
-        }
-        return 0.0;
-    };
-    Geom.vertCCW = function (u, v, w) {
-        return u.s * (v.t - w.t) + v.s * (w.t - u.t) + w.s * (u.t - v.t) >= 0.0;
-    };
-    Geom.interpolate = function (a, x, b, y) {
-        return ((a = a < 0 ? 0 : a),
-            (b = b < 0 ? 0 : b),
-            a <= b
-                ? b === 0
-                    ? (x + y) / 2
-                    : x + (y - x) * (a / (a + b))
-                : y + (x - y) * (b / (a + b)));
-    };
-    Geom.intersect = function (o1, d1, o2, d2, v) {
-        var z1, z2;
-        var t;
-        if (!Geom.vertLeq(o1, d1)) {
-            t = o1;
-            o1 = d1;
-            d1 = t;
-        }
-        if (!Geom.vertLeq(o2, d2)) {
-            t = o2;
-            o2 = d2;
-            d2 = t;
-        }
-        if (!Geom.vertLeq(o1, o2)) {
-            t = o1;
-            o1 = o2;
-            o2 = t;
-            t = d1;
-            d1 = d2;
-            d2 = t;
-        }
-        if (!Geom.vertLeq(o2, d1)) {
-            v.s = (o2.s + d1.s) / 2;
-        }
-        else if (Geom.vertLeq(d1, d2)) {
-            z1 = Geom.edgeEval(o1, o2, d1);
-            z2 = Geom.edgeEval(o2, d1, d2);
-            if (z1 + z2 < 0) {
-                z1 = -z1;
-                z2 = -z2;
-            }
-            v.s = Geom.interpolate(z1, o2.s, z2, d1.s);
-        }
-        else {
-            z1 = Geom.edgeSign(o1, o2, d1);
-            z2 = -Geom.edgeSign(o1, d2, d1);
-            if (z1 + z2 < 0) {
-                z1 = -z1;
-                z2 = -z2;
-            }
-            v.s = Geom.interpolate(z1, o2.s, z2, d2.s);
-        }
-        if (!Geom.transLeq(o1, d1)) {
-            t = o1;
-            o1 = d1;
-            d1 = t;
-        }
-        if (!Geom.transLeq(o2, d2)) {
-            t = o2;
-            o2 = d2;
-            d2 = t;
-        }
-        if (!Geom.transLeq(o1, o2)) {
-            t = o1;
-            o1 = o2;
-            o2 = t;
-            t = d1;
-            d1 = d2;
-            d2 = t;
-        }
-        if (!Geom.transLeq(o2, d1)) {
-            v.t = (o2.t + d1.t) / 2;
-        }
-        else if (Geom.transLeq(d1, d2)) {
-            z1 = Geom.transEval(o1, o2, d1);
-            z2 = Geom.transEval(o2, d1, d2);
-            if (z1 + z2 < 0) {
-                z1 = -z1;
-                z2 = -z2;
-            }
-            v.t = Geom.interpolate(z1, o2.t, z2, d1.t);
-        }
-        else {
-            z1 = Geom.transSign(o1, o2, d1);
-            z2 = -Geom.transSign(o1, d2, d1);
-            if (z1 + z2 < 0) {
-                z1 = -z1;
-                z2 = -z2;
-            }
-            v.t = Geom.interpolate(z1, o2.t, z2, d2.t);
-        }
-    };
-    return Geom;
-}());
-
-var TESSface = (function () {
-    function TESSface() {
-        this.next = null;
-        this.prev = null;
-        this.anEdge = null;
-        this.trail = null;
-        this.n = 0;
-        this.marked = false;
-        this.inside = false;
-    }
-    return TESSface;
-}());
+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 TESShalfEdge = (function () {
-    function TESShalfEdge(side) {
-        this.side = side;
-        this.next = null;
-        this.Org = null;
-        this.Sym = null;
-        this.Onext = null;
-        this.Lnext = null;
-        this.Lface = null;
-        this.activeRegion = null;
-        this.winding = 0;
-    }
-    Object.defineProperty(TESShalfEdge.prototype, "Rface", {
-        get: function () {
-            return this.Sym.Lface;
-        },
-        set: function (v) {
-            this.Sym.Lface = v;
-        },
-        enumerable: true,
-        configurable: true
-    });
-    Object.defineProperty(TESShalfEdge.prototype, "Dst", {
-        get: function () {
-            return this.Sym.Org;
-        },
-        set: function (v) {
-            this.Sym.Org = v;
-        },
-        enumerable: true,
-        configurable: true
-    });
-    Object.defineProperty(TESShalfEdge.prototype, "Oprev", {
-        get: function () {
-            return this.Sym.Lnext;
-        },
-        set: function (v) {
-            this.Sym.Lnext = v;
-        },
-        enumerable: true,
-        configurable: true
-    });
-    Object.defineProperty(TESShalfEdge.prototype, "Lprev", {
-        get: function () {
-            return this.Onext.Sym;
-        },
-        set: function (v) {
-            this.Onext.Sym = v;
-        },
-        enumerable: true,
-        configurable: true
-    });
-    Object.defineProperty(TESShalfEdge.prototype, "Dprev", {
-        get: function () {
-            return this.Lnext.Sym;
-        },
-        set: function (v) {
-            this.Lnext.Sym = v;
-        },
-        enumerable: true,
-        configurable: true
-    });
-    Object.defineProperty(TESShalfEdge.prototype, "Rprev", {
-        get: function () {
-            return this.Sym.Onext;
-        },
-        set: function (v) {
-            this.Sym.Onext = v;
-        },
-        enumerable: true,
-        configurable: true
-    });
-    Object.defineProperty(TESShalfEdge.prototype, "Dnext", {
-        get: function () {
-            return this.Sym.Onext.Sym;
-        },
-        set: function (v) {
-            this.Sym.Onext.Sym = v;
-        },
-        enumerable: true,
-        configurable: true
-    });
-    Object.defineProperty(TESShalfEdge.prototype, "Rnext", {
-        get: function () {
-            return this.Sym.Lnext.Sym;
-        },
-        set: function (v) {
-            this.Sym.Lnext.Sym = v;
-        },
-        enumerable: true,
-        configurable: true
-    });
-    return TESShalfEdge;
-}());
+var libtess_min = {exports: {}};
 
-var TESSvertex = (function () {
-    function TESSvertex() {
-        this.next = null;
-        this.prev = null;
-        this.anEdge = null;
-        this.coords = [0, 0, 0];
-        this.s = 0.0;
-        this.t = 0.0;
-        this.pqHandle = 0;
-        this.n = 0;
-        this.idx = 0;
-    }
-    return TESSvertex;
-}());
+/*
 
-var TESSmesh = (function () {
-    function TESSmesh() {
-        var v = new TESSvertex();
-        var f = new TESSface();
-        var e = new TESShalfEdge(0);
-        var eSym = new TESShalfEdge(1);
-        v.next = v.prev = v;
-        v.anEdge = null;
-        f.next = f.prev = f;
-        e.next = e;
-        e.Sym = eSym;
-        eSym.next = eSym;
-        eSym.Sym = e;
-        this.vHead = v;
-        this.fHead = f;
-        this.eHead = e;
-        this.eHeadSym = eSym;
-    }
-    TESSmesh.prototype.makeEdge_ = function (eNext) {
-        var e = new TESShalfEdge(0);
-        var eSym = new TESShalfEdge(1);
-        if (eNext.Sym.side < eNext.side) {
-            eNext = eNext.Sym;
-        }
-        var ePrev = eNext.Sym.next;
-        eSym.next = ePrev;
-        ePrev.Sym.next = e;
-        e.next = eNext;
-        eNext.Sym.next = eSym;
-        e.Sym = eSym;
-        e.Onext = e;
-        e.Lnext = eSym;
-        e.Org = null;
-        e.Lface = null;
-        e.winding = 0;
-        e.activeRegion = null;
-        eSym.Sym = e;
-        eSym.Onext = eSym;
-        eSym.Lnext = e;
-        eSym.Org = null;
-        eSym.Lface = null;
-        eSym.winding = 0;
-        eSym.activeRegion = null;
-        return e;
-    };
-    TESSmesh.prototype.splice_ = function (a, b) {
-        var aOnext = a.Onext;
-        var bOnext = b.Onext;
-        aOnext.Sym.Lnext = b;
-        bOnext.Sym.Lnext = a;
-        a.Onext = bOnext;
-        b.Onext = aOnext;
-    };
-    TESSmesh.prototype.makeVertex_ = function (newVertex, eOrig, vNext) {
-        var vNew = newVertex;
-        assert(vNew, "Vertex can't be null!");
-        var vPrev = vNext.prev;
-        vNew.prev = vPrev;
-        vPrev.next = vNew;
-        vNew.next = vNext;
-        vNext.prev = vNew;
-        vNew.anEdge = eOrig;
-        var e = eOrig;
-        do {
-            e.Org = vNew;
-            e = e.Onext;
-        } while (e !== eOrig);
-    };
-    TESSmesh.prototype.makeFace_ = function (newFace, eOrig, fNext) {
-        var fNew = newFace;
-        assert(fNew, "Face can't be null");
-        var fPrev = fNext.prev;
-        fNew.prev = fPrev;
-        fPrev.next = fNew;
-        fNew.next = fNext;
-        fNext.prev = fNew;
-        fNew.anEdge = eOrig;
-        fNew.trail = null;
-        fNew.marked = false;
-        fNew.inside = fNext.inside;
-        var e = eOrig;
-        do {
-            e.Lface = fNew;
-            e = e.Lnext;
-        } while (e !== eOrig);
-    };
-    TESSmesh.prototype.killEdge_ = function (eDel) {
-        if (eDel.Sym.side < eDel.side) {
-            eDel = eDel.Sym;
-        }
-        var eNext = eDel.next;
-        var ePrev = eDel.Sym.next;
-        eNext.Sym.next = ePrev;
-        ePrev.Sym.next = eNext;
-    };
-    TESSmesh.prototype.killVertex_ = function (vDel, newOrg) {
-        var eStart = vDel.anEdge;
-        var e = eStart;
-        do {
-            e.Org = newOrg;
-            e = e.Onext;
-        } while (e !== eStart);
-        var vPrev = vDel.prev;
-        var vNext = vDel.next;
-        vNext.prev = vPrev;
-        vPrev.next = vNext;
-    };
-    TESSmesh.prototype.killFace_ = function (fDel, newLface) {
-        var eStart = fDel.anEdge;
-        var e = eStart;
-        do {
-            e.Lface = newLface;
-            e = e.Lnext;
-        } while (e !== eStart);
-        var fPrev = fDel.prev;
-        var fNext = fDel.next;
-        fNext.prev = fPrev;
-        fPrev.next = fNext;
-    };
-    TESSmesh.prototype.makeEdge = function () {
-        var newVertex1 = new TESSvertex();
-        var newVertex2 = new TESSvertex();
-        var newFace = new TESSface();
-        var e = this.makeEdge_(this.eHead);
-        this.makeVertex_(newVertex1, e, this.vHead);
-        this.makeVertex_(newVertex2, e.Sym, this.vHead);
-        this.makeFace_(newFace, e, this.fHead);
-        return e;
-    };
-    TESSmesh.prototype.splice = function (eOrg, eDst) {
-        var joiningLoops = false;
-        var joiningVertices = false;
-        if (eOrg === eDst)
-            return;
-        if (eDst.Org !== eOrg.Org) {
-            joiningVertices = true;
-            this.killVertex_(eDst.Org, eOrg.Org);
-        }
-        if (eDst.Lface !== eOrg.Lface) {
-            joiningLoops = true;
-            this.killFace_(eDst.Lface, eOrg.Lface);
-        }
-        this.splice_(eDst, eOrg);
-        if (!joiningVertices) {
-            var newVertex = new TESSvertex();
-            this.makeVertex_(newVertex, eDst, eOrg.Org);
-            eOrg.Org.anEdge = eOrg;
-        }
-        if (!joiningLoops) {
-            var newFace = new TESSface();
-            this.makeFace_(newFace, eDst, eOrg.Lface);
-            eOrg.Lface.anEdge = eOrg;
-        }
-    };
-    TESSmesh.prototype.delete = function (eDel) {
-        var eDelSym = eDel.Sym;
-        var joiningLoops = false;
-        if (eDel.Lface !== eDel.Rface) {
-            joiningLoops = true;
-            this.killFace_(eDel.Lface, eDel.Rface);
-        }
-        if (eDel.Onext === eDel) {
-            this.killVertex_(eDel.Org, null);
-        }
-        else {
-            eDel.Rface.anEdge = eDel.Oprev;
-            eDel.Org.anEdge = eDel.Onext;
-            this.splice_(eDel, eDel.Oprev);
-            if (!joiningLoops) {
-                var newFace = new TESSface();
-                this.makeFace_(newFace, eDel, eDel.Lface);
-            }
-        }
-        if (eDelSym.Onext === eDelSym) {
-            this.killVertex_(eDelSym.Org, null);
-            this.killFace_(eDelSym.Lface, null);
-        }
-        else {
-            eDel.Lface.anEdge = eDelSym.Oprev;
-            eDelSym.Org.anEdge = eDelSym.Onext;
-            this.splice_(eDelSym, eDelSym.Oprev);
-        }
-        this.killEdge_(eDel);
-    };
-    TESSmesh.prototype.addEdgeVertex = function (eOrg) {
-        var eNew = this.makeEdge_(eOrg);
-        var eNewSym = eNew.Sym;
-        this.splice_(eNew, eOrg.Lnext);
-        eNew.Org = eOrg.Dst;
-        var newVertex = new TESSvertex();
-        this.makeVertex_(newVertex, eNewSym, eNew.Org);
-        eNew.Lface = eNewSym.Lface = eOrg.Lface;
-        return eNew;
-    };
-    TESSmesh.prototype.splitEdge = function (eOrg) {
-        var tempHalfEdge = this.addEdgeVertex(eOrg);
-        var eNew = tempHalfEdge.Sym;
-        this.splice_(eOrg.Sym, eOrg.Sym.Oprev);
-        this.splice_(eOrg.Sym, eNew);
-        eOrg.Dst = eNew.Org;
-        eNew.Dst.anEdge = eNew.Sym;
-        eNew.Rface = eOrg.Rface;
-        eNew.winding = eOrg.winding;
-        eNew.Sym.winding = eOrg.Sym.winding;
-        return eNew;
-    };
-    TESSmesh.prototype.connect = function (eOrg, eDst) {
-        var joiningLoops = false;
-        var eNew = this.makeEdge_(eOrg);
-        var eNewSym = eNew.Sym;
-        if (eDst.Lface !== eOrg.Lface) {
-            joiningLoops = true;
-            this.killFace_(eDst.Lface, eOrg.Lface);
-        }
-        this.splice_(eNew, eOrg.Lnext);
-        this.splice_(eNewSym, eDst);
-        eNew.Org = eOrg.Dst;
-        eNewSym.Org = eDst.Org;
-        eNew.Lface = eNewSym.Lface = eOrg.Lface;
-        eOrg.Lface.anEdge = eNewSym;
-        if (!joiningLoops) {
-            var newFace = new TESSface();
-            this.makeFace_(newFace, eNew, eOrg.Lface);
-        }
-        return eNew;
-    };
-    TESSmesh.prototype.zapFace = function (fZap) {
-        var eStart = fZap.anEdge;
-        var e, eNext, eSym;
-        var fPrev, fNext;
-        eNext = eStart.Lnext;
-        do {
-            e = eNext;
-            eNext = e.Lnext;
-            e.Lface = null;
-            if (e.Rface === null) {
-                if (e.Onext === e) {
-                    this.killVertex_(e.Org, null);
-                }
-                else {
-                    e.Org.anEdge = e.Onext;
-                    this.splice_(e, e.Oprev);
-                }
-                eSym = e.Sym;
-                if (eSym.Onext === eSym) {
-                    this.killVertex_(eSym.Org, null);
-                }
-                else {
-                    eSym.Org.anEdge = eSym.Onext;
-                    this.splice_(eSym, eSym.Oprev);
-                }
-                this.killEdge_(e);
-            }
-        } while (e != eStart);
-        fPrev = fZap.prev;
-        fNext = fZap.next;
-        fNext.prev = fPrev;
-        fPrev.next = fNext;
-    };
-    TESSmesh.prototype.countFaceVerts_ = function (f) {
-        var eCur = f.anEdge;
-        var n = 0;
-        do {
-            n++;
-            eCur = eCur.Lnext;
-        } while (eCur !== f.anEdge);
-        return n;
-    };
-    TESSmesh.prototype.mergeConvexFaces = function (maxVertsPerFace) {
-        var f;
-        var eCur, eNext, eSym;
-        var vStart;
-        var curNv, symNv;
-        for (f = this.fHead.next; f !== this.fHead; f = f.next) {
-            if (!f.inside)
-                continue;
-            eCur = f.anEdge;
-            vStart = eCur.Org;
-            while (true) {
-                eNext = eCur.Lnext;
-                eSym = eCur.Sym;
-                if (eSym && eSym.Lface && eSym.Lface.inside) {
-                    curNv = this.countFaceVerts_(f);
-                    symNv = this.countFaceVerts_(eSym.Lface);
-                    if (curNv + symNv - 2 <= maxVertsPerFace) {
-                        if (Geom.vertCCW(eCur.Lprev.Org, eCur.Org, eSym.Lnext.Lnext.Org) &&
-                            Geom.vertCCW(eSym.Lprev.Org, eSym.Org, eCur.Lnext.Lnext.Org)) {
-                            eNext = eSym.Lnext;
-                            this.delete(eSym);
-                            eCur = null;
-                            eSym = null;
-                        }
-                    }
-                }
-                if (eCur && eCur.Lnext.Org === vStart)
-                    break;
-                eCur = eNext;
-            }
-        }
-        return true;
-    };
-    TESSmesh.prototype.check = function () {
-        var fHead = this.fHead;
-        var vHead = this.vHead;
-        var eHead = this.eHead;
-        var f, fPrev, v, vPrev, e, ePrev;
-        fPrev = fHead;
-        for (fPrev = fHead; (f = fPrev.next) !== fHead; fPrev = f) {
-            assert(f.prev === fPrev);
-            e = f.anEdge;
-            do {
-                assert(e.Sym !== e);
-                assert(e.Sym.Sym === e);
-                assert(e.Lnext.Onext.Sym === e);
-                assert(e.Onext.Sym.Lnext === e);
-                assert(e.Lface === f);
-                e = e.Lnext;
-            } while (e !== f.anEdge);
-        }
-        assert(f.prev === fPrev && f.anEdge === null);
-        vPrev = vHead;
-        for (vPrev = vHead; (v = vPrev.next) !== vHead; vPrev = v) {
-            assert(v.prev === vPrev);
-            e = v.anEdge;
-            do {
-                assert(e.Sym !== e);
-                assert(e.Sym.Sym === e);
-                assert(e.Lnext.Onext.Sym === e);
-                assert(e.Onext.Sym.Lnext === e);
-                assert(e.Org === v);
-                e = e.Onext;
-            } while (e !== v.anEdge);
-        }
-        assert(v.prev === vPrev && v.anEdge === null);
-        ePrev = eHead;
-        for (ePrev = eHead; (e = ePrev.next) !== eHead; ePrev = e) {
-            assert(e.Sym.next === ePrev.Sym);
-            assert(e.Sym !== e);
-            assert(e.Sym.Sym === e);
-            assert(e.Org !== null);
-            assert(e.Dst !== null);
-            assert(e.Lnext.Onext.Sym === e);
-            assert(e.Onext.Sym.Lnext === e);
-        }
-        assert(e.Sym.next === ePrev.Sym &&
-            e.Sym === this.eHeadSym &&
-            e.Sym.Sym === e &&
-            e.Org === null &&
-            e.Dst === null &&
-            e.Lface === null &&
-            e.Rface === null);
-    };
-    return TESSmesh;
-}());
+ Copyright 2000, Silicon Graphics, Inc. All Rights Reserved.
+ Copyright 2015, Google Inc. All Rights Reserved.
 
-var PQnode = (function () {
-    function PQnode() {
-        this.handle = null;
-    }
-    return PQnode;
-}());
-var PQhandleElem = (function () {
-    function PQhandleElem() {
-        this.key = null;
-        this.node = 0;
-    }
-    return PQhandleElem;
-}());
-var PriorityQ = (function () {
-    function PriorityQ(size, leq) {
-        this.leq = leq;
-        this.max = 0;
-        this.nodes = [];
-        this.handles = [];
-        this.initialized = false;
-        this.freeList = 0;
-        this.size = 0;
-        this.max = size;
-        this.nodes = [];
-        this.handles = [];
-        for (var i = 0; i < size + 1; i++) {
-            this.nodes[i] = new PQnode();
-            this.handles[i] = new PQhandleElem();
-        }
-        this.initialized = false;
-        this.nodes[1].handle = 1;
-        this.handles[1].key = null;
-    }
-    PriorityQ.prototype.floatDown_ = function (curr) {
-        var n = this.nodes;
-        var h = this.handles;
-        var hCurr, hChild;
-        var child;
-        hCurr = n[curr].handle;
-        for (;;) {
-            child = curr << 1;
-            if (child < this.size &&
-                this.leq(h[n[child + 1].handle].key, h[n[child].handle].key)) {
-                ++child;
-            }
-            assert(child <= this.max);
-            hChild = n[child].handle;
-            if (child > this.size || this.leq(h[hCurr].key, h[hChild].key)) {
-                n[curr].handle = hCurr;
-                h[hCurr].node = curr;
-                break;
-            }
-            n[curr].handle = hChild;
-            h[hChild].node = curr;
-            curr = child;
-        }
-    };
-    PriorityQ.prototype.floatUp_ = function (curr) {
-        var n = this.nodes;
-        var h = this.handles;
-        var hCurr, hParent;
-        var parent;
-        hCurr = n[curr].handle;
-        for (;;) {
-            parent = curr >> 1;
-            hParent = n[parent].handle;
-            if (parent === 0 || this.leq(h[hParent].key, h[hCurr].key)) {
-                n[curr].handle = hCurr;
-                h[hCurr].node = curr;
-                break;
-            }
-            n[curr].handle = hParent;
-            h[hParent].node = curr;
-            curr = parent;
-        }
-    };
-    PriorityQ.prototype.init = function () {
-        for (var i = this.size; i >= 1; --i) {
-            this.floatDown_(i);
-        }
-        this.initialized = true;
-    };
-    PriorityQ.prototype.min = function () {
-        return this.handles[this.nodes[1].handle].key;
-    };
-    PriorityQ.prototype.insert = function (keyNew) {
-        var curr;
-        var free;
-        curr = ++this.size;
-        if (curr * 2 > this.max) {
-            this.max *= 2;
-            var i;
-            var s;
-            s = this.nodes.length;
-            this.nodes.length = this.max + 1;
-            for (i = s; i < this.nodes.length; i++)
-                this.nodes[i] = new PQnode();
-            s = this.handles.length;
-            this.handles.length = this.max + 1;
-            for (i = s; i < this.handles.length; i++)
-                this.handles[i] = new PQhandleElem();
-        }
-        if (this.freeList === 0) {
-            free = curr;
-        }
-        else {
-            free = this.freeList;
-            this.freeList = this.handles[free].node;
-        }
-        this.nodes[curr].handle = free;
-        this.handles[free].node = curr;
-        this.handles[free].key = keyNew;
-        if (this.initialized) {
-            this.floatUp_(curr);
-        }
-        return free;
-    };
-    PriorityQ.prototype.extractMin = function () {
-        var n = this.nodes;
-        var h = this.handles;
-        var hMin = n[1].handle;
-        var min = h[hMin].key;
-        if (this.size > 0) {
-            n[1].handle = n[this.size].handle;
-            h[n[1].handle].node = 1;
-            h[hMin].key = null;
-            h[hMin].node = this.freeList;
-            this.freeList = hMin;
-            --this.size;
-            if (this.size > 0) {
-                this.floatDown_(1);
-            }
-        }
-        return min;
-    };
-    PriorityQ.prototype.delete = function (hCurr) {
-        var n = this.nodes;
-        var h = this.handles;
-        var curr;
-        assert(hCurr >= 1 && hCurr <= this.max && h[hCurr].key !== null);
-        curr = h[hCurr].node;
-        n[curr].handle = n[this.size].handle;
-        h[n[curr].handle].node = curr;
-        --this.size;
-        if (curr <= this.size) {
-            if (curr <= 1 ||
-                this.leq(h[n[curr >> 1].handle].key, h[n[curr].handle].key)) {
-                this.floatDown_(curr);
-            }
-            else {
-                this.floatUp_(curr);
-            }
-        }
-        h[hCurr].key = null;
-        h[hCurr].node = this.freeList;
-        this.freeList = hCurr;
-    };
-    return PriorityQ;
-}());
+ 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:
 
-var ActiveRegion = (function () {
-    function ActiveRegion() {
-        this.eUp = null;
-        this.nodeUp = null;
-        this.windingNumber = 0;
-        this.inside = false;
-        this.sentinel = false;
-        this.dirty = false;
-        this.fixUpperEdge = false;
-    }
-    return ActiveRegion;
-}());
+ 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.
 
-var DictNode = (function () {
-    function DictNode() {
-        this.key = null;
-        this.next = null;
-        this.prev = null;
-    }
-    return DictNode;
-}());
-var Dict = (function () {
-    function Dict(frame, leq) {
-        this.frame = frame;
-        this.leq = leq;
-        this.head = new DictNode();
-        this.head.next = this.head;
-        this.head.prev = this.head;
-    }
-    Dict.prototype.min = function () {
-        return this.head.next;
-    };
-    Dict.prototype.max = function () {
-        return this.head.prev;
-    };
-    Dict.prototype.insert = function (k) {
-        return this.insertBefore(this.head, k);
-    };
-    Dict.prototype.search = function (key) {
-        var node = this.head;
-        do {
-            node = node.next;
-        } while (node.key !== null && !this.leq(this.frame, key, node.key));
-        return node;
-    };
-    Dict.prototype.insertBefore = function (node, key) {
-        do {
-            node = node.prev;
-        } while (node.key !== null && !this.leq(this.frame, node.key, key));
-        var newNode = new DictNode();
-        newNode.key = key;
-        newNode.next = node.next;
-        node.next.prev = newNode;
-        newNode.prev = node;
-        node.next = newNode;
-        return newNode;
-    };
-    Dict.prototype.delete = function (node) {
-        node.next.prev = node.prev;
-        node.prev.next = node.next;
-    };
-    return Dict;
-}());
+ 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.
 
-var Sweep = (function () {
-    function Sweep() {
-    }
-    Sweep.regionBelow = function (r) {
-        return r.nodeUp.prev.key;
-    };
-    Sweep.regionAbove = function (r) {
-        return r.nodeUp.next.key;
-    };
-    Sweep.debugEvent = function (tess) {
-    };
-    Sweep.addWinding = function (eDst, eSrc) {
-        eDst.winding += eSrc.winding;
-        eDst.Sym.winding += eSrc.Sym.winding;
-    };
-    Sweep.edgeLeq = function (tess, reg1, reg2) {
-        var ev = tess.event;
-        var e1 = reg1.eUp;
-        var e2 = reg2.eUp;
-        if (e1.Dst === ev) {
-            if (e2.Dst === ev) {
-                if (Geom.vertLeq(e1.Org, e2.Org)) {
-                    return Geom.edgeSign(e2.Dst, e1.Org, e2.Org) <= 0;
-                }
-                return Geom.edgeSign(e1.Dst, e2.Org, e1.Org) >= 0;
-            }
-            return Geom.edgeSign(e2.Dst, ev, e2.Org) <= 0;
-        }
-        if (e2.Dst === ev) {
-            return Geom.edgeSign(e1.Dst, ev, e1.Org) >= 0;
-        }
-        var t1 = Geom.edgeEval(e1.Dst, ev, e1.Org);
-        var t2 = Geom.edgeEval(e2.Dst, ev, e2.Org);
-        return t1 >= t2;
-    };
-    Sweep.deleteRegion = function (tess, reg) {
-        if (reg.fixUpperEdge) {
-            assert(reg.eUp.winding === 0);
-        }
-        reg.eUp.activeRegion = null;
-        tess.dict.delete(reg.nodeUp);
-    };
-    Sweep.fixUpperEdge = function (tess, reg, newEdge) {
-        assert(reg.fixUpperEdge);
-        tess.mesh.delete(reg.eUp);
-        reg.fixUpperEdge = false;
-        reg.eUp = newEdge;
-        newEdge.activeRegion = reg;
-    };
-    Sweep.topLeftRegion = function (tess, reg) {
-        var org = reg.eUp.Org;
-        var e;
-        do {
-            reg = Sweep.regionAbove(reg);
-        } while (reg.eUp.Org === org);
-        if (reg.fixUpperEdge) {
-            e = tess.mesh.connect(Sweep.regionBelow(reg).eUp.Sym, reg.eUp.Lnext);
-            if (e === null)
-                return null;
-            Sweep.fixUpperEdge(tess, reg, e);
-            reg = Sweep.regionAbove(reg);
-        }
-        return reg;
-    };
-    Sweep.topRightRegion = function (reg) {
-        var dst = reg.eUp.Dst;
-        do {
-            reg = Sweep.regionAbove(reg);
-        } while (reg.eUp.Dst === dst);
-        return reg;
-    };
-    Sweep.addRegionBelow = function (tess, regAbove, eNewUp) {
-        var regNew = new ActiveRegion();
-        regNew.eUp = eNewUp;
-        regNew.nodeUp = tess.dict.insertBefore(regAbove.nodeUp, regNew);
-        regNew.fixUpperEdge = false;
-        regNew.sentinel = false;
-        regNew.dirty = false;
-        eNewUp.activeRegion = regNew;
-        return regNew;
-    };
-    Sweep.isWindingInside = function (tess, n) {
-        switch (tess.windingRule) {
-            case WINDING.ODD:
-                return (n & 1) !== 0;
-            case WINDING.NONZERO:
-                return n !== 0;
-            case WINDING.POSITIVE:
-                return n > 0;
-            case WINDING.NEGATIVE:
-                return n < 0;
-            case WINDING.ABS_GEQ_TWO:
-                return n >= 2 || n <= -2;
-        }
-        throw new Error("Invalid winding rulle");
-    };
-    Sweep.computeWinding = function (tess, reg) {
-        reg.windingNumber =
-            Sweep.regionAbove(reg).windingNumber + reg.eUp.winding;
-        reg.inside = Sweep.isWindingInside(tess, reg.windingNumber);
-    };
-    Sweep.finishRegion = function (tess, reg) {
-        var e = reg.eUp;
-        var f = e.Lface;
-        f.inside = reg.inside;
-        f.anEdge = e;
-        Sweep.deleteRegion(tess, reg);
-    };
-    Sweep.finishLeftRegions = function (tess, regFirst, regLast) {
-        var e;
-        var reg = null;
-        var regPrev = regFirst;
-        var ePrev = regFirst.eUp;
-        while (regPrev !== regLast) {
-            regPrev.fixUpperEdge = false;
-            reg = Sweep.regionBelow(regPrev);
-            e = reg.eUp;
-            if (e.Org != ePrev.Org) {
-                if (!reg.fixUpperEdge) {
-                    Sweep.finishRegion(tess, regPrev);
-                    break;
-                }
-                e = tess.mesh.connect(ePrev.Lprev, e.Sym);
-                Sweep.fixUpperEdge(tess, reg, e);
-            }
-            if (ePrev.Onext !== e) {
-                tess.mesh.splice(e.Oprev, e);
-                tess.mesh.splice(ePrev, e);
-            }
-            Sweep.finishRegion(tess, regPrev);
-            ePrev = reg.eUp;
-            regPrev = reg;
-        }
-        return ePrev;
-    };
-    Sweep.addRightEdges = function (tess, regUp, eFirst, eLast, eTopLeft, cleanUp) {
-        var reg, regPrev;
-        var e, ePrev;
-        var firstTime = true;
-        e = eFirst;
-        do {
-            assert(Geom.vertLeq(e.Org, e.Dst));
-            Sweep.addRegionBelow(tess, regUp, e.Sym);
-            e = e.Onext;
-        } while (e !== eLast);
-        if (eTopLeft === null) {
-            eTopLeft = Sweep.regionBelow(regUp).eUp.Rprev;
-        }
-        regPrev = regUp;
-        ePrev = eTopLeft;
-        for (;;) {
-            reg = Sweep.regionBelow(regPrev);
-            e = reg.eUp.Sym;
-            if (e.Org !== ePrev.Org)
-                break;
-            if (e.Onext !== ePrev) {
-                tess.mesh.splice(e.Oprev, e);
-                tess.mesh.splice(ePrev.Oprev, e);
-            }
-            reg.windingNumber = regPrev.windingNumber - e.winding;
-            reg.inside = Sweep.isWindingInside(tess, reg.windingNumber);
-            regPrev.dirty = true;
-            if (!firstTime && Sweep.checkForRightSplice(tess, regPrev)) {
-                Sweep.addWinding(e, ePrev);
-                Sweep.deleteRegion(tess, regPrev);
-                tess.mesh.delete(ePrev);
-            }
-            firstTime = false;
-            regPrev = reg;
-            ePrev = e;
-        }
-        regPrev.dirty = true;
-        assert(regPrev.windingNumber - e.winding === reg.windingNumber);
-        if (cleanUp) {
-            Sweep.walkDirtyRegions(tess, regPrev);
-        }
-    };
-    Sweep.spliceMergeVertices = function (tess, e1, e2) {
-        tess.mesh.splice(e1, e2);
-    };
-    Sweep.vertexWeights = function (isect, org, dst) {
-        var t1 = Geom.vertL1dist(org, isect);
-        var t2 = Geom.vertL1dist(dst, isect);
-        var w0 = (0.5 * t2) / (t1 + t2);
-        var w1 = (0.5 * t1) / (t1 + t2);
-        isect.coords[0] += w0 * org.coords[0] + w1 * dst.coords[0];
-        isect.coords[1] += w0 * org.coords[1] + w1 * dst.coords[1];
-        isect.coords[2] += w0 * org.coords[2] + w1 * dst.coords[2];
-    };
-    Sweep.getIntersectData = function (tess, isect, orgUp, dstUp, orgLo, dstLo) {
-        isect.coords[0] = isect.coords[1] = isect.coords[2] = 0;
-        isect.idx = -1;
-        Sweep.vertexWeights(isect, orgUp, dstUp);
-        Sweep.vertexWeights(isect, orgLo, dstLo);
-    };
-    Sweep.checkForRightSplice = function (tess, regUp) {
-        var regLo = Sweep.regionBelow(regUp);
-        var eUp = regUp.eUp;
-        var eLo = regLo.eUp;
-        if (Geom.vertLeq(eUp.Org, eLo.Org)) {
-            if (Geom.edgeSign(eLo.Dst, eUp.Org, eLo.Org) > 0)
-                return false;
-            if (!Geom.vertEq(eUp.Org, eLo.Org)) {
-                tess.mesh.splitEdge(eLo.Sym);
-                tess.mesh.splice(eUp, eLo.Oprev);
-                regUp.dirty = regLo.dirty = true;
-            }
-            else if (eUp.Org !== eLo.Org) {
-                tess.pq.delete(eUp.Org.pqHandle);
-                Sweep.spliceMergeVertices(tess, eLo.Oprev, eUp);
-            }
-        }
-        else {
-            if (Geom.edgeSign(eUp.Dst, eLo.Org, eUp.Org) < 0)
-                return false;
-            Sweep.regionAbove(regUp).dirty = regUp.dirty = true;
-            tess.mesh.splitEdge(eUp.Sym);
-            tess.mesh.splice(eLo.Oprev, eUp);
-        }
-        return true;
-    };
-    Sweep.checkForLeftSplice = function (tess, regUp) {
-        var regLo = Sweep.regionBelow(regUp);
-        var eUp = regUp.eUp;
-        var eLo = regLo.eUp;
-        var e;
-        assert(!Geom.vertEq(eUp.Dst, eLo.Dst));
-        if (Geom.vertLeq(eUp.Dst, eLo.Dst)) {
-            if (Geom.edgeSign(eUp.Dst, eLo.Dst, eUp.Org) < 0)
-                return false;
-            Sweep.regionAbove(regUp).dirty = regUp.dirty = true;
-            e = tess.mesh.splitEdge(eUp);
-            tess.mesh.splice(eLo.Sym, e);
-            e.Lface.inside = regUp.inside;
-        }
-        else {
-            if (Geom.edgeSign(eLo.Dst, eUp.Dst, eLo.Org) > 0)
-                return false;
-            regUp.dirty = regLo.dirty = true;
-            e = tess.mesh.splitEdge(eLo);
-            tess.mesh.splice(eUp.Lnext, eLo.Sym);
-            e.Rface.inside = regUp.inside;
-        }
-        return true;
-    };
-    Sweep.checkForIntersect = function (tess, regUp) {
-        var regLo = Sweep.regionBelow(regUp);
-        var eUp = regUp.eUp;
-        var eLo = regLo.eUp;
-        var orgUp = eUp.Org;
-        var orgLo = eLo.Org;
-        var dstUp = eUp.Dst;
-        var dstLo = eLo.Dst;
-        var tMinUp, tMaxLo;
-        var isect = new TESSvertex(), orgMin;
-        var e;
-        assert(!Geom.vertEq(dstLo, dstUp));
-        assert(Geom.edgeSign(dstUp, tess.event, orgUp) <= 0);
-        assert(Geom.edgeSign(dstLo, tess.event, orgLo) >= 0);
-        assert(orgUp !== tess.event && orgLo !== tess.event);
-        assert(!regUp.fixUpperEdge && !regLo.fixUpperEdge);
-        if (orgUp === orgLo)
-            return false;
-        tMinUp = Math.min(orgUp.t, dstUp.t);
-        tMaxLo = Math.max(orgLo.t, dstLo.t);
-        if (tMinUp > tMaxLo)
-            return false;
-        if (Geom.vertLeq(orgUp, orgLo)) {
-            if (Geom.edgeSign(dstLo, orgUp, orgLo) > 0)
-                return false;
-        }
-        else {
-            if (Geom.edgeSign(dstUp, orgLo, orgUp) < 0)
-                return false;
-        }
-        Sweep.debugEvent(tess);
-        Geom.intersect(dstUp, orgUp, dstLo, orgLo, isect);
-        assert(Math.min(orgUp.t, dstUp.t) <= isect.t);
-        assert(isect.t <= Math.max(orgLo.t, dstLo.t));
-        assert(Math.min(dstLo.s, dstUp.s) <= isect.s);
-        assert(isect.s <= Math.max(orgLo.s, orgUp.s));
-        if (Geom.vertLeq(isect, tess.event)) {
-            isect.s = tess.event.s;
-            isect.t = tess.event.t;
-        }
-        orgMin = Geom.vertLeq(orgUp, orgLo) ? orgUp : orgLo;
-        if (Geom.vertLeq(orgMin, isect)) {
-            isect.s = orgMin.s;
-            isect.t = orgMin.t;
-        }
-        if (Geom.vertEq(isect, orgUp) || Geom.vertEq(isect, orgLo)) {
-            Sweep.checkForRightSplice(tess, regUp);
-            return false;
-        }
-        if ((!Geom.vertEq(dstUp, tess.event) &&
-            Geom.edgeSign(dstUp, tess.event, isect) >= 0) ||
-            (!Geom.vertEq(dstLo, tess.event) &&
-                Geom.edgeSign(dstLo, tess.event, isect) <= 0)) {
-            if (dstLo === tess.event) {
-                tess.mesh.splitEdge(eUp.Sym);
-                tess.mesh.splice(eLo.Sym, eUp);
-                regUp = Sweep.topLeftRegion(tess, regUp);
-                eUp = Sweep.regionBelow(regUp).eUp;
-                Sweep.finishLeftRegions(tess, Sweep.regionBelow(regUp), regLo);
-                Sweep.addRightEdges(tess, regUp, eUp.Oprev, eUp, eUp, true);
-                return true;
-            }
-            if (dstUp === tess.event) {
-                tess.mesh.splitEdge(eLo.Sym);
-                tess.mesh.splice(eUp.Lnext, eLo.Oprev);
-                regLo = regUp;
-                regUp = Sweep.topRightRegion(regUp);
-                e = Sweep.regionBelow(regUp).eUp.Rprev;
-                regLo.eUp = eLo.Oprev;
-                eLo = Sweep.finishLeftRegions(tess, regLo, null);
-                Sweep.addRightEdges(tess, regUp, eLo.Onext, eUp.Rprev, e, true);
-                return true;
-            }
-            if (Geom.edgeSign(dstUp, tess.event, isect) >= 0) {
-                Sweep.regionAbove(regUp).dirty = regUp.dirty = true;
-                tess.mesh.splitEdge(eUp.Sym);
-                eUp.Org.s = tess.event.s;
-                eUp.Org.t = tess.event.t;
-            }
-            if (Geom.edgeSign(dstLo, tess.event, isect) <= 0) {
-                regUp.dirty = regLo.dirty = true;
-                tess.mesh.splitEdge(eLo.Sym);
-                eLo.Org.s = tess.event.s;
-                eLo.Org.t = tess.event.t;
-            }
-            return false;
-        }
-        tess.mesh.splitEdge(eUp.Sym);
-        tess.mesh.splitEdge(eLo.Sym);
-        tess.mesh.splice(eLo.Oprev, eUp);
-        eUp.Org.s = isect.s;
-        eUp.Org.t = isect.t;
-        eUp.Org.pqHandle = tess.pq.insert(eUp.Org);
-        Sweep.getIntersectData(tess, eUp.Org, orgUp, dstUp, orgLo, dstLo);
-        Sweep.regionAbove(regUp).dirty = regUp.dirty = regLo.dirty = true;
-        return false;
-    };
-    Sweep.walkDirtyRegions = function (tess, regUp) {
-        var regLo = Sweep.regionBelow(regUp);
-        var eUp, eLo;
-        for (;;) {
-            while (regLo.dirty) {
-                regUp = regLo;
-                regLo = Sweep.regionBelow(regLo);
-            }
-            if (!regUp.dirty) {
-                regLo = regUp;
-                regUp = Sweep.regionAbove(regUp);
-                if (regUp === null || !regUp.dirty) {
-                    return;
-                }
-            }
-            regUp.dirty = false;
-            eUp = regUp.eUp;
-            eLo = regLo.eUp;
-            if (eUp.Dst !== eLo.Dst) {
-                if (Sweep.checkForLeftSplice(tess, regUp)) {
-                    if (regLo.fixUpperEdge) {
-                        Sweep.deleteRegion(tess, regLo);
-                        tess.mesh.delete(eLo);
-                        regLo = Sweep.regionBelow(regUp);
-                        eLo = regLo.eUp;
-                    }
-                    else if (regUp.fixUpperEdge) {
-                        Sweep.deleteRegion(tess, regUp);
-                        tess.mesh.delete(eUp);
-                        regUp = Sweep.regionAbove(regLo);
-                        eUp = regUp.eUp;
-                    }
-                }
-            }
-            if (eUp.Org !== eLo.Org) {
-                if (eUp.Dst !== eLo.Dst &&
-                    !regUp.fixUpperEdge &&
-                    !regLo.fixUpperEdge &&
-                    (eUp.Dst === tess.event || eLo.Dst === tess.event)) {
-                    if (Sweep.checkForIntersect(tess, regUp)) {
-                        return;
-                    }
-                }
-                else {
-                    Sweep.checkForRightSplice(tess, regUp);
-                }
-            }
-            if (eUp.Org === eLo.Org && eUp.Dst === eLo.Dst) {
-                Sweep.addWinding(eLo, eUp);
-                Sweep.deleteRegion(tess, regUp);
-                tess.mesh.delete(eUp);
-                regUp = Sweep.regionAbove(regLo);
-            }
-        }
-    };
-    Sweep.connectRightVertex = function (tess, regUp, eBottomLeft) {
-        var eNew;
-        var eTopLeft = eBottomLeft.Onext;
-        var regLo = Sweep.regionBelow(regUp);
-        var eUp = regUp.eUp;
-        var eLo = regLo.eUp;
-        var degenerate = false;
-        if (eUp.Dst !== eLo.Dst) {
-            Sweep.checkForIntersect(tess, regUp);
-        }
-        if (Geom.vertEq(eUp.Org, tess.event)) {
-            tess.mesh.splice(eTopLeft.Oprev, eUp);
-            regUp = Sweep.topLeftRegion(tess, regUp);
-            eTopLeft = Sweep.regionBelow(regUp).eUp;
-            Sweep.finishLeftRegions(tess, Sweep.regionBelow(regUp), regLo);
-            degenerate = true;
-        }
-        if (Geom.vertEq(eLo.Org, tess.event)) {
-            tess.mesh.splice(eBottomLeft, eLo.Oprev);
-            eBottomLeft = Sweep.finishLeftRegions(tess, regLo, null);
-            degenerate = true;
-        }
-        if (degenerate) {
-            Sweep.addRightEdges(tess, regUp, eBottomLeft.Onext, eTopLeft, eTopLeft, true);
-            return;
-        }
-        if (Geom.vertLeq(eLo.Org, eUp.Org)) {
-            eNew = eLo.Oprev;
-        }
-        else {
-            eNew = eUp;
-        }
-        eNew = tess.mesh.connect(eBottomLeft.Lprev, eNew);
-        Sweep.addRightEdges(tess, regUp, eNew, eNew.Onext, eNew.Onext, false);
-        eNew.Sym.activeRegion.fixUpperEdge = true;
-        Sweep.walkDirtyRegions(tess, regUp);
-    };
-    Sweep.connectLeftDegenerate = function (tess, regUp, vEvent) {
-        var e, eTopLeft, eTopRight, eLast;
-        var reg;
-        e = regUp.eUp;
-        if (Geom.vertEq(e.Org, vEvent)) {
-            assert(false);
-            Sweep.spliceMergeVertices(tess, e, vEvent.anEdge);
-            return;
-        }
-        if (!Geom.vertEq(e.Dst, vEvent)) {
-            tess.mesh.splitEdge(e.Sym);
-            if (regUp.fixUpperEdge) {
-                tess.mesh.delete(e.Onext);
-                regUp.fixUpperEdge = false;
-            }
-            tess.mesh.splice(vEvent.anEdge, e);
-            Sweep.sweepEvent(tess, vEvent);
-            return;
-        }
-        assert(false);
-        regUp = Sweep.topRightRegion(regUp);
-        reg = Sweep.regionBelow(regUp);
-        eTopRight = reg.eUp.Sym;
-        eTopLeft = eLast = eTopRight.Onext;
-        if (reg.fixUpperEdge) {
-            assert(eTopLeft !== eTopRight);
-            Sweep.deleteRegion(tess, reg);
-            tess.mesh.delete(eTopRight);
-            eTopRight = eTopLeft.Oprev;
-        }
-        tess.mesh.splice(vEvent.anEdge, eTopRight);
-        if (!Geom.edgeGoesLeft(eTopLeft)) {
-            eTopLeft = null;
-        }
-        Sweep.addRightEdges(tess, regUp, eTopRight.Onext, eLast, eTopLeft, true);
-    };
-    Sweep.connectLeftVertex = function (tess, vEvent) {
-        var regUp, regLo, reg;
-        var eUp, eLo, eNew;
-        var tmp = new ActiveRegion();
-        tmp.eUp = vEvent.anEdge.Sym;
-        regUp = tess.dict.search(tmp).key;
-        regLo = Sweep.regionBelow(regUp);
-        if (!regLo) {
-            return;
-        }
-        eUp = regUp.eUp;
-        eLo = regLo.eUp;
-        if (Geom.edgeSign(eUp.Dst, vEvent, eUp.Org) === 0.0) {
-            Sweep.connectLeftDegenerate(tess, regUp, vEvent);
-            return;
-        }
-        reg = Geom.vertLeq(eLo.Dst, eUp.Dst) ? regUp : regLo;
-        if (regUp.inside || reg.fixUpperEdge) {
-            if (reg === regUp) {
-                eNew = tess.mesh.connect(vEvent.anEdge.Sym, eUp.Lnext);
-            }
-            else {
-                var tempHalfEdge = tess.mesh.connect(eLo.Dnext, vEvent.anEdge);
-                eNew = tempHalfEdge.Sym;
-            }
-            if (reg.fixUpperEdge) {
-                Sweep.fixUpperEdge(tess, reg, eNew);
-            }
-            else {
-                Sweep.computeWinding(tess, Sweep.addRegionBelow(tess, regUp, eNew));
-            }
-            Sweep.sweepEvent(tess, vEvent);
-        }
-        else {
-            Sweep.addRightEdges(tess, regUp, vEvent.anEdge, vEvent.anEdge, null, true);
-        }
-    };
-    Sweep.sweepEvent = function (tess, vEvent) {
-        tess.event = vEvent;
-        Sweep.debugEvent(tess);
-        var e = vEvent.anEdge;
-        while (e.activeRegion === null) {
-            e = e.Onext;
-            if (e === vEvent.anEdge) {
-                Sweep.connectLeftVertex(tess, vEvent);
-                return;
-            }
-        }
-        var regUp = Sweep.topLeftRegion(tess, e.activeRegion);
-        assert(regUp !== null);
-        var reg = Sweep.regionBelow(regUp);
-        var eTopLeft = reg.eUp;
-        var eBottomLeft = Sweep.finishLeftRegions(tess, reg, null);
-        if (eBottomLeft.Onext === eTopLeft) {
-            Sweep.connectRightVertex(tess, regUp, eBottomLeft);
-        }
-        else {
-            Sweep.addRightEdges(tess, regUp, eBottomLeft.Onext, eTopLeft, eTopLeft, true);
-        }
-    };
-    Sweep.addSentinel = function (tess, smin, smax, t) {
-        var reg = new ActiveRegion();
-        var e = tess.mesh.makeEdge();
-        e.Org.s = smax;
-        e.Org.t = t;
-        e.Dst.s = smin;
-        e.Dst.t = t;
-        tess.event = e.Dst;
-        reg.eUp = e;
-        reg.windingNumber = 0;
-        reg.inside = false;
-        reg.fixUpperEdge = false;
-        reg.sentinel = true;
-        reg.dirty = false;
-        reg.nodeUp = tess.dict.insert(reg);
-    };
-    Sweep.initEdgeDict = function (tess) {
-        tess.dict = new Dict(tess, Sweep.edgeLeq);
-        var w = tess.bmax[0] - tess.bmin[0];
-        var h = tess.bmax[1] - tess.bmin[1];
-        var smin = tess.bmin[0] - w;
-        var smax = tess.bmax[0] + w;
-        var tmin = tess.bmin[1] - h;
-        var tmax = tess.bmax[1] + h;
-        Sweep.addSentinel(tess, smin, smax, tmin);
-        Sweep.addSentinel(tess, smin, smax, tmax);
-    };
-    Sweep.doneEdgeDict = function (tess) {
-        var reg;
-        var fixedEdges = 0;
-        while ((reg = tess.dict.min().key) !== null) {
-            if (!reg.sentinel) {
-                assert(reg.fixUpperEdge);
-                assert(++fixedEdges === 1);
-            }
-            assert(reg.windingNumber === 0);
-            Sweep.deleteRegion(tess, reg);
-        }
-    };
-    Sweep.removeDegenerateEdges = function (tess) {
-        var e, eNext, eLnext;
-        var eHead = tess.mesh.eHead;
-        for (e = eHead.next; e !== eHead; e = eNext) {
-            eNext = e.next;
-            eLnext = e.Lnext;
-            if (Geom.vertEq(e.Org, e.Dst) && e.Lnext.Lnext !== e) {
-                Sweep.spliceMergeVertices(tess, eLnext, e);
-                tess.mesh.delete(e);
-                e = eLnext;
-                eLnext = e.Lnext;
-            }
-            if (eLnext.Lnext === e) {
-                if (eLnext !== e) {
-                    if (eLnext === eNext || eLnext === eNext.Sym) {
-                        eNext = eNext.next;
-                    }
-                    tess.mesh.delete(eLnext);
-                }
-                if (e === eNext || e === eNext.Sym) {
-                    eNext = eNext.next;
-                }
-                tess.mesh.delete(e);
-            }
-        }
-    };
-    Sweep.initPriorityQ = function (tess) {
-        var pq;
-        var v, vHead;
-        var vertexCount = 0;
-        vHead = tess.mesh.vHead;
-        for (v = vHead.next; v !== vHead; v = v.next) {
-            vertexCount++;
-        }
-        vertexCount += 8;
-        pq = tess.pq = new PriorityQ(vertexCount, Geom.vertLeq);
-        vHead = tess.mesh.vHead;
-        for (v = vHead.next; v !== vHead; v = v.next) {
-            v.pqHandle = pq.insert(v);
-        }
-        if (v !== vHead) {
-            return false;
-        }
-        pq.init();
-        return true;
-    };
-    Sweep.donePriorityQ = function (tess) {
-        tess.pq = null;
-    };
-    Sweep.removeDegenerateFaces = function (tess, mesh) {
-        var f, fNext;
-        var e;
-        for (f = mesh.fHead.next; f !== mesh.fHead; f = fNext) {
-            fNext = f.next;
-            e = f.anEdge;
-            assert(e.Lnext !== e);
-            if (e.Lnext.Lnext === e) {
-                Sweep.addWinding(e.Onext, e);
-                tess.mesh.delete(e);
-            }
-        }
-        return true;
-    };
-    Sweep.computeInterior = function (tess, validate) {
-        if (validate === void 0) { validate = true; }
-        var v, vNext;
-        Sweep.removeDegenerateEdges(tess);
-        if (!Sweep.initPriorityQ(tess)) {
-            return false;
-        }
-        Sweep.initEdgeDict(tess);
-        while ((v = tess.pq.extractMin()) !== null) {
-            for (;;) {
-                vNext = tess.pq.min();
-                if (vNext === null || !Geom.vertEq(vNext, v))
-                    break;
-                vNext = tess.pq.extractMin();
-                Sweep.spliceMergeVertices(tess, v.anEdge, vNext.anEdge);
-            }
-            Sweep.sweepEvent(tess, v);
-        }
-        tess.event = tess.dict.min().key.eUp.Org;
-        Sweep.debugEvent(tess);
-        Sweep.doneEdgeDict(tess);
-        Sweep.donePriorityQ(tess);
-        if (!Sweep.removeDegenerateFaces(tess, tess.mesh)) {
-            return false;
-        }
-        if (validate) {
-            tess.mesh.check();
-        }
-        return true;
-    };
-    return Sweep;
-}());
+ 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.
+*/
 
-var Tesselator = (function () {
-    function Tesselator() {
-        this.mesh = new TESSmesh();
-        this.normal = [0.0, 0.0, 0.0];
-        this.sUnit = [0.0, 0.0, 0.0];
-        this.tUnit = [0.0, 0.0, 0.0];
-        this.bmin = [0.0, 0.0];
-        this.bmax = [0.0, 0.0];
-        this.windingRule = WINDING.ODD;
-        this.dict = null;
-        this.pq = null;
-        this.event = null;
-        this.vertexIndexCounter = 0;
-        this.vertices = [];
-        this.vertexIndices = [];
-        this.vertexCount = 0;
-        this.elements = [];
-        this.elementCount = 0;
-    }
-    Tesselator.prototype.dot_ = function (u, v) {
-        return u[0] * v[0] + u[1] * v[1] + u[2] * v[2];
-    };
-    Tesselator.prototype.normalize_ = function (v) {
-        var len = v[0] * v[0] + v[1] * v[1] + v[2] * v[2];
-        if (!len) {
-            throw "Zero-size vector!";
-        }
-        len = Math.sqrt(len);
-        v[0] /= len;
-        v[1] /= len;
-        v[2] /= len;
-    };
-    Tesselator.prototype.longAxis_ = function (v) {
-        var i = 0;
-        if (Math.abs(v[1]) > Math.abs(v[0])) {
-            i = 1;
-        }
-        if (Math.abs(v[2]) > Math.abs(v[i])) {
-            i = 2;
-        }
-        return i;
-    };
-    Tesselator.prototype.computeNormal_ = function (norm) {
-        var v, v1, v2;
-        var c, tLen2, maxLen2;
-        var maxVal = [0, 0, 0], minVal = [0, 0, 0], d1 = [0, 0, 0], d2 = [0, 0, 0], tNorm = [0, 0, 0];
-        var maxVert = [null, null, null], minVert = [null, null, null];
-        var vHead = this.mesh.vHead;
-        v = vHead.next;
-        for (var i_1 = 0; i_1 < 3; ++i_1) {
-            c = v.coords[i_1];
-            minVal[i_1] = c;
-            minVert[i_1] = v;
-            maxVal[i_1] = c;
-            maxVert[i_1] = v;
-        }
-        for (v = vHead.next; v !== vHead; v = v.next) {
-            for (var i_2 = 0; i_2 < 3; ++i_2) {
-                c = v.coords[i_2];
-                if (c < minVal[i_2]) {
-                    minVal[i_2] = c;
-                    minVert[i_2] = v;
-                }
-                if (c > maxVal[i_2]) {
-                    maxVal[i_2] = c;
-                    maxVert[i_2] = v;
-                }
-            }
-        }
-        var i = 0;
-        if (maxVal[1] - minVal[1] > maxVal[0] - minVal[0]) {
-            i = 1;
-        }
-        if (maxVal[2] - minVal[2] > maxVal[i] - minVal[i]) {
-            i = 2;
-        }
-        if (minVal[i] >= maxVal[i]) {
-            norm[0] = 0;
-            norm[1] = 0;
-            norm[2] = 1;
-            return;
-        }
-        maxLen2 = 0;
-        v1 = minVert[i];
-        v2 = maxVert[i];
-        d1[0] = v1.coords[0] - v2.coords[0];
-        d1[1] = v1.coords[1] - v2.coords[1];
-        d1[2] = v1.coords[2] - v2.coords[2];
-        for (v = vHead.next; v !== vHead; v = v.next) {
-            d2[0] = v.coords[0] - v2.coords[0];
-            d2[1] = v.coords[1] - v2.coords[1];
-            d2[2] = v.coords[2] - v2.coords[2];
-            tNorm[0] = d1[1] * d2[2] - d1[2] * d2[1];
-            tNorm[1] = d1[2] * d2[0] - d1[0] * d2[2];
-            tNorm[2] = d1[0] * d2[1] - d1[1] * d2[0];
-            tLen2 = tNorm[0] * tNorm[0] + tNorm[1] * tNorm[1] + tNorm[2] * tNorm[2];
-            if (tLen2 > maxLen2) {
-                maxLen2 = tLen2;
-                norm[0] = tNorm[0];
-                norm[1] = tNorm[1];
-                norm[2] = tNorm[2];
-            }
-        }
-        if (maxLen2 <= 0) {
-            norm[0] = norm[1] = norm[2] = 0;
-            norm[this.longAxis_(d1)] = 1;
-        }
-    };
-    Tesselator.prototype.checkOrientation_ = function () {
-        var fHead = this.mesh.fHead;
-        var v, vHead = this.mesh.vHead;
-        var e;
-        var area = 0;
-        for (var f_1 = fHead.next; f_1 !== fHead; f_1 = f_1.next) {
-            e = f_1.anEdge;
-            if (e.winding <= 0)
-                continue;
-            do {
-                area += (e.Org.s - e.Dst.s) * (e.Org.t + e.Dst.t);
-                e = e.Lnext;
-            } while (e !== f_1.anEdge);
-        }
-        if (area < 0) {
-            for (v = vHead.next; v !== vHead; v = v.next) {
-                v.t = -v.t;
-            }
-            this.tUnit[0] = -this.tUnit[0];
-            this.tUnit[1] = -this.tUnit[1];
-            this.tUnit[2] = -this.tUnit[2];
-        }
-    };
-    Tesselator.prototype.projectPolygon_ = function () {
-        var vHead = this.mesh.vHead;
-        var norm = [0, 0, 0];
-        var sUnit, tUnit;
-        var computedNormal = false;
-        norm[0] = this.normal[0];
-        norm[1] = this.normal[1];
-        norm[2] = this.normal[2];
-        if (!norm[0] && !norm[1] && !norm[2]) {
-            this.computeNormal_(norm);
-            computedNormal = true;
-        }
-        sUnit = this.sUnit;
-        tUnit = this.tUnit;
-        var axis = this.longAxis_(norm);
-        sUnit[axis] = 0;
-        sUnit[(axis + 1) % 3] = 1.0;
-        sUnit[(axis + 2) % 3] = 0.0;
-        tUnit[axis] = 0;
-        tUnit[(axis + 1) % 3] = 0.0;
-        tUnit[(axis + 2) % 3] = norm[axis] > 0 ? 1.0 : -1.0;
-        for (var v_1 = vHead.next; v_1 !== vHead; v_1 = v_1.next) {
-            v_1.s = this.dot_(v_1.coords, sUnit);
-            v_1.t = this.dot_(v_1.coords, tUnit);
-        }
-        if (computedNormal) {
-            this.checkOrientation_();
-        }
-        var first = true;
-        for (var v_2 = vHead.next; v_2 !== vHead; v_2 = v_2.next) {
-            if (first) {
-                this.bmin[0] = this.bmax[0] = v_2.s;
-                this.bmin[1] = this.bmax[1] = v_2.t;
-                first = false;
-            }
-            else {
-                if (v_2.s < this.bmin[0])
-                    this.bmin[0] = v_2.s;
-                if (v_2.s > this.bmax[0])
-                    this.bmax[0] = v_2.s;
-                if (v_2.t < this.bmin[1])
-                    this.bmin[1] = v_2.t;
-                if (v_2.t > this.bmax[1])
-                    this.bmax[1] = v_2.t;
-            }
-        }
-    };
-    Tesselator.prototype.addWinding_ = function (eDst, eSrc) {
-        eDst.winding += eSrc.winding;
-        eDst.Sym.winding += eSrc.Sym.winding;
-    };
-    Tesselator.prototype.tessellateMonoRegion_ = function (mesh, face) {
-        var up, lo;
-        up = face.anEdge;
-        if (!(up.Lnext !== up && up.Lnext.Lnext !== up)) {
-            throw "Mono region invalid";
-        }
-        for (; Geom.vertLeq(up.Dst, up.Org); up = up.Lprev)
-            ;
-        for (; Geom.vertLeq(up.Org, up.Dst); up = up.Lnext)
-            ;
-        lo = up.Lprev;
-        var tempHalfEdge = undefined;
-        while (up.Lnext !== lo) {
-            if (Geom.vertLeq(up.Dst, lo.Org)) {
-                while (lo.Lnext !== up &&
-                    (Geom.edgeGoesLeft(lo.Lnext) ||
-                        Geom.edgeSign(lo.Org, lo.Dst, lo.Lnext.Dst) <= 0.0)) {
-                    tempHalfEdge = mesh.connect(lo.Lnext, lo);
-                    lo = tempHalfEdge.Sym;
-                }
-                lo = lo.Lprev;
-            }
-            else {
-                while (lo.Lnext !== up &&
-                    (Geom.edgeGoesRight(up.Lprev) ||
-                        Geom.edgeSign(up.Dst, up.Org, up.Lprev.Org) >= 0.0)) {
-                    tempHalfEdge = mesh.connect(up, up.Lprev);
-                    up = tempHalfEdge.Sym;
-                }
-                up = up.Lnext;
-            }
-        }
-        if (lo.Lnext === up) {
-            throw "Mono region invalid";
-        }
-        while (lo.Lnext.Lnext !== up) {
-            tempHalfEdge = mesh.connect(lo.Lnext, lo);
-            lo = tempHalfEdge.Sym;
-        }
-        return true;
-    };
-    Tesselator.prototype.tessellateInterior_ = function (mesh) {
-        var next;
-        for (var f = mesh.fHead.next; f !== mesh.fHead; f = next) {
-            next = f.next;
-            if (f.inside) {
-                if (!this.tessellateMonoRegion_(mesh, f)) {
-                    return false;
-                }
-            }
-        }
-        return true;
-    };
-    Tesselator.prototype.discardExterior_ = function (mesh) {
-        var next;
-        for (var f = mesh.fHead.next; f !== mesh.fHead; f = next) {
-            next = f.next;
-            if (!f.inside) {
-                mesh.zapFace(f);
-            }
-        }
-    };
-    Tesselator.prototype.setWindingNumber_ = function (mesh, value, keepOnlyBoundary) {
-        var eNext;
-        for (var e = mesh.eHead.next; e !== mesh.eHead; e = eNext) {
-            eNext = e.next;
-            if (e.Rface.inside !== e.Lface.inside) {
-                e.winding = e.Lface.inside ? value : -value;
-            }
-            else {
-                if (!keepOnlyBoundary) {
-                    e.winding = 0;
-                }
-                else {
-                    mesh.delete(e);
-                }
-            }
-        }
-    };
-    Tesselator.prototype.getNeighbourFace_ = function (edge) {
-        if (!edge.Rface)
-            return -1;
-        if (!edge.Rface.inside)
-            return -1;
-        return edge.Rface.n;
-    };
-    Tesselator.prototype.outputPolymesh_ = function (mesh, elementType, polySize, vertexSize) {
-        var edge;
-        var maxFaceCount = 0;
-        var maxVertexCount = 0;
-        var faceVerts;
-        if (polySize > 3) {
-            mesh.mergeConvexFaces(polySize);
-        }
-        for (var v = mesh.vHead.next; v !== mesh.vHead; v = v.next) {
-            v.n = -1;
-        }
-        for (var f = mesh.fHead.next; f !== mesh.fHead; f = f.next) {
-            f.n = -1;
-            if (!f.inside) {
-                continue;
-            }
-            edge = f.anEdge;
-            faceVerts = 0;
-            do {
-                var v = edge.Org;
-                if (v.n === -1) {
-                    v.n = maxVertexCount;
-                    maxVertexCount++;
-                }
-                faceVerts++;
-                edge = edge.Lnext;
-            } while (edge !== f.anEdge);
-            if ((faceVerts > polySize)) {
-                throw "Face vertex greater that support polygon";
-            }
-            f.n = maxFaceCount;
-            ++maxFaceCount;
-        }
-        this.elementCount = maxFaceCount;
-        if (elementType === ELEMENT.CONNECTED_POLYGONS) {
-            maxFaceCount *= 2;
-        }
-        this.elements = [];
-        this.elements.length = maxFaceCount * polySize;
-        this.vertexCount = maxVertexCount;
-        this.vertices = [];
-        this.vertices.length = maxVertexCount * vertexSize;
-        this.vertexIndices = [];
-        this.vertexIndices.length = maxVertexCount;
-        for (var v = mesh.vHead.next; v !== mesh.vHead; v = v.next) {
-            if (v.n !== -1) {
-                var idx = v.n * vertexSize;
-                this.vertices[idx + 0] = v.coords[0];
-                this.vertices[idx + 1] = v.coords[1];
-                if (vertexSize > 2) {
-                    this.vertices[idx + 2] = v.coords[2];
-                }
-                this.vertexIndices[v.n] = v.idx;
-            }
-        }
-        var nel = 0;
-        for (var f = mesh.fHead.next; f !== mesh.fHead; f = f.next) {
-            if (!f.inside)
-                continue;
-            edge = f.anEdge;
-            faceVerts = 0;
-            do {
-                var v = edge.Org;
-                this.elements[nel++] = v.n;
-                faceVerts++;
-                edge = edge.Lnext;
-            } while (edge !== f.anEdge);
-            for (var i_3 = faceVerts; i_3 < polySize; ++i_3) {
-                this.elements[nel++] = -1;
-            }
-            if (elementType === ELEMENT.CONNECTED_POLYGONS) {
-                edge = f.anEdge;
-                do {
-                    this.elements[nel++] = this.getNeighbourFace_(edge);
-                    edge = edge.Lnext;
-                } while (edge !== f.anEdge);
-                for (var i_4 = faceVerts; i_4 < polySize; ++i_4) {
-                    this.elements[nel++] = -1;
-                }
-            }
-        }
-    };
-    Tesselator.prototype.outputContours_ = function (mesh, vertexSize) {
-        var edge;
-        var start;
-        var startVert = 0;
-        var vertCount = 0;
-        this.vertexCount = 0;
-        this.elementCount = 0;
-        for (var f = mesh.fHead.next; f !== mesh.fHead; f = f.next) {
-            if (!f.inside) {
-                continue;
-            }
-            start = edge = f.anEdge;
-            do {
-                this.vertexCount++;
-                edge = edge.Lnext;
-            } while (edge !== start);
-            this.elementCount++;
-        }
-        this.elements = [];
-        this.elements.length = this.elementCount * 2;
-        this.vertices = [];
-        this.vertices.length = this.vertexCount * vertexSize;
-        this.vertexIndices = [];
-        this.vertexIndices.length = this.vertexCount;
-        var nv = 0;
-        var nvi = 0;
-        var nel = 0;
-        startVert = 0;
-        for (var f = mesh.fHead.next; f !== mesh.fHead; f = f.next) {
-            if (!f.inside) {
-                continue;
-            }
-            vertCount = 0;
-            start = edge = f.anEdge;
-            do {
-                this.vertices[nv++] = edge.Org.coords[0];
-                this.vertices[nv++] = edge.Org.coords[1];
-                if (vertexSize > 2) {
-                    this.vertices[nv++] = edge.Org.coords[2];
-                }
-                this.vertexIndices[nvi++] = edge.Org.idx;
-                vertCount++;
-                edge = edge.Lnext;
-            } while (edge !== start);
-            this.elements[nel++] = startVert;
-            this.elements[nel++] = vertCount;
-            startVert += vertCount;
-        }
-    };
-    Tesselator.prototype.addContour = function (size, vertices) {
-        if (this.mesh === null) {
-            this.mesh = new TESSmesh();
-        }
-        if (size < 2) {
-            size = 2;
-        }
-        if (size > 3) {
-            size = 3;
-        }
-        var e = null;
-        for (var i = 0; i < vertices.length; i += size) {
-            if (e === null) {
-                e = this.mesh.makeEdge();
-                this.mesh.splice(e, e.Sym);
-            }
-            else {
-                this.mesh.splitEdge(e);
-                e = e.Lnext;
-            }
-            e.Org.coords[0] = vertices[i + 0];
-            e.Org.coords[1] = vertices[i + 1];
-            if (size > 2) {
-                e.Org.coords[2] = vertices[i + 2];
-            }
-            else {
-                e.Org.coords[2] = 0.0;
-            }
-            e.Org.idx = this.vertexIndexCounter++;
-            e.winding = 1;
-            e.Sym.winding = -1;
-        }
-    };
-    Tesselator.prototype.tesselate = function (windingRule, elementType, polySize, vertexSize, normal, validate) {
-        if (windingRule === void 0) { windingRule = WINDING.ODD; }
-        if (elementType === void 0) { elementType = ELEMENT.POLYGONS; }
-        if (validate === void 0) { validate = true; }
-        this.vertices = [];
-        this.elements = [];
-        this.vertexIndices = [];
-        this.vertexIndexCounter = 0;
-        if (normal) {
-            this.normal[0] = normal[0];
-            this.normal[1] = normal[1];
-            this.normal[2] = normal[2];
-        }
-        this.windingRule = windingRule;
-        if (vertexSize < 2) {
-            vertexSize = 2;
-        }
-        if (vertexSize > 3) {
-            vertexSize = 3;
-        }
-        if (!this.mesh) {
-            return false;
-        }
-        this.projectPolygon_();
-        Sweep.computeInterior(this, validate);
-        var mesh = this.mesh;
-        if (elementType === ELEMENT.BOUNDARY_CONTOURS) {
-            this.setWindingNumber_(mesh, 1, true);
-        }
-        else {
-            this.tessellateInterior_(mesh);
-        }
-        if (validate) {
-            mesh.check();
-        }
-        if (elementType === ELEMENT.BOUNDARY_CONTOURS) {
-            this.outputContours_(mesh, vertexSize);
-        }
-        else {
-            this.outputPolymesh_(mesh, elementType, polySize, vertexSize);
-        }
-        return true;
-    };
-    return Tesselator;
-}());
+(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));
 
-function tesselate(_a) {
-    var _b = _a.windingRule, windingRule = _b === void 0 ? WINDING.ODD : _b, _c = _a.elementType, elementType = _c === void 0 ? ELEMENT.POLYGONS : _c, _d = _a.polySize, polySize = _d === void 0 ? 3 : _d, _e = _a.vertexSize, vertexSize = _e === void 0 ? 2 : _e, _f = _a.normal, normal = _f === void 0 ? [0, 0, 1] : _f, _g = _a.contours, contours = _g === void 0 ? [] : _g, _h = _a.strict, strict = _h === void 0 ? true : _h, _j = _a.debug, debug = _j === void 0 ? false : _j;
-    if (!contours && strict) {
-        throw new Error("Contours can't be empty");
-    }
-    if (!contours) {
-        return undefined;
-    }
-    var tess = new Tesselator();
-    for (var i = 0; i < contours.length; i++) {
-        tess.addContour(vertexSize || 2, contours[i]);
-    }
-    tess.tesselate(windingRule, elementType, polySize, vertexSize, normal, strict);
-    return {
-        vertices: tess.vertices,
-        vertexIndices: tess.vertexIndices,
-        vertexCount: tess.vertexCount,
-        elements: tess.elements,
-        elementCount: tess.elementCount,
-        mesh: debug ? tess.mesh : undefined,
-    };
-}
-WINDING.ODD;
-WINDING.NONZERO;
-WINDING.POSITIVE;
-WINDING.NEGATIVE;
-WINDING.ABS_GEQ_TWO;
-ELEMENT.POLYGONS;
-ELEMENT.CONNECTED_POLYGONS;
-ELEMENT.BOUNDARY_CONTOURS;
+var libtess_minExports = libtess_min.exports;
 
 class Tessellator {
     process(paths, removeOverlaps = true, isCFF = false) {
@@ -4071,9 +2104,9 @@ class Tessellator {
         if (removeOverlaps) {
             debugLogger.log('Two-pass: boundary extraction then triangulation');
             // Extract boundaries to remove overlaps
-            const boundaryResult = this.performTessellation(contours, ELEMENT.BOUNDARY_CONTOURS);
+            const boundaryResult = this.performTessellation(contours, 'boundary');
             if (!boundaryResult) {
-                debugLogger.warn('Tess2 returned empty result from boundary pass');
+                debugLogger.warn('libtess returned empty result from boundary pass');
                 return { triangles: { vertices: [], indices: [] }, contours: [] };
             }
             // Convert boundary elements back to contours
@@ -4083,19 +2116,19 @@ class Tessellator {
         else {
             debugLogger.log(`Single-pass triangulation for ${isCFF ? 'CFF' : 'TTF'}`);
         }
-        // Triangulate the (possibly cleaned) contours
-        const triangleResult = this.performTessellation(contours, ELEMENT.POLYGONS);
+        // Triangulate the contours
+        const triangleResult = this.performTessellation(contours, 'triangles');
         if (!triangleResult) {
             const warning = removeOverlaps
-                ? 'Tess2 returned empty result from triangulation pass'
-                : 'Tess2 returned empty result from single-pass triangulation';
+                ? 'libtess returned empty result from triangulation pass'
+                : 'libtess returned empty result from single-pass triangulation';
             debugLogger.warn(warning);
             return { triangles: { vertices: [], indices: [] }, contours };
         }
         return {
             triangles: {
-                vertices: Array.from(triangleResult.vertices),
-                indices: Array.from(triangleResult.elements)
+                vertices: triangleResult.vertices,
+                indices: triangleResult.indices || []
             },
             contours
         };
@@ -4109,27 +2142,75 @@ class Tessellator {
             return contour;
         });
     }
-    performTessellation(contours, elementType) {
-        const result = tesselate({
-            contours,
-            windingRule: WINDING.NONZERO,
-            elementType,
-            polySize: 3,
-            vertexSize: 2,
-            strict: false
+    performTessellation(contours, mode) {
+        const tess = new libtess_minExports.GluTesselator();
+        // Set winding rule to NON-ZERO
+        tess.gluTessProperty(libtess_minExports.gluEnum.GLU_TESS_WINDING_RULE, libtess_minExports.windingRule.GLU_TESS_WINDING_NONZERO);
+        const vertices = [];
+        const indices = [];
+        const contourIndices = [];
+        let currentContour = [];
+        if (mode === 'boundary') {
+            tess.gluTessProperty(libtess_minExports.gluEnum.GLU_TESS_BOUNDARY_ONLY, true);
+        }
+        if (mode === 'triangles') {
+            tess.gluTessCallback(libtess_minExports.gluEnum.GLU_TESS_VERTEX_DATA, (data) => {
+                indices.push(data);
+            });
+        }
+        else {
+            tess.gluTessCallback(libtess_minExports.gluEnum.GLU_TESS_BEGIN, () => {
+                currentContour = [];
+            });
+            tess.gluTessCallback(libtess_minExports.gluEnum.GLU_TESS_VERTEX_DATA, (data) => {
+                currentContour.push(data);
+            });
+            tess.gluTessCallback(libtess_minExports.gluEnum.GLU_TESS_END, () => {
+                if (currentContour.length > 0) {
+                    contourIndices.push([...currentContour]);
+                }
+            });
+        }
+        tess.gluTessCallback(libtess_minExports.gluEnum.GLU_TESS_COMBINE, (coords) => {
+            const idx = vertices.length / 2;
+            vertices.push(coords[0], coords[1]);
+            return idx;
         });
-        return result?.vertices && result?.elements ? result : null;
+        tess.gluTessCallback(libtess_minExports.gluEnum.GLU_TESS_ERROR, (errno) => {
+            debugLogger.warn(`libtess error: ${errno}`);
+        });
+        tess.gluTessNormal(0, 0, 1);
+        tess.gluTessBeginPolygon(null);
+        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.gluTessEndContour();
+        }
+        tess.gluTessEndPolygon();
+        if (vertices.length === 0) {
+            return null;
+        }
+        if (mode === 'triangles') {
+            return { vertices, indices };
+        }
+        else {
+            return { vertices, contourIndices };
+        }
     }
     boundaryToContours(boundaryResult) {
+        if (!boundaryResult.contourIndices) {
+            return [];
+        }
         const contours = [];
-        // Elements format: [start_index, vertex_count, start_index, vertex_count, ...]
-        for (let i = 0; i < boundaryResult.elements.length; i += 2) {
-            const start = boundaryResult.elements[i];
-            const count = boundaryResult.elements[i + 1];
+        for (const indices of boundaryResult.contourIndices) {
             const contour = [];
-            for (let j = 0; j < count; j++) {
-                const idx = (start + j) * 2;
-                contour.push(boundaryResult.vertices[idx], boundaryResult.vertices[idx + 1]);
+            for (const idx of indices) {
+                const vertIdx = idx * 2;
+                contour.push(boundaryResult.vertices[vertIdx], boundaryResult.vertices[vertIdx + 1]);
             }
             // Ensure contour is closed for side wall generation
             if (contour.length > 2) {
@@ -5483,15 +3564,16 @@ class TextShaper {
                 naturalSpaceWidth = TextMeasurer.measureTextWidth(this.loadedFont, ' ', letterSpacing);
                 this.cachedSpaceWidth.set(letterSpacing, naturalSpaceWidth);
             }
+            const width = naturalSpaceWidth;
             const stretchFactor = SPACE_STRETCH_RATIO;
             const shrinkFactor = SPACE_SHRINK_RATIO;
             if (lineInfo.adjustmentRatio > 0) {
                 spaceAdjustment =
-                    lineInfo.adjustmentRatio * naturalSpaceWidth * stretchFactor;
+                    lineInfo.adjustmentRatio * width * stretchFactor;
             }
             else if (lineInfo.adjustmentRatio < 0) {
                 spaceAdjustment =
-                    lineInfo.adjustmentRatio * naturalSpaceWidth * shrinkFactor;
+                    lineInfo.adjustmentRatio * width * shrinkFactor;
             }
         }
         return spaceAdjustment;
@@ -5660,35 +3742,6 @@ class GlyphCache {
 }
 const globalGlyphCache = new GlyphCache(DEFAULT_CACHE_SIZE_MB);
 
-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 = {}; const readFileSync = () => { throw new Error('fs not available in browser'); };