Graph of triangulations of a convex polygon and tree of triangulations

Authors
Hurtado, F Noy, M
Citation
F. Hurtado et M. Noy, Graph of triangulations of a convex polygon and tree of triangulations, COMP GEOM, 13(3), 1999, pp. 179-188
Citations number
17
Categorie Soggetti
Engineering Mathematics
Journal title
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS
ISSN journal
09257721 → ACNP
Volume
13
Issue
3
Year of publication
1999
Pages
179 - 188
Database
ISI
SICI code
0925-7721(199909)13:3<179:GOTOAC>2.0.ZU;2-R
Abstract
Define a graph G(T)(n) With one node for each triangulation of a convex n-g on. Place an edge between each pair of nodes that differ by a single flip: two triangles forming a quadrilateral are exchanged for the other pair of t riangles forming the same quadrilateral. In this paper we introduce a tree of all triangulations of polygons with any number of vertices which gives a unified framework in which several results on G(T)(n) admit new and simple proofs. (C) 1999 Elsevier Science B.V. All rights reserved.