Various cases of cohen sutherland line clippings - algorithm, Computer Graphics

Assignment Help:

Various cases of Cohen Sutherland Line Clippings

Currently, we study how this clipping algorithm works. For the sake of simplicity we will tackle all the cases with the assist of illustration lines line1 to line 5 demonstrated in following figure. All line segments present a case.

69_Various cases of Cohen Sutherland Line Clippings.png

Figure: Various cases of Cohen Sutherland Line Clippings

Note, that in above figure of various cases of Cohen Sutherland Line Clippings, line l1 is completely observable, line l2 and line l3 are completely invisible; line l4and line l5 are partially observable. We will determine these out comings as three separate cases.

Case 1: l1 → totally visible, that is, Trival acceptance

∴both points lie inside the window

Case 2: l2 and l3 → unseen that is Trival acceptance rejection

Case 3: l4 and l5→ partially visible


Related Discussions:- Various cases of cohen sutherland line clippings - algorithm

Flat panel, help me discuss about flat panel with respect to emissive and n...

help me discuss about flat panel with respect to emissive and non emissive display

Bresenham line generation algorithm for positive slope, Bresenham Line Gene...

Bresenham Line Generation Algorithm for Positive Slope (BLD algorithm for positive slope (0 - If slope is negative then utilize reflection transformation to transform the

Explain about the computer based training, Explain about the Computer Based...

Explain about the Computer Based Training CBT makes use of a computer system to train people in numerous applications. It makes use of self-assessment and multimedia with minim

What is vanishing point and view reference point, What is vanishing point a...

What is vanishing point and view reference point? The perspective projections of any set of parallel lines that are not parallel to the projection plane converge to appoint cal

Important points for bresenham line generation algorithm, Important points ...

Important points for Bresenham Line Generation Algorithm Note: Bresenhams algorithm is generalised to lines along with arbitrary slopes with identifying the symmetry

Negative accelerations - computer animation, Negative Accelerations - compu...

Negative Accelerations - computer animation In order to incorporate decreasing speed in an animation the time spacing between the frames must decrease, thus there exists lesser

2d shape primitives, 2D Shape Primitives You have already learnt to plo...

2D Shape Primitives You have already learnt to plot a point or a pixel on any display device. In this unit, we shall introduce you to various devices available for data input o

3-d transformation, 3-D Transformation The capability to represent or ...

3-D Transformation The capability to represent or display a three-dimensional object is basically to the knowing of the shape of that object. Moreover, the capability to rotat

Dda or digital differential analyzer algorithm, DDA or Digital Differential...

DDA or Digital Differential Analyzer Algorithm - Line generation algorithms From the above discussion we get that a Line drawing is accomplished through calculating intermedi

Multimedia business, Multimedia Business: Even fundamental office app...

Multimedia Business: Even fundamental office applications as a MS word processing package or a MS Excel spreadsheet tool turns into a powerful tool along with the aid of mult

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