flo-mat 2.0.5 → 3.0.1

package/node/point-on-shape.js

@@ -1,168 +0,0 @@
-import { dot, fromTo, toUnitVector, rotateNeg90Degrees } from 'flo-vector2d';
-import { memoize } from 'flo-memoize';
-import { curvature, evalDeCasteljau, tangent } from 'flo-bezier3';
-import { getCornerAtEnd } from './curve.js';
-/**
- * Represents a point on the shape boundary for which MAT vertex information
- * has not *necessarily* been calculated.
- */
-class PointOnShape {
-    /**
-     * @param curve	The [[ICurve]] on the shape boundary this points belong to.
-     * @param t The bezier parameter value on the curve to identify the point
-     * coordinates.
-     */
-    constructor(curve, t) {
-        this.curve = curve;
-        this.t = t;
-        // Cache
-        this.p_ = undefined;
-    }
-    /**
-     * The planar point coordinates of this [[PointOnShape]].
-     */
-    get p() {
-        return this.p_ === undefined
-            ? this.p_ = evalDeCasteljau(this.curve.ps, this.t)
-            : this.p_;
-    }
-}
-/**
- * @hidden
- */
-function isPosCorner(pos) {
-    return (pos.t === 0 || pos.t === 1);
-}
-/**
- * @hidden
- */
-function getPosCorner(pos) {
-    return getCornerAtEnd(pos.t === 1 ? pos.curve : pos.curve.prev);
-}
-/**
- * @hidden
- */
-const isPosSharpCorner = memoize((pos) => {
-    if (!isPosCorner(pos)) {
-        return false;
-    }
-    return getPosCorner(pos).isSharp;
-});
-/**
- * @hidden
- */
-const isPosDullCorner = memoize((pos) => {
-    if (!isPosCorner(pos)) {
-        return false;
-    }
-    return getPosCorner(pos).isDull;
-});
-/**
- * @hidden
- */
-const isPosQuiteSharpCorner = memoize((pos) => {
-    if (!isPosCorner(pos)) {
-        return false;
-    }
-    return getPosCorner(pos).isQuiteSharp;
-});
-/**
- * @hidden
- */
-const isPosQuiteDullCorner = memoize((pos) => {
-    if (!isPosCorner(pos)) {
-        return false;
-    }
-    return getPosCorner(pos).isQuiteDull;
-});
-/**
- * Returns a human-readable string of the given [[PointOnShape]].
- * For debugging only.
- * @hidden
- */
-function posToHumanString(pos) {
-    return '' + pos.p[0] + ', ' + pos.p[1] +
-        ' | bz: ' + pos.curve.idx +
-        ' | t: ' + pos.t;
-}
-/**
- * @hidden
- * Calculates the order (to distinguish between points lying on top of each
- * other) of the contact point if it is a dull corner.
- * @param pos
- */
-function calcPosOrder(circle, pos) {
-    if (!isPosCorner(pos)) {
-        return 0;
-    }
-    if (!isPosDullCorner(pos)) {
-        return 0;
-    }
-    //if (!isPosDullCorner(pos)) { return 0; }
-    const corner = getPosCorner(pos);
-    const n = rotateNeg90Degrees(corner.tangents[0]);
-    const v = toUnitVector(fromTo(pos.p, circle.center));
-    return -dot(n, v);
-}
-/**
- * Compares two [[PointOnShape]]s according to their cyclic ordering imposed
- * by their relative positions on the shape boundary.
- * @param a The first [[PointOnShape]].
- * @param b The second [[PointOnShape]].
- * @hidden
- */
-function comparePoss(a, b) {
-    if (a === undefined || b === undefined) {
-        return undefined;
-    }
-    let res;
-    res = a.curve.idx - b.curve.idx;
-    if (res !== 0) {
-        return res;
-    }
-    res = a.t - b.t;
-    return res;
-}
-/**
- * Calculates and returns the osculating circle radius of the bezier at a
- * specific t. If it is found to have negative or nearly zero radius
- * it is clipped to have positive radius so it can point into the shape.
- * @param ps
- * @param t
- * @hidden
- */
-const calcOsculatingCircleRadius = memoize((pos) => {
-    const ps = pos.curve.ps;
-    const t = pos.t;
-    const c = -curvature(ps, t);
-    // c > 0 => bending inwards
-    return 1 / c;
-});
-/**
- * Returns the osculating circle at this point of the curve.
- * @param maxOsculatingCircleRadius If not Number.POSITIVE_INFINITY then the
- * circle radius will be limited to this value.
- * @param pos The [[PointOnShape]] identifying the point.
- */
-function getOsculatingCircle(maxOsculatingCircleRadius, pos) {
-    if (isPosSharpCorner(pos)) {
-        return { center: pos.p, radius: 0 };
-    }
-    let radius = calcOsculatingCircleRadius(pos);
-    if (radius < 0) {
-        radius = Number.POSITIVE_INFINITY;
-    }
-    radius = Math.min(radius, maxOsculatingCircleRadius);
-    const ps = pos.curve.ps;
-    const t = pos.t;
-    const tangent_ = tangent(ps, t);
-    const normal_ = toUnitVector([-tangent_[1], tangent_[0]]);
-    const p = evalDeCasteljau(ps, t);
-    const circleCenter = [
-        p[0] - normal_[0] * radius,
-        p[1] - normal_[1] * radius
-    ];
-    return { center: circleCenter, radius };
-}
-export { PointOnShape, getOsculatingCircle, comparePoss, calcPosOrder, posToHumanString, isPosSharpCorner, isPosDullCorner, isPosQuiteSharpCorner, isPosQuiteDullCorner };
-//# sourceMappingURL=point-on-shape.js.map

