Plane equation - curves and surfaces, Computer Graphics

Assignment Help:

Plane Equation - Curves and Surfaces

Plane is a polygonal surface that bisects its environment in two halves. One is termed to as forward and another as backward half of some plane. Currently the question is that half is forward and that backward, since both are relative terms. Thus to get rid of this dilemma, we utilize the mathematical representation of planes, that is, concepts as equations of planes, normal to a plane and so on, that we have already studied. Now we know that both forward and backward halves are associative terms but with respect to what? Yes, it's the plane itself in respect of that we can say any point in the surrounding environment is in back or front of the plane. Hence we see any point on the plane must satisfy the equation of a plane to be zero, that is: Ax + By + Cz + D=0. This equation implies any point (x,y,z) will only lie upon the plane whether it satisfies the equation to be zero any point (x,y,z) will lie upon the front of the plane whether it satisfies the equation to be greater than zero and one of point (x,y,z) will lie upon the back of the plane whether it satisfies the equation to be less than zero.

Here (x, y, z) is any point on the plane, and the coefficients A, B, C and D are constants explaining the spatial properties of the plane? This idea of space partitioning is used commonly in method of BSP that is Binary Space Partitioning, trees generation a polygon representation scheme, fairly similar to Octrees.

The significance of plane equations is that they assist in producing display of any 3-D object, but for such we have to to process the input data representation for the object by several procedures that may include the follow steps of processing.

  • To transform the modeling and world-coordinate explanations to viewing coordinates,
  • To devise coordinates,
  • To know visible surfaces,
  • To apply surface-rendering processes

Related Discussions:- Plane equation - curves and surfaces

Line drawing - points and lines, Line Drawing - Points and lines Line ...

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

Education - applications for computer animation, Education - applications f...

Education - applications for computer animation Currently, studies of subjects as Art, Physics, Maths, Chemistry, Biology, Engineering, Medicine, and Technology are fairly simp

What do you understand by the term contone, Question : (a) What do you...

Question : (a) What do you understand by the term ‘contone'? (b) What are spot colours? (c) You have been asked to prepare an artwork (a magazine) to send to a printer.

Translation - 2-d and 3-d transformations, Translation - 2-d and 3-d Transf...

Translation - 2-d and 3-d Transformations It is the process of changing the position of an object. Suppose an object point P(x,y)=xI+yJ be moved to P'(x',y') by the specified

Dissimilarity between the printer and the plotter, Dissimilarity between th...

Dissimilarity between the Printer and the Plotter 1)  Plotters print their output through moving a pen across the surface of paper's piece. It implies that plotters are lim

Texturing - texture coordinate, Background Texturing is like wallpaperin...

Background Texturing is like wallpapering; you are pasting an image onto the OpenGL Quad primitive.  Recall that GL_QUAD is specified by four vertices.  An image, or a texture,

Distinguish between mono and stereo sound, Problem: (a) Distinguish be...

Problem: (a) Distinguish between mono and stereo sound? (b) Calculate the size of a 5 minutes mono sound file of CD quality and with a 16 -bit rate. (c) With reference

Categories of line segments - 2d clipping algorithms, Categories of Line Se...

Categories of Line Segments It categorizes line segments into three categories (i) trivially rejected (ii) trivially selected (iii) may be partially visible or totally invisibl

Algorithm scan-line, Algorithm (scan-line): For each scan line perform ...

Algorithm (scan-line): For each scan line perform from step (1) to (3). 1) For all pixels on a scan-line, arrange depth [x]=1.0 i.e. max value and Intensity [x] = background

PHONG INTERPOLATION, DESCRIBE PHONG INTERPOLATION SHADING METHOD

DESCRIBE PHONG INTERPOLATION SHADING METHOD

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