Application of sutherland hodgman polygon clipping, Computer Graphics

Assignment Help:

For good understanding of the application of the rules specified above see the following figure, where the shaded region demonstrates the clipped polygon.

801_Application of Sutherland Hodgman Polygon Clipping.png

Figure: Sutherland-Hodgman Polygon Clipping

Pseudo code for Sutherland - Hodgman Algorithm

Define variables

In VertexArray is the array of input polygon vertices

outVerteArray is the array of output polygon vertices

Nin is the number of entries in inVertexArray

Nout is the number of entries in outVertexArray

n is the number of edges of the clip polygon

ClipEdge[x] is the xth edge of clip polygon defined by a pair of vertices

s, p are the start and end point respectively of current polygon edge

i is the intersection point with a clip boundary

j is the vertex loop counter

Define Functions

AddNewVertex(newVertex, Nout, outVertexArray)

: Adds newVertex to outVertexArray and then updates Nout

InsideTest(testVertex, clipEdge[x])

: Checks whether the vertex lies inside the clip edge or not;

  retures         TRUE is inside else returns FALSE

Intersect (first, second, clipEdge[x])

: Clip polygon edge (first, second) against clipEdge[x], outputs the intersection point

{                                        :  begin main

x = 1

while (x ≤ n)                     : Loop through all the n clip edges

{

Nout = 0                            : Flush the outVertexArray

s = inVertexArray[Nin] : Start with the last vertex in inVertexArray

for j = 1 to Nin do             : Loop through Nin number of polygon vertices (edges)

{

p = inVertexArrray[j]

if InsideTest(p, clipEdge[x] = = TRUE then                     : Case A

and D

if InsideTest(s, clipEdge[x] = = TRUE then

AddNewVertex(p, Nout, outVertexArray)                        : Case A

else

i = Intersect(s, p, clipEdge[x])                           :  Case D

AddNewVertex(i, Nout, outVertexArray)

AddNewVertex(p, Nout, outVertexArray)

end if

else      :  i.e. if InsideTest(p, clipEdge[x] = = FALSE

(Cases 2 and 3)

if InsideTest(s, clipEdge[x]) = =TRUE then                     : Case B

{

 Intersect(s, p, clipEdge[x])

AddNewVertex(i, Nout, outVertexArray)

end if                                        : No action for case C

 

s = p                                         : Advance to next pair of vertices j = j + 1

end if                                         :  end {for}

}

x = x + 1                                     : Proceed to the next ClipEdge[x +1]

Nin = Nout

inVertexArray = outVertexArray            :  The output vertex array for the current clip edge becomes the input vertex array for the next clip edge

}                                        : end while

}                                        : end main


Related Discussions:- Application of sutherland hodgman polygon clipping

Algorithms for identification of observable objects, Algorithms for Identif...

Algorithms for Identification of Observable Objects There are various algorithms for identification of observable objects for various types of applications. Several methods ne

What is aspect ratio, What is Aspect ratio?  The ratio of vertical poin...

What is Aspect ratio?  The ratio of vertical points to the horizontal points essential to produce length of lines in both directions of the screen is known as the Aspect ratio.

Describe digital printing and prepress, Question 1: (a) Describe Digita...

Question 1: (a) Describe Digital Printing and Prepress? Also state the advantages and disadvantages of Digital printing? Question 2: (a) What are the three most import

Painting and drawing tools in multimedia, Painting and Drawing Tools Pa...

Painting and Drawing Tools Painting software is offered to producing crafted bitmapped images. Drawing software as Corel Draw and Canvas is offered to generating vector depend

Question, what are the steps involved in 3d transformation explain

what are the steps involved in 3d transformation explain

How we create virtual reality images for use on a computers, How we create ...

How we create virtual reality images for use on a computer system When a virtual tour of, for instance, a house is shown on a website the images need to be first created and th

What is shearing, What is shearing?  The shearing transformation actua...

What is shearing?  The shearing transformation actually slants the object with the X direction or the Y direction as needed.ie; this transformation slants the shape of an obje

Explain three dimensional transformations, Explain Three Dimensional Transf...

Explain Three Dimensional Transformations A 3D geometric transformation is utilized extensively in object modelling and rendering. 2D transformations are naturally extended to

Displacement mapping, Implement displacement mapping and bump mapping on a ...

Implement displacement mapping and bump mapping on a sphere. The displacement can be whatever your choice. The bump map can be whatever your choice as well.

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