Random triangulations of planar points sets

M. Ajtai, V. Chvátal, M.M. Newborn, E. Szemerédi, Crossing-Free Subgraphs Theory and Practice of Combinatorics - A collection of articles honoring Anton Kotzig on the occasion of his sixtieth birthday. ,vol. 60, pp. 9- 12 ,(1982) , 10.1016/S0304-0208(08)73484-4

Paul McCabe, Raimund Seidel, New lower bounds for the number of straight-edge triangulations of a planar point set ,(2004)

Christian Sohler, Markus Denny, Encoding a triangulation as a permutation of its point set. canadian conference on computational geometry. ,(1997)

Marc Noy, Omer Gimenez, The number of planar graphs and properties of random planar graphs Discrete Mathematics & Theoretical Computer Science. pp. 147- 156 ,(2005)

W. T. Tutte, A Census of Planar Triangulations Canadian Journal of Mathematics. ,vol. 14, pp. 21- 38 ,(1962) , 10.4153/CJM-1962-002-9

Valery A Liskovets, A Pattern of Asymptotic Vertex Valency Distributions in Planar Maps Journal of Combinatorial Theory, Series B. ,vol. 75, pp. 116- 133 ,(1999) , 10.1006/JCTB.1998.1870

Clemens Huemer, Birgit Vogtenhuber, Hannes Krasser, Thomas Hackl, Oswin Aichholzer, Ferran Hurtado, On the number of plane graphs symposium on discrete algorithms. pp. 504- 513 ,(2006) , 10.5555/1109557.1109613

Francisco Santos, Raimund Seidel, A better upper bound on the number of triangulations of a planar point set Journal of Combinatorial Theory, Series A. ,vol. 102, pp. 186- 193 ,(2003) , 10.1016/S0097-3165(03)00002-5

Micha Sharir, Emo Welzl, On the number of crossing-free matchings, (cycles, and partitions) symposium on discrete algorithms. pp. 860- 869 ,(2006) , 10.5555/1109557.1109652

Oswin Aichholzer, The path of a triangulation symposium on computational geometry. pp. 14- 23 ,(1999) , 10.1145/304893.304896