Generating strictly binary trees at random based on convex polygon triangulations

DOI10.1080/00207160.2014.1002780zbMath1338.05045OpenAlexW1965880317MaRDI QIDQ2804906

Jing Yu, Zili Tang

Publication date: 6 May 2016

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207160.2014.1002780

zbMATH Keywords

binary treerecursive algorithmedgediagonalnodestrictly binary treeconvex polygon triangulation

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Triangulation and topological properties of semi-analytic andsubanalytic sets, and related questions (32B25)

Related Items (1)

Orbiting triangle method for convex polygon triangulation

Cites Work

• Generating binary trees at random
• Generating random binary trees -- a survey
• Generating binary trees using rotations

This page was built for publication: Generating strictly binary trees at random based on convex polygon triangulations