Structs

Performs a greedy piecewise linear regression (PLR) in an online fashion. This approach uses constant time for each call to process as well as constant space. Note that, due to the greedy nature of the algorithm, more regression segments may be created than strictly needed. For PLR with a minimal number of segments, please see OptimalPLR.

Performs an optimal piecewise linear regression (PLR) in an online fashion. This approach uses linear time for each call to process and potentially linear space. In practice, the space used is generally a small fraction of the data. If constant space is required for your applications, please see GreedyPLR.