lec5 - Clipping Computer Graphics Lecture 5 Viewing...

Info iconThis preview shows pages 1–10. Sign up to view the full content.

View Full Document Right Arrow Icon
Clipping Computer Graphics Lecture 5
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Viewing pipeline window – a world-coordinate area selected for display Defines what is to be viewed viewport – an area on a display device to which a window in mapped Defines where it is to be displayed Often, windows and viewports are rectangles in standard position with rectangle edges parallel to the coordinate axes
Background image of page 2
Clipping clip-window - the region against which an object clipped clipping algorithm – any procedure that identifies those points of a picture that are either inside or outside of a specified region of space
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Clipping (cont) Example:
Background image of page 4
Main Clipping Algorithms Point clipping Line clipping (straight segment) Area clipping (polygons)
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Point Clipping Assuming that the clip window is a rectangle in standard position, we save a point p=(x,y) for display if the following inequalities are satisfied: max min max min yw y yw xw x xw
Background image of page 6
Line Clipping Example of line clipping algorithm result
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Line Clipping (cont) For a given segment perform ‘inside outside’ tests: Test whether it lies completely inside the clipping window Test whether in lies completely outside the clipping window If any of the previous perform intersection calculations with one or more clipping boundaries
Background image of page 8
Line Clipping (cont) For line starting at (x1,y1) and ending at (x2,y2). The parametric representation is: x=x1+u(x2-x1); Y=y1+u(y2-y1); If the value of ‘u’ for an intersection with
Background image of page 9

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 10
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 26

lec5 - Clipping Computer Graphics Lecture 5 Viewing...

This preview shows document pages 1 - 10. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online