Graph of triangulations of a convex polygon and tree of triangulations

Computational Geometry: Theory and Applications

Volumn 13, Issue 3, 1999, Pages 179-188

  Hurtado, F ^a   Noy, M ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Binary tree; Flipping; Hamiltonian graph; Outerplanar graph; Rotation; Simple polygon; Triangulation

Indexed keywords

EID: 0000188799     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(99)00016-4     Document Type: Article

References (17)

1. D. Avis, K. Fukuda, Reverse search for enumeration, Discrete Appl. Math. 6 (1996) 82-90.
2. L.J. Billera, P. Filliman, B. Sturmfels, Constructions and complexity of secondary polytopes, Adv. Math. 83 (1990) 155-179.
3. G. Chartrand, L. Lesniak, Graphs and Digraphs, Wadsworth & Brooks/Cole, 1986.
4. R.D. Dutton, R.O. Rogers, Properties of the rotation graph of binary trees, Congr. Numer. 109 (1995) 51-63.
5. P. Epstein, J.R. Sack, Generating triangulations at random, in: Proc. of the 4th Canadian Conf. on Computational Geometry, 1992, pp. 305-310.
6. S. Fortune, Voronoi diagrams and Delaunay triangulations, in: D.Z. Dhu and F. Hwang (Eds.), Computing in Euclidean Geometry, 2nd edition, World Scientific, 1995.
7. H.W. Gould, Research bibliography on two special number sequences, Mathematica Monongaliae 12 (1971).
8. F. Hurtado, M. Noy, Triangulations, visibility graph and reflex vertices of a simple polygon, Computational Geometry 6 (1996) 355-369.
9. F. Hurtado, M. Noy, Ears of triangulations and Catalan numbers, Discrete Math. 149 (1996) 319-324.
10. F. Hurtado, M. Noy, Counting triangulations of almost-convex polygons, Ars Combinatoria 45 (1997) 169-179.
11. F. Hurtado, M. Noy, J. Urrutia, Flipping diagonals in triangulations, in: Discrete Comput. Geom. 22 (1999) 333-346.
12. C.W. Lee, The associahedron and triangulations of the n-gon, European J. Combin. 10 (1989) 551-560.
13. J. Lucas, The rotation graph of binary trees is Hamiltonian, J. Algorithms 8 (1988) 503-535.
14. J. Lucas, D. Roelants van Baronaigien, F. Ruskey, On rotations and the generation of binary trees Hamiltonian, J. Algorithms 5 (1993) 343-366.
15. D.J. Naddef, W.R. Pulleyblank, Hamiltonicity in (0, 1)-polyhedra, J. Combin. Theory Ser. B 37 (1984) 41-52.
16. D.D. Sleator, R.E. Tarjan, W.P. Thurston, Rotations distance, triangulations, and hyperbolic geometry, J. Amer. Math. Soc. 1 (1988) 647-682.
17. G.M. Ziegler, Lectures on Polytopes, Graduate Texts in Mathematics, Vol. 152, Springer, Berlin, 1995.