An algorithm for polygon clipping, and for determining polygon intersections and unions
暂无分享,去创建一个
[1] Jay Beck,et al. Generalized two- and three-dimensional clipping , 1978, Comput. Graph..
[2] Patrick-Gilles Maillot,et al. A new, fast method for 2D polygon clipping: analysis and software implementation , 1992, TOGS.
[3] R. D. Andreev. Algorithm for Clpping Arbitrary Polygons , 1989, Comput. Graph. Forum.
[4] Bala R. Vatti. A generic solution to polygon clipping , 1992, CACM.
[5] Joseph O'Rourke,et al. Computational Geometry in C. , 1995 .
[6] Borut Žalik,et al. Two efficient algorithms for determining intersection points between simple polygons , 2000 .
[7] V. Skala,et al. Two New Algorithms for Line Clipping in E 2 and Their Comparison , 2000 .
[8] Harry G. Mairson,et al. Reporting and Counting Intersections Between Two Sets of Line Segments , 1988 .
[9] J. O´Rourke,et al. Computational Geometry in C: Arrangements , 1998 .
[10] Ari Rappoport,et al. An efficient algorithm for line and polygon clipping , 1991, The Visual Computer.
[11] Václav Skala,et al. O(lg N) line clipping algorithm in E2 , 1994, Comput. Graph..
[12] P. Burrough,et al. Principles of geographical information systems , 1998 .
[13] Günther Greiner,et al. Efficient clipping of arbitrary polygons , 1998, TOGS.