Polygon clipping - raster graphics and clipping, Computer Graphics

Polygon Clipping - Raster Graphics and Clipping

After considerate the idea of line clipping and its algorithms, we can currently extend the idea of line clipping to polygon clipping, since polygon is a surface enclosed through several lines. Hence, by considering the polygon like a set of line we can divide the trouble to line clipping and thus, the problem of polygon clipping is simplified.

However, it is to be noted that, clipping all edge separately via using a line clipping algorithm will specifically not generate a truncated polygon as one would suppose. Fairly, it would produce a set of line segments that are not connected as the polygon is exploded. In this lies the requirement to use a diverse clipping algorithm to output truncated although yet bounded regions from a polygon input. Sutherland-Hodgman algorithm is one of the standard methods utilized for clipping arbitrary shaped polygons along with a rectangular clipping window. It utilizes divide and conquer method for clipping the polygon.

Posted Date: 4/3/2013 3:40:10 AM | Location : United States







Related Discussions:- Polygon clipping - raster graphics and clipping, Assignment Help, Ask Question on Polygon clipping - raster graphics and clipping, Get Answer, Expert's Help, Polygon clipping - raster graphics and clipping Discussions

Write discussion on Polygon clipping - raster graphics and clipping
Your posts are moderated
Related Questions
Various cases of Cohen Sutherland Line Clippings Currently, we study how this clipping algorithm works. For the sake of simplicity we will tackle all the cases with the assist

Important point about the De casteljeau algorithm 1)      Bezier Curve: P (u) =    ................     (1) Here B n,i (u) = n c i u i (1 - u) n-i        ..

Rotation - 2-D and 3-D transformations Within 2-D rotation, an object is rotated via an angle θ along w.r.t. the origin. This angle is assumed to be +ive for anticlockwise rot

What is reflection?  The reflection is actually the transformation that produces a mirror image of an object. For this use some angles and lines of reflection.

Bezier Curves and Surfaces We had discussed in the previously that we can create complicated geometries along with the aid of polygon meshes that are further constituted of s

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

Bezier Curves - Modeling and Rendering Bezier curves are utilized in computer graphics to turn out curves which display reasonably smooth at all scales. Such spline approximat

Question 1: (a) Explain the term ‘logo' with the use of an example. (b) Explain in detail what three basic questions you need to ask yourself before creating a logo. (c) You

what do you mean by high definition systems? Define aspect ratio?  What is a refresh buffer? What is the difference between bitmap and pitman frame buffer? Explain the basic oper

Pitfalls in computer simulation Though generally avoided in computer simulations, in strict logic the rules governing floating point arithmetic even apply. For illustration, t