Cases of the sutherland hodgman polygon clipping algorithm, Computer Graphics

Assignment Help:

Cases of the Sutherland Hodgman Polygon Clipping Algorithm

In order to clip polygon edges against a window edge we move from vertex Vi to the subsequent vertexVi+1 and choose the output vertex as per to four simple tests or rules or cases listed here in below:

Table: Cases of the Sutherland-Hodgman Polygon Clipping Algorithm

Case

Vi

Vi+1

Output Vertex

A

Inside window)

Inside

Vi+1

B

Inside

Outside

V'i   i.e  intersection of polygon and window edge

C

Outside

Outside

None

D

Outside

Inside

V'I  ; Vi+1

Conversely, the 4 possible Tests listed above to clip any polygon conditions are as mentioned here:

1) If both Input vertices are within the window boundary then only second vertex is added to output vertex list.

2) If first vertex is within the window boundary and the 2nd vertex is outside then, merely the intersection edge along with boundary is added to output vertex.

3) If both Input vertices are outside the window boundary then nothing is added to the output list.

4) If the first vertex is outside the window and the 2nd vertex is within window, then both the intersection points of the polygon edge along with window boundary and second vertex are added to output vertex list.

Here, we can utilize the rules cited above to clip a polygon properly. The polygon should be tested against each edge of the clip rectangle; new edges should be added and existing edges must be discarded, retained or divided. In fact this algorithm decomposes the problem of polygon clipping against a clip window in the same sub-problem where a sub-problem is to clip all polygon edges that is pair of vertices in succession against a particular infinite clip edge. The output is a set of clipped edges or pair of vertices which fall in the visible side along w.r.t. clip edge. Such set of clipped edges or output vertices are taken as input for the subsequent sub-problem of clip against the second window edge. Hence, identifying the output of the earlier sub-problem as the input, all of the sub-problems are solved in sequence, at last yielding the vertices which fall on or inside the window boundary. These vertices linked in order forms, the shape of the clipped polygon.


Related Discussions:- Cases of the sutherland hodgman polygon clipping algorithm

What do you understand by the term image compositing, Question 1: (a) E...

Question 1: (a) Explain in detail what you understand by the term image compositing and where it is more often used? (b) You are given 3-5 images to make a photo montage/ima

Reflection, What is the advantages and disadvantages of reflection ?

What is the advantages and disadvantages of reflection ?

Application areas of computer graphics, Explain application areas of comput...

Explain application areas of computer graphics in different areas.    Early computer graphics has only certain special capabilities such as straight lines circles and ellipses

Vecgen algorithm, explain vecgen line drawing algorithm

explain vecgen line drawing algorithm

What are spot colours, Question 1: Name at least four file formats an...

Question 1: Name at least four file formats and explain in detail what they mean and how they are use? Question 2: What are "Process Colours"? Answer in a single para

Mpeg-1, MPEG-1 : MPEG-1 that is Moving Picture Experts Group format 1 is a...

MPEG-1 : MPEG-1 that is Moving Picture Experts Group format 1 is an industry standard encoding format that is broadly used. Its normal format is a frame size of about 352 x 240 an

What is translation, What is translation?  Translation is the process o...

What is translation?  Translation is the process of changing the position of an object in a straight-line path from one coordinate location to another. Each point (x, y) in the

Bezier curves - 2d shape primitives, Bezier curves: Theses are special...

Bezier curves: Theses are special polynomial curves expressed using Bernstein polynomials. Spline curves are simple extensions of Bézier curves composed of two or more polynom

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