Ramer-Douglas-Peucker algorithm

From Wiktionary, the free dictionary
Jump to navigation Jump to search

English[edit]

Etymology[edit]

Named after Urs Ramer, David Douglas and Thomas Peucker.

Proper noun[edit]

the Douglas-Peucker algorithm

  1. (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.
Retrieved from "https://en.wiktionary.org/w/index.php?title=Ramer-Douglas-Peucker_algorithm&oldid=77963610"