Publisher
Springer International Publishing
Reference27 articles.
1. Abam, M.A., de Berg, M., Hachenberger, P., Zarei, A.: Streaming algorithms for line simplification. Discret. Comput. Geom. 43(3), 497–515 (2010)
2. Agarwal, P.K., Har-Peled, S., Mustafa, N., Wang, Y.: Near linear time approximation algorithm for curve simplification. Algorithmica 42(3–4), 203–219 (2005)
3. Barequet, G., Chen, D.Z., Daescu, O., Goodrich, M.T., Snoeyink, J.: Efficiently approximating polygonal paths in three and higher dimensions. Algorithmica 33(2), 150–167 (2002)
4. de Berg, M., van Kreveld, M., Schirra, S.: Topologically correct subdivision simplification using the bandwidth criterion. Cartogr. Geogr. Inf. Syst. 25(4), 243–257 (1998)
5. Buzer, L.: Optimal simplification of polygonal chain for rendering. In: Proceedings of 23rd Annual ACM Symposium on Computational Geometry (SoCG), pp. 168–174 (2007)