1. Chan, W.S., Chin, F.: Approximation of polygonal curves with minimum number of line segments or minimum error. Int. J. Comput. Geom. Appl. 6(01), 59–77 (1996)
2. Cole, R.: Slowing down sorting networks to obtain faster sorting algorithm. In: 25th Annual Symposium on Foundations of Computer Science 1984, pp. 255–260. IEEE (1984)
3. Douglas, D.H., Peucker, T.K.: Algorithms for the reduction of the number of points required to represent a digitized line or its caricature. Cartogr. Int. J. Geogr. Inf. Geovisualization 10(2), 112–122 (1973)
4. Lecture Notes in Computer Science;GN Frederickson,1991
5. Gonzalez, T.F.: Clustering to minimize the maximum intercluster distance. Theor. Comput. Sci. 38, 293–306 (1985)