diff --git a/src/path/PathFitter.js b/src/path/PathFitter.js
index 6aab8742..809e7bc5 100644
--- a/src/path/PathFitter.js
+++ b/src/path/PathFitter.js
@@ -31,7 +31,6 @@ var PathFitter = Base.extend({
 				prev = point;
 			}
 		}
-		this.points = this.reducePoints(this.points, 1);
 		this.error = error;
 		this.iterationError = error * error;
 	},
@@ -47,28 +46,6 @@ var PathFitter = Base.extend({
 		return this.segments;
 	},
 
-	// Douglas–Peucker algorithm
-	reducePoints: function(points, tolerance) {
-		var line = new Line(points[0], points[points.length - 1], false);
-		var maxDistance = 0,
-			maxIndex = 0;
-		for (var i = 1; i < points.length - 1; i++) {
-			var distance = line.getDistance(points[i]);
-			if(distance > maxDistance) {
-				maxDistance = distance;
-				maxIndex = i;
-			}
-		}
-		if (maxDistance >= tolerance) {
-			var pts = this.reducePoints(
-					points.slice(0, maxIndex + 1), tolerance);
-			pts.pop();
-			return pts.concat(this.reducePoints(
-					points.slice(maxIndex, points.length), tolerance));
-		}
-		return [points[0], points[points.length - 1]];
-	},
-
 	// Fit a Bezier curve to a (sub)set of digitized points
 	fitCubic: function(first, last, tHat1, tHat2) {
 		//	Use heuristic if region only has two points in it