Sutherland hodgman algorithm, Computer Graphics

Assignment Help:

Sutherland-Hodgman Algorithm

Any polygon of any type of arbitrary shape can be explained with the assist of some set of vertices connected with it. While we try to clip the polygon under consideration along with any rectangular window, then we observe the coordinates of the polygon

vertices satisfies one of the four cases scheduled in the table shown below, and additionally it is to be noticed that this procedure of clipping can be simplified through clipping the polygon edgewise and not the polygon as an entire. This decomposes the bigger problem in a set of sub-problems that can be handled independently as per the cases listed in the table below. In fact this table explains the cases of the Sutherland-Hodgman Polygon Clipping algorithm.

 


Related Discussions:- Sutherland hodgman algorithm

Persistence of phosphor - display devices, Persistence (of phosphor) - Disp...

Persistence (of phosphor) - Display devices Time it takes the emitted light from screen to decay to one-tenth of its original intensity. The point where an electron gun strikes

Quicktime and real video, Quicktime Quicktime is the video format devis...

Quicktime Quicktime is the video format devised through and used through Apple and can be utilized at varying quality and file sizes. This is quite broadly used and has affecte

Write a code to continuously rotate square about pivot point, Write a code ...

Write a code to continuously rotate a square about a pivot point.    #include   static GLfloat rotat=0.0;   void init(void); void display(void); void reshape(int w

Scenes - polygon rendering and ray tracing methods, Scenes - polygon render...

Scenes - polygon rendering and ray tracing methods In the context of ray tracing, a scene is a set of objects and light sources which will be viewed through a camera. All of

Positioning Techniques, Explain Positioning Techniques in computer Graphics...

Explain Positioning Techniques in computer Graphics in detail

Advantages of bresenham’s line drawing algorithm, What are the advantages o...

What are the advantages of Bresenham's line drawing algorithm over DDA line drawing algorithm? DDA and Bresenham algorithms both are efficient line drawing algorithm. Breaenham

What is the use of projection reference point, What is the use of Projectio...

What is the use of Projection reference point?  In Perspective projection, the object positions are transformed to the view plane with these converged projection line and the p

Reflection and shear - output primitives, Reflection and Shear There ar...

Reflection and Shear There are a few important transformations which are not primitive in the sense that they can be expressed as compositions of translation, rotation and scal

Common principles of ray tracing, Common Principles of Ray Tracing Bas...

Common Principles of Ray Tracing Based upon the nature or attributes of the surface given by the user, the subsequent effects are implemented, as per to rules of optics:  a

Archeology-applications for computer animation, Archeology: along with the...

Archeology: along with the advent of the computer, the archeologist has obtained a new tool, computer animation. An object-model can be made comparatively quick and without any we

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