line drawing algo
DESCRIPTION
Algorithms from Computer Graphics ( C version )TRANSCRIPT
LINE DRAWING ALGORITHMS
Presented By Susheel Thakur
M.Tech( C.S)-IIIrd SemRoll No-324
COMPUTER GRAPHICS 2Thursday, November 22, 2012
COMPUTER GRAPHICS 3Thursday, November 22, 2012
COMPUTER GRAPHICS 4Thursday, November 22, 2012
COMPUTER GRAPHICS 5Thursday, November 22, 2012
COMPUTER GRAPHICS 6Thursday, November 22, 2012
COMPUTER GRAPHICS 7Thursday, November 22, 2012
COMPUTER GRAPHICS 8Thursday, November 22, 2012
COMPUTER GRAPHICS 9
OUTPUT:
Thursday, November 22, 2012
COMPUTER GRAPHICS 10Thursday, November 22, 2012
COMPUTER GRAPHICS 11Thursday, November 22, 2012
COMPUTER GRAPHICS 12Thursday, November 22, 2012
COMPUTER GRAPHICS 13
Advantages
Faster than direct use of the line equation.
( without any floating pt multiplication).Simplest Algorithm, doesn’t require special
skills for implementation.
Thursday, November 22, 2012
COMPUTER GRAPHICS 14
DISADVANTAGES:
Orientation Dependent, end point accuracy is poor.
A floating pt addition is still needed.
Thursday, November 22, 2012
COMPUTER GRAPHICS 15
3.BRESENHAM’S LINE ALGORITHM
DDA Algo Drawback: Very time consuming- rounding off operation and floating pt arithmetic.
Basic Principle: Find optimum raster locations to represent straight
lines. Increment either x or y by one unit depending on the
slope of line.Then increment in other variable is found on basis of
distance between actual line location and nearest pixel-decision variable or error term.
Thursday, November 22, 2012
COMPUTER GRAPHICS 16Thursday, November 22, 2012
COMPUTER GRAPHICS 17Thursday, November 22, 2012
COMPUTER GRAPHICS 18Thursday, November 22, 2012
COMPUTER GRAPHICS 19
THANK U Thursday, November 22, 2012