Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
| courses:cs211:winter2018:journals:mccaffreyk:home:6 [2018/03/26 03:55] – mccaffreyk | courses:cs211:winter2018:journals:mccaffreyk:home:6 [2018/03/26 04:18] (current) – mccaffreyk | ||
|---|---|---|---|
| Line 44: | Line 44: | ||
| However, additional lines incur two penalties: segment number is multiplied by a constant | However, additional lines incur two penalties: segment number is multiplied by a constant | ||
| and summed with the error of each segment. Clearly, we are attempting to minimize total | and summed with the error of each segment. Clearly, we are attempting to minimize total | ||
| - | error. | + | error. |
| + | lines more. The exact algorithm is very abstract. We use iteration somewhat similar | ||
| + | to that of section 6.2 to find and memoize the least square error sums in O(n^3) time. Next, we deal with | ||
| + | how many line segments we will need, also with a recursive function. This part takes O(n^2) time. This | ||
| + | section was hard for me to an extent similar to 6.1. This is because it gave complex mathematical formulas | ||
| + | without explaining them adequately. Further, the algorithms were very abstract forcing me to make assumptions | ||
| + | and constantly decipher them. Thus, my score for this section is 5/10. | ||
