A new algorithm for computing Boolean operations on polygons
暂无分享,去创建一个
Francisco R. Feito-Higueruela | Antonio J. Rueda Ruiz | Francisco Martínez | Francisco Martínez | F. Feito-Higueruela
[1] Ivan E. Sutherland,et al. Reentrant polygon clipping , 1974, Commun. ACM.
[2] A BarskyBrian,et al. An analysis and algorithm for polygon clipping , 1983 .
[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] Brian A. Barsky,et al. An analysis and algorithm for polygon clipping , 1983, CACM.
[6] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .
[7] Thomas Ertl,et al. Computer Graphics - Principles and Practice, 3rd Edition , 2014 .
[8] M. Carter. Computer graphics: Principles and practice , 1997 .
[9] David H. Eberly,et al. Geometric Tools for Computer Graphics , 2002 .
[10] Borut Zalik,et al. An algorithm for polygon clipping, and for determining polygon intersections and unions , 2007, Comput. Geosci..
[11] Günther Greiner,et al. Efficient clipping of arbitrary polygons , 1998, TOGS.
[12] Kevin Weiler. Polygon comparison using a graph representation , 1980, SIGGRAPH '80.