Area subdivision method-obscures the continuing two surface, Computer Graphics

Assume here are three polygon surfaces P,Q, R along with vertices specified by as: P: P1(1,1,1), P2(4,5,2), P3(5,2,5)

And as Q: Q1(2,2,0.5), Q2(3,3,1.75), Q3(6,1,0.5) R: R1(0.5,2,5.5), R2(2,5,3), R3(4,4,5)

By using the Area subdivision method, that of the 3-polygon surfaces P, Q, R obscures the continuing two surfaces? Let assume z=0 is the projection plane.

Solution: Now, we have z=0 is the projection plane and P, Q, R is the 3-Dimentional planes.

We apply initially three visibility decision tests that are (a), (b) and (c), to verify the bounding rectangles of all surfaces against the region boundaries in the xy- plane. By using test 4, we can find out whether the minimum depth of individual of the surrounding surface S, that is nearer to the view plane.

Posted Date: 4/5/2013 1:37:14 AM | Location : United States







Related Discussions:- Area subdivision method-obscures the continuing two surface, Assignment Help, Ask Question on Area subdivision method-obscures the continuing two surface, Get Answer, Expert's Help, Area subdivision method-obscures the continuing two surface Discussions

Write discussion on Area subdivision method-obscures the continuing two surface
Your posts are moderated
Related Questions

2-DIMENSIONAL TRANSFORMATION Modeling transformation is the mechanism to compose an image from modeling  primitives. The modeling primitives are defined in their own coordinate

Common Steps of Designing the Animation Sequence Common Steps of designing the animation sequence are as given: 1) Layout of Storyboard: Storyboard layout is the action ou

Sequencing of Animation Design Previously we have discussed many things regarding the traditional and current trends of computer created animation although now it is time to pr

what is region filling? give details

Three dimensional display methods: Among the simplest three dimensional surface representations are the polygonal surfaces.  A polygonal surface is described by vertices

boundary-fill algorithm or flood-fill algorithm As you saw the implementation of scan line polygon fill requires that boundaries should be straight line segments.  The seed fi

Transformation for 3-D Rotation Rotation in 3-dimensions is considerably more complicated then rotation in 2-dimensions. In 2-Dimentional, a rotation is prescribed via an angl

Adavantage and disadvantages of DDA and Bresenhams line drawing algorithm

2D Line Segment Generation  A digitally plotted line is basically an approximation of infinite number of points on an abstract line segment by only a finite number of points on