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. ; U radu se daju rezultati pojednostavljenja Douglas-Peuckerovim algoritmom linija s fiksnim točkama (točkama koje ne smiju biti uklonjene). Ispitivanja su provedena kako na linijama koje su prvo razlomljene na segmente od jedne do druge fiksne točke pa potom svaki taj segment posebno pojednostavljen, tako i na cijelim (nerazlomljenim) linijama s fiksnim točkama.
Simplification of Lines Containing Fixed Points Using the Douglas-Peucker Algorithm ; Pojednostavljenje linija s fiksnim točkama Douglas-Peuckerovim algoritmom
2007-12-30
Kartografija i Geoinformacije; Vol 6, No 7 spec. (2007); 74-81 ; Kartografija i geoinformacije (Cartography and Geoinformation); Vol 6, No 7 spec. (2007); 74-81 ; 1848-0713 ; 1333-896X
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch , Kroatisch
DDC: | 629 |
Trans Tech Publications | 2014
|Online Contents | 1996
Douglas. Douglas Ambassador monoplane
Engineering Index Backfile | 1928
Sofijskata okolovrastna zhp linija
IuD Bahn | 2010
|