A new, fast method for 2D polygon clipping
作者： Patrick-Gilles Maillot
关键词:
摘要: This paper presents a new 2D polygon clipping method, based on an extension to the Sutherland-Cohen line method. After discussing three basic algorithms, different approach is proposed, explaining principles of algorithm and presenting it step by step.An example implementation given along with some results. A comparison between proposed Liang Barsky algorithm, Sutherland-Hodgman also given, showing performances up eight times speed algorithm. The here can use floating point or integer operations; this be useful for fast simple implementations.
acm.org
sci-hub.se 参考文章(8)
Patrick Maillot, Contribution à l'étude des systèmes graphiques : architectures logicielle et matérielle Lyon 1. ,(1986)
Kevin Weiler, Peter Atherton, Hidden surface removal using polygon area sorting Proceedings of the 4th annual conference on Computer graphics and interactive techniques - SIGGRAPH '77. ,vol. 11, pp. 214- 222 ,(1977) , 10.1145/563858.563896
Robert F. Sproull, William M. Newman, Principles of Interactive Computer Graphics ,(1973)
You-Dong Liang, Brian A. Barsky, An analysis and algorithm for polygon clipping Communications of the ACM. ,vol. 26, pp. 868- 877 ,(1983) , 10.1145/182.358439
Tina M. Nicholl, D. T. Lee, Robin A. Nicholl, An efficient new algorithm for 2-D line clipping: Its development and analysis Proceedings of the 14th annual conference on Computer graphics and interactive techniques - SIGGRAPH '87. ,vol. 21, pp. 253- 262 ,(1987) , 10.1145/37401.37432
Ivan E. Sutherland, Gary W. Hodgman, Reentrant polygon clipping Communications of The ACM. ,vol. 17, pp. 32- 42 ,(1974) , 10.1145/360767.360802
A. C. Kilgour, Unifying Vector and Polygon Algorithms for Scan Conversion and Clipping eurographics. ,(1987) , 10.2312/EGTP.19871028
Kevin Weiler, Peter Atherton, Hidden surface removal using polygon area sorting Computer Graphics. ,(1977) , 10.1145/965141.563896