package/node/point-on-shape.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"point-on-shape.js","sourceRoot":"","sources":["../src/point-on-shape.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,GAAG,EAAE,MAAM,EAAE,YAAY,EAAE,kBAAkB,EAAE,MAAM,cAAc,CAAC;AAC7E,OAAO,EAAE,OAAO,EAAE,MAAM,aAAa,CAAC;AACtC,OAAO,EAAE,SAAS,EAAE,eAAe,EAAE,OAAO,EAAE,MAAQ,aAAa,CAAC;AACpE,OAAO,EAAS,cAAc,EAAE,MAAM,YAAY,CAAC;AAcnD;;;GAGG;AACH,MAAM,YAAY;IAEd;;;;OAIG;IACH,YACwB,KAAY,EACZ,CAAS;QADT,UAAK,GAAL,KAAK,CAAO;QACZ,MAAC,GAAD,CAAC,CAAQ;QAIjC,QAAQ;QACA,OAAE,GAAc,SAAS,CAAC;IAJlC,CAAC;IAKD;;OAEG;IACH,IAAI,CAAC;QACD,OAAO,IAAI,CAAC,EAAE,KAAK,SAAS;YACxB,CAAC,CAAC,IAAI,CAAC,EAAE,GAAG,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC,CAAC;YAClD,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;IAClB,CAAC;CACJ;AAGD;;GAEG;AACH,SAAS,WAAW,CAAC,GAAkB;IACnC,OAAO,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;AACxC,CAAC;AAGD;;GAEG;AACH,SAAS,YAAY,CAAC,GAAkB;IACpC,OAAO,cAAc,CACjB,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAC3C,CAAC;AACN,CAAC;AAGD;;GAEG;AACH,MAAM,gBAAgB,GAAG,OAAO,CAAC,CAAC,GAAkB,EAAE,EAAE;IACpD,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE;QAAE,OAAO,KAAK,CAAC;KAAE;IAExC,OAAO,YAAY,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC;AACrC,CAAC,CAAC,CAAC;AAGH;;GAEG;AACH,MAAM,eAAe,GAAG,OAAO,CAAC,CAAC,GAAkB,EAAE,EAAE;IACnD,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE;QAAE,OAAO,KAAK,CAAC;KAAE;IAExC,OAAO,YAAY,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;AACpC,CAAC,CAAC,CAAC;AAGH;;GAEG;AACH,MAAM,qBAAqB,GAAG,OAAO,CAAC,CAAC,GAAkB,EAAE,EAAE;IACzD,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE;QAAE,OAAO,KAAK,CAAC;KAAE;IAExC,OAAO,YAAY,CAAC,GAAG,CAAC,CAAC,YAAY,CAAC;AAC1C,CAAC,CAAC,CAAC;AAGH;;GAEG;AACH,MAAM,oBAAoB,GAAG,OAAO,CAAC,CAAC,GAAkB,EAAE,EAAE;IACxD,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE;QAAE,OAAO,KAAK,CAAC;KAAE;IAExC,OAAO,YAAY,CAAC,GAAG,CAAC,CAAC,WAAW,CAAC;AACzC,CAAC,CAAC,CAAC;AAGH;;;;GAIG;AACH,SAAS,gBAAgB,CAAC,GAAkB;IACxC,OAAO,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAClC,SAAS,GAAK,GAAG,CAAC,KAAK,CAAC,GAAG;QAC3B,QAAQ,GAAM,GAAG,CAAC,CAAC,CAAA;AAC3B,CAAC;AAGD;;;;;GAKG;AACH,SAAS,YAAY,CACb,MAAe,EACf,GAAsB;IAE1B,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE;QAAE,OAAO,CAAC,CAAC;KAAE;IACpC,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,EAAE;QAAE,OAAO,CAAC,CAAC;KAAE;IACxC,0CAA0C;IAE1C,MAAM,MAAM,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC;IAEjC,MAAM,CAAC,GAAG,kBAAkB,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;IACjD,MAAM,CAAC,GAAG,YAAY,CAAE,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,CAAE,CAAC;IAEvD,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACtB,CAAC;AAGD;;;;;;GAMG;AACH,SAAS,WAAW,CAAC,CAAgB,EAAE,CAAgB;IACnD,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,SAAS,EAAE;QACpC,OAAO,SAAS,CAAC;KACpB;IAED,IAAI,GAAG,CAAC;IAER,GAAG,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC;IAChC,IAAI,GAAG,KAAK,CAAC,EAAE;QAAE,OAAO,GAAG,CAAC;KAAE;IAE9B,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAEhB,OAAO,GAAG,CAAC;AACf,CAAC;AAGD;;;;;;;GAOG;AACH,MAAM,0BAA0B,GAAG,OAAO,CAAC,CAAC,GAAkB,EAAE,EAAE;IAC9D,MAAM,EAAE,GAAG,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;IACxB,MAAM,CAAC,GAAI,GAAG,CAAC,CAAC,CAAC;IAEjB,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAE5B,2BAA2B;IAE3B,OAAO,CAAC,GAAC,CAAC,CAAC;AACf,CAAC,CAAC,CAAC;AAGH;;;;;GAKG;AACH,SAAS,mBAAmB,CACpB,yBAAiC,EACjC,GAAkB;IAEtB,IAAI,gBAAgB,CAAC,GAAG,CAAC,EAAE;QACvB,OAAO,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;KACvC;IAED,IAAI,MAAM,GAAG,0BAA0B,CAAC,GAAG,CAAC,CAAC;IAE7C,IAAI,MAAM,GAAG,CAAC,EAAE;QAAE,MAAM,GAAG,MAAM,CAAC,iBAAiB,CAAC;KAAE;IACtD,MAAM,GAAG,IAAI,CAAC,GAAG,CACb,MAAM,EACN,yBAAyB,CAC5B,CAAC;IAEF,MAAM,EAAE,GAAG,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;IACxB,MAAM,CAAC,GAAI,GAAG,CAAC,CAAC,CAAC;IAEjB,MAAM,QAAQ,GAAG,OAAO,CAAC,EAAE,EAAC,CAAC,CAAC,CAAC;IAC/B,MAAM,OAAO,GAAG,YAAY,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzD,MAAM,CAAC,GAAG,eAAe,CAAC,EAAE,EAAC,CAAC,CAAC,CAAC;IAChC,MAAM,YAAY,GAAG;QACjB,CAAC,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,GAAC,MAAM;QACxB,CAAC,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,GAAC,MAAM;KAC3B,CAAC;IAEF,OAAO,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,EAAE,CAAC;AAC5C,CAAC;AAGD,OAAO,EAEH,YAAY,EACZ,mBAAmB,EACnB,WAAW,EACX,YAAY,EACZ,gBAAgB,EAChB,gBAAgB,EAChB,eAAe,EACf,qBAAqB,EACrB,oBAAoB,EACvB,CAAA"}

