Sutherland cohen line clipping algorithm, Computer Graphics

Assignment Help:

Describe briefly Sutherland Cohen line clipping algorithm.   OR   Describe Cohen Sutherland line clipping algorithm.

Cohen Sutherland line clipping algorithm In this algorithm we divide the line clipping process into two phases: (1) identify those lines which intersect the clipping window and so need to be clipped and (2) perform the clipping. 

1. Visible: Both endpoints of the line lie within the window. 

2. Not visible: The line definitely lies outside the window. 

3. Clipping candidate: The line is in neither category 1 nor 2. In fig. 1 line AB is in category; line CD and EF are in category 2; and lines GH, IJ, and KJ are in category 3 (clipping candidate).  The algorithm employs an efficient procedure for finding the category of line. It proceeds in two steps:  1. Assign a 4-bit region code to each endpoint of the line. The code is determined according to which of the following nine regions of the plane the endpoint lies in starting from the leftmost bit, each bit of the code is set to true (1) of false (0) according to the scheme We rse the convention that sign (a) = 1 if a is positive, 0 otherwise. Of course, a point with code 0000 is inside the window.  2. The line is visible if both region codes are 0000, and not visible if the bitwise logical AND of the codes is not 0000, and a candidate for clipping if the bitwise logical AND of the region codes is 0000. For a line in category 3 we proceed to find the intersection point of the line with one of the boundaries of the clipping window, or to be exact, with the infinite extension of one of the boundaries. We choose an endpoint of the line say (x1,y1,) that is outside the window, i.e., whose region code is not 0000. We then select an extended line by observing that boundary lines that are candidates for intersection are the ones for which the chosen endpoint must be "pushed across" so as to change a "1" in its code to a "0". Consider line CD in fig. If endpoint C chosen, then the bottom boundary line y = y is selected for computing intersection. On the other hand if endpoint D is chosen, then either the top boundary line y = y of the right boundary line x = x is used. Now we replace endpoint with the intersection point effectively eliminating the portion of the original line that is on the outside of the selected window boundary. The new endpoint is then assigned an update region code and the clipped line re categorized and handled in the same way . This iterative process terminates when we finally reach a clipped line that belongs to either category 1 (visible ) of category 2 ( not visible ). 


Related Discussions:- Sutherland cohen line clipping algorithm

Midpoint circle generation algorithm, Midpoint circle generation algorithm ...

Midpoint circle generation algorithm This makes use of a circle function. Based on this circle function, a decision parameter is created which is used to decide successive pixe

Resolution-introduction to computer graphics, Resolution Graphic demons...

Resolution Graphic demonstrations are utilized in presentations to assist convey a concept or express a mood, two kinds of demonstrations graphics are: Vector, and B

Reflection, determine the tranformation matrix for reflection,computer grap...

determine the tranformation matrix for reflection,computer graphics

Pcs or personal computers really - hardware for animation, PCs or Personal ...

PCs or Personal Computers Really - Hardware for Animation  these are really versatile machines that have been around for years. PCs are the favorite of many computer users, due

What does refreshing of the screen mean, What does refreshing of the screen...

What does refreshing of the screen mean? Some method is required for maintaining the picture on the screen. Refreshing of screen is completed by keeping the phosphorus glowing

Lossless audio formats, Lossless Audio Formats: Lossless audio formats as ...

Lossless Audio Formats: Lossless audio formats as TTA and FLAC give a compression ratio of around 2:1, sometimes extra. During exchange, for their lower compression ratio, such co

Classification of print finishing processes, Problem: a. Provide exampl...

Problem: a. Provide examples of classification of print finishing processes. b. In advertising, what do you meant by creative strategies? c. Creative strategies are div

What is run length encoding, What is run length encoding?   Run length ...

What is run length encoding?   Run length encoding is a compression method used to store the intensity values in the frame buffer, which keeps each scan line as a set of intege

Cases for subdivisions of polygon-visible surface detection, Cases for Subd...

Cases for Subdivisions of Polygon No additional subdivisions of a particular area are desired, if one of the subsequent conditions is true as: Case 1: All the polygons ar

Subdivision of polygon - visible surface detection , Subdivision of polyg...

Subdivision of polygon Test to find out the visibility of a single surface are made through comparing surfaces that as polygons P along regarding a specified screen area A.

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