Reduces the number of vertices in a polyline or polygon. This tool uses an iterative end-point fit algorithm also known as the Ramer-Douglas-Peucker algorithm to reduce the number of points in a curve. Given a curve composed of line segments, the algorithm produces a simplified curve that preserves the shape of the original one up to a given tolerance.
- An ordered set of points that form a polyline or polygon. Suitable input can be generated for example with boundary detection.
- The maximum allowed distance between an original vertex and the simplified curve.
- A subset of input vertices that can be connected to form the same shape.