paper

Counting Polygon Triangulations is Hard

arXiv:1903.04737 · doi:10.1007/s00454-020-00251-7

Abstract

We prove that it is -complete to count the triangulations of a (non-simple) polygon.

arXiv comment24 pages, 11 figures. Expanded version of a paper from Proc. 35th International Symposium on Computational Geometry

References in corpus (3)

Cited by in corpus (3)