This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Two Algorithms for Piecewise-Linear Continuous Approximation of Functions of One Variable
April 1974 (vol. 23 no. 4)
pp. 445-448
I. Tomek, Department of Medicine, University of Alberta
Two simple heuristic algorithms for piecewise-linear approximation of functions of one variable are described. Both use a limit on the absolute value of error and strive to minimize the number of approximating segnents subject to the error limit. The first algorithm is faster and gives satisfactory results for sufficiently smooth functions. The second algorithm is not as fast but gives better approximations for less well-behaved functions. The two algorithms are ilustrated by several examples.
Index Terms:
Heuristic algorithms, length segments, piecewise-linear continuous approximation.
Citation:
I. Tomek, "Two Algorithms for Piecewise-Linear Continuous Approximation of Functions of One Variable," IEEE Transactions on Computers, vol. 23, no. 4, pp. 445-448, April 1974, doi:10.1109/T-C.1974.223961
Usage of this product signifies your acceptance of the Terms of Use.