Skip to Main content Skip to Navigation
Conference papers

Efficient algorithm for general polygon clipping

Yu Peng 1 Junhai Yong 2 Hui Zhang 2 Jiaguang Sun 2
1 CAD - Computer Aided Design
LIAMA - Laboratoire Franco-Chinois d'Informatique, d'Automatique et de Mathématiques Appliquées, Inria Paris-Rocquencourt
Abstract : 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [15 references]  Display  Hide  Download

https://hal.inria.fr/inria-00517687
Contributor : Thss Tsinghua <>
Submitted on : Wednesday, September 15, 2010 - 11:17:05 AM
Last modification on : Thursday, June 4, 2020 - 7:22:32 AM

File

YuPeng2005b.pdf
Files produced by the author(s)

Identifiers

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

Collections

Citation

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⟩

Share

Metrics

Record views

347

Files downloads

1845