O(lg N) line clipping algorithm in E2

A new O(lg N) line clipping algorithm in E2 against a convex window is presented. The main advantage of the presented algorithm is the principal acceleration of the line clipping problem solution. A comparison of the proposed algorithm with others shows a significant improvement in run-time. Experimental results for selected known algorithms are also shown.

[1]  Herbert Edelsbrunner,et al.  Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms , 1988, SCG '88.

[2]  Robert E. Tarjan,et al.  Simplified Linear-Time Jordan Sorting and Polygon Clipping , 1990, Inf. Process. Lett..

[3]  Andreas Burkert,et al.  Fast Algorithm for Polygon Clipping with 3D Windows , 1988, Eurographics.

[4]  AIistair Kilgour,et al.  Unifying Vector and Polygon Algorithms for Scan Conversion and Clipping , 1987, Eurographics.

[5]  F. Frances Yao,et al.  Computational Geometry , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[6]  Bernard Chazelle,et al.  Intersection of convex objects in two and three dimensions , 1987, JACM.

[7]  Brian A. Barsky,et al.  The Optimal Tree Algorithm for Line Clipping , 1992 .

[8]  Bernard Chazelle,et al.  An optimal algorithm for intersecting three-dimensional convex polyhedra , 1989, 30th Annual Symposium on Foundations of Computer Science.

[9]  R. S. Gyurcsik,et al.  Improving line segment clipping , 1990 .

[10]  Josef Hübl.  A Note on 3D‐Clip Optimisation , 1993, Comput. Graph. Forum.

[11]  James F. Blinn,et al.  Jim Blinn's corner - A trip down the graphics pipeline: line clipping , 1991, IEEE Computer Graphics and Applications.

[12]  Avraham Margalit,et al.  An algorithm for computing the union, intersection or difference of two polygons , 1989, Comput. Graph..

[13]  Patrick-Gilles Maillot,et al.  A new, fast method for 2D polygon clipping: analysis and software implementation , 1992, TOGS.

[14]  Morten Zachrisen.  Yet another Remark on the Modelling Clip Problem , 1989, Comput. Graph. Forum.

[15]  Jwo-Liang Chu,et al.  A string pattern recognition approach to polygon clipping , 1990, Pattern Recognit..

[16]  Jay Beck,et al.  Generalized two- and three-dimensional clipping , 1978, Comput. Graph..

[17]  Ivan Herman,et al.  Modelling Clip: Some More Results , 1990, Comput. Graph. Forum.

[18]  Ivan E. Sutherland,et al.  A clipping divider , 1899, AFIPS '68 (Fall, part I).

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

[20]  A. AROKIASAMY.  Homogeneous coordinates and the principle of duality in two dimensional clipping , 1989, Comput. Graph..

[21]  Michael J. Wozny,et al.  Factoring a Homogeneous Transformation for a more Efficient Graphics Pipeline , 1990, Comput. Graph. Forum.

[22]  Theoharis Theoharis,et al.  Two Parallel Methods for Polygon Clipping , 1989 .

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

[24]  Michael Dörr,et al.  A new approach to parametric line clipping , 1990, Comput. Graph..

[25]  Rumen Andreev,et al.  New algorithm for two-dimensional line clipping , 1991, Comput. Graph..

[26]  Václav Skala,et al.  An efficient algorithm for line clipping by convex polygon , 1993, Comput. Graph..

[27]  Ivan Herman,et al.  Some Remarks on the Modelling Gip Problem , 1988, Comput. Graph. Forum.

[28]  Ivan E. Sutherland,et al.  Reentrant polygon clipping , 1974, Commun. ACM.

[29]  Robert M. O'Bara,et al.  An Analysis of Modeling Clip , 1989, Eurographics.

[30]  Ronald S. Gyurcsik,et al.  Simple and efficient 2D and 3D span clipping algorithms , 1993, Comput. Graph..

[31]  Brian A. Barsky,et al.  An analysis and algorithm for polygon clipping , 1983, CACM.

[32]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

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

[34]  R. D. Andreev.  Algorithm for Clpping Arbitrary Polygons , 1989, Comput. Graph. Forum.

[35]  James F. Blinn,et al.  Clipping using homogeneous coordinates , 1978, SIGGRAPH.

[36]  Swami Manohar,et al.  Line clipping revisited: Two efficient algorithms based on simple geometric observations , 1992, Comput. Graph..

[37]  Gergely Krammer.  Notes on the Mathematics of the PHIGS Viewing Pipeline , 1989, Comput. Graph. Forum.

[38]  David Pinedo.  Window clipping methods in graphics accelerators , 1991, IEEE Computer Graphics and Applications.

[39]  Gergely Krammer.  A line clipping algorithm and its analysis , 1992, Comput. Graph. Forum.

[40]  J. D. Day.  A Comparision of Line Clipping Algorithms , 1991 .

[41]  J. D. Day.  A New Two Dimensional Line Clipping Algorithm for Small Windows , 1992, Comput. Graph. Forum.

[42]  H.-P. Nielsen,et al.  Line Clipping Using Semi‐Homogeneous Coordinates , 1995, Comput. Graph. Forum.

[43]  Shi Kaijian,et al.  An efficient line clipping algorithm , 1990, Comput. Graph..