2-D Viewing and Clipping - Raster Graphics and  Clipping

In the previous two units of this block, we illustrated the basic elements of computer graphics, that is, the hardware and the software utilized for graphic systems with the graphic primitives utilized to create graphic images. Here, we are in a position to discuss technicalities concerned to the display of any graphic image or primitive. So let us start with, the idea of clipping for both line and point clipping, followed via the concerned algorithms utilized to perform line clipping. We shall subsequently examine the idea and algorithm associated to polygon clipping and end with a discussion on window to viewport transformations.

Clipping may be explained as the procedure which considers the portions of a picture lie within the region, and thus, it should be shown or outside the particular region, and therefore, not to be drawn. The algorithms which perform the task of clipping are termed as clipping algorithms there are different types, as:

• Polygon Clipping
• Curve Clipping
• Point Clipping
• Line Clipping
• Text Clipping

Additionally, there are a broad variety of algorithms which are designed to do specific types of clipping operations, several of them that will be discussed in section.

Line Clipping Algorithms:

• Cohen Sutherland Line Clippings
• Cyrus-Beck Line Clipping Algorithm