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

Introduction of viewing transformations, Introduction of Viewing  Transfor...

Introduction of Viewing  Transformations Projection is fundamentally a transformation or mapping of 3D objects upon 2D screen. Projection is mostly categorised in Para

Put the system of a geometric data table for a 3d rectangle, Put the system...

Put the system of a geometric data table for a 3d rectangle. Solution : Vertex Table Edge Table Polygon Surface Table

What is aspect ratio, What is Aspect ratio?  The ratio of vertical poin...

What is Aspect ratio?  The ratio of vertical points to the horizontal points essential to produce length of lines in both directions of the screen is known as the Aspect ratio.

Panning and zooning, what is zooming and panning in computer graph please e...

what is zooming and panning in computer graph please explan??

Explain shannon -fano algorithm, (a) Differentiate between the following co...

(a) Differentiate between the following compression algorithm: 1. Shannon -Fano Algorithm and 2. Huffman Encoding (b) A statistical encoding algorithm is being considered

DDA, limitationsof dda

limitationsof dda

Determine the transformation matrix for the reflection, Determine the trans...

Determine the transformation matrix for the reflection about the line y = x. Solution: The transformation for mirror reflection regarding to the line y = x, comprises the subs

Representational animation - computer animation, Representational Animation...

Representational Animation - Computer Animation This method permits an object to change its shape throughout the animation. There are three sub-types to this. The initial is th

Simulation-applications for computer animation, Simulation: There are seve...

Simulation: There are several things, places and events people cannot witness in first person. There are a lot of causes for this. Several may happen too rapidly, several may be t

Seed fill algorithm - output primitives, Seed fill algorithm A seed fil...

Seed fill algorithm A seed fill algorithm starts with a known initial interior point of the polygon and spreads out to determine other interior points to fill the given closed

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