Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
64 views

Scan Conversion Algorithms-2

The document discusses various scan conversion algorithms including line, circle, ellipse and region filling algorithms. It explains techniques like Bresenham's line algorithm and circle drawing algorithm. It also covers topics like character generation and anti-aliasing effects of scan conversion.

Uploaded by

Kartik Makkar
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
64 views

Scan Conversion Algorithms-2

The document discusses various scan conversion algorithms including line, circle, ellipse and region filling algorithms. It explains techniques like Bresenham's line algorithm and circle drawing algorithm. It also covers topics like character generation and anti-aliasing effects of scan conversion.

Uploaded by

Kartik Makkar
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 22

TOPICS TO BE COVERED

Scan

Conversion Definition
Line Algorithms

Slope-Intercept Method
Bresenhams
DDA

Circle

Drawing Algorithms
Ellipse Drawing Algorithm
Area Filling Techniques
Character Generation

Copyright @ www.bcanotes.com

SCAN CONVERSION

Copyright @ www.bcanotes.com

Converting the geometric definition of a primitive form


into a set of pixels that make up the primitive in the
image space. This conversion task is generally
referred to as scan conversion or rasterization

SCAN CONVERTING A LINE


Mathematical

A line segment is defined by its two endpoints and


the line equation

Y = mx + b, where m is the slope and b is the intercept


Y
Y = m*x + b

P2(x2,y2)

P1(x1,y1)

x
Defining a Line

Copyright @ www.bcanotes.com

Representation of a line

LINE DRAWING ALGORITHMS


Slope-Intercept method
Digital Differential (DDA) Algorithm
Bresenhams Line Algorithm

Copyright @ www.bcanotes.com

Quest for the Ideal Line


The best we can do is a discrete approximation of an ideal line.

Copyright @ www.bcanotes.com

Important line qualities:


Continuous appearance
Uniform thickness and brightness
Accuracy (Turn on the pixels nearest the ideal line)
Speed (How fast is the line generated)

Simple Line
Based on the simple slope-intercept algorithm from algebra

y=mx+b
Copyright @ www.bcanotes.com

AN ALGORITHM
0O TO 45O )

1.

TO DRAW A LINE USING THE SLOPE-INTERCEPT METHODS (SLOPE IS BETWEEN

Compute

2.
3.

4.
5.

If dx < 0 x = x2, y = y2 and xend =x1


if dx > 0 x=x1, y=y1 and xend = x2
If x< xend, stop
Plot a point at (x, y)
x = x+1
Y=mx+b

6.

Go to step 4

Copyright @ www.bcanotes.com

dx = x2-x1
dy = y2-y1
m = dy/dx
b = y1-m*x1

DIRECT USE LINE EQUATION

Copyright @ www.bcanotes.com

Involves floating point computation (multiplication and


addition ) at every step leading to increase in the
computation time

DDA
Incremental scan-conversion method
Faster than the direct use of the line equation
However, a floating point operation is still
required
The line drifts away from the original line when
the line is relatively long.

Copyright @ www.bcanotes.com

AN ALGORITHM

TO DRAW A LINE USING THE

DDA

METHOD
1.

Compute
dx = x2-x1

2.

4
5.
6.

7.
8.

9.
10.

11.
12.

13.
14.
15.

If abs(dx) > abs(dy) then steps = abs(dx)


Else steps = abs(dy)
Plot a point at (x, y)
xinc = dx / steps;
yinc = dy/steps;
x = x1 and y = y1
Plot a point at (x, y)
k=1
if k = steps , stop
x = x +xinc
y = y + yinc
Plot a point at (x, y)
k = k+1
Go to step 7

Copyright @ www.bcanotes.com

3.

dy = y2-y1

BRESENHAM LINE ALGORITHM


1.

Copyright @ www.bcanotes.com

2.

Highly efficient incremental method


Produces mathematically correct results using
simple calculations

AN ALGORITHM
0O TO 45O )

1.

TO DRAW A LINE USING THE

4.
5.

6.
7.

8.
9.
10.

