The problem with Bresenham is that it requires you to iterate the entire range (segment) one at a time.
For 360 degrees (or just 45 if you use the 1/8th mirroring optimisation), that isn't a problem, but for ranges above 100,000 or so (and many of mine are in the 10s or 100s of millions), it would be horribly slow.
In reply to Re^3: Split range 0 to M into N non-overlapping (roughly equal) ranges.
by BrowserUk
in thread Split range 0 to M into N non-overlapping (roughly equal) ranges.
by BrowserUk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |