4 Viewing2d

Graphics
2D Viewing
cgvr.korea.ac.kr 1 Graphics Lab @ Korea University

Contents
CGVR
 3D Rendering Pipeline
 2D Rendering Pipeline
 Clipping
 Cohen-Sutherland Line Clipping
 Sutherland-Hodgeman Polygon Clipping
 Viewport Transformation
 Scan Conversion
 Summary of Transformation

3D Rendering Pipeline
CGVR
3D Primitives
3D Modeling Coordinates
Model
Model Transformation
Transformation
3D World Coordinates
Lighting
Lighting
Viewing
Viewing Transformation
Transformation
3D Viewing Coordinates
Projection
Projection Transformation
Transformation
2D Projection Coordinates
Clipping
Clipping
Viewport
Viewport Transformation
Transformation
2D Device Coordinates
Scan
Scan Conversion
Conversion
Image 2D Device Coordinates
CGVR
3D Primitives
3D Modeling Coordinates
Model
Model Transformation
Transformation
Lighting
Lighting
Viewing
Viewing Transformation
Transformation
Projection
Projection Transformation
Transformation
Clipping
Clipping
Viewport
Transformation
Scan
Scan Conversion
Conversion
Image 2D Device Coordinates
CGVR
3D Primitives
2D Primitives
Clip portions of geometric primitives

Clipping
Clipping residing outside window
Transform the clipped primitives

Viewport
Transformation from screen to image coordinates
Fill pixel representing primitives

Scan
Scan Conversion
Conversion in screen coordinates
Image
CGVR
3D Primitives
2D Primitives

Clipping

Viewport

Scan
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
Inside ==
(x>=wx1)
(x>=wx1) &&
&&
(x, y) (x<=wx2)
(x<=wx2) &&
&&
(y>=wy1)
(y>=wy1) &&
&&
(y<=wy2);
(y<=wy2);
wy1
wx1 wx2

Line Clipping
CGVR
 Find the Part of a Line Inside the Clip

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

Window
P’7
P4 P’8
P3
P6
P’5
After Clipping
Cohen-Sutherland Line
Clipping CGVR
 Use Simple Tests to Classify Easy Cases

First
P7
P1
P4 P8
P3
P2
P6
P10
P5 P9

Clipping CGVR
 Classify Some Lines Quickly by AND of Bit Codes

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

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

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

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

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

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

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

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

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

1001 0001
P’7 0101
Bit 4
P4 P8
1000 P3 0000 0100
P6
P10
Bit 3
1010 P’5 0010 0110
P9
Bit 1 Bit 2
Clipping CGVR

1001 0001
P’7 0101
Bit 4
P4 P8
1000 P3 0000 0100
P6
P10
Bit 3
1010 P’5 0010 0110
P9
Bit 1 Bit 2
Clipping CGVR

1001 0001
P’7 0101
Bit 4
P4 P’8
1000 P3 0000 0100
P6
P10
Bit 3
1010 P’5 0010 0110
P9
Bit 1 Bit 2
Clipping CGVR

1001 0001
P’7 0101
Bit 4
P4 P’8
1000 P3 0000 0100
P6
P10
Bit 3
1010 P’5 0010 0110
P9
Bit 1 Bit 2
Clipping CGVR

1001 0001
P’7 0101
Bit 4
P4 P’8
1000 P3 0000 0100
P6
P10
Bit 3
1010 P’5 0010 0110
P9
Bit 1 Bit 2
Clipping CGVR

1001 0001
P’7 0101
Bit 4
P4 P’8
1000 P3 0000 0100
P6
P10
Bit 3
1010 P’5 0010 0110
P9
Bit 1 Bit 2
Clipping CGVR

1001 0001
P’7 0101
Bit 4
P4 P’8
1000 P3 0000 0100
P6
P10
Bit 3
1010 P’5 0010 P’90110
Bit 1 Bit 2
Clipping CGVR

1001 0001
P’7 0101
Bit 4
P4 P’8
1000 P3 0000 0100
P6
P10
Bit 3
1010 P’5 0010 P’90110
Bit 1 Bit 2
Clipping CGVR

1001 0001
P’7 0101
Bit 4
P4 P’8
1000 P3 0000 0100
P6
Bit 3
1010 P’5 0010 0110
Bit 1 Bit 2
Polygon Clipping
CGVR
 Find the Part of a Polygon Inside the Clip

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

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

Time

Clipping CGVR

Time

Clipping CGVR

Time

Clipping CGVR

Time

Clipping CGVR