package/node/simplify-mat.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"simplify-mat.js","sourceRoot":"","sources":["../src/simplify-mat.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,iBAAiB,EAAE,MAAM,aAAa,CAAC;AAChD,OAAO,EAAE,MAAM,EAAE,MAAM,cAAc,CAAC;AACtC,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AAChD,OAAO,EAAE,cAAc,EAAE,MAAM,wBAAwB,CAAC;AACxD,OAAO,EAAE,eAAe,EAAE,MAAM,kCAAkC,CAAC;AAInE;;;;;;;;;;;;GAYG;AACH,SAAS,WAAW,CACZ,GAAQ,EACR,cAAc,GAAG,EAAE,EACnB,kBAAkB,GAAG,CAAC,IAAE,CAAC,CAAC,EAC1B,aAAa,GAAG,EAAE;IAEtB,IAAI,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC;IAExB,oBAAoB;IACpB,OAAO,CAAC,MAAM,CAAC,aAAa,EAAE,EAAE;QAAE,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC;KAAE;IAEzD,MAAM,QAAQ,GAAG,WAAW,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC;IAErD,MAAM,UAAU,GAAa,EAAE,CAAC;IAChC,KAAK,IAAI,CAAC,GAAC,CAAC,EAAE,CAAC,GAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QAClC,MAAM,MAAM,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QAE3B,qBAAqB;QACrB,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,OAAO,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE;YACtB,MAAM,CAAC,GAAG,CAAC,CAAC;YACZ,OAAO,IAAI,EAAE;gBACT,CAAC,EAAE,CAAC;gBAEJ,IAAI,CAAC,KAAK,MAAM,CAAC,MAAM,EAAE;oBAAE,MAAM;iBAAE;gBAEnC,MAAM,EAAE,GAAG,yBAAyB,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,aAAa,CAAC,CAAC;gBAElE,IAAI,EAAE,GAAG,kBAAkB,EAAE;oBACzB,MAAM;iBACT;qBAAM;oBACH,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;iBAC9B;aACJ;YAED,IAAI,CAAC,GAAC,CAAC,KAAK,CAAC,EAAE;gBACX,4BAA4B;gBAC5B,MAAM;aACT;SACJ;KACJ;IAED,KAAK,MAAM,MAAM,IAAI,UAAU,EAAE;QAC7B,MAAM,aAAa,GAAG,MAAM,CAAC,aAAa,EAAE,CAAC;QAC7C,MAAM,aAAa,GAAG,MAAM,CAAC,kBAAkB,EAAE,CAAC,MAAM,CAAC;QACzD,IAAI,aAAa,IAAI,aAAa,KAAK,CAAC,EAAE;YACtC,SAAS;SACZ;QAED,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;KACzB;IAED,uDAAuD;IACvD,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,CAAC;AAC1C,CAAC;AAGD,SAAS,yBAAyB,CAC1B,CAAS,EACT,CAAS,EACT,MAAgB,EAChB,gBAAwB;IAE5B,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,MAAM,SAAS,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IAC7D,OAAO,CAAC,GAAC,CAAC,GAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACf,GAAG,CAAC,IAAI,CAAC,iBAAiB,CACtB,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EACzB,SAAS,EACT,gBAAgB,CACnB,CAAC,CAAC;KACN;IAED,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;AAC5B,CAAC;AAGD,OAAO,EAAE,WAAW,EAAE,CAAA"}

