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

What is scan line algorithm, What is scan line algorithm?  One way to f...

What is scan line algorithm?  One way to fill the polygon is to apply the inside test. I.e. to check whether the pixel is inside the polygon or outside the polygon and then hig

Filled-area primitives - output primitives, Filled-Area Primitives  Fil...

Filled-Area Primitives  Filled-area primitives are one of the most important types of primitives used in Computer Graphics.  Basically filled-area primitives are meant to fill

70, how you doing the graphic?

how you doing the graphic?

Terms, composite transformation

composite transformation

Applications for computer animation-physics, Normal 0 false f...

Normal 0 false false false EN-US X-NONE X-NONE

Derive the single combined transformation matrix, A 2D geometric shape is r...

A 2D geometric shape is rotated about a point with coordinates (1,2)  by 90°  in a clockwise direction.  Then, the shape is scaled about the same point in the x-coordinate by 2 tim

Concept for eliminating hidden lines, Concept for Eliminating Hidden Lines,...

Concept for Eliminating Hidden Lines, Surfaces or Edges To exemplify the concept for eliminating hidden-lines, surfaces or edges, see a classic wire frame model of a cube as i

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

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