Subdivision algorithm - visible surface detection, Computer Graphics

Subdivision Algorithm - Visible Surface Detection

1) Initialize the area to be the whole screen.

2) Create a PVPL regarding an area, sorted on zmin as the smallest z coordinate of the polygon inside the area. Place the polygons in their suitable categories. Eliminate polygons hidden through a surrounding polygon and eliminate disjoint polygons.

3) Do the visibility decision tests as:

i) If the list is blank, set all pixels to the background color.

ii) If there is particularly one polygon in the list and this is classified as intersecting as in category 2 or contained as in category 3, colour by scan-converter the polygon and color the keeping area to the background color.

iii) If there is particularly one polygon on the list and that is a surrounding one, color the region the color of the surrounding polygon.

iv) If the region is the pixel (x,y), and neither a, b, nor c applies, estimate the z coordinate z(x, y) at pixel (x, y) of all polygons upon the potentially visible polygons list. The pixel is after that set to the color of the polygon along with the smallest z coordinate.

4) If none of the exceeding cases has occurred, subdivide the screen region into fourths.

Go to step 2, for each region.

Posted Date: 4/5/2013 1:35:03 AM | Location : United States

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

Write discussion on Subdivision algorithm - visible surface detection
Your posts are moderated
Related Questions
what are three features to use to create your flyer to market?

Cyrus Beck Algorithm - Line Clipping Algorithm Cyrus Beck Line clipping algorithm is actually, a parametric line-clipping algorithm. The term parametric means that we requi

what is physx?

Transformation for 3-D Shearing 2-dimensional xy-shearing transformation, as explained in equation, can also be simply extended to 3-dimensional case. All coordinates are tran

what do you means by bresenham s him algorithm

Scan line algorithm and seed fill algorithm Two basic approaches are followed in area filling on raster systems.  In the first approach overlap intervals for scan lines that cr

Obtain an MRI image using the Open Source internet resources. i. Read the image into Scilab ii. Plot the image iii. Covert it into grayscale image and plot it iv. Find/

what is vecgen algorithm and bresenham linequestion..

To find out average unit normal vector at each polygon vertex At each polygon vertex as demonstrated by point V in the figure above, the normal vector is acquired by averaging