package/node/to-scale-axis.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"to-scale-axis.js","sourceRoot":"","sources":["../src/to-scale-axis.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AAKrC,OAAO,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC;AACpD,OAAO,EAAE,gBAAgB,EAAE,MAAM,wBAAwB,CAAC;AAC1D,OAAO,EAAE,gBAAgB,EAAE,MAAM,6BAA6B,CAAC;AAE/D,OAAO,EAAE,SAAS,EAAE,MAAM,qBAAqB,CAAC;AAChD,OAAO,EAAE,IAAI,EAAE,MAAM,6BAA6B,CAAC;AACnD,OAAO,EAAE,YAAY,EAAE,MAAM,uCAAuC,CAAC;AACrE,OAAO,EAAE,KAAK,EAAE,MAAM,oBAAoB,CAAC;AAC3C,OAAO,EAAE,cAAc,EAAE,MAAM,wBAAwB,CAAC;AAGxD,SAAS,WAAW,CAAC,CAAS;IAC7B,OAAO,UAAS,CAAS;QACxB,OAAO,CAAC,GAAC,CAAC,CAAC;IACZ,CAAC,CAAA;AACF,CAAC;AAGD,cAAc;AACd,0BAA0B;AAG1B;;;;;;;;;;;GAWG;AACH,SAAS,WAAW,CAClB,GAAQ,EACR,CAAS,EACT,IAA0C,WAAW;IAEtD,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,IAAI,OAAO,OAAO,KAAK,WAAW,EAAE;QACnC,WAAW,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC;QAChC,MAAM,MAAM,GAAG,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACrC,OAAO,CAAC,SAAS,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;KAC5C;IAED,6DAA6D;IAC7D,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,gBAAgB,CACf,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,EACjB,MAAM,CAAC,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CACnC,CAAC;IAEF,MAAM,MAAM,GAAG,gBAAgB,CAAC,OAAO,CAAC,CAAC;IACzC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAEhB,IAAI,OAAO,OAAO,KAAK,WAAW,EAAE;QACnC,OAAO,CAAC,SAAS,CAAC,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;KAC/C;IAED;;;OAGG;IACH,MAAM,KAAK,GAAgB,IAAI,GAAG,EAAE,CAAC;IAErC,MAAM,IAAI,GAAuB,IAAI,GAAG,EAAE,CAAC;IAE3C,aAAa,CAAC,MAAM,EAAE,UAAS,MAAM;QACpC,qDAAqD;QACrD,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QAE1D,MAAM,OAAO,GAAG,MAAM,CAAC,IAAI,CAAC;QAE5B,MAAM,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,EAAC,CAAC,CAAC,EAAE,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC;QAEhD,MAAM,CAAC,GAAG,OAAO,CAAC,EAAE,CAAC,MAAM,CAAC,MAAM,CAAC;QACnC,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;QACjB,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE;YACf,KAAK,MAAM,MAAM,IAAI,OAAO,CAAC,kBAAkB,EAAE,EAAE;gBAClD,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,0BAA0B;aACnD;YACD,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC;SAC7B;IACF,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IAEpB,IAAI,OAAO,OAAO,KAAK,WAAW,EAAE;QACnC,OAAO,CAAC,SAAS,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;KACtD;IAED,uDAAuD;IACvD,gEAAgE;IAChE,MAAM,GAAG,GAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,CAAC;IAEhD,YAAY,CAAC,GAAG,EAAE,WAAW,CAAC,CAAC;IAE/B,OAAO,GAAG,CAAC;AACZ,CAAC;AAGD,OAAO,EAAE,WAAW,EAAE,CAAA"}

