Designing a Line-clipping Algorithm by Categorizing Line Dynamically and Using Intersection Point Method

This algorithm supports line clipping against a rectangular window with edges parallel to the screen. The algorithm combines different categories of lines for solutions. Each category of line is solved with the best way it has. Here intersection point method is used to get the solution of some categories of lines. This algorithm reduces implicit area codes, line ends comparison, redundant calculations, explicit calculation reusing. Here, the region of line in a rectangle window is not considered for the selection of category rather the characteristics of lines according to their slope and relationship between the line and boundary region of the window is considered for selecting categories. It is faster than existing algorithms such as Cohen-Sutherland, Liang-Barsky & Cyrus-Beck.