Geodesic
Enumerating Triangulations of Convex Polytopes
Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AA, Discrete Models: Combinatorics, Computation, and Geometry (DM-CCG 2001), DMTCS Proceedings vol. AA, Discrete Models: Combinatorics, Computation, and Geometry (DM-CCG 2001) (2001).

Voir la notice de l'article provenant de la source Episciences

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. 
@article{DMTCS_2001_special_246_a18,
     author = {Bespamyatnikh, Sergei},
     title = {Enumerating {Triangulations} of {Convex} {Polytopes}},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {DMTCS Proceedings vol. AA, Discrete Models: Combinatorics, Computation, and Geometry (DM-CCG 2001)},
     year = {2001},
     doi = {10.46298/dmtcs.2295},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2295/}
}
TY  - JOUR
AU  - Bespamyatnikh, Sergei
TI  - Enumerating Triangulations of Convex Polytopes
JO  - Discrete mathematics & theoretical computer science
PY  - 2001
VL  - DMTCS Proceedings vol. AA, Discrete Models: Combinatorics, Computation, and Geometry (DM-CCG 2001)
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2295/
DO  - 10.46298/dmtcs.2295
LA  - en
ID  - DMTCS_2001_special_246_a18
ER  - 
%0 Journal Article
%A Bespamyatnikh, Sergei
%T Enumerating Triangulations of Convex Polytopes
%J Discrete mathematics & theoretical computer science
%D 2001
%V DMTCS Proceedings vol. AA, Discrete Models: Combinatorics, Computation, and Geometry (DM-CCG 2001)
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2295/
%R 10.46298/dmtcs.2295
%G en
%F DMTCS_2001_special_246_a18
Bespamyatnikh, Sergei. Enumerating Triangulations of Convex Polytopes. Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AA, Discrete Models: Combinatorics, Computation, and Geometry (DM-CCG 2001), DMTCS Proceedings vol. AA, Discrete Models: Combinatorics, Computation, and Geometry (DM-CCG 2001) (2001). doi : 10.46298/dmtcs.2295. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2295/

Cité par Sources :