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

Assignemt, i need help in my Engineering graphic assignment

i need help in my Engineering graphic assignment

Other curves - parabola and hyperbola, Other curves - parabola and hyperbol...

Other curves - parabola and hyperbola Conic sections such as parabola and hyperbola are used in many instances such as in motion planning along a trajectory or in modelling the

How many times will vertex appear in the intersection points, 1. For the po...

1. For the polygon shown in Figure on the next page, how many times will the vertex V 1 appear in the set of intersection points for the scan line passing through that point?  How

What is the maximum number of objects such can be handled, What is the maxi...

What is the maximum number of objects such can be handled via the depth/z- buffer algorithm? Solution : In z-buffer algorithm, an arbitrary number of objects can be handled sin

Write short notes on active and passive transformations, Write short notes ...

Write short notes on active and passive transformations?  In the active transformation the points x and x represent different coordinates of the similar coordinate system. Here

Flash - software to generate computer animations, Flash - software to gener...

Flash - software to generate computer animations Flash: Learning Macro-Media's Flash can quite complicated, although you can do almost anything along with it. You can devel

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

What you mean by parallel projection, What you mean by parallel projection?...

What you mean by parallel projection?  Parallel projection is one in which z coordinates is discarded and parallel lines from every vertex on the object are extended unless the

Illustration, mcqs of illustration in nts test

mcqs of illustration in nts test

Categories of orthographic projection, Categories of Orthographic Projectio...

Categories of Orthographic Projection Orthographic projection is additionally divided into Multi-view projection and axonometric projection, depending upon where the direction

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