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

Non-zero accelerations - computer animation, Non-Zero Accelerations - Compu...

Non-Zero Accelerations - Computer Animation This method of simulating the motion is fairly helpful introducing the realistic displays of speed changes, particularly at the sta

Principle vanishing point - perspective projections, Principle Vanishing po...

Principle Vanishing point - Perspective Projections Assume that line 1 and l2 be two straight lines parallel to each other that are also parallel to x-axis. If the projection

Homogeneous coordinate systems - 2-d and 3-d transformations, Homogeneous C...

Homogeneous Coordinate Systems - 2-d and 3-d transformations Suppose P(x,y) be any point in 2-D Euclidean (Cartesian) system. In HC System, we add a third coordinate to a poin

Windowing transformations - raster graphics and clipping, Windowing Transf...

Windowing Transformations - Raster Graphics and  Clipping From the above section of introduction, we understood the meaning of the viewport and term window that could again be

B splines, What is uniform rational splines

What is uniform rational splines

Principal vanishing point write respect to y-axis, Principal vanishing poin...

Principal vanishing point write respect to y-axis By the 2nd Row of the matrix as in Equation, the principal vanishing point w.r.t y-axis will as: (0, 5/√2, 0, 1/√2) in hom

Crt, working of crt

working of crt

Objects - polygon rendering and ray tracing methods, Objects - polygon rend...

Objects - polygon rendering and ray tracing methods Objects could be any state of material as solid, liquid. Gas and plasma. Though ray tracers can merely assist objects whic

Basic structures for multimedia interactive applications, Question: (a)...

Question: (a) Sound often gives the only effective way to convey an idea, elicit an emotion, or dramatise a point. Explain two situations of the use of sound that would be con

Reflection, Determine the transformation matrix for the reflection, Compute...

Determine the transformation matrix for the reflection, Computer Graphics

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