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

Viewing transformation, Viewing Transformation In previous section, we...

Viewing Transformation In previous section, we have discussed about the geometric transformations as Translation, Shearing, Reflection, Scaling and Rotation. Rotation, Reflect

Passive computer animations - types of computer animation, Passive Computer...

Passive Computer Animations: That has no option for users to utilize computer graphics today is mostly interactive for example: movies. Frame animation is non-interactive anim

Other file formats and bmp-dib-rle file formats, Other File Formats BM...

Other File Formats BMP/DIB/RLE File Formats These are termed as device independent bitmap files. They exist in two various type formats: a) OS2 format and b) Windows

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,

Lossless audio formats, Lossless Audio Formats: Lossless audio formats as ...

Lossless Audio Formats: Lossless audio formats as TTA and FLAC give a compression ratio of around 2:1, sometimes extra. During exchange, for their lower compression ratio, such co

Cases for subdivisions of polygon-visible surface detection, Cases for Subd...

Cases for Subdivisions of Polygon No additional subdivisions of a particular area are desired, if one of the subsequent conditions is true as: Case 1: All the polygons ar

Scan line polygon fill and seed fill or flood fill algorithm, 1.   Distingu...

1.   Distinguish among Scan line polygon fill and Seed fill or Flood fill algorithm? Scan Line Polygon Flood Fill Algorithms ?1. This

B splines, What is uniform rational splines

What is uniform rational splines

Xy-shear about the origin - 2-d and 3-d transformations, xy-Shear about the...

xy-Shear about the Origin - 2-d and 3-d transformations Suppose an object point P(x,y) be moved to P'(x',y') as a outcome of shear transformation in both x- and y-directions a

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