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

Light wave 3d - softwares for computer animation, Light Wave 3D - Softwares...

Light Wave 3D - Softwares for computer animation It is the other high end PC 3-D computer graphics software package. Originally established for the Amiga platform, it is now a

Functions of hand-held pointer and tablet, The hand-held pointer and tablet...

The hand-held pointer and tablet in the form of a stylus i.e. pen or puck can function one or more of these three functions: (i)  For choosing positions on a drawing or on a men

Differentiate between z-buffer method and scan-line method, Differentiate b...

Differentiate between z-buffer method and scan-line method. What is the visibility test made in these methods? Solution : In depth buffer algorithm every pixel location on the

Displacement mapping, Implement displacement mapping and bump mapping on a ...

Implement displacement mapping and bump mapping on a sphere. The displacement can be whatever your choice. The bump map can be whatever your choice as well.

Will the shape of the resulting b-spline curve change, If the spacing betwe...

If the spacing between the knot sequence is uniformly doubled, will the shape of the resulting B-spline curve change?  Justify your answer.

Text generation, Discuss various Techniques for Character Generation

Discuss various Techniques for Character Generation

Simulation-applications for computer animation, Simulation: There are seve...

Simulation: There are several things, places and events people cannot witness in first person. There are a lot of causes for this. Several may happen too rapidly, several may be t

Orthographic and oblique projection - viewing transformation, Orthographic ...

Orthographic and Oblique Projection - Viewing Transformation Orthographic projection is the easiest form of parallel projection that is commonly utilized for engineering drawi

Objectives of 2-d viewing and clipping, Objectives of 2-D Viewing and Clipp...

Objectives of 2-D Viewing and Clipping After going through this section, you should be capable to: 1. Describe the concept of clipping, 2. Observe how line clipping is p

Disadvantages of analogue signal over digital signal, Problem: (a) Lis...

Problem: (a) List four components of ‘Multimedia'. (b) Write short notes on the following: (i) itunes (ii) ipods (c) Some Multimedia development teams can have an

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