An Improved Polygon Clipping Algorithm Based on Affine Transformation

Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 379)

Abstract

Today, Computer Graphics is used almost in all the domains including gaming, entertainment, education, CAD/CAM, etc. One of the most important operations in computer graphics is clipping, such as line clipping and polygon clipping. Its importance emerges from the fact that polygon clipping can be applied in VLSI CAD, GIS, garment industry, etc. Many algorithms exist at the present moment but the intersection calculations incur huge costs. Our paper proposes an algorithm based on affine transformation which eliminates degeneracies while clipping self-intersecting and multi-polygons. Experimental results show that the new algorithm outperforms Greiner-Hormann and Vatti Algorithms for real-time datasets which are used in the packing industry.

Keywords

Computer graphics Polygon clipping Affine transformation Degeneracy 

References

  1. 1.
    Sutherland, E., Hodgman, G.W.: Reentrant polygon clipping. Commun. ACM 17(1), 32–42 (1974)Google Scholar
  2. 2.
    Liang, Y.-D., Barsky, B.A.: An analysis and algorithm for polygon clipping. Commun. ACM 26(11), 868–877 (1983)Google Scholar
  3. 3.
    Maillot, P.G., New, A.: Fast method for 2D polygon clipping: analysis and software implementation. ACM Trans. Graphics 11(3), 276–290 (1992)MATHCrossRefGoogle Scholar
  4. 4.
    Weiler, K., Atherton, P.: Hidden surface removal using polygon area sorting, computer graphics. In: Proceedings of SIGGRAPH, vol. 11(2), pp. 214–222, July 1977Google Scholar
  5. 5.
    Vatti, B.R.: A generic solution to polygon clipping. Commun. ACM 35(7), 56–63 (1992)Google Scholar
  6. 6.
    Greiner, G., Hormann, K.: Efficient clipping of arbitrary polygons. ACM Trans. Graph. 17, 71–83 (1998)CrossRefGoogle Scholar
  7. 7.
    Liu, Y.K., Wang, X.Q., Bao, S.Z., Gombosi, M., Zalik, B.: An algorithm for polygon clipping, and for determining polygon intersections and unions. Comp. & Geosci. 33, 589–598 (2007)CrossRefGoogle Scholar
  8. 8.
    Kim, H., Kim, M.-J.: An extension of polygon clipping to resolve degenerate cases. Comp.-Aided Des. & Appl. 3(1–4), 447–456 (2006)Google Scholar
  9. 9.
    Foster, E.L., Overfelt, J.R.: Clipping of arbitrary polygons with degeneracies. ACM Trans. Graphics 1–5 (2014)Google Scholar
  10. 10.
    Chakraborty, A.: An extension of Weiler-Atherton algorithm to cope with the self-intersecting polygon. Cornell University Library, Computer Graphics. arXiv:1403.0917v1 Submitted on 4 March 2014Google Scholar

Copyright information

© Springer India 2016

Authors and Affiliations

  1. 1.Rukmini Devi Institute of Advanced StudiesDelhiIndia

Personalised recommendations