Polygon clipping - raster graphics and clipping, Computer Graphics

Assignment Help:

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.


Related Discussions:- Polygon clipping - raster graphics and clipping

Construction of a solid with a translational sweep, Construction of a Solid...

Construction of a Solid with a Translational Sweep Figure demonstrates construction of a solid along with a translational sweep. Translating the control points of the periodic

Consider shiny surface with diffused reflection coefficient, Consider a Shi...

Consider a Shiny Surface Along With Diffused Reflection coefficient Consider a shiny surface along with diffused reflection coefficient of 0.8 and ambient reflection coeffici

Transformation for 3-d scaling, As we already seen that the scaling proces...

As we already seen that the scaling process is mainly utilized to change the size of an object. The scale factors find out whether the scaling is a magnification as s>1 or a red

What is the maximum number of objects such can be handled, What is the maxi...

What is the maximum number of objects such can be handled via the depth/z- buffer algorithm? Solution : In z-buffer algorithm, an arbitrary number of objects can be handled sin

Frame animation non- interactive animation rectangular shape, Frame animati...

Frame animation non- interactive animation rectangular shape (Cartoon movies) It is an "internal" animation method, which is, it is animation within a rectangular frame. This i

Web-based services, Web-based Services: Commonly utilized software is: ...

Web-based Services: Commonly utilized software is: Protected Area Archive characteristics: Image display, roam, zoom and Image enhancement. Simple image processing.

Bresenham rasterisation algorithm, 2. Describe how the Bresenham rasterisat...

2. Describe how the Bresenham rasterisation algorithm is advantageous when compared to any other existing method.

Ellipse generation algorithm - 2d shape primitives, Ellipse Generation Algo...

Ellipse Generation Algorithm  You know that a circle is symmetric in all the octants, while ellipse is symmetric with respect to four quadrants.  Therefore, to draw an ellipse,

Briefly explain types of animation, Question 1 Briefly explain types of an...

Question 1 Briefly explain types of animation Question 2 Briefly explain steps involved in animation process Question 3 What is Layout? Explain two types of layout

Rotation about the origin - 2-d and 3-d transformations, Rotation about the...

Rotation about the origin - 2-d and 3-d transformations Specified a 2-D point P(x,y), which we need to rotate, along with respect to the origin O. The vector OP has a length '

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd