2 Dimensional Veiwing - 27-JUL-2016 - ITE401 - TH PDF

Graphics
2D Viewing
Modified By Prof.Viswanathan.P
pviswanathan@vit.ac.in
Graphics Lab @ Korea University
Contents
3D Rendering Pipeline
Clipping
CGVR
Cohen-Sutherland Line Clipping

Sutherland-Hodgeman Polygon Clipping
Viewport Transformation
Scan Conversion
Summary of Transformation
CGVR
3D Primitives
3D Modeling Coordinates
Model Transformation
3D World Coordinates
Lighting
Viewing Transformation
3D Viewing Coordinates
Projection Transformation
2D Projection Coordinates
Clipping
2D Device Coordinates
Scan Conversion
Image
CGVR
3D Primitives
3D Modeling Coordinates
Model Transformation
Lighting
Viewing Transformation
Projection Transformation
Clipping
Scan Conversion
Image
CGVR
3D Primitives
2D Primitives
Clipping
Scan Conversion
Clip portions of geometric primitives

residing outside window
Transform the clipped primitives

from screen to image coordinates
Fill pixel representing primitives
in screen coordinates
Image
CGVR
3D Primitives
2D Primitives
Clipping
Scan Conversion


Image
Clipping
CGVR
Avoid Drawing Parts of Primitives Outside

Window
Window defines part of scene being viewed

Must draw geometric primitives only inside window
World
Coordinates
Clipping
CGVR

Window
Window defines part of scene being viewed

Must draw geometric primitives only inside window
Clipping
CGVR

Window
Points
Lines
Polygons
Circles
etc.
Point Clipping
CGVR
Is Point(x,y) Inside the Clip Window?
wy2
Inside =
(x>=wx1) &&
(x<=wx2) &&
(x, y)
(y>=wy1) &&
(y<=wy2);
wy1
wx1
wx2
10
Line Clipping
CGVR
Find the Part of a Line Inside the Clip

Window
P7
P1
P4
P8
P3
P2
P6
P5
11
P10
P9
Before Clipping
Line Clipping
CGVR
Find the Part of a Line Inside the Clip

Window
P7
P4
P8
P3
P6
P5
After Clipping
12
Cohen-Sutherland Line
Clipping
CGVR
Use Simple Tests to Classify Easy Cases

First
P7
P1
P4
P8
P3
P2
P6
P5
13
P10
P9
Clipping
CGVR
Classify Some Lines Quickly by AND of Bit Codes

Representing Regions of Two Endpoints (Must Be 0)
1001
P7 1000
1010
Bit 4
P1
P4
0001
P3
P2
0000
P6
0101
P5
Bit 1
P8
0010
14
0100
P10
P9
Bit 3
0110
Bit 2
Clipping
CGVR

1001
P7 1000
1010
Bit 4
P1
P4
0001
P3
P2
0000
P6
0101
P5
Bit 1
P8
0010
15
0100
P10
P9
Bit 3
0110
Bit 2
Clipping
CGVR

1001
P7 1000
1010
Bit 4
P4
0001
P3
P8
0010
0000
P6
0101
P5
Bit 1
16
0100
P10
P9
Bit 3
0110
Bit 2
Clipping
CGVR
Compute Intersections with Window Boundary for

Lines That Cant be Classified Quickly
1001
P7 1000
1010
P4
0001
P3
P8
0010
0000
P6
0101
P5
Bit 1
17
0100
P10
P9
Bit 4
Bit 3
0110
Bit 2
Clipping
CGVR

1001
P7 1000
1010
P4
0001
P3
P8
0010
0000
P6
0101
P5
Bit 1
18
0100
P10
P9
Bit 4
Bit 3
0110
Bit 2
Clipping
CGVR

1001
P7 1000
1010
P4
0001
P3
P8
0010
0000
P6
P5
0101
Bit 1
19
0100
P10
P9
Bit 4
Bit 3
0110
Bit 2
Clipping
CGVR

1001
P7 1000
1010
P4
0001
P3
P8
0010
0000
P6
P5
0101
Bit 1
20
0100
P10
P9
Bit 4
Bit 3
0110
Bit 2
Clipping
CGVR

1001
P7 1000
1010
P4
0001
P3
P8
0010
0000
P6
P5
0101
Bit 1
21
0100
P10
P9
Bit 4
Bit 3
0110
Bit 2
Clipping
CGVR

1001
P7 1000
1010
P4
0001
P3
P8
0010
0000
P6
P5
0101
Bit 1
22
0100
P10
P9
Bit 4
Bit 3
0110
Bit 2
Clipping
CGVR

