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. © Springer-Verlag Berlin Heidelberg 2007.
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for freeCite
CITATION STYLE
APA
Welzl, E. (2007). The number of triangulations on planar point sets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4372 LNCS, pp. 1–4). Springer Verlag. https://doi.org/10.1007/978-3-540-70904-6_1
Readers' Seniority
Readers' Discipline
