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
GIF File Compression The Graphic Interchange Format file format utilizes a relatively basic form of file compression which squeezes out inefficiencies within the data storage w

Frame Buffers - Graphics Hardware The storage region in a raster scan display system is set as a two-dimensional table. All row-column entry stores information as brightness

Objectives of 2-D Viewing and Clipping After going through this section, you should be capable to: 1. Describe the concept of clipping, 2. Observe how line clipping is p

Types of Polygon tables curves and surfaces Attribute tables: This table has object information as transparency, surface reflexivity, texture features of an object in the vi

Distinguish between bitBlt and pixBlt?  Raster functions that manipulate rectangular pixel arrays are usually referred to as raster ops. Moving a block of pixels from one locat

Distinguish between window port & view port?  A portion of a picture that is to be displayed by a window is called as window port. The display area of the part selected or the f

Character Generation You know that graphics displays often contain components which are text based.  For example graph labels, annotations, descriptions on data flow diagrams,

Question: (a) Name two visual effects you would use to communicate: i. Good old days ii. Rebellion iii. Fear (b) Explain each of your answers given in section (a).


Scan Line Algorithm A scan line algorithm determines the overlap intervals of the polygon with each scan line to obtain interior points of the polygon for assigning those point