论文信息 - Two New Algorithms for Line Clipping in E 2 and Their Comparison

Two New Algorithms for Line Clipping in E 2 and Their Comparison

New efficient algorithms for the line clipping by the given rectangle in E 2 are presented. The first algorithm is based on the line direction evaluation, the second one is based on a new coding technique of clipping rectangle’s vertices. It allows solving all cases more effectively. A comparison of the proposed algorithms with the Liang-Barsky algorithm and some experimental results are presented, too.

V. Skala | B. D. Hui

[1] Brian A. Barsky,et al. A New Concept and Method for Line Clipping , 1984, TOGS.

[2] Thomas Ertl,et al. Computer Graphics - Principles and Practice, 3rd Edition , 2014 .

[3] M. Carter. Computer graphics: Principles and practice , 1997 .

[4] Mel Slater,et al. Some Improvements to a Parametric Line Clipping Algorithm , 1992 .

[5] Václav Skala,et al. Fast algorithms for clipping lines and line segments in E2 , 1998, The Visual Computer.

[6] Yee-Hong Yang,et al. A fast two-dimensional line clipping algorithm via line encoding , 1987, Comput. Graph..

[7] Václav Skala. An Efficient Algorithm for Line Clipping by Convex and Non‐convex Polyhedra in E3 , 1996, Comput. Graph. Forum.

[8] Václav Skala,et al. O(lg N) line clipping algorithm in E2 , 1994, Comput. Graph..

[9] D. T. Lee,et al. An efficient new algorithm for 2-D line clipping: Its development and analysis , 1987, SIGGRAPH.

[10] Václav Skala. A fast algorithm for line clipping by convex polyhedron in E3 , 1997, Comput. Graph..