Path: utzoo!utgpu!water!watmath!clyde!cbosgd!ihnp4!alberta!calgary!blob
From: blob@calgary.UUCP (Brian Wyvill)
Newsgroups: comp.graphics
Subject: Re: Line Drawing Algorithms
Summary: How do you speed up Bresenham's by a factor of "50 or 60" ??
Message-ID: <1283@vaxb.calgary.UUCP>
Date: 12 Jan 88 23:48:02 GMT
References: <gVu4-3y00WEDslk09=@andrew.cmu.edu>
Organization: U. of Calgary, Calgary, Ab.
Lines: 26

In article <gVu4-3y00WEDslk09=@andrew.cmu.edu>, cm26+@andrew.cmu.edu (Curt McDowell) writes:
> 
> 
> I have 68000 routines for Suns that uses this technique, besides splitting the
> algorithm into 8 cases, yielding a speedup factor of at least 50 or 60 times 
> over
> the bare one mentioned in Foley.
> 
> The exact algorithm may be found in Foley, but details such as this may not.
> 
> Curt McDowell
> Carnegie-Mellon U.

This sounds like a fairly ambitious claim.   There was a recent article
in Grapics and Image Processing by Rokne and Wu which produced a factor
of two over Bresenham's and I have implemented a variation on this which
gives a speed up close to 4.   One of our students is close to producing
a speed of between 7 and 8.   I would be interested to hear details of
your algorithm.




-- 
        Brian Wyvill
	..!{ubc-vision,ihnp4}!alberta!calgary!blob