## 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 behaviour of these numbers as k and/or r tend

to infinity. We connect these results with the question of finding the planar set of

n points in general position that has the minimum possible number of triangulations.

is subdivided by r − 1 points. We find explicit formulas and generating functions,

and we determine the asymptotic behaviour of these numbers as k and/or r tend

to infinity. We connect these results with the question of finding the planar set of

n points in general position that has the minimum possible number of triangulations.

Original language | English |
---|---|

State | Published - 2016 |

Event | 10th edition of the Jornadas de Matematica Discreta y Algoritmica, JMDA2016 - Duration: 1 Jan 2016 → … |

### Conference

Conference | 10th edition of the Jornadas de Matematica Discreta y Algoritmica, JMDA2016 |
---|---|

Period | 1/01/16 → … |

## Keywords

- Triangulations
- asymptotic analysis
- generating functions

## All Science Journal Classification (ASJC) codes

- Discrete Mathematics and Combinatorics
- Applied Mathematics