- Visvalingam, Whyatt: Line generalisation by repeated elimination of the smallest area
- Hershberger, Snoeyink: Speeding Up the Douglas-Peucker Line-Simplification Algorithm
- Wu, da Silva, Márquez: The Douglas-peucker algorithm: sufficiency conditions for non-self-intersections
- Wu, Márquez: A non-self-intersection Douglas-Peucker Algorithm
- Qingsheng, Brandenberger, Hurni: A progressive line simplification algorithm
- Ramer–Douglas–Peucker algorithm
- Jason Davies: Line Simplification
- Mike Bostock: Line Simplification
- Polyline Decimation (any Dim)
- Elmar de Koning: Polyline Simplification - contains description of psimpl that provides a variety of simplification algorithms, including the popular Douglas-Peucker approximation
- Simplify.js - JavaScript polyline simplification library that uses a combination of Douglas-Peucker and Radial Distance algorithms
- AnnaMag/Line-simplification - implementation of the Douglas-Peucker algorithm with an option of running Radial Distance prior to the DP algorithm
- topojson-simplify - filter and simplify geometries while preserving topology for smaller files and faster rendering
- Random point routine
- Jenks simplification
- Lang simplification
- Zhao-Saalfeld simplification
- Reumann–Witkam
- Opheim simplification