Generating strictly binary trees at random based on convex polygon triangulations

DOI10.1080/00207160.2014.1002780MaRDI QIDQ2804906zbMATH OpenOpenAlexFDO

Authors 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 treeconvex polygon triangulationdiagonaledgenoderecursive algorithmstrictly binary tree

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)

Recommendations

• Properties of random triangulations and trees
• Computing and Combinatorics
• The generation of binary trees as a numerical problem
• Generating triangulations at random
• Fast random generation of binary, t-ary and other types of trees

Cites work

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

Cited in

(4)

• Generating binary trees by Glivenko classes on Tamari lattices
• Properties of random triangulations and trees
• Generating and enumerating digitally convex sets of trees
• Orbiting triangle method for convex polygon triangulation

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

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