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

Uncompressed and common audio format, Uncompressed / Common Audio Format ...

Uncompressed / Common Audio Format There is one main uncompressed audio format: PCM. It is generally stored like a .wav on Windows. WAV is file format which is flexible and des

Explain about the computer animation, Explain about the Computer animation ...

Explain about the Computer animation Computer animation is the art of creating moving images by computer software and hardware. For 3D animation, objects are designed on a

Write a code to generate a composite matrix, Write a code to generate a com...

Write a code to generate a composite matrix for general 3D rotation matrix. Test your code and rotate continuously a cube about an axis.

Discuss in detail about rendering, Discuss in detail about rendering Co...

Discuss in detail about rendering Computer animation uses a technique termed as avars (animation variable) where starting point is generally a series of stick figures; for exam

Dv encoder type 1, DV Encoder Type 1 : The video and audio streams are tog...

DV Encoder Type 1 : The video and audio streams are together interfaces by standard DV bit stream. Such format is fully supported through DirectShow which accepts this interleaved

Essential elements for the raster scan display, Essential Elements for the ...

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

Test for checking disjoint polygons by using of min-max test, Test For chec...

Test For checking Disjoint Polygons by using of Min-max Test Test 1: For checking disjoint polygons by using of Min-max test. Assume that you have two polygons as P1 and

Referential links, Referential Links: A third type of link is a referentia...

Referential Links: A third type of link is a referential link. It is associated to the associative link. Quite than representing a relationship among two related ideas, a referent

Hypertext, Hypertext: it is conceptually very similar as regular text: it ...

Hypertext: it is conceptually very similar as regular text: it can be stored, searched, read, or edited along with a significant difference: hypertext is text along with pointers

Beam penetration method and shadow mask method, Beam Penetration Method and...

Beam Penetration Method and Shadow Mask Method Two methods exist for displaying colors in a CRT monitor - beam penetration method and shadow mask method. Beam penetration metho

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages