Post has attachment
[1404.0261] Counting Triangulations and other Crossing-Free Structures Approximately
Abstract: We consider the problem of counting straight-edge triangulations of a given set $P$ of $n$ points in the plane. Until very recently it was not known whether the exact number of triangulations of $P$ can be computed asymptotically faster than by enumerating all triangulations.
Add a comment...
4 plus ones
Wait while more posts are being loaded