Abstract Clipping problem seems to be pretty simple from human perspective point of view since with visualization a line can easily be traced whether it is completely inside and if not what portion of the line lies outside the window. However, from system point of view, the number of computations and comparisons for lines with floating point calculations are extremely large which in turn adds to inherent complexity. It needs to minimize the number of computations thereby achieving a significant increase in terms of efficiency. In this work, a mathematical model has been proposed for evaluating intersection points thereby clipping lines which decently rely on integral calculations. Besides, no further computations are found to be necessary for evaluating intersection points. The performance of the algorithm seems to be consistently good in terms of speed for all sizes of clipping windows.

References

[1] Abdullah M., Pathan A., and Al Shaikhli I., “A Web and Software-Based Approach Blending Social Networks for Online Qur'anic Arabic Learning,” The International Arab Journal of Information Technology, vol. 14, no. 1, pp. 80- 90, 2017.

[2] Andreev R. and Sofianska E., “New Algorithm for Two-Dimensional Line Clipping,” Computers and Graphics, vol. 15, no. 4, pp. 519-526, 1991.

[3] Bui D. and Skala V., “Fast Algorithms for Clipping Lines and Line Segments in E2,” The Visual Computer, vol. 14, no. 1, pp. 31-38, 1998.

[4] Chen X., Yong J., Wang G., Paul J., and Xu G., “Computing the Minimum Distance between a Point and a NURBS Curve,” Computer-Aided Design, vol. 40, no. 10, pp. 1051-1054, 2008.

[5] Cyrus M. and Beck J., “Generalized Two-and Three-Dimensional Clipping,” Computers and Graphics, vol. 3, no. 1, pp. 23-28, 1978.

[6] Day J., “A New Two Dimensional Line Clipping Algorithm for Small Windows,” Computer Graphics Forum, vol. 11, no. 4, pp. 241-245, 1992.

[7] Day J., “An Algorithm for Clipping Lines in Object and Image Space,” Computers and Graphics, vol. 16, no. 4, pp. 421-426, 1993.

[8] Dévai F., “Analysis of the Nicholl-Lee-Nicholl Algorithm,” in Proceedings of International Conference on Computational Science and its Applications, Singapor, pp. 726-736, 2005.

[9] Foley J. and Van Dam A., Fundamentals of Interactive Computer Graphics, MA: Addison- Wesley, 1982.

[10] Gross M. and Pfister H., Point-Based Graphics, Morgan Kaufmann, 2011.

[11] Hearn D. and Baker P., Computer Graphics, Prentice Hall, 1997.

[12] Huang W., “Line Clipping Algorithm of Affine Transformation for Polygon,” in Proceedings of International Conference on Intelligent Computing, Nanning, pp. 55-60, 2013.

[13] Hughes J. and Foley J., Computer Graphics: Principles and Practice, Pearson Education, 2013.

[14] Klette R. and Rosenfeld A., Digital Geometry: Geometric Methods for Digital Picture Analysis, Morgan Kaufmann, 2004.

[15] Liang Y. and Barsky B., “A new Concept and Method for Line Clipping,” ACM Transactions on Graphics, vol. 3, no. 1, pp. 1-22, 1984.

[16] Liu Y., Wang X., Bao S., Gomboši M., and Žalik B., “An Algorithm for Polygon Clipping, and for Determining Polygon Intersections and Unions,” Computers and Geosciences, vol. 33, no. 5, pp. 589-598, 2007.

[17] Lu G., Wu X., and Peng Q., “An Efficient Line Clipping Algorithm Based on Adaptive Line Rejection,” Computers and Graphics, vol. 26, no. 3, pp. 409-415, 2002.

[18] Mamatha E., Reddy C., and Anand S., “Focal Point Computation and Homogeneous Geometrical Transformation for Linear Curves,” Perspectives in Science, vol. 8, pp. 19-21, 2016.

[19] Mamatha E., Reddy C., and Prasad K., “Anti Aliased Digital Pixel Plotting for Raster Scan Lines Using Area Evaluation,” in Proceedings of Emerging Research in Computing, Information, Communication and Applications, Singapore, pp. 461-468, 2016.

[20] Kumar M., Mamatha V., Reddy C., Mukesh V., and Reddy R., “Data hiding with Dual Based Reversible Image Using Sudoku Technique,” in Proceedings of International Conference on Advances in Computing, Communications and Informatics, Udupi, pp. 2166-2172, 2017.

[21] Nicholl T., Lee D., and Nicholl R., “An Efficient New Algorithm for 2-D Line Clipping: its Development and Analysis,” ACM SIGGRAPH Computer Graphics, vol. 21, no. 4, pp. 253-262, 1987.

[22] Reddy C., Janani1 B., Narayanan S., and Mamatha E., “Obtaining Description for Simple Images using Surface Realization Techniques and Natural Language Processing,” Indian Journal of Science and Technology, vol. 9, no. 22, pp. 1-7, 2016.

[23] Rogers D. and Rybak L., “On an Efficient General Line-Clipping Algorithm,” Computer Graphics and Applications, vol. 5, no. 1, pp. 82- 86, 1985.

[24] Schneider P. and Eberly D., Geometric Tools for Computer Graphics, Morgan Kaufmann, 2002.

[25] Skala V., “A New Approach to Line and Line Segment Clipping in Homogeneous An Efficient Line Clipping Algorithm in 2D Space 807 Coordinates,” The Visual Computer, vol. 21, no. 11, pp. 905-914, 2005.

[26] Slater M. and Barsky B., “2D line and Polygon Clipping Based on Space Subdivision,” The Visual Computer, vol. 10, no. 7, pp. 407-422, 1994.

[27] Wang J., Cui C., and Gao j., “An Efficient Algorithm for Clipping Operation Based on Trapezoidal Meshes and Sweep-Line Technique,” Advances in Engineering Software, vol. 47, no. 1, pp. 72-79, 2012.

[28] Weng L., Daman D., and Rahim M., “Shadow Casting with Stencil Buffer for Real-Time Rendering,” The International Arab Journal of Information Technology, vol. 5, no. 4, pp. 102- 110, 2008.

[29] Wu Q., Huang X., and Han Y., “A clipping Algorithm for Parabola Segments against Circular Windows,” Computers and Graphics, vol. 30, no. 4, pp. 540-560, 2006.

[30] Zhang M. and Sabharwal C., “An Efficient Implementation of Parametric Line and Polygon Clipping Algorithm,” in Proceedings of the ACM Symposium on Applied Computing, Madrid, pp. 796-800, 2002. Mamatha Elliriki is working at GITAM University, Bangalore Campus. She is presently working on graphical models, digital geometry, performance of various processing systems. She is published good number of research articles in peer reviewed and indexed journals and international conferences. Chandrasekhara Reddy has published several scientific papers in reputed journals and conferences. He is working as professor in Cambridge Institute of Technology– North Campus, Bangalore. His current areas of research include performance analysis of Markov models. Krishna Anand is currently working as professor in the Department of Computer Science in Sreenidhi Institute of Science and Technology, Hyderabad. He has rich teaching experience in different universities apart from the industrial experience. His areas of interest include Simulation, Soft Computing, Graphics and Expert Systems.