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 rendering bi-cubic surface, Write short notes on rende...

Write short notes on rendering bi-cubic surface patches of constant u and v method? The simple way is to draw the iso-parmetric lines of the surface. Discrete approximations t

Uniform b - spline curve, Uniform B - spline curve: When the spacing betwe...

Uniform B - spline curve: When the spacing between Knot values is constant, the resulting curve is called a uniform B- spline. Blending function for B- spline curves are defined b

Basic structures for multimedia interactive applications, Question: (a)...

Question: (a) Sound often gives the only effective way to convey an idea, elicit an emotion, or dramatise a point. Explain two situations of the use of sound that would be con

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

What is automatic data capture, Automatic Data Capture There are numero...

Automatic Data Capture There are numerous techniques available to collect data automatically without the need for manual entry. Manual entry is slower, more costly (need to emp

Implement the scan line polygon fill algorithm, Implement the Scan line pol...

Implement the Scan line polygon fill algorithm for any arbitrary polygon in C-language and then use your code to fill each of the following type of polygon. i) Convex polygon

Compare bresenham line generation algorithm with dda, 1. Compare Bresenham...

1. Compare Bresenham line generation with Digital Differential Analyzer line generation. Ans. Bresenham line generation algorithm is better than Digital Differential Analyze

How many times will vertex appear in the intersection points, 1. For the po...

1. For the polygon shown in Figure on the next page, how many times will the vertex V 1 appear in the set of intersection points for the scan line passing through that point? How

Image precision and object precision, Q. What do you mean by image precis...

Q. What do you mean by image precision and object precision? Describe z- buffer algorithm for visible surface detection. OR What do you mean by image precision and obj

3D transformation, what are the steps involved in 3D transformation

what are the steps involved in 3D transformation

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages