An improved polygon clipping algorithm based on affine transformation

2Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Sharma, M., & Kaur, J. (2016). An improved polygon clipping algorithm based on affine transformation. In Advances in Intelligent Systems and Computing (Vol. 379, pp. 783–792). Springer Verlag. https://doi.org/10.1007/978-81-322-2517-1_75

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free