Abstract
We give a brief account of results concerning the number of triangulations on finite point sets in the plane, both for arbitrary sets and for specific sets such as the n ×n integer lattice.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Aichholzer, O.: The path of a triangulation. In: Proc.15th Ann. ACM Symp. on Computational Geometry, pp. 14–23. ACM Press, New York (1999)
Aichholzer, O., Hackl, T., Krasser, H., Huemer, C., Hurtado, F., Vogtenhuber, B.: On the number of plane graphs. In: Proc. 17th Ann. ACM-SIAM Symp. on Discrete Algorithms, pp. 504–513. ACM Press, New York (2006)
Ajtai, M., Chvátal, V., Newborn, M.M., Szemerédi, E.: Crossing-free subgraphs. Annals Discrete Math. 12, 9–12 (1982)
Anclin, E.E.: An upper bound for the number of planar lattice triangulations. J.Combinat.Theory,Ser.A 103, 383–386 (2003)
Avisand, D., Fukuda, K.: Reverse search for enumeration. Discrete Appl. Math. 65, 21–46 (1996)
Dennyand, M.O., Sohler, C.A.: Encoding a triangulation as a permutation of its point set. In: Proc. 9th Canadian Conf. on Computational Geometry, pp. 39–43 (1997)
García, A., Noy, M., Tejel, J.: Lower bounds on the number of crossing-free subgraphs of K N . Comput.Geom.TheoryAppl. 16, 211–221 (2000)
Hurtadoand, F., Noy, M.: Counting triangulations of almost-convex polygons. Ars Combinatorica 45, 169–179 (1997)
Kaibeland, V., Ziegler, G.: Counting lattice triangulations. In: Wensley, C.D. (ed.) British Combinatorial Surveys, Cambridge University Press, Cambridge (2003)
Matoušek, J., Valtr, P., Welzl, E.: On two encodings of lattice triangulations. Manuscript (2006)
McShineand, L., Tetali, P.: On the mixing time of the triangulation walk and other Catalan structures. In: Pardalos, P.M., Rajasekaran, S., Rolim, J. (eds.) DIMACS-AMS volume on Randomization Methods in Algorithm Design. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 43, pp. 147–160 (1998)
Molloy, M., Reed, B., Steiger, W.: On the mixing rate of the triangulation walk. In: Pardalos, P.M., Rajasekaran, S., Rolim, J. (eds.) DIMACS-AMS volume on Randomization Methods in Algorithm Design. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 43, pp. 179–190 (1998)
Orevkov, S.Y.: A symptotic number of triangulations in Z2. J. Combinat. Theory Ser. A 86, 200–203 (1999)
Pólya, G.: On picture-writing. The American Mathematical Monthly 63, 689–697 (1956), Also in: Alexanderson, G.L.: The Random Walks of George Pólya, MAA, 2000
Sharir, M., Welzl, E.: Random triangulations of planar point sets. In: Proc. 22nd Ann. ACM Symp. on Computational Geometry, pp. 273–281. ACM, New York (2006)
Santos, F., Seidel, R.: A better upper bound on the number of triangulations of a planar point set. J. Combinat. Theory Ser. A 102, 186–193 (2003)
Seidel, R.: On the number of triangulations of planar point sets. Combinatorica 18, 297–299 (1998)
Smith, W.S.: Studies in Computational Geometry Motivated by Mesh Generation. Ph.D. Thesis, Princeton University (1989)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Welzl, E. (2007). The Number of Triangulations on Planar Point Sets. In: Kaufmann, M., Wagner, D. (eds) Graph Drawing. GD 2006. Lecture Notes in Computer Science, vol 4372. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70904-6_1
Download citation
DOI: https://doi.org/10.1007/978-3-540-70904-6_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-70903-9
Online ISBN: 978-3-540-70904-6
eBook Packages: Computer ScienceComputer Science (R0)