Subdivision of polygon - visible surface detection , Computer Graphics

Subdivision of polygon

Test to find out the visibility of a single surface are made through comparing surfaces that as polygons P along regarding a specified screen area A. There are four types of possibilities as:

i. Surrounding polygon: Polygon which completely comprises the area as in the figure (a).

ii. Intersecting or overlapping polygon: Polygon which intersects the area as in the figure (b).

iii. Contained polygon: polygon which is completely comprised inside the area as in the figure(c).

iv. Disjoint polygon: Polygon which is totally outside the area as in the figure (d).

2279_Subdivision of polygon - Visible Surface Detection.png

The classification of the polygons inside a picture is the major computational expense of the algorithm and that is analogous to the clipping algorithms also. Along with the utilization of any one of the clipping algorithms there a polygon in category two as intersecting polygon that can be clipped into a comprised polygon and a disjoint polygon as in the figure 10. Thus, we could proceed as whether category 2 was removed.

2081_Subdivision of polygon - Visible Surface Detection 1.png

Posted Date: 4/5/2013 1:24:22 AM | Location : United States







Related Discussions:- Subdivision of polygon - visible surface detection , Assignment Help, Ask Question on Subdivision of polygon - visible surface detection , Get Answer, Expert's Help, Subdivision of polygon - visible surface detection Discussions

Write discussion on Subdivision of polygon - visible surface detection
Your posts are moderated
Related Questions
Combined consequence of ambient and diffused reflection At this time the resulting intensity I will be the total sum of the intensities in case 8.3.2 and 8.3.3 we find that:

How to implement z-buffer algorithm using C programming

This renders a polygon surface by linearly interpolating intensity values across the surface. Intensity values for each polygon are matched with the values of adjacent polygon alon

What is meant by Addressability?  The Addressability is the number of individual dots per inch (d.p.i) that can be formed. If the address of the current dot is (x, y) then the


Performing rotation about an Axis For performing rotation about an axis parallel to one of the coordinate axes (say z-axis), you first need to translate the axis (and hence the

Assumptions for Polygon or Area Clipping Algorithm Assumption: The viewport and window are rectangular. So only, by identifying the maximum and the minimum coordinates t

What is orthographic parallel projection?  When the direction of the projection is normal (perpendicular) to the view plane then the projection is called as orthographic paral

Perspective Projections - Transformation In this projection the center of projection is at limited distance. This projection is termed as perspective projection since in this

X-shear Regarding 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, via the given scale parameter 'a',that is,