A simple algorithm to clip the lines with respect to circular clip window in 2 dimensional space E^2

  • Sushil Chandra Dimri Graphic Era deemed to be University Dehradun, Uttarakhand, India.
  • Bhawnesh Kumar Graphic Era deemed to be University Dehradun, Uttarakhand, India
  • Harendra Singh Negi
  • Mangey Ram Graphic Era deemed to be University Dehradun, Uttarakhand, India.; Institute of Advanced Manufacturing Technologies, Peter the Great St. Petersburg Polytechnic University, 195251 Saint Petersburg, Russia.

Abstract

Clipping has great importance in computer graphics, the clip window is generally of rectangular shape but it may be in any shape, for rectangular clip window we have many popular algorithms like Cohan-Sutherland algorithm, Cyrus Beck algorithm, Liang Barsky algorithms, but it is not necessary that clip window will be always in shape of rectangle it may be of any type of convex region. One of the most common geometrical entities is circle if clip window is in circular shape, then how clipping can be done? How we can identify the position of line segment with respect to circular clip window? This paper presents a simple algorithm using parametric equation of the line to determine the position of the line with respect to the circular clip window and discuss the method to clip the clipping candidate line. The proposed algorithm is very simple and less computationally expensive.

Published
2022-11-25