80
Views
3
CrossRef citations to date
0
Altmetric
Articles

Generating strictly binary trees at random based on convex polygon triangulations

&
Pages 445-452 | Received 06 Jan 2014, Accepted 22 Dec 2014, Published online: 03 Feb 2015

References

  • M.D. Atkinson and J.R. Sack, Generating binary trees at random, Inform. Process. Lett. 41(1) (1992), pp. 21–23.
  • M. de Berg, O. Cheong, M. van Kreveld, and M. Overmars, Computational Geometry, Springer, Berlin Heidelberg, 2000. doi: 10.1007/978-3-662-04245-8
  • E. Mäkinen, Generating random binary trees—A survey, Inform. Sci. 115(1) (1999), pp. 123–136.
  • H.W. Martin and B.J. Orr, A random binary tree generator, Proceedings of the 17th Annual Computer Science Conference, ACM, 1989, pp. 33–38.
  • M. Solomon and R.A. Finkel, A note on enumerating binary trees, J. ACM. 27(1) (1980), pp. 3–5.
  • D. Zerling, Generating binary trees using rotations, J. ACM. 32(3) (1985), pp. 694–701.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.