868
Views
6
CrossRef citations to date
0
Altmetric
Section B

Decomposition of Catalan numbers and convex polygon triangulations

, , &
Pages 1315-1328 | Received 09 Apr 2013, Accepted 16 Aug 2013, Published online: 29 Oct 2013
 

Abstract

In this paper we present a method for Catalan number decomposition in the expressions of the form (2+i). This method gives convex polygon triangulations in Hurtado–Noy ordering. Therefore, we made a relationship between the expressions and the ordering mentioned above. The corresponding algorithm for Catalan number decomposition is developed and implemented in Java, as well as the algorithm which generates convex polygon triangulations. At the end, we have provided the comparison of Hurtado's algorithm and our algorithm based on the decomposition method.

2010 AMS Subject Classifications:

Acknowledgements

The authors gratefully acknowledge support from the research project 174033 of the Serbian Ministry of Science.

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.