1 research outputs found
A QPTAS for the Base of the Number of Triangulations of a Planar Point Set
The number of triangulations of a planar n point set is known to be ,
where the base lies between and The fastest known algorithm
for counting triangulations of a planar n point set runs in time.
The fastest known arbitrarily close approximation algorithm for the base of the
number of triangulations of a planar n point set runs in time subexponential in
We present the first quasi-polynomial approximation scheme for the base of
the number of triangulations of a planar point set