(SLOPE

IS BETWEEN

dy = y2-y1
Inc2 = 2 * dy

If dx < 0 x = x2, y = y2 and xend =x1


if dx > 0 x=x1, y=y1 and xend = x2
Plot a point at (x, y)
If x= xend, stop
if d < 0 then d= d+inc1
If d>=0 then d= d+ inc2 y = y+1
x = x+1
Plot a point at (x, y)
Go to step 5

Copyright @ www.bcanotes.com

3.

METHOD

Compute
dx = x2-x1
inc1 = 2(dy-dx)
d = inc1 - dx

2.

BRESENHAMS

FOR IMPLEMENTING OTHER CASES IN BRESENHAMS ALGO


Slope of line

Predominant
distance

Coord. which
changes at each
step

Coord. which
may or may not
change

0< m< 1

m=1

x or y

x and y

1<m<

0 > m> -1

m = -1

x or y

x and y

-1 > m >

SCAN CONVERTING A CIRCLE

Copyright @ www.bcanotes.com

Since circle is a symmetrical figure , eight points can


be plotted for each value that the algorithm calculates

EIGHT WAY SYMMETRY OF A CIRCLE


7
2

(x,y) (7,2)

(-x,y) (-7,2)

-1

-2
-4
-5
-6
-7

(-y, -x) (-2,-7)

(x,-y) (7,-2)

-3

(-x,-y) (-7,-2)

(y,-x) (2,-7)

Copyright @ www.bcanotes.com

(-y,x) (-2,7)

(y,x) (2,7)

BRESENHAM CIRCLE ALGORITHM


To plot the circle efficiently

1.

3.

Set (h,k)= coordinates of circle center, x=0, y= r and


the decision parameter d= 3 2*r
If x>y , stop
Plot the eight points, with respect to the current
coordinates (x,y)
Plot ( x + h, y + k)
Plot (y + h, x + k)
Plot ( - y + h, x + k)
Plot (- x + h, y + k)

4.
5.
6.

Plot (- x + h, - y + k)
Plot ( - y + h, - x + k)
Plot (y + h, - x + k)
Plot ( x + h, - y + k)

If d < 0 then d =d d+4*x + 6 and x = x + 1


If d >=0 then d= d + 4*(x-y) + 10 , x = x + 1 and y =
y-1
Go to step 2

Copyright @ www.bcanotes.com

2.

Avoid the use of trigonometric functions and power


functions.

ELLIPSE

Shows Four-way symmetry

(X/2, Y/2)

Copyright @ www.bcanotes.com

(-X/2, Y/2)

(-X/2, -Y/2)

(X/2, -Y/2)

REGION FILLING
Process

of coloring in a definite image or

Pixel Level
Boundary defined
Algorithms are referred as Boundary Fill Algorithms
Interior Defined Region
Algorithms are referred as flood-fill Algorithms

Geometric Level

A region is defined or bounded by abstract elements


as connected lines and curves

Copyright @ www.bcanotes.com

region
Regions may be defined at

BOUNDARY FILL ALGORITHM


Recursive

Copyright @ www.bcanotes.com

Algorithm
Begins with a initial pixel inside the region
The Algorithm checks to see if this pixel is a
boundary pixel or has already been filled.
If No, It Fills the pixel and makes a recursive
call to itself using each and every neighboring
pixel as a new seed.
If Yes, the algorithm simply return to its
caller

FLOOD FILL ALGORITHM


Begins with a initial pixel inside the region
The Algorithm checks to see if this pixel has the
regions original color
If Yes, It Fills the pixel with new color and uses
each of the pixels neighbors as a new seed in a
recursive call.
If No, the algorithm simply return to its caller

Copyright @ www.bcanotes.com

SCAN CONVERTING A CHARACTER


Unit

Bitmap

Font or Raster
Vector or Outline Font

Copyright @ www.bcanotes.com

is Points 1/72 inch and


picas -2 points
Two Approaches

ALIASING EFFECTS OF SCAN CONVERSION


Staircase
Unequal Brightness
The Picket Fence Problem
Anti-aliasing

Copyright @ www.bcanotes.com

You might also like