Overload | Description |
---|---|
Simplify(Single) | Returns a simplified version of this sequence of points using an improved version Douglas and Peucker algorithm (uses path hulls) which improves the worst case running time from O(n^2) to O(n * log2(n)). Topology is preserved. |
Simplify(IList<NPointF>,Single) | Returns a simplified version of this sequence of points using an improved version Douglas and Peucker algorithm (uses path hulls) which improves the worst case running time from O(n^2) to O(n * log2(n)). Topology is preserved. |