Counting triangulations of some classes of subdivided convex polygons

DOI10.1016/j.ejc.2016.12.002zbMath1359.05006arXiv1604.02870OpenAlexW2963569915MaRDI QIDQ518180

Andrei Asinowski, Toufik Mansour, Christian Krattenthaler

Publication date: 28 March 2017

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1604.02870

zbMATH Keywords

triangulationscomputational geometry

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of finite geometries (05B25)

Related Items (2)

Hamiltonian triangular refinements and space-filling curves ⋮ Orbiting triangle method for convex polygon triangulation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Flipping edges in triangulations
• A better upper bound on the number of triangulations of a planar point set
• A lower bound on the number of triangulations of planar point sets
• On the number of plane geometric graphs
• Bounds on the Maximum Multiplicity of Some Common Geometric Graphs
• An improved lower bound on the minimum number of triangulations
• Operator Methods and Lagrange Inversion: A Unified Approach to Lagrange Formulas

This page was built for publication: Counting triangulations of some classes of subdivided convex polygons