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
explain vecgen algoritham

What is  Raster Scan Display A raster scan display device using CRT on the other hand directs the electron beam across the screen, one row at a time from top to bottom. In a ra


Relation between 2-D Euclidean system and Homogeneous coordinate system Suppose that P(x,y) be any point in 2-D Euclidean system. In HCS, we add a third coordinate to the poin

List out the various Text clipping?  All-or-none string clipping -if all of the string is inside a clip window, keep it or else discards. All-or-none character clipping - disca

General Perspective transformation with COP at the origin Here we suppose the given point P(x,y,z) be projected like P'(x',y',z') on the plane of projection. The center of pro


Subdivision of polygon Test to find out the visibility of a single surface are made through comparing surfaces that as polygons P along regarding a specified screen area A.

examples and equation of reflection