Content deleted Content added
→top: ordinary caps |
→See also: per WP:SEEALSO, this section must not contain red links; reorganise accordingly |
||
Line 65:
Using (fully- or semi-)[[Dynamic convex hull]] data structures, the simplification performed by the algorithm can be accomplished in <math>O(n\log n)</math> time <ref>{{cite techreport |last1 = Hershberger |first1 = John |first2 = Jack |last2 = Snoeyink |title = Speeding Up the Douglas-Peucker Line-Simplification Algorithm |date = 1992 | url = http://www.bowdoin.edu/~ltoma/teaching/cs350/spring06/Lecture-Handouts/hershberger92speeding.pdf}}</ref>.
==Similar
* [[Curve fitting]]▼
Alternative algorithms for line simplification include:
Line 74 ⟶ 73:
* [[Lang simplification algorithm|Lang simplification]]
* [[Zhao Saalfeld algorithm|Zhao-Saalfeld]]
== See also ==
▲* [[Curve fitting]]
== Further reading ==
|