Path: utzoo!attcan!uunet!lll-winken!lll-lcc!mordor!joyce!ames!pasteur!ucbvax!decwrl!hplabs!hpda!hp-sde!hpfcdc!bayes
From: bayes@hpfcdc.HP.COM (Scott Bayes)
Newsgroups: comp.graphics
Subject: Re: Challenge program #2
Message-ID: <5040005@hpfcdc.HP.COM>
Date: 9 Jun 88 22:21:53 GMT
References: <369@abvax.UUCP>
Organization: HP Ft. Collins, Co.
Lines: 23

>	Here it is,  who can write the fastest code fragment for drawing 2-d
>vectors in a bit mapped screen.  My test system has a 68000, and so do
>Macintoshes so the 68000 seems to be a good place to start.  Any other micro
>is fine too.  The algorithm and clever use of registers is what I am after.
...
>	I'll post my 68000 assembler code later.  For now, I'll say the
>innermost loop takes an average of 51 machine clocks per pixel (8 instructions).
>At 8 Mhz, this would be 6.375 microseconds per pixel or 157,000 pixels/sec.

>	Have fun!
>		Greg Shay

So what's the frame buffer architecture??  Our (HP's) 200 and 300 series
computers support multiple frame buffer architectures, including "packed
pixel odd byte" (bit-per-pixel monochrome, think move.p alignment),
"packed pixel" (normal bit-per-pixel), byte-per-pixel, separate planes, etc.
These variations can make quite a difference at the machine clock level.

Is your algorithm faster than a cleverly implemented Bresenham?  Is it
just an implementation variation on Bresenham, or is it something new
and different?

Scott "tight loop" Bayes
bayes@hpfclw