Paper Info
Title
Convex polygon triangulation based on planted trivalent binary tree and ballot problem
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.
Year
DOI
Venue
2019
10.3906/elk-1805-143
TURKISH JOURNAL OF ELECTRICAL ENGINEERING AND COMPUTER SCIENCES
Keywords
DocType
Volume
Computational geometry,triangulation,Catalan number,planted trivalent binary tree,ballot notation
Journal
27
Issue
ISSN
Citations 
1.0
1300-0632
0
PageRank 
References 
Authors
0.34
0
2
Name
Order
Citations
PageRank
Muzafer H. Saračević182.27
Aybeyan Selimi200.34