Counting Polygon Triangulations is Hard

@inproceedings{Eppstein2019CountingPT,
  title={Counting Polygon Triangulations is Hard},
  author={David Eppstein},
  booktitle={SoCG},
  year={2019}
}
We prove that it is $\#\mathsf{P}$-complete to count the triangulations of a (non-simple) polygon. 

Figures from this paper

Existence and hardness of conveyor belts
TLDR
Any disjoint set of $n$ disks of arbitrary radii can be augmented by $O(n)$ "guide" disks so that the augmented system has a conveyor belt touching each disk exactly once, answering a conjecture of Demaine,Demaine, and Palop.

References

SHOWING 1-10 OF 49 REFERENCES
The Number of Triangulations on Planar Point Sets
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.
Note – On the Number of Triangulations of Planar Point Sets
n points in the plane is at most .
Embedding planar graphs on the grid
We show that each plane graph of order n 2 3 has a straight line embedding on the n-2 by n-2 grid. This embedding is computable in time O(n). A nice feature of the vertex-coordinates is that they
Hard enumeration problems in geometry and combinatorics
A number of natural enumeration problems in geometry and combinatorics are shown to be complete in the class # P introduced by Valiant. Among others this is established for the numeration of vertices
Every planar graph is the intersection graph of segments in the plane: extended abstract
TLDR
This paper proves a conjecture of Scheinerman that every planar graph is the intersection graph of some segments in the plane.
...
...