1001
1000
1010
P7
P4
0001
P3
P8
0010
0000
P6
P5
0101
Bit 1
23
0100
P10
P9
Bit 4
Bit 3
0110
Bit 2
Clipping
CGVR

1001
1000
1010
P7
P4
0001
P3
P8
0010
0000
P6
P5
0101
Bit 1
24
0100
P10
P9
Bit 4
Bit 3
0110
Bit 2
Clipping
CGVR

1001
1000
1010
P7
P4
0001
P3
0000
P8
0010
P6
P5
0101
Bit 1
25
0100
P10
P9
Bit 4
Bit 3
0110
Bit 2
Clipping
CGVR

1001
1000
1010
P7
P4
0001
P3
0000
P8
0010
P6
P5
0101
Bit 1
26
0100
P10
P9
Bit 4
Bit 3
0110
Bit 2
Clipping
CGVR

1001
1000
1010
P7
P4
0001
P3
0000
P8
0010
P6
P5
0101
Bit 1
27
0100
P10
P9
Bit 4
Bit 3
0110
Bit 2
Clipping
CGVR

1001
1000
1010
P7
P4
0001
P3
0000
P8
0010
P6
P5
0101
Bit 1
28
0100
P10
P9
Bit 4
Bit 3
0110
Bit 2
Clipping
CGVR

1001
1000
1010
P7
P4
0001
P3
0000
P8
0010
P6
P5
0101
Bit 1
29
0100
Bit 4
P10
P90110
Bit 3
Bit 2
Clipping
CGVR

1001
1000
1010
P7
P4
0001
P3
0000
P8
0010
P6
P5
0101
Bit 1
30
0100
Bit 4
P10
P90110
Bit 3
Bit 2
Clipping
CGVR

1001
1000
1010
P7
P4
0001
P3
0000
Bit 4
P8
0010
P6
P5
0101
Bit 1
31
Bit 3
0100
0110
Bit 2
Polygon Clipping
CGVR
Find the Part of a Polygon Inside the Clip

Window?
Before Clipping
32
Polygon Clipping
CGVR
Find the Part of a Polygon Inside the Clip

Window?
After Clipping
33
Sutherland-Hodgeman Polygon
Clipping
CGVR
Clip to Each Window Boundary One at a

Time
34
Clipping
CGVR

Time
35
Clipping
CGVR

Time
36
Clipping
CGVR

Time
37
Clipping
CGVR

Time
38
Clipping to a Boundary
CGVR
Do Inside Test for Each Point in Sequence,

Insert New Points When Cross Window Boundary,
Remove Points Outside Window Boundary
P2
P1
Window
Boundary
Inside
P5
P3
Outside
P4
39
CGVR

P2
P1
Window
Boundary
Inside
P5
P3
Outside
P4
40
CGVR

P2
P1
Window
Boundary
Inside
P5
P3
Outside
P4
41
CGVR

P2
P1
Window
Boundary
Inside
P5
P3
Outside
P4
42
CGVR

P2
P1
Window
Boundary P
Inside
P5
P3
Outside
P4
43
CGVR

P2
P1
Window
Boundary P
Inside
P5
P3
Outside
P4
44
CGVR

P2
P1
Window
Boundary P
Inside
P5
P3
Outside
P4
45
CGVR

P2
P1
Window
Boundary P
P
P5
P3
Inside
Outside
P4
46
CGVR

P2
Window
Boundary P
P1
Inside
Outside
47
CGVR
3D Primitives
2D Primitives
Clipping
Scan Conversion


Image
48
CGVR
Transform 2D Geometric Primitives from

Screen Coordinate System (Projection
Coordinates) to Image Coordinate System
(Device Coordinates)
Screen
Image
Viewport
49
Window vs. Viewport
Window
CGVR
World-coordinate area selected for display

What is to be viewed
Viewport
Area on the display device to which a window is

mapped
Where it is to be displayed
50
CGVR
Window-to-Viewport Mapping
Window
wy2
Viewport
vy2
(wx, wy)
wy1
wx1
(vx, vy)
wx2
Screen Coordinates
vy1
vx1
vx2
Image Coordinates
vx = vx1 + (wx wx1) * (vx2 vx1) / (wx2 wx1);

vy = vy1 + (wy wy1) * (vy2 vy1) / (wy2 wy1);
51
CGVR
3D Primitives
2D Primitives
Clipping
Scan Conversion


Image
52
Scan Conversion
Definition
CGVR
Figure out which pixels to fill
Example
Filling the inside of a triangle
P1
P2
53
P3
Triangle Scan Conversion
CGVR
Simple Algorithm
Color all pixels inside a triangle

