A QPTAS for the Base of the Number of Triangulations of a Planar Point Set
Abstract
The number of triangulations of a planar n point set is known to be cn, where the base c lies between 2.43 and 30. The fastest known algorithm for counting triangulations of a planar n point set runs in O*(2n) 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 n. We present the first quasi-polynomial approximation scheme for the base of the number of triangulations of a planar point set.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.