Counting Polygon Triangulations is Hard
Computational Geometry
2020-12-07 v2 Computational Complexity
Abstract
We prove that it is -complete to count the triangulations of a (non-simple) polygon.
Cite
@article{arxiv.1903.04737,
title = {Counting Polygon Triangulations is Hard},
author = {David Eppstein},
journal= {arXiv preprint arXiv:1903.04737},
year = {2020}
}
Comments
24 pages, 11 figures. Expanded version of a paper from Proc. 35th International Symposium on Computational Geometry