Removing polygons hidden through a surrounding polygon, Computer Graphics

Removing Polygons Hidden through a Surrounding Polygon:

The key to capable visibility calculation lies actually a polygon is not visible whether it is in back of a surrounding polygon. Thus, it can be eliminated by the PVPL. To assist processing, this list is sorted through zmin, the smallest z coordinate of the polygon inside this area. Furthermore, for all surrounding polygons S, we record also its largest z coordinate, zsmax.

For a polygon P on the list as zpmin >zsmax only for a surrounding polygon S, then P is hidden through S and hence is not visible. As well, all other polygons after P on the list will also be hidden through S, thus we can eliminate these polygons by the PVPL.

Posted Date: 4/5/2013 1:33:48 AM | Location : United States







Related Discussions:- Removing polygons hidden through a surrounding polygon, Assignment Help, Ask Question on Removing polygons hidden through a surrounding polygon, Get Answer, Expert's Help, Removing polygons hidden through a surrounding polygon Discussions

Write discussion on Removing polygons hidden through a surrounding polygon
Your posts are moderated
Related Questions
What is the advantages of electrostatic plotters? Advantages of electrostatic plotters: They have very high quality printers and faster than pen plotters. Recent electros

The image classification is the process to categorize images into one of several classes or categories. In this project, there are seven categories (Piano, Kangaroo, Strawberry, Su

Advantages and Deficiencies of Gourand Shading Advantages of Gourand Shading: this eliminates the intensity discontinuities related with the constant shading model. Defi

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

why overstriking is harmful.justify

Computer Aided Design and Drafting CADD or CAD stands for Computer Aided Design and Drafting. This is different from both "draw" and "paint" programs in which measurement is c

De Casteljau Algorithm For computation of Bézier curves an iterative algorithm known as de Casteljau algorithm is used.  The algorithm uses repeated linear interpolation.

B-spline curves - clipping and 3d primitives B-spline curves are piecewise polynomial cubes with one or more polynomial pieces with a minimum smoothness requirement.  For examp

What is the use of control points?  Spline curve can be specified by giving a set of coordinate positions known as control points, which shows the general shape of the curve, c

Important points about the bezier curves - modeling and rendering 1) Generalizing the idea of Bezier curve of degree at n based upon n+1 control point p0,.....pn P(0)= P 0