Flips in planar graphs

Computational Geometry: Theory and Applications

Volumn 42, Issue 1, 2009, Pages 60-80

  Bose, Prosenjit ^a   Hurtado, Ferran ^b  

^a CARLETON UNIVERSITY   (Canada)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Algorithms; Computational geometry; Local transformations; Planar graphs; Theory

Indexed keywords

EID: 84867935783     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.comgeo.2008.04.001     Document Type: Article

References (106)

1. M. Abellanas, P. Bose, J. García, F. Hurtado, M. Nicolás, P. Ramos, On properties of higher-order Delaunay graphs with applications. in: Proc. 21st European Workshop on Computational Geometry, 2005, pp. 9-11
2. M. Abellanas, P. Bose, A.G. Olaverri, F. Hurtado, P. Ramos, E. Rivera-Campo, and J. Tejel On local transformations in plane geometric graphs embedded on small grids Computational Geometry: Theory and Applications 39 2 2008 65 77
3. O. Aichholzer, L. Alboul, and F. Hurtado On flips in polyhedral surfaces International Journal of Foundations of Computer Science 13 2 2002 303 311
4. O. Aichholzer, F. Aurenhammer, and F. Hurtado Sequences of spanning trees and a fixed tree theorem Computational Geometry: Theory and Applications 21 1-2 2002 3 20
5. O. Aichholzer, F. Aurenhammer, H. Krasser, and P. Brass Pseudotriangulations from surfaces and a novel type of edge flip SIAM Journal of Computing 32 6 2003 1621 1653
6. O. Aichholzer, S. Bereg, A. Dumitrescu, A. Garcia, C. Huemer, F. Hurtado, M. Kano, A. Marquez, D. Rappaport, S. Smorodinsky, D. Souvaine, J. Urrutia, D. Wood, Compatible geometric matchings, in: Proceedings of Topological and Geometric Graph Theory (TGGT 08), 2008
7. O. Aichholzer, F. Aurenhammer, C. Huemer, B. Vogtenhuber, Gray code enumeration of plane straight-line graphs, in: Proceedings of the European Workshop on Computational Geometry, 2006, pp. 71-74
8. O. Aichholzer, T. Hackl, C. Huemer, F. Hurtado, H. Krasser, and B. Vogtenhuber On the number of plane graphs Graphs and Combinatorics 23 1 2007 67 84
9. O. Aichholzer, and K. Reinhardt A quadratic distance bound on sliding between crossing-free spanning trees Computational Geometry: Theory and Applications 37 3 2007 155 161
10. M. Ajtai, V. Chvatal, M. Newborn, and E. Szemerdi Crossing-free subgraphs Annals of Discrete Mathematics 12 1982 9 12
11. S. Akl Inherently parallel geometric computations Parallel Processing Letters 16 1 2006 19 37
12. L. Alboul, and R.V. Damme Polyhedral metrics in surface reconstruction G. Mullineux, Mathematics of Surfaces VI 1996 Clarendon Press Oxford 171 200
13. G. Aloupis, P. Bose, P. Morin, Reconfiguring triangulations with edge flips and point moves, in: Graph Drawing, 2004, pp. 1-11
14. D. Avis Generating rooted triangulations without repetitions Algorithmica 16 1996 618 632
15. D. Avis Tutorial on reverse search with C implementations http://cgm.cs.mcgill.ca/~avis/doc/tutorial/ 2000
16. D. Avis, and K. Fukuda A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra Discrete and Computational Geometry 8 1992 295 313
17. D. Avis, and K. Fukuda Reverse search for enumeration Discrete Applied Mathematics 65 1996 21 46
18. D. Avis, N. Katoh, M. Ohsaki, I. Streinu, and S. Tanigawa Enumerating planar minimally rigid graphs Graphs and Combinatorics 23 2007 117 134
19. S. Bereg Transforming pseudo-triangulations Information Processing Letters 90 2004 141 145
20. M. Bern Triangulations and mesh generation J. Goodman, J. O'Rourke, Handbook of Discrete and Computational Geometry second ed. 2004 CRC Press 563 582
21. M. Bern, H. Edelsbrunner, D. Eppstein, S. Mitchell, and T. Tan Edge insertion for optimal triangulations Discrete and Computational Geometry 10 1 1993 47 65
22. M. Bern, and D. Eppstein Mesh generation and optimal triangulation D.-Z. Du, F. Hwang, Computing in Euclidean Geometry second ed. 1995 World Scientific 47 123
23. S. Bespamyatnikh An efficient algorithm for enumeration of triangulations Computational Geometry: Theory and Applications 23 3 2002 271 279
24. S. Bespamyatnikh Enumerating pseudo-triangulations in the plane Computational Geometry: Theory and Applications 30 3 2005 618 632
25. P. Bose, J. Czyzowicz, Z. Gao, P. Morin, and D.R. Wood Simultaneous diagonal flips in plane triangulations Journal of Graph Theory 54 4 2007 307 330
26. P. Bose, J. Czyzowicz, F. Hurtado, Rotation flips and non-crossing trees, Manuscript, 2000
27. P. Brass, W. Moser, and J. Pach Research Problems in Discrete Geometry 2005 Springer-Verlag
28. H. Brönnimann, L. Kettner, M. Pocchiola, and J. Snoeyink Counting and enumerating pseudo-triangulations with the greedy flip algorithm SIAM Journal of Computing 36 3 2006 231 242
29. L.P. Chew Constrained Delaunay triangulations Algorithmica 1989 97 108
30. C. Cortés, A.M.C. Grima, and A. Nakamoto Diagonal flips in outer-triangulations on closed surfaces Discrete Mathematics 254 2002 63 74
31. C. Cortés, C. Grima, F. Hurtado, A. Márquez, F. Santos, J. Valenzuela, Transforming triangulations of polygons on non-planar surfaces, in: Proc. 17th European Workshop on Computational Geometry, 2001, pp. 31-34
32. C. Cortés, and A. Nakamoto Diagonal flips in outer-Klein bottle triangulations Discrete Mathematics 222 2000 41 50
33. C. Cortés, and A. Nakamoto Diagonal flips in outer-torus triangulations Discrete Mathematics 216 2000 71 83
34. M. Damian, R. Flatland, J. O'Rourke, S. Ramaswami, Connecting polygonizations via stretches and twangs, in: Proceedings of the Twenty-Fifth International Symposium on Theoretical Aspects of Computer Science, 2008, pp. 217-228
35. B. Delone Sur la sphère vide Bulletin de L'Academie des Sciences de L'URSS, Classe des Sciences mathématiques et Naturelles 7 6 1934 793 800
36. A. Dewdney Wagner's theorem for the torus graphs Discrete Mathematics 4 1973 139 149
37. N. Dyn, K. Hormann, S.-J. Kim, D. Levin, Optimizing 3d triangulations using discrete curvature analysis, in: T. Lyche, L. Shumaker (Eds.), Mathematical Methods for Curves and Surfaces: Oslo, 2000, pp. 135-146
38. N. Dyn, D. Levin, and S. Rippa Algorithms for the construction of data dependent triangulations J.C. Mason, M.G. Cox, Algorithms for Approximation II 1990 Chapman and Hall
39. N. Dyn, D. Levin, and S. Rippa Data dependent triangulations for piecewise linear interpolation IMA Journal on Numerical Analysis 10 1 1990 137 154
40. N. Dyn, D. Levitan, D. Levin, and A. Pincus Multivariate Approximation and Applications 2001 Cambridge University Press
41. n 2logn) time algorithm for the minmax angle triangulation SIAM Journal on Scientific and Statistical Computing 13 1992 994 1008
42. S. Eliahou Signed diagonal flips and the four colour theorem European Journal of Combinatorics 20 1999 641 646
43. S. Eliahou, and C. Lecouvey Signed permutations and the four colour theorem Preprint available at http://arxiv.org/abs/math.CO/0606726v1 2006
44. D. Eppstein, Happy endings for flip graphs, in: Proceedings of the Twenty-Third Annual ACM Symposium on Computational Geometry, 2007, pp. 92-101
45. P. Flajolet, and M. Noy Analytic combinatorics of non-crossing configurations Discrete Mathematics 204 1-3 1999 203 229
46. W. Frey, and D. Field Mesh relaxation: a new technique for improving triangulations International Journal of Numerical Metods in Engineering 31 1991 1121 1133
47. J. Galtier, F. Hurtado, M. Noy, S. Pérennes, and J. Urrutia Simultaneous edge flipping in triangulations International Journal of Computational Geometry and Applications 13 2 2003 113 133
48. Z. Gao, J. Urrutia, and J. Wang Diagonal flips in labelled planar triangulations Graphs and Combinatorics 17 4 2001 647 657
49. W. Goddard, and H. Swart Distance between graphs under edge operations Discrete Mathematics 161 1-3 1996 121 132
50. S. Gravier, and C. Payan Flips signés et triangulations d'un polygone European Journal of Combinatorics 23 2002 817 821
51. C. Grima, Geometría computacional en superficies, Ph.D. thesis, Universidad de Sevilla, 1998 (in Spanish)
52. J. Gudmundsson, M. Hammar, and M. van Kreveld Higher order Delaunay triangulations Computational Geometry: Theory and Applications 23 1 2002 85 98
53. S. Hanke, T. Ottmann, and S. Schuierer The edge-flipping distance of triangulations Journal of Universal Computer Science 2 8 1996 570 579
54. D. Hansford The neutral case for the min-max triangulation CAGD 7 1990 431 438
55. C. Hernando, M. Houle, and F. Hurtado On local transformation of polygons with visibility properties Theoretical Computer Science 289 2 2002 919 937
56. C. Hernando, F. Hurtado, M. Mora, E. Rivera-Campo, Grafos de árboles etiquetados y grafos de árboles geométricos etiquetados, in: Proc. X Encuentros de Geometra Computacional, 2003, pp. 13-19 (in Spanish)
57. C. Hernando, F. Hurtado, A. Márquez, M. Mora, and M. Noy Geometric tree graphs of points in convex position Discrete Applied Mathematics 93 1 1999 51 66
58. C. Holzmann, and F. Harary On the tree graph of a matroid SIAM Journal on Applied Mathematics 22 1972 187 193
59. M. Houle, On local transformation of simple polygons, in: Australian Comput. Sci. Commun. Proc. CATS'96, 1996, pp. 64-71
60. M. Houle, F. Hurtado, M. Noy, and E. Rivera-Campo Graphs of triangulations and perfect matchings Graphs and Combinatorics 21 3 2005 325 331
61. C. Huemer, F. Hurtado, M. Noy, E. Omaña-Pulido, Gray codes for non-crossing partitions and dissections of a convex polygon, in: Proc. of X Encuentros de Geometría Computacional, 2003, pp. 20-23
62. F. Hurtado, and M. Noy Graph of triangulations of a convex polygon and tree of triangulations Computational Geometry: Theory and Applications 13 3 1999 179 188
63. F. Hurtado, M. Noy, J. Urrutia, Parallel edge flipping, in: Proceedings of the 10th Canadian Conference on Computational Geometry, 1998, pp. 26-27
64. F. Hurtado, M. Noy, and J. Urrutia Flipping edges in triangulations Discrete and Computational Geometry 22 3 1999 333 346
65. J. Jaromczyk, and G. Toussaint Relative neighborhood graphs and their relatives Proceedings of the IEEE 80 1992 1502 1517
66. H. Komuro The diagonal flips of triangulations on the sphere Yokohama Mathematical Journal 44 2 1997 115 122
67. L. Kryuchov, The four color theorem and trees, Kurchatov Institute of Atomic Energy IAE-5537/1, Moscow, preprint, 1992
68. C. Lawson Triangulations of plane point sets Jet Propulsion Laboratory Space Programs Summary 37-35 4 1965 24 25
69. C. Lawson Transforming triangulations Discrete Mathematics 3 1972 365 372
70. C 1 surface interpolation J. Rice, Mathematical Software III 1977 Academic Press New York 161 194
71. C. Lee The associahedron and the triangulations of the n-gon European Journal of Combinatorics 10 4 1989 551 560
72. D. Lee, and A. Lin Generalized Delaunay triangulation for planar graphs Discrete and Computational Geometry 1 1986 210 217
73. G. Liu On connectivities of tree graphs Journal of Graph Theory 12 1988 453 459
74. L. Lovász Random walks on graphs: A survey J. Miklós, V.T. Sós, T. Sznyi, Combinatorics, Paul Erdos is Eighty 1996 János Bolyai Mathematical Society
75. J. Lucas The rotation graph of binary trees is Hamiltonian Journal of Algorithms 8 4 1988 503 535
76. A. Márquez, and C. Grima Computational Geometry on Surfaces 2001 Kluwer Academic Publishers
77. H. Meijer, D. Rappaport, Simultaneous edge flip for convex subdivisions, in: Proc. 16th Canadian Conf. on Comp. Geom. (CCCG'04), 2004, pp. 57-59
78. M. Molloy, B. Reed, and W. Steiger On the mixing rate of the triangulation walk DIMACS Series in Discrete Mathematics and Theoretical Computer Science 43 1999 179 190
79. R. Mori, A. Nakamoto, and K. Ota Diagonal flips in Hamiltonian triangulations on the sphere Graphs and Combinatorics 19 3 2003 413 418
80. S. Negami Diagonal flips in triangulations of surfaces Discrete Mathematics 135 1994 225 232
81. S. Negami Triangulations J. Gross, J. Yellen, Handbook of Graph Theory 2003 CRC Press Chap. 7, 8
82. S. Negami, and S. Watanabe Diagonal transformations of triangulations on surfaces Tsukuba Journal of Mathematics 14 1990 155 166
83. A. Okabe, B. Boots, K. Sugihara, and S.N. Chiu Spatial Tessellations: Concepts and Applications of Voronoi Diagrams second ed. 2000 John Wiley and Sons
84. J. Pach Geometric graph theory Surveys in Combinatorics London Math. Soc. Lecture Note Series vol. 237 1999 Cambridge University Press 167 200
85. J. Pach Geometric graph theory J. Goodman, J. O'Rourke, Handbook of Discrete and Computational Geometry 2004 CRC Press 219 238
86. J. Pach, and P. Agarwal Combinatorial Geometry 1995 John Wiley & Sons
87. A. Razen, A lower bound for the transformation of compatible perfect matchings, in: Proceedings of 24th European Workshop on Computational Geometry, 2008
88. S. Rippa Minimal roughness property of the Delaunay triangulation Computer Aided Geometric Design 7 6 1990 489 497
89. S. Rippa, and B. Schiff Minimum energy triangulations for elliptic problems Computer Methods in Applied Mechanics and Engineering 84 1990 257 274
90. E. Rivera-Campo, and V. Urrutia-Galicia Hamilton cycles in the path graph of a set of points in convex position Computational Geometry: Theory and Applications 18 2 2001 65 72
91. F. Santos Geometric bistellar flips. The setting, the context and a construction Preprint available at http://arxiv.org/abs/math.CO/0601746 2007
92. C. Savage A survey of combinatorial Gray codes SIAM Review 39 4 1997 605 629
93. R. Seidel, Constrained Delaunay triangulations and Voronoi diagrams with obstacles, in: H. Poingratz, W. Schinnerl (Eds.), 1978-1988 Ten Years IIG, 1988, pp. 178-191
94. M. Sharir, and E. Welzl On the number of crossing-free matchings, cycles and partitions SIAM Journal of Computing 36 3 2006 695 720
95. M. Sharir, E. Welzl, Random triangulations of point sets, in: Proc. ACM-SIAM Symposium on Computational Geometry, 2006, pp. 273-281
96. A. Sinclair Algorithms for Random Generation and Counting: A Markov Chain Approach 1992 Birkhäuser
97. D. Sleator, R. Tarjan, and W. Thurston Rotations distance, triangulations and hyperbolic geometry Journal of the American Mathematical Society 1 1988 647 682
98. D. Sleator, R. Tarjan, and W. Thurston Short encodings of evolving structures SIAM Journal of Discrete Mathematics 5 3 1992 428 450
99. F. Spitzer Principles of Random Walk 2001 Springer-Verlag
100. I. Streinu A combinatorial approach to planar non-colliding robot motion planning Proc. 41st IEEE Symp. on Foundations of Computer Science (FOCS'00) 2000 IEEE 443 453
101. W.T. Tutte A theorem on planar graphs Transactions of the American Mathematical Society 82 1956 99 116
102. V. Urrutia-Galicia, Algunas propiedades de gráficas geométricas, Ph.D. thesis, Universidad Autónoma de México, 2000
103. K. Wagner Bemerkung zum Vierfarbenproblem Jahresbericht der Deutschen Mathematiker-Vereiningung 46 1936 26 32
104. C.A. Wang, L. Schubert, An optimal algorithm for constructing the Delaunay triangulation of a set of line segments, in: Proc. 3rd Annu. ACM Symp. Comput. Geom., 1987, pp. 223-232
105. D. Watson, and G. Philip Systematic triangulations Computer Vision, Graphics and Image Processing 26 1984 217 223
106. F. Weingarten A transformation of triangulations Jet Propulsion Laboratory Space Programs Summary 37-35 4 1965 25 26