Various cases of cohen sutherland line clippings - algorithm, Computer Graphics

Various cases of Cohen Sutherland Line Clippings

Currently, we study how this clipping algorithm works. For the sake of simplicity we will tackle all the cases with the assist of illustration lines line1 to line 5 demonstrated in following figure. All line segments present a case.

69_Various cases of Cohen Sutherland Line Clippings.png

Figure: Various cases of Cohen Sutherland Line Clippings

Note, that in above figure of various cases of Cohen Sutherland Line Clippings, line l1 is completely observable, line l2 and line l3 are completely invisible; line l4and line l5 are partially observable. We will determine these out comings as three separate cases.

Case 1: l1 → totally visible, that is, Trival acceptance

∴both points lie inside the window

Case 2: l2 and l3 → unseen that is Trival acceptance rejection

Case 3: l4 and l5→ partially visible

Posted Date: 4/3/2013 2:57:11 AM | Location : United States







Related Discussions:- Various cases of cohen sutherland line clippings - algorithm, Assignment Help, Ask Question on Various cases of cohen sutherland line clippings - algorithm, Get Answer, Expert's Help, Various cases of cohen sutherland line clippings - algorithm Discussions

Write discussion on Various cases of cohen sutherland line clippings - algorithm
Your posts are moderated
Related Questions
Essential Elements for the Raster Scan Display Three elements are essential for the raster scan display. They are as: 1) The Frame Buffer that is also termed as the Refresh


Polygon representation methods - Boundary representations Boundary representations: now the 3-D object is shown as a set of surfaces which separate the object interior from

differentiate between dda and bresenhams line algorithm

What is a Blobby object?  Some objects do not handle a fixed shape, but change their surface characteristics in sure motions or when in proximity to other objects. That is call

explain vecgen algorithem for line drawing in computer graphics

Forensics: Accidents occur every minute. Very frequently, there are no witnesses except for the individuals concerned in the accident or worse yet, there are no surviving witnesse

Image Processing 1. How is sampling done? Explain quantization in digital image processing? 2. Explain in brief: (1) Image Subtraction (ii) Image averaging. 3. Explain in

Polygon or Area Clipping Algorithm - Sutherland-Hodgman Algorithm There are different algorithms as Liang-Barsky, Line clipping, Weiler-Atherton Polygon Clipping,

Matrix for Orthographic Projection Orthographic projections are projections into one of the coordinate planes x=0, y=0or z=0. The matrix for orthographic projection on the z=0