2009•Computer Technology and DevelopmentRequires access

An Algorithm for Circle Clipping Against Polygon Window

Sun Li-ping

Open publisher page 1 citations

Abstract

Circle clipping is applied widely computer graphics,such as two dimension computer animation and robot kinematics etc.Discusses a circle clipping algorithm against the polygon window in detail.The intersection points of the circle and each side of the clipping window are calculated and sorted correctly.Regarding two neighbor intersection points in sequence,the middle point detecting method is used to judge the position relations of circular arc and the clipping window.Finally,the whole clipping algorithm is gained.The result expresses that the algorithm is stable and efficient.

About this research paper

What this paper is about

Circle clipping is applied widely computer graphics,such as two dimension computer animation and robot kinematics etc.Discusses a circle clipping algorithm against the polygon window in detail.The intersection points of the circle and each side of the clipping window are calculated and sorted correctly.Regarding two neighbor intersection points in sequence,the middle point detecting method is used to judge the position relations of circular arc and the clipping window.Finally,the whole clipping algorithm is gained.The result expresses that the algorithm is stable and efficient.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Circle clipping is applied widely computer graphics,such as two dimension computer animation and robot kinematics etc.Discusses a circle clipping algorithm against the polygon window in detail.The intersection points of the circle and each side of the clipping window are calculated and sorted correctly.Regarding two neighbor intersection points in sequence,the middle point detecting method is used to judge the position relations of circular arc and the clipping window.Finally,the whole clipping algorithm is gained.The result expresses that the algorithm is stable and efficient.

Key concepts: Clipping (morphology), Computer science, Window (computing), Algorithm, Polygon (computer graphics), Point (geometry), Sequence (biology), Intersection (aeronautics)

Related papers

Back to paper searchBrowse research topicsOriginal source
An Algorithm for Circle Clipping Against Polygon Window — Research Paper | ScholarLens