Line drawing algorithms
Upcoming SlideShare
Loading in...5
×
 

Like this? Share it with your network

Share

Line drawing algorithms

on

  • 360 views

 

Statistics

Views

Total Views
360
Views on SlideShare
360
Embed Views
0

Actions

Likes
0
Downloads
28
Comments
1

0 Embeds 0

No embeds

Accessibility

Categories

Upload Details

Uploaded via as Microsoft PowerPoint

Usage Rights

© All Rights Reserved

Report content

Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
  • Full Name Full Name Comment goes here.
    Are you sure you want to
    Your message goes here
    Processing…
Post Comment
Edit your comment

Line drawing algorithms Presentation Transcript

  • 1. LINE DRAWING ALGORITHMS Presented By Susheel Thakur M.Tech( C.S)-IIIrd Sem Roll No-324
  • 2. Thursday, November 22, 2012 COMPUTER GRAPHICS 2
  • 3. Thursday, November 22, 2012 COMPUTER GRAPHICS 3
  • 4. Thursday, November 22, 2012 COMPUTER GRAPHICS 4
  • 5. Thursday, November 22, 2012 COMPUTER GRAPHICS 5
  • 6. Thursday, November 22, 2012 COMPUTER GRAPHICS 6
  • 7. Thursday, November 22, 2012 COMPUTER GRAPHICS 7
  • 8. Thursday, November 22, 2012 COMPUTER GRAPHICS 8
  • 9. OUTPUT:Thursday, November 22, 2012 COMPUTER GRAPHICS 9
  • 10. Thursday, November 22, 2012 COMPUTER GRAPHICS 10
  • 11. Thursday, November 22, 2012 COMPUTER GRAPHICS 11
  • 12. Thursday, November 22, 2012 COMPUTER GRAPHICS 12
  • 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 13
  • 14. DISADVANTAGES:Orientation Dependent, end point accuracy is poor.A floating pt addition is still needed.Thursday, November 22, 2012 COMPUTER GRAPHICS 14
  • 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 15
  • 16. Thursday, November 22, 2012 COMPUTER GRAPHICS 16
  • 17. Thursday, November 22, 2012 COMPUTER GRAPHICS 17
  • 18. Thursday, November 22, 2012 COMPUTER GRAPHICS 18
  • 19. THANK U Thursday, November 22, 2012 COMPUTER GRAPHICS 19