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

Process of objects in raster display and random display, Explain process of...

Explain process of displaying objects in raster display and random display. Draw block diagrams of the architecture of both the display systems.

Polygon rendering and ray tracing methods, Polygon Rendering and Ray Tracin...

Polygon Rendering and Ray Tracing Methods In previous section we had discussed various methods for visible-surface detection, although in order to produce visibility the prese

What do you mean by emissive and non-emissive displays, What do you mean by...

What do you mean by emissive and non-emissive displays? EMISSIVE: The emissive display changes electrical energy into light energy. The plasma panels, thin film ele

Specular reflection - polygon rendering & ray tracing method, Specular Refl...

Specular Reflection - Polygon Rendering & Ray Tracing Methods Specular reflection is while the reflection is stronger in one viewing direction that is a bright spot, termed

What is automatic data capture, Automatic Data Capture There are numero...

Automatic Data Capture There are numerous techniques available to collect data automatically without the need for manual entry. Manual entry is slower, more costly (need to emp

Briefly explain modes and switches, Question 1 Write a note on: Audio Spec...

Question 1 Write a note on: Audio Spectrum & Audio Waveform Question 2 What is high dynamic range color? Explain gradient color Question 3 Describe Time-Remapping

Shearing - 2-d and 3-d transformations, Shearing - 2-D and 3-D transformati...

Shearing - 2-D and 3-D transformations Shearing transformations are utilized for altering the shapes of 2 or 3-D objects. The consequence of a shear transformation seems like

Raster & Vector display, what is refresh buffer/ identify the content and o...

what is refresh buffer/ identify the content and organisation of the refresh buffer for the case of raster display and vector display.

Taxonomy of projection - viewing transformation, Taxonomy of Projection - v...

Taxonomy of Projection - viewing transformation There are different types of projections as per to the view that is essential. The subsequent figure 3 demonstrates taxonomy 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