Efficient algorithm for general polygon clipping - Archive ouverte HAL Access content directly
Conference Papers Year : 2005

Efficient algorithm for general polygon clipping

(1) , (2) , (2) , (2)
Yu Peng
  • Function : Author
Junhai Yong
  • Function : Author
Hui Zhang
  • Function : Author
Jiaguang Sun
  • Function : Author


We present an efficient algorithm to determine the intersection of two planar general polygons. A new method based on rotation angle is proposed to obtain the classification of an edge with respect to a polygon. The edge candidates can be determined efficiently by a 1-dimensional range searching approach based on an AVL tree (a balanced binary search tree). The simplicial chain is used to represent the general polygons, and to determine the classification of polygon edges. Examples are given to illustrate the algorithm.
Fichier principal
Vignette du fichier
YuPeng2005b.pdf (244.91 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00517687 , version 1 (15-09-2010)


  • HAL Id : inria-00517687 , version 1
  • PRODINRA : 247305


Yu Peng, Junhai Yong, Hui Zhang, Jiaguang Sun. Efficient algorithm for general polygon clipping. Proceedings of The 6th International Conference on Computer-Aided Industrial Design and Conceptual Design 2005, May 2005, Delft, Netherlands. ⟨inria-00517687⟩
229 View
1595 Download


Gmail Facebook Twitter LinkedIn More