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
Curve Clipping and Character Clipping As you proceed further, you would see that the methods for curve clipping and character clipping have also been developed based on boundin

Analise floodfill algirithm & boundryfillalgorithim

Subdivision Algorithm - Visible Surface Detection 1) Initialize the area to be the whole screen. 2) Create a PVPL regarding an area, sorted on z min as the smallest z coor

What is resolution? Ans. The maximum number of points that can be shown without an overlap on a CRT is known as resolution.


Scaling, shear, reflection and Viewing coordinates 1) Scaling, shear and reflection operations have natural extensions to 3D.    2)  Viewing coordinates are the coordinates

Ask questionkms eey frame syst #Minimum 100 words accepted#

Orthographic and Oblique Projection - Viewing Transformation Orthographic projection is the easiest form of parallel projection that is commonly utilized for engineering drawi

Liang Barsky line clipping algorithm : The algorithm uses parametric form of the line segment.  Four inequalities are created using the parametric form of the line segments.  Th

Problem : a. (i) Give another name for adjacent color. (ii) Describe briefly what do you understand by an adjacent color? b. (i) Describe briefly what do you unders