Steps of cohen sutherland line clipping algorithm, Computer Graphics

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

Different types of simulating motion - computer animation, Different types ...

Different types of Simulating Motion - Computer Animation Here we discuss different ways of simulating motion as: a. Zero Acceleration or Constant Speed b. No

Interlaced and non interlaced, what is interlaced and non interlaced?

what is interlaced and non interlaced?

Cases for digital differential analyzer algorithm, Cases for Digital Differ...

Cases for Digital Differential Analyzer Algorithm 1) If in case 1, we plot the line another way round that is, moving in y direction via 1 unit every time and after that hunt

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

Principle vanishing point - perspective projections, Principle Vanishing po...

Principle Vanishing point - Perspective Projections Assume that line 1 and l2 be two straight lines parallel to each other that are also parallel to x-axis. If the projection

Draw line segment - digital differential analyzer algorithm, 1. By using D...

1. By using Digital Differential Analyzer algorithm draw line segments from point (1,1) to (9,7). Ans. We see that the usual equation of the line is specified by: y = mx+c

Presentation function, ppt

ppt

Normalization transformation, Find the normalization transformation N, whic...

Find the normalization transformation N, which uses the rectangle W(1, 1); X(5, 3); Y(4, 5) and Z(0, 3) as a window and the normalized deice screen as viewpoint.

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| show different coordinates of the similar coordinate system. Here all

Define pixel and frame buffer, Define pixel and frame buffer? Pixel is ...

Define pixel and frame buffer? Pixel is shortened forms of picture element. Every screen point is referred to as pixel or pel. Picture definition is kept in a memory area c

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages