The Q&A Community for Students

MindStudy, question and answer site designed to help students, to help each other:
To ask, to learn, to share, to grow.

Ask Questions

Get the right answers. Fast

Answer Questions

Submit answers for community.

Be Somebody's Hero

Pat yourself on the back. You deserve it.

All Questions

542 questions

1302 views

Liang-Barsky Line Clipping Algorithm

Liang and Barsky have established an algorithm that uses floating-point arithmetic but finds the appropriate endpoints with at most four computations. This algorithm uses the parametric equations for a line and solves four inequalities to find the range of the parameter for which the line is in the viewport.

Super Admin
added 3 years ago
1552 views

Sutherland-Hodgeman Polygon Clipping

It is performed by processing the boundary of polygon against each window corner or edge. First of all entire polygon is clipped against one edge, then resulting polygon is considered, then the polygon is considered against the second edge, so on for all four edges.

Super Admin
added 3 years ago
1333 views

Rotation about Arbitrary Axis

When the object is rotated about an axis that is not parallel to any one of co-ordinate axis, i.e., x, y, z. Then additional transformations are required. First of all, alignment is needed, and then the object is being back to the original position. Following steps are required

Super Admin
added 3 years ago
1880 views

Inverse Transformations

These are also called as opposite transformations. If T is a translation matrix than inverse translation is representing using T-1. The inverse matrix is achieved using the opposite sign.

Super Admin
added 3 years ago
1589 views

Hidden Surface Removal

One of the most challenging problems in computer graphics is the removal of hidden parts from images of solid objects. In real life, the opaque material of these objects obstructs the light rays from hidden parts and prevents us from seeing them.

Super Admin
added 3 years ago
1792 views

Z-Buffer Algorithm

It is also called a Depth Buffer Algorithm. Depth buffer algorithm is simplest image space algorithm. For each pixel on the display screen, we keep a record of the depth of an object within the pixel that lies closest to the observer. In addition to depth, we also record the intensity that should be displayed to show the object.

Super Admin
added 3 years ago
1702 views

Painter Algorithm

It came under the category of list priority algorithm. It is also called a depth-sort algorithm. In this algorithm ordering of visibility of an object is done. If objects are reversed in a particular order, then correct picture results.

Super Admin
added 3 years ago
1210 views

Projection

It is the process of converting a 3D object into a 2D object. It is also defined as mapping or transformation of the object in projection plane or view plane. The view plane is displayed surface.

Super Admin
added 3 years ago
1536 views

Perspective Projection

In perspective projection farther away object from the viewer, small it appears. This property of projection gives an idea about depth. The artist use perspective projection from drawing three-dimensional scenes.

Super Admin
added 3 years ago
1676 views

Parallel Projection

Parallel Projection use to display picture in its true shape and size. When projectors are perpendicular to view plane then is called orthographic projection. The parallel projection is formed by extending parallel lines from each vertex on the object until they intersect the plane of the screen. The point of intersection is the projection of vertex.

Super Admin
added 3 years ago