Pré-Publication, Document De Travail Année : 2010

Triangulations of nearly convex polygons

Roland Bacher
Frédéric Mouton
  • Fonction : Auteur correspondant
  • PersonId : 868943

Connectez-vous pour contacter l'auteur

Résumé

Counting Euclidean triangulations with vertices in a finite set $\C$ of the convex hull $\conv(\C)$ of $\C$ is difficult in general, both algorithmically and theoretically. The aim of this paper is to describe nearly convex polygons, a class of configurations for which this problem can be solved to some extent. Loosely speaking, a nearly convex polygon is an infinitesimal perturbation of a weakly convex polygon (a convex polygon with edges subdivided by additional points). Our main result shows that the triangulation polynomial, enumerating all triangulations of a nearly convex polygon, is defined in a straightforward way in terms of polynomials associated to the ``perturbed'' edges.

Fichier principal
Vignette du fichier
nearly_convex_triang_final.pdf (164.29 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence
Loading...

Dates et versions

hal-00545394 , version 1 (10-12-2010)

Licence

Identifiants

Citer

Roland Bacher, Frédéric Mouton. Triangulations of nearly convex polygons. 2010. ⟨hal-00545394⟩
127 Consultations
652 Téléchargements

Altmetric

Partager

  • More