An algorithm of polygon clipping against a circular window
Zhengrong Zou
Abstract
Zhengrong Zou
Abstract
An algorithm of polygon clipping against a circular window was given based on the correlative literatures.The basic principle is that single linked lists are used to store points of polygon and intersection of polygon and circular window.An algorithm of avoiding quadratic equation solution was used to calculating intersection.Comparing with the existing algorithm,the presented algorithm used less memory space and had higher speed.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
An algorithm of polygon clipping against a circular window was given based on the correlative literatures.The basic principle is that single linked lists are used to store points of polygon and intersection of polygon and circular window.An algorithm of avoiding quadratic equation solution was used to calculating intersection.Comparing with the existing algorithm,the presented algorithm used less memory space and had higher speed.
Key concepts: Polygon (computer graphics), Polygon covering, Window (computing), Star-shaped polygon, Intersection (aeronautics), Clipping (morphology), Algorithm, Visibility polygon