Inside triangle test
A point is inside a triangle if it is in the positive halfspace of

all three boundary lines
L1
L3
L2
54
Triangle Scan Conversion
CGVR
Triangle Sweep-Line Algorithm
Take advantage of spatial coherence
Compute which pixels are inside using horizontal spans

Process horizontal spans in scan-line order
Take advantage of edge linearity
Use edge slopes to update coordinates incrementally
dx
dy
55
Polygon Scan Conversion
CGVR
Fill Pixels Inside a Polygon
Triangle
Quadrilateral
Convex
Star-Shaped
Concave
Self-Intersecting
Holes
56
Inside Polygon Rule
CGVR
Need Better Test for Points Inside a Polygon
Inside triangle test works only for convex polygon
L2
L5
L2
L5B
L5A
L3
L3
L4
Convex Polygon
57
L4
Concave Polygon
Inside Polygon Rule
CGVR
Odd-Parity Rule
Any ray from P to infinity crosses odd number of

edges
Concave
Self-Intersecting
58
With Holes
CGVR
Polygon Line-Sweep Algorithm
Incremental algorithm to find spans, and determine

insideness with odd-parity rule
Triangle
59
Polygon
CGVR
Hardware Scan Conversion
Convert everything into Triangles
60
Summary of Transformation
CGVR
P(x, y, z)
3D Object Coordinates
Modeling
Transformation
Viewing
Transformation
Projection
Transformation
Window-to-Viewport
Transformation
P(x, y)
61

2 Dimensional Veiwing - 27-JUL-2016 - ITE401 - TH PDF

Diunggah oleh

Informasi Dokumen

Judul Asli

Hak Cipta

Format Tersedia

Bagikan dokumen Ini

Bagikan atau Tanam Dokumen

Opsi Berbagi

Apakah menurut Anda dokumen ini bermanfaat?

Apakah konten ini tidak pantas?

Hak Cipta:

Format Tersedia

2 Dimensional Veiwing - 27-JUL-2016 - ITE401 - TH PDF

Diunggah oleh

Hak Cipta:

Format Tersedia

Graphics

Graphics Lab @ Korea University

Cohen-Sutherland Line Clipping

Graphics Lab @ Korea University

Graphics Lab @ Korea University

Graphics Lab @ Korea University

Clip portions of geometric primitives

Transform the clipped primitives

Graphics Lab @ Korea University

Clip portions of geometric primitives

Transform the clipped primitives

Graphics Lab @ Korea University

Avoid Drawing Parts of Primitives Outside

Window defines part of scene being viewed

Graphics Lab @ Korea University

Avoid Drawing Parts of Primitives Outside

Window defines part of scene being viewed

Graphics Lab @ Korea University

Avoid Drawing Parts of Primitives Outside

Graphics Lab @ Korea University

Is Point(x,y) Inside the Clip Window?

Graphics Lab @ Korea University

Find the Part of a Line Inside the Clip

Find the Part of a Line Inside the Clip

Graphics Lab @ Korea University

Use Simple Tests to Classify Easy Cases

Classify Some Lines Quickly by AND of Bit Codes

Classify Some Lines Quickly by AND of Bit Codes

Classify Some Lines Quickly by AND of Bit Codes

Compute Intersections with Window Boundary for

Compute Intersections with Window Boundary for

Compute Intersections with Window Boundary for

Compute Intersections with Window Boundary for

Compute Intersections with Window Boundary for

Compute Intersections with Window Boundary for

Compute Intersections with Window Boundary for

Compute Intersections with Window Boundary for

Compute Intersections with Window Boundary for

Compute Intersections with Window Boundary for

Compute Intersections with Window Boundary for

Compute Intersections with Window Boundary for

Compute Intersections with Window Boundary for

Compute Intersections with Window Boundary for

Compute Intersections with Window Boundary for

Find the Part of a Polygon Inside the Clip

Graphics Lab @ Korea University

Find the Part of a Polygon Inside the Clip

Graphics Lab @ Korea University

Clip to Each Window Boundary One at a

Graphics Lab @ Korea University

Clip to Each Window Boundary One at a

Graphics Lab @ Korea University

Clip to Each Window Boundary One at a

Graphics Lab @ Korea University

Clip to Each Window Boundary One at a

Graphics Lab @ Korea University

Clip to Each Window Boundary One at a

Graphics Lab @ Korea University

Do Inside Test for Each Point in Sequence,

Graphics Lab @ Korea University

Do Inside Test for Each Point in Sequence,

Graphics Lab @ Korea University

Do Inside Test for Each Point in Sequence,