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
Functioning of Input Devices Functioning of input devices-Keyboard, mouse, trackball and space ball, Joystick, data glove, digitizer, scanner, touch panel, light pen, voice sys

De Casteljeau algorithm: The control points P 0 , P 1 , P 2 and P 3 are combined with line segments termed as 'control polygon', even if they are not actually a polygon although

Merits -Phong shading or Normal Vector Interpolation Shading Hence by finding intensities at various points across the edge we determine the intensity that is varying across t

explain interactive picture-construction techniques

The transformation regarding to the mirror reflection to this line L comprises the subsequent basic transformations: 1) Translate the intersection point A(0,c) to the origin, it

What is scan line algorithm?  One way to fill the polygon is to apply the inside test. I.e. to check whether the pixel is inside the polygon or outside the polygon and then hig

identify a sphere along with a light source above it; hence its lower half will not be illuminated. In practice in a actual scene this lower half would be partially illuminated thr

Compression methods utilized for digital video can be categorized in three major groups: General reason compression techniques can be utilized for any type of data. Intr


GRAPHICS: It is one of the core elements of any multimedia application. We all have heard a well-known saying as "one picture conveys a message of 1000 words", hence without