2d scan line conversion
Download
1 / 16

2D Scan-line Conversion - PowerPoint PPT Presentation


  • 110 Views
  • Uploaded on

2D Scan-line Conversion. University of Missouri at Columbia. 2D Scan-line Conversion. DDA algorithm Bresenham’s algorithm. DDA algorithm. The simplest algorithm. Named after Digital Differential Analyzer. ( x 1 , y 1 ). d y. ( x 0 , y 0 ). d x. DDA Algorithm. DDA Algorithm.

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about ' 2D Scan-line Conversion' - zoie


An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
2d scan line conversion

2D Scan-line Conversion

University of Missouri at Columbia


2d scan line conversion1
2D Scan-line Conversion

  • DDA algorithm

  • Bresenham’s algorithm


Dda algorithm
DDA algorithm

  • The simplest algorithm.

  • Named after Digital Differential Analyzer.

(x1, y1)

dy

(x0, y0)

dx








2d scan line conversion2
2D Scan-line Conversion

  • DDA algorithm

  • Bresenham’s algorithm


Bresenham s midpoint algorithm
Bresenham’s Midpoint Algorithm

  • DDA is simple, efficient, but needs floating points.

  • Bresenham’s use integer addition only.

(x1, y1)

dy

(x0, y0)

dx


Bresenham s midpoint algorithm1
Bresenham’s Midpoint Algorithm

  • To choose from the two pixels NE or E depending on the relative position of the midpoint Mand the line.

  • Choose E if M is above the line,

  • Choose NE if M is below the line.

NE

M

E

(x0, y0)


Bresenham s midpoint algorithm2
Bresenham’s Midpoint Algorithm

  • Choose E if d is positive,

  • Choose NE if d is negative.

NE

M

E

(x0, y0)


Bresenham s midpoint algorithm3
Bresenham’s Midpoint Algorithm

  • Choose E if d is positive,

  • Choose NE if d is negative.

NE

M

E

(x0, y0)




ad