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

Forensics-applications for computer animation, Forensics: Accidents occur ...

Forensics: Accidents occur every minute. Very frequently, there are no witnesses except for the individuals concerned in the accident or worse yet, there are no surviving witnesse

What is vanishing point and view reference point, What is vanishing point a...

What is vanishing point and view reference point? The perspective projections of any set of parallel lines that are not parallel to the projection plane converge to appoint cal

Interfacing lcd liquid crystal display, Main Objectives: Interfacing...

Main Objectives: Interfacing LCD to the Micro-controller (PIC18F4520) Programming LCD by using C- language via MPLAB Sending data or command to the LCD Component

What is graphics, What is Graphics It is a term that refers to any com...

What is Graphics It is a term that refers to any computer device or program which makes a computer able of displaying and manipulating pictures. The name also refers to the im

Summary of graphic primitives, Summary of Graphic Primitives In this a...

Summary of Graphic Primitives In this all section, we have illustrated the basic graphic primitives that are line, point and circle; we have also illustrated both practical an

Axis of rotation - construction of a solid, Axis of Rotation - Construction...

Axis of Rotation - Construction of a solid with a translational sweep Figure:  (a)                                                                          Figure  (b)

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

Boundary fill algorithm - output primitives, Boundary Fill Algorithm Bo...

Boundary Fill Algorithm Boundary fill algorithm is suitable when the boundary has single color while flood fill algorithm is more suitable for filling regions which are defined

Cohen sutherland, explain cohen sutherland line clipping algorithm

explain cohen sutherland line clipping algorithm

Buffer areas required for z-buffer algorithm, Buffer Areas Required For Z-B...

Buffer Areas Required For Z-Buffer Algorithm For applying z-buffer algorithm, we need two buffer areas or two 2-Dimentional arrays: 1) Depth-buffer [i,j], to sa

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