package/node/traverse-edges.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"traverse-edges.js","sourceRoot":"","sources":["../src/traverse-edges.ts"],"names":[],"mappings":"AAGA;;;;;;IAMI;AACJ,SAAS,aAAa,CACpB,MAAc,EACd,CAA2B;IAE5B,wEAAwE;IACxE,gBAAgB;IAChB,MAAM,GAAG,GAAG,MAAM,CAAC,kBAAkB,EAAE,CAAC;IAExC,OAAO,GAAG,CAAC,MAAM,EAAE;QAClB,MAAM,EAAE,GAAG,GAAG,CAAC,GAAG,EAAE,CAAC;QACrB,CAAC,CAAC,EAAE,CAAC,CAAC;QAEN,IAAI,EAAE,CAAC,aAAa,EAAE,EAAE;YAAE,SAAS;SAAE;QACrC,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,WAAW,EAAE,CAAC,CAAC;KAC9B;AACF,CAAC;AAGD,OAAO,EAAE,aAAa,EAAE,CAAA"}

package/node/traverse-vertices.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"traverse-vertices.js","sourceRoot":"","sources":["../src/traverse-vertices.ts"],"names":[],"mappings":"AAGA;;;;;;;;GAQG;AACH,SAAS,gBAAgB,CACvB,MAAc,EACd,CAA2B;IAE5B,CAAC,CAAC,MAAM,CAAC,CAAC;IAEV,wEAAwE;IACxE,iBAAiB;IACjB,MAAM,CAAC,kBAAkB,EAAE;SACzB,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC,aAAa,EAAE,CAAC;SACzC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC;SAC1B,OAAO,CAAC,EAAE,CAAC,CAAC;IAEd,SAAS,EAAE,CAAC,MAAc;QACzB,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC;QACrB,OAAO,GAAG,CAAC,MAAM,EAAE;YAClB,MAAM,EAAE,GAAG,GAAG,CAAC,GAAG,EAAE,CAAC;YACrB,CAAC,CAAC,EAAE,CAAC,CAAC;YACN,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,cAAc,CAAC,CAAC;SAC/B;IACF,CAAC;AACF,CAAC;AAGD,OAAO,EAAE,gBAAgB,EAAE,CAAA"}

package/src/cp-node.ts

