Skirtingų algoritmų taikymo ypatumai linijų generalizavimo procedūrose

Abstract

The article analyses the differences between some well- known line generalisation algorithms Douglas-Peukher and Lang and compares with other technological solution called by the author “modified Töpfer” algorithm procedures. The Töpfer algorithm was used in single object elimination functions but has not been widely by applied for line generalisation in practice. The experiment of line generalisation by three algorithms was made. Calculation of entropy was done as a result of the experiment.