Bézier curves/Intersections: Difference between revisions
Content added Content deleted
(Added Pascal.) |
(→{{header|Icon}}: Added a link to the Pascal.) |
||
| Line 1,223: | Line 1,223: | ||
Furthermore, the algorithm returns <math>t</math>-parameter pairs, which is ideal. |
Furthermore, the algorithm returns <math>t</math>-parameter pairs, which is ideal. |
||
Icon is a very good language in which to express this algorithm, ''if'' the audience can read Icon. But Icon is not designed to be readable by the programming public. See instead the [[#Pascal|Pascal]]. Pascal is meant to be readable. There also instead of a "workload" set there is a recursive procedure, which probably more programmers will recognize as "how to do adaptive bisection". (But both methods are common.) |
|||
<syntaxhighlight lang="icon"> |
<syntaxhighlight lang="icon"> |
||