Bézier curves/Intersections: Difference between revisions
→{{header|D}}: Added a note about nasty things one can run into.
(→{{header|D}}: Added some assertions.) |
(→{{header|D}}: Added a note about nasty things one can run into.) |
||
Line 328:
This program subdivides both curves by de Casteljau's algorithm, until only very small subdivisions with overlapping control polygons remain.
(A real-life program probably should take greater care that, for instance, intersections at subdivision boundaries are not accidentally counted twice.)
<syntaxhighlight lang="D">
| |||