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

Nada Vučetić, Svetozar Petrović, Ante Strunje

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

Full Text:

PDF PDF (Hrvatski)


Bookmark and Share


Copyright (c) 2013 Nada Vučetić, Svetozar Petrović, Ante Strunje

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

The Kartografija i Geoinformacije (Cartography and Geoinformation) journal publishes scientific and professional papers from cartography and other fields (geography, geodesy, geology, forestry, agronomy, history, architecture, pedagogy ...) if they are related to cartography and geoinformation.
We invite authors of papers or contributions to submit text in English (and Croatian if possible) using this site.
The Croatian Cartographic Society (CCS) does not necessarily endorse any opinions or recommendations made in article, review or extract contained in this journal nor do they necessarily represent CCS policy.
© CCS, www.kartografija.hr. Journal content is published under CC BY-SA licence.