Random triangulations of planar point sets

Proceedings of the Annual Symposium on Computational Geometry

Volumn 2006, Issue , 2006, Pages 273-281

  Sharir, Micha ^a,b   Welzl, Emo ^c  

^a TEL AVIV UNIVERSITY   (Israel)

^b NEW YORK UNIVERSITY   (United States)

^c ETH ZURICH   (Switzerland)

Author keywords

Charging; Counting; Crossing free geometric graphs; Crossing free spanning trees; Degree sequences; Number of triangulations; Random triangulations

Indexed keywords

COMPUTATIONAL GEOMETRY; GRAPH THEORY;

CHARGING; COUNTING; CROSSING-FREE GEOMETRIC GRAPHS; CROSSING-FREE SPANNING TREES; DEGREE SEQUENCES; NUMBER OF TRIANGULATIONS; RANDOM TRIANGULATIONS;

TRIANGULATION;

EID: 33748064661     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1137856.1137898     Document Type: Conference Paper

References (22)

1. O. Aichholzer, The path of a triangulation, Proc. 15th Ann. ACM Symp. on Computational Geometry (1999), 14-23.
2. O. Aichholzer, T. Hackl, H. Krasser, C. Huemer, F. Hurtado, and B. Vogtenhuber, On the number of plane graphs, Proc. 17th Ann. ACM-SIAM Symp. on Discrete Algorithms (2006), 504-513.
3. M. Ajtai, V. Chvátal, M. M. Newborn, and E. Szemerédi, Crossing-free subgraphs, Annals Discrete Math. 12 (1982), 9-12.
4. K. Appel and W. Haken, Every planar map is four colorable. I. Discharging, Illinois J. Math. 21 (1977), 429-490.
5. M.O. Denny and C.A. Sohler, Encoding a triangulation as a permutation of its point set, Proc. 9th Canadian Conf. on Computational Geometry (1997), 39-43.
6. N, Comput. Geom. Theory Appl. 16 (2000), 211-221.
7. O. Giménez and M. Noy, The number of planar graphs and properties of random planar graphs, Proc. International Conf. on Analysis of Algorithms, Discrete Mathematics and Theoretical Computer Science proc. AD (2005), 147-156.
8. H. Heesch, Untersuchungen zum Vierfarbenproblem, Hochschulskriptum 810/a/b, Bibliographisches Institut, Mannheim, 1969.
9. V.A. Liskovets, A pattern of asymptotic vertex valency distributions in planar maps, J. Combinat. Theory, Ser. B 75 (1999), 116-133.
10. P. McCabe and R. Seidel, New lower bounds for the number of straight-edge triangulations of a planar point set, Proc. 20th European Workshop Comput. Geom. (2004).
11. C. McDiarmid, A. Steger, and D.J.A. Welsh, Random planar graphs, J. Combinat. Theory, Ser. B 93 (2005), 187-205.
12. L. McShine and P. Tetali, On the mixing time of the triangulation walk and other Catalan structures, DIMACS-AMS volume on Randomization Methods in Algorithm Design (Eds. P.M. Pardalos, S. Rajasekaran, and J. Rolim) DIMACS Series in Discrete Mathematics and Theoretical Computer Science 43 (1998), 147-160.
13. M. Molloy, B. Reed, and W. Steiger, On the mixing rate of the triangulation walk, DIMACS-AMS volume on Randomization Methods in Algorithm Design (Eds. P.M. Pardalos, S. Rajasekaran, and J. Rolim), DIMACS Series in Discrete Mathematics and Theoretical Computer Science 43 (1998), 179-190.
14. A. Ribó, Realizations and Counting Problems for Planar Structures: Trees and Linkages, Polytopes and Polyominos, Ph.D. thesis, Freie Universität Berlin, 2005.
15. N. Robertson, D.P. Sanders, P.D. Seymour, and R. Thomas, The four-color theorem, J. Combinat. Theory, Ser. B 70 (1997), 2-44.
16. G. Rote, The number of spanning trees in a planar graph, Oberwolfach Reports 2 (2005), 969-973.
17. F. Santos and R. Seidel, A better upper bound on the number of triangulations of a planar point set, J. Combinat. Theory, Ser. A 102:1 (2003), 186-193.
18. R. Seidel, On the number of triangulations of planar point sets, Combinatorica 18:2 (1998), 297-299.
19. M. Sharir and E. Welzl, On the number of crossing-free matchings (cycles, and partitions), Proc. 17th Ann. ACM-SIAM Symp. on Discrete Algorithms (2006), 860-869.
20. W.S. Smith, Studies in Computational Geometry Motivated by Mesh Generation, Ph. D. thesis, Princeton University, 1989.
21. R.P. Stanley, Enumerative Combinatorics, vol. 2, Cambridge University Press, 1999.
22. W.T. Tutte, A census of planar triangulations, Canadian Journal of Mathematics 14 (1962), 21-38.