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
1. Implement the boundary fill algorithm and flood fill algorithm in C-language and use your code to fill two different types of closed areas such as  i)  A Circle ii)  A sel

Question 1 Explain Bresenham's Circle Drawing Algorithm Question 2 Derive the matrix for inverse transformation Question 3 Discuss the following Raster Graphic Algorithm

Bitmap Graphics: The information below illustrates bitmap data. Bitmap images are a set of bits that form an image. The image comprises a matrix of individual dots or pixels wh

Passive Computer Animations: That has no option for users to utilize computer graphics today is mostly interactive for example: movies. Frame animation is non-interactive anim

Intersection Test - Visible Surface Detection Test: It called Intersection Test also: we go for intersection test, if Min-max test fails. Now we take each edge individually

Key Frame Systems - computer animation This method is for low-level motion control. In fact these systems comprise languages that are designed simply to produce the in-between

Magnify a triangle with vertices A = (1,1), B = (3,1) and C = (2,2) to twice its size in such a way that A remains in its original position.  Answer: You need to apply scaling b

Persistence: How long they continue to emit light (that is, have excited electrons returning to the ground state) after the CRT beam is removed. Persistence is defined as the ti

Advantages of JPEG Images Huge compression ratios mean sooner download speeds. JPEG produces outstanding results for main photographs and complicated images. JPEG s

Frame Buffers - Graphics Hardware The storage region in a raster scan display system is set as a two-dimensional table. All row-column entry stores information as brightness