Time

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
Outside
P3 P5
P4
CGVR

P2 P1
Window
Boundary Inside
Outside
P3 P5
P4
CGVR

P2 P1
Window
Boundary Inside
Outside
P3 P5
P4
CGVR

P2 P1
Window
Boundary Inside
Outside
P3 P5
P4
CGVR

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

P2 P1
Window
Outside
P3 P5
P4
CGVR

P2 P1
Window
Outside
P3 P5
P4
CGVR

P2 P1
Window
Boundary P’ P” Inside
Outside
P3 P5
P4
CGVR

P2 P1
Window
Boundary P’ P” Inside
Outside

CGVR
3D Primitives
2D Primitives

Clipping

Viewport

Scan
Scan Conversion
Image
CGVR
 Transform 2D Geometric Primitives from

Screen Coordinate System (Projection
Coordinates) to Image Coordinate System
(Device Coordinates)
Screen Image
Viewport

Window vs. Viewport
CGVR
 Window
 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

CGVR
 Window-to-Viewport Mapping
Window Viewport
wy2 vy2
(wx, wy) (vx, vy)

wy1 vy1
wx1 wx2 vx1 vx2
Screen Coordinates Image Coordinates
vx
vx == vx1
vx1 ++ (wx
(wx –– wx1)
wx1) ** (vx2
(vx2 –– vx1)
vx1) // (wx2
(wx2 –– wx1);
wx1);
vy
vy == vy1
vy1 ++ (wy
(wy –– wy1)
wy1) ** (vy2
(vy2 –– vy1)
vy1) // (wy2
(wy2 –– wy1);
wy1);

CGVR
3D Primitives
2D Primitives

Clipping

Viewport

Scan
Scan Conversion
Image
Scan Conversion
CGVR
 Definition
 Figure out which pixels to fill
 Example
 Filling the inside of a triangle
P1
P2
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
P
L2
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

Polygon Scan Conversion
CGVR
 Fill Pixels Inside a Polygon

 Triangle
 Quadrilateral
 Convex
 Star-Shaped
 Concave
 Self-Intersecting
 Holes

Inside Polygon Rule
CGVR
 Need Better Test for Points Inside a Polygon

 “Inside triangle test” works only for convex polygon
L L
1 1
L2 L5 L2 L5B
L5A
L3 L3
L4 L4
Convex Polygon Concave Polygon

Inside Polygon Rule
CGVR
 Odd-Parity Rule
 Any ray from P to infinity crosses odd number of
edges
Concave Self-Intersecting With Holes

CGVR
 Polygon Line-Sweep Algorithm

 Incremental algorithm to find spans, and determine
insideness with odd-parity rule
Triangle Polygon
CGVR
 Hardware Scan Conversion

 Convert everything into Triangles

Summary of Transformation
CGVR
P(x, y, z)
3D Object Coordinates
Modeling
Modeling
Transformation
Transformation
Viewing
Viewing
Transformation
Transformation
Projection
Projection
Transformation
Transformation
Window-to-Viewport
Window-to-Viewport
Transformation
Transformation
P(x, y)

4 Viewing2d

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

4 Viewing2d

Uploaded by

Copyright:

Available Formats

Graphics

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

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

Clip portions of geometric primitives

Transform the clipped primitives

Fill pixel representing primitives

Clip portions of geometric primitives

Transform the clipped primitives

Fill pixel representing primitives

 Avoid Drawing Parts of Primitives Outside

 Avoid Drawing Parts of Primitives Outside

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

 Avoid Drawing Parts of Primitives Outside

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

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

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

 Find the Part of a Line Inside the Clip

 Find the Part of a Line Inside the Clip

 Use Simple Tests to Classify Easy Cases

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

 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

 Find the Part of a Polygon Inside the Clip

 Clip to Each Window Boundary One at a

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

 Clip to Each Window Boundary One at a

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

 Clip to Each Window Boundary One at a

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

 Clip to Each Window Boundary One at a

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

 Clip to Each Window Boundary One at a

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

 Do Inside Test for Each Point in Sequence,

 Do Inside Test for Each Point in Sequence,

 Do Inside Test for Each Point in Sequence,

 Do Inside Test for Each Point in Sequence,

 Do Inside Test for Each Point in Sequence,

 Do Inside Test for Each Point in Sequence,

 Do Inside Test for Each Point in Sequence,

 Do Inside Test for Each Point in Sequence,

 Do Inside Test for Each Point in Sequence,

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

Clip portions of geometric primitives

Transform the clipped primitives