A New Fast Clipping Algorithm for 2D-Polygon against Rectangular Windows
Abstract
Keywords
Full Text:
PDFReferences
I. E. Sutherland and G. W. Hodgman, „„Reentrant Polygon Clipping,‟‟ CACM, vol. 17, pp. 32- 42, 1974.
S.Harrington, Computer graphics – A programming approach, McGraw Hill Book Company, 2nd edition, 1987
K. Weiler and P. Atherton, „„Hidden Surface Removal Using Polygon Area Sorting,‟‟ Computer Graphics, vol. 11, pp. 214-222, 1977.
Y. Liang and B. Barsky, „„An Analysis and Algorithm for Polygon Clipping,‟‟ CACM, vol. 26, pp. 868-877, 1983
A New, Fast Method For 2D Polygon Clipping: Analysis and Software Implementation- Patent-by Patrick-Gilles Maillot, Sun Microsystems, inc.., Mountain View, CA 94043
Sproull RF, Sutherland IE. A clipping divider. In: Proceedings of Fall Joint Computer Conference. Washington: Thompson Books; 1968. p. 765–75.
A. Kilgour, “Unifying Vector and Polygon Algorithms for Scan Conversion and Clipping,” Eurographics‟87 proceedings, pp. 363-375, August 1987.
Liang YD, Barsky BA. A new concept and method for line clipping. ACM Transactions on Graphics 1984;3(1):1–22.
J Nicholl TM, Lee DT, Nicholl RA. An efficient new algorithm for 2-D line clipping: Its development and analysis. Computer Graphics 1987; 21(4):253–92.
Wang H, Wu R, Cai S. A new efficient line clipping algorithm based on geometric transformation. Journal of Software 1998; 9(10): 728–33 (in Chinese).
Wang J, Liang Y, Peng Q. A 2-D line clipping algorithm with the least arithmetic operations. Chinese Journal of Computers 1991; 14(7):495–504 (in Chinese).
K.Natarajan, Dr.K.Kuppusamy, “An enhanced method for filling a 2D-Polygon”, CiiT, Vol 2, No 11, pp 487-490, November 2010
K.Natarajan, Dr.K.Kuppusamy, “A new method for a filling a 2D-Polygon”, CiiT, Vol 2, No 11, pp 491- 496, November 2010
Refbacks
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution 3.0 License.