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

Combined consequence of ambient and diffused reflection, Combined consequen...

Combined consequence of ambient and diffused reflection At this time the resulting intensity I will be the total sum of the intensities in case 8.3.2 and 8.3.3 we find that:

PHONG INTERPOLATION, DESCRIBE PHONG INTERPOLATION SHADING METHOD

DESCRIBE PHONG INTERPOLATION SHADING METHOD

Design a game using graphical user interface, BlackJack is a popular card g...

BlackJack is a popular card game played in many casinos. The player plays against the dealer aiming to reach 21 points, or a score higher than the dealer without exceeding 21. The

Structural links, Structural Links: The information contained inside the h...

Structural Links: The information contained inside the hypermedia application is classically organized in several suitable fashions. This organization is represented by using stru

Compare bresenham line generation algorithm with dda, 1. Compare Bresenham...

1. Compare Bresenham line generation with Digital Differential Analyzer line generation. Ans.   Bresenham line generation algorithm is better than Digital Differential Analyze

Transformation regarding to the mirror reflection to line, The transformati...

The transformation regarding to the mirror reflection to this line L comprises the subsequent basic transformations: 1) Translate the intersection point A(0,c) to the origin, it

Write a note on mpeg-2, Question 1 Write a note on digitizers Quest...

Question 1 Write a note on digitizers Question 2 Discuss on line drawing algorithm Question 3 Explain 3D viewing Question 4 Explain different types of cohe

Animator studio and elastic reality - computer animation, Animator Studio a...

Animator Studio and Elastic Reality - Computer Animation Animator Studio It is a cell animation program from AutoDesk. Its predecessor was Animator Pro for PC DOS. Anima

Area subdivision method-obscures the continuing two surface, Assume here ar...

Assume here are three polygon surfaces P,Q, R along with vertices specified by as: P: P1(1,1,1), P2(4,5,2), P3(5,2,5) And as Q: Q1(2,2,0.5), Q2(3,3,1.75), Q3(6,1,0.5) R: R1(0.5,

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