Rasterization: 1107190 - Introdução À Computação Gráfica Prof. Christian Azambuja Pagot Ci / Ufpb

Rasterization
Lecture 2
1107190 - Introdução à Computação Gráfica
Prof. Christian Azambuja Pagot

CI / UFPB
Universidade Federal da Paraíba

Centro de Informática
Vector Display
1. Deflection voltage eletrode.

2. Electron gun.
3. Electron beam.
4. Focusing coil.
5. Phosphor-coated inner side of the screen.
Søren Peo Pedersen (Wikipedia) 2

Vector Graphics
Vectrex video game (video)

Blakespot (Flickr) 3
Raster Displays
CRT Display LCD Display Plasma Display
1. Three Electron guns.

2. Electron beams.
3. Focusing coils. Gabelstaplerfahrer
4. Deflection coils. (Wikipedia)
5. Anode connection.
6. Mask for separating beams.
7. Phosphor layer. Jari Laamanen
8. Close-up of the phosphor-coated inner side of the screen. (Wikipedia)
Søren Peo Pedersen (Wikipedia)
4
Raster Display
Gona.eu (Wikipedia) 5
Raster Graphics
Jet 2 (1987) (video)

Sublogic 6
Universidade Federal da Paraíba Video by oldclassicgame (youtube.com)
Video Memory
Vídeo Onboard
RAM
byte / word ... ... ...

0 1 2 n-1 n
Vídeo Memory (VRAM)
7
Video Memory
Vídeo Offboard
Vídeo Card
Vídeo Memory (VRAM)
byte / word ... ... ...

0 1 2 n-1 n
How about
colors?
8
Colors (Quick view)
● Electromagnetic spectrum
Visible spectrum
Image by penubag (Wikipedia) 9

Colors (Quick view)
● CIE Color Space (1931)
● CIE RGB Color Space
Normally used
in computers!
Image by BenRG (Wikipedia) 10

RGB Representation
● The intensity of each component is represented by a
number.
● Usually, 8 bits are reserved for each component
(channel). Thus, each component can present up to
256 levels of intensity (2563 = ~16 millions of colors).
● An additional channel (alpha) can be used for
transparency (RGBA).
● It's not uncommon to have different number of bits
per channel.
11
Image Storage
Pixel (0,0) Pixel (1,0) i * 4+0
(4 bytes) (4 bytes) i * 4+1 Pixel (i,0)
i * 4+2 (4 bytes)
0 1 2 3 4 5 6 7 i * 4+3
R G B A R G B A ... R G B A
Color buffer
Line 0 Screen
12
Image Storage
w columns
(width)
# pixels = w * h
Column w-2
Column w-1
Column 0
Column 1
Column 2
Column 3
Column 4
Line 0
Line 1
Line 2
Line 3
Line 4
h lines
(height)
Line h-2
Line h-1
13
Image Storage
W ( # columns)
Line 0
Line 1
Line 2
Line 3
Line 4
Pixel = (x,y)
Offset = x*4 + y*w*4
Line h-2
Line h-1
Line 0 Line 1 Line 2 Line h-1
Color buffer
14
Image Storage
● Vídeo memory screen image footprint:
Screen Image
Color buffer
Vídeo Memory
Frame buffer
Depth buffer
Auxiliar buffer 1
Auxiliar buffer 2
...
Auxiliar buffer n
15
Rasterization
● “Approximation of mathematical ('ideal')
primitives, described in terms of vertices on a
Cartesian grid, by sets of pixels of the
appropriate intensity of gray or color.”
- Foley et. al
16
Rasterization
Screen
Pixel
17
Rasterization
Screen
Pixel
Pixel center
18
Rasterizing Lines
Since ∆x is greater ∆y:
Δy
m=
Δx
y i=m x i + b
By incrementing x by 1, we can
compute the corresponding y:
∆y 1st point: (x0, mx0+ b))
2nd point: (x1, mx1+ b))
Y 3rd point: (x2, mx2+ b))
.
.
X .
∆x nth point: (xn, mxn+ b))
19
Rasterizing Lines
Since ∆x is greater ∆y:
Δy
m=
Δx
y i=m x i + b
By incrementing x by 1, we can
compute the corresponding y:
∆y 1st point: (x0, Round(mx0+ b))
2nd point: (x1, Round(mx1+ b))
Y 3rd point: (x2, Round(mx2+ b))
.
.
X .
∆x nth point: (xn, Round(mxn+ b))
20
Rasterizing Lines
● Problems with this approach:
– At each iteration:
● A floating point multiplication.
● A floating point addition.
● A Round operation.
nth point: (xn, Round(mxn+ b))
21
Rasterizing Lines
● Solution:
– Multiplication can be eliminated:
y i+ 1=m x i+1 +b
y i+ 1=m(x i + Δ x)+ b
y i+ 1= y i + m Δ x This is an incremental
algorithm.
– If ∆x = 1: Usually referred as the DDA
(digital differential analyzer)
y i+ 1= y i + m algorithm.
22
Bresenham Line Algorithm
● Incremental.
● Avoids multiplications and roundings.
● Can be generalized for circles.
23
Variation of Bresenham's Algor.
line
Y
X
24
+ + + + + + + + + + + + + + +
+ + + + + + + + + + + + + + + Assuming that 0 ≤ m ≤ 1:
+ + + + + + + + + + + + + + +
ne
+ + + + + + + + + + + + + + +
+ + + + + + + + + + + + + + +
y =mx+ b
m (midpoint)
+ + + + + + + + + + + + + + +
Δy
line
+ + + + + + + + + + + + + + +
+ + + + + + + + +
+
yc
c e
y= ( ) Δx
x +b α = Δy
β = −Δ x
γ = b⋅Δ x

