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

Differentiate between raster and vector images, QUESTION a) Differentia...

QUESTION a) Differentiate between raster and vector images. b) Explain the concept of bit depth. What is the minimum number if bits required for a one-colour digital image t

Applications of computer graphics, Applications of Computer Graphics Wh...

Applications of Computer Graphics When you begin using a computer and open an application, you simply click on a graphics object, called icon. When you watch TV, several times

How many times will vertex appear in the intersection points, 1. For the po...

1. For the polygon shown in Figure on the next page, how many times will the vertex V 1 appear in the set of intersection points for the scan line passing through that point?  How

Non trivial case of cohen sutherland line clippings, Non Trivial Case of co...

Non Trivial Case of cohen sutherland line clippings Case: assume for the line segment PQ, both the trivial rejection and acceptance tests failed (that is, Case 1 and Case 2

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

Film - applications for computer animation, Film - Applications for Compute...

Film - Applications for Computer Animation Computer animation has turn into regular and accepted in particular effects. Movies as "Jurassic Park", "Terminator 2: Judgment Day"

Polygon representation methods - modeling and rendering, Polygon Representa...

Polygon Representation Methods - Modeling and Rendering Any scene to be created by computer graphics may include a variety of objects, a few of them natural and manmade. Hence

Morphing - key frame systems, Morphing - Key Frame Systems Transformati...

Morphing - Key Frame Systems Transformation of object shapes from one form to the other is termed as morphing as short form of metamorphism. This method can be applied to any o

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