1. Barequet, G., Chen, D.Z., Daescu, O., Goodrich, M.T., Snoeyink, J.: Efficiently Approximating Polygonal Paths in Three and Higher Dimensions. Proc. of the 14th ACM Symp. on Comp. Geometry (1998, to appear).
2. Chan, W.S., Chin, F.: Approximation of polygonal curves with minimum number of line segments or minimum error. International Journal of Computational Geometry and Applications 6 (1996) 59–77.
3. Chen, D.Z., Chen, W., Wada, K., Kawaguchi, K.: Parallel algorithms for partitioning sorted sets and related problems. Proc. of the 4th Annual European Symp. on Algorithms (1996) 234–245.
4. Eu, D., Toussaint, G.T.: On approximation polygonal curves in two and three dimensions. CVGIP: Graphical Models and Image Processing 56 (1994) 231–246.
5. Goodrich, M.T.: Efficient piecewise-linear function approximation using the uniform metric. Proc. 9th Annual ACM Symp. on Computational Geometry (1994) 322–331.