It is more efficient than cohen and sutherland line algorithm liang barsky.
liang barsky has developed the algorithm using the parametric equation are:
x= x1+TX
y= y1+TY
...
Search
Popular Posts
-
Normalize transformation we have to define the picture co-ordinate in some units other than pixles and use the interprator to convert t...
-
It is more efficient than cohen and sutherland line algorithm liang barsky. liang barsky has developed the algorithm using the param...
-
Clipping The pro cess of selecting and viewing the pic t ure wi th different views is called windowing , and a process which divides e...
-
TYPE OF TEXT CLIPPING 1.Stroke 2.stardust 3.bitmap STROKE : This method uses small line segments to generate a character we can built ...
-
DDA (digital deferential analyzer) Read the line points (x1,y1 , x2,y2) such that they are not equal (if they are equal then plot that ...
-
Sutherland and cohen subdivision line clipping algorithm this is one of the most oldest and popular method for line clipping algorithm de...
-
WINDOW TO VIEW POINT TRANSFORMATION some important terms: Window-to-View port mapping is the process of mapping or transforming a t...
-
A transformation that slants the shape of an object is called sheared transformation. Two common shearing are: X-shear Y – she...
-
The change in the size n position of the image that's define in the geometrical transformation. There are three ways of geometr...
-
1. In this a beam is moved all over the screen one scan at a time from top to bottom and then back to top. 2. In this the refresh proc...
LIANG BARSKY ALGORITHM