关于某些点集的伪三角剖分数量
组合数学
2009-07-07 v2
摘要
我们提出关于任意平面点集伪三角剖分数量的单调性猜想，并在两类著名的点集族上验证该猜想，即所谓的双圆（double circle）与双链（double chain）。后者具有渐近地 个带点伪三角剖分（pointed pseudo-triangulations），这显著高于目前已知的平面点集三角剖分的最大数量。
引用
@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}
}
备注
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