2d scan line conversion
This presentation is the property of its rightful owner.
Sponsored Links
1 / 16

2D Scan-line Conversion PowerPoint PPT Presentation


  • 67 Views
  • Uploaded on
  • Presentation posted in: General

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.

Download Presentation

2D Scan-line Conversion

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


Dda algorithm1

DDA Algorithm


Dda algorithm2

DDA Algorithm


Dda algorithm3

DDA Algorithm


Dda algorithm4

DDA Algorithm


Dda algorithm5

DDA Algorithm


Dda algorithm6

DDA Algorithm


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)


Incremental calculation of the decision variable d new

Incremental Calculation of the decision variable dnew

NE

M

E

(x0, y0)


Bresenham s midpoint algorithm4

Bresenham’s Midpoint Algorithm

NE

M

E

(x0, y0)


  • Login