Graphics

Raster Graphics

고려대학교 컴퓨터 그래픽스 연구실

cgvr.korea.ac.kr Graphics Lab @ Korea University

Contents
CGVR

 Display Hardware
 How are images display?
 Raster Graphics Systems
 How are imaging system organized
 Output Primitives
 How can we describe shapes with primitives?
 Color Models
 How can we describe and represent colors?

cgvr.korea.ac.kr Graphics Lab @ Korea University

Bresenham’s Line Algorithm
CGVR

 Accurate and Efficient

 Use only incremental integer calculations
 Test the sign of an integer parameter

 Case) Positive Slope Less Than 1

 After the pixel (xk, yk) is displayed,
next which pixel is decided to plot
in column xk+1?
yk+1
 (xk+1, yk) or (xk+1, yk+1) yk
xk xk+1
cgvr.korea.ac.kr Graphics Lab @ Korea University
Bresenham’s Algorithm(cont.)
CGVR

 Case) Positive Slope Less Than 1

 y at sampling position xk
y  m xk  1  b
 Difference
d1  y  yk  m xk  1  b  yk yk+1 d2
d 2  yk  1  y  yk  1  m xk  1  b y d1
k
d1– d2 < 0  (xk+1, yk)
d1– d2 > 0  (xk+1, yk+1) xk xk+1
 Decision parameter
pk  x d1  d 2 
 2y  xk  2x  yk  2y  x 2b  1
 2y  xk  2x  yk  c
cgvr.korea.ac.kr Graphics Lab @ Korea University
Bresenham’s Algorithm(cont.)
CGVR

 Case) Positive Slope Less Than 1

 Decision parameter
pk 1  pk   2y  xk 1  2x  yk 1  c    2y  xk  2x  yk  c 
 2y  xk 1  xk   2x yk 1  yk 

 pk 1  pk  2y  2x yk 1  yk 
 Decision parameter of a starting pixel (x0, y0)
p0  2y  x0  2x  y0  2y  x 2b  1
 2y  x0  2x   mx0  b   2y  x 2b  1
 2y  x0  2y  x0  2bx  2y  2bx  x
 p0  2y  x
cgvr.korea.ac.kr Graphics Lab @ Korea University
Bresenham’s Algorithm(cont.)
CGVR

 Algorithm for 0<m<1

 Input the two line endpoints and store the left end point in (x0, y0)
 Load (x0, y0) into the frame buffer; that is, plot the first point
 Calculate constants Δx, Δy, 2Δy, and 2Δy− 2Δx, and obtain the st
arting value for the decision parameter as
p0  2y  x
 At each xk along the line, start at k =0, perform the following test:
 If pk < 0, the next point to plot is (xk+1, yk) and
pk 1  pk  2y
 Otherwise, the next point to plot is (xk+1, yk+1) and
pk 1  pk  2y  2x
 Repeat step 4 Δx times

cgvr.korea.ac.kr Graphics Lab @ Korea University

Polygons
CGVR

 Filling Polygons
 Scan-line fill algorithm  Boundary fill algorithm
 Inside-Outside tests

11
1 2 3 4 5 6 7 8 9 10 5 6 7 8 9
4312

cgvr.korea.ac.kr Graphics Lab @ Korea University

Scan-Line Polygon Fill
CGVR

 Topological Difference between 2 Scan lines

 y : intersection edges are opposite sides
 y’ : intersection edges are same side

y 1 2
2
y’
1 1

cgvr.korea.ac.kr Graphics Lab @ Korea University

Scan-Line Polygon Fill (cont.)
CGVR

 Edge Sorted Table

B
yC yB xC 1/mCB

C
C’ E yD yC’ xD 1/mDC yE x D 1/mDE

D
yA yE xA 1/mAE yB xA 1/mAB
A
1
Scan-Line Number 0
cgvr.korea.ac.kr Graphics Lab @ Korea University
Inside-Outside Tests
CGVR

 Self-Intersections
 Odd-Even rule  Nonzero winding
number rule

exterior

interior

cgvr.korea.ac.kr Graphics Lab @ Korea University

Boundary-Fill Algorithm
CGVR

 Proceed to Neighboring Pixels

 4-Connected
 8-Connected

cgvr.korea.ac.kr Graphics Lab @ Korea University

 Antialiasing
CGVR

 Aliasing
 Undersampling: Low-frequency sampling

original

sample

reconstruct

 Nyquist sampling frequency: f s  2 f max

xcycle
 Nyquist sampling interval: xs 
2

cgvr.korea.ac.kr Graphics Lab @ Korea University

Antialiasing (cont.)
CGVR

 Supersampling (Postfiltering)
 Pixel-weighting masks
 Area Sampling (Prefiltering)
 Pixel Phasing
 Shift the display location of pixel areas
 Micropositioning the electron beam in relation to obje
ct geometry

cgvr.korea.ac.kr Graphics Lab @ Korea University

Supersampling
CGVR

 Subpixels
 Increase resolution

22
(10, 20): Maximum Intensity
21
(11, 21): Next Highest Intensity
(11, 20): Lowest Intensity
20

10 11 12

cgvr.korea.ac.kr Graphics Lab @ Korea University

