You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
I haven't studied the Douglas-Peucker algorithm in details, but if I execute the simplification algorithm multiple times, the polyline reduces/smoothes more and more, although the algorithm tolerance is still unchanged.
while iterating through all the polyline's points, only the situation around the current point is evaluated. The algorithm doesn't iterate through the polyline in reverse direction, so possible simplifications aren't found in a single run.
To be sure that all simplifications are found and applied, one has to restart the iteration after each changed point.
Look, if I run about 20 simplification iterations with a tolerance of 1 meter on a polyline, that is about 43km long and has roughly 5k points, then I end up having 14 points with a distance of a couple of kilometers each.
Hi there,
I haven't studied the Douglas-Peucker algorithm in details, but if I execute the simplification algorithm multiple times, the polyline reduces/smoothes more and more, although the algorithm tolerance is still unchanged.
Shouldn't it be constant?
The text was updated successfully, but these errors were encountered: