Simplification of Lines Containing Fixed Points Using the Douglas-Peucker Algorithm

Abstract

The paper presents the results of simplification by Douglas-Peucker algorithm of lines containing fixed points (points which are not allowed to be removed). The investigations were performed both with lines which were first split in segments between fixed points with consecutive simplification of all individual segments as well as on the integral (i.e. without a splitting) lines with fixed points.

Keywords

• line simplification, Douglas-Peucker algorithm, fixed point, visualization, logical consistency, positional accuracy