Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
5777426 | European Journal of Combinatorics | 2017 | 23 Pages |
Abstract
We compute the number of triangulations of a convex k-gon each of whose sides is subdivided by râ1 points. We find explicit formulas and generating functions, and we determine the asymptotic behavior of these numbers as k and/or r tend to infinity. We connect these results with the question of finding the planar set of points in general position that has the minimum possible number of triangulations - a well-known open problem from computational geometry.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Andrei Asinowski, Christian Krattenthaler, Toufik Mansour,