Convex polygon triangulation based on planted trivalent binary tree\\ and ballot problem

Authors

MUZAFER SARACEVIC
AYBEYAN SELİMİ

DOI

10.3906/elk-1805-143

Abstract

This paper presents a new technique of generation of convex polygon triangulation based on planted trivalent binary tree and ballot notation. The properties of the Catalan numbers were examined and their decomposition and application in developing the hierarchy and triangulation trees were analyzed. The method of storage and processing of triangulation was constructed on the basis of movements through the polygon. This method was derived from vertices and leaves of the planted trivalent binary tree. The research subject of the paper is analysis and comparison of a constructed method for solving of convex polygon triangulation problem with other methods and generating graphical representation. The application code of the algorithms was done in the Java programming language.

Keywords

Computational geometry, triangulation, Catalan number, planted trivalent binary tree, ballot notation

First Page

346

Last Page

361

Recommended Citation

SARACEVIC, MUZAFER and SELİMİ, AYBEYAN (2019) "Convex polygon triangulation based on planted trivalent binary tree\\ and ballot problem," Turkish Journal of Electrical Engineering and Computer Sciences: Vol. 27: No. 1, Article 26. https://doi.org/10.3906/elk-1805-143
Available at: https://journals.tubitak.gov.tr/elektrik/vol27/iss1/26