Reflection of 2D Objects in Computer Graphics

Abstract

The Research paper contains a brief introduction about 2D reflection or transformation along with the better or less complex algorithm in Computer Graphics. 2D reflection is used for manipulating, repositioning, changing size, rotating and also to get the mirror image of the real-world object which are stored in the form of images in a computer. Suggesting a less complex algorithm to make it easier to understand or for manipulating images more efficiently according to the user needs.

Introduction

I. INTRODUCTION

Computer Graphics is the art of drawing, graphs, photographs, maps and more on the computer screen with the help of programming. It involves image creation, manipulation to create 2D and 3D images.

Reflection is a process of transforming an object which produces the mirror image. The mirror image can be in any of the axis either x -axis or y- axis. The image can also be rotated by 180°.

A. Types of reflection

1. Reflection about x -axis: In this type, the Y coordinate will remain the same.
2. Reflection about Y-axis: X coordinate will remain the same.
3. Reflection about Axis Perpendicular to the (x, y) Plane and Passing through The Origin: Both X and Y coordinate will remain the same. 

B. Reflection

Reflection is about the transformation that produces the mirror image of the object. The mirror image of the object is produced by rotating the object at 180 degrees with respect to the reflection axis. The reflection axis can be anywhere in the XY plane. [4]

II. ALGORITHM

Proposed algorithm is able to reduce space and time complexity. Algorithm performs reflection on X-axis, Y-axis, and origin as shown in image below. [3]

Conclusion

Here in this paper, we have discussed reflection transformation. Among the various transformation we have discussed reflection. We proposed a new C program for 2d reflection in Computer reflection. It is much easier and less complex than the existing one. Better understanding in academics. More helpful in solving large scale problems.

References

[1] https://www.geeksforgeeks.org/c-program-to-perform-reflection-of-the-given-2d-image-using-computer-graphics/ [2] Etsuji Tomita, Akira Tanaka, Haruhisa Takahashi, The worst-case time complexity for generating all maximal cliques and computational experiments, Theoretical Computer Science, Volume 363, Issue 1, 2006, Pages 28-42, ISSN 0304-3975. [3] Pietro S. Oliveto, Carsten Witt, Improved time complexity analysis of the Simple Genetic Algorithm, Theoretical Computer Science, Volume 605, 2015, Pages 21-41, ISSN 0304-3975 [4] Ching L. Teo, Cornelia Fermuller, Yiannis Aloimonos; Proceedings of the IEEE International Conference on Computer Vision (ICCV), 2015, pp. 1644-1652. [5] Foley, Van Dam, Feiner, Hughes, Computer Graphics Principles & Practice, 2000, Pearson [6] Chennakesava R. Alavla “Computer Graphics”, PHI Learning Pvt. Limited [7] D. Hearn & Baker: Computer Graphics with OpenGL, Pearson Education, Third Edition, 2009. [8] Foley, J.D. & Van Dam, A: Fundamentals of Interactive Computer Graphics. [9] Rogers & Adams, “Mathematical Elements for Computer Graphics”, McGraw Hill, 1989 [10] John F. Hughes, Andries Van Dam, Morgan Mcguire, David F. Sklar James D. Foley, Steven Feiner, Kurt Akeley, “Computer Graphics Principles and Practice Third Edition”.

Copyright

Copyright © 2022 N. Krishna Khanth, Sharad Jain, Kanchana Bora. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.