2d clipping algorithms - clipping and 3d primitives, Computer Graphics

Assignment Help:

2D Clipping Algorithms

Clipping is an operation that eliminates invisible objects from the view window.  To understand clipping, recall that when we take a snapshot of a scene, we adjust our aperture and focus to bring only desirable objects within the window and the final shot is taken once the window contains only those objects within the frame.  From the point of view of mathematics, the problem of clipping looks simple.  All that we have to do is to find out the extremities of the object and check their intersection with the window.  This however is a critical problem from the point of view of processing in computer.  In gaming industry especially, when animation at a high speed has to be shown, time complexity of these clipping methods are crucial.  You will observe that due to this reasons in most of the clipping algorithms, intersection calculations are avoided as far as possible.  The basic idea behind these algorithms is to maximize the performance and efficiency by deciding the visibility/partial visibility/invisibility of an object using the minimum number of intersection calculations.  In this section you will study clipping algorithms for the following primitive objects

  • Point
  • Line
  • Area
  • Curve
  • Text

Related Discussions:- 2d clipping algorithms - clipping and 3d primitives

Remote sensing packages-Image processing, Remote Sensing Packages: general...

Remote Sensing Packages: generally utilized software illustration is-" ERDAS" Characteristics: I.Best suitable for satellite imagery system. II. ERDAS uses geo-spatial in

Persistence of phosphor - display devices, Persistence (of phosphor) - Disp...

Persistence (of phosphor) - Display devices Time it takes the emitted light from screen to decay to one-tenth of its original intensity. The point where an electron gun strikes

What is surface patch, What is surface patch?  A single surface element...

What is surface patch?  A single surface element can be explained as the surface traced out as two parameters (u, v) take all possible values between 0 and 1 in a two-parameter

Uniform b - spline curve, Uniform B - spline curve: When the spacing betwe...

Uniform B - spline curve: When the spacing between Knot values is constant, the resulting curve is called a uniform B- spline. Blending function for B- spline curves are defined b

perform a perspective projection on the plane, Consider at line segment AB...

Consider at line segment AB in the Figure k, parallel to the z-axis along with end points A (3, 2, 4) and B (3, 2, 8). Perform a perspective projection on the z = 0 plane from the

Distinguish between convex and concave polygons, Distinguish between convex...

Distinguish between convex and concave polygons? If the line joining any two points in the polygon lies totally inside the polygon then, they are called as convex polygons. If

Radiosity - polygon rendering & ray tracing methods, Radiosity - Polygon Re...

Radiosity - Polygon Rendering & Ray Tracing Methods Radiosity simulates the diffuse propagation of light begin at the light sources. Because global illumination is an extremel

Depth-buffer (or z-buffer) method , Depth-buffer (or z-buffer) Method ...

Depth-buffer (or z-buffer) Method  Z-buffer method is a fast and easy technique for specifying visible-surfaces. Z-buffer method is also termed to as the z-buffer method, as

Determine the steps uses in cohen sutherland line clipping, Steps uses in t...

Steps uses in the Cohen Sutherland Line Clipping Algorithm are: Figure: Steps for Cohen Sutherland Line Clipping STEP 1: Input:  x L , x R , y T , y B

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