Y Φ (x , y )=α x +β y + γ=0

X xc Φ ( x , y )=Δ y⋅x−Δ x⋅y + b⋅Δ x =0
1 d =Φ (m )→ Decision variable
c=(x c , y c )
e=( x c +1, y c ) if (d < 0)
ne=(x c +1, y c + 1) next pixel = ne
Will we have else
1 to evaluate next pixel = e
m =( x c +1, y c + )
2 a polynomial
Universidade Federal da Paraíba every pixel? 25
+ + + + + + + + + + + + + + + + + + + + + + +
+ + + + + + + + + + + + + + + + + + + + + + +
+ + + + + + + + + + + + + + + + + + + + + + +
If E is choosen:
?
+ + + + + + + + + + + + + + + + + + + + + + + 1
+ + + + + + + + + + + + + + + + + + + + + + + d old =α (x c +1)+β( y c + )+ γ
mold mnew
+ + + + + + + + + + + + + + + + + + + + + + +
+ + + + + + + + + + + + + + + + + + + + + + +
2
line + + + + + + + + +
1
+
c e ? d new =α ( x c +2)+β( y c + )+ γ

2
Y
d new −d old → d new =d old +α
X
Remembering...
1
d old =Φ (m old )=Φ(( x c +1, y c + )) Φ (x , y )=α x +β y + γ
2
1 α = Δy
d new =Φ (m new )=Φ(( x c +2, y c + )) β = −Δ x
2 γ = b⋅Δ x
26
+ + + + + + + + + + + + + + + + + + + + + + +
+ + + + + + + + + + + + + + + + + + + + + + +
+ + + + + + + + + + + + + + + + + + + + + + +
If NE is choosen:
?
+ + + + + + + + + + + + + + + + + + + + + + + 1
+ + + + + + + + + + + + + + + + + + + + + + +
mnew d old =α ( x c +1)+β( y c + )+ γ
+ + + + + + + + + + + + + + + + + + + + + + +
+ + + + + + + + + + + + + + + + + + + +
2
+ + + + + + + + + + + + + + + + +
3
+ + + + + + + + + + + + + + +
ne ? d new =α (x c +2)+β( y c + )+ γ
+ + + + + + + + + + + +
+ + + + + + + + + + 2
+ + + + + + +
+ + + + +
mold
d new −d old → d new =d old +α +β
+ +
line
c

Remembering...

Y
Φ (x , y )=α x +β y + γ
X 1
d old =Φ (m old )=Φ(( x c +1, y c + )) α = Δy
2 β = −Δ x
3 γ = b⋅Δ x
d new =Φ (m new )=Φ(( x c +2, y c + ))
2
27
● How about the 1st pixel (there is no Dold!)?
1
d =Φ (m )=α( x 0+ 1)+β( y 0 + )+ γ
2
β
d =Φ (c)+α+ Φ (c)=0
2
m α = Δy
line
β
d =α+ β = −Δ x
y0 2 γ = b⋅Δ x
Y Δx
d =Δ y −
X 2
x0
Φ ( x , y )=0=2⋅0=2 Φ( x , y )=2(α x +β y + γ)
d =Φ (m)
1
=Φ((x 0 +1, y 0 + )) d =2 Δ y −Δ x
2
28
● The entire algoritm for 0 < m < 1:
MidPointLine() {
int dx = x1 – x0;
int dy = y1 – x0;
int d = 2 * dy – dx;
int incr_e = 2 * dy;
The computation of d, now,
int incr_ne = 2 * (dy – dx); involves only addition!
int x = x0;
int y = y0;
PutPixel(x, y, color)
while (x < x1) {
if (d <= 0) {
d += incr_e;
Slopes outside the range [0,1]
x++; can be handled by symmetry!
} else {
d += incr_ne;
x++;
y++;
}
PutPixel(x, y, color);
}
}
Computer Graphics: Principles and Practice. Foley et al. 29

Other Rasterization Issues
● How about?
– Other primitives:
● Circles.
● Ellipses.
● Triangles.
– Thick lines.
– Shape of the endpoints.
– Antialiasing.
– Line stile.
– Filling.
– Etc.
30

Rasterization: 1107190 - Introdução À Computação Gráfica Prof. Christian Azambuja Pagot Ci / Ufpb

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Rasterization: 1107190 - Introdução À Computação Gráfica Prof. Christian Azambuja Pagot Ci / Ufpb

Uploaded by

Copyright:

Available Formats

Rasterization

1107190 - Introdução à Computação Gráfica

Prof. Christian Azambuja Pagot

Universidade Federal da Paraíba

1. Deflection voltage eletrode.

Søren Peo Pedersen (Wikipedia) 2

Vectrex video game (video)

1. Three Electron guns.

Jet 2 (1987) (video)

byte / word ... ... ...

Vídeo Memory (VRAM)

Vídeo Memory (VRAM)

byte / word ... ... ...

Image by penubag (Wikipedia) 9

● CIE RGB Color Space

Image by BenRG (Wikipedia) 10

Offset = x4 + yw*4

Line 0 Line 1 Line 2 Line h-1

nth point: (xn, Round(mxn+ b))

Computer Graphics: Principles and Practice. Foley et al. 29

You might also like