Genaral rules:

 This file should come in the archive 'Cir+Lin.lha' containing:
 -circle.asm
 -line.asm
 -readme.txt	(this file)

 The author is not responsible for any kind of dammage this piece of software
 _might_ cause. Any modifications must be mailed to the author.
 The source-code in this archive may be used in public software.
 When used in a commercial product I want to be contacted for my permission.

  -Author: Patrick van Logchem (EMail: v912152@si.hhs.nl).
   Date:   20:13:00  7 June 1993.
   Adress: Sytwinde 95, 2631 GS, Nootdorp, The Netherlands.


Hello there,

 The algorithms used are based on Bressenham's circle and line algorithms.
 I removed all the fuss out of the algorithms and converted the result in
 highly optimized MC 68000 assembly.

 Both routines draw their output on a single bitplane. This could easily be
 changed to (for example) byte- or word-planes. (The last case is nice when you
 want to step throug a 2d-array of values, comparing those to another value;
 as used in grid-tracing (!))
 If you find any possible speed-ups, I'd like to hear from you (please (E)mail
 me at the above adress).

 Have fun, Patrick van Logchem.