Proper noun
the Douglas-Peucker algorithm (computing theory) An algorithm that examines a curve composed of line segments (i.e. a polyline) and attempts to find a similar curve with fewer points.