2D Viewing: Prepared By: K. R. Rathod, A. K. Ranpura, A. R. Rathod

Graphics
CCET
2D Viewing
1 Prepared By : K. R. Rathod, Graphics

A. K. Ranpura, A. R. Rathod
Lab @ Korea University
3D Rendering Pipeline CCET
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
3D Viewing Coordinates
Projection
Projection Transformation
Transformation
Clipping
Clipping
Viewport
Transformation
2D Device Coordinates
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
Clipping CCET
CGVR
 Avoid Drawing Parts of Primitives Outside

Window
 Window defines part of scene being viewed
 Must draw geometric primitives only inside window
World
Coordinates
2-Dimensional Views CCET
CGVR
 A 2-dimensional view is defined by two rectangles we

will refer to them as:
 A Window given in real world co-ordinates, e.g.
meters, feet etc… defining the portion of model
{scene} to be drawn
 A Viewport given in screen co-ordinates, pixels,
defining the portion of the screen which will be used to
display the contents of the window
 Note that confusingly, some textbooks sometimes

use these terms interchangeably to describe the
original rectangle (the window).

Viewing Issues CCET
CGVR
 A Rasterization Issue
 How much of the data should be drawn?

 Where should it appear on the display?
 e.g: We could have a model of a whole room, full of
objects such as chairs, tables, and students.
 We may want to view the whole room in one go, or
zoom in on one single object in the room.
 We may want to display the object or scene on the
full screen, or we may only want to display it on a
portion of the screen

Screen Co-ordinates CCET
CGVR
 In our final display, i.e. the frame buffer, images are

specified in terms of pixels
(screen coordinates defined with integer values) whereas
our original data is in real-number coordinates (modelling
coordinates)
 We need to apply transformations to convert from

Modelling co-ordinates to Screen Coordinates
 We can scale dimensions to change the resulting view
 We can even achieve a zooming in and out effect without

changing the model by scaling dimensions proportionally

Implementation tasks CCET
CGVR
What goes on inside the graphics system
Geometric Rasterization Display

Modeling
Processing
•Transformation
•Representa- &Normalization •Scan
tion of conversion •Color
geometric •Clipping
•Antialiasing mapping
objects •Hidden surface
removal

The Viewport CCET
CGVR
 We need to associate the 2D viewport co-ordinate

system with the screen co-ordinate system in order
to determine the correct pixel associated with each
vertex.
Real-world
screen co-ordinates
co-ordinates

Windows and Viewports CCET
CGVR
{wxmax,wymax}
{vxmax,vymax}
{vx,vy}
{wx,wy}
{vxmin,vymin}
{wxmin,wymin}
For any point {wx, wy} in the real-world window, what is
the corresponding pixel position?

Clipping CCET
CGVR
 Avoid Drawing Parts of Primitives Outside Window

 Window defines part of scene being viewed
 Must draw geometric primitives only inside window

Clipping CCET
CGVR
 Avoid Drawing Parts of Primitives Outside

Window
 Points
 Lines
 Polygons
 Circles

Point Clipping CCET
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

DIVISION OF SPACE CCET
CGVR
ymax
Clip Region
(Includes
Boundary)
ymin
x min x max
COHEN SUTHERLAND CLIPPING CCET
CGVR
Outcodes
y  ymax x  xmax
0 1 0 1
y  y min x  x min

Region Outcodes CCET
CGVR
1001 1000 1010
ymax
0001 0000 0010
ymin
0101 0100 0110
x min x max

Trivial Acceptance: O(P0) | O(P1) = 0 CCET
CGVR
1001 1000 1010
ymax
P1
0001 0000 0010
P0
ymin
0101 0100 0110
x min x max

Trivial Rejection: O(P0) & O(P1) != 0 CCET
CGVR
P0
1001 1000 1010
P1
ymax
P0
0001 0000 0010
ymin
P0
P1 P1
0101 0100 0110
x min x max

Outside vs. Inside CCET
CGVR
1001 1000 1010
ymax
0001 0000 0010
ymin
0101 0100 0110
x min x max
= “Inside”
Cohen-Sutherland Clipping:
The Algorithm CCET
CGVR
 Compute the outcodes for the two vertices

 Test for trivial acceptance or rejection
 Select a vertex for which outcode is not zero

 There will always be one
 Select the first nonzero bit in the outcode to define the boundary
against which the line segment will be clipped
 This defines a fixed order for the test
 Compute the intersection and replace the vertex with the

intersection point
 Compute the outcode for the new point and iterate

EXAMPLE1 CCET
CGVR
A
1001 1000 1010
B
ymax
0001 0000 0010
ymin
0101 0100 0110
x min x max

EXAMPLE1 CCET
CGVR
1001 1000 1010
B
ymax
0001 0000 0010
ymin
0101 0100 0110
x min x max

EXAMPLE2 CCET
CGVR
1001 1000 1010

E
ymax
D
0001 0000 0010

C
ymin
B
A
0101 0100 0110
x min x max

EXAMPLE2 CCET
CGVR
1001 1000 1010

E
ymax
D
0001 0000 0010

C
ymin
B
0101 0100 0110
x min x max

EXAMPLE2 CCET
CGVR
1001 1000 1010
ymax
D
0001 0000 0010

C
ymin
B
0101 0100 0110
x min x max

EXAMPLE2 CCET
CGVR
1001 1000 1010
ymax
0001 0000 0010

C
ymin
B
0101 0100 0110
x min x max

Advantages / Extension CCET
CGVR
 Easily extended to 3 dimensions by adding two bits

to the outcode for the z axis.
 Calculations then reduce to intersection of line with

plane
 Algorithm most efficient when most segments can

