Multitriangulations, pseudotriangulations and primitive sorting networks - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Discrete and Computational Geometry Année : 2012

Multitriangulations, pseudotriangulations and primitive sorting networks

Résumé

We study the set of all pseudoline arrangements with contact points which cover a given support. We define a natural notion of flip between these arrangements and study the graph of these flips. In particular, we provide an enumeration algorithm for arrangements with a given support, based on the properties of certain greedy pseudoline arrangements and on their connection with sorting networks. Both the running time per arrangement and the working space of our algorithm are polynomial. As the motivation for this work, we provide in this paper a new interpretation of both pseudotriangulations and multitriangulations in terms of pseudoline arrangements on specific supports. This interpretation explains their common properties and leads to a natural definition of multipseudotriangulations, which generalizes both. We study elementary properties of multipseudotriangulations and compare them to iterations of pseudotriangulations.
Fichier principal
Vignette du fichier
PilaudPocchiola_Multipseudotriangulations_DCG.pdf (1.08 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00777982 , version 1 (18-01-2013)

Identifiants

Citer

Vincent Pilaud, Michel Pocchiola. Multitriangulations, pseudotriangulations and primitive sorting networks. Discrete and Computational Geometry, 2012, 48 (1), pp.142-191. ⟨10.1007/s00454-012-9408-6⟩. ⟨hal-00777982⟩
206 Consultations
153 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More