Crossbones+ - Reputation: 8857
Posted 22 August 2012 - 02:59 PM
The slowsort algorithm is a perfect illustration of the multiply and surrender paradigm, which is perhaps the single most important paradigm in the development of reluctant algorithms. The basic multiply and surrender strategy consists in replacing the problem at hand by two or more subproblems, each slightly simpler than the original, and continue multiplying subproblems and subsubproblems recursively in this fashion as long as possible. At some point the subproblems will all become so simple that their solution can no longer be postponed, and we will have to surrender. Experience shows that, in most cases, by the time this point is reached the total work will be substantially higher than what could have been wasted by a more direct approach.
- Pessimal Algorithms and Simplexity Analysis
Members - Reputation: 130
Posted 22 August 2012 - 03:53 PM
what is the D in the b = 2P1 - 2DP0? And why is there no line above P0? I need to understand this so that i could simplify this equation, because i have a very simple case of a bezier curve.