Illustrate the wire frame representation, Data Structure & Algorithms

Assignment Help:

RENDERING, SHADING AND COLOURING

By introducing hidden line removal we have already taken one step away from wire-frame drawings towards being able to realistically model and display 3-D objects. Perhaps the biggest step down that road comes when attempting to "colour in" our simple line drawings. The various algorithms for rendering, the process of applying lighting, colouring, shadow and texture to an object or scene in order to obtain a realistic image, are all based to a greater or lesser extent on the study of the physical properties of light. In this unit we shall examine various properties of light and the way it interacts with objects and develop some simple mathematical models of its behaviour. It is worth setting the following discussion in the context of our system as developed so far. Currently our 3d model is made up of surfaces, each of which we represent on the screen by drawing its outline. If we wanted to shade each polygon ("colour it in") what color would we use? What we basically are trying to achieve in this chapter is to derive a method for calculating that colour. Figure 3.16 shows the difference between a wire-frame representation and a simple rendered version

 

 


Related Discussions:- Illustrate the wire frame representation

Linked list, Write a program for reversing the Linked list

Write a program for reversing the Linked list

Present the algorithm of binary search. , B i n a ry Search Alg...

B i n a ry Search Algorithm is given as follows 1. if (low > high) 2.     return (-1) 3. mid = (low +high)/2; 4. if ( X = = a [mid]) 5.      return (mid); 6.

What is a container taxonomy, What is A Container Taxonomy It's useful ...

What is A Container Taxonomy It's useful to place containers in a taxonomy to help understand their relationships to one another and as a basis for implementation using a class

Maximum numbers of nodes a binary tree of depth d, Maximum numbers of nodes...

Maximum numbers of nodes a binary tree of depth d The maximum numbers of nodes a binary tree of depth d can have is 2 d+1 -1.

Explain the concept of colouring, Colouring The use of colours in CAD/C...

Colouring The use of colours in CAD/CAM has two main objectives : facilitate creating geometry and display images. Colours can be used in geometric construction. In this case,

C++, #What is the pointer

#What is the pointer

Mathematical-model with a collection of operations, A mathematical-model wi...

A mathematical-model with a collection of operations described on that model is known as??? Abstract Data Type

Context sensitive f1 help on a field, In what ways we can get the context s...

In what ways we can get the context sensitive F1 help on a field?' Data element documentation. Data element additional text in screen painter. Using the process on help r

Explain merge sort, Merge sort: Merge sort is a sorting algorithm that ...

Merge sort: Merge sort is a sorting algorithm that uses the idea of split and conquers. This algorithm splits the array into two halves, sorts them separately and then merges t

Multilist file organisation, what is multilist length file organisation? ex...

what is multilist length file organisation? explain with an example

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