Surface of revolution - modeling and rendering, Computer Graphics

Surface of Revolution - Modeling and Rendering

In the previsions sections we have learned different type of techniques of generating curves, although if we wish to generate a close geometry that is extremely symmetric in all the halves, that is: front-back, top or bottom; after that it will be quite complicated for any person by doing this separately for all half. In such a situation the idea of surface revolution is fairly useful, since it assists in producing graphic objects hence they are very symmetric in all half. Such geometries produced after Surface revolution is also termed as Sweep Representations that is one of the solid modeling construction methods provided by several graphic packages.

Sweep representations are helpful for making three-dimensional objects such possess translational, rotational or another symmetry. We can show such objects by specifying a two-dimensional shape and a sweep which moves the shape via a region of space. A set of two-dimensional primitives, as rectangles and circles, can be specified for sweep representations as menu options. Another method for obtaining two-dimensional figures includes closed spline-curve structures and cross-sectional slices of solid objects. Here we discuss this simple method of generating symmetric objects.

Posted Date: 4/4/2013 6:11:04 AM | Location : United States







Related Discussions:- Surface of revolution - modeling and rendering, Assignment Help, Ask Question on Surface of revolution - modeling and rendering, Get Answer, Expert's Help, Surface of revolution - modeling and rendering Discussions

Write discussion on Surface of revolution - modeling and rendering
Your posts are moderated
Related Questions
Raster Scan Display Device - types of refresh monitors Now day screen display is also based on Cathode ray Tube technology, except that in place of displaying the picture tra


explain cohen sutherland line clipping 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

Use DDA algorithm to get the output of your program as shown in Figure ANs: Use DDA( ) function to plot line segments that have end points on diametrically opposite points

To prove: P (u = 0) = p0 Solution : = p 0 B n,0 (u) + p 1 B n, 1 (u) +...... + p n B n, n (u)...............(1)  B n,i (u) = n c i u i (1 - u) n-i B n,0

Trivial acceptance case of cohen sutherland line clippings Case 1: it is Trivial acceptance case whether the UDLR bit codes of the end points P, Q of a provided line is 0000

Write a C code for generating concentric circles.  Put the circle function circleMidpoint()in a for loop  as follows: for( int radius = MinRadius; radius circleMidpoint(i

3Dstudio - Softwares for computer animation 3DStudio is a 3-D computer graphics programmed. 3DStudio runs on personal computers. This is relatively simple to use. Several schoo

Explain working of CRT