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

Polygon representation methods - modeling and rendering, Polygon Representa...

Polygon Representation Methods - Modeling and Rendering Any scene to be created by computer graphics may include a variety of objects, a few of them natural and manmade. Hence

Dda and bresenhem line drawing algorithm, when dda algorithm is more effici...

when dda algorithm is more efficient than bresenhem line drawing algorithm

Isosurface, Given arbitrary 8 values at the vertices of a cube, please draw...

Given arbitrary 8 values at the vertices of a cube, please draw the curved iso-surfaces with shading. Also, please draw the saddle point. This can be done relatively easy with phys

Three sub-fields of computer simulation, Three Sub-Fields of Computer Simul...

Three Sub-Fields of Computer Simulation Computer simulation is the electronic equivalent of this kind of role playing and it functions to drive synthetic environments and virt

What is seed fill, What is seed fill?  One way to fill a polygon is to ...

What is seed fill?  One way to fill a polygon is to begin from a given point (seed) known to be inside  the polygon and highlight outward from this point i.e. neighboring pixel

Interrupts - event driven devices, Interrupts - Event driven devices ...

Interrupts - Event driven devices Interrupts: An option to polling is the interrupt feature. The device sends an interrupt signal to the processor while an event happens. T

Relation between 2-d euclidean system and homogeneous system, Relation betw...

Relation between 2-D Euclidean system and Homogeneous coordinate system Suppose that P(x,y) be any point in 2-D Euclidean system. In HCS, we add a third coordinate to the poin

Dda, differentiate between dda and bresenhams line algorithm

differentiate between dda and bresenhams line algorithm

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