Steps of cohen sutherland line clipping algorithm, Computer Graphics

Assignment Help:

Cohen Sutherland line clipping algorithm

The algorithm uses the following main steps

Divide the entire plane into nine disjoint regions using the four window boundaries of the window.
Give a unique four bit region code to each region.
Find out the code of two end points.
Use the code to check (i) If the line segment can be trivially selected (ii) trivially rejected (iii) needs further processing.
Find out the intersection with the window boundaries for line segments which need further processing.

Related Discussions:- Steps of cohen sutherland line clipping algorithm

Write short notes on active and passive transformations, Write short notes ...

Write short notes on active and passive transformations? In the active transformation the points x and x represent different coordinates of the similar coordinate system. Here

Gourand shading or intensity interpolation scheme, Gourand shading OR Inten...

Gourand shading OR Intensity interpolation scheme Now there polygon is rendered through linearly interpolating intensity values across the surface. Intensity values for all po

Xy-shear about the origin - 2-d and 3-d transformations, xy-Shear about the...

xy-Shear about the Origin - 2-d and 3-d transformations Suppose an object point P(x,y) be moved to P'(x',y') as a outcome of shear transformation in both x- and y-directions a

Use the midpoint circle algorithm to get the output, Figure uses three dash...

Figure uses three dashed arcs and one small circle. Dashed line or arc is a style attribute that can be attached with a line or a curve. In OpenGL you can use the line stipple func

Three dimensional display methods - 2d clipping algorithms, Three dimension...

Three dimensional display methods: Among the simplest three dimensional surface representations are the polygonal surfaces. A polygonal surface is described by vertices

Design a bitmap for the english vowels, 1. Design a bitmap for the English ...

1. Design a bitmap for the English vowels A, E, I, O, U for two different sizes and then implement the bitmaps to plot these vowels on the display. Keep in mind that baseline of al

Phong shading algorithm, Q. Describe briefly phong shading algorithm. ...

Q. Describe briefly phong shading algorithm. OR Write short note on phong shading. Phong shading Phong shading or normal vector interpo

Mathematics-applications for computer animation, Mathematics: There are so...

Mathematics: There are some area like Probability, combination, permutation, etc.,that can be well explained along with the help of animation, that helps in enhancing the learning

Containment test - visible surface detection, Containment Test - visible s...

Containment Test - visible surface detection Test: That is Containment test: it can be either comprised (contained) or surrounding polygon, if intersection test fails. The

Categories of parallel projection - viewing transformation, Categories of P...

Categories of Parallel Projection Parallel projection can be categorized as per to the angle which the direction of projection makes along with the projection plane. For illu

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages