On Numbers of Pseudo-Triangulations
Preprint
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.45^N)$ and $\Omega (2.41^N)$ for the maximum number of pointed pseudo-triangulations that can be contained in a specific triangulation over a set of $N$ points. For the number of all pseudo-triangulations contained in a triangulation we derive the bounds $O^*(6.54^N)$ and $\Omega (3.30^N)$. We also prove that $O^*(89.1^N)$ pointed pseudo-triangulations can be embedded over any specific set of $N$ points in the plane, and at most $120^N$ general pseudo-triangulations.
Keywords
All Related Versions
This publication has 9 references indexed in Scilit:
- On degrees in random triangulations of point setsJournal of Combinatorial Theory, Series A, 2011
- Counting Triangulations of Planar Point SetsThe Electronic Journal of Combinatorics, 2011
- On the number of pseudo-triangulations of certain point setsJournal of Combinatorial Theory, Series A, 2008
- On the Number of Plane Geometric GraphsGraphs and Combinatorics, 2007
- Erratum to "Pseudo-Triangulations, Rigidity and Motion Planning"Discrete & Computational Geometry, 2006
- On the Number of Crossing‐Free Matchings, Cycles, and PartitionsSIAM Journal on Computing, 2006
- Planar minimally rigid graphs and pseudo-triangulationsComputational Geometry, 2005
- Crossing-Free Subgraphs1982
- On graphs and rigidity of plane skeletal structuresJournal of Engineering Mathematics, 1970