svg-path-simplify 0.0.7 → 0.0.9

package/dist/svg-path-simplify.esm.js

@@ -1,3 +1,42 @@
+function renderPoint(
+    svg,
+    coords,
+    fill = "red",
+    r = "1%",
+    opacity = "1",
+    title = '',
+    render = true,
+    id = "",
+    className = ""
+) {
+    if (Array.isArray(coords)) {
+        coords = {
+            x: coords[0],
+            y: coords[1]
+        };
+    }
+    let marker = `<circle class="${className}" opacity="${opacity}" id="${id}" cx="${coords.x}" cy="${coords.y}" r="${r}" fill="${fill}">
+  <title>${title}</title></circle>`;
+
+    if (render) {
+        svg.insertAdjacentHTML("beforeend", marker);
+    } else {
+        return marker;
+    }
+}
+
+function renderPath(svg, d = '', stroke = 'green', strokeWidth = '1%', render = true) {
+
+    let path = `<path d="${d}" fill="none" stroke="${stroke}"  stroke-width="${strokeWidth}" /> `;
+
+    if (render) {
+        svg.insertAdjacentHTML("beforeend", path);
+    } else {
+        return path;
+    }
+
+}
+
 function detectInputType(input) {
     let type = 'string';
     /*
@@ -8,23 +47,29 @@ function detectInputType(input) {
     if (input instanceof ArrayBuffer) return "buffer";
     if (input instanceof Blob) return "blob";
     */
-    if (Array.isArray(input)) return "array";
+    if (Array.isArray(input)) {
+        if (input[0]?.type && input[0]?.values 
+        ) {
+            return "pathData";
+        }
+
+        return "array";
+    }
 
     if (typeof input === "string") {
         input = input.trim();
         let isSVG = input.includes('<svg') && input.includes('</svg');
         let isPathData = input.startsWith('M') || input.startsWith('m');
-        let isPolyString = !isNaN(input.substring(0, 1)) && !isNaN(input.substring(input.length-1, input.length));
+        let isPolyString = !isNaN(input.substring(0, 1)) && !isNaN(input.substring(input.length - 1, input.length));
 
-        
-        if(isSVG) {
-            type='svgMarkup';
+        if (isSVG) {
+            type = 'svgMarkup';
         }
-        else if(isPathData) {
-            type='pathDataString';
+        else if (isPathData) {
+            type = 'pathDataString';
         }
-        else if(isPolyString) {
-            type='polyString';
+        else if (isPolyString) {
+            type = 'polyString';
         }
 
         else {
@@ -65,19 +110,24 @@ function getAngle(p1, p2, normalize = false) {
  * http://jsfiddle.net/justin_c_rounds/Gd2S2/light/
  */
 
-function checkLineIntersection(p1, p2, p3, p4, exact = true) {
+function checkLineIntersection(p1=null, p2=null, p3=null, p4=null, exact = true, debug=false) {
     // if the lines intersect, the result contains the x and y of the intersection (treating the lines as infinite) and booleans for whether line segment 1 or line segment 2 contain the point
     let denominator, a, b, numerator1, numerator2;
     let intersectionPoint = {};
 
+    if(!p1 || !p2 || !p3 || !p4){
+        if(debug) console.warn('points missing');
+        return false
+    }
+
     try {
         denominator = ((p4.y - p3.y) * (p2.x - p1.x)) - ((p4.x - p3.x) * (p2.y - p1.y));
         if (denominator == 0) {
             return false;
         }
-
     } catch {
-        console.log('!catch', p1, p2, 'p3:', p3, p4);
+        if(debug) console.warn('!catch', p1, p2, 'p3:', p3, 'p4:', p4);
+        return false
     }
 
     a = p1.y - p3.y;
@@ -94,8 +144,6 @@ function checkLineIntersection(p1, p2, p3, p4, exact = true) {
         y: p1.y + (a * (p2.y - p1.y))
     };
 
-    // console.log('intersectionPoint', intersectionPoint, p1, p2);
-
     let intersection = false;
     // if line1 is a segment and line2 is infinite, they intersect if:
     if ((a > 0 && a < 1) && (b > 0 && b < 1)) {
@@ -495,6 +543,110 @@ function getBezierExtremeT(pts) {
     return tArr;
 }
 
+/**
+ * based on Nikos M.'s answer
+ * how-do-you-calculate-the-axis-aligned-bounding-box-of-an-ellipse
+ * https://stackoverflow.com/questions/87734/#75031511
+ * See also: https://github.com/foo123/Geometrize
+ */
+function getArcExtemes(p0, values) {
+    // compute point on ellipse from angle around ellipse (theta)
+    const arc = (theta, cx, cy, rx, ry, alpha) => {
+        // theta is angle in radians around arc
+        // alpha is angle of rotation of ellipse in radians
+        var cos = Math.cos(alpha),
+            sin = Math.sin(alpha),
+            x = rx * Math.cos(theta),
+            y = ry * Math.sin(theta);
+
+        return {
+            x: cx + cos * x - sin * y,
+            y: cy + sin * x + cos * y
+        };
+    };
+
+    let arcData = svgArcToCenterParam(p0.x, p0.y, values[0], values[1], values[2], values[3], values[4], values[5], values[6]);
+    let { rx, ry, cx, cy, endAngle, deltaAngle } = arcData;
+
+    // arc rotation
+    let deg = values[2];
+
+    // final on path point
+    let p = { x: values[5], y: values[6] };
+
+    // collect extreme points – add end point
+    let extremes = [p];
+
+    // rotation to radians
+    let alpha = deg * Math.PI / 180;
+    let tan = Math.tan(alpha),
+        p1, p2, p3, p4, theta;
+
+    /**
+    * find min/max from zeroes of directional derivative along x and y
+    * along x axis
+    */
+    theta = Math.atan2(-ry * tan, rx);
+
+    let angle1 = theta;
+    let angle2 = theta + Math.PI;
+    let angle3 = Math.atan2(ry, rx * tan);
+    let angle4 = angle3 + Math.PI;
+
+    // inner bounding box
+    let xArr = [p0.x, p.x];
+    let yArr = [p0.y, p.y];
+    let xMin = Math.min(...xArr);
+    let xMax = Math.max(...xArr);
+    let yMin = Math.min(...yArr);
+    let yMax = Math.max(...yArr);
+
+    // on path point close after start
+    let angleAfterStart = endAngle - deltaAngle * 0.001;
+    let pP2 = arc(angleAfterStart, cx, cy, rx, ry, alpha);
+
+    // on path point close before end
+    let angleBeforeEnd = endAngle - deltaAngle * 0.999;
+    let pP3 = arc(angleBeforeEnd, cx, cy, rx, ry, alpha);
+
+    /**
+     * expected extremes
+     * if leaving inner bounding box
+     * (between segment start and end point)
+     * otherwise exclude elliptic extreme points
+    */
+
+    // right
+    if (pP2.x > xMax || pP3.x > xMax) {
+        // get point for this theta
+        p1 = arc(angle1, cx, cy, rx, ry, alpha);
+        extremes.push(p1);
+    }
+
+    // left
+    if (pP2.x < xMin || pP3.x < xMin) {
+        // get anti-symmetric point
+        p2 = arc(angle2, cx, cy, rx, ry, alpha);
+        extremes.push(p2);
+    }
+
+    // top
+    if (pP2.y < yMin || pP3.y < yMin) {
+        // get anti-symmetric point
+        p4 = arc(angle4, cx, cy, rx, ry, alpha);
+        extremes.push(p4);
+    }
+
+    // bottom
+    if (pP2.y > yMax || pP3.y > yMax) {
+        // get point for this theta
+        p3 = arc(angle3, cx, cy, rx, ry, alpha);
+        extremes.push(p3);
+    }
+
+    return extremes;
+}
+
 // cubic bezier.
 function cubicBezierExtremeT(p0, cp1, cp2, p) {
     let [x0, y0, x1, y1, x2, y2, x3, y3] = [p0.x, p0.y, cp1.x, cp1.y, cp2.x, cp2.y, p.x, p.y];
@@ -603,90 +755,6 @@ function quadraticBezierExtremeT(p0, cp1, p) {
     return extemeT
 }
 
-function commandIsFlat(points, tolerance = 0.025) {
-
-    let p0 = points[0];
-    let p = points[points.length - 1];
-
-    let xArr = points.map(pt => { return pt.x });
-    let yArr = points.map(pt => { return pt.y });
-
-    let xMin = Math.min(...xArr);
-    let xMax = Math.max(...xArr);
-    let yMin = Math.min(...yArr);
-    let yMax = Math.max(...yArr);
-    let w = xMax - xMin;
-    let h = yMax - yMin;
-
-    if (points.length < 3 || (w === 0 || h === 0)) {
-        return { area: 0, flat: true, thresh: 0.0001, ratio: 0 };
-    }
-
-    let squareDist = getSquareDistance(p0, p);
-    let squareDist1 = getSquareDistance(p0, points[0]);
-    let squareDist2 = points.length > 3 ? getSquareDistance(p, points[1]) : squareDist1;
-    let squareDistAvg = (squareDist1 + squareDist2) / 2;
-
-    tolerance = 0.5;
-    let thresh = (w + h) * 0.5 * tolerance;
-
-    let area = 0;
-    for (let i = 0, l = points.length; i < l; i++) {
-        let addX = points[i].x;
-        let addY = points[i === points.length - 1 ? 0 : i + 1].y;
-        let subX = points[i === points.length - 1 ? 0 : i + 1].x;
-        let subY = points[i].y;
-        area += addX * addY * 0.5 - subX * subY * 0.5;
-    }
-
-    area = +Math.abs(area).toFixed(9);
-    let areaThresh = 1000;
-
-    let ratio = area / (squareDistAvg);
-
-    let isFlat = area === 0 ? true : area < squareDistAvg / areaThresh;
-
-    return { area: area, flat: isFlat, thresh: thresh, ratio: ratio, squareDist: squareDist, areaThresh: squareDist / areaThresh };
-}
-
-function checkBezierFlatness(p0, cpts, p) {
-
-    let isFlat = false;
-
-    let isCubic = cpts.length===2;
-
-    let cp1 = cpts[0];
-    let cp2 = isCubic ? cpts[1] : cp1;
-
-    if(p0.x===cp1.x && p0.y===cp1.y && p.x===cp2.x && p.y===cp2.y) return true;
-
-    let dx1 = cp1.x - p0.x;
-    let dy1 = cp1.y - p0.y;
-
-    let dx2 = p.x - cp2.x;
-    let dy2 = p.y - cp2.y;
-
-    let cross1 = Math.abs(dx1 * dy2 - dy1 * dx2);
-
-    if(!cross1) return true
-
-    let dx0 = p.x - p0.x;
-    let dy0 = p.y - p0.y;
-    let cross0 = Math.abs(dx0 * dy1 - dy0 * dx1);
-
-    if(!cross0) return true
-
-    let rat = (cross0/cross1);
-
-    if (rat<1.1 ) {
-
-        isFlat = true;
-    }
-
-    return isFlat;
-
-}
-
 /**
  * sloppy distance calculation
  * based on x/y differences
@@ -710,27 +778,23 @@ function getDistAv(pt1, pt2) {
  * split compound paths into 
  * sub path data array
  */
-function splitSubpaths(pathData) {
 
+function splitSubpaths(pathData) {
     let subPathArr = [];
+    let current = [pathData[0]];
+    let l = pathData.length;
 
-    
-    try{
-        let subPathIndices = pathData.map((com, i) => (com.type.toLowerCase() === 'm' ? i : -1)).filter(i => i !== -1);
+    for (let i = 1; i < l; i++) {
+        let com = pathData[i];
 
-    }catch{
-        console.log('catch', pathData);
+        if (com.type === 'M' || com.type === 'm') {
+            subPathArr.push(current);
+            current = [];
+        }
+        current.push(com);
     }
 
-    let subPathIndices = pathData.map((com, i) => (com.type.toLowerCase() === 'm' ? i : -1)).filter(i => i !== -1);
-
-    // no compound path
-    if (subPathIndices.length === 1) {
-        return [pathData]
-    }
-    subPathIndices.forEach((index, i) => {
-        subPathArr.push(pathData.slice(index, subPathIndices[i + 1]));
-    });
+    if (current.length) subPathArr.push(current);
 
     return subPathArr;
 }
@@ -1154,6 +1218,73 @@ function getPathDataPoly(pathData) {
     return poly;
 }
 
+/**
+ * get exact path BBox
+ * calculating extremes for all command types
+ */
+
+function getPathDataBBox(pathData) {
+
+    // save extreme values
+    let xMin = Infinity;
+    let xMax = -Infinity;
+    let yMin = Infinity;
+    let yMax = -Infinity;
+
+    const setXYmaxMin = (pt) => {
+        if (pt.x < xMin) {
+            xMin = pt.x;
+        }
+        if (pt.x > xMax) {
+            xMax = pt.x;
+        }
+        if (pt.y < yMin) {
+            yMin = pt.y;
+        }
+        if (pt.y > yMax) {
+            yMax = pt.y;
+        }
+    };
+
+    for (let i = 0; i < pathData.length; i++) {
+        let com = pathData[i];
+        let { type, values } = com;
+        let valuesL = values.length;
+        let comPrev = pathData[i - 1] ? pathData[i - 1] : pathData[i];
+        let valuesPrev = comPrev.values;
+        let valuesPrevL = valuesPrev.length;
+
+        if (valuesL) {
+            let p0 = { x: valuesPrev[valuesPrevL - 2], y: valuesPrev[valuesPrevL - 1] };
+            let p = { x: values[valuesL - 2], y: values[valuesL - 1] };
+            // add final on path point
+            setXYmaxMin(p);
+
+            if (type === 'C' || type === 'Q') {
+                let cp1 = { x: values[0], y: values[1] };
+                let cp2 = type === 'C' ? { x: values[2], y: values[3] } : cp1;
+                let pts = type === 'C' ? [p0, cp1, cp2, p] : [p0, cp1, p];
+
+                let bezierExtremesT = getBezierExtremeT(pts);
+                bezierExtremesT.forEach(t => {
+                    let pt = pointAtT(pts, t);
+                    setXYmaxMin(pt);
+                });
+            }
+
+            else if (type === 'A') {
+                let arcExtremes = getArcExtemes(p0, values);
+                arcExtremes.forEach(pt => {
+                    setXYmaxMin(pt);
+                });
+            }
+        }
+    }
+
+    let bbox = { x: xMin, y: yMin, width: xMax - xMin, height: yMax - yMin };
+    return bbox
+}
+
 /**
  * get pathdata area
  */
@@ -1347,13 +1478,6 @@ function pathDataToD(pathData, optimize = 0) {
     let beautify = optimize > 1;
     let minify = beautify || optimize ? false : true;
 
-    // Convert first "M" to "m" if followed by "l" (when minified)
-    /*
-    if (pathData[1].type === "l" && minify) {
-        pathData[0].type = "m";
-    }
-    */
-
     let d = '';
     let separator_command = beautify ? `\n` : (minify ? '' : ' ');
     let separator_type =  !minify ? ' ' : '';
@@ -1375,13 +1499,11 @@ function pathDataToD(pathData, optimize = 0) {
         }
 
         // Omit type for repeated commands
-        type = (com0.type === com.type && com.type.toLowerCase() !== 'm' && minify)
+        type = (minify && com0.type === com.type && com.type.toLowerCase() !== 'm' )
             ? " "
-            : (
-                (com0.type === "M" && com.type === "L")
-            ) && minify
+            : (minify && com0.type === "M" && com.type === "L"
                 ? " "
-                : com.type;
+                : com.type);
 
         // concatenate subsequent floating point values
         if (minify) {
@@ -1429,7 +1551,7 @@ function pathDataToD(pathData, optimize = 0) {
     return d;
 }
 
-function getCombinedByDominant(com1, com2, maxDist = 0, tolerance = 1) {
+function getCombinedByDominant(com1, com2, maxDist = 0, tolerance = 1, debug = false) {
 
     // cubic Bézier derivative
     const cubicDerivative = (p0, p1, p2, p3, t) => {
@@ -1451,8 +1573,9 @@ function getCombinedByDominant(com1, com2, maxDist = 0, tolerance = 1) {
     let commands = [com1, com2];
 
     // detect dominant 
-    let dist1 = getSquareDistance(com1.p0, com1.p);
-    let dist2 = getSquareDistance(com2.p0, com2.p);
+    let dist1 = getDistAv(com1.p0, com1.p);
+    let dist2 = getDistAv(com2.p0, com2.p);
+
     let reverse = dist1 > dist2;
 
     // backup original commands
@@ -1511,11 +1634,9 @@ function getCombinedByDominant(com1, com2, maxDist = 0, tolerance = 1) {
     let dP = cubicDerivative(com2.p0, com2.cp1, com2.cp2, com2.p, t0);
     let r = sub(P, com1.p0);
 
-    
     t0 -= dot(r, dP) / dot(dP, dP);
 
     // construct merged cubic over [t0, 1]
-
     let Q0 = pointAtT([com2.p0, com2.cp1, com2.cp2, com2.p], t0);
     let Q3 = com2.p;
 
@@ -1532,6 +1653,7 @@ function getCombinedByDominant(com1, com2, maxDist = 0, tolerance = 1) {
         cp1: Q1,
         cp2: Q2,
         p: Q3,
+        t0
     };
 
     if (reverse) {
@@ -1540,10 +1662,11 @@ function getCombinedByDominant(com1, com2, maxDist = 0, tolerance = 1) {
             cp1: Q2,
             cp2: Q1,
             p: Q0,
+            t0
         };
     }
 
-    let tMid = (1 - t0)*0.5 ;
+    let tMid = (1 - t0) * 0.5;
 
     let ptM = pointAtT([result.p0, result.cp1, result.cp2, result.p], tMid, false, true);
     let seg1_cp2 = ptM.cpts[2];
@@ -1551,21 +1674,22 @@ function getCombinedByDominant(com1, com2, maxDist = 0, tolerance = 1) {
     let ptI_1 = checkLineIntersection(ptM, seg1_cp2, result.p0, ptI, false);
     let ptI_2 = checkLineIntersection(ptM, seg1_cp2, result.p, ptI, false);
 
-    let cp1_2 = interpolate(result.p0, ptI_1, 1.333);
-    let cp2_2 = interpolate(result.p, ptI_2, 1.333);
+    let cp1_2 = interpolate(result.p0, ptI_1, 1.333  );
+    let cp2_2 = interpolate(result.p, ptI_2, 1.333  );
 
     // test self intersections and exit 
-    let cp_intersection = checkLineIntersection(com1_o.p0, cp1_2, com2_o.p, cp2_2, true );
-    if(cp_intersection){
+    let cp_intersection = checkLineIntersection(com1_o.p0, cp1_2, com2_o.p, cp2_2, true);
+    if (cp_intersection) {
 
         return commands;
     }
 
+    if (debug) renderPoint(markers, ptM, 'purple');
+
     result.cp1 = cp1_2;
     result.cp2 = cp2_2;
 
-    // check distances
-
+    // check distances between original starting point and extrapolated
     let dist3 = getDistAv(com1_o.p0, result.p0);
     let dist4 = getDistAv(com2_o.p, result.p);
     let dist5 = (dist3 + dist4);
@@ -1577,11 +1701,34 @@ function getCombinedByDominant(com1, com2, maxDist = 0, tolerance = 1) {
     result.corner = com2_o.corner;
     result.dimA = com2_o.dimA;
     result.directionChange = com2_o.directionChange;
+    result.type = 'C';
     result.values = [result.cp1.x, result.cp1.y, result.cp2.x, result.cp2.y, result.p.x, result.p.y];
 
-    // check if completely off
+    // extrapolated starting point is not completely off
     if (dist5 < maxDist) {
 
+        /*
+        let tTotal = 1 + Math.abs(t0);
+        let tSplit = reverse ? 1 + t0 : Math.abs(t0);
+
+        let pO = pointAtT([com2_o.p0, com2_o.cp1, com2_o.cp2, com2_o.p], t0);
+*/
+
+        // split t to meet original mid segment start point
+        let tSplit = reverse ? 1 + t0 : Math.abs(t0);
+
+        let tTotal = 1 + Math.abs(t0);
+        tSplit = reverse ? 1 + t0 : Math.abs(t0) / tTotal;
+
+        let ptSplit = pointAtT([result.p0, result.cp1, result.cp2, result.p], tSplit);
+        let distSplit = getDistAv(ptSplit, com1.p);
+
+        // not close enough - exit
+        if (distSplit > maxDist * tolerance ) {
+
+            return commands;
+        }
+
         // compare combined with original area
         let pathData0 = [
             { type: 'M', values: [com1_o.p0.x, com1_o.p0.y] },
@@ -1598,129 +1745,198 @@ function getCombinedByDominant(com1, com2, maxDist = 0, tolerance = 1) {
         let areaN = getPathArea(pathDataN);
         let areaDiff = Math.abs(areaN / area0 - 1);
 
-        result.error = areaDiff * 10 * tolerance;
+        result.error = areaDiff * 5 * tolerance;
 
-        pathDataToD(pathDataN);
+        if (debug) {
+            let d = pathDataToD(pathDataN);
+            renderPath(markers, d, 'orange');
+        }
 
-        // success
-        if (areaDiff < 0.01) {
+        // success!!!
+        if (areaDiff < 0.05 * tolerance) {
             commands = [result];
 
-        }
-
+        } 
     }
 
     return commands
 
 }
 
-function combineCubicPairs(com1, com2, extrapolateDominant = false, tolerance = 1) {
+function simplifyPathDataCubic(pathData, {
+    keepExtremes = true,
+    keepInflections = true,
+    keepCorners = true,
+    extrapolateDominant = true,
+    tolerance = 1,
+} = {}) {
 
-    let commands = [com1, com2];
-    let t = findSplitT(com1, com2);
+    let pathDataN = [pathData[0]];
+    let l = pathData.length;
 
-    let distAv1 = getDistAv(com1.p0, com1.p);
-    let distAv2 = getDistAv(com2.p0, com2.p);
-    let distMin = Math.min(distAv1, distAv2);
+    for (let i = 2; l && i <= l; i++) {
+        let com = pathData[i - 1];
+        let comN = i < l ? pathData[i] : null;
+        let typeN = comN?.type || null;
 
-    let distScale = 0.05;
-    let maxDist = distMin * distScale * tolerance;
+        let isDirChange = com?.directionChange || null;
+        let isDirChangeN = comN?.directionChange || null;
 
-    let comS = getExtrapolatedCommand(com1, com2, t, t);
+        let { type, values, p0, p, cp1 = null, cp2 = null, extreme = false, corner = false, dimA = 0 } = com;
 
-    // test on path point against original
-    let pt = pointAtT([comS.p0, comS.cp1, comS.cp2, comS.p], t);
+        // next is also cubic
+        if (type === 'C' && typeN === 'C') {
 
-    let dist0 = getDistAv(com1.p, pt);
-    let dist1 = 0, dist2 = 0;
-    let close = dist0 < maxDist;
-    let success = false;
+            // cannot be combined as crossing extremes or corners
+            if (
+                (keepInflections && isDirChangeN) ||
+                (keepCorners && corner) ||
+                (!isDirChange && keepExtremes && extreme)
+            ) {
 
-    // collect error data
-    let error = dist0;
+                pathDataN.push(com);
+            }
 
-    /*
-    if (com2.directionChange) {
+            // try simplification
+            else {
 
-    }
-    */
+                let combined = combineCubicPairs(com, comN, {tolerance});
+                let error = 0;
 
-    if (close) {
+                // combining successful! try next segment
+                if (combined.length === 1) {
+                    com = combined[0];
+                    let offset = 1;
 
-        /**
-         * check additional points
-         * to prevent distortions
-         */
+                    // add cumulative error to prevent distortions
+                    error += com.error;
 
-        // 2nd segment mid
-        let pt_2 = pointAtT([com2.p0, com2.cp1, com2.cp2, com2.p], 0.5);
+                    // find next candidates
 
-        // simplified path
-        let t3 = (1 + t) * 0.5;
-        let ptS_2 = pointAtT([comS.p0, comS.cp1, comS.cp2, comS.p], t3);
-        dist1 = getDistAv(pt_2, ptS_2);
+                    for (let n = i + 1; error < tolerance && n < l; n++) {
+                        let comN = pathData[n];
+                        if (comN.type !== 'C' ||
+                            (
+                                (keepInflections && comN.directionChange) ||
+                                (keepCorners && com.corner) ||
+                                (keepExtremes && com.extreme)
+                            )
+                        ) {
+                            break
+                        }
 
-        error += dist1;
+                        let combined = combineCubicPairs(com, comN, {tolerance});
+                        if (combined.length === 1) {
+                            // add cumulative error to prevent distortions
 
-        // quit - paths not congruent
+                            error += combined[0].error * 0.5;
 
-        if (dist1 < maxDist) {
+                            offset++;
+                        }
+                        com = combined[0];
+                    }
 
-            // 1st segment mid
-            let pt_1 = pointAtT([com1.p0, com1.cp1, com1.cp2, com1.p], 0.5);
+                    pathDataN.push(com);
 
-            let t2 = t * 0.5;
-            let ptS_1 = pointAtT([comS.p0, comS.cp1, comS.cp2, comS.p], t2);
-            dist2 = getDistAv(pt_1, ptS_1);
+                    if (i < l) {
+                        i += offset;
+                    }
 
-            /*
-            if(dist1>tolerance){
-                renderPoint(markers, pt_1, 'blue')
-                renderPoint(markers, ptS_1, 'orange', '0.5%')
+                } else {
+                    pathDataN.push(com);
+                }
             }
-            */
-
-            // quit - paths not congruent
-            if (dist1 + dist2 < maxDist) success = true;
 
-            // collect error data
-            error += dist2;
+        } // end of bezier command
 
+        // other commands
+        else {
+            pathDataN.push(com);
         }
 
-    } // end 1st try
+    } // end command loop
 
-    
-    /*
-    if (extrapolateDominant && com2.extreme) {
-        renderPoint(markers, com2.p)
+    return pathDataN
+}
 
-    }
-    */
+function combineCubicPairs(com1, com2, {
+    tolerance = 1
+} = {}) {
+
+    let commands = [com1, com2];
+
+    // assume 2 segments are result of a segment split
+    let t = findSplitT(com1, com2);
+
+    let distAv1 = getDistAv(com1.p0, com1.p);
+    let distAv2 = getDistAv(com2.p0, com2.p);
+    let distMin = Math.max(0, Math.min(distAv1, distAv2));
+
+    let distScale = 0.06;
+    let maxDist = distMin * distScale * tolerance;
+
+    // get hypothetical combined command
+    let comS = getExtrapolatedCommand(com1, com2, t);
+
+    // test new point-at-t against original mid segment starting point
+    let pt = pointAtT([comS.p0, comS.cp1, comS.cp2, comS.p], t);
+
+    let dist0 = getDistAv(com1.p, pt);
+    let dist1 = 0, dist2 = 0;
+    let close = dist0 < maxDist;
+    let success = false;
+
+    // collect error data
+    let error = dist0;
+
+    if (close) {
+
+        /**
+         * check additional points
+         * to prevent distortions
+         */
+
+        // 2nd segment mid
+        let pt_2 = pointAtT([com2.p0, com2.cp1, com2.cp2, com2.p], 0.5);
+
+        // simplified path
+        let t3 = (1 + t) * 0.5;
+        let ptS_2 = pointAtT([comS.p0, comS.cp1, comS.cp2, comS.p], t3);
+        dist1 = getDistAv(pt_2, ptS_2);
+
+        error += dist1;
+
+        // quit - paths not congruent
+
+        if (dist1 < maxDist) {
 
-    
+            // 1st segment mid
+            let pt_1 = pointAtT([com1.p0, com1.cp1, com1.cp2, com1.p], 0.5);
 
-    // try extrapolated dominant curve
+            let t2 = t * 0.5;
+            let ptS_1 = pointAtT([comS.p0, comS.cp1, comS.cp2, comS.p], t2);
+            dist2 = getDistAv(pt_1, ptS_1);
 
-    //  && !com1.extreme
-    if (extrapolateDominant && !success  ) {
+            /*
+            if(dist1>tolerance){
+                renderPoint(markers, pt_1, 'blue')
+                renderPoint(markers, ptS_1, 'orange', '0.5%')
+            }
+            */
 
-        let combinedEx = getCombinedByDominant(com1, com2, maxDist, tolerance);
+            // quit - paths not congruent
+            if (dist1 + dist2 < maxDist) success = true;
 
-        if(combinedEx.length===1){
-            success = true;
-            comS = combinedEx[0];
-            error = comS.error;
+            // collect error data
+            error += dist2;
 
         }
 
-    
-    }
+    } // end 1st try
 
     // add meta
     if (success) {
 
-        
         // correct to exact start and end points
         comS.p0 = com1.p0;
         comS.p = com2.p;
@@ -1743,50 +1959,69 @@ function combineCubicPairs(com1, com2, extrapolateDominant = false, tolerance =
     return commands;
 }
 
-function getExtrapolatedCommand(com1, com2, t1 = 0, t2 = 0) {
+function getExtrapolatedCommand(com1, com2, t = 0) {
 
     let { p0, cp1 } = com1;
     let { p, cp2 } = com2;
 
     // extrapolate control points
-    let cp1_S = {
-        x: (cp1.x - (1 - t1) * p0.x) / t1,
-        y: (cp1.y - (1 - t1) * p0.y) / t1
+    cp1 = {
+        x: (cp1.x - (1 - t) * p0.x) / t,
+        y: (cp1.y - (1 - t) * p0.y) / t
     };
 
-    let cp2_S = {
-        x: (cp2.x - t2 * p.x) / (1 - t2),
-        y: (cp2.y - t2 * p.y) / (1 - t2)
+    cp2 = {
+        x: (cp2.x - t * p.x) / (1 - t),
+        y: (cp2.y - t * p.y) / (1 - t)
     };
 
-    let comS = { p0, cp1: cp1_S, cp2: cp2_S, p };
+    return { p0, cp1, cp2, p };
+}
+
+function findSplitT(com1, com2) {
+
+    let len3 = getDistance(com1.cp2, com1.p);
+    let len4 = getDistance(com1.cp2, com2.cp1);
 
-    return comS
+    let t = Math.min(len3) / len4;
 
+    return t
 }
 
-function findSplitT(com1, com2) {
+function commandIsFlat(points, {
+    tolerance = 1,
+    debug=false
+} = {}) {
 
-    // control tangent intersection
-    let pt1 = checkLineIntersection(com1.p0, com1.cp1, com2.cp2, com2.p, false);
+    let isFlat=false;
+    let report = {
+        flat:true,
+        steepness:0
+    };
 
-    // intersection 2nd cp1 tangent and global tangent intersection
-    let ptI = checkLineIntersection(pt1, com2.p, com2.p0, com2.cp1, false);
+    let p0 = points[0];
+    let p = points[points.length - 1];
 
-    let len1 = getDistance(pt1, com2.p);
-    let len2 = getDistance(ptI, com2.p);
+    let xSet = new Set([...points.map(pt => +pt.x.toFixed(8))]);
+    let ySet = new Set([...points.map(pt => +pt.y.toFixed(8))]);
 
-    let t = 1 - len2 / len1;
+    // must be flat
+    if(xSet.size===1 || ySet.size===1) return !debug ? true : report;
 
-    // check self intersections
+    let squareDist = getSquareDistance(p0, p);
+    let threshold = squareDist / 1000 * tolerance;
+    let area = getPolygonArea(points, true);
 
-    let len3 = getDistance(com1.cp2, com1.p);
-    let len4 = getDistance(com1.cp2, com2.cp1);
+    // flat enough
+    if(area < threshold) isFlat = true;
 
-    t = Math.min(len3) / len4;
+    if(debug){
+        report.flat = isFlat;
 
-    return t
+        report.steepness = area/squareDist*10;
+    }
 
+    return !debug ? isFlat : report;
 }
 
 function analyzePathData(pathData = []) {
@@ -1831,7 +2066,6 @@ function analyzePathData(pathData = []) {
          * this way we can skip certain tests
          */
         let commandPts = [p0];
-        let isFlat = false;
 
         // init properties
         com.idx = c - 1;
@@ -1862,7 +2096,7 @@ function analyzePathData(pathData = []) {
         com.p0 = p0;
         com.p = p;
 
-        let cp1, cp2, cp1N, cp2N, pN, typeN, area1;
+        let cp1, cp2, cp1N, pN, typeN, area1;
 
         let dimA = getDistAv(p0, p);
         com.dimA = dimA;
@@ -1902,13 +2136,18 @@ function analyzePathData(pathData = []) {
             if (type === 'C') commandPts.push(cp2);
             commandPts.push(p);
 
+            /*
+
             let commandFlatness = commandIsFlat(commandPts);
             isFlat = commandFlatness.flat;
             com.flat = isFlat;
 
             if (isFlat) {
                 com.extreme = false;
+
             }
+            */
+
         }
 
         /**
@@ -1917,7 +2156,7 @@ function analyzePathData(pathData = []) {
          * so we interpret maximum x/y on-path points as well as extremes
          * but we ignore linetos to allow chunk compilation
          */
-        if (!isFlat && type !== 'L' && (p.x === left || p.y === top || p.x === right || p.y === bottom)) {
+        if (type !== 'L' && (p.x === left || p.y === top || p.x === right || p.y === bottom)) {
             com.extreme = true;
         }
 
@@ -1930,7 +2169,7 @@ function analyzePathData(pathData = []) {
             pN = comN ? { x: comNValsL[0], y: comNValsL[1] } : null;
 
             cp1N = { x: comN.values[0], y: comN.values[1] };
-            cp2N = comN.type === 'C' ? { x: comN.values[2], y: comN.values[3] } : null;
+            comN.type === 'C' ? { x: comN.values[2], y: comN.values[3] } : null;
         }
 
         /**
@@ -1960,19 +2199,15 @@ function analyzePathData(pathData = []) {
                 // check extremes
                 let cpts = commandPts.slice(1);
 
-                let w = pN ? Math.abs(pN.x - p0.x) : 0;
-                let h = pN ? Math.abs(pN.y - p0.y) : 0;
-                let thresh = (w + h) / 2 * 0.1;
-                let pts1 = type === 'C' ? [p, cp1N, cp2N, pN] : [p, cp1N, pN];
-
-                let flatness2 = commandIsFlat(pts1, thresh);
-                let isFlat2 = flatness2.flat;
+                pN ? Math.abs(pN.x - p0.x) : 0;
+                pN ? Math.abs(pN.y - p0.y) : 0;
 
                 /**
                  * if current and next cubic are flat
                  * we don't flag them as extremes to allow simplification
                  */
-                let hasExtremes = (isFlat && isFlat2) ? false : (!com.extreme ? bezierhasExtreme(p0, cpts, angleThreshold) : true);
+
+                let hasExtremes = (!com.extreme ? bezierhasExtreme(p0, cpts, angleThreshold) : true);
 
                 if (hasExtremes) {
                     com.extreme = true;
@@ -2018,11 +2253,11 @@ function detectAccuracy(pathData) {
 
     // Reference first MoveTo command (M)
     let M = { x: pathData[0].values[0], y: pathData[0].values[1] };
-    let p0 =  M;
+    let p0 = M;
     let p = M;
     pathData[0].decimals = 0;
 
-    let dims = new Set();
+    let dims = [];
 
     // add average distances
     for (let i = 0, len = pathData.length; i < len; i++) {
@@ -2030,28 +2265,33 @@ function detectAccuracy(pathData) {
         let { type, values } = com;
 
         let lastVals = values.length ? values.slice(-2) : [M.x, M.y];
-        p={x:lastVals[0], y:lastVals[1]};
+        p = { x: lastVals[0], y: lastVals[1] };
 
         // use existing averave dimension value or calculate
-        let dimA = com.dimA ? +com.dimA.toFixed(8) : type!=='M' ? +getDistAv(p0, p).toFixed(8) : 0;
+        let dimA = com.dimA ? +com.dimA.toFixed(8) : type !== 'M' ? +getDistAv(p0, p).toFixed(8) : 0;
 
-        if(dimA) dims.add(dimA);
-        
+        if (dimA) dims.push(dimA);
 
-        if(type==='M'){
-            M=p;
+        if (type === 'M') {
+            M = p;
         }
         p0 = p;
     }
 
-    let dim_min = Array.from(dims).sort();
-    let sliceIdx = Math.ceil(dim_min.length/8);
-    dim_min = dim_min.slice(0, sliceIdx );
+    let dim_min = dims.sort();
 
-    let dimVal = dim_min.reduce((a,b)=>a+b, 0) / sliceIdx;
+    /*
+    let minVal = dim_min.length > 15 ?
+        (dim_min[0] + dim_min[2]) / 2 :
+        dim_min[0];
+    */
+        
+    let sliceIdx = Math.ceil(dim_min.length / 10);
+    dim_min = dim_min.slice(0, sliceIdx);
+    let minVal = dim_min.reduce((a, b) => a + b, 0) / sliceIdx;
 
-    let threshold = 50;
-    let decimalsAuto = dimVal > threshold ? 0 : Math.floor(threshold / dimVal).toString().length;
+    let threshold = 40;
+    let decimalsAuto = minVal > threshold*1.5 ? 0 : Math.floor(threshold / minVal).toString().length;
 
     // clamp
     return Math.min(Math.max(0, decimalsAuto), 8)
@@ -2064,19 +2304,24 @@ function detectAccuracy(pathData) {
  * based on suggested accuracy in path data
  */
 function roundPathData(pathData, decimals = -1) {
-    // has recommended decimals
-    let hasDecimal = decimals == 'auto' && pathData[0].hasOwnProperty('decimals') ? true : false;
 
-    for(let c=0, len=pathData.length; c<len; c++){
-        let com=pathData[c];
+    let len = pathData.length;
+
+    for (let c = 0; c < len; c++) {
+
+        let values = pathData[c].values;
+        let valLen = values.length;
 
-        if (decimals >-1 || hasDecimal) {
-            decimals = hasDecimal ? com.decimals : decimals;
+        if (valLen && (decimals > -1) ) {
 
-            pathData[c].values = com.values.map(val=>{return val ? +val.toFixed(decimals) : val });
+            for(let v=0; v<valLen; v++){
 
+                pathData[c].values[v] =  +values[v].toFixed(decimals);
+            }
         }
-    }    return pathData;
+    }
+
+    return pathData;
 }
 
 function revertCubicQuadratic(p0 = {}, cp1 = {}, cp2 = {}, p = {}) {
@@ -2094,7 +2339,7 @@ function revertCubicQuadratic(p0 = {}, cp1 = {}, cp2 = {}, p = {}) {
     let values = [cp1.x, cp1.y, cp2.x, cp2.y, p.x, p.y];
     let comN = {type, values};
 
-    if (dist1 < threshold) {
+    if (dist1 && threshold && dist1 < threshold) {
         cp1_Q = checkLineIntersection(p0, cp1, p, cp2, false);
         if (cp1_Q) {
 
@@ -2119,9 +2364,10 @@ function convertPathData(pathData, {
     if (toShorthands) pathData = pathDataToShorthands(pathData);
 
     // pre round - before relative conversion to minimize distortions
-    pathData = roundPathData(pathData, decimals);
+    if(decimals>-1 && toRelative) pathData = roundPathData(pathData, decimals);
     if (toRelative) pathData = pathDataToRelative(pathData);
     if (decimals > -1) pathData = roundPathData(pathData, decimals);
+
     return pathData
 }
 
@@ -2423,7 +2669,7 @@ function pathDataToLonghands(pathData, decimals = -1, test = true) {
  * L, L, C, Q => H, V, S, T
  * reversed method: pathDataToLonghands()
  */
-function pathDataToShorthands(pathData, decimals = -1, test = true) {
+function pathDataToShorthands(pathData, decimals = -1, test = false) {
 
     /** 
     * analyze pathdata – if you're sure your data is already absolute skip it via test=false
@@ -2434,29 +2680,28 @@ function pathDataToShorthands(pathData, decimals = -1, test = true) {
         hasRel = /[astvqmhlc]/g.test(commandTokens);
     }
 
-    pathData = test && hasRel ? pathDataToAbsolute(pathData, decimals) : pathData;
+    pathData = test && hasRel ? pathDataToAbsoluteOrRelative(pathData) : pathData;
+
+    let len = pathData.length;
+    let pathDataShorts = new Array(len);
 
     let comShort = {
         type: "M",
         values: pathData[0].values
     };
 
-    if (pathData[0].decimals) {
-
-        comShort.decimals = pathData[0].decimals;
-    }
-
-    let pathDataShorts = [comShort];
+    pathDataShorts[0] = comShort;
 
     let p0 = { x: pathData[0].values[0], y: pathData[0].values[1] };
     let p;
     let tolerance = 0.01;
 
-    for (let i = 1, len = pathData.length; i < len; i++) {
+    for (let i = 1; i < len; i++) {
 
         let com = pathData[i];
         let { type, values } = com;
-        let valuesLast = values.slice(-2);
+        let valuesLen = values.length;
+        let valuesLast = [values[valuesLen-2], values[valuesLen-1]];
 
         // previoius command
         let comPrev = pathData[i - 1];
@@ -2504,7 +2749,8 @@ function pathDataToShorthands(pathData, decimals = -1, test = true) {
                 if (typePrev !== 'Q') {
 
                     p0 = { x: valuesLast[0], y: valuesLast[1] };
-                    pathDataShorts.push(com);
+
+                    pathDataShorts[i] = com;
                     continue;
                 }
 
@@ -2533,7 +2779,8 @@ function pathDataToShorthands(pathData, decimals = -1, test = true) {
 
                 if (typePrev !== 'C') {
 
-                    pathDataShorts.push(com);
+                    pathDataShorts[i] = com;
+
                     p0 = { x: valuesLast[0], y: valuesLast[1] };
                     continue;
                 }
@@ -2575,8 +2822,10 @@ function pathDataToShorthands(pathData, decimals = -1, test = true) {
         }
 
         p0 = { x: valuesLast[0], y: valuesLast[1] };
-        pathDataShorts.push(comShort);
+        pathDataShorts[i] = comShort;
+
     }
+
     return pathDataShorts;
 }
 
@@ -3021,10 +3270,10 @@ function normalizePathData(pathData = [],
         quadraticToCubic = false,
         arcToCubic = false,
         arcAccuracy = 2,
-    } = {},
 
-    {
+        // assume we need full normalization
         hasRelatives = true, hasShorthands = true, hasQuadratics = true, hasArcs = true, testTypes = false
+
     } = {}
 ) {
 
@@ -3075,15 +3324,28 @@ function parsePathDataNormalized(d,
     } = {}
 ) {
 
-    let pathDataObj = parsePathDataString(d);
-    let { hasRelatives, hasShorthands, hasQuadratics, hasArcs } = pathDataObj;
-    let pathData = pathDataObj.pathData;
+    // is already array
+    let isArray = Array.isArray(d);
+
+    // normalize native pathData to regular array
+    let hasConstructor = isArray && typeof d[0] === 'object' && typeof d[0].constructor === 'function';
+    /*
+    if (hasConstructor) {
+        d = d.map(com => { return { type: com.type, values: com.values } })
+        console.log('hasConstructor', hasConstructor, (typeof d[0].constructor), d);
+    }
+    */
+
+    let pathDataObj = isArray ? d : parsePathDataString(d);
+
+    let { hasRelatives = true, hasShorthands = true, hasQuadratics = true, hasArcs = true } = pathDataObj;
+    let pathData = hasConstructor ? pathDataObj : pathDataObj.pathData;
 
     // normalize
     pathData = normalizePathData(pathData,
-        { toAbsolute, toLonghands, quadraticToCubic, arcToCubic, arcAccuracy },
-
-        { hasRelatives, hasShorthands, hasQuadratics, hasArcs }
+        { toAbsolute, toLonghands, quadraticToCubic, arcToCubic, arcAccuracy,
+        hasRelatives, hasShorthands, hasQuadratics, hasArcs 
+        },
     );
 
     return pathData;
@@ -3435,7 +3697,8 @@ function parsePathDataString(d, debug = true) {
         if (debug === 'log') {
             console.log(feedback);
         } else {
-            throw new Error(feedback)
+
+            console.warn(feedback);
         }
     }
 
@@ -3463,18 +3726,266 @@ function parsePathDataString(d, debug = true) {
 
 }
 
-function pathDataRemoveColinear(pathData, tolerance = 1, flatBezierToLinetos = true) {
+function stringifyPathData(pathData) {
+    return pathData.map(com => { return `${com.type} ${com.values.join(' ')}` }).join(' ');
+}
+
+function shapeElToPath(el) {
+
+    let nodeName = el.nodeName.toLowerCase();
+    if (nodeName === 'path') return el;
+
+    let pathData = getPathDataFromEl(el);
+    let d = pathData.map(com => { return `${com.type} ${com.values} ` }).join(' ');
+    let attributes = [...el.attributes].map(att => att.name);
+
+    let pathN = document.createElementNS('http://www.w3.org/2000/svg', 'path');
+    pathN.setAttribute('d', d);
+
+    let exclude = ['x', 'y', 'cx', 'cy', 'dx', 'dy', 'r', 'rx', 'ry', 'width', 'height', 'points'];
+
+    attributes.forEach(att => {
+        if (!exclude.includes(att)) {
+            let val = el.getAttribute(att);
+            pathN.setAttribute(att, val);
+        }
+    });
+
+    return pathN
+
+}
+
+// retrieve pathdata from svg geometry elements
+function getPathDataFromEl(el, stringify = false) {
+
+    let pathData = [];
+    let type = el.nodeName;
+    let atts, attNames, d, x, y, width, height, r, rx, ry, cx, cy, x1, x2, y1, y2;
+
+    // convert relative or absolute units 
+    const svgElUnitsToPixel = (el, decimals = 9) => {
+
+        const svg = el.nodeName !== "svg" ? el.closest("svg") : el;
+
+        // convert real life units to pixels
+        const translateUnitToPixel = (value) => {
+
+            if (value === null) {
+                return 0
+            }
+
+            let dpi = 96;
+            let unit = value.match(/([a-z]+)/gi);
+            unit = unit ? unit[0] : "";
+            let val = parseFloat(value);
+            let rat;
+
+            // no unit - already pixes/user unit
+            if (!unit) {
+                return val;
+            }
+
+            switch (unit) {
+                case "in":
+                    rat = dpi;
+                    break;
+                case "pt":
+                    rat = (1 / 72) * 96;
+                    break;
+                case "cm":
+                    rat = (1 / 2.54) * 96;
+                    break;
+                case "mm":
+                    rat = ((1 / 2.54) * 96) / 10;
+                    break;
+                // just a default approximation
+                case "em":
+                case "rem":
+                    rat = 16;
+                    break;
+                default:
+                    rat = 1;
+            }
+            let valuePx = val * rat;
+            return +valuePx.toFixed(decimals);
+        };
+
+        // svg width and height attributes
+        let width = svg.getAttribute("width");
+        width = width ? translateUnitToPixel(width) : 300;
+        let height = svg.getAttribute("height");
+        height = width ? translateUnitToPixel(height) : 150;
+
+        let vB = svg.getAttribute("viewBox");
+        vB = vB
+            ? vB
+                .replace(/,/g, " ")
+                .split(" ")
+                .filter(Boolean)
+                .map((val) => {
+                    return +val;
+                })
+            : [];
+
+        let w = vB.length ? vB[2] : width;
+        let h = vB.length ? vB[3] : height;
+        let scaleX = w / 100;
+        let scaleY = h / 100;
+        let scalRoot = Math.sqrt((Math.pow(scaleX, 2) + Math.pow(scaleY, 2)) / 2);
+
+        let attsH = ["x", "width", "x1", "x2", "rx", "cx", "r"];
+        let attsV = ["y", "height", "y1", "y2", "ry", "cy"];
+
+        let atts = el.getAttributeNames();
+        atts.forEach((att) => {
+            let val = el.getAttribute(att);
+            let valAbs = val;
+            if (attsH.includes(att) || attsV.includes(att)) {
+                let scale = attsH.includes(att) ? scaleX : scaleY;
+                scale = att === "r" && w != h ? scalRoot : scale;
+                let unit = val.match(/([a-z|%]+)/gi);
+                unit = unit ? unit[0] : "";
+                if (val.includes("%")) {
+                    valAbs = parseFloat(val) * scale;
+                }
+
+                else {
+                    valAbs = translateUnitToPixel(val);
+                }
+                el.setAttribute(att, +valAbs);
+            }
+        });
+    };
+
+    svgElUnitsToPixel(el);
+
+    const getAtts = (attNames) => {
+        atts = {};
+        attNames.forEach(att => {
+            atts[att] = +el.getAttribute(att);
+        });
+        return atts
+    };
+
+    switch (type) {
+        case 'path':
+            d = el.getAttribute("d");
+            pathData = parsePathDataNormalized(d);
+            break;
+
+        case 'rect':
+            attNames = ['x', 'y', 'width', 'height', 'rx', 'ry'];
+            ({ x, y, width, height, rx, ry } = getAtts(attNames));
+
+            if (!rx && !ry) {
+                pathData = [
+                    { type: "M", values: [x, y] },
+                    { type: "L", values: [x + width, y] },
+                    { type: "L", values: [x + width, y + height] },
+                    { type: "L", values: [x, y + height] },
+                    { type: "Z", values: [] }
+                ];
+            } else {
+
+                if (rx > width / 2) {
+                    rx = width / 2;
+                }
+                if (ry > height / 2) {
+                    ry = height / 2;
+                }
+                pathData = [
+                    { type: "M", values: [x + rx, y] },
+                    { type: "L", values: [x + width - rx, y] },
+                    { type: "A", values: [rx, ry, 0, 0, 1, x + width, y + ry] },
+                    { type: "L", values: [x + width, y + height - ry] },
+                    { type: "A", values: [rx, ry, 0, 0, 1, x + width - rx, y + height] },
+                    { type: "L", values: [x + rx, y + height] },
+                    { type: "A", values: [rx, ry, 0, 0, 1, x, y + height - ry] },
+                    { type: "L", values: [x, y + ry] },
+                    { type: "A", values: [rx, ry, 0, 0, 1, x + rx, y] },
+                    { type: "Z", values: [] }
+                ];
+            }
+            break;
+
+        case 'circle':
+        case 'ellipse':
+
+            attNames = ['cx', 'cy', 'rx', 'ry', 'r'];
+            ({ cx, cy, r, rx, ry } = getAtts(attNames));
+
+            let isCircle = type === 'circle';
+
+            if (isCircle) {
+                r = r;
+                rx = r;
+                ry = r;
+            } else {
+                rx = rx ? rx : r;
+                ry = ry ? ry : r;
+            }
+
+            // simplified radii for cirecles
+            let rxS = isCircle && r>=1 ? 1 : rx;
+            let ryS = isCircle && r>=1 ? 1 : rx;
+
+            pathData = [
+                { type: "M", values: [cx + rx, cy] },
+                { type: "A", values: [rxS, ryS, 0, 1, 1, cx - rx, cy] },
+                { type: "A", values: [rxS, ryS, 0, 1, 1, cx + rx, cy] },
+            ];
+
+            break;
+        case 'line':
+            attNames = ['x1', 'y1', 'x2', 'y2'];
+            ({ x1, y1, x2, y2 } = getAtts(attNames));
+            pathData = [
+                { type: "M", values: [x1, y1] },
+                { type: "L", values: [x2, y2] }
+            ];
+            break;
+        case 'polygon':
+        case 'polyline':
+
+            let points = el.getAttribute('points').replaceAll(',', ' ').split(' ').filter(Boolean);
+
+            for (let i = 0; i < points.length; i += 2) {
+                pathData.push({
+                    type: (i === 0 ? "M" : "L"),
+                    values: [+points[i], +points[i + 1]]
+                });
+            }
+            if (type === 'polygon') {
+                pathData.push({
+                    type: "Z",
+                    values: []
+                });
+            }
+            break;
+    }
+
+    return stringify ? stringifyPathData(pathData) : pathData;
+
+}
+
+function pathDataRemoveColinear(pathData, {
+    tolerance = 1, 
+
+    flatBezierToLinetos = true
+}={}) {
 
     let pathDataN = [pathData[0]];
+
     let M = { x: pathData[0].values[0], y: pathData[0].values[1] };
     let p0 = M;
     let p = M;
     pathData[pathData.length - 1].type.toLowerCase() === 'z';
 
     for (let c = 1, l = pathData.length; c < l; c++) {
-        let comPrev = pathData[c - 1];
+
         let com = pathData[c];
         let comN = pathData[c + 1] || pathData[l - 1];
+
         let p1 = comN.type.toLowerCase() === 'z' ? M : { x: comN.values[comN.values.length - 2], y: comN.values[comN.values.length - 1] };
 
         let { type, values } = com;
@@ -3483,11 +3994,9 @@ function pathDataRemoveColinear(pathData, tolerance = 1, flatBezierToLinetos = t
 
         let area = getPolygonArea([p0, p, p1], true);
 
-        getSquareDistance(p0, p);
-        getSquareDistance(p, p1);
         let distSquare = getSquareDistance(p0, p1);
 
-        let distMax = distSquare / 200 * tolerance;
+        let distMax = distSquare ? distSquare / 333 * tolerance : 0;
 
         let isFlat = area < distMax;
         let isFlatBez = false;
@@ -3501,30 +4010,38 @@ function pathDataRemoveColinear(pathData, tolerance = 1, flatBezierToLinetos = t
             [{ x: values[0], y: values[1] }, { x: values[2], y: values[3] }] :
             (type === 'Q' ? [{ x: values[0], y: values[1] }] : []);
 
-            isFlatBez = checkBezierFlatness(p0, cpts, p);
-           // console.log();
+            isFlatBez = commandIsFlat([p0, ...cpts, p],{tolerance});
 
-            if (isFlatBez  && c < l - 1 && comPrev.type !== 'C') {
+            if (isFlatBez  && c < l - 1  ) {
                 type = "L";
                 com.type = "L";
                 com.values = valsL;
 
             }
-
         }
 
-        // update end point
-        p0 = p;
-
         // colinear – exclude arcs (as always =) as semicircles won't have an area
 
         if ( isFlat && c < l - 1 && (type === 'L' || (flatBezierToLinetos && isFlatBez)) ) {
-
             
+            /*
+            console.log(area, distMax );
+
+            if(p0.x === p.x && p0.y === p.y){
+
+            }
+
+            renderPoint(markers, p0, 'blue', '1.5%', '1')
+            renderPoint(markers, p, 'red', '1%', '1')
+            renderPoint(markers, p1, 'cyan', '0.5%', '1')
+            */
 
             continue;
         }
 
+        // update end point
+        p0 = p;
+
         if (type === 'M') {
             M = p;
             p0 = M;
@@ -3543,20 +4060,44 @@ function pathDataRemoveColinear(pathData, tolerance = 1, flatBezierToLinetos = t
 
 }
 
+function removeOrphanedM(pathData) {
+
+    let pathDataN = [];
+    for (let i = 0, l = pathData.length; i < l; i++) {
+        let com = pathData[i];
+        if (!com) continue;
+        let { type = null, values = [] } = com;
+        let comN = pathData[i + 1] ? pathData[i + 1] : null;
+        if ((type === 'M' || type === 'm')) {
+
+            if (!comN || (comN && (comN.type === 'Z' || comN.type === 'z'))) {
+                if(comN) i++;
+                continue
+            }
+        }
+        pathDataN.push(com);
+    }
+
+    return pathDataN;
+
+}
+
+/*
 // remove zero-length segments introduced by rounding
-function removeZeroLengthLinetos_post(pathData) {
-    let pathDataOpt = [];
+export function removeZeroLengthLinetos_post(pathData) {
+    let pathDataOpt = []
     pathData.forEach((com, i) => {
         let { type, values } = com;
         if (type === 'l' || type === 'v' || type === 'h') {
-            let hasLength = type === 'l' ? (values.join('') !== '00') : values[0] !== 0;
-            if (hasLength) pathDataOpt.push(com);
+            let hasLength = type === 'l' ? (values.join('') !== '00') : values[0] !== 0
+            if (hasLength) pathDataOpt.push(com)
         } else {
-            pathDataOpt.push(com);
+            pathDataOpt.push(com)
         }
-    });
+    })
     return pathDataOpt
 }
+*/
 
 function removeZeroLengthLinetos(pathData) {
 
@@ -3568,16 +4109,27 @@ function removeZeroLengthLinetos(pathData) {
 
     for (let c = 1, l = pathData.length; c < l; c++) {
         let com = pathData[c];
+        let comPrev = pathData[c-1]; 
+        let comNext = pathData[c+1] || null;
         let { type, values } = com;
 
-        let valsL = values.slice(-2);
-        p = { x: valsL[0], y: valsL[1] };
+        // zero length segments are simetimes used in icons for dots
+        let isDot = comPrev.type.toLowerCase() ==='m' && !comNext;
+
+        let valsLen = values.length;
+        p = { x: values[valsLen-2], y: values[valsLen-1] };
 
         // skip lineto
-        if (type === 'L' && p.x === p0.x && p.y === p0.y) {
+        if (!isDot && type === 'L' && p.x === p0.x && p.y === p0.y) {
             continue
         }
 
+        // skip minified zero length
+        if (!isDot && (type === 'l' || type === 'v' || type === 'h')) {
+            let noLength = type === 'l' ? (values.join('') === '00') : values[0] === 0;
+            if(noLength) continue
+        } 
+
         pathDataN.push(com);
         p0 = p;
     }
@@ -3675,7 +4227,7 @@ function optimizeClosePath(pathData, removeFinalLineto = true, reorder = true) {
         }
         // use top most command
         else {
-            indices = indices.sort((a, b) => +a.y.toFixed(1) - +b.y.toFixed(1) || a.x - b.x);
+            indices = indices.sort((a, b) => +a.y.toFixed(8) - +b.y.toFixed(8) || a.x - b.x);
             newIndex = indices[0].index;
         }
 
@@ -3683,7 +4235,7 @@ function optimizeClosePath(pathData, removeFinalLineto = true, reorder = true) {
         pathData = newIndex ? shiftSvgStartingPoint(pathData, newIndex) : pathData;
     }
 
-    M = { x: +pathData[0].values[0].toFixed(8), y: +pathData[0].values[1].toFixed(7) };
+    M = { x: +pathData[0].values[0].toFixed(8), y: +pathData[0].values[1].toFixed(8) };
 
     len = pathData.length;
 
@@ -3797,123 +4349,161 @@ function addClosePathLineto(pathData) {
     return pathData;
 }
 
-/**
- * reverse pathdata
- * make sure all command coordinates are absolute and
- * shorthands are converted to long notation
- */
-function reversePathData(pathData, {
-    arcToCubic = false,
-    quadraticToCubic = false,
-    toClockwise = false,
-    returnD = false
+function refineAdjacentExtremes(pathData, {
+    threshold = null, tolerance = 1
 } = {}) {
 
-    /**
-     * Add closing lineto:
-     * needed for path reversing or adding points
-     */
-    const addClosePathLineto = (pathData) => {
-        let closed = pathData[pathData.length - 1].type.toLowerCase() === "z";
-        let M = pathData[0];
-        let [x0, y0] = [M.values[0], M.values[1]];
-        let lastCom = closed ? pathData[pathData.length - 2] : pathData[pathData.length - 1];
-        let [xE, yE] = [lastCom.values[lastCom.values.length - 2], lastCom.values[lastCom.values.length - 1]];
-
-        if (closed && (x0 != xE || y0 != yE)) {
-
-            pathData.pop();
-            pathData.push(
-                {
-                    type: "L",
-                    values: [x0, y0]
-                },
-                {
-                    type: "Z",
-                    values: []
-                }
-            );
-        }
-        return pathData;
-    };
+    if (!threshold) {
+        let bb = getPathDataBBox(pathData);
+        threshold = (bb.width + bb.height) / 2 * 0.05;
+
+    }
+
+    let l = pathData.length;
+
+    for (let i = 0; i < l; i++) {
+        let com = pathData[i];
+        let { type, values, extreme, corner = false, dimA, p0, p } = com;
+        let comN = pathData[i + 1] ? pathData[i + 1] : null;
+        let comN2 = pathData[i + 2] ? pathData[i + 2] : null;
+
+        // check dist
+        let diff = comN ? getDistAv(p, comN.p) : Infinity;
+        let isCose = diff < threshold;
+
+        let diff2 = comN2 ? getDistAv(comN2.p, comN.p) : Infinity;
+        let isCose2 = diff2 < threshold;
+
+        // next is extreme
+        if (comN && type === 'C' && comN.type === 'C' && extreme && comN2 && comN2.extreme) {
+
+            if (isCose2 || isCose) {
+
+                // extrapolate
+                let comEx = getCombinedByDominant(comN, comN2, threshold, tolerance, false);
 
-    // helper to rearrange control points for all command types
-    const reverseControlPoints = (type, values) => {
-        let controlPoints = [];
-        let endPoints = [];
-        if (type !== "A") {
-            for (let p = 0; p < values.length; p += 2) {
-                controlPoints.push([values[p], values[p + 1]]);
+                if (comEx.length === 1) {
+
+                    pathData[i + 1] = null;
+                    comEx = comEx[0];
+
+                    pathData[i + 2].values = [comEx.cp1.x, comEx.cp1.y, comEx.cp2.x, comEx.cp2.y, comEx.p.x, comEx.p.y];
+                    pathData[i + 2].cp1 = comEx.cp1;
+                    pathData[i + 2].cp2 = comEx.cp2;
+                    pathData[i + 2].p0 = comEx.p0;
+                    pathData[i + 2].p = comEx.p;
+                    pathData[i + 2].extreme = comEx.extreme;
+
+                    i++;
+                    continue
+                }
             }
-            endPoints = controlPoints.pop();
-            controlPoints.reverse();
+
         }
-        // is arc
-        else {
 
-            let sweep = values[4] == 0 ? 1 : 0;
-            controlPoints = [values[0], values[1], values[2], values[3], sweep];
-            endPoints = [values[5], values[6]];
+        // short after extreme
+
+        if (comN && type === 'C' && comN.type === 'C' && extreme ) {
+
+            if (isCose) {
+
+                let dx1 = (com.cp1.x - comN.p0.x);
+                let dy1 = (com.cp1.y - comN.p0.y);
+
+                let horizontal = Math.abs(dy1) < Math.abs(dx1);
+
+                let pN = comN.p;
+                let ptI;
+                let t = 1;
+
+                let area0 = getPolygonArea([com.p0, com.p , comN.p]);
+                // cpts area
+                let area1 = getPolygonArea([com.p0, com.cp1, com.cp2, com.p]);
+
+                // sign change: is corner => skip
+                if ( (area0<0 && area1>0)  || (area0>0 && area1<0)) {
+
+                    continue;
+                }
+
+                
+                if (comN.extreme) {
+
+                    // extend cp2
+                    if (horizontal) {
+                        t = Math.abs(Math.abs(comN.cp2.x - comN.p.x) / Math.abs(com.cp2.x - com.p.x));
+                        t = Math.min(1, t);
+
+                        ptI = interpolate(comN.p, com.cp2, 1 + t);
+                        com.cp2.x = ptI.x;
+
+                    }
+                    else {
+
+                        t = Math.abs(Math.abs(comN.cp2.y - comN.p.y) / Math.abs(com.cp2.y - com.p.y));
+                        t = Math.min(1, t);
+
+                        ptI = interpolate(comN.p, com.cp2, 1 + t);
+                        com.cp2.y = ptI.y;
+                    }
+
+                    pathData[i + 1].values = [com.cp1.x, com.cp1.y, com.cp2.x, com.cp2.y, pN.x, pN.y];
+                    pathData[i + 1].cp1 = com.cp1;
+                    pathData[i + 1].cp2 = com.cp2;
+                    pathData[i + 1].p0 = com.p0;
+                    pathData[i + 1].p = pN;
+                    pathData[i + 1].extreme = true;
+
+                    // nullify 1st
+                    pathData[i] = null;
+                    continue
+
+                }
+
+            }
         }
-        return { controlPoints, endPoints };
-    };
 
-    // start compiling new path data
-    let pathDataNew = [];
+        /*
+        */
 
-    let closed =
-        pathData[pathData.length - 1].type.toLowerCase() === "z" ? true : false;
-    if (closed) {
-        // add lineto closing space between Z and M
-        pathData = addClosePathLineto(pathData);
-        // remove Z closepath
-        pathData.pop();
     }
 
-    // define last point as new M if path isn't closed
-    let valuesLast = pathData[pathData.length - 1].values;
-    let valuesLastL = valuesLast.length;
-    let M = closed
-        ? pathData[0]
-        : {
-            type: "M",
-            values: [valuesLast[valuesLastL - 2], valuesLast[valuesLastL - 1]]
-        };
-    // starting M stays the same – unless the path is not closed
-    pathDataNew.push(M);
+    // remove commands
+    pathData = pathData.filter(Boolean);
+    l = pathData.length;
 
-    // reverse path data command order for processing
-    pathData.reverse();
-    for (let i = 1; i < pathData.length; i++) {
-        let com = pathData[i];
-        let type = com.type;
-        let values = com.values;
-        let comPrev = pathData[i - 1];
-        let typePrev = comPrev.type;
-        let valuesPrev = comPrev.values;
+    /**
+     * refine closing commands
+     */
 
-        // get reversed control points and new end coordinates
-        let controlPointsPrev = reverseControlPoints(typePrev, valuesPrev).controlPoints;
-        let endPoints = reverseControlPoints(type, values).endPoints;
+    let closed = pathData[l - 1].type.toLowerCase() === 'z';
+    let lastIdx = closed ? l - 2 : l - 1;
+    let lastCom = pathData[lastIdx];
+    let penultimateCom = pathData[lastIdx - 1] || null;
+    let M = { x: pathData[0].values[0], y: pathData[0].values[1] };
 
-        // create new path data
-        let newValues = [];
-        newValues = [controlPointsPrev, endPoints].flat();
-        pathDataNew.push({
-            type: typePrev,
-            values: newValues.flat()
-        });
-    }
+    let dec = 8;
+    let lastVals = lastCom.values.slice(-2);
+    let isClosingTo = +lastVals[0].toFixed(dec) === +M.x.toFixed(dec) && +lastVals[1].toFixed(dec) === +M.y.toFixed(dec);
+    let fistExt = pathData[1].type === 'C' && pathData[1].extreme ? pathData[1] : null;
+
+    let diff = getDistAv(lastCom.p0, lastCom.p);
+    let isCose = diff < threshold;
+
+    if (penultimateCom && penultimateCom.type === 'C' && isCose && isClosingTo && fistExt) {
+
+        let comEx = getCombinedByDominant(penultimateCom, lastCom, threshold, tolerance, false);
+
+        if (comEx.length === 1) {
+            pathData[lastIdx - 1] = comEx[0];
+            pathData[lastIdx] = null;
+            pathData = pathData.filter(Boolean);
+        }
 
-    // add previously removed Z close path
-    if (closed) {
-        pathDataNew.push({
-            type: "z",
-            values: []
-        });
     }
 
-    return pathDataNew;
+    return pathData
+
 }
 
 function removeEmptySVGEls(svg) {
@@ -3938,7 +4528,7 @@ function cleanUpSVG(svgMarkup, {
     .querySelector("svg");
   
   
-  let allowed=['viewBox', 'xmlns', 'width', 'height', 'id', 'class'];
+  let allowed=['viewBox', 'xmlns', 'width', 'height', 'id', 'class', 'fill', 'stroke', 'stroke-width', 'stroke-linecap', 'stroke-linejoin'];
   removeExcludedAttribues(svg, allowed);
   
   let removeEls = ['metadata', 'script'];
@@ -4009,6 +4599,156 @@ function stringifySVG(svg){
   return markup
 }
 
+function refineRoundedCorners(pathData, {
+    threshold = 0,
+    tolerance = 1
+} = {}) {
+
+    let l = pathData.length;
+
+    // add fist command
+    let pathDataN = [pathData[0]];
+
+    let isClosed = pathData[l - 1].type.toLowerCase() === 'z';
+    let lastOff = isClosed ? 2 : 1;
+
+    let comLast = pathData[l - lastOff];
+    let lastIsLine = comLast.type === 'L';
+    let lastIsBez = comLast.type === 'C';
+    let firstIsLine = pathData[1].type === 'L';
+    let firstIsBez = pathData[1].type === 'C';
+
+    let normalizeClose = isClosed && firstIsBez;
+
+    // normalize closepath to lineto
+    if (normalizeClose) {
+        pathData[l - 1].values = pathData[0].values;
+        pathData[l - 1].type = 'L';
+        lastIsLine = true;
+    }
+
+    for (let i = 1; i < l; i++) {
+        let com = pathData[i];
+        let { type } = com;
+        let comN = pathData[i + 1] ? pathData[i + 1] : null;
+
+        // search small cubic segments enclosed by linetos
+        if ((type === 'L' && comN && comN.type === 'C') ||
+            (type === 'C' && comN && comN.type === 'L')
+
+        ) {
+            let comL0 = com;
+            let comL1 = null;
+            let comBez = [];
+            let offset = 0;
+
+            // start to end
+            if (i === 1 && firstIsBez && lastIsLine) {
+                comBez = [pathData[1]];
+                comL0 = pathData[l - 1];
+                comL1 = comN;
+
+            }
+
+            // closing corner to start
+            if (isClosed && lastIsBez && firstIsLine && i === l - lastOff - 1) {
+                comL1 = pathData[1];
+                comBez = [pathData[l - lastOff]];
+
+            }
+
+            for (let j = i + 1; j < l; j++) {
+                let comN = pathData[j] ? pathData[j] : null;
+                let comPrev = pathData[j - 1];
+
+                if (comPrev.type === 'C') {
+                    comBez.push(comPrev);
+                }
+
+                if (comN.type === 'L' && comPrev.type === 'C') {
+                    comL1 = comN;
+                    break;
+                }
+                offset++;
+            }
+
+            if (comL1) {
+
+                // linetos
+                let len1 = getDistAv(comL0.p0, comL0.p);
+                let len2 = getDistAv(comL1.p0, comL1.p);
+
+                // bezier
+
+                let comBezLen = comBez.length;
+                let len3 = getDistAv(comBez[0].p0, comBez[comBezLen - 1].p);
+
+                // check concaveness by area sign change
+                let area1 = getPolygonArea([comL0.p0, comL0.p, comL1.p0, comL1.p], false);
+                let area2 = getPolygonArea([comBez[0].p0, comBez[0].cp1, comBez[0].cp2, comBez[0].p], false);
+
+                let signChange = (area1 < 0 && area2 > 0) || (area1 > 0 && area2 < 0);
+
+                if (comBez && !signChange && len3 < threshold && len1 > len3 && len2 > len3) {
+
+                    let ptQ = checkLineIntersection(comL0.p0, comL0.p, comL1.p0, comL1.p, false);
+                    if (ptQ) {
+
+                        /*
+                        let dist1 = getDistAv(ptQ, comL0.p)
+                        let dist2 = getDistAv(ptQ, comL1.p0)
+                        let diff = Math.abs(dist1-dist2)
+                        let rat =  diff/Math.max(dist1, dist2)
+                        console.log('rat', rat);
+                        */
+
+                        /*
+                        // adjust curve start and end to meet original
+                        let t = 1
+
+                        let p0_2 = pointAtT([ptQ, comL0.p], t)
+
+                        comL0.p = p0_2
+                        comL0.values = [p0_2.x, p0_2.y]
+
+                        let p_2 = pointAtT([ptQ, comL1.p0], t)
+
+                        comL1.p0 = p_2
+
+                        */
+
+                        let comQ = { type: 'Q', values: [ptQ.x, ptQ.y, comL1.p0.x, comL1.p0.y] };
+                        comQ.p0 = comL0.p;
+                        comQ.cp1 = ptQ;
+                        comQ.p = comL1.p0;
+
+                        // add quadratic command
+                        pathDataN.push(comL0, comQ);
+                        i += offset;
+                        continue;
+                    }
+                }
+            }
+        }
+
+        // skip last lineto
+        if (normalizeClose && i === l - 1 && type === 'L') {
+            continue
+        }
+
+        pathDataN.push(com);
+
+    }
+
+    // revert close path normalization
+    if (normalizeClose) {
+        pathDataN.push({ type: 'Z', values: [] });
+    }
+
+    return pathDataN;
+
+}
+
 function svgPathSimplify(input = '', {
 
     // return svg markup or object
@@ -4027,15 +4767,20 @@ function svgPathSimplify(input = '', {
 
     simplifyBezier = true,
     optimizeOrder = true,
+    removeZeroLength = true,
     removeColinear = true,
     flatBezierToLinetos = true,
     revertToQuadratics = true,
 
+    refineExtremes = true,
+    refineCorners = false, 
+
     keepExtremes = true,
     keepCorners = true,
     extrapolateDominant = true,
     keepInflections = false,
     addExtremes = false,
+    removeOrphanSubpaths = false,
 
     // svg path optimizations
     decimals = 3,
@@ -4049,6 +4794,7 @@ function svgPathSimplify(input = '', {
     mergePaths = false,
     removeHidden = true,
     removeUnused = true,
+    shapesToPaths = true,
 
 } = {}) {
 
@@ -4073,24 +4819,43 @@ function svgPathSimplify(input = '', {
      */
 
     // original size
-    svgSize = new Blob([input]).size;
 
-    // single path
+    svgSize = input.length;
+
+    // mode:0 – single path
     if (!mode) {
         if (inputType === 'pathDataString') {
             d = input;
         } else if (inputType === 'polyString') {
             d = 'M' + input;
         }
+        else if (inputType === 'pathData') {
+            d = input;
+
+            // stringify to compare lengths
+
+            let dStr = d.map(com=>{return `${com.type} ${com.values.join(' ')}`}).join(' ') ;
+            svgSize = dStr.length;
+
+        }
+
         paths.push({ d, el: null });
     }
-    // process svg
+    // mode:1 – process complete svg DOM
     else {
 
         let returnDom = true;
         svg = cleanUpSVG(input, { returnDom, removeHidden, removeUnused }
         );
 
+        if (shapesToPaths) {
+            let shapes = svg.querySelectorAll('polygon, polyline, line, rect, circle, ellipse');
+            shapes.forEach(shape => {
+                let path = shapeElToPath(shape);
+                shape.replaceWith(path);
+            });
+        }
+
         // collect paths
         let pathEls = svg.querySelectorAll('path');
         pathEls.forEach(path => {
@@ -4100,6 +4865,7 @@ function svgPathSimplify(input = '', {
 
     /**
      * process all paths
+     * try simplifications and removals
      */
 
     // SVG optimization options
@@ -4112,34 +4878,35 @@ function svgPathSimplify(input = '', {
     // combinded path data for SVGs with mergePaths enabled
     let pathData_merged = [];
 
-    paths.forEach(path => {
-        let { d, el } = path;
+    for (let i = 0, l = paths.length; l && i < l; i++) {
 
-        let pathDataO = parsePathDataNormalized(d, { quadraticToCubic, toAbsolute, arcToCubic });
+        let path = paths[i];
+        let { d, el } = path;
 
-        // create clone for fallback
-        let pathData = JSON.parse(JSON.stringify(pathDataO));
+        let pathData = parsePathDataNormalized(d, { quadraticToCubic, toAbsolute, arcToCubic });
 
         // count commands for evaluation
-        let comCount = pathDataO.length;
+        let comCount = pathData.length;
+
+        if (removeOrphanSubpaths) pathData = removeOrphanedM(pathData);
 
         /**
          * get sub paths
          */
         let subPathArr = splitSubpaths(pathData);
+        let lenSub = subPathArr.length;
 
         // cleaned up pathData
-        let pathDataArrN = [];
 
-        for (let i = 0, l = subPathArr.length; i < l; i++) {
+        // reset array
+        let pathDataFlat = [];
 
-            let pathDataSub = subPathArr[i];
+        for (let i = 0; i < lenSub; i++) {
 
-            // try simplification in reversed order
-            if (reverse) pathDataSub = reversePathData(pathDataSub);
+            let pathDataSub = subPathArr[i];
 
             // remove zero length linetos
-            if (removeColinear) pathDataSub = removeZeroLengthLinetos(pathDataSub);
+            if (removeColinear || removeZeroLength) pathDataSub = removeZeroLengthLinetos(pathDataSub);
 
             // add extremes
 
@@ -4149,50 +4916,63 @@ function svgPathSimplify(input = '', {
             // sort to top left
             if (optimizeOrder) pathDataSub = pathDataToTopLeft(pathDataSub);
 
-            // remove colinear/flat
-            if (removeColinear) pathDataSub = pathDataRemoveColinear(pathDataSub, tolerance, flatBezierToLinetos);
+            // Preprocessing: remove colinear - ignore flat beziers (removed later)
+            if (removeColinear) pathDataSub = pathDataRemoveColinear(pathDataSub, { tolerance, flatBezierToLinetos: false });
 
             // analyze pathdata to add info about signicant properties such as extremes, corners
             let pathDataPlus = analyzePathData(pathDataSub);
 
             // simplify beziers
             let { pathData, bb, dimA } = pathDataPlus;
-
             pathData = simplifyBezier ? simplifyPathDataCubic(pathData, { simplifyBezier, keepInflections, keepExtremes, keepCorners, extrapolateDominant, revertToQuadratics, tolerance, reverse }) : pathData;
 
+            // refine extremes
+            if (refineExtremes) {
+                let thresholdEx = (bb.width + bb.height) / 2 * 0.05;
+                pathData = refineAdjacentExtremes(pathData, { threshold: thresholdEx, tolerance });
+            }
+
             // cubic to arcs
             if (cubicToArc) {
 
-                let thresh = 3;
+                let thresh = 1;
 
-                pathData.forEach((com, c) => {
+                for(let c=0, l=pathData.length; c<l; c++){
+                    let com = pathData[c];
                     let { type, values, p0, cp1 = null, cp2 = null, p = null } = com;
                     if (type === 'C') {
 
                         let comA = cubicCommandToArc(p0, cp1, cp2, p, thresh);
                         if (comA.isArc) pathData[c] = comA.com;
-
                     }
-                });
+                }
 
                 // combine adjacent cubics
                 pathData = combineArcs(pathData);
 
             }
 
+            // post processing: remove flat beziers
+            if (removeColinear && flatBezierToLinetos) {
+                pathData = pathDataRemoveColinear(pathData, { tolerance, flatBezierToLinetos });
+            }
+
+            // refine corners
+            if(refineCorners){
+                let threshold = (bb.width + bb.height) / 2 * 0.1;
+                pathData = refineRoundedCorners(pathData, { threshold, tolerance });
+
+            }
+
             // simplify to quadratics
             if (revertToQuadratics) {
-                pathData.forEach((com, c) => {
+                for(let c=0, l=pathData.length; c<l; c++){
+                    let com = pathData[c];
                     let { type, values, p0, cp1 = null, cp2 = null, p = null } = com;
                     if (type === 'C') {
 
                         let comQ = revertCubicQuadratic(p0, cp1, cp2, p);
                         if (comQ.type === 'Q') {
-                            /*
-                            comQ.p0 = com.p0
-                            comQ.cp1 = {x:comQ.values[0], y:comQ.values[1]}
-                            comQ.p = com.p
-                            */
                             comQ.extreme = com.extreme;
                             comQ.corner = com.corner;
                             comQ.dimA = com.dimA;
@@ -4200,20 +4980,25 @@ function svgPathSimplify(input = '', {
                             pathData[c] = comQ;
                         }
                     }
-                });
+                }
             }
 
             // optimize close path
             if (optimizeOrder) pathData = optimizeClosePath(pathData);
 
-            // poly
-
             // update
-            pathDataArrN.push(pathData);
+            pathDataFlat.push(...pathData);
+
         }
 
         // flatten compound paths 
-        pathData = pathDataArrN.flat();
+        pathData = pathDataFlat;
+
+        if (autoAccuracy) {
+            decimals = detectAccuracy(pathData);
+            pathOptions.decimals = decimals;
+
+        }
 
         // collect for merged svg paths 
         if (el && mergePaths) {
@@ -4222,24 +5007,19 @@ function svgPathSimplify(input = '', {
         // single output
         else {
 
-            /**
-             * detect accuracy
-             */
-            if (autoAccuracy) {
-                decimals = detectAccuracy(pathData);
-            }
-
             // optimize path data
             pathData = convertPathData(pathData, pathOptions);
 
             // remove zero-length segments introduced by rounding
-            pathData = removeZeroLengthLinetos_post(pathData);
+            pathData = removeZeroLengthLinetos(pathData);
 
             // compare command count
             let comCountS = pathData.length;
 
             let dOpt = pathDataToD(pathData, minifyD);
-            svgSizeOpt = new Blob([dOpt]).size;
+
+            svgSizeOpt = dOpt.length;
+
             compression = +(100 / svgSize * (svgSizeOpt)).toFixed(2);
 
             path.d = dOpt;
@@ -4255,19 +5035,19 @@ function svgPathSimplify(input = '', {
             // apply new path for svgs
             if (el) el.setAttribute('d', dOpt);
         }
-    });
-
+    }
     /**
      *  stringify new SVG
      */
     if (mode) {
 
         if (pathData_merged.length) {
+
             // optimize path data
             let pathData = convertPathData(pathData_merged, pathOptions);
 
             // remove zero-length segments introduced by rounding
-            pathData = removeZeroLengthLinetos_post(pathData);
+            pathData = removeZeroLengthLinetos(pathData);
 
             let dOpt = pathDataToD(pathData, minifyD);
 
@@ -4285,7 +5065,8 @@ function svgPathSimplify(input = '', {
         }
 
         svg = stringifySVG(svg);
-        svgSizeOpt = new Blob([svg]).size;
+
+        svgSizeOpt = svg.length;
 
         compression = +(100 / svgSize * (svgSizeOpt)).toFixed(2);
 
@@ -4306,109 +5087,16 @@ function svgPathSimplify(input = '', {
 
 }
 
-function simplifyPathDataCubic(pathData, {
-    keepExtremes = true,
-    keepInflections = true,
-    keepCorners = true,
-    extrapolateDominant = true,
-    tolerance = 1,
-    reverse = false
-} = {}) {
-
-    let pathDataN = [pathData[0]];
-
-    for (let i = 2, l = pathData.length; l && i <= l; i++) {
-        let com = pathData[i - 1];
-        let comN = i < l ? pathData[i] : null;
-        let typeN = comN?.type || null;
-
-        let isDirChange = com?.directionChange || null;
-        let isDirChangeN = comN?.directionChange || null;
-
-        let { type, values, p0, p, cp1 = null, cp2 = null, extreme = false, corner = false, dimA = 0 } = com;
-
-        // next is also cubic
-        if (type === 'C' && typeN === 'C') {
-
-            // cannot be combined as crossing extremes or corners
-            if (
-                (keepInflections && isDirChangeN) ||
-                (keepCorners && corner) ||
-                (!isDirChange && keepExtremes && extreme)
-            ) {
-
-                pathDataN.push(com);
-            }
-
-            // try simplification
-            else {
-
-                let combined = combineCubicPairs(com, comN, extrapolateDominant, tolerance);
-                let error = 0;
-
-                // combining successful! try next segment
-                if (combined.length === 1) {
-                    com = combined[0];
-                    let offset = 1;
-
-                    // add cumulative error to prevent distortions
-                    error += com.error;
-
-                    // find next candidates
-                    for (let n = i + 1; error < tolerance && n < l; n++) {
-                        let comN = pathData[n];
-                        if (comN.type !== 'C' ||
-                            (
-                                (keepInflections && comN.directionChange) ||
-                                (keepCorners && com.corner) ||
-                                (keepExtremes && com.extreme)
-                            )
-                        ) {
-                            break
-                        }
-
-                        let combined = combineCubicPairs(com, comN, extrapolateDominant, tolerance);
-                        if (combined.length === 1) {
-                            // add cumulative error to prevent distortions
-
-                            error += combined[0].error * 0.5;
-                            offset++;
-                        }
-                        com = combined[0];
-                    }
-
-                    pathDataN.push(com);
-
-                    if (i < l) {
-                        i += offset;
-                    }
-
-                } else {
-                    pathDataN.push(com);
-                }
-            }
-
-        } // end of bezier command
-
-        // other commands
-        else {
-            pathDataN.push(com);
-        }
-
-    } // end command loop
-
-    // reverse back
-    if (reverse) pathDataN = reversePathData(pathDataN);
-
-    return pathDataN
-}
-
 const {
     abs, acos, asin, atan, atan2, ceil, cos, exp, floor,
     log, hypot, max, min, pow, random, round, sin, sqrt, tan, PI
 } = Math;
 
-// just for visual debugging
+/*
+import {XMLSerializerPoly, DOMParserPoly} from './dom_polyfills';
+export {XMLSerializerPoly as XMLSerializerPoly};
+export {DOMParserPoly as DOMParserPoly};
+*/
 
 // IIFE 
 if (typeof window !== 'undefined') {