Answers are grounded in this paper and cite their sources.
A simple algorithm is described for obtaining approximations to a given function, by means of straight line segments, with any pre-assigned accuracy. The approximation obtained is a best one in the minimax sense. Secondly, given the number of segments k another algorithm finds the best approximation by means of k segments.
No takes yet. Share an insight, caveat, or question.
G. M. Phillips (1968) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: