DocumentCode :
3593605
Title :
A polygon clipping algorithm based on series coding technique
Author :
Feng, Shuangheng ; Du, Xuedong
Author_Institution :
Coll. of Inf. Sci. & Eng., Shandong Univ. of Sci. & Technol., Qingdao, China
Volume :
1
fYear :
2010
Abstract :
This paper proposes a method that applies series coding technique to polygon clipping algorithm against rectangular window, which can abandon most polygon edges outside the window, keep those inside the window easily and quickly, and avoid many unnecessary computing the point of intersection. Besides, this clipping algorithm adopts the single circular linked list to represent the polygon and intersection points, which reduces the complexity of the data structure. The experimental analysis shows that the algorithm in this paper can observably improve the clipping efficiency under the circumstance of only a few intersection points.
Keywords :
computer graphics; encoding; data structure complexity; intersection points; polygon clipping algorithm; polygon edges; rectangular window; series coding technique; single circular linked list; Acceleration; Algorithm design and analysis; Computer graphics; Data structures; Educational institutions; Encoding; Information science; Paper technology; Tree data structures; polygon clipping; series coding;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Future Computer and Communication (ICFCC), 2010 2nd International Conference on
Print_ISBN :
978-1-4244-5821-9
Type :
conf
DOI :
10.1109/ICFCC.2010.5497767
Filename :
5497767
Link To Document :
بازگشت