Anti aliasing - modeling and rendering, Computer Graphics

Assignment Help:

Anti Aliasing - Modeling and Rendering

It is a method for enhancing the realism of an image through eliminating the jagged edges from it. Such jagged edges or "jaggies", appear since a computer monitor has square pixels, and these square pixels are inadequate for displaying lines or curves which are not parallel to the pixels and the other reason is low sampling rate of the image information, that in turn cause such jaggies quite same to star casing discussed in previous under DDA algorithm. For better understanding, get the subsequent image of darkened circle as:

2303_Anti Aliasing - Modeling and Rendering.png

It is impossible to completely remove aliasing since computers are digital discrete in nature. Though, it is not impossible to minimize aliasing, the solutions utilized by ray tracers today engage treating all pixels as a finite square area that, in fact as they are, quite than as a mere point on the screen. Conversely, the pixel must not be taken as a point or area although should be taken as a sample of image information as higher the sampling is lesser the aliasing is. Here let us discuss how suitably the sampling can be complete: Rays are fired in the scene by the centers of the pixels and the intensities of adjacent rays are evaluated. If they be different by several pre-determined amount, more rays are fired in the surfaces of the pixels. The intensities of each ray shot in a specified pixel are then averaged to determine a color which better fits what would be expected at such point.

Note: Do not treat a pixel like a square area, when this does not generate correct filtering behavior, actually a pixel is not a point, although it is a sample of information to be displayed.

Anti-aliasing, it assists eliminate jagged edges and to create an image seem more realistic. Continuing the above illustration, the anti-aliased circle might, after that be represented

2214_Anti Aliasing - Modeling and Rendering 1.png


Related Discussions:- Anti aliasing - modeling and rendering

Characteristics of digital video, Digital video can be characterized by a f...

Digital video can be characterized by a few variables: Frame rate : various frames displayed per second. The illusion of motion may be experienced on frame rates as low as 12 f

What do you mean by scan conversion, What do you mean by scan conversion?  ...

What do you mean by scan conversion?  A main task of the display processor is digitizing a picture definition given in an application program into a set of pixel-intensity valu

Psychrometric properties - design project, Read the next page and work thro...

Read the next page and work through the steps: a.  Select a location (anywhere in the world) and research the typical weather (temperature, barometric pressure, and humidity).

Acquire a transformation matrix for perspective projection, Acquire a trans...

Acquire a transformation matrix for perspective projection for a specified object projected onto x=3 plane as viewed by (5,0,0). Solution: Plane of projection: x = 3 as given.

Overstriking, why overstriking is harmful.justify

why overstriking is harmful.justify

Resolution-introduction to computer graphics, Resolution Graphic demons...

Resolution Graphic demonstrations are utilized in presentations to assist convey a concept or express a mood, two kinds of demonstrations graphics are: Vector, and B

Achieve a perspective projection on the plane of unit cube, Achieve a persp...

Achieve a perspective projection on the z = 0 plane of the unit cube, demonstrated in Figure (l) from the cop at E (0, 0, 10) upon the z-axis. Figure: I 01:  currently c

Explain the bresenham line generation algorithm, 1. Explain the Bresenham ...

1. Explain the Bresenham line generation algorithm via digitizing the line with end  points as (15, 5) and also (25,13). Ans. Now we are utilizing the Bresenham line generati

Devi, Explain the 3d transformations

Explain the 3d transformations

Cases of the sutherland hodgman polygon clipping algorithm, Cases of the Su...

Cases of the Sutherland Hodgman Polygon Clipping Algorithm In order to clip polygon edges against a window edge we move from vertex V i to the subsequent vertexV i+1 and cho

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