[CSC 315] CSC 315 Clarification

[Andrew J. Pounds]

The incremental line scan-conversion is program 3.1 found on page 72 of 
the Foley handout.  You are welcome to use that. (The code is even on 
cobra.)  Be warned -- you may have to make some adjustments.

I went over Bresenham's algorithm in class because it is the classic 
"starting point" and it works great for things in the first quadrant 
(positive X and Y).  You will find it on page 246 of the Pavlidis handout.



On 09/08/2012 05:10 PM,  wrote:
> Hello Dr. Pounds,
>
> I have a question about the first programming assignment, and I think it
> will be an issue that comes up a lot in 315. For the first section of
> assignment 1, we are supposed to use the incremental line scan
> conversion algorithm to draw lines. I believe you mentioned in class
> that this was Bressenham's Algorithm--since that's what is in Pavlidus.
> I'm assuming these are the same. (Let me know if they aren't!)
>
> So, in Pavlidus, they have an explicit C/C++ program that will draw line
> segments. Should I come up with my own implementation of Bressenham's
> Algorithm? Or can I copy the code in the handout, making sure that I
> understand what it is doing? I'm unsure where the algorithm stops, and
> Pavlidus' specific implementation begins. If I do copy the code, do I
> have to cite Pavlidus?
>
> I'll go ahead and copy the code for now, but I'll make sure and mark it.
>
> See you Tuesday,
>
>


-- 
Andrew J. Pounds, Ph.D.  (pounds at theochem.mercer.edu)
Associate Professor of Chemistry and Computer Science
Mercer University,  Macon, GA 31207   (478) 301-5627