English

On Numbers of Pseudo-Triangulations

Computational Geometry 2012-10-29 v1 Discrete Mathematics Combinatorics

Abstract

We study the maximum numbers of pseudo-triangulations and pointed pseudo-triangulations that can be embedded over a specific set of points in the plane or contained in a specific triangulation. We derive the bounds O(5.45N)O(5.45^N) and Ω(2.41N)\Omega (2.41^N) for the maximum number of pointed pseudo-triangulations that can be contained in a specific triangulation over a set of NN points. For the number of all pseudo-triangulations contained in a triangulation we derive the bounds O(6.54N)O^*(6.54^N) and Ω(3.30N)\Omega (3.30^N). We also prove that O(89.1N)O^*(89.1^N) pointed pseudo-triangulations can be embedded over any specific set of NN points in the plane, and at most 120N120^N general pseudo-triangulations.

Keywords

Cite

@article{arxiv.1210.7126,
  title  = {On Numbers of Pseudo-Triangulations},
  author = {Moria Ben-Ner and André Schulz and Adam Sheffer},
  journal= {arXiv preprint arXiv:1210.7126},
  year   = {2012}
}