Counting triangulations of balanced subdivisions of convex polygons

Andrei Asinowski, Christain Krattenthaler, Toufik Mansour

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish
Pages (from-to)73-78
Number of pages6
JournalElectronic Notes in Discrete Mathematics
StatePublished - 1 Oct 2016

Bibliographical note

Publisher Copyright:
© 2016 Elsevier B.V.


  • Triangulations
  • asymptotic analysis
  • generating functions

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics


Dive into the research topics of 'Counting triangulations of balanced subdivisions of convex polygons'. Together they form a unique fingerprint.

Cite this