Sutherland-Hodgman Algorithm
Illustrate briefly the Sutherland-Hodgman Algorithm?
Expert
Any polygon of any arbitrary shape can be illustrated with the assist of some set of vertices connected with it. When we strive to clip the polygon under consideration by any rectangular window, then, we observe that the coordinates of the polygon vertices satisfies one of the four cases and further it is to be noted that this method of clipping can be simplified by the clipping the polygon edgewise and not the polygon as a entire. This decomposes the bigger problem into a set of sub problems that can be handled individually as per the four cases.
Describe the sweep representation in brief.
Explain the term rendering bi-cubic surface patches of the constant u and v method?
Briefly describe the basic principle of vanishing point?
Explain the term seed fill?
Define the term frame and key frame? Briefly describe both the terms.
What do you mean by the term output primitive? Also specify the term ‘jaggies’?
Define the term shadow masking?
Define Computer graphics?
What are the various ways of specifying the spline curve?
What do you understand by the term perspective projection? Illustrate briefly?
18,76,764
1924845 Asked
3,689
Active Tutors
1444551
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!