Sutherland hodgman algorithm, Computer Graphics

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.

 

Posted Date: 4/3/2013 3:46:13 AM | Location : United States







Related Discussions:- Sutherland hodgman algorithm, Assignment Help, Ask Question on Sutherland hodgman algorithm, Get Answer, Expert's Help, Sutherland hodgman algorithm Discussions

Write discussion on Sutherland hodgman algorithm
Your posts are moderated
Related Questions

What is vanishing point and view reference point? The perspective projections of any set of parallel lines that are not parallel to the projection plane converge to appoint cal

Draw the five regular polyhedras using physics-based modeling method. Implement a fractal algorithm with possible personal extensions. Also, specify the extensions.

Explain about the Computer Based Training CBT makes use of a computer system to train people in numerous applications. It makes use of self-assessment and multimedia with minim


Other curves - parabola and hyperbola Conic sections such as parabola and hyperbola are used in many instances such as in motion planning along a trajectory or in modelling the

IMG/MAC/MSP File Formats IMG files were originally implemented to work along with GEM paint program and can handle monochrome and grey level pictures only. MAC files are uti

General Perspective transformation with COP at the origin Here we suppose the given point P(x,y,z) be projected like P'(x',y',z') on the plane of projection. The center of pro

Removing Polygons Hidden through a Surrounding Polygon: The key to capable visibility calculation lies actually a polygon is not visible whether it is in back of a surrounding

What is seed fill?  One way to fill a polygon is to begin from a given point (seed) known to be inside  the polygon and highlight outward from this point i.e. neighboring pixel