Containment test - visible surface detection, Computer Graphics

Containment Test -  visible surface detection

Test: That is Containment test: it can be either comprised (contained) or surrounding polygon, if intersection test fails. Therefore we perform the containment test for this type of test we have the subsequent three cases, demonstrated in the figures (a),(b) and also (c).

a)   P1 contains P2. b)   P2 contains P1.

c)   P1 and P2 are disjoint.

1838_Containment Test - Visible Surface Detection.png

                                         Figure (a): P1 contained P2          (b) P2 contained P1           (c) P1and P2 are disjoint

Case a: Confirm a vertex point of P2 lies inside of P1. Whether the result is true, P2 is entirely within of P1.

Case b: Verify where P2 contains a vertex point of P1, if the consequence of case a is not true. If the result is true, then P2 comprises P1.

Case c: If both case-a and case-b as containment test such are failed then we decided to disjoint P1 and P2.

For a known screen area, we remain a PVPL that is potentially visible polygons list, those in categories 1, 2 and 3. Disjoint polygons are certainly not visible. Also, notice that on subdivision of a screen region, disjoint and surrounding polygons keep in surrounding and disjoint polygons of the newly formed regions. Thus, only intersecting and contained polygons necessitate to be reclassified.

Posted Date: 4/5/2013 1:32:38 AM | Location : United States







Related Discussions:- Containment test - visible surface detection, Assignment Help, Ask Question on Containment test - visible surface detection, Get Answer, Expert's Help, Containment test - visible surface detection Discussions

Write discussion on Containment test - visible surface detection
Your posts are moderated
Related Questions
Basic Transformations - 2-d and 3-d Transformations Consider the xy-coordinate system upon a plane. An object or Obj in a plane can be identified as a set of points. All objec

Important Notes for Negative Accelerations Note : Having projections of points on curve, above Y axis we will obtain a pattern similar to figure 8 that is needed to produce ne

A convex polygonal region having n- vertices {P 0 , P 1 , P 2 ..., P n - 1 , P n , P 0 } or lattice points to be identified by the user includes the convex window area. To be exact

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

y-shear about the origin - 2-d and 3-d transformations Suppose an object point P(x,y) be moved to P'(x',y') in the x-direction, through the specified scale parameter 'b'. that

Translation and shifting in Spatial Domain A) The three images shown below were blurred using square masks of sizes n=23, 25, and 45, respectively. The vertical bars on the le

AUDIO AND VIDEO: Audio and video are working as eye and ear of multimedia. Both of them are heavily contributing to any type of multimedia application. Here we discuss something r

Relation between polar coordinate system and Cartesian system A frequently utilized non-cartesian system is Polar coordinate system. The subsequent figure A demonstrates a pol

Quicktime Quicktime is the video format devised through and used through Apple and can be utilized at varying quality and file sizes. This is quite broadly used and has affecte

Polygon Surfaces - Curves and Surfaces   By Figure 1 and Figure 2 it is clear that it is possible to store description of objects as a set of surface polygons and similar i