Basic ray tracing algorithm - polygon rendering, Computer Graphics

Assignment Help:

Basic Ray Tracing Algorithm - Polygon Rendering

The Hidden-surface removal is the most complete and most versatile method for display of objects in a realistic fashion. The concept is simply to take one ray at a time, emanating from the viewer's eye (in perspective projection) or from the bundle of parallel lines of sight (in parallel projection) and reaching out to each and every pixel in the viewport, using the laws of optics.

Generally, to avoid wastage of effort by rays starting from sources of light going out of the viewport, the reverse procedure of starting with ray from the viewpoint and traveling to each pixel in the viewport is adopted. If the ray encounters one or more objects, the algorithm filters out all but the nearest object, or when there is an overlap or a hole, the nearest visible portion of all the objects along the line of sight.


Related Discussions:- Basic ray tracing algorithm - polygon rendering

Distinguish between window port and view port, Distinguish between window p...

Distinguish between window port & view port?  A portion of a picture that is to be displayed by a window is called as window port. The display area of the part selected or the f

What is 2-dimensional transformation, 2-DIMENSIONAL TRANSFORMATION Mode...

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

How to control the contents of the video buffer, OBJECTIVE Since graphic...

OBJECTIVE Since graphics plays a very important role in modern computer application, it is important to know more information about its hardware and software operations. Despite

Phong shading or normal vector interpolation shading, Phong shading OR Norm...

Phong shading OR Normal Vector Interpolation Shading In Gouraud shading we were doing direct interpolation of intensities although a more exact method for rendering a polygon

Cases for subdivisions of polygon-visible surface detection, Cases for Subd...

Cases for Subdivisions of Polygon No additional subdivisions of a particular area are desired, if one of the subsequent conditions is true as: Case 1: All the polygons ar

Important points for bresenham line generation algorithm, Important points ...

Important points for Bresenham Line Generation Algorithm Note: Bresenhams algorithm is generalised to lines along with arbitrary slopes with identifying the symmetry

Video conferencing and virtual reality, Video Conferencing and Virtual Real...

Video Conferencing and Virtual Reality Virtual reality is a truly fascinating multimedia application. In such, the computer creates an artificial environment using hardware an

Trivial rejection case of cohen sutherland line clippings, Trivial Rejectio...

Trivial Rejection Case of cohen sutherland line clippings Case: it  is Trivial Rejection Case; if the logical intersection (AND) of the bit codes of the end points P, Q of

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