CP/M User
Veteran Member
"Barry"
>> I don't think they call this the Bresneham drawning
>> algorithm though, some of the code I've seen which
>> demonstrates this, goes into some of the more
>> advance math.
> That's not the bresneham algorithm. Bresneham
> wrote a method by for calculating each pixel. Line
> drawing isn't needed. Line drawing around the
> circle using radii is a simpler method. Bresneham
> is used when speed is needed. It's unique in that
> it doesn't need division or multiplcation. Only
> addition or subtraction, which are much faster in
> most processors.
> There's also a bresneham line drawing algorithm.
I know where you should be able to find some
Turbo Pascal examples & an Assembly example
I think of the Bresneham algorithm.
The Turbo Pascal examples are available at the
SWAG archive (in the Graphics) area. SWAG is
here:
http://www.gdsoft.com/swag/swag.html
you'll need to also download a viewer though,
cause the archives are in a special file format
(specific to what they have the archives in).
For memory I'm pretty sure there are some
Bresneham examples in there.
Also, just check out the CP/M-86 Software
Repository at http://www.seanet.com/~klaw/
cause I'm sure there's an assembly example
in there. Even if you're not into CP/M-86, the
source code may give you a good idea on
how it's done!
Cheers,
CP/M User.
>> I don't think they call this the Bresneham drawning
>> algorithm though, some of the code I've seen which
>> demonstrates this, goes into some of the more
>> advance math.
> That's not the bresneham algorithm. Bresneham
> wrote a method by for calculating each pixel. Line
> drawing isn't needed. Line drawing around the
> circle using radii is a simpler method. Bresneham
> is used when speed is needed. It's unique in that
> it doesn't need division or multiplcation. Only
> addition or subtraction, which are much faster in
> most processors.
> There's also a bresneham line drawing algorithm.
I know where you should be able to find some
Turbo Pascal examples & an Assembly example
I think of the Bresneham algorithm.
The Turbo Pascal examples are available at the
SWAG archive (in the Graphics) area. SWAG is
here:
http://www.gdsoft.com/swag/swag.html
you'll need to also download a viewer though,
cause the archives are in a special file format
(specific to what they have the archives in).
For memory I'm pretty sure there are some
Bresneham examples in there.
Also, just check out the CP/M-86 Software
Repository at http://www.seanet.com/~klaw/
cause I'm sure there's an assembly example
in there. Even if you're not into CP/M-86, the
source code may give you a good idea on
how it's done!
Cheers,
CP/M User.