Steps for clip a line segment-pq, Computer Graphics

Assignment Help:

Steps for clip a line segment-PQ

  • Initially, find all the points of intersections of the line segment PQ along with the edges of the polygonal window and describe them either as PE and PL points. Also find out the value of parameter t, by using equation (2) for respective PE's and PL's.

                                                            Or

If value of the normal to particular edges is not specified then, determine the value of normal to every edge of the window, then find out the value of parameter t, by using equation (2) for particular point of intersection among line segment and window edge then on the basis of the value of parameter t mark them like PE and PL given the value of t lies from 0 to 1 in magnitude.

  • Secondly, out of the diverse values of t for PE's find out the maximum value of t say it is tmax. Likewise, out of the diverse values of t for PL's find out the minimum value of t say it be tmin . Remember here that for clipping to be possible tmin > tmax.
  • at last, vary the parameter t from tmax to tmin and find out the clipped line as outcome.

For well understanding of steps here figure is shown below:

2071_Steps for clip a line segment-PQ.png

Figure: Steps of Cyrus Beck Clipping

During in case of Line 1: (PQ)

1) Point 1 is potentially entering (PE1) since as we move along PQ, the LHS of e1 is window and hence, it seems that we are entering the window.

2) Point 2 is again PE2 same as point 1.

3) Point 3 is potentially leaving (P4) ? as we move along PQ, the LHS of e2 is window and hence, it seems that we are leaving the window.

4) As the same, point 4 is also PL2.

Line 2 and 3 (PQ):

By using similar logic as for line 1 we determine p‾L and PE. Here, it is to be noted that for all points of intersection we have several value of t.

Say t1 is value of t for PE1

Say t2 is value of t for PE2

Say t3 is value of t for PL1

Say t4 is value of t for PL2


Related Discussions:- Steps for clip a line segment-pq

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

Ray tracing algorithm, Ray Tracing:  Ray t racing is the technique to dete...

Ray Tracing:  Ray t racing is the technique to determine which objects in the scene are visible.  In this to identify the visible surface for each pixel we continue to bounce the

Buffer areas required for z-buffer algorithm, Buffer Areas Required For Z-B...

Buffer Areas Required For Z-Buffer Algorithm For applying z-buffer algorithm, we need two buffer areas or two 2-Dimentional arrays: 1) Depth-buffer [i,j], to sa

Electronic encyclopedia, Electronic Encyclopedia : This is the applica...

Electronic Encyclopedia : This is the application of multimedia for the creation of an encyclopedia along with millions of entries and hypertext cross references covering a br

Seed fill algorithm - output primitives, Seed fill algorithm A seed fil...

Seed fill algorithm A seed fill algorithm starts with a known initial interior point of the polygon and spreads out to determine other interior points to fill the given closed

Rotation - 2-d and 3-d transformations, Rotation - 2-d and 3-d transformati...

Rotation - 2-d and 3-d transformations Given a 2-D point P(x,y), that we want to rotate, along with respect to an arbitrary point A(h,k). Suppose P'(x'y') be the effect of ant

Remark for the bresenham line generation algorithm, Remark for the Bresenha...

Remark for the Bresenham Line Generation Algorithm Remark: The algorithm will be properly the same if we suppose | m | Algorithm | m | (a) Input two line endi

Explain the merits and demerits of penetration techniques, Explain the meri...

Explain the merits and demerits of Penetration techniques. The merits and demerits of the Penetration techniques are as follows:     It is an inexpensive method.     It h

Photoshop, What is the best selection method in photoshop

What is the best selection method in photoshop

Limitations of cohen sutherland line clipping algorithm, Limitations of Coh...

Limitations of Cohen Sutherland line clipping Algorithm The algorithm is merely applicable to rectangular windows and not to the other convex shaped window. Consequently, a

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