Supersampling
CGVR

 Subpixels
 Increase resolution

22
(10, 20): Maximum Intensity
21
(11, 21): Next Highest Intensity
(11, 20): Lowest Intensity
20

10 11 12

cgvr.korea.ac.kr Graphics Lab @ Korea University

Pixel-Weighting Masks
CGVR

 Give More Weight to Subpixels Near the Cent

er of a Pixel Area

1 2 1
2 4 2
1 2 1

cgvr.korea.ac.kr Graphics Lab @ Korea University

Area Sampling
CGVR

 Set Each Pixel Intensity Proportional to the

Area of Overlap of Pixel
 2 adjacent vertical (or horizontal) screen grid lines 
trapezoid
22
(10, 20): 90%
21
(10, 21): 15%
20

10 11 12
cgvr.korea.ac.kr Graphics Lab @ Korea University
Filtering Techniques
CGVR

 Filter Functions (Weighting Surface)

Box Filter Cone Filter Gaussian Filter

cgvr.korea.ac.kr Graphics Lab @ Korea University
Contents
CGVR

 Display Hardware
 How are images display?
 Raster Graphics Systems
 How are imaging system organized?
 Output Primitives
 How can we describe shapes with primitives?
 Color Models
 How can we describe and represent colors?

cgvr.korea.ac.kr Graphics Lab @ Korea University

Electromagnetic Spectrum
CGVR

 Visible Light Frequencies Range between

 Red: 4.3 x 1014 hertz (700nm)
 Violet: 7.5 x 1014 hertz (400nm)

cgvr.korea.ac.kr Graphics Lab @ Korea University

Visible Light
CGVR

 The Color of Light is Characterized by

 Hue: dominant frequency (highest peak)
 Saturation: excitation purity (ratio of highest to rest)
 Brightness: luminance (area under curve)

White Light Orange Light

cgvr.korea.ac.kr Graphics Lab @ Korea University
Color Perception
CGVR

 Tristimulus Theory of
Color
 Spectral-response fun
ctions of each of the th
ree types of cones on t
he human retina

cgvr.korea.ac.kr Graphics Lab @ Korea University

Color Models
CGVR

 RGB
 XYZ
 CMY
 HSV
 Others

cgvr.korea.ac.kr Graphics Lab @ Korea University

RGB Color Model
CGVR

 Colors are Additive R G B Color

0.0 0.0 0.0 Black

1.0 0.0 0.0 Red
0.0 1.0 0.0 Green
0.0 0.0 1.0 Blue
1.0 1.0 0.0 Yellow
1.0 0.0 1.0 Magenta
0.0 1.0 1.0 Cyan
1.0 1.0 1.0 White
cgvr.korea.ac.kr Graphics Lab @ Korea University
RGB Color Cube
CGVR

cgvr.korea.ac.kr Graphics Lab @ Korea University

RGB Spectral Colors
CGVR

 Amounts of RGB Primaries Needed to Display

Spectral Colors

cgvr.korea.ac.kr Graphics Lab @ Korea University

XYZ Color Model (CIE)
CGVR

 Amounts of CIE Primaries Needed to Display

Spectral Colors

cgvr.korea.ac.kr Graphics Lab @ Korea University

CIE Chromaticity Diagram
CGVR

 Normalized Amounts of X and Y for Colors in

Visible Spectrum

(white)

cgvr.korea.ac.kr Graphics Lab @ Korea University

CIE Chromaticity Diagram
CGVR

Define Col Represent Determine

or Gamuts Complementary Dominant Wavelength
Color and Purity

cgvr.korea.ac.kr Graphics Lab @ Korea University

RGB Color Gamut
CGVR

 Color Gamut for a Typical RGB Computer

Monitor

(green)

(red)

(blue)

cgvr.korea.ac.kr Graphics Lab @ Korea University

CMY Color Model
CGVR

 Colors are Subtractive C M Y Color

0.0 0.0 0.0 White

1.0 0.0 0.0 Cyan
0.0 1.0 0.0 Magenta
0.0 0.0 1.0 Yellow
1.0 1.0 0.0 Blue
1.0 0.0 1.0 Green
0.0 1.0 1.0 Red
1.0 1.0 1.0 Black
cgvr.korea.ac.kr Graphics Lab @ Korea University
CMY Color Cube
CGVR

cgvr.korea.ac.kr Graphics Lab @ Korea University

HSV Color Model
CGVR

 Select a Spectral Color (Hue) and the Amount

of White (Saturation) and Black (Value)

cgvr.korea.ac.kr Graphics Lab @ Korea University

HSV Color Model
CGVR

H S V Color
0 1.0 1.0 Red
60 1.0 1.0 Yellow
120 1.0 1.0 Green
180 1.0 1.0 Cyan
240 1.0 1.0 Blue
300 1.0 1.0 Magenta
* 0.0 1.0 White
* 0.0 0.5 Gray
* * 0.0 Black
cgvr.korea.ac.kr Graphics Lab @ Korea University
HSV Color Model
CGVR

 Cross Section of the HSV Hexcone

cgvr.korea.ac.kr Graphics Lab @ Korea University