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.
Type de document :
Communication dans un congrès
Proceedings of The 6th International Conference on Computer-Aided Industrial Design and Conceptual Design 2005, May 2005, Delft, Netherlands. 2005
Liste complète des métadonnées

Littérature citée [15 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00517687
Contributeur : Thss Tsinghua <>
Soumis le : mercredi 15 septembre 2010 - 11:17:05
Dernière modification le : jeudi 11 janvier 2018 - 06:21:19

Fichier

YuPeng2005b.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00517687, version 1

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. 2005. 〈inria-00517687〉

Partager

Métriques

Consultations de la notice

188

Téléchargements de fichiers

955