Point clipping - 2-d viewing and clipping, Computer Graphics

Assignment Help:

Point clipping - 2-d viewing and clipping

Point clipping is the method related to suitable display of points in the scene, though this type of clipping is utilized less frequently in comparison to the other types, that is, line and polygon clipping. Although, in several situations, for example: the scenes that involve particle movements as explosion, dust and so on, this is quite helpful. For the sake of simplicity, suppose that the clip window is rectangular in shape. Consequently, the minimum and maximum coordinate value, that is, (Xwmax, Ywmax) and (Xwmin, Ywmin) are sufficient to identify window size and any point (X,Y), that can be displayed or shown should satisfy the subsequent inequalities. Or else, the point will not be visible. Hence, the point will be clipped or not can be determined on the basis of subsequent inequalities.

   Ywmax

≤ X ≤ Xw Xwmin  max

≤ Y ≤ Yw Ywmin  max

     Ywmin 

Xw      Xw min max

Figure: Point Clipping

This is to be noticed that (Xwmax, Ywmax) and (Xwmin, Ywmin) can be either world coordinate window boundary or viewport boundary. Additionally, if any one of these four inequalities is not satisfied then the point is clipped that is not saved for display.


Related Discussions:- Point clipping - 2-d viewing and clipping

What is the diameter of screen point - display devices, Question: Suppose w...

Question: Suppose we have a video monitor with a display area measuring 12.8 inches across and 9.6 inches high.  If the resolution is 1024 by 768 and the aspect ratio is 1, what is

Normalization transformation, Find the normalization transformation N, whic...

Find the normalization transformation N, which uses the rectangle W(1, 1); X(5, 3); Y(4, 5) and Z(0, 3) as a window and the normalized deice screen as viewpoint.

Implement the boundary fill and flood fill algorithm, 1. Implement the boun...

1. Implement the boundary fill algorithm and flood fill algorithm in C-language and use your code to fill two different types of closed areas such as  i)  A Circle ii)  A sel

Common transformation for parallel projection-transformation, Derive the co...

Derive the common transformation for parallel projection into a specified view plane, here the direction of projection d=aI+bJ+cK is along the normal N=n1I+n2J+n3K along with the r

Midpoint circle generation algorithm, Midpoint circle generation algorithm ...

Midpoint circle generation algorithm This makes use of a circle function. Based on this circle function, a decision parameter is created which is used to decide successive pixe

Explain vector graphics and raster graphics, Question: (a) In computer...

Question: (a) In computer graphics it is important to distinguish between the two approaches to graphical modeling:vector graphics and raster graphics. Explain in details th

Demerit - phong shading or normal vector interpolation shadi, Demerit - pho...

Demerit - phong shading or normal vector interpolation shading Needs lot of computations to determine intensity at a point, hence increases the cost of shading in any impleme

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

Categories of line segments - 2d clipping algorithms, Categories of Line Se...

Categories of Line Segments It categorizes line segments into three categories (i) trivially rejected (ii) trivially selected (iii) may be partially visible or totally invisibl

BINARY, WHAT THAT S MEANS 0001

WHAT THAT S MEANS 0001

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