On typical triangulations of a convex n-gon

DOI10.4310/JOC.2021.V12.N3.A2MaRDI QIDQ2041702zbMATH OpenFDO

Authors Toufik Mansour, Reza Rastegar

Publication date 23 July 2021

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

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

zbMATH Keywords

convex polygonrandom triangulation

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Trees (05C05) Lattices and convex bodies in (2) dimensions (aspects of discrete geometry) (52C05) Combinatorial complexity of geometric structures (52C45) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Properties of random triangulations and trees
• Computing and Combinatorics
• Counting triangulations of some classes of subdivided convex polygons
• On properties of random dissections and triangulations
• On degrees in random triangulations of point sets

Cited in

(5)

• Properties of random triangulations and trees
• Forced convex n-gons in the plane
• scientific article; zbMATH DE number 6938032 (Why is no real title available?)
• On typical triangulations of a convex n-gon
• On properties of random dissections and triangulations

This page was built for publication: On typical triangulations of a convex \(n\)-gon

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2041702)