Enumerating Triangulations of Convex Polytopes - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Discrete Mathematics and Theoretical Computer Science Année : 2001

Enumerating Triangulations of Convex Polytopes

Résumé

A triangulation of a finite point set A in $\mathbb{R}^d$ is a geometric simplicial complex which covers the convex hull of $A$ and whose vertices are points of $A$. We study the graph of triangulations whose vertices represent the triangulations and whose edges represent geometric bistellar flips. The main result of this paper is that the graph of triangulations in three dimensions is connected when the points of $A$ are in convex position. We introduce a tree of triangulations and present an algorithm for enumerating triangulations in $O(log log n)$ time per triangulation.
Fichier principal
Vignette du fichier
dmAA0107.pdf (122.48 Ko) Télécharger le fichier
Origine : Fichiers éditeurs autorisés sur une archive ouverte
Loading...

Dates et versions

hal-01182975 , version 1 (06-08-2015)

Identifiants

Citer

Sergei Bespamyatnikh. Enumerating Triangulations of Convex Polytopes. Discrete Models: Combinatorics, Computation, and Geometry, DM-CCG 2001, 2001, Paris, France. pp.111-122, ⟨10.46298/dmtcs.2295⟩. ⟨hal-01182975⟩

Collections

INSMI TDS-MACS
60 Consultations
662 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More