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

Basic ray tracing algorithm - polygon rendering, Basic Ray Tracing Algorith...

Basic Ray Tracing Algorithm - Polygon Rendering The Hidden-surface removal is the most complete and most versatile method for display of objects in a realistic fashion. The co

Digital signal processing system for an analog signal, QUESTION (a) Dra...

QUESTION (a) Draw and explain the block diagram of a Digital Signal Processing System for an analog signal. (b) Draw the pictorial representation of the signals at each leve

Understanding the concept of hypertext and hypermedia, Understanding the Co...

Understanding the Concept of hypertext and hypermedia: For know the principle of Hypertext and Hypermedia we will look at how the human memory works.

What makes a pattern a pattern, QUESTION (a) Suppose that you have been...

QUESTION (a) Suppose that you have been assigned to re-engineer the existing systems for a company. Do you think that design patterns can be applied to these existing systems?

Scan line algorithm and seed fill algorithm, Scan line algorithm and seed f...

Scan line algorithm and seed fill algorithm Two basic approaches are followed in area filling on raster systems.  In the first approach overlap intervals for scan lines that cr

Ray tracing - polygon rendering and ray tracing methods, Ray Tracing - poly...

Ray Tracing - polygon rendering and ray tracing methods "Ray tracing" is a technique of following the light by the eye to the light source. While ray casting only relates its

Explain the advantage and disadvantage of raster crt, Explain the advantage...

Explain the advantage and disadvantage of Raster CRT Advantages Allows solids, not just wireframes Leverages low-cost CRT technology (i.e., TVs) Bright, i.e.

Three dimensional transformations, Three Dimensional Transformations A ...

Three Dimensional Transformations A 3D geometric transformation is used extensively in object modelling and rendering.2D transformations are naturally extended to 3D situations

Explain the bresenham line generation algorithm, 1. Explain the Bresenham ...

1. Explain the Bresenham line generation algorithm via digitizing the line with end  points as (15, 5) and also (25,13). Ans. Now we are utilizing the Bresenham line generati

Liang b arsky line clipping algorithm, Write the Liang B arsky line clippin...

Write the Liang B arsky line clipping algorithm. Why is Liang Barsky algorithm more efficient than the Cohen Sutherland algorithm?  Liang Barsky Line Clipping: Faster line cl

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