Start Discovering Solved Questions and Your Course Assignments
TextBooks Included
Active Tutors
Asked Questions
Answered Questions
rgb modelthe rgb model is based on the assumption that any desired shade of colour can be obtained by mixing the correct amounts of red green and
illustrate trivariate colour modelsconventional colour models based on the tristimulus theory all contain three variables and so are called
properties of colourcolour descriptions and specifications generally include three properties hue saturation and brightness hue associates a colour
comparison of gouraud and phong shadingphong shading requires more calculations but produces better results for specular reflection than gouraud
approximating smooth surfaces with polygon netsnetworks of polygons are used to represent smooth surfaces they are of course only an approximation to
determine the components of illuminationthe light reaching the eye when looking at a surface has clearly come from a source or sources of
simplifying assumptions of wire frame representationneglect colour - consider intensity for now we shall forget about colour and restrict our
illumination of wire framethe colour or shade that a surface appears to the human eye depends primarily on three factors colour and strength of
rendering shading and colouringby introducing hidden line removal we have already taken one step away from wire-frame drawings towards being able to
overlapping or intersectinga polygon overlaps or intersects the current background if any of its sides cuts the edges of the viewport as depicted at
determine the disjoint of division methoda polygon is disjoint from the viewport if the x- and y-extents of the polygon do not overlap the viewport
surrounding of sub division methoda polygon surrounds a viewport if it completely encloses or covers the viewport this happens if none of its sides
area subdivision methodin this method the viewport is examined for clear decisions on the polygons situated in it in regard to their overlap and
binary space partitiona binary space-partitioning bsp tree is an efficient method for determining object visibility by painting surfaces onto the
explain about franklin algorithmwe mentioned how the number of possible comparisons of polygons grows as the square of the number of polygons in the
warnocks algorithman interesting approach to the hidden-surface problem was presented by warnock his method does not try to decide exactly what is
painters algorithmas the name suggests the algorithm follows the standard practice of a painter who would paint the background such as a backdrop
algorithm for z-buffer methoda initialize every pixel in the viewport to the smallest value of z namely z0 the z-value of the rear clipping plane
illustrate the back face detection methoda single polyhedron is a convex solid which has no external angle between faces less than 180deg and
explain about hidden-surface hidden-line removal refers to wire-frame diagrams without surface rendering and polygonal surfaces with straight edges
define wire-frame modelthis skeletal view is called a wire-frame model although not a realistic representation of the object it is still very
explain the concept of hidden linesthe problem of hidden lines or surfaces was implicit even in 2-d graphics but we did not mention it there because
how can the third dimension be displayed on the screenthe main problem in visualization is the display of three-dimensional objects and scenes on
determine the stereo visionthere is still one more major item missing before we can look at a computer display or plot and perceive it just as we see
normal 0 false false false en-in x-none x-none microsoftinternetexplorer4