@@ -1,388 +0,0 @@
-/** @internal */
-declare const _debug_: Debug; 
-
-import { LlRbTree } from 'flo-ll-rb-tree';
-import { Debug } from './debug/debug.js';
-import { ContactPoint, compareCps } from './contact-point.js';
-import { removeCpNode } from './cp-node/remove.js';
-import { getCurveToNext } from './get-curve-to-next.js';
-
-
-/**
- * The primary class of the library.
- * 
- * Since the MAT is a full representation of the shape boundary an instance of
- * this class contains both the information of a boundary point and a medial 
- * axis point (and edge to the next point(s)). It also contains edges to other 
- * [[CpNode]]s which allows for traversal of the MAT and thus implictly 
- * represents the entire MAT.
- * 
- * To get the maximal disk circle (of which the center is on the medial axis)
- * use [[cp]].circle.
- * 
- * To get the boundary point, use [[cp]].pointOnShape.
- * 
- * The edge [[next]] (resp. [[prev]]) allows one to move anti-clockwise (resp.
- * clockwise) on the shape boundary to the next [[CpNode]]. This also imposes a 
- * direction of traversal of the MAT edges and vertices. 
- * 
- * The edge [[nextOnCircle]] (resp. [[prevOnCircle]]) allows one to go 
- * anti-clockwise (resp. clockwise) around the maximal disks implied by
- * the CpNode to the next maximal disk contact point. This is equivalent to 
- * following other branches on the MAT.
- * 
- * Call [[getCurveBetween]](cpNodeFrom, cpNodeTo) or getCurveToNext(cpNode) 
- * (replacing the older CpNode.[[matCurveToNextVertex]]) to get a bezier curve 
- * from the maximal disk of this [[CpNode]] to the next [[CpNode]]'s 
- * maximal disk and thus directly representing a piece of the medial axis.
- * 
- * The function, [[getChildren]], returns the children of this [[CpNode]] when
- * seen as a MAT edge. Only children in a 'forward' direction are returned. These
- * include all edges except the 'backward' edge given by [[prevOnCircle]]. For
- * [[CpNode]]s having a maximal disk with 2 contact points (a 2-prong, the usual 
- * case) the children will be the single edge [[next]]. For a 3-prong this will
- * be the edges [[next]] and [[nextOnCircle]], etc. [[getChildren]] allows one to
- * easily traverse the MAT tree - see e.g. the implementation of [[traverseEdges]].
- * 
- * The getter, [[vertexChildren]], is similar to [[getChildren]] but returns the 
- * child nodes of the tree when [[CpNode]] is seen as a MAT vertex point (as 
- * opposed to edge). In this way the dual graph of the tree can easily be 
- * traversed - see e.g. [[traverseVertices]]. Generally, however, traversing the 
- * edges is preferred as it returns the entire Medial Axis (by utilizing 
- * [[getCurveToNext]] on each returned edge).
- * 
- * It may be worth mentioning that by traversing from the CpNode by following
- * [[next]] repeatedly until one is back at the same CpNode allows one
- * to 'go around' the shape boundary and at the same time traverse the MAT twice 
- * in opposite directions.
- */
-class CpNode {
-
-	/**
-	 * Primarily for internal use.
-	 * @param cp The shape boundary contact point, i.e. a [[CpNode]] without its
-	 * edges.
-	 * @param isHoleClosing If true, this [[CpNode]] belongs to a hole-closing
-	 * maximal disk.
-	 * @param isIntersection true if this cpNode is at a shape boundary 
-	 * intersection point, false otherwise
-	 * @param prev The previous (going clockwise around the boundary) contact 
-	 * point ([[CpNode]]).
-	 * @param next The next (going anti-clockwise around the boundary) contact 
-	 * point ([[CpNode]]).
-	 * @param prevOnCircle The previous [[CpNode]] (going clockwise around 
-	 * the inscribed circle defined by the maximal disk).
-	 * @param nextOnCircle The next [[CpNode]] (going anti-clockwise around 
-	 * the inscribed circle defined by the maximal disk).
-	 */
-    constructor(
-			public readonly cp    : ContactPoint,
-			public isHoleClosing  : boolean,
-			public isIntersection : boolean,
-			public prev           : CpNode = undefined,
-			public next           : CpNode = undefined,
-			public prevOnCircle   : CpNode = undefined,
-			public nextOnCircle   : CpNode = undefined) {
-	}
-
-
-	/**
-	 * Returns the bezier curve from the maximal disk of this [[CpNode]] to the 
-	 * next [[CpNode]]'s maximal disk and thus directly represents a piece of the 
-	 * medial axis.
-	 * @deprecated Use [[getCurveToNext]] instead
-	 * @param cpNode 
-	 */
-	get matCurveToNextVertex() {
-		return getCurveToNext(this);
-	}
-
-
-	/**
-	 * Primarily for internal use.
-	 * 
-	 * Compares the order of two [[CpNode]]s. The order is cyclic and depends
-	 * on a [[CpNode]]'s relative position along the shape boundary.
-	 */
-	static comparator = 
-		(a: CpNode, b: CpNode) => compareCps(a.cp, b.cp);
-
-
-	/**
-	 * Returns the children of this [[CpNode]] when seen as a MAT edge. Only 
-	 * children in a 'forward' direction are returned. These include all edges 
-	 * except the 'backward' edge given by [[prevOnCircle]], even terminating
-	 * edges.
-	 */
-	getChildren() {
-		const children: CpNode[] = [];
-
-		const cp = this.next;
-		let cp_ = cp;
-		do {
-			children.push(cp_); 
-			cp_ = cp_.nextOnCircle;
-		} while (cp_.nextOnCircle !== cp);
-
-		return children;
-	}
-
-	static remove = removeCpNode;
-
-
-	/**
-	 * Similar to [[getChildren]] but returns the child nodes of the tree when 
-	 * [[CpNode]] is seen as a MAT vertex point (as opposed to edge). In this 
-	 * way the dual graph of the tree can easily be traversed - see e.g. 
-	 * [[traverseVertices]]. Generally, however, traversing the edges is 
-	 * preferred as it returns the entire Medial Axis (by utilizing 
-	 * [[getCurveToNext]] on each returned edge).
-	 */
-	get vertexChildren() {
-		if (this.isTerminating()) { return []; }
-
-		const cp: CpNode = this;
-		const children: CpNode[] = [];
-
-		let cp_ = cp;
-		while (cp_ !== cp.prevOnCircle) {
-			if (!cp_.isTerminating()) { children.push(cp_.next); }
-			cp_ = cp_.nextOnCircle;
-		}
-
-		return children;
-	}
-
-
-	/**
-	 * Returns all [[CpNode]]s on the MAT that this [[CpNode]] is part of 
-	 * starting from the current one and going anti-clockwise around the shape.
-	 */
-	public getAllOnLoop() {
-		const cpStart: CpNode = this;
-		const cps: CpNode[] = [cpStart];
-		let cp: CpNode = this.next;
-
-		while (cp !== cpStart) {
-			cps.push(cp);
-			cp = cp.next;
-		}
-
-		return cps;
-	}
-
-
-	/**
-	 * Primarily for internal use.
-	 * 
-	 * Insert a [[CpNode]] into the MAT tree graph after the specified point 
-	 * and returns the freshly inserted [[CpNode]].
-	 * @param isHoleClosing True if this is a hole closing contact point.
-	 * @param isIntersection True if this is a contact point at a shape boundary
-	 * intersection point.
-	 * @param cpTree The tree graph holding the [[CpNodes]] of the MAT.
-	 * @param cp [[ContactPoint]] defining the [[CpNode]].
-	 * @param prev_ Inserts the new [[CpNode]] right after this item if the 
-	 * loop is not empty, else insert the new [[CpNode]] as the only item in the 
-	 * loop. 
-	 */
-	public static insert(
-			isHoleClosing: boolean,
-			isIntersection: boolean,
-			cpTree: LlRbTree<CpNode>, 
-			cp: ContactPoint, 
-			prev_: CpNode) {
-	
-		const cpNode = new CpNode(cp, isHoleClosing, isIntersection);
-		if (typeof _debug_ !== 'undefined') {
-			_debug_.generated.elems.cpNode.push({
-				generated: _debug_.generated,
-				cpNode
-			});
-		}
-		
-		let prev;
-		let next;
-		
-		if (!prev_) {
-			prev = cpNode;
-			next = cpNode;
-		} else {
-			prev = prev_;
-			next = prev.next;
-		}
-	
-		next.prev = cpNode;
-		prev.next = cpNode;
-
-		cpNode.prev = prev;
-		cpNode.next = next;
-			
-		cpTree.insert(cpNode);
-		
-		return cpNode;
-	}
-
-
-	/**
-	 * Return this (except if exclThis is truthy) and the the other CpNodes 
-	 * around the maximal disk vertex circle in an anti-clockwise order.
-	 * @param exclThis If true the returned array does not include this 
-	 * [[CpNode]].
-	 */
-	public getCpNodesOnCircle(exclThis = false) {
-		const startCp = this as CpNode;
-		let cp = startCp;
-		
-		const cps: CpNode[] = [];
-		do {
-			if (exclThis) {
-				exclThis = false;
-			} else {
-				cps.push(cp);
-			}
-			cp = cp.nextOnCircle;
-		} while (cp !== startCp)
-
-		return cps;
-	}
-
-
-	/**
-	 * Returns true if the 2 given [[CpNode]]s are on the same maximal disk 
-	 * circle.
-	 * @param cpNode1 A [[CpNode]].
-	 * @param cpNode2 Another [[CpNode]]
-	 */
-	static isOnSameCircle(cpNode1: CpNode, cpNode2: CpNode) {
-		const cpNodes = cpNode1.getCpNodesOnCircle(true);
-
-		return cpNodes.indexOf(cpNode2) >= 0;
-	}
-
-
-	/**
-	 * Returns true if this [[CpNode]] is terminating, i.e. implies a leaf MAT 
-	 * vertex.
-	 * 
-	 * This is always the case for sharp corners and maximal disks with
-	 * a single contact point. Note, however, that even in these cases there are
-	 * two contact points stored (sitting 'on top' of each other) for the 
-	 * maximal disk. It can be seen as a limiting case of a two-prong where the
-	 * distance between two of the contact points tend to zero. One point 
-	 * (represented by a [[CpNode]] of course) will be terminating with the 
-	 * other point being its [[next]], whereas the other point will *not* be 
-	 * terminating and 'points' back into the shape.
-	 */
-	public isTerminating() {
-		return this === this.next.prevOnCircle;
-	}
-
-
-	/**
-	 * Like isTerminating() but only returns true if all cpNodes on the circle
-	 * (except this.prevOnCircle) is terminating.
-	 */
-	public isFullyTerminating() {
-		const otherOnCircle = this.prevOnCircle.getCpNodesOnCircle(true);
-		const isFullyTerminating = otherOnCircle.every(cpNode => cpNode.isTerminating());
-
-		return isFullyTerminating;
-	}
-
-
-	/**
-	 * Returns the first [[CpNode]] (from this one by successively applying 
-	 * .nextOnCircle) that exits the circle.
-	 */
-	public getFirstExit() {
-		const startNode = this as CpNode;
-		let cpNode = startNode;
-
-		while (cpNode.next === cpNode.prevOnCircle) {
-			cpNode = cpNode.next;
-
-			if (cpNode === startNode) {
-				// The very special case the MAT is a single point.
-				return undefined; 
-			}
-		}
-
-		return cpNode;
-	}
-
-
-	/**
-	 * Returns true if this [[CpNode]] represents a sharp corner, i.e. the 
-	 * limiting case of a two-prong having zero radius. 
-	 * 
-	 * Note that two [[CpNode]]s are stored for each sharp corner, one being
-	 * terminating and one not. See [[isTerminating]] for more details.
-	 */
-	public isSharp() {
-		return this.cp.circle.radius === 0;
-	}
-
-
-	/**
-	 * Returns true if this [[CpNode]]'s maximal disk has only one contact point
-	 * on the shape boundary (up to planar coordinates). These includes sharp 
-	 * corners.
-	 * 
-	 * Note, however, that two [[CpNode]]s are stored for each such point to
-	 * preserve symmetry - see [[isTerminating]] for more details.
-	 */
-	public isOneProng() {
-		const cp1 = this;
-
-		if (cp1.cp.circle.radius === 0) {
-			return true;
-		}
-
-		const cp2 = cp1.nextOnCircle;
-
-		const p1 = cp1.cp.pointOnShape.p;
-		const p2 = cp2.cp.pointOnShape.p;
-
-		return (p1[0] === p2[0] && p1[1] === p2[1]);
-	}
-
-
-	/**
-	 * Returns the number of contact points on the maximal disk circle implied
-	 * by this [[CpNode]]. 
-	 * 
-	 * Note, however, that even one-prongs and sharp corners will return 2 (see
-	 * [[isTerminating]] for more details); if this is not desired use 
-	 * [[getRealProngCount]] instead which will return 1 in these cases.
-	 */
-	public getProngCount() {
-		const startCp = this as CpNode;
-		let cp = startCp;
-
-		let i = 0;
-
-		do {
-			i++;
-			cp = cp.nextOnCircle;
-		} while (cp !== startCp)
-
-		return i;
-	}
-
-
-	/**
-	 * Returns the number of contact points (up to planar coordinates) on the 
-	 * maximal disk circle implied by this [[CpNode]]. 
-	 * 
-	 * See also [[getProngCount]].
-	 */
-	public getRealProngCount() {
-		if (this.isOneProng()) { return 1; }
-
-		return this.getProngCount();
-	}
-}
-
-
-export { CpNode }