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

Object space - approaches for visible surface determination, Object Space -...

Object Space - approaches for visible surface determination The second approach as object-space that compares all objects directly along with each other inside the scene defin

Panning and zooning, what is zooming and panning in computer graph please e...

what is zooming and panning in computer graph please explan??

Briefly describe jackson''s theorem, Question 1 What is Packet-switching n...

Question 1 What is Packet-switching network? Discuss its basic operation Question 2 Briefly describe Jackson's theorem Question 3 List and explain the two popular

Time delay and busy flag method, 1. Using a time Delay Method The delay...

1. Using a time Delay Method The delay required between issuing each character to the LCD is about 5-10ms (it's simply known as DELAY). When programming an LCD, a long delay is

Positive accelerations - computer animation, Positive Accelerations - Compu...

Positive Accelerations - Computer Animation So as to incorporate increasing speed in an animation the time spacing among the frames should increase, hence greater change in th

Cohen sutherland line clippings algorithm, Cohen Sutherland Line Clippings ...

Cohen Sutherland Line Clippings Algorithm The clipping problem is identified by dividing the region surrounding the window area into four segments Up as U, Down as D, Left as

High level techniques (motion generalized), High level techniques (motion g...

High level techniques (motion generalized) Techniques utilized to explain general motion behavior of any of graphic object, such techniques are algorithms or models utilized to

Advantages of jpeg images, Advantages of JPEG Images Huge compressi...

Advantages of JPEG Images Huge compression ratios mean sooner download speeds. JPEG produces outstanding results for main photographs and complicated images. JPEG s

Interactive 3d computer graphics, Describe interactive model of computer gr...

Describe interactive model of computer graphics and application areas of interactive computer graphics.

Liang barsky line clipping algorithm, Liang Barsky line clipping algorithm ...

Liang Barsky line clipping algorithm : The algorithm uses parametric form of the line segment.  Four inequalities are created using the parametric form of the line segments.  Th

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