ACM Home Page
Please provide us with feedback. Feedback
Algorithm 510: Piecewise Linear Approximations to Tabulated Data [E2]
Full text PdfPdf (241 KB)
Source ACM Transactions on Mathematical Software (TOMS) archive
Volume 2 ,  Issue 4  (December 1976) table of contents
Pages: 388 - 391  
Year of Publication: 1976
ISSN:0098-3500
Author
D. G. Wilson  Union Carbide Corp., Nuclear Division, P.O. Box Y, Oak Ridge, TN
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 6,   Downloads (12 Months): 38,   Citation Count: 0
Additional Information:

appendices and supplements   references   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/355705.355714
What is a DOI?

APPENDICES and SUPPLEMENTS
piecewise linear approximation of given data points The approximant need not be continuous, and distinct tolerances may be specified for each data point
Gams: K4


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
WILSON, D.G. Piecewise linear approximations of fewest line segments. Proe. AFIPS 1972 SJCC, Vol. 40, AFIPS Press, Montvale, N.J., pp. 187-198.


Peer to Peer - Readers of this Article have also read: