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

Assumption regarding to the Digital Differential Analyzer Algorithm The line generation by DDA is discussed merely for the first Quadrant, whether the line lies in the other q

Parametric Continuity Conditions   To ensure a smooth transitions from one section of a piecewise parametric curve to the next, we can impose various continuity conditions at the

Similarly we can control the intensity of colours We contain more bit planes for all colour say three bit planes for R, 3 for G and 3 for B here all bit plane of size mxn, hen

Algorithm (scan-line): For each scan line perform from step (1) to (3). 1) For all pixels on a scan-line, arrange depth [x]=1.0 i.e. max value and Intensity [x] = background

What is uniform rational splines

are you a robot

Features for good 3-Dimentional modeling software are as: Multiple windows which permit you to view your model in each dimension. Capability to drag and drop primitive

Question: a) Datagram packet delivery and Virtual circuit packet delivery are two approaches to the delivery of packets by the network layer. Explain. b) What is the meaning

Explain window to view port transformation