2D line and polygon clipping based on space subdivision

This paper introduces a new approach to 2D line and polygon clipping against a rectangular clipping region, using space subdivision into cells, with the clipping region as the central cell. The line segment path is traced through the cells, and entries into and out of the cell corresponding to the clipping region enable computation of the intersection of the line segment with crossed cell edges. Tracing the line segment path is computationally very simple, leading to an algorithm that only computes intersections that the are part of the clipped line segment. The new algorithm is compared to other standard line clipping algorithms with simulations and operation counts.

[1]  Jack Bresenham,et al.  Algorithm for computer control of a digital plotter , 1965, IBM Syst. J..

[2]  Kevin Weiler.  Polygon comparison using a graph representation , 1980, SIGGRAPH '80.

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

[4]  Ari Rappoport,et al.  An efficient algorithm for line and polygon clipping , 1991, The Visual Computer.

[5]  Steven K. Feiner,et al.  Computer graphics: principles and practice (2nd ed.) , 1990 .

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

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

[8]  Robert F. Sproull,et al.  Principles of interactive computer graphics (2nd ed.) , 1979 .

[9]  Geoff Wyvill,et al.  Analysis of an algorithm for fast ray tracing using uniform space subdivision , 1988, The Visual Computer.

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

[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]  Mel Slater,et al.  Some Improvements to a Parametric Line Clipping Algorithm , 1992 .

[13]  Andrew S. Glassner,et al.  Space subdivision for fast ray tracing , 1984, IEEE Computer Graphics and Applications.

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

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

[16]  Takayuki Tanaka,et al.  ARTS: Accelerated Ray-Tracing System , 1986, IEEE Computer Graphics and Applications.

[17]  大野 義夫,et al.  Computer Graphics : Principles and Practice, 2nd edition, J.D. Foley, A.van Dam, S.K. Feiner, J.F. Hughes, Addison-Wesley, 1990 , 1991 .

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

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

[20]  Robin A. Nicholl,et al.  Performing geometric transformations by program transformation , 1990, TOGS.

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

[22]  Michael Karl Ullner.  Parallel machines for computer graphics , 1983 .

[23]  Mark A. Z. Dippé,et al.  An adaptive subdivision algorithm and parallel architecture for realistic image synthesis , 1984, SIGGRAPH.

[24]  Michael R. Kaplan,et al.  The Use of Spatial Coherence in Ray Tracing , 1987 .

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

[26]  Peter R. Atherton,et al.  Hidden surface removal using polygon area sorting , 1977, SIGGRAPH.

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

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

[29]  Brian Wyvill,et al.  Multiprocessor Ray Tracing , 1986, Comput. Graph. Forum.

[30]  Vaclav Skala,et al.  Algorithms for 2D Line Clipping , 1989, Eurographics.

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

[32]  Robert F. Sproull,et al.  Principles in interactive computer graphics , 1973 .

[33]  Mel Slater.  Tracing a ray through uniformly subdividedn-dimensional space , 2005, The Visual Computer.

[34]  Tilove.  Line/Polygon Classification: A Study of the Complexity of Geometric Computation , 1981, IEEE Computer Graphics and Applications.