AN EFFICIENT LINE CLIPPING ALGORITHM FOR CIRCULAR WINDOWS USING VECTOR CALCULUS AND PARALLELIZATION
AN EFFICIENT LINE CLIPPING ALGORITHM FOR CIRCULAR WINDOWS USING VECTOR CALCULUS AND PARALLELIZATION
Prastut Kumar1 , Fenil Patel1 and Rajesh Kanna2
1&2 Department of Computing Science & Engineering, Vellore Institute of TSZechnology, Chennai Campus
ABSTRACT
With the advent of digitization and growing abundance of graphic and image processing tools, use cases for clipping using circular windows have grown considerably. This paper presents an efficient clipping algorithm for line segments using geometrical features of circle and vector calculus. Building upon the research with rectangular windows, this method is proposed with the belief that computations are more expensive (heavy) than other computations. Execution time can be drastically improved if we replace expensive computations with cheaper computations. The cheaper computations can be computed even more efficiently using parallelization thus improving time complexity.
KEYWORDS
Line clipping, Circle boundary, vector calculus, parallelization
Full Article: https://aircconline.com/ijcga/V8N2/8218ijcga01.pdf
Volume URL:https://airccse.org/journal/ijcga/vol8.html
https://airccse.org/journal/ijcga/index.html
Comments
Post a Comment