Diagonal flips in labelled planar triangulations

Graphs and Combinatorics

Volumn 17, Issue 4, 2001, Pages 647-657

  Gao, Zhicheng ^a   Urrutia, Jorge ^b,c   Wang, Jianyu ^a  

^a CARLETON UNIVERSITY   (Canada)

^b UNIVERSITY OF OTTAWA   (Canada)

^c UNIVERSIDAD NACIONAL AUTÓNOMA DE MÉXICO   (Mexico)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 19544369508     PISSN: 09110119     EISSN: None     Source Type: Journal    
DOI: 10.1007/s003730170006     Document Type: Article

References (19)

1. Ando, K., Komuro, H.: The seven graphs whose H-transformations are uniquely determined. 1997 (preprint)
2. Aronov, B., Seidel, R., Souvaine, D.: On compatible triangulations of simple polygons. Comput. Geom.: Theory Appl. 3, 27-35 (1993)
3. Bern, M., Eppstein, D.: Mesh generation and optimal triangulation. In: Du, D.Z. et al.: Computing in Euclidean Geometry, pp. 23-90, World Scientific 1992
4. Brunet, R., Nakamoto, A., Negami, S.: Diagonal flips of triangulations on closed surfaces preserving specified properties. J. Comb. Theory, Ser. B 68, 295-309 (1996)
5. Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. 23rd printing, The MIT Press and McGraw-Hill 1999
6. Dewdney, A.K.: Wagner's theorem for the torus graph. Discrete Math. 4, 139-149 (1973)
7. Fortune, S.: Voronoi diagrams and Delaunay triangulations. In: Du, D.Z. et al.: Computing in Euclidean Geometry, pp. 193-234. World Scientific 1992
8. Guibas, L., Hershberger, J., Levem, D., Sharir, M., Tarjan, R.: Algorithms for visibility and shortest path problems inside triangulated simple polygons. Algorithmica 2, 200-237 (1987)
9. Hurtado, F., Noy, M., Urrutia, J.: Flipping edges on triangulation. Proc. 12nd ACM Symposium on Computational Geometry, pp. 214-223, May 24-26 1996
10. Kranakis, E., Urrutia, J.: Isomorphic triangulations with a small number of Steiner points. Int. J. Comput. Geom. (to appear)
11. Komuro, H.: The diagonal flips of triangulations on the sphere. Yokohama Math. J. 44, 115-122 (1997)
12. Komuro, H., Nakamoto, A., Negami, S.: Diagonal flips in triangulations on closed surfaces with minimum degree at least 4. J. Comb. Theory, Ser. B 76, 68-92 (1999)
13. Lawrencenko, S., Negami, S., White, A.T.: Three nonisomorphic triangulations of an orientable surface with the same complete graph. Discrete Math. 135, 367-369 (1994)
14. Negami, S.: Diagonal flips in triangulations of surfaces. Discrete Math. 135, 225-232 (1994)
15. Negami, S., Watanabe, S.: Diagonal transformations of triangulations on surfaces. Tsukuba J. Math. 14, 155-166 (1990)
16. Saalfeld, A.: Joint triangulations and triangulated maps. In: Proc. 3rd Annual ACM Symposium in Computational Geometry, pp. 195-204 (1987)
17. Sleator, D., Tarjan, R., Thurston, W.: Rotation distance, triangulations, and hyperbolic geometry. J. Am. Math. Soc. 1, 647-681 (1988)
18. Wagner, K.: Bemerkungem zum Vierfarbenproblem. Jber. Deutsch. Math-Verein 46, 126-132 (1936)
19. Whitney, H.: Congruent graphs and the connectivity of graphs. Am. J. Math. 54, 150-168 (1932)