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

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.

Posted Date: 4/3/2013 2:50:08 AM | Location : United States







Related Discussions:- Point clipping - 2-d viewing and clipping, Assignment Help, Ask Question on Point clipping - 2-d viewing and clipping, Get Answer, Expert's Help, Point clipping - 2-d viewing and clipping Discussions

Write discussion on Point clipping - 2-d viewing and clipping
Your posts are moderated
Related Questions
The table as given below demonstrates possible values of such parameters for classic applications of digital video. Application                  Frame rate                  Dime

Adobe Photoshop - Softwares for computer animation Whereas Adobe Photoshop is not a computer animation application, this is one of the top of the line graphics programs. This

Gourand shading OR Intensity interpolation scheme Now there polygon is rendered through linearly interpolating intensity values across the surface. Intensity values for all po

Image Processing 1. How is sampling done? Explain quantization in digital image processing? 2. Explain in brief: (1) Image Subtraction (ii) Image averaging. 3. Explain in

Assumption for Diffuse Reflection - Polygon Rendering  i) the diffuse reflections by the surface are scattered along with equal intensity in each direction, independent of vie

Line Clipping Algorithm - Cohen Sutherland Algorithm Line is a series of endless number of points; here no two points contain space in among them. Hence, the above said inequa

what languge do computers speak

explain vecgen line drawing algorithm

Problem: (a) What is meant by ‘Time - Stretching ‘in relation to a sound data file? (b) Calculate the size of a 5 minutes mono sound file of CD quality and with a 16 -bit

Bezier Curves - Modeling and Rendering Bezier curves are utilized in computer graphics to turn out curves which display reasonably smooth at all scales. Such spline approximat