Answers are grounded in this paper and cite their sources.
A statistical model is introduced and then, based on it, a piecewise linear approximation algorithm of linear computational complexity is presented. The advantages of the algorithm are proved experimentally in small sample cases and theoretically in the large sample case. The paper is closed with a discussion on some possible extensions.
No takes yet. Share an insight, caveat, or question.
Lide Wu (1984) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: