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

Image space -approaches for visible surface determination, Image Space Appr...

Image Space Approach -Approaches for visible surface determination The initial approach as image-space, determines that of n objects in the scene is visible at every pixel in

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

Explain vector data model with examples, Question 1 How does GIS differ fr...

Question 1 How does GIS differ from traditional Maps? Explain Question 2 Explain vector data model with examples Question 3 What is spatial analysis? explain

Characteristics of bitmap data, Characteristics of Bitmap Data: Bitmap dat...

Characteristics of Bitmap Data: Bitmap data can take up many rooms. A CMYK A-4 size picture which is optimized for medium quality printing (150 lpi) takes up 40 Mage Bytes. Compre

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

2d clipping, What is 2d clipping in computer graphics

What is 2d clipping in computer graphics

Find the normalization transformation, Illustration: Find the normalizatio...

Illustration: Find the normalization transformation N that uses the rectangle W (1, 1), X (5, 3), Y (4, 5) and Z (0, 3) as a window and also the normalized device screen like the

Need for video compression, Need for Video Compression: T he high bit ...

Need for Video Compression: T he high bit rates that result from the various types of digital video make their transmission through their intended channels very difficult. Eve

Define computer graphics, Define Computer graphics.  Computer graphics ...

Define Computer graphics.  Computer graphics remains one of the most popular and rapidly growing computer fields. Computer graphics may be explained as a pictorial representati

Ray tracing algorithm - recursive, Ray Tracing Algorithm - Recursive ...

Ray Tracing Algorithm - Recursive Frequently, the basic ray tracing algorithm is termed as a "recursive" acquiring an outcome wherein a given process repeats itself an arbitr

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