Line Simplification

Line simplification is the process of taking a line/curve as represented by a list of points and reducing the number of points needed to accurately represent the given line.

Parameters

$n$ : number of points representing the curve/line initially

Filters

Computational Model

Randomization

Approximation

Algorithms Table

Displaying 6 of 6 algorithms


Zhao-Saalfeld	1997	$O(n)$	$O(n)$
Visvalingam–Whyatt	1993	$O(n^2)$	$O(n)$
Opheim simplification	1981	$O(n)$	$O(1)$
Reumann–Witkam	1974	$O(n)$	$O(1)$
Ramer–Douglas–Peucker algorithm	1972	$O(n^2)$	$O(n)$
Lang simplification	1969	$O(n)$	$O(1)$

Reductions Table

Insuffient Data to display table

Other relevant algorithms