Polygon or area clipping algorithm, Computer Graphics

Polygon or Area Clipping Algorithm - Sutherland-Hodgman Algorithm

There are different algorithms as Liang-Barsky, Line clipping, Weiler-Atherton Polygon Clipping, which are fairly efficient in performing the job of clipping images. Although we will limit our discussion to the clipping algorithms declared previous.

Before going get any further details of point clipping, here we look at several basic terminologies utilized in the field of clipping, as viewport and window.

- Window may be explained as the world coordinate region selected for display.

-  Viewport may be explained as the region on a display device on that the window is mapped.

Consequently, it is the window that identifies what is to be displayed or shown whereas viewport identifies where it is to be shown or displayed.

Identifies these two coordinates:

Window and viewport coordinates and also the transformation from window to viewport coordinates are extremely necessary from the point of view of clipping.

Posted Date: 4/3/2013 2:42:39 AM | Location : United States







Related Discussions:- Polygon or area clipping algorithm, Assignment Help, Ask Question on Polygon or area clipping algorithm, Get Answer, Expert's Help, Polygon or area clipping algorithm Discussions

Write discussion on Polygon or area clipping algorithm
Your posts are moderated
Related Questions
Write a program that allows interactive manipulation of the position and orientation of a camera. Draw a teapot at the global origin 0,0,0. You can find a shaded teapot model and



Question 1: (a) Describe what you understand by Rotoscoping in Graphic effects. Give details how Rotoscoping could be achieved in After Effects CS3. (b) Using one algorithm

Example 1: Draw line segment from point (2, 4) to (9, 9) by using Digital Differential Analyzer algorithm. Solution: We know usual equation of line is specified via y = mx

Delta-Delta Arrangement and In-Line Arrangement There are two types of shadow masks available, delta-delta arrangement and in-line arrangement. The in-line arrangement refers t

Explain depth buffer method

1. By using Digital Differential Analyzer algorithm draw line segments from point (1,1) to (9,7). Ans. We see that the usual equation of the line is specified by: y = mx+c

What are the utilizations of Inverse transformation? Provide the Inverse transformation for translation, shearing, reflection, scaling and rotation. Solution: We have observed

Visible-Surface Detection For the generation of realistic graphics display you know that hidden surfaces and hidden lines should be identified for removing. For this reason we