1 / 16

2D Scan-line Conversion - PowerPoint PPT Presentation

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.

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

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

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

University of Missouri at Columbia

• DDA algorithm

• Bresenham’s algorithm

• The simplest algorithm.

• Named after Digital Differential Analyzer.

(x1, y1)

dy

(x0, y0)

dx

• DDA algorithm

• Bresenham’s algorithm

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

• Bresenham’s use integer addition only.

(x1, y1)

dy

(x0, y0)

dx

• 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)

• Choose E if d is positive,

• Choose NE if d is negative.

NE

M

E

(x0, y0)

• Choose E if d is positive,

• Choose NE if d is negative.

NE

M

E

(x0, y0)

NE

M

E

(x0, y0)

NE

M

E

(x0, y0)