Skoči na glavni sadržaj

Izvorni znanstveni članak

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

Nada Vučetić
Svetozar Petrović
Ante Strunje


Puni tekst: hrvatski pdf 490 Kb

str. 75-81

preuzimanja: 696

citiraj

Puni tekst: engleski pdf 490 Kb

str. 74-81

preuzimanja: 795

citiraj


Sažetak

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.

Ključne riječi

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

Hrčak ID:

13117

URI

https://hrcak.srce.hr/13117

Datum izdavanja:

20.6.2007.

Podaci na drugim jezicima: hrvatski

Posjeta: 2.513 *