either be trivially accepted or trivially rejected
 Disadvantages: unnecessary intersection

calculations

Liang-Barsky Parametric Clipping CCET
CGVR

CGVR

CGVR

CGVR

CGVR

CGVR

CGVR

CGVR

CGVR

CGVR

Nicholl-Lee-Nicholl Line-cipping CCET
CGVR

CGVR

CGVR

Weiler-Atherton Polygon clipping CCET
CGVR

Weiler-Atherton Polygon clipping CCET
CGVR

Polygon Clipping CCET
CGVR
 Find the Part of a Polygon Inside the Clip

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

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

Time

CGVR

Time

CGVR

Time

CGVR

Time

CGVR

Time

CGVR
Top Bottom Right Left

CGVR
Pipeline Clipping (x 1 , y 1 )
(x3 , y3 )
(x 4 , y 4 )
(x 5 , y 5 )
(x 2 , y 2 )
(x1 , y1 ) (x3 , y3 ) (x3 , y3 ) (x 3 , y3 ) (x 3 , y3 )

(x 2 , y 2 ) (x 2 , y 2 ) (x5 , y 5 ) (x5 , y5 ) (x 4 , y 4 )
Top Bottom Right Left

Clipping to a Boundary CCET
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
Viewport Transformation CCET
CGVR
 Transform 2D Geometric Primitives from Screen

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

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

Viewport Transformation CCET
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);

Window to Viewport Mapping CCET
CGVR
Preservation of horizontal ratios implies that:

wx  wxmin wxmax  wxmin

vx  vxmin vxmax  vxmin
So, solving for vx:

vxmax - vxmin
vx  ( wx - wx min ) *  vxmin
wxmax - wxmin
vy can be solved for similarly:

vymax - vymin
vy  ( wy - wy min ) *  vymin
wy max - wy min

Example CCET
CGVR
0.4
0.3
-0.4 -0.2
 Say we want to map this to a
640x480 viewport
 Where is the black point

mapped in screen coordinates? 480
640
Solution CCET
CGVR
wx  -0.2 vxmax  640
wy  0.3
vxmin  0 320
wxmax  0
wxmin  -0.4
vymax  0
120
wy max  0.4 vymin  480
wy min  0
vxmax - vxmin
vx  ( wx - wx min )*  vxmin
wx max - wxmin
vymax - vymin
vy  ( wy - wy min ) *  vymin
wy max - wy min
(640-0)
vx  (-0.2 -(-0.4))   0  320
0  ( 0.4)
(0- 480)
vy  (0.3 - 0)   480  120
0.4  (0)
Repeat this for all vertices and then rasterize.
CGVR
3D Primitives
2D Primitives

Clipping

Viewport

Scan
Scan Conversion
Image
Scan Conversion CCET
CGVR
 Definition
 Figure out which pixels to fill
 Example
 Filling the inside of a triangle
P1
P2
P3
Triangle Scan Conversion CCET
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
 (Odd-even parity rule, Non-zero winding rule)
 Take advantage of edge linearity
 Use edge slopes to update coordinates incrementally
dx
dy


2D Viewing: Prepared By: K. R. Rathod, A. K. Ranpura, A. R. Rathod

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

2D Viewing: Prepared By: K. R. Rathod, A. K. Ranpura, A. R. Rathod

Uploaded by

Copyright:

Available Formats

Graphics

1 Prepared By : K. R. Rathod, Graphics

Clip portions of geometric primitives

Transform the clipped primitives

Fill pixel representing primitives

 Avoid Drawing Parts of Primitives Outside

 A 2-dimensional view is defined by two rectangles we

 Note that confusingly, some textbooks sometimes

6 Prepared By : K. R. Rathod, Graphics

 How much of the data should be drawn?

7 Prepared By : K. R. Rathod, Graphics

 In our final display, i.e. the frame buffer, images are

 We need to apply transformations to convert from

 We can scale dimensions to change the resulting view

 We can even achieve a zooming in and out effect without

8 Prepared By : K. R. Rathod, Graphics

What goes on inside the graphics system

Geometric Rasterization Display

9 Prepared By : K. R. Rathod, Graphics

 We need to associate the 2D viewport co-ordinate

10 Prepared By : K. R. Rathod, Graphics

11 Prepared By : K. R. Rathod, Graphics

 Avoid Drawing Parts of Primitives Outside Window

12 Prepared By : K. R. Rathod, Graphics

 Avoid Drawing Parts of Primitives Outside

13 Prepared By : K. R. Rathod, Graphics

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

14 Prepared By : K. R. Rathod, Graphics

16 Prepared By : K. R. Rathod, Graphics

1001 1000 1010

0001 0000 0010

0101 0100 0110

17 Prepared By : K. R. Rathod, Graphics

1001 1000 1010

0001 0000 0010

0101 0100 0110

18 Prepared By : K. R. Rathod, Graphics

0101 0100 0110

19 Prepared By : K. R. Rathod, Graphics

1001 1000 1010

0001 0000 0010

0101 0100 0110

 Compute the outcodes for the two vertices

 Select a vertex for which outcode is not zero

 Compute the intersection and replace the vertex with the

21 Prepared By : K. R. Rathod, Graphics

0001 0000 0010

0101 0100 0110

22 Prepared By : K. R. Rathod, Graphics

1001 1000 1010

0001 0000 0010

0101 0100 0110

23 Prepared By : K. R. Rathod, Graphics

1001 1000 1010

0001 0000 0010

24 Prepared By : K. R. Rathod, Graphics

1001 1000 1010

0001 0000 0010

0101 0100 0110

25 Prepared By : K. R. Rathod, Graphics

1001 1000 1010

0001 0000 0010