Potentially entering and leaving points - clipping, Computer Graphics

Assignment Help:

Potentially entering and leaving points - PE and PL

The intersection point of the line and window might be classified either like potentially leaving or entering. Before get further details, we describe the real meaning of potentially leaving and entering points (PL and PE). Potentially leaving and entering points are dependent upon the edge orientation, that is: direction. So now understand how to determine PE and PL; here we move anticlockwise across the window boundary then area of left hand side encloses the window.

1928_Potentially entering and leaving points - Clipping.png

Figure: (a): Potentially Entering PE and Potentially Leaving PL points

So here, we are moving from point P to point Q, and we understand that whereas traversing the windows edges in anticlockwise method the area lying on the left hand side is considered to as the window region. Consequently, from the Figure (a) in above, you may see that at point PE that we are moving from P to Q we are entering the window region, hence this point of intersection should be considered to as the potentially entering point (PE). Now, consider to the other intersection demonstrated in the Figure (a) in above, this time, also the movement of points on the line are found by varying value of parameter t is from point P to Q and  with respect to, the orientation of window boundary, we are leaving the window area. Therefore, this point of intersection is identified as potentially exiting point (PL).

PE that is potentially entering point while moving indirection of the window, the point of intersection among line PQ and the window edges faced are identified as potentially entering. PL that is potentially leaving point; these are the point of intersection encountered whereas we move away from window.


Related Discussions:- Potentially entering and leaving points - clipping

Sutherland cohen line clipping algorithm, Describe briefly Sutherland Cohen...

Describe briefly Sutherland Cohen line clipping algorithm.   OR   Describe Cohen Sutherland line clipping algorithm. Cohen Sutherland line clipping algorithm In this algorith

Image space -approaches for visible surface determination, Image Space Appr...

Image Space Approach -Approaches for visible surface determination The initial approach as image-space, determines that of n objects in the scene is visible at every pixel in

Test for checking disjoint polygons by using of min-max test, Test For chec...

Test For checking Disjoint Polygons by using of Min-max Test Test 1: For checking disjoint polygons by using of Min-max test. Assume that you have two polygons as P1 and

Determine the advantages of raster-scan systems, Determine the advantages o...

Determine the advantages of raster-scan systems (i)  Rasterisation is now performed faster since a special purpose processor is used. (ii)  The CPU is not slowed down by the

Oblique projection, find the transformation and draw the cube for cavalier...

find the transformation and draw the cube for cavalier and cabinet with theta = 37 degree

Identify what the use of homogenous co-ordinates, 1. Why are homogeneous co...

1. Why are homogeneous co-ordinates utilized in computer vision? I want to identify what the use of homogenous co-ordinates makes possible in terms of camera models. 2. Consider

Beam penetration method and shadow mask method, Beam Penetration Method and...

Beam Penetration Method and Shadow Mask Method Two methods exist for displaying colors in a CRT monitor - beam penetration method and shadow mask method. Beam penetration metho

B-spline curves - clipping and 3d primitives, B-spline curves - clipping an...

B-spline curves - clipping and 3d primitives B-spline curves are piecewise polynomial cubes with one or more polynomial pieces with a minimum smoothness requirement.  For examp

What is scaling, What is scaling?  The scaling transformations changes...

What is scaling?  The scaling transformations changes the shape of an object and can be carried out by multiplying every vertex (x,y) by scaling factor Sx, Sy where Sx is the

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