Abstract
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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.