Name
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. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1080/00207160.2013.837894 | International Journal of Computer Mathematics |
Keywords | Field | DocType |
catalan number decomposition,convex polygon triangulation,hurtado–noy algorithm | Discrete mathematics,Mathematical optimization,Combinatorics,Polygon covering,Krein–Milman theorem,Convex polygon,Convex set,Affine-regular polygon,Star-shaped polygon,Polygon triangulation,Mathematics,Monotone polygon | Journal |
Volume | Issue | ISSN |
91 | 6 | 0020-7160 |
Citations | PageRank | References |
0 | 0.34 | 3 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Predrag S. Stanimirovic | 1 | 191 | 29.28 |
| Predrag V. Krtolica | 2 | 0 | 0.34 |
| Muzafer H. Saračević | 3 | 8 | 2.27 |
| Sead H. Mašović | 4 | 0 | 0.34 |