Polygon representation methods - space partitioning, Computer Graphics

Polygon representation methods - Space Partitioning Representations

Space partitioning representations: this type of representation is used for explain the interior properties, through partitioning the spatial region having an object in a set of small non-overlapping contiguous solids i.e. usually cubes. Illustration: Octree that is the space partitioning explanation of 3-D object. For a better knowledge consider here figure 2.

1946_Polygon representation methods - Space partitioning representations.png

Out of the different representational methods mentioned above, the most commonly utilized boundary representation mechanism for showing 3D objects is utilizing a set of polygon surfaces to enclose the object interior. Here discuss this mechanism in our next sub-section.

Posted Date: 4/4/2013 3:46:49 AM | Location : United States







Related Discussions:- Polygon representation methods - space partitioning, Assignment Help, Ask Question on Polygon representation methods - space partitioning, Get Answer, Expert's Help, Polygon representation methods - space partitioning Discussions

Write discussion on Polygon representation methods - space partitioning
Your posts are moderated
Related Questions
Midpoint circle generation algorithm This makes use of a circle function. Based on this circle function, a decision parameter is created which is used to decide successive pixe

Question 1 Briefly explain types of animation Question 2 Briefly explain steps involved in animation process Question 3 What is Layout? Explain two types of layout

Polygon representation methods - Boundary representations Boundary representations: now the 3-D object is shown as a set of surfaces which separate the object interior from

Constant intensity shading OR Flat shading  In this technique particular intensity is calculated for each polygon surface that is all points that lie upon the surface of the

#question. Steps involved in the solution of operation research problem

why overstriking is harmful.justify

Polygon or Area Clipping Algorithm - Sutherland-Hodgman Algorithm There are different algorithms as Liang-Barsky, Line clipping, Weiler-Atherton Polygon Clipping,


Line Drawing - Points and lines Line drawing is accomplished through computing the intermediate point coordinates along the line path between two given end points. Since, scre

Disadvantages : 1)   Doubles memory needs, one for at least z-buffer and one for refreshes- buffer. 2)   Dependency of device and memory intensive. 3) Wasted calculation u