Subdivision of polygon - visible surface detection , Computer Graphics

Assignment Help:

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


Related Discussions:- Subdivision of polygon - visible surface detection

Mathematics-applications for computer animation, Mathematics: There are so...

Mathematics: There are some area like Probability, combination, permutation, etc.,that can be well explained along with the help of animation, that helps in enhancing the learning

What is a dot size, What is a dot size? Dot size may be explained as th...

What is a dot size? Dot size may be explained as the diameter of a single dot on the devices output. Dot size is also known as the Spot size.

Simulating accelerations - computer animation, Simulating Accelerations - C...

Simulating Accelerations - Computer Animation In previous block, we have seen the dominance and function of mathematics in computer graphics and now, we will undertake the invo

Exemplify bresenham line generation algorithm by digitizing, Example: Exem...

Example: Exemplify the Bresenham line generation algorithm through digitizing the line along with end points (20, 10) and (30, 18) Solution: m =    (y2 - y1)/( x2 - x1)  =

Other curves - parabola and hyperbola, Other curves - parabola and hyperbol...

Other curves - parabola and hyperbola Conic sections such as parabola and hyperbola are used in many instances such as in motion planning along a trajectory or in modelling the

Algorithms for filled-area primitives, Algorithms for filled-area primitive...

Algorithms for filled-area primitives These algorithms are classified into two categories (i)  Scan line algorithms (ii) Seed fill algorithms.

Hypertext/media and human memory, Hypertext/media and Human Memory Huma...

Hypertext/media and Human Memory Humans associate pieces of information along with other information and make complicated knowledge structures. Thus, this is also said as the h

Microsoft Word 2010, what are three features to use to create your flyer to...

what are three features to use to create your flyer to market?

Opengl, Write a program that allows interactive manipulation of the positio...

Write a program that allows interactive manipulation of the position and orientation of a camera. Draw a teapot at the global origin 0,0,0. You can find a shaded teapot model and

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd