On the Number of Pseudo-Triangulations of Certain Point Sets
Combinatorics
2009-07-07 v2
Abstract
We pose a monotonicity conjecture on the number of pseudo-triangulations of any planar point set, and check it on two prominent families of point sets, namely the so-called double circle and double chain. The latter has asymptotically pointed pseudo-triangulations, which lies significantly above the maximum number of triangulations in a planar point set known so far.
Keywords
Cite
@article{arxiv.math/0601747,
title = {On the Number of Pseudo-Triangulations of Certain Point Sets},
author = {Oswin Aichholzer and David Orden and Francisco Santos and Bettina Speckmann},
journal= {arXiv preprint arXiv:math/0601747},
year = {2009}
}
Comments
31 pages, 11 figures, 4 tables. Not much technical changes with respect to v1, except some proofs and statements are slightly more precise and some expositions more clear. This version has been accepted in J. Combin. Th. A. The increase in number of pages from v1 is mostly due to formatting the paper with "elsart.cls" for Elsevier