Skip to main content

An Improved Polygon Clipping Algorithm Based on Affine Transformation

  • Conference paper
  • First Online:
Proceedings of the Second International Conference on Computer and Communication Technologies

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


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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others


  1. Sutherland, E., Hodgman, G.W.: Reentrant polygon clipping. Commun. ACM 17(1), 32–42 (1974)

    Google Scholar 

  2. Liang, Y.-D., Barsky, B.A.: An analysis and algorithm for polygon clipping. Commun. ACM 26(11), 868–877 (1983)

    Google Scholar 

  3. Maillot, P.G., New, A.: Fast method for 2D polygon clipping: analysis and software implementation. ACM Trans. Graphics 11(3), 276–290 (1992)

    Article  MATH  Google Scholar 

  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 1977

    Google Scholar 

  5. Vatti, B.R.: A generic solution to polygon clipping. Commun. ACM 35(7), 56–63 (1992)

    Google Scholar 

  6. Greiner, G., Hormann, K.: Efficient clipping of arbitrary polygons. ACM Trans. Graph. 17, 71–83 (1998)

    Article  Google Scholar 

  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)

    Article  Google Scholar 

  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. Foster, E.L., Overfelt, J.R.: Clipping of arbitrary polygons with degeneracies. ACM Trans. Graphics 1–5 (2014)

    Google Scholar 

  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 2014

    Google Scholar 

Download references

Author information

Authors and Affiliations


Corresponding author

Correspondence to Mugdha Sharma .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer India

About this paper

Cite this paper

Sharma, M., Kaur, J. (2016). An Improved Polygon Clipping Algorithm Based on Affine Transformation. In: Satapathy, S., Raju, K., Mandal, J., Bhateja, V. (eds) Proceedings of the Second International Conference on Computer and Communication Technologies. Advances in Intelligent Systems and Computing, vol 379. Springer, New Delhi.

Download citation

  • DOI:

  • Published:

  • Publisher Name: Springer, New Delhi

  • Print ISBN: 978-81-322-2516-4

  • Online ISBN: 978-81-322-2517-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics