Actually, yes.Quote:> hi everyone,
> I'm looking for speed and well, I'm left wondering if there is a way of
> drawing a line (I'm interested mainly in it's ability to scan down the
> of a polygon) that doesnt involve bresenhams? are there any other? perhaps
> higher performace algorithms
> thanks, just a short one :P keep your brains ticking over
Even though the theoretical textbooks always use Bresenham's, everybody else
uses other algorythims.
Best bet, for the most part, is to reduce the angled line to a series of
horizontal or vertical lines and then process those. Then you get a
relitively simple loop.
I'm handwaving a lot here..
But if you are doing appreciable calculations at each pixel -- more than
just drawing -- it's probably better to just use Bresenham's.