Comparative analysis of algorithms for simplification of polygons and broken lines
Dmytro Kotsur · Optoelectronic Information-Power Technologies · 2019
The article deals with the analysis of the existing algorithms for polygons and polylines simplification. A comparative analysis of the complexities of the algorithms has been carried out. The performed experiments allowed us to measure the empirical execution time of the algorithms and to establish the dependence of the simplicity degree on the tolerable error of the algorithm.