Counting Triangulations of Configurations

Abstract

After defining convex near-polygons, a formula enumerating the number of triangulations of such configurations is derived in terms of edge-polynomials. The paper describes also a transfer-matrix approach for computing quantities related to triangulations.

References in corpus (2)

• A better upper bound on the number of triangulations of a planar point set
• An Upper Bound for the Number of Planar Lattice Triangulations