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

Sutherland cohen line clipping algorithm, Describe briefly Sutherland Cohen...

Describe briefly Sutherland Cohen line clipping algorithm.   OR   Describe Cohen Sutherland line clipping algorithm. Cohen Sutherland line clipping algorithm In this algorith

Cases for digital differential analyzer algorithm, Cases for Digital Differ...

Cases for Digital Differential Analyzer Algorithm 1)  If in case 1, we plot the line another way round that is, moving in y direction via 1 unit every time and after that hunt

Scan line algorithm and seed fill algorithm, Scan line algorithm and seed f...

Scan line algorithm and seed fill algorithm Two basic approaches are followed in area filling on raster systems.  In the first approach overlap intervals for scan lines that cr

Delta-delta arrangement and in-line arrangement, Delta-Delta Arrangement an...

Delta-Delta Arrangement and In-Line Arrangement There are two types of shadow masks available, delta-delta arrangement and in-line arrangement. The in-line arrangement refers t

Transformation for isometric projection - transformation, Transformation fo...

Transformation for Isometric projection - Transformation Suppose that P(x,y,z) be any point in a space.  Assume as a given point P(x,y,z) is projected to the P'(x'y',z') on t

Depth-buffer (or z-buffer) method , Depth-buffer (or z-buffer) Method ...

Depth-buffer (or z-buffer) Method  Z-buffer method is a fast and easy technique for specifying visible-surfaces. Z-buffer method is also termed to as the z-buffer method, as

Multimedia resources, Education courses, skills, and knowledge are sometime...

Education courses, skills, and knowledge are sometimes taught of context because of lack of application of real time examples. To resolve this, educators are using multimedia to br

Example of bezier curves - modeling and rendering, To prove: P (u = 0) = p0...

To prove: P (u = 0) = p0 Solution : = p 0 B n,0 (u) + p 1 B n, 1 (u) +...... + p n B n, n (u)...............(1)  B n,i (u) = n c i u i (1 - u) n-i B n,0

B splines, What is uniform rational splines

What is uniform rational splines

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