Homogenous Coordinates in Computer Graphics

Homogenous Coordinates in Computer Graphics

The orbit of a point, a line graph or the whole picture on the computer, a point besides the origin, is accomplished by first shifting the picture till the origin, is occupied by the point of the rotational axis, then rotating the picture and then beginning to move the picture to its initial position.

A translation is termed as moving a picture from one position to another in a horizontal path. A translation can be performed by adding or subtracting the portion by which the image needs to be moved to each point.

With the help of a precise matrix program, the translation of point through coordinate shift cannot be integrated with other transformations. Such integration is necessary if we want to rotate a picture by translating about a point apart from the origin, rotation again translation.

Homogeneous coordinates help you to integrate all three transformations into a common transformation. 2D coordinate positions (x, y) are determined by three-way coordinates in a homogeneous coordinate system.

In design and development implementations, homogeneous coordinates are commonly used. We conduct translation, scaling and rotation to align the image into the correct position.

Instances of expressing coordinates in a homogeneous coordinate system

We can select homogeneous parameters h for every non-negative value for 2D geometric transformation. Consider it like one for our comfort. With homogeneous coordinates (x, y, 1), each 2D location is represented.

Here, we have the following matrix for 2D transformation in homogenous coordinate system.

  • Matrix for Translation

1    0    0                 1    0    tx

0    1    0       or      0    1    ty 

tx     tx     1                 0     0     1 

  • Matrix for Scaling

                     Sx    0    0

          0   Sy    0

                     0   0     1

  • Matrix for Reflection(x-axis)

              1    0    0

              0   -1    0

              0    0    1

  • Matrix for Reflection(y-axis)

             -1    0    0

                          0    1   0

                          0    0   1

  • Matrix for Reflection(Origin)

             -1    0    0

                         0   -1    0

                         0    0    1 

  • Matrix for Reflection(when line Y = -X)

             0    -1    0

                       -1     0    0

                        0     0    1

  • Matrix for Reflection(when line Y=X)

             0    1    0

                        1    0    0

                        0    0    1

  • Matrix for Rotation(when clockwise)

             cos        -sin         0                

                           sin        cos      0     

                           0              0            1

  • Matrix for Rotation(when anti-clockwise)

             cos         sin         0                

                        -sin        cos      0     

                           0              0            1

  • Matrix for Shearing (X direction)

                      1        0        0

                           Shx       1        0

                            0        0        1                 

  • Matrix for Shearing (Y direction)

                      1       Shy      0

                           0            1         0

                           0       0          1                 

  • Matrix for Shearing (X and Y direction)

                      1        Shy      0  

                          Shx        1          0

                           0        0          1                 


Related Topics

Midpoint Circle Drawing Algorithm in Computer Graphics

The midpoint circle drawing algorithm helps us to calculate the complete perimeter points of a circle for the first octant. We can quickly find and calculate the points of other...

12 minutes read.

Scan Conversion in Computer Graphics

“When we represent regular objects in the form of discrete pixels, it is called Scan Conversion.” Every graphics system must transform the primitives into a collection of pixels. The scan conversion is also...

2 minutes read.

Scan Conversion of an Ellipse Computer Graphics

Scan Conversion of an Ellipse: An ellipse can be defined as a closed plane curve, which is a collection of points. It is the cause of the intersection of a...

8 minutes read.

Color Models in Computer Graphics

"Color model is a 3D color coordinate system to produce all range of color through the primary color set." There are millions of colors used in computer graphics. The light...

3 minutes read.

Transformation

Introduction The term Transformation is generally referred to as converting a graphic into another graphic by applying some rules or algorithms. Sometimes an image or picture can be a combination of lines, rectangle,...

2 minutes read.

Line Drawing Algorithm in Computer Graphics

“The Line drawing algorithm is a graphical algorithm which is used to represent the line segment on discrete graphical media, i.e., printer and pixel-based media.” A line contains two points....

3 minutes read.

Clipping in Computer Graphics

“The Clipping is a type of transformation used in computer graphics to remove lines, objects, and segments of lines that are outside the computer screen or viewing pane.” The clipping is a...

2 minutes read.

Computer Graphics Window

“The process of selecting and viewing an image with different views, called windowing.” All the objects in the real world have a size. We can measure the size and location of...

4 minutes read.

Aspect Ratio in Computer Graphics

Aspect Ratio in Computer Graphics You might well understand the concept of Aspect ratio as of now if you know regarding aerial photography or see the configuration portion of any computer...

5 minutes read.

3D Reflection

The Reflection is a mirror image of the original object. We can differentiate 2D and 3D reflection by adding Z-axis. The Z-axis shows the depth of the surface. In the...

1 minute read.

History of Computer Graphics

History of Computer Graphics Computer Graphics (CG) was first developed as a visualization tool. Computer graphics were basically introduced for scientists and engineers in government and corporate research centers, i.e., Bell Labs and Boeing...

4 minutes read.

Applications of Computer Graphics

Applications of Computer Graphics Some applications of computer graphics are mentioned below- Graphical User Interface (GUI): It is a way of interacting with a computer using the icon, ...

2 minutes read.

Illumination Model in Computer Graphics

Illumination Model in Computer Graphics The series of methods used to depict light in computer graphics scenarios is computer graphics illumination. Although lighting strategies provide versatility in the degree of detail...

8 minutes read.

Panning

“Panning is a process or photographic technique that is used to combine slow shutter speed with camera movement to make a speed sense around the moving object.” We can define panning as...

2 minutes read.

3D Rotation

The 3D rotation is different from 2D rotation. In 3D Rotation we also have to define the angle of Rotation with the axis of Rotation. For Example- Let us assume, The initial...

2 minutes read.

Bresenham’s Line Drawing Algorithm in Computer Graphics

This algorithm was introduced by “Jack Elton Bresenham” in 1962. This algorithm helps us to perform scan conversion of a line. It is a powerful, useful, and accurate method. We...

8 minutes read.

Projection in Computer Graphics

Projection Introduction: The technique projection was invented by the Swiss mathematician, engineer, and astronomer "Leonhard Euler Around" in 1756. The "Episcope" was the first projection system. “Projection is a technique or process which...

4 minutes read.

2D Rotation

The Rotation of any object depends upon the two points. Rotation Point: It is also called the Pivot point. Rotation Angle: It is denoted by Theta (). We can rotate an object in...

1 minute read.

2D Shearing

We can denote shearing with ‘SHx’ and ‘SHy.’ These ‘SHx’ and ‘SHy’ are called “Shearing factor.” We can perform shearing on the object in two ways- Shearing along x-axis: In this, we...

2 minutes read.

Anti-aliasing in Computer Graphics

Anti-aliasing in Computer Graphics “Anti-aliasing is a method for eliminating the aliasing effect used in computer graphics. In a 2-dimensional object, the ambient occlusion impact is the existence of sharp